> > |
META TOPICPARENT |
name="SubmitCaseStudy" |
<--
This template controls both the look and functionality of case study topics.
You should not need to alter the layout, only edit the data using the form above.
Set the view and edit templates:
Comment out the next line to use the TWiki default view
Comment out the next line to use the TWiki default edit
-->
<--
This topic can only be changed by:
-->
Submitted: 20 Feb 2008
Application Areas: Telecommunications Networks
Contents
Problem Description
THE DATA FLOW PROBLEM
Adapted from a real-world problem
Many large companies are starting to centralise their data storage. Centralised data storage allows for increased efficiency of data storage resources, security of the data and reliability of the storage system. Storage Area Networks ("SANs") are a popular way to provide centralised storage. SANs connect servers and/or client machines (known as hosts) to the centralised data storage devices using a network of links (ethernet, fibre channel and/or SCSI cables), hubs and switches.
The problem facing network/storage engineers is how to build a cost-efficient, reliable SAN.
To answer this question, we must first consider the different components of this example SAN:
HOSTS
The hosts are web servers, application servers, client machines, etc. They have a number of port slots for network interface cards (NICs). Each slot has a specified port bandwidth capacity and a port cost (the cost of the NIC to put in the port slot).
DEVICES
The (storage) devices are disks, disk arrays, tape drives, etc. They have the same attributes as hosts, namely a number of port slots, port bandwidth capacity and port cost.
HUBS
Hubs are one type of aggregation point in a network. They can connect several other components (hosts, devices, switches). However, hubs are essentially loops and any flow going into a hub must visit all the links and ports connected to the hub before leaving to its destination.
This means that the overall hub bandwidth is restricted by the connections made to the hub (that is, the overall hub bandwidth is less than or equal to the minimum of the link bandwidths connected to it). Hubs have a number of port slots, a cost and an overall bandwidth capacity. Hubs come with their port slots preconfigured, i.e., no NIC cards need to be purchased, and the port bandwidth capacity is the same as the overall capacity (for the reason specified earlier).
SWITCHES
Switches are the other type of aggregation point in a network. Unlike hubs, switches route data intelligently, so each port operates independently. Switches have a number of port slots without NICs, so there is also a port cost for purchasing a NIC. Since the ports operate independently, their port slots have a port bandwidth capacity. There is also the cost of the entire switch to take into account.
LINKS
Finally, links are simply cables that connect one port (or NIC in a port slot) to another. They are typically ethernet, fibre channel or SCSI. Links have a cost and a bandwidth capacity.
MAXIMISING THROUGHPUT
A storage networking consultant has been provided with the following network diagram, with the bandwidth capacities shown. This network already exists, so all costs are zero.
His client wants to send 110 MB/s of data from each host to the devices. Where should they send the data?
The cost of a link reduces as its bandwidth capacity decreases. What is the lowest bandwidth capacity for the links in the network that will still support the 110 MB/s flow from the hosts?
Return to top
Problem Formulation
The formulation...
Return to top
Computational Model
The computational model...
Return to top
Results
The results...
Return to top
Conclusions
In conclusion...
Return to top
Student Tasks
STUDENT TASKS
The consultant has written some AMPL files to solve his problem. He has completed san.mod and san.dat , but could not complete his script file san.run (his incomplete version is attached, san_incomplete.run )
* san.mod
* san.dat
* san_incomplete.run
1. Complete the script file san.run to find the data flows and discover the lowest link capacity that supports the client's bandwidth. Write a management summary for your solutions.
EXTRA FOR EXPERTS' TASKS
1. The client now wants to know what is the maximum total bandwidth the network will support. Modify san.run to answer this question. Write a management summary for your solution.
What to hand in Your modified san.run file. Your new management summary.
Return to top
|*FORM FIELD ProblemDescription*|ProblemDescription|*THE DATA FLOW PROBLEM*
Adapted from a real-world problem
Many large companies are starting to centralise their data storage. Centralised data storage allows for increased efficiency of data storage resources, security of the data and reliability of the storage system. Storage Area Networks ("SANs") are a popular way to provide centralised storage. SANs connect servers and/or client machines (known as hosts) to the centralised data storage devices using a network of links (ethernet, fibre channel and/or SCSI cables), hubs and switches.
The problem facing network/storage engineers is how to build a cost-efficient, reliable SAN.
To answer this question, we must first consider the different components of this example SAN:
HOSTS
The hosts are web servers, application servers, client machines, etc. They have a number of port slots for network interface cards (NICs). Each slot has a specified port bandwidth capacity and a port cost (the cost of the NIC to put in the port slot).
DEVICES
The (storage) devices are disks, disk arrays, tape drives, etc. They have the same attributes as hosts, namely a number of port slots, port bandwidth capacity and port cost.
HUBS
Hubs are one type of aggregation point in a network. They can connect several other components (hosts, devices, switches). However, hubs are essentially loops and any flow going into a hub must visit all the links and ports connected to the hub before leaving to its destination.
This means that the overall hub bandwidth is restricted by the connections made to the hub (that is, the overall hub bandwidth is less than or equal to the minimum of the link bandwidths connected to it). Hubs have a number of port slots, a cost and an overall bandwidth capacity. Hubs come with their port slots preconfigured, i.e., no NIC cards need to be purchased, and the port bandwidth capacity is the same as the overall capacity (for the reason specified earlier).
SWITCHES
Switches are the other type of aggregation point in a network. Unlike hubs, switches route data intelligently, so each port operates inependently. Switches have a number of port slots without NICs, so there is also a port cost for purchasing a NIC. Since the ports operate independently, their port slots have a port bandwidth capacity. There is also the cost of the entire switch to take into account.
LINKS
Finally, links are simply cables that connect one port (or NIC in a port slot) to another. They are typically ethernet, fibre channel or SCSI. Links have a cost and a bandwidth capacity.
MAXIMISING THROUGHPUT
A storage networking consultant has been provided with the following network diagram, with the bandwidth capacities shown. This network already exists, so all costs are zero.
His client wants to send 110 MB/s of data from each host to the devices. Where should they send the data?
The cost of a link reduces as its bandwidth capacity decreases. What is the lowest bandwidth capacity for the links in the network that will still support the 110 MB/s flow from the hosts?
|
|*FORM FIELD StudentTasks*|StudentTasks|*STUDENT TASKS* ??? Mike to check this form???
The consultant has written some AMPL files to solve his problem. He has completed san.mod and san.dat , but could not complete his script file san.run . Note You should be able to cut-and-paste san.mod , san.dat and (the incomplete) san.run .
??? See san.mod, san.run, san.dat attachments ???
Complete this file
1. Complete this script file to find the data flows and discover the lowest link capacity that supports the client's bandwidth. Write a management summary for your solutions.
What to hand in Your completed san.run file. Your management summary.
2. Complete this script file to find the data flows and discover the lowest link capacity that supports the client's bandwidth. Write a management summary for your solutions.
What to hand in Your completed san.run file. Your management summary.
EXTRA FOR EXPERTS' TASKS
1. The client now wants to know what is the maximum total bandwidth the network will support. Modify san.run to answer this question. Write a management summary for your solution.
What to hand in Your modified san.run file. Your new management summary.
|
META FILEATTACHMENT |
attachment="san.dat.txt" attr="" comment="" date="1203420620" name="san.dat.txt" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.dat.txt" size="745" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.dat.txt" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san.mod.txt" attr="" comment="" date="1203420639" name="san.mod.txt" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.mod.txt" size="494" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.mod.txt" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san.run.txt" attr="" comment="" date="1203420655" name="san.run.txt" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.run.txt" size="218" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.run.txt" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san.jpg" attr="" comment="" date="1203420814" name="san.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.jpg" size="14943" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_devices.jpg" attr="" comment="" date="1203420839" name="san_devices.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_devices.jpg" size="20094" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_devices.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_hosts.jpg" attr="" comment="" date="1203420862" name="san_hosts.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hosts.jpg" size="17022" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hosts.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_hub_loop.jpg" attr="" comment="" date="1203420886" name="san_hub_loop.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hub_loop.jpg" size="16745" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hub_loop.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_hubs.jpg" attr="" comment="" date="1203420910" name="san_hubs.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hubs.jpg" size="21112" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_hubs.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_links.jpg" attr="" comment="" date="1203420933" name="san_links.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_links.jpg" size="22693" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_links.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_problem.jpg" attr="" comment="" date="1203420972" name="san_problem.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_problem.jpg" size="57896" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_problem.jpg" tmpFilename="" user="LaurenJackson" version="1" |
META FILEATTACHMENT |
attachment="san_switches.jpg" attr="" comment="" date="1203420998" name="san_switches.jpg" path="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_switches.jpg" size="23446" stream="C:\Users\Lauren Jackson\Documents\Desktop\Desktop stuff\Twiki\Twiki images\DataNetworkFlows\san_switches.jpg" tmpFilename="" user="LaurenJackson" version="1" |
|