Difference: DataNetworkFlows (1 vs. 9)

Revision 92009-09-07 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Line: 86 to 86
 
FORM FIELD CaseStudyType CaseStudyType DIYCaseStudy
FORM FIELD OperationsResearchTopics OperationsResearchTopics IntegerProgramming
FORM FIELD ApplicationAreas ApplicationAreas Telecommunications Networks
Changed:
<
<
|*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:

san.jpg

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).

san_hosts.jpg

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.

san_devices.jpg

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.

san_hub_loop.jpg

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).

san_hubs.jpg

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.

san_switches.jpg

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.

san_links.jpg

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.

san_problem.jpg

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 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:

san.jpg

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).

san_hosts.jpg

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.

san_devices.jpg

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.

san_hub_loop.jpg

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).

san_hubs.jpg

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.

san_switches.jpg

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.

san_links.jpg

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.

san_problem.jpg

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 ProblemFormulation ProblemFormulation The formulation...
FORM FIELD ComputationalModel ComputationalModel The computational model...
FORM FIELD Results Results The results...

Revision 82009-06-29 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Line: 92 to 92
 
FORM FIELD Results Results The results...
FORM FIELD Conclusions Conclusions In conclusion...
FORM FIELD ExtraForExperts ExtraForExperts
Changed:
<
<
|*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"
>
>
|*FORM FIELD StudentTasks*|StudentTasks|*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.

|
 
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"
Line: 104 to 101
 
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"
Added:
>
>
META FILEATTACHMENT attachment="san.mod" attr="" comment="" date="1246268493" name="san.mod" path="san.mod" size="487" stream="san.mod" tmpFilename="" user="BaseUserMapping_333" version="1"
META FILEATTACHMENT attachment="san.dat" attr="" comment="" date="1246268517" name="san.dat" path="san.dat" size="999" stream="san.dat" tmpFilename="" user="BaseUserMapping_333" version="1"
META FILEATTACHMENT attachment="san_incomplete.run" attr="" comment="" date="1246268544" name="san_incomplete.run" path="san_incomplete.run" size="233" stream="san_incomplete.run" tmpFilename="" user="BaseUserMapping_333" version="1"

Revision 72008-04-02 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Line: 40 to 40
  Return to top
Changed:
<
<

Computational Model

>
>

Computational Model

 

The computational model...

Line: 48 to 48
  Return to top
Changed:
<
<

Results

>
>

Results

 

The results...

Line: 56 to 56
  Return to top
Changed:
<
<

Conclusions

>
>

Conclusions

 

In conclusion...

Revision 62008-03-01 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Deleted:
<
<
<-- Ready to Review -->
 

Revision 52008-03-01 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Added:
>
>
<-- Ready to Review -->
 

Revision 42008-02-23 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"
Added:
>
>
<-- Under Construction -->
 

Revision 32008-02-20 - LaurenJackson

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"

Revision 22008-02-19 - LaurenJackson

Line: 1 to 1
 
META TOPICPARENT name="SubmitCaseStudy"

Revision 12008-02-19 - LaurenJackson

Line: 1 to 1
Added:
>
>
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:  
-->

Case Study: DataNetworkFlows

Submitted: 20 Feb 2008

Operations Research Topics: IntegerProgramming

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:

san.jpg

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).

san_hosts.jpg

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.

san_devices.jpg

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.

san_hub_loop.jpg

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).

san_hubs.jpg

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.

san_switches.jpg

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.

san_links.jpg

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.

san_problem.jpg

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

META FORM name="OpsRes.CaseStudyForm"
FORM FIELD Title Title DataNetworkFlows
FORM FIELD DateSubmitted DateSubmitted 20 Feb 2008
FORM FIELD OperationsResearchTopics OperationsResearchTopics IntegerProgramming
FORM FIELD ApplicationAreas ApplicationAreas Telecommunications Networks
|*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:

san.jpg

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).

san_hosts.jpg

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.

san_devices.jpg

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.

san_hub_loop.jpg

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).

san_hubs.jpg

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.

san_switches.jpg

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.

san_links.jpg

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.

san_problem.jpg

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 ProblemFormulation ProblemFormulation The formulation...
FORM FIELD ComputationalModel ComputationalModel The computational model...
FORM FIELD Results Results The results...
FORM FIELD Conclusions Conclusions In conclusion...
FORM FIELD ExtraForExperts ExtraForExperts
|*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"
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback