1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

In the name of God, The Beneficent, The Merciful
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Data and Computer Communications
Novembro 2003 Tabu search heuristic for partition coloring1/29 XXXV SBPO XXXV SBPO Natal, 4-7 de novembro de 2003 A Tabu Search Heuristic for Partition.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.
1 Routing and Wavelength Assignment in Wavelength Routing Networks.
Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks.
SMUCSE 8344 Optical Networks Introduction. SMUCSE 8344 Why Optical? Bandwidth Low cost ($0.30/yard) Extremely low error rate ( vs for copper.
Lecture: 4 WDM Networks Design & Operation
1 Short Overview of Dynamic Routing and Wavelength-Assigment in Survivable WDM Networks Carlos Simões 1,3 e Teresa Gomes 2,3 1 Escola Superior de Tecnologia.
A Waveband Switching Architecture and Algorithm for Dynamic Traffic IEEE Communications Letters, Vol.7, No.8, August 2003 Xiaojun Cao, Vishal Anand, Chunming.
New QoS Measures for Routing and Wavelength Assignment in WDM Networks Shi Zhong Xu and Kwan L. Yeung Dep. Of EE, The Univ. of Hong Kong ICC’2002.
AGH University of Science and Technology NOBEL WP2 Meeting, Berlin May QoS/GoS Routing in Optical Networks.
Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.
Routing Strategies Fixed Routing
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
2001 Winter CS215 Course Project Simulation Comparison of Routing Algorithms for Multicast with Bandwidth Reservation Zhihong Duan
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
The Maryland Optics Group Multi-Hop View: Interfaces not available between (s, d): Try to create multi-hop path. Link Selection: Local Optimization: Select.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
November 2001Dynamic Alternative Routing1 Yashar Ganjali Stanford University November 2001.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.
ECS H. Zang and B. Mukherjee, UC Davis 1 Routing and Wavelength Assignment for Wavelength-Routed WDM Networks  Combined routing and wavelength.
Path Protection in MPLS Networks Using Segment Based Approach.
1 Bandwidth Allocation Planning in Communication Networks Christian Frei & Boi Faltings Globecom 1999 Ashok Janardhanan.
S. Suri, M, Waldvogel, P. Warkhede CS University of Washington Profile-Based Routing: A New Framework for MPLS Traffic Engineering.
Interference-aware QoS Routing (IQRouting) for Ad-Hoc Networks Rajarshi Gupta, Zhanfeng Jia, Teresa Tung, and Jean Walrand Dept of EECS, UC Berkeley Globecom.
Data Communications and Networking
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Cost-Performance Tradeoffs in MPLS and IP Routing Selma Yilmaz Ibrahim Matta Boston University.
CSC 778 Presentation Waveband Switching Neil D’souza Jonathan Grice.
Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.
Network Aware Resource Allocation in Distributed Clouds.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Chapter 11 Wavelength Conversion. To establish a lightpath, we require that the same wavelength be allocated on all the links in the path. This requirement.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
Wavelength Assignment in Waveband Switching Networks with Wavelength Conversion Xiaojun Cao; Chunming Qiao; Anand, V. Jikai LI GLOBECOM '04. IEEE Volume.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Multi-layered Optical Network Security
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
1 Why Optical Layer Protection? Optical layer provides lightpath services to its client layers (e.g., SONET, IP, ATM) Protection mechanisms exist in the.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Traffic grooming in WDM Networks Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model by Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
GridNets 2006 – October 1 st Grid Resource Management by means of Ant Colony Optimization Gustavo Sousa Pavani and Helio Waldman Optical Networking Laboratory.
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
Survivability in IP over WDM networks YINGHUA YE and SUDHIR DIXIT Nokia Research Center, Burlington, Massachusetts.
Improving OBS Efficiency Li, Shuo, Meiqian Wang. Eric W. M. Wong, Moshe Zukerman City University of Hong Kong 1.
William Stallings Data and Computer Communications
Constraint-Based Routing
Zilong Ye, Ph.D. Optical Networking Zilong Ye, Ph.D.
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Distributed Control Plane
ISP and Egress Path Selection for Multihomed Networks
Frank Yeong-Sung Lin (林永松) Information Management Department
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Data and Computer Communications
The University of Adelaide, School of Computer Science
Frank Yeong-Sung Lin (林永松) Information Management Department
Chapter 10 RWA 2019/5/9.
Presentation transcript:

1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection departs Goal is to minimize connection blocking Solve the routing subproblem and the wavelength assignment subproblem separately

2 Routing Fixed routing Fixed-alternate routing Adaptive routing

3 Fixed Routing Always choose the same fixed route (calculated offline) for a given source- destination pair –E.g. shortest-path routing Advantage: simple Disadvantages: –High connection blocking –Unable to handle faults

4 Fixed-Alternate Routing Each node maintains an ordered list of a fixed set of routes to each destination node –E.g., k shortest-path routes Primary route: the first route in the list Alternate route: a route that does not share any links with the first route –Useful for fault tolerance

5 Fixed-Alternate Routing When a connection request arrives, the source node tries each of the routes in the list in sequence until a route with a valid wavelength assignment is found Advantages –Simple –Fault tolerance –Significantly reduce the connection blocking probability compared to fixed routing

6 Adaptive Routing Route is chosen based on the current network state Two approaches –Adaptive shortest-cost-path routing –Least-congested-path routing

7 Adaptive Shortest-Cost-Path Routing Use layered graph Link costs –1 for unused link –  for used link –c for wavelength conversion link When a connection request arrives, compute the shortest-cost path between source and destination Advantage: low blocking Disadvantage: nodes need update network state whenever a connection is setup/teardown

8 Least-Congested-Path (LCP) Routing For each s-d pair, a set of routes is predetermined When a connection request arrives, the least- congested path is chosen –Congestion on a link = # wavelengths available on the link Fewer available wavelength  more congested –Congestion on a path = congestion on the most congested link in the path Use shortest-path routing to break ties An alternative: give priority to shortest paths, use LCP to break ties

9 Wavelength Assignment Heuristics Assume fixed number of wavelengths Minimize overall blocking probability for all connection requests –Single-fiber networks: R, FF, LU, MU –Multi-fiber networks: MP, LL, M , RCL Protect multihop connections to achieve greater degree of fairness –Rsv, Thr

10 Wavelength Assignment Heuristics: Single-Fiber Case Random Wavelength Assignment (R): –Find all wavelengths available on the required route –Randomly choose one available wavelength First-Fit (FF) –Wavelengths are numbered –Choose the first available wavelength –Computation cost lower than R –Perform well in terms of blocking probability and fairness Both R and FF require no global knowledge

11 Wavelength Assignment Heuristics: Single-Fiber Case Least-Used (LU)/SPREAD –Choose the least used wavelength –Attempt to balance the load among all wavelengths –Favor short paths, not fair for long paths –Perform worse than random Most-Used (MU)/PACK –Choose the most used wavelength –Pack connections into fewer wavelengths –Slightly outperform FF Both LU and MU require global knowledge

12 Wavelength Assignment Heuristics: Multi-Fiber Case Min-Product (MP) –Goal: minimize # fibers by packing wavelengths into fibers –First compute for each wavelength j that is available on p –Choose the lowest numbered wavelength in the set of wavelengths that minimize the above value –Become FF in single-fiber networks –Perform worse than the multi-fiber version of FF (both fibers and wavelengths are ordered)

13 Wavelength Assignment Heuristics: Multi-Fiber Case Least-Loaded (LL) –Select the wavelength that has the largest residue capacity on the most loaded link along route p –Choose the minimum indexed wavelength j in S p that achieves –Become FF in single-fiber networks –Outperform MU and FF

14 Wavelength Assignment Heuristics: Multi-Fiber Case MAX-SUM (M  ) –Assume the set of possible connection requests is known in advance and the route for each connection is pre-selected –Attempt to maximize the remaining path capacities after lightpath establishment

15 Wavelength Assignment Heuristics: Multi-Fiber Case MAX-SUM (M  ) –  : a network state that specifies the routes and wavelength assignments of existing lightpaths –Link capacity r( , l, j) on link l and wavelength j in state  : # fibers on which wavelength j is unused on link l –Path capacity r( , p, j) on path p and wavelength j: # fibers on which wavelength j is available on the most congested link along path p –Path capacity of path p in state , R( , p): sum of path capacities on all wavelengths

16 Wavelength Assignment Heuristics: Multi-Fiber Case MAX-SUM (M  ) –  ’(j): the next state of the network if j is assigned to the connection –P: set of all potential paths for connection requests in the current state –Choose the wavelength j that maximizes –Equivalently, choose wavelength j that minimizes the total capacity loss on this wavelength, which is

17

18

19 Wavelength Assignment Heuristics: Multi-Fiber Case Relative Capacity Loss (RCL) –Improve on M  by taking into consideration # available alternate wavelengths for each potential future connection –RCL chooses wavelength j that minimizes the sum of the relative capacity loss on all the paths

20

21 Heuristics for Protecting Multihop Paths Longer lightpaths have a higher probability of getting blocked than shorter paths  want protect longer paths Proposed schemes: Rsv and Thr –Only specify whether the connection request can be assigned a wavelength under the current wavelength- usage conditions  must be combined with other wavelength assignment schemes –Achieve a greater degree of fairness

22 Heuristics for Protecting Multihop Paths Wavelength Reservation (Rsv) –A given wavelength on a specified link is reserved for a multihop traffic stream –Reduce blocking for multihop traffic while increasing the blocking for single-hop traffic Protecting Threshold (Thr) –A single-hop connection is assigned a wavelength only if the number of idle wavelengths on the link is at or above a given threshold.