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

Save this PDF as:
 WORD  PNG  TXT  JPG

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A Novel Optimization Method of Optical Network Planning. Wu CHEN 1, a

A Novel Optimization Method of Optical Network Planning. Wu CHEN 1, a A Novel Optimization Method of Optical Network Planning Wu CHEN 1, a 1 The engineering & technical college of chengdu university of technology, leshan, 614000,china; a wchen_leshan@126.com Keywords:wavelength

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

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

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

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

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

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

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

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

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

Capacity planning and.

Capacity planning and. 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

Dynamic service Allocation with Protection Path

Dynamic service Allocation with Protection Path www.ijcsi.org 115 Dynamic service Allocation with Protection Path Loay Alzubaidi Department of Computer Engineering & Science, Prince Muhammad bin Fahd University AL-Khobar, Saudi Arabia Abstract Path

More information

DYNAMIC ROUTING WITH PARTIAL INFORMATION IN MESH-RESTORABLE OPTICAL NETWORKS *

DYNAMIC ROUTING WITH PARTIAL INFORMATION IN MESH-RESTORABLE OPTICAL NETWORKS * DYNAMIC ROUTING WITH PARTIAL INFORMATION IN MESH-RESTORABLE OPTICAL NETWORKS * Murari Sridharan, R. Srinivasan and Arun K. Somani Dependable Computing & Networking Laboratory Department of Electrical and

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

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

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

Research Paper Available online at: Survey of Ip Routing Protocols

Research Paper Available online at:  Survey of Ip Routing Protocols Prachi Thakur Computer Science and Enginerring Baddi University. Himachal Pradesh, India Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and

More information

Flexible Bandwidth Provisioning in WDM Networks by Fractional Lambda Switching

Flexible Bandwidth Provisioning in WDM Networks by Fractional Lambda Switching Flexible Bandwidth Provisioning in WDM Networks by Fractional Lambda Switching Achille Pattavina, Donato Grieco Politecnico di Milano, Milano, Italy e-mail: pattavina@elet.polimi.it Yoram Ofek Synchrodyne

More information

Performance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks

Performance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks Performance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks Xin Yuan Rami Melhem Rajiv Gupta Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science

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, Hiroaki Harai, Shin ichi Arakawa, and Masayuki Murata Graduate School of Information Science and Technology,

More information

Splitter Placement in All-Optical WDM Networks

Splitter Placement in All-Optical WDM Networks plitter Placement in All-Optical WDM Networks Hwa-Chun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN heng-wei Wang Institute of Communications Engineering National

More information

We will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing

We will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing In this lecture we will discuss about Routing algorithms Congestion algorithms Lecture 19 The routing algorithm is that part of the network layer software, which is responsible for deciding which output

More information

A Comparison of Path Protections with Availability Concern in WDM Core Network

A Comparison of Path Protections with Availability Concern in WDM Core Network A Comparison of Path Protections with Availability Concern in WDM Core Network M. A. Farabi Photonic Technology Lab, Universiti Teknologi, S. M. Idrus Member, IEEE Photonic Technology Lab, Universiti Teknologi,

More information

Capacity planning and.

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

More information

Dynamic Wavelength Assignment for WDM All-Optical Tree Networks

Dynamic Wavelength Assignment for WDM All-Optical Tree Networks Dynamic Wavelength Assignment for WDM All-Optical Tree Networks Poompat Saengudomlert, Eytan H. Modiano, and Robert G. Gallager Laboratory for Information and Decision Systems Massachusetts Institute of

More information

Effect of Link Bandwidth, Number of Channels and Traffic Load on Designing Optical Burst Switching Networks

Effect of Link Bandwidth, Number of Channels and Traffic Load on Designing Optical Burst Switching Networks Effect of Link Bandwidth, Number of Channels and Traffic Load on Designing Optical Burst Switching Networks Wael Hosny 1 (drwaelhosny@aast.edu), Mohamed M. Ali 1 (m.mahmoud@aast.edu), Moustafa H. Aly 1*

More information

Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols

Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols

More information

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network Evaluating the Performance of Mobile Agent-Based Communication among Mobile Hosts in Large Ad Hoc Wireless Network S. Bandyopadhyay Krishna Paul PricewaterhouseCoopers Limited Techna Digital Systems Sector

More information

A Review of Traffic Management in WDM Optical Networks: Progress and Challenges

A Review of Traffic Management in WDM Optical Networks: Progress and Challenges www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 6 Issue 8 August 2017, Page No. 22309-22313 Index Copernicus value (2015): 58.10 DOI: 10.18535/ijecs/v6i8.13

More information

Performance Analysis of the Signaling Channels of OBS Switches

Performance Analysis of the Signaling Channels of OBS Switches 296 Performance Analysis of the ignaling Channels of OB witches Hulusi YAHYAGİL A.Halim ZAİM M.Ali AYDIN Ö.Can TURNA İstanbul University, Computer Engineering Department, Avcılar İstanbul, TURKEY Abstract

More information

Performance of Optical Burst Switching Techniques in Multi-Hop Networks

Performance of Optical Burst Switching Techniques in Multi-Hop Networks Performance of Optical Switching Techniques in Multi-Hop Networks Byung-Chul Kim *, You-Ze Cho *, Jong-Hyup Lee **, Young-Soo Choi **, and oug Montgomery * * National Institute of Standards and Technology,

More information

Traffic Grooming in WDM Networks

Traffic Grooming in WDM Networks TOPICS IN LIGHTWAVE SERIES Traffic Grooming in Networks Eytan Modiano, MIT Philip J. Lin, Tellabs ABSTRACT The recent emergence of wavelength-division multiplexing technology has led to a tremendous increase

More information

Flexible Advance Reservation Models for Virtual Network Scheduling

Flexible Advance Reservation Models for Virtual Network Scheduling Flexible Advance Reservation Models for Virtual Network Scheduling H. Bai 1, F. Gu 2, K. Shaban 3,J. Crichigno 4, S. Khan 5, N. Ghani 1 1 Univ. of South Florida, 2 VMware Inc, 3 Qatar Univ., 4 Northern

More information

1158 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 4, AUGUST Coding-oblivious routing implies that routing decisions are not made based

1158 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 4, AUGUST Coding-oblivious routing implies that routing decisions are not made based 1158 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 4, AUGUST 2010 Network Coding-Aware Routing in Wireless Networks Sudipta Sengupta, Senior Member, IEEE, Shravan Rayanchu, and Suman Banerjee, Member,

More information

Routing and Traffic Engineering in Hybrid RF/FSO Networks*

Routing and Traffic Engineering in Hybrid RF/FSO Networks* Routing and Traffic Engineering in Hybrid RF/FSO Networks* Abhishek Kashyap and Mark Shayman Department of Electrical and Computer Engineering, University of Maryland, College Park MD 20742 Email: {kashyap,

More information

End-To-End Signaling and Routing for Optical IP Networks

End-To-End Signaling and Routing for Optical IP Networks End-To-End Signaling and Routing for Optical IP Networks Mark Joseph Francisco, Lambros Pezoulas, Changcheng Huang, Ioannis Lambadaris Carleton University Department of Systems and Computer Engineering

More information

William Stallings Data and Computer Communications. Chapter 10 Packet Switching

William Stallings Data and Computer Communications. Chapter 10 Packet Switching William Stallings Data and Computer Communications Chapter 10 Packet Switching Principles Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection

More information

Course Details. Optical Networks. Grading. Course References. Outline of Course. Course Project. Jason Jue The University of Texas at Dallas

Course Details. Optical Networks. Grading. Course References. Outline of Course. Course Project. Jason Jue The University of Texas at Dallas Course Details Optical Networks Jason Jue The University of Texas at Dallas Instructor: Jason Jue E-mail: jjue@utdallas.edu URL: http://www.utdallas.edu/~jjue/optical/ Lectures: Thursday 2-5 pm Course

More information

MWPG - AN ALGORITHM FOR WAVELENGTH REROUTING

MWPG - AN ALGORITHM FOR WAVELENGTH REROUTING MWPG - AN ALGORITHM FOR WAVELENGTH REROUTING Student Lecture Mohammed Pottayil 05-07-03 1 1 OUTLINE Review of Wavelength Rerouting Concepts - What is Wavelength Rerouting - Lightpath Migration operations

More information

I R TECHNICAL RESEARCH REPORT. A Local Optimization Algorithm for Logical Topology Design and Traffic Grooming in IP over WDM Networks

I R TECHNICAL RESEARCH REPORT. A Local Optimization Algorithm for Logical Topology Design and Traffic Grooming in IP over WDM Networks TECHNICAL RESEARCH REPORT A Local Optimization Algorithm for Logical Topology Design and Traffic Grooming in IP over WDM Networks by Kwang-Il Lee, Mark Shayman TR 2003-3 I R INSTITUTE FOR SYSTEMS RESEARCH

More information

Design of CapEx-Efficient IP-over-WDM Network using Auxiliary Matrix based Heuristic

Design of CapEx-Efficient IP-over-WDM Network using Auxiliary Matrix based Heuristic IEEE ANTS 2014 1570023335 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 60 61 62 63 64

More information

UNIT-II OVERVIEW OF PHYSICAL LAYER SWITCHING & MULTIPLEXING

UNIT-II OVERVIEW OF PHYSICAL LAYER SWITCHING & MULTIPLEXING 1 UNIT-II OVERVIEW OF PHYSICAL LAYER SWITCHING & MULTIPLEXING Syllabus: Physical layer and overview of PL Switching: Multiplexing: frequency division multiplexing, wave length division multiplexing, synchronous

More information

A Network Optimization Model for Multi-Layer IP/MPLS over OTN/DWDM Networks

A Network Optimization Model for Multi-Layer IP/MPLS over OTN/DWDM Networks A Network Optimization Model for Multi-Layer IP/MPLS over OTN/DWDM Networks Iyad Katib and Deep Medhi Computer Science & Electrical Engineering Department University of Missouri-Kansas City, USA {IyadKatib,

More information

A Novel Approach to Reduce Packet Loss in OBS Networks

A Novel Approach to Reduce Packet Loss in OBS Networks A Novel Approach to Reduce Packet Loss in OBS Networks Amit Gupta 1, Harbhajan Singh 2, Jagdish Kumar 3 1 Deptt. of Electronics and Communication Engg, PTU, Jalandhar, India. 2 Deptt. of Electronics and

More information

Analysis and Algorithms for Partial Protection in Mesh Networks

Analysis and Algorithms for Partial Protection in Mesh Networks Analysis and Algorithms for Partial Protection in Mesh Networks Greg uperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139 modiano@mit.edu Aradhana Narula-Tam MIT

More information

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C

More information

Iterative Optimization in VTD to Maximize the Open Capacity of WDM Networks

Iterative Optimization in VTD to Maximize the Open Capacity of WDM Networks Iterative Optimization in VTD to Maximize the Open Capacity of WDM Networks Karcius D.R. Assis, Marcio S. Savasini and Helio Waldman DECOM/FEEC/UNICAMP, CP. 6101, 13083-970 Campinas, SP-BRAZIL Tel: +55-19-37883793,

More information

ECSE 414 Fall 2014 Final Exam Solutions

ECSE 414 Fall 2014 Final Exam Solutions ECSE 414 Fall 2014 Final Exam Solutions Question 1 a. The five main layers of the internet protocol stack, along with the service provided by each, and the place where each is implemented are as follows:

More information

Design of Large-Scale Optical Networks Λ

Design of Large-Scale Optical Networks Λ Design of Large-Scale Optical Networks Λ Yufeng Xin, George N. Rouskas, Harry G. Perros Department of Computer Science, North Carolina State University, Raleigh NC 27695 E-mail: fyxin,rouskas,hpg@eos.ncsu.edu

More information

A Wavelength Sharing and Assignment Heuristic to Minimize the Number of Wavelength Converters in Resilient WDM Networks

A Wavelength Sharing and Assignment Heuristic to Minimize the Number of Wavelength Converters in Resilient WDM Networks A Wavelength Sharing and Assignment Heuristic to Minimize the Number of Wavelength Converters in Resilient WDM Networks Shreejith Billenahalli, Miguel Razo, Wanjun Huang, Arularasi Sivasankaran, Limin

More information

Heuristic Algorithms for Multiconstrained Quality-of-Service Routing

Heuristic Algorithms for Multiconstrained Quality-of-Service Routing 244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service

More information

Network-Wide Prediction of BGP Routes

Network-Wide Prediction of BGP Routes Network-Wide Prediction of BGP Routes Nick Feamster Jennifer Rexford Georgia Tech Princeton University feamster@cc.gatech.edu jrex@cs.princeton.edu Abstract This paper presents provably correct algorithms

More information

A simulation study of optical burst switching and access protocols for WDM ring networks

A simulation study of optical burst switching and access protocols for WDM ring networks Computer Networks 41 (2003) 143 160 www.elsevier.com/locate/comnet A simulation study of optical burst switching and access protocols for WDM ring networks Lisong Xu, Harry G. Perros *, George N. Rouskas

More information

Contention-based Limited Deflection Routing in OBS Networks

Contention-based Limited Deflection Routing in OBS Networks Contention-based Limited Deflection Routing in OBS Networks SuKyoung Lee, Kotikalapudi Sriram, HyunSook Kim and JooSeok Song Sejong University, Seoul, Korea NIST, Gaithersburg, USA Yonsei University, Seoul,

More information

Power Efficient Traffic Grooming in Optical WDM Networks

Power Efficient Traffic Grooming in Optical WDM Networks Power Efficient Traffic Grooming in Optical WDM Networks Emre Yetginer Tubitak UEKAE Ilhan Tan Kislasi Umitkoy, Ankara 06800 Turkey Email: emre.yetginer@iltaren.tubitak.gov.tr George N. Rouskas Department

More information

S Optical Networks Course Lecture 7: Optical Network Design

S Optical Networks Course Lecture 7: Optical Network Design S-72.3340 Optical Networks Course Lecture 7: Optical Network Design Edward Mutafungwa Communications Laboratory, Helsinki University of Technology, P. O. Box 2300, FIN-02015 TKK, Finland Tel: +358 9 451

More information

Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR)

Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR) Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR) Amandeep Kaur 1, Jasmeet Kaur 2, Nishu Kansal 3 1, 2, 3 (ECE, Guru Nanak Dev Engineering College Ludhiana, India) ABSTRACT:

More information

Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study

Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study 598 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banerjee

More information

A Zero Burst Loss Architecture for star OBS Networks

A Zero Burst Loss Architecture for star OBS Networks A Zero Burst Loss Architecture for star OBS Networks Xenia Mountrouidou*, Vishwas Puttasubbappa**, Harry Perros* *Computer Science Department, North Carolina State University, Raleigh, NC 27695, USA {pmountr,

More information

Reconfigurations of Logical Topologies for WDM Mesh Networks

Reconfigurations of Logical Topologies for WDM Mesh Networks University of Windsor Scholarship at UWindsor Electronic Theses and Dissertations 2010 Reconfigurations of Logical Topologies for WDM Mesh Networks Aktaruzzaman AKM University of Windsor Follow this and

More information

Working Analysis of TCP/IP with Optical Burst Switching Networks (OBS)

Working Analysis of TCP/IP with Optical Burst Switching Networks (OBS) Working Analysis of TCP/IP with Optical Burst Switching Networks (OBS) Malik Salahuddin Nasir, Muabshir Ashfaq and Hafiz Sabir Hussain CS&IT Department, Superior University, 17-km off Riwind Road, Lahore

More information

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Spring Quiz III

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Spring Quiz III 6.02 Spring 2009, Quiz 3 Page 1 of 10 Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.02 Spring 2009 Quiz III There are 24 questions and 10 pages in this

More information

Outline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006

Outline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering

More information

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH

More information

TKN. Technische Universität Berlin. Circuit Switching Module for ns-2. Filip Idzikowski. Berlin, March 2009

TKN. Technische Universität Berlin. Circuit Switching Module for ns-2. Filip Idzikowski. Berlin, March 2009 TKN Telecommunication Networks Group Technische Universität Berlin Telecommunication Networks Group Circuit Switching Module for ns-2 Filip Idzikowski idzikowski@tkn.tu-berlin.de Berlin, March 2009 TKN

More information

Autonomous Clustering-Based Heterogeneous Waveband Switching in WDM Networks

Autonomous Clustering-Based Heterogeneous Waveband Switching in WDM Networks Autonomous Clustering-Based Heterogeneous aveband Switching in DM Networks Mengke Li and Byrav Ramamurthy Department of Computer Science and Engineering, University of Nebraska-Lincoln, USA Email: {mli,

More information

MULTILEVEL FEEDBACK QUEUE WAVELENGTH ASSIGNMENT ALGORITHM IN SURVIVABLE OPTICAL WDM NETWORKS

MULTILEVEL FEEDBACK QUEUE WAVELENGTH ASSIGNMENT ALGORITHM IN SURVIVABLE OPTICAL WDM NETWORKS ISSN: 2229-6948(ONLINE) ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, DECEMBER 2, VOLUME: 2, ISSUE: 4 MULTILEVEL FEEDBACK QUEUE WAVELENGTH ASSIGNMENT ALGORITHM IN SURVIVABLE OPTICAL WDM NETWORKS M. Arunachalam

More information

Modeling and Analysis of a Shared Channel Architecture for Performance Improvement in Optical Burst Switched Networks

Modeling and Analysis of a Shared Channel Architecture for Performance Improvement in Optical Burst Switched Networks Modeling and of a Shared Channel Architecture for Performance Improvement in Optical Burst Switched Networks Wyatt Chaffee, Bin Wang, Haining Wang Department of Computer Science and Engineering Wright

More information

CH : 15 LOCAL AREA NETWORK OVERVIEW

CH : 15 LOCAL AREA NETWORK OVERVIEW CH : 15 LOCAL AREA NETWORK OVERVIEW P. 447 LAN (Local Area Network) A LAN consists of a shared transmission medium and a set of hardware and software for interfacing devices to the medium and regulating

More information

THE TCP specification that specifies the first original

THE TCP specification that specifies the first original 1 Median Filtering Simulation of Bursty Traffic Auc Fai Chan, John Leis Faculty of Engineering and Surveying University of Southern Queensland Toowoomba Queensland 4350 Abstract The estimation of Retransmission

More information

TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS

TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS Communication Networks Allow Exchange of Information between Users telephone network for voice communication interconnected computers and peripherals,

More information

Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. by Abhishek Kashyap, Kwangil Lee, Mark Shayman

Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. by Abhishek Kashyap, Kwangil Lee, Mark Shayman TECHNICAL RESEARCH REPORT Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks by Abhishek Kashyap, Kwangil Lee, Mark Shayman TR 2003-51 I R INSTITUTE FOR

More information

OPTICAL INTER-DOMAIN ROUTING PROTOCOLS WITH WAVELENGTH CONVERTERS

OPTICAL INTER-DOMAIN ROUTING PROTOCOLS WITH WAVELENGTH CONVERTERS Faculty of Electrial Engineering, Mathematics and Computer Science Network Architectures and Services OPTICAL INTER-DOMAIN ROUTING PROTOCOLS WITH WAVELENGTH CONVERTERS Truong Dinh Huy (1391003) Committee

More information

Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.

Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,

More information

An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing

An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing Sudipta Sengupta Shravan Rayanchu,2 Suman Banerjee 2 Bell Laboratories, Lucent Technologies, Murray Hill,

More information

Traffic Grooming for Survivable WDM Networks Shared Protection

Traffic Grooming for Survivable WDM Networks Shared Protection Traffic Grooming for Survivable WDM Networks Shared Protection Canhui (Sam) Ou, Keyao Zhu, Hui Zang, Laxman H. Sahasrabuddhe, and Biswanath Mukherjee Abstract This paper investigates the survivable trafficgrooming

More information

A Joint Replication-Migration-based Routing in Delay Tolerant Networks

A Joint Replication-Migration-based Routing in Delay Tolerant Networks A Joint -Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Philadelphia, PA 19122 Zhen Jiang Dept. of Computer Science West

More information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms Announcements CS 5565 Network Architecture and Protocols Lecture 20 Godmar Back Project 2B due in 2 parts: Apr 29 and May 6 Extra Credit Opportunities: Expand simulator (and your implementation) to introduce

More information