Adaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks

Size: px
Start display at page:

Download "Adaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks"

Transcription

1 Adaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks Tibor Fabry-Asztalos, Nilesh Bhide and Krishna M. Sivalingam School of Electrical Engineering & Computer Science, Washington State University, Pullman, WA Abstract - Optical Dense Wavelength Division Multiplexed (DM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider the wide area wavelength routed backbone network with circuit-switching. Given a session request, the routing and wavelength assignment (RWA) problem is to calculate a path between two nodes, and also assign a set of wavelengths along this path. We use Dijkstra s shortest path algorithm, suitably modified for DM networks, for computing the shortest paths. We consider WDM aware weight functions which include factors such as available wavelengths per link, distance, and total wavelengths per link. We study and compare the performance of these weight functions in terms of blocking probability, link utilization and average delay. I. INTRODUCTION Optical Dense Wavelength Division Multiplexed DM, or simply, WDM networks avoid speed mismatch between slower electronic processing and faster optical transmission by providing multiple channels per fiber with each channel operating at electronic speeds [1]. WDM networks may be used in local, metropolitan, and wide area networks. This paper considers the wide area wavelength routed backbone environment, where the network is composed of wavelength routers connected by WDM links. The wavelength routers may possess wavelength conversion capability [1] that enables them to convert, in the optical domain, data on an incoming wavelength into another outgoing wavelength. The range of wavelength conversion may be full or limited depending on the physical device limitations. In this paper, we consider the circuit switched model where a lightpath is assigned to a session for its entire duration. A lightpath is defined as a set of links through intermediate routers from source to destination, with a wavelength assigned on each link. For networks without wavelength conversion, wavelength continuity is required which implies that the same wavelength has to be used on all links. In order to establish a lightpath, the network needs to decide on the route and the wavelength(s) for the lightpath. Given a set of connections, the problem of setting up lightpaths by The authors can be reached at nbhide@eecs.wsu.edu and krishna@eecs.wsu.edu. Part of the research was supported by Cisco Systems, San Jose, CA. Edge System Wavelength Router Routing Table Backbone Network Session Request Path Established Lightpath or Blocked Request Fig. 1. Sequence of establishing a lightpath for a session request. routing and assigning wavelength to each connection is called the Routing and Wavelength-Assignment (RWA) problem [2]. In this paper, we first determine the shortest path from source to destination using Dijkstra s algorithm, and then assign the wavelength. In Dijkstra s algorithm, every link in the network is associated with a weight, for example, the propagation delay of the link. The motivation behind this work is that WDM specific information may be incorporated in the weight functions to improve performance. We present weight functions that consider the number of available wavelengths and total wavelengths on a given link. We also present hop-count and distance-only weight functions for comparison. The performance of these weight functions is studied for randomly generated backbone topologies using discrete event simulation. The metrics of interest are call blocking probability (due to unavailability of wavelengths), link utilization and average delay. II. SHORTEST PATH ROUTING This section describes the approach to the solution of the RWA problem based on link state routing. Overview: The overall approach to the RWA problem is summarized in Fig. 1. It is based on the link state rout-

2 ing method [3]. Here, each router periodically broadcasts its neighboring link information to all other routers. This information is used to construct the network topology with the associated link cost functions. Each router then independently computes the shortest paths from itself to every destination. When a new session (i.e. circuit or burst) request arrives, the router uses the routing table to determine the entire path from source to destination. It then attempts to assign a wavelength along this path by propagating a wavelength request to all the routers along the path. The initial wavelength may be selected randomly from one of the available wavelengths or based on other information as in [4]. If wavelength conversion is available in the network, then a light-path can be established using different wavelengths on different links. If this request fails, a different wavelength is chosen, which can be based on the feedback from the closest node on the shortest path. This process may be repeated till there is at least one wavelength available. If this fails, then the request is blocked, i.e. the lightpath can not be set up. Routing Algorithm: The network topology is represented as a graph Î µ, where Î denotes the set of vertices (network nodes) and the set of edges (links). Each link µ ¾ is associated with a weight function Û which denotes the cost of using the link. At the end of executing a shortest path algorithm such as Dijkstra s algorithm, each router has a routing table with complete path information to every destination. Details of Dijkstra s algorithm may be found in [3]. In WDM networks, link state information will also include WDM specific status such as number of available wavelengths, and total wavelengths. In addition, links on which all wavelengths are presently utilized may be marked as unavailable until the next routing update. Weight functions that consider these factors are described in the next section. III. WEIGHT FUNCTIONS FOR WDM NETWORKS This section describes the weight functions that are studied in this paper. For a given link µ ¾, denotes the physical distance or equivalently propagation delay; denotes number of available wavelengths on the link when link state information was gathered; and Ì denotes number of total wavelengths on the link. Hop-based (): This represents the base case, and Û µ ¾. Using this function, the lightpaths are selected solely on the smallest number of hops on each lightpath. Intuitively, this scheme should result in lower blocking probability since less number of hops would increase the chances of finding a wavelength on all intermediate links. Distance (): Here, Û µ ¾, where represents the physical distance expressed in microseconds. This function will result in shortest distance paths with lowest propagation delay. Here, Û is specified as fol- Available wavelengths (): lows: Û ÐÓ, µ ¾, µ ¾ gives us the measure of resistance a link offers for establishing a session. More the number of available links, lesser is the resistance offered. Hence gives us a measure of willingness of a link to accept a session request. We want to maximize this willingness or reliability and hence the product of these terms for intermediate links has to be maximized. Due to additive nature of Dijkstra s algorithm, we use negative ÐÓ of this product as a weight function and equivalently try to minimize this value. This metric ignores both distance and hop count, and the performance section quantifies the higher hop count realized. This function is thus a dynamic weight function that changes with network state. Total wavelengths and Available wavelengths (T): Here, Û ÐÓ ¼ Ì µ ¾. Consider a link with and Ì as available and total number of wavelengths at a given point in time. Then the probability that all wavelengths will be used at some time in future can be written as Ô, where Ô is the probability that a wavelength will be used. From the current status, we can estimate this probability to be, Ô Ì. Then the probability that at least one wavelength is available on the link in future is given by Ô µ. Therefore, when a path is composed of multiple links, we maximize the product of Ô µ value of all the constituent links that form this particular path. Due to additive nature of Dijkstra s algorithm, we use ÐÓ Ô µ as a weight function and equivalently try to minimize this value. This is a dynamic weight function due to the available wavelengths, which is constantly changing. Example: The choice of weight function makes a significant difference in the shortest path calculation. Taking the example shown in Fig. 2, it can be seen how the choice of the above described weight functions will result in different outcomes. In this example, the edges are labeled with a 3-tuple Ì µ, i.e. physical distances between nodes, available

3 (1,4,1) A B (2,2,4) (2,4,1) (1,4,1) E (2,4,8) (2,4,8) F G C (2,2,4) (1,4,1) (2,4,1) D ( ij, λ a T Legend : d ij, λ ij ) Fig. 2. Example of using different weight functions in Dijkstra s algorithm to find a shortest path between a pair of nodes. Links are labeled with physical distance, available wavelengths, and total wavelengths. wavelengths and total wavelengths. Suppose we want to determine a shortest path between the source node and the destination node. Table I lists the possible paths from node to node and the corresponding cost associated with these paths computed using different weight functions. From Table I, we TABLE I Operation of weight functions PATH Cost associated with weight function T A-B-C-D A-E-D A-F-D A-G-D can see that the weight function may choose any of the 2-hop paths from, and. The weight function will choose the path with the least distance of 3 though this is a 3-hop path which has higher chance of getting blocked. may choose any path from and. Both of these paths have maximum number of available wavelengths i.e. four. T will choose the path. Although the paths and have links with least utilization i.e. 5%, path has more total wavelengths and hence it is selected by T. T doesn t select path though it has more total wavelengths. This is due to fact that the utilization of the links in this path is 6% and higher the utilization of the link, higher is the chance of session request getting blocked over that link in future. IV. PERFORMANCE ANALYSIS We studied the performance of our algorithm based on discrete event simulation. The purpose of the paper is to study the impact of weight functions on the overall network utilization, blocking probability and average delay. A. Simulation environment The network topology considered is 25 node randomly generated network. This topology was randomly generated with an average degree of The maximum number of wavelengths are varied between 1, 2, and 3. The network traffic is generated in terms of connection requests from a source to destination node. The connection requests arriving at every node are assumed to follow Poisson distribution with mean connection requests per unit time. The connection duration is assumed to follow a exponential distribution with mean 3 time units. The system parameters varied are Ä: the number of wavelengths on each link, : the connection request arrival rate at every node and, : the wavelength conversion factor, which is modeled as the fraction of the number of wavelengths that can be converted to other wavelengths at every node. The absence of wavelength conversion is denoted by ¼, whereas denotes full wavelength conversion. A value between and 1 denotes partial wavelength conversion. The performance parameters are: Blocking probability (È), is the probability that a connection request is blocked due to unavailability of a lightpath. Utilization (Í), is given by the percentage of time that all links in the network are utilized. Average delay (), is the average delay experienced by the traffic pertaining to a session. It is composed of average propagation delay and average delay due to wavelength conversions at the intermediate nodes. B. Performance evaluation All the simulations were run for 1, 2 and 3 wavelengths per link. We describe the results for 1 and 2 wavelengths as results for 3 wavelengths show trends very much similar to the ones obtained for 1, 3 wavelengths. 1) È: Fig. 3, 4 are used to compare the performance of different weight functions for ¼ ¼., which minimizes number of hops in a route, gives the best performance. The function gives relatively low performance because the shortest path considers only distances. If we have two different paths between a pair of nodes and one of them has more hops, the path with least number of hops is expected to give better performance. This is because the possibility of blocking increases as we increase the number of links on which the lightpath has to find an available wavelength. The performance given by weight scheme is also relatively low. This may be due to the fact that results in choosing longer paths as the available number of wavelengths decrease over the shorter paths. This in turn results in increased blocking probability. The performance of the T weight scheme is almost identical to that of for medium to high traffic load. This can be attributed to the fact that this function tries to choose

4 .3 25 nodes / Nr. of wavelengths = nodes / Nr. of wavelengths = T T T.1 25 nodes / Nr. of wavelengths = nodes / Nr. of wavelengths = Fig. 3. Graphs showing È vs. Traffic load per node expressed in erlang. ¼: with 1 wavelengths, with 2 wavelengths Fig. 4. Graphs showing È vs. Traffic load per node expressed in erlang. ¼: with 1 wavelengths, with 2 wavelengths. links with minimum utilization and maximum available wavelengths. The blocking probability decreases by a small factor for full wavelength conversion in comparison to partial wavelength conversion with ¼. We can observe that blocking probability increases with increasing traffic load, which is as expected. Also overall blocking probability can be seen decreasing with increasing number of total wavelengths. 2) Utilization Í : We present the graph for link utilization in Fig. 5 with varying traffic load and ¼. With full wavelength conversion, similar trends were observed in system utilization. As in the earlier case, it can be observed that the best performance is provided by the T and weight schemes used in calculating the shortest paths. We can observe from the figures that at 1 wavelengths per link, the T and weight schemes give the highest utilization at high traffic load. This is due to the fact that at low number of wavelengths, the total ca- pacity per link is low. This capacity is better utilized by T and as low blocking probability offered by them results in greater number of sessions served. The other two schemes give lower utilization because of comparatively higher blocking probabilities resulting from their use, which ultimately result in lesser number of sessions served. Overall link utilization decreases as total wavelengths increase, adding extra capacity to the network. In this case utilization depends more on the average number of hops than the blocking probability. 3) Average Delay : We present the graph for average total delay in Fig. 6 with varying traffic load and ¼. With full wavelength conversion, similar trends were observed in total delay. The total delay consists of propagation delay and wavelength conversion delay. In our simulations we used a metric of ¼ ÐÒØ ms propagation delay for links and 2 ms wavelength conversion delay.

5 45 25 nodes / Nr. of wavelengths = nodes / Nr. of wavelengths = 1 Link Utilization (%) a) T Average Delay (ms) T 65 T nodes / Nr. of wavelengths = nodes / Nr. of wavelengths = Link Utilization (%) Average Delay (ms) b) Fig. 5. Graphs showing Link Utilization Í vs. Traffic load per node expressed in erlang. ¼: with 1 wavelengths, with 2 wavelengths Fig. 6. Graphs showing Average Total Delay vs. Traffic load per node expressed in erlang. ¼: with 1 wavelengths, with 2 wavelengths. As the traffic load increases, the blocking probability also increases. Hence connection establishment over longer paths becomes more difficult and average number of hops in a successful conncetion setup goes on decreasing. This results in decrease in total delay for successful connections and eventual saturation of total delay value. V. SUMMARY This paper studied the dynamic Routing and Wavelength Assignment problem in optical WDM networks. A circuitswitched network was studied where sessions are assigned lightpaths for the session duration. The problem of routing was studied using Dijkstra s algorithm, with weight functions that utilized WDM network characteristics. Different weight functions were studied and their performance was studied in terms of blocking probability, link utilization and average de- lay. Results indicate that the metric based on using lowest hop count and, combination of available wavelengths and total wavelengths resulted in best performance in terms of blocking probability. REFERENCES [1] K. Sivalingam and S. Subramanian, eds., Optical WDM Networks: Principles and Practice. Boston, MA: Kluwer Academic Publishers, 2. [2] H. Zang, J. P. Jue, and B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks, Optical Networks Magazine, vol. 1, pp. 47 6, Jan. 2. [3] L. Peterson and B. Davie, Computer Networks: A Systems Approach. Morgan Kaufman, [4] E. Karasan and E. Ayanoglu, Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM networks, IEEE/ACM Transactions on Networking, vol. 6, pp , Apr

Architecture and Analysis for providing Virtual Private Networks (VPN) with QoS over Optical WDM Networks

Architecture and Analysis for providing Virtual Private Networks (VPN) with QoS over Optical WDM Networks Architecture and Analysis for providing Virtual Private Networks (VPN) with QoS over Optical WDM Networks Yang Qin School of Electrical and Electronic Engineering Nanyang Technological University Singapore,

More information

n = 2 n = 2 n = 1 n = 1 λ 12 µ λ λ /2 λ /2 λ22 λ 22 λ 22 λ n = 0 n = 0 λ 11 λ /2 0,2,0,0 1,1,1, ,0,2,0 1,0,1,0 0,2,0,0 12 1,1,0,0

n = 2 n = 2 n = 1 n = 1 λ 12 µ λ λ /2 λ /2 λ22 λ 22 λ 22 λ n = 0 n = 0 λ 11 λ /2 0,2,0,0 1,1,1, ,0,2,0 1,0,1,0 0,2,0,0 12 1,1,0,0 A Comparison of Allocation Policies in Wavelength Routing Networks Yuhong Zhu a, George N. Rouskas b, Harry G. Perros b a Lucent Technologies, Acton, MA b Department of Computer Science, North Carolina

More information

A Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks

A Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks Proceedings of the International Conference on Computer and Communication Engineering 008 May 3-5, 008 Kuala Lumpur, Malaysia A Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks

More information

Sparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms

Sparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms Sparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms Sanjay K. Bose, SMIEEE, Y.N. Singh, MIEEE A.N.V.B. Raju Bhoomika Popat Department of Electrical

More information

RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths

RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, and Hyunseung Choo Lambda Networking Center School of Information

More information

A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization

A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization Víctor M. Aragón, Ignacio de Miguel, Ramón J. Durán, Noemí Merayo, Juan Carlos Aguado, Patricia Fernández,

More information

IO2654 Optical Networking. WDM network design. Lena Wosinska KTH/ICT. The aim of the next two lectures. To introduce some new definitions

IO2654 Optical Networking. WDM network design. Lena Wosinska KTH/ICT. The aim of the next two lectures. To introduce some new definitions IO2654 Optical Networking WDM network design Lena Wosinska KTH/ICT 1 The aim of the next two lectures To introduce some new definitions To make you aware about the trade-offs for WDM network design To

More information

ADAPTIVE LINK WEIGHT ASSIGNMENT AND RANDOM EARLY BLOCKING ALGORITHM FOR DYNAMIC ROUTING IN WDM NETWORKS

ADAPTIVE LINK WEIGHT ASSIGNMENT AND RANDOM EARLY BLOCKING ALGORITHM FOR DYNAMIC ROUTING IN WDM NETWORKS ADAPTIVE LINK WEIGHT ASSIGNMENT AND RANDOM EARLY BLOCKING ALGORITHM FOR DYNAMIC ROUTING IN WDM NETWORKS Ching-Lung Chang, Yan-Ying, Lee, and Steven S. W. Lee* Department of Electronic Engineering, National

More information

OPTICAL NETWORKS. Virtual Topology Design. A. Gençata İTÜ, Dept. Computer Engineering 2005

OPTICAL NETWORKS. Virtual Topology Design. A. Gençata İTÜ, Dept. Computer Engineering 2005 OPTICAL NETWORKS Virtual Topology Design A. Gençata İTÜ, Dept. Computer Engineering 2005 Virtual Topology A lightpath provides single-hop communication between any two nodes, which could be far apart in

More information

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,

More information

A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks

A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks Hwa-Chun Lin and Chun-Hsin Wang Abstract This paper shows that, for single-hop WDM networks, a multicast scheduling algorithm which always

More information

ROUTING AND WAVELENGTH ASSIGNMENT FOR SCHEDULED AND RANDOM LIGHTPATH DEMANDS: BIFURCATED ROUTING VERSUS NON-BIFURCATED ROUTING

ROUTING AND WAVELENGTH ASSIGNMENT FOR SCHEDULED AND RANDOM LIGHTPATH DEMANDS: BIFURCATED ROUTING VERSUS NON-BIFURCATED ROUTING ROUTING AND WAVELENGTH ASSIGNMENT FOR SCHEDULED AND RANDOM LIGHTPATH DEMANDS: BIFURCATED ROUTING VERSUS NON-BIFURCATED ROUTING Mohamed KOUBAA, Nicolas PUECH, and Maurice GAGNAIRE Telecom Paris - LTCI -

More information

Available online at ScienceDirect

Available online at   ScienceDirect Available online at www.sciencedirect.com ScienceDirect Procedia Technology 0 ( 0 ) 900 909 International Conference on Computational Intelligence: Modeling, Techniques and Applications (CIMTA-0) Multicast

More information

New QoS Measures for Routing and Wavelength Assignment in WDM Networks

New QoS Measures for Routing and Wavelength Assignment in WDM Networks New QoS Measures for Routing and Wavelength Assignment in WDM Networks Shi Zhong Xu and Kwan L. Yeung Department of Electrical & Electronic Engineering The University of Hong Kong Pokfulam, Hong Kong Abstract-A

More information

CHAPTER-III WAVELENGTH ROUTING ALGORITHMS

CHAPTER-III WAVELENGTH ROUTING ALGORITHMS CHAPTER-III WAVELENGTH ROUTING ALGORITHMS Introduction A wavelength routing (WR) algorithm selects a good route and a wavelength to satisfy a connection request so as to improve the network performance.

More information

Optical Communications and Networking 朱祖勍. Nov. 27, 2017

Optical Communications and Networking 朱祖勍. Nov. 27, 2017 Optical Communications and Networking Nov. 27, 2017 1 What is a Core Network? A core network is the central part of a telecommunication network that provides services to customers who are connected by

More information

Constraint-Based Loose Explicit Routing and Signaling for Inter- Domain Lightpath Provisioning in Wavelength Routed Optical Network

Constraint-Based Loose Explicit Routing and Signaling for Inter- Domain Lightpath Provisioning in Wavelength Routed Optical Network Constraint-Based Loose Explicit Routing and Signaling for Inter- Domain Lightpath Provisioning in Wavelength Routed Optical Network Shoib Siddiqui *a, Hussein.T. Mouftah a, Jing Wu b, Michel Savoie b a

More information

An Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks

An Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks An Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks Timothy Hahn, Shen Wan March 5, 2008 Montana State University Computer Science Department Bozeman,

More information

On-Line Routing in WDM-TDM Switched Optical Mesh Networks

On-Line Routing in WDM-TDM Switched Optical Mesh Networks On-Line Routing in WDM-TDM Switched Optical Mesh Networks Arun Vishwanath and Weifa Liang Department of Computer Science The Australian National University Canberra, ACT-0200, Australia Email: {arunv,wliang}@cs.anu.edu.au

More information

Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks

Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks Amit Shukla, L. Premjit Singh and Raja Datta, Dept. of Computer Science and Engineering, North Eastern Regional Institute

More information

An Algorithm for Traffic Grooming in WDM Mesh Networks with Dynamically Changing Light-Trees

An Algorithm for Traffic Grooming in WDM Mesh Networks with Dynamically Changing Light-Trees An Algorithm for raffic rooming in WDM Mesh Networks with Dynamically Changing Light-rees Xiaodong Huang, Farid Farahmand, and Jason P. Jue Department of Computer Science Department of Electrical Engineering

More information

Absolute QoS Differentiation in Optical Burst-Switched Networks

Absolute QoS Differentiation in Optical Burst-Switched Networks IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 9, NOVEMBER 2004 1781 Absolute QoS Differentiation in Optical Burst-Switched Networks Qiong Zhang, Student Member, IEEE, Vinod M. Vokkarane,

More information

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER 2003 1173 A Comprehensive Study on Next-Generation Optical Grooming Switches Keyao Zhu, Student Member, IEEE, Hui Zang, Member,

More information

Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]

Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China

More information

A Novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks

A Novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 2, APRIL 2003 285 A Novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks Hongyue Zhu, Student Member, IEEE, Hui Zang, Member,

More information

Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks

Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Jason P. Jue, Member, IEEE, and Biswanath Mukherjee, Member, IEEE Abstract Wavelength-division multiplexing

More information

Signal-Quality Consideration for Dynamic Connection Provisioning in All- Optical Wavelength-Routed Networks

Signal-Quality Consideration for Dynamic Connection Provisioning in All- Optical Wavelength-Routed Networks Signal-Quality Consideration for Dynamic Connection Provisioning in All- Optical Wavelength-Routed Networks Biswanath Mukherjee Professor of Computer Science, UC Davis mukherje@cs.ucdavis.edu Acknowledgement:

More information

n = 2 n = 1 µ λ n = 0

n = 2 n = 1 µ λ n = 0 A Comparison of Allocation Policies in Wavelength Routing Networks Yuhong Zhu, George N. Rouskas, Harry G. Perros Department of Computer Science, North Carolina State University Abstract We consider wavelength

More information

A Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks

A Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks A Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks Technical Report UTD/EE/4/2009 September 2009 Miguel Razo, Shreejith Billenahalli, Wanjun

More information

Delayed reservation decision in optical burst switching networks with optical buffers

Delayed reservation decision in optical burst switching networks with optical buffers Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of

More information

A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks

A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks Wojciech Molisz and Jacek Rak Gdansk University of Technology, G. Narutowicza 11/12, Pl-8-952 Gdansk, Poland

More information

Signaling schemes for distributed connection management in wavelength-routed optical mesh networks

Signaling schemes for distributed connection management in wavelength-routed optical mesh networks Signaling schemes for distributed connection management in wavelength-routed optical mesh networks Lu Shen, Xi Yang and Byrav Ramamurthy Department of Computer Science and Engineering University of Nebraska

More information

Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents

Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents Son-Hong Ngo 1, Xiaohong Jiang 1, Susumu Horiguchi 1, and Minyi Guo 2 1 Graduate School of Information Science, Japan Advanced

More information

Toward the joint design of electronic and optical layer protection

Toward the joint design of electronic and optical layer protection Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS

More information

A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing

A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing Mare Lole and Branko Mikac Department of Telecommunications Faculty of Electrical Engineering and Computing,

More information

Master s Thesis. Title. Supervisor Professor Masayuki Murata. Author Yuki Koizumi. February 15th, 2006

Master s Thesis. Title. Supervisor Professor Masayuki Murata. Author Yuki Koizumi. February 15th, 2006 Master s Thesis Title Cross-Layer Traffic Engineering in IP over WDM Networks Supervisor Professor Masayuki Murata Author Yuki Koizumi February 15th, 2006 Graduate School of Information Science and Technology

More information

Research Article Comparative Analysis of Routing and Wavelength Assignment Algorithms used in WDM Optical Networks

Research Article Comparative Analysis of Routing and Wavelength Assignment Algorithms used in WDM Optical Networks Research Journal of Applied Sciences, Engineering and Technology 7(13): 2646-2654, 2014 DOI:10.19026/rjaset.7.581 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:

More information

WDM Network Provisioning

WDM Network Provisioning IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the

More information

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,

More information

Multi-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures

Multi-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures Multi-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures Anna Urra, Eusebi Calle, and Jose L. Marzo Institute of Informatics and Applications (IIiA), University of Girona, Girona

More information

Teletraffic theory (for beginners)

Teletraffic theory (for beginners) Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles

More information

Performance Assessment of Wavelength Routing Optical Networks with Regular Degree-Three Topologies of Minimum Diameter

Performance Assessment of Wavelength Routing Optical Networks with Regular Degree-Three Topologies of Minimum Diameter Performance Assessment of Wavelength Routing Optical Networks with Regular Degree-Three Topologies of Minimum Diameter RUI M. F. COELHO 1, JOEL J. P. C. RODRIGUES 2, AND MÁRIO M. FREIRE 2 1 Superior Scholl

More information

Performance analysis of realistic optical time division multiplexed wavelength routed networks. Creative Commons: Attribution 3.0 Hong Kong License

Performance analysis of realistic optical time division multiplexed wavelength routed networks. Creative Commons: Attribution 3.0 Hong Kong License Title Performance analysis of realistic optical time division multiplexed wavelength routed networks Author(s) Li, CY; Li, G; Wai, PKA; Li, VOK Citation The 8th IEEE Annual Workshop on Computer Communications

More information

EXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS

EXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 69-72 EXAMINING OF RECONFIGURATION AND REROUTING APPROACHES: WDM NETWORKS Sushil Chaturvedi

More information

MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION

MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION B. CHIDHAMBARARAJAN a,1 K.KALAMANI a,2 N. NAGARAJAN b,2 S.K.SRIVATSA a,3 Department of Electronics and Communication

More information

A Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks

A Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks Tamkang Journal of Science and Engineering, Vol. 14, No. 1, pp. 81 89 (2011) 81 A Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks I-Shyan Hwang 1 *, San-Nan

More information

A New Architecture for Multihop Optical Networks

A New Architecture for Multihop Optical Networks A New Architecture for Multihop Optical Networks A. Jaekel 1, S. Bandyopadhyay 1 and A. Sengupta 2 1 School of Computer Science, University of Windsor Windsor, Ontario N9B 3P4 2 Dept. of Computer Science,

More information

Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization

Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization Ryan M. Garlick 1 and Richard S. Barr 2 1 CSE Dept., Southern Methodist University, Dallas, TX 75275 USA 2 EMIS Dept., Southern Methodist

More information

Deadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids

Deadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids Deadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids Hitesh Kulkarni, Arush Gadkar, and Vinod M. Vokkarane Department of Computer and Information Science University

More information

An Efficient Algorithm for Virtual-Wavelength-Path Routing Minimizing Average Number of Hops

An Efficient Algorithm for Virtual-Wavelength-Path Routing Minimizing Average Number of Hops An Efficient Algorithm for Virtual-Wavelength-Path Routing Minimizing Average Number of Hops Harsha V. Madhyastha Department of Computer Science and Engineering Indian Institute of Technology, Madras Chennai,

More information

Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks

Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks Balaji Palanisamy, T. Siva Prasad, N.Sreenath 1 Department of Computer Science & Engineering and Information technology Pondicherry

More information

Physical Layer: Multiplexing, Spectrum Spreading and Switching. Covers Chapters# 06 & 08 from Text Book

Physical Layer: Multiplexing, Spectrum Spreading and Switching. Covers Chapters# 06 & 08 from Text Book Physical Layer: Multiplexing, Spectrum Spreading and Switching Covers Chapters# 06 & 08 from Text Book 2 Multiplexing From Chapter#06 3 Multiplexing If bandwidth of a medium linking two devices is greater

More information

WDM Network Provisioning

WDM Network Provisioning IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the

More information

Comparing OSNR based Policies for an Adaptive-Alternative IA-RWA Algorithm Applied to All-Optical Networks

Comparing OSNR based Policies for an Adaptive-Alternative IA-RWA Algorithm Applied to All-Optical Networks 694 Comparing OSNR based Policies for an Adaptive-Alternative IA-RWA Algorithm Applied to All-Optical Networks Carmelo J. A. Bastos-Filho, Rodrigo C. L. Silva and Daniel A. R. Chaves, Polytechnic School

More information

Optical Wavelength Division Multiplexing (WDM) Network Simulator (OWns): Architecture and Performance Studies

Optical Wavelength Division Multiplexing (WDM) Network Simulator (OWns): Architecture and Performance Studies Optical Wavelength Division Multiplexing (WDM) Network Simulator (OWns): Architecture and Performance Studies Bo Wen, Nilesh M. Bhide, Ramakrishna K. Shenai, and Krishna M. Sivalingam Λ School of Electrical

More information

Efficient path protection using Bi-directional WDM transmission technology. Title

Efficient path protection using Bi-directional WDM transmission technology. Title Title Efficient path protection using Bi-directional WDM transmission technology Author(s) Li, J; Yeung, KL Citation Globecom - Ieee Global Telecommunications Conference, 2005, v. 4, p. 1910-1914 Issued

More information

QoS routing in DWDM Optical Packet Networks

QoS routing in DWDM Optical Packet Networks QoS routing in DWDM Optical Packet Networks W. Cerroni CNIT Bologna Research Unit, ITALY F. Callegati, G. Muretto, C. Raffaelli, P. Zaffoni DEIS University of Bologna, ITALY Optical Packet Switching (OPS)

More information

IMPLEMENTATION OF OPTICAL BURST SWITCHING FRAMEWORK IN PTOLEMY SIMULATOR

IMPLEMENTATION OF OPTICAL BURST SWITCHING FRAMEWORK IN PTOLEMY SIMULATOR IMPLEMENTATION OF OPTICAL BURST SWITCHING FRAMEWORK IN PTOLEMY SIMULATOR Shakeel Ahmad *, Sireen Malik ** Department of Communication Networks Hamburg University of Technology, Germany Email:{shakeel.ahmad,

More information

Dynamic Routing and Resource Assignment Algorithm in Sloted Optical Networks

Dynamic Routing and Resource Assignment Algorithm in Sloted Optical Networks TELKOMNIKA, Vol. 11, No. 4, April 2013, pp. 1813~1821 ISSN: 2302-4046 1813 Dynamic Routing and Resource Assignment Algorithm in Sloted Optical Networks Bisheng Quan* 1, Hui Li 2, Zichun Le 3 1,2,3 College

More information

Network Topology Control and Routing under Interface Constraints by Link Evaluation

Network Topology Control and Routing under Interface Constraints by Link Evaluation Network Topology Control and Routing under Interface Constraints by Link Evaluation Mehdi Kalantari Phone: 301 405 8841, Email: mehkalan@eng.umd.edu Abhishek Kashyap Phone: 301 405 8843, Email: kashyap@eng.umd.edu

More information

Maximization of Single Hop Traffic with Greedy Heuristics

Maximization of Single Hop Traffic with Greedy Heuristics Maximization of Single Hop Traffic with Greedy Heuristics Esa Hyytiä Networking Laboratory, HUT, Finland, email: esa@netlab.hut.fi, ABSTRACT Maximization of the single hop traffic has been proposed as

More information

QoS Provisioning in WDM Ring Networks with Tunable Transceivers

QoS Provisioning in WDM Ring Networks with Tunable Transceivers QoS Provisioning in WDM Ring Networks with Tunable Transceivers Ashok K. Turuk and Rajeev Kumar Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Kharagpur, WB 721

More information

A Comparison of Allocation Policies in Wavelength Routing Networks*

A Comparison of Allocation Policies in Wavelength Routing Networks* Photonic Network Communications, 2:3, 267±295, 2000 # 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. A Comparison of Allocation Policies in Wavelength Routing Networks* Yuhong Zhu, George

More information

Research on Control Routing Technology in Communication Network

Research on Control Routing Technology in Communication Network Appl. Math. Inf. Sci. 6 No. 1S pp. 129S-133S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. Research on Control Routing Technology

More information

Dynamic Wavelength Provisioning in DWDM-Based Optical Network

Dynamic Wavelength Provisioning in DWDM-Based Optical Network Dynamic Wavelength Provisioning in DWDM-Based Optical Network Abdallah Shami, Chadi Assi, and Mohammed Ali Dept. of Electrical Engineering; City College of the City University of New York, {shand, ass;'

More information

Module 8. Routing. Version 2 ECE, IIT Kharagpur

Module 8. Routing. Version 2 ECE, IIT Kharagpur Module 8 Routing Lesson 27 Routing II Objective To explain the concept of same popular routing protocols. 8.2.1 Routing Information Protocol (RIP) This protocol is used inside our autonomous system and

More information

DIVERSION: A Trade-Off Between Link and Path Protection Strategies

DIVERSION: A Trade-Off Between Link and Path Protection Strategies DIVERSION: A Trade-Off Between Link and Path Protection Strategies Srinivasan Ramasubramanian and Avinash S. Harjani Department of Electrical and Computer Engineering University of Arizona, Tucson, AZ

More information

Survivability with P-Cycle in WDM Networks

Survivability with P-Cycle in WDM Networks Survivability with P-Cycle in WDM Networks K. Aparna 1, P. Ramya Krishna 2 JNTUA College of Engineering, Pulivendula Abstract: In this paper we discuss about the Pre-Configured survivability schemes. Network

More information

An Efficient Mechanism for Dynamic Multicast Traffic Grooming in Overlay IP/MPLS over WDM Networks

An Efficient Mechanism for Dynamic Multicast Traffic Grooming in Overlay IP/MPLS over WDM Networks An Efficient Mechanism for Dynamic Multicast Traffic Grooming in Overlay IP/MPLS over WDM Networks Xiaojun Yu, Gaoxi Xiao, Tee Hiang Cheng School of Electric and Electronic Engineering, Nanyang Technological

More information

Vol. 6, No. 5 May 2015 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 6, No. 5 May 2015 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. Solutions of Routing and Wavelength Assignment in Wavelength Division Multiplexing Optical Network: A Survey Noha Alsulami, Mohamed Khamis Information Technology Department, Faculty of Computing & Information

More information

Optical networking technology

Optical networking technology 1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the

More information

DYNAMIC RECONFIGURATION OF LOGICAL TOPOLOGIES IN WDM-BASED MESH NETWORKS

DYNAMIC RECONFIGURATION OF LOGICAL TOPOLOGIES IN WDM-BASED MESH NETWORKS DYNAMIC RECONFIGURATION OF LOGICAL TOPOLOGIES IN WDM-BASED MESH NETWORKS Shinya Ishida Graduate School of Information Science and Technology, Osaka University Machikaneyama 1-32, Toyonaka, Osaka, 0-0043

More information

UNIT- 2 Physical Layer and Overview of PL Switching

UNIT- 2 Physical Layer and Overview of PL Switching UNIT- 2 Physical Layer and Overview of PL Switching 2.1 MULTIPLEXING Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. Figure

More information

Rollout Algorithms for Logical Topology Design and Traffic Grooming in Multihop WDM Networks

Rollout Algorithms for Logical Topology Design and Traffic Grooming in Multihop WDM Networks Rollout Algorithms for Logical Topology Design and Traffic Grooming in Multihop WDM Networks Kwangil Lee Department of Electrical and Computer Engineering University of Texas, El Paso, TX 79928, USA. Email:

More information

Automatic Service and Protection Path Computation - A Multiplexing Approach

Automatic Service and Protection Path Computation - A Multiplexing Approach Automatic Service and Protection Path Computation - A Multiplexing Approach Loay Alzubaidi 1, Ammar El Hassan 2, Jaafar Al Ghazo 3 1 Department of Computer Engineering & Science, Prince Muhammad bin Fahd

More information

CHAPTER 5 PROPAGATION DELAY

CHAPTER 5 PROPAGATION DELAY 98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,

More information

Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks

Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks Yukinobu Fukushima Graduate School of Information and Computer Science Osaka University, Japan 1 Background: Inter-Domain Wavelength-Routed

More information

Configuration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic

Configuration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic Configuration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic Anupam Soni and Yatindra Nath Singh anusoni@iitk.ac.in,ynsingh@iitk.ac.in. Abstract In Optical Burst Switching

More information

A Generalized Framework for Analyzing Time-Space Switched Optical Networks

A Generalized Framework for Analyzing Time-Space Switched Optical Networks R. SRINIVASAN AND A. K. SOMANI: A GENERALIZED FRAMEWORK FOR ANALYZING TIME-SPACE SWITCHED OPTICAL NETWORKS 1 A Generalized Framework for Analyzing Time-Space ed Optical Networks R. Srinivasan and Arun

More information

A Markov-based Reservation Algorithm for Wavelength. Assignment in All-optical Networks

A Markov-based Reservation Algorithm for Wavelength. Assignment in All-optical Networks A Markov-based Reservation Algorithm for Wavelength Assignment in All-optical Networks Wenhao Lin, Richard S. Wolff, Brendan Mumey Montana State University, Bozeman, MT 59717 (Phone) 406-994 7172 (Email

More information

Dynamic Routing and Resource Allocation in WDM Transport Networks

Dynamic Routing and Resource Allocation in WDM Transport Networks Dynamic Routing and Resource Allocation in WDM Transport Networks Jan Späth University of Stuttgart, Institute of Communication Networks and Computer Engineering (IND), Germany Email: spaeth@ind.uni-stuttgart.de

More information

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Fairness Example: high priority for nearby stations Optimality Efficiency overhead Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency

More information

A simple mathematical model that considers the performance of an intermediate node having wavelength conversion capability

A simple mathematical model that considers the performance of an intermediate node having wavelength conversion capability A Simple Performance Analysis of a Core Node in an Optical Burst Switched Network Mohamed H. S. Morsy, student member, Mohamad Y. S. Sowailem, student member, and Hossam M. H. Shalaby, Senior member, IEEE

More information

Performance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming

Performance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming Proc. of Int. Conf. on Emerging Trends in Engineering and Technology Performance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming Vikas Kaushik 1, R.S Chauhan 2 1 JMIT Radaur/ECE

More information

Prioritized Shufflenet Routing in TOAD based 2X2 OTDM Router.

Prioritized Shufflenet Routing in TOAD based 2X2 OTDM Router. Prioritized Shufflenet Routing in TOAD based 2X2 OTDM Router. Tekiner Firat, Ghassemlooy Zabih, Thompson Mark, Alkhayatt Samir Optical Communications Research Group, School of Engineering, Sheffield Hallam

More information

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University

More information

Energy-Efficient Traffic GroominginWDM Networks With Scheduled Time Traffic

Energy-Efficient Traffic GroominginWDM Networks With Scheduled Time Traffic JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 29, NO. 17, SEPTEMBER 1, 2011 2577 Energy-Efficient Traffic GroominginWDM Networks With Scheduled Time Traffic Shuqiang Zhang, Student Member, IEEE, Dong Shen, Student

More information

Performance Analysis of Routing Techniques in Networks

Performance Analysis of Routing Techniques in Networks International Journal of Scientific and Research Publications, Volume 2, Issue 9, September 2012 1 Performance Analysis of Routing Techniques in Networks J.Mahesh, M.Antony Kumar P.M.R.Engineering College

More information

Gain in prob. of success using FEC over non FEC Fraction of FEC (n k)/k

Gain in prob. of success using FEC over non FEC Fraction of FEC (n k)/k Optical Packet-Switching using Forward Error Correction Gaurav Agarwal, Jeff Danley and Rahul Shah gaurav,jdgt,rcshah}@eecs.berkeley.edu November 28, 2 Abstract Optical networking technology has experienced

More information

An Improved Multicast Routing Algorithm in Sparse Splitting WDM Networks

An Improved Multicast Routing Algorithm in Sparse Splitting WDM Networks Author manuscript, published in "ComManTel'01: International Conference on Computing, Management and Telecommunications Conference, Viet Nam (01)" An Improved Multicast Routing Algorithm in Sparse Splitting

More information

WAVELENGTH ASSIGNMENT FOR LIGHT-TREE PROTECTION IN WDM OPTICAL NETWORKS

WAVELENGTH ASSIGNMENT FOR LIGHT-TREE PROTECTION IN WDM OPTICAL NETWORKS WAVELENGTH ASSIGNMENT FOR LIGHT-TREE PROTECTION IN WDM OPTICAL NETWORKS Lan Kong, Lin Li, Jitender S. Deogun and Stephen D. Scott Dept. of Computer Science and Engineering, University of Nebraska, Lincoln,

More information

Resource Sharing for QoS in Agile All Photonic Networks

Resource Sharing for QoS in Agile All Photonic Networks Resource Sharing for QoS in Agile All Photonic Networks Anton Vinokurov, Xiao Liu, Lorne G Mason Department of Electrical and Computer Engineering, McGill University, Montreal, Canada, H3A 2A7 E-mail:

More information

WAVELENGTH-DIVISION multiplexed (WDM) optical

WAVELENGTH-DIVISION multiplexed (WDM) optical IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 9, NOVEMBER 2004 1823 A Dynamic Routing Algorithm With Load Balancing Heuristics for Restorable Connections in WDM Networks Lu Ruan, Member,

More information

TRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS

TRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS TRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS K.Pushpanathan 1, Dr.A.Sivasubramanian 2 1 Asst Prof, Anand Institute of Higher Technology, Chennai-603103 2 Prof &

More information

Traffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks

Traffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks Traffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks Ankitkumar N. Patel, Chengyi Gao, and Jason P. Jue Erik Jonsson School of Engineering and Computer Science The University

More information

Dynamic Routing and Wavelength Assignment Using First Policy Iteration

Dynamic Routing and Wavelength Assignment Using First Policy Iteration Dynamic Routing and Wavelength Assignment Using First Policy Iteration Esa Hyytiä and Jorma Virtamo Helsinki University of Technology Laboratory of Telecommunications Technology P.O.Box 3000, FIN-0 HUT,

More information

Some economical principles

Some economical principles Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have

More information

Distributed Clustering Method for Large-Scaled Wavelength Routed Networks

Distributed Clustering Method for Large-Scaled Wavelength Routed Networks Distributed Clustering Method for Large-Scaled Wavelength Routed Networks Yukinobu Fukushima Graduate School of Information Science and Technology, Osaka University - Yamadaoka, Suita, Osaka 60-08, Japan

More information

Simple Layout Algorithms To Maintain Network Connectivity Under Faults

Simple Layout Algorithms To Maintain Network Connectivity Under Faults Simple Layout Algorithms To Maintain Network Connectivity Under Faults Galen H. Sasaki 1 Department of Electrical, University of Hawaii 2540 Dole Street, Honolulu, HI 96822 USA Ching-Fong Su and David

More information

A NEW TRAFFIC AGGREGATION SCHEME IN ALL-OPTICAL WAVELENGTH ROUTED NETWORKS

A NEW TRAFFIC AGGREGATION SCHEME IN ALL-OPTICAL WAVELENGTH ROUTED NETWORKS A NEW TRAFFIC AGGREGATION SCHEME IN ALL-OPTICAL WAVELENGTH ROUTED NETWORKS Nizar Bouabdallah^'^, Emannuel Dotaro^ and Guy Pujolle^ ^Alcatel Research & Innovation, Route de Nozay, F-91460 Marcoussis, France

More information