graded channel reservation with path switching in ultra high capacity networks
DESCRIPTION
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks. Reuven Cohen, Niloofar Fazlollahi , David Starobinski ECE Dept., Boston University Gridnets Workshop 2006 San Jose, CA. Acknowledgements. US Department of Energy Dr. N. Rao, ORNL. Outlines. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/1.jpg)
Graded Channel Reservation with Path Switching in Ultra High
Capacity Networks
Reuven Cohen, Niloofar Fazlollahi, David Starobinski
ECE Dept., Boston University
Gridnets Workshop 2006San Jose, CA
![Page 2: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/2.jpg)
Acknowledgements
US Department of Energy Dr. N. Rao, ORNL
![Page 3: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/3.jpg)
Outlines
Advanced Channel Reservation Contributions Models and Algorithms Related work Variants Performance Evaluation Conclusion
![Page 4: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/4.jpg)
Motivation
Grid computation : Large Hadron Collider (LHC) at CERN
Exabytes (1018
bytes) → need for new
protocol to support huge file transfers
http://lhc.web.cern.ch/lhc/LHC_Experiments.htm
![Page 5: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/5.jpg)
Advanced Channel Reservation
Emergence of new protocol stack complements TCP/IP Properties: 1 - Users request resources for connection
in advance (bandwidth/duration, file size) 2 – Dedicated resources allocated by a
scheduler (centralized or replicated) 3 – Implemented directly on top of layer 2
![Page 6: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/6.jpg)
UltraScience Net
http://www.csm.ornl.gov/ultranet/
![Page 7: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/7.jpg)
ACR Challenges
Scheduling
Routing
Goal: maximum utilization of resources
EarliestShortest
A
B
![Page 8: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/8.jpg)
Graded Channel Reservation (GCR)Contributions: path grading multi-criteria path optimization (shortest,
earliest)
path switching connection can switch between paths
Complexity analysis (small polynomial) Performance evaluation
![Page 9: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/9.jpg)
ModelModel: G (V,E) V: {A, B, C} E: {AB, AC, BC}
requests:
response: (time,path) Objective: Highest grade path
A
B
C
SourceDestination BandwidthDuration
![Page 10: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/10.jpg)
Grading Example
Primary grading criterion: earliest path
Secondary grading criterion: Shortest Widest
![Page 11: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/11.jpg)
Example (Cont.) Thm:
GCR always returns the earliest time at which a path satisfying requested bandwidth B and duration T can be established between nodes s and d.
Return path with highest grade (e.g., earliest-shortest)
![Page 12: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/12.jpg)
GCR
Algorithm: Time slots: connection set up/ tear
down Steady state residual graph Graph intersection yes - highest grade path no – start from next slot Reserve bandwidths
BFS path search
![Page 13: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/13.jpg)
Related Work
Most closely related: Guerin & Orda, INFOCOM, 2000 Rao, Wing, Carter & Wu, IEEE ComSoc Mag.,
2005
Focus on single criterion optimization
No path switching Limited performance evaluation
![Page 14: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/14.jpg)
Advantage of path switching
A
CSlot 1: [1,1:30]
Slot 3: [4,8]
Slot 2: [1:30,4]
Request: (A,C) at time 2:00 pm, duration = 4 hours
B
A
C
B
A
C
B
A
C
B
Slot 3: [2,4]Slot 2: [1:30,2]
A
C
B
Slot 5: [6,8]Slot 4: [4,6]
![Page 15: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/15.jpg)
Variants to GCR
GCRswitch
Switch to best grade path available at each slot
![Page 16: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/16.jpg)
Reducing Path Switches
GCRminimum
Thm: GCRminimum returns the earliest path and minimizes number of path switches.
GCRlimitx
Heuristic: limits up to x switches
![Page 17: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/17.jpg)
Simulation measures & parameters
Performance measures:
1- average delay 2- saturation throughput Requests: (s,d,B,T)
Parameters: uniform source uniform or hot-spot destination uniform or 80/20 bandwidth exponential or heavy-tailed connection length
![Page 18: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/18.jpg)
Topologies
![Page 19: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/19.jpg)
Performance Evaluations
![Page 20: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/20.jpg)
Performance Evaluations
![Page 21: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/21.jpg)
Conclusion
Framework: grading & switching 1st and 2nd path optimization
important Path switching widely improves
performance
![Page 22: Graded Channel Reservation with Path Switching in Ultra High Capacity Networks](https://reader035.vdocuments.us/reader035/viewer/2022070411/568146ea550346895db422df/html5/thumbnails/22.jpg)
Future Work
Time window: simulating blocking probability
Cost of switching