OSPF IN OPTICAL NETWORKS
|
|
- Roderick Gilbert
- 5 years ago
- Views:
Transcription
1 Analysis of Enhanced OSPF for Routing Lightpaths in Optical Mesh Networks Sudipta Sengupta, Debanjan Saha, and Sid Chaudhuri Tellium, Inc., 2 Crescent Place PO Box 91 Oceanport, NJ , USA. Abstract - We discuss enhancements to the OSPF protocol for routing and topology discovery in optical mesh networks. OSPF s opaque LSA mechanism is used to extend OSPF to disseminate optical resource related information through optical LSAs. Standard link-state database flooding mechanisms are used for distribution of optical LSAs. Each optical LSA carries optical resource information pertaining to a single optical link bundle between two adjacent OXCs, allowing for fine granularity changes in topology to be incorporated in path computation algorithms. OSPF packets are carried over a single IP control channel between adjacent OXCs. We analyze the performance of OSPF with optical extensions. Specifically, we compute control channel bandwidth used due to LSA updates. We also estimate the amount of memory required to store the LSA database. Finally, we study CPU usage for computing primary and backup lightpaths. Our analysis shows that the control channel bandwidth usage, memory requirement, and CPU usage are small enough to not be limiting factors for designing optical networks with single OSPF areas consisting of a large number (more than 5) of OXCs. OSPF allows hierarchical routing, whereby a large network may be treated as a collection of smaller areas with limited information exchange between areas. For smaller networks, a simpler organization consisting of the backbone area is sufficient. As a matter of fact, service providers typically start with a backbone area and add other areas as the network grows. I INTRODUCTION In an optical network, multiple optical crossconnects/switches (OXCs) are interconnected via WDM links in a general topology, referred to as an optical mesh network [1]. An OXC has multiple ports and is capable of switching an optical wavelength channel (e.g., at OC-48, OC-192 rates) from an input port to an output port. An optical network allows the dynamic provisioning of optical layer connections between clients connected to the network. The provisioning activity consists of establishing suitable cross-connects in each OXC in the connection path such that end-to-end connectivity is realized. Routing in an optical network presents new challenges for dissemination of optical link resource information and diverse routing of primary and backup paths. In this paper, we discuss extensions to the standard OSPF routing protocol [2] to facilitate routing and topology discovery in optical mesh networks. We also present an analytical model for evaluating the performance of OSPF with optical extensions. More specifically, we quantify the bandwidth requirement for disseminating link state information through router and optical LSAs, storage requirement for the LSAs, and CPU overhead for primay-backup path computation. We investigate the maximum size of an OSPF area that is feasible without pushing the limits of available control channel bandwidth, OXC memory, or CPU processing power. II OSPF IN OPTICAL NETWORKS Topology discovery and routing in traditional IP networks has been accomplished by running an enhanced version of the IP routing protocol, Open Shortest Path First (OSPF) [2]. Figure 1: Optical network arranged as an OSPF hierarchy. Figure 1 shows OXCs arranged in a two-tier OSPF hierarchy. As shown in the figure, this arrangement consists of a backbone area and a number of other areas hanging off the backbone area. Each OXC broadcasts the local link state information periodically, as well as when a change occurs in topology or resource availability. For reasons of scalability, broadcasts are contained within the area boundaries and only summarized topology information is disseminated across area boundaries. We first define some terminology for optical networks and then discuss the motivation for and details of OSPF extensions for optical networks. II.A Terminology Channel: An assigned wavelength on a physical fiber link connecting two OXCs, carrying a basic optical signal like OC-48 (2.4 Gbps). Optical Line (OL): An optical line is an optical connection between two ports on two adjacent OXCs. Shared Risk Link Group (SRLG): This identifies a point of failure (a fiber, cable or conduit) which could affect all channels belonging to that SRLG. A channel may pass through one or more SRLGs. Optical Line Group (OLG): A set of optical lines between
2 two neighboring OXCs that belong to the same set of SRLGs and are of the same type (e.g. OC-48, OC-192) are said form an optical line group. Figure 2: Optical line, line group, and link bundle. Optical Link Bundle (OLB): Multiple OLGs may be grouped together into an OLB. All OLGs between two neighbors are bundled together to form a single OLB. Control Channel: The IP control channel between two neighboring OXCs is used for carrying control for OSPF, lightpath signaling, etc. One way of implementing this control channel is to use the SONET overhead bytes. II.B Optical Line Optical Line Group OSPF Extensions Optical Link Bundle SRLG-1 SRLG-2 SRLG-3 In this section, we discuss extensions to OSPF required for routing and topology discovery in optical networks. We motivate the need in each case. 1. Link bundling: Under standard OSPF, each physical link between a pair of OXCs would result in a routing adjacency. This means that routing protocol messages would be exchanged over each such link and each such link would be advertised to other OXCs in broadcast messages. Since the number of physical links between a pair of nodes could be large in optical networks, this would result in increased message broadcasting and processing overhead. To eliminate this, all the links between a pair of neighbors could be treated as a single logical routing adjacency. This procedure is called bundling [5]. With link bundling, routing protocol messages are sent over exactly one link even if there are multiple links connecting a pair of OXCs. Furthermore, the entire set of links is advertised in a single message. 2. Resource parameters: In an optical network, link state and resource information is used to compute primary and backup paths for a lightpath connection. This information consists of the representation of links and nodes in the network along with certain associated resource parameters (e.g., link cost, resource type and availability, SRLG information, etc.) that are critical to optimal and diverse routing of lightpaths. Standard OSPF does not provide the mechanism to disseminate such information through link state messages. Hence, the need to introduce optical LSAs, using OSPF s opaque LSA mechanism [3]. 3. Link state advertisement thresholds : Because link state advertisements capture resource availability, care must be taken to ensure that this information is not generated too frequently with minor changes in resource status. A configurable thresholding scheme (as discussed in Section II.D) can be used whereby an OXC would generate an LSA update only if the resource information changes significantly. This modification reduces the number of optical LSA updates. 4. Source routing methodology: Standard OSPF is designed for routing IP datagrams. Hence, under standard OSPF, each participating node would use an identical algorithm to compute a forwarding table that allows packets to be routed based on the destination address. Routing of an optical layer connection, on the other hand, requires that the entire path for connection be computed at the source OXC and signaled to other OXCs in the path. Since route computation is triggered by path setup requests only, we need to run the path computation algorithm at an ingress OXC only when the lightpath request arrives. The standard OSPF [2] uses Network LSAs and Router LSAs to distribute topology information within an area. Across areas, Summary LSAs are used to disseminate reachability information. Additionally, OSPF also uses External LSAs to import/export routes from other non-ospf routing domains. Network and External LSAs (used to insert static routes into OSPF) are not required in an optical network under the overlay model [9]. In this model, a set of IP routers are interconnected through a core network of OXCs which is used to setup connectivity between the routers. Thus, the core optical network does not require any knowledge of external routes, since lightpath requests originate and terminate at edge OXCs. II.C Optical LSAs A new opaque LSA, referred to as the Optical LSA, is used to disseminate optical resource related information. Standard link-state database flooding mechanisms are used for distribution of optical LSAs. Each optical LSA carries optical resource information pertaining to a single OLB, allowing for fine granularity changes in topology. The information is summarized at the OLG level, i.e., for each OLG contained in the OLB, the following is specified: (i) number of available, primary, and backup channels, (ii) set of SRLGs that the OLG belongs to, and (iii) cost associated with the OLG. The above extensions to OSPF are currently being standardized by the IETF [1]. OLs are discovered automatically as Link Management Protocol (LMP) [6] discovers new neighbors. OLs are grouped into OLGs (as discussed above) and this summarized information is included in optical LSAs.
3 II.D Link State Advertisement Thresholds In absence of any change in the network state, the optical LSAs are refreshed at regular refresh intervals of 3 min, just like other LSAs [2]. In addition to regular refreshes, LSAs need to be updated to reflect changes in the network state (topology and resource information). The following configurable mechanisms are used to reduce the number of optical LSA updates: Relative change based triggers: An update is triggered when the relative difference between the current and the previously advertised link state exceeds a certain threshold expressed as a percentage value. Anytime the number of available OLs in an OLG increases or decreases by more than the specified thresholds, an update should be generated. Absolute change based triggers: This differs from the above in that the measure of change is absolute, i.e., an update is triggered when the number of available OLs in an OLG crosses a certain configurable constant. II.E Lightpath Routing A lightpath consists of an SRLG-disjoint primary and backup path. Channels on the backup path can be shared among different mesh-restored lightpaths. The method of sharing [7] ensures that any single failure on the primary path of any lightpath can be restored. An enumeration based algorithm is used to generate candidate primary paths in increasing order of cost. The best sharable backup is computed for each primary and the least cost primary-backup pair is chosen. III ANALYSIS OF OSPF WITH OPTICAL EXTENSIONS In this section, we present an analytical model for estimating the control channel bandwidth usage due to optical LSA and router LSA updates. We also estimate the memory requirement for storing the LSAs, and the CPU utilization for lightpath computation. III.A Packet Sizes Type Size (in bytes) IP header 2 OSPF header 24 Optical/Router LSA header 2 Optical LSA body 152 Router LSA body 4 + #links x 12 We use the above packet sizes for IP and OSPF protocols. We assume that at the IP layer, the maximum size of an unfragmented packet is 1 bytes. Packet sizes for optical LSAs are obtained from a prototype specification at Tellium. We assume two diverse SRLGs per link, and hence, the number of OLGs per link is 4 (since OC-48/192 lines belong to different OLGs). III.B Bandwidth usage due to Optical LSA updates The maximum number of optical LSAs per IP packet is ( )/( ) = 5. The actual average number of optical LSAs per IP packet (= t < 5) depends on the number of such LSAs that the OSPF layer is able to pack into an IP packet. We assume a value of t = 3, as reported in [3] for three OSPF testbed scenarios. Hence, the effective length of an optical LSA is ( /t) bytes. The normal LSA refresh time per link is 3 min. Let the number of nodes in the network be n and the average node degree be d. Note that number of links (OLBs) is given by m = nd/2. Let H p and H b denote the average number of hops on primary and backup paths respectively in the network. If α is the average ratio of backup path hop count to primary path hop count, then H b = αh p. Let r denote the average number of backup paths sharing a backup channel. Then, the average channel usage by a lightpath demand is H p + H b /r = (1 + α/r)h p. Let λ denote the average rate of arrival of lightpath demands in the network. Then, the average rate of channel usage increase per link per second is λ(1 + α/r)h p. Assuming an uniform distribution over m links, average rate of OL decrease per link per second is λ(1 + α/r)h p /m. With an absolute change based LSA trigger threshold value of c, the average number of optical LSA updates associated with a given link per second due to change is λ(1 + α/r)h p /mc. We now consider two cases, depending on how the above update rate (triggered by changes) compares with the routine refresh rate of once every 3 min. Case 1: 1/3 min = 1/18 sec < λ(1 + α/r)h p /mc In this case, the average interval between change-based updates is less than 3 min. Hence, we can assume that refresh updates do not occur. Thus, the effective rate of optical LSA updates associated with a given link (per second) is given by R = λ(1 + α/r)h p /mc per sec. Case 2: 1/3 min = 1/18 sec > λ(1 + α/r)h p /mc. In this case, the average interval between change-based updates is more than 3 min. Let T (in seconds) be the interval between change triggered LSA updates. It is given by T = mc/[λ(1 + α/r)h p ]. Note that T/18 refreshes will have occurred before a change triggered update. Thus, the multiplicative factor for the effective LSA update rate in this case is ( T/18 + 1). Hence, the effective rate of optical LSA updates associated with a given link (per second) is given by R = kλ(1 + α/r)h p /mc, where k = T/ Note that the expression for case 2 also holds for case 1, since if T < 18, then T/18 =. Hence, we will use the general expression for case 2 always. Since each link is advertised by both of its adjacent nodes, the bandwidth (bytes/sec) on an IP control channel due to optical LSA updates is (2m)[kλ(1 + α/r)h p /mc]( /t) = 2kλ(1 + α/r)h p ( /t)/c. Observe that this is linear in λ and H p. It turns out that case 2 is valid all the time for the data range
4 we considered. That is, the interval T for optical LSA updates due to resource change is more than the refresh interval of 3 min. In short, change triggered optical LSA updates are infrequent. Note that in the above analysis, we considered only the arrival of lightpath requests into the network. If λ is the steady state arrival of lightpath requests into the network, then lightpaths are also being deleted from the network at rate λ. A lightpath deletion causes a decrease in the channel usage on its links. Thus, in the worst case, the OSPF traffic generated due to lightpaths deletions could be similar to that for lightpath creations. Hence, we need to multiply the above formula by a factor of 2 to obtain the steady state OSPF traffic due to optical LSAs. Note that this is a conservative overestimation, since if the threshold c is greater than 1, then creation of lightpaths involving a given link could offset the channel usage decrease caused by deletion of lightpaths involving that same link, thus decreasing the variation in channel usage (from the last advertised value) on that link. To estimate λ, we assume that each OXC has 248 (2K) ports, 25% of which are drop ports. Thus, the total number of drop ports in the network is 512n. Since a lightpath uses exactly two drop ports, the maximum number of lightpaths that can exist in the network at any given time is 256n. If each lightpath exists in the network for an average of t h seconds (also called the hold time), then, by Little s formula [8], the steady state arrival of lightpaths into the network is given by λ = 256n/t h. An OXC in a typical PoP/CO (central office) has a small adjacency, i.e., it is connected to two, sometimes three, and rarely four other PoPs/COs. Hence, optical mesh networks have small average node degree, ranging from around 2.5 to less than 4. In this paper, we present the results for an average node degree of 3.5 unless otherwise stated. For networks with small average node degree d ( 4), the average primary (shortest) path hop count H p grows linearly with network size n, i.e., H p = an + b. The constants a and b (which depend on d) were determined by experimentation on a family of degree d networks of increasing size, generated by starting with a ring (uniform degree d = 2) and adding chordal edges. The values α and r have been fixed at α = 1.5 and r = 3.. These values have been found, through simulation [11], to be fairly representative of a wide range of network topologies. III.C Bandwidth usage due to Router LSA updates The maximum number of router LSAs per IP packet is ( )/( d) = 956/( d), where d is the node degree of the OXC. For an average node degree d = 3.5, this number is 14. As for optical LSAs, we assume the average number of router LSAs per IP packet to be s = 3 [3]. Hence, the effective length of a router LSA is ( d + 44/s) bytes. The normal refresh time for a router LSA is 3 min. Router LSA updates due to change are rare this happens only when no IP control channel is available between two adjacent nodes, i.e., the entire OLB on a link or a node fails. Hence, we ignore change-triggered router LSA updates for our calculation. Thus, the bandwidth (bytes/sec) on IP control channel due to router LSA updates is given by n( d + 44/s)/18. Control Channel bandwidth (kbps) Optical and Router LSA bandwidth usage (absolute change based trigger threshold c = 1) Figure 3: Bandwidth usage for optical and router LSAs with varying network size and lightpath hold time. Control channel bandwidth (kbps) Optical and Router LSA bandwidth usage (lightpath hold time of 12 hrs) 3 min 1 hr 12 hrs 1 day 1 month c = 1 c = 5 c = 1 c = 15 c = 2 Figure 4: Bandwidth usage for router and optical LSAs with varying network size and triggering thresholds. Figure 3 shows the bandwidth requirement for optical and router LSA updates for OSPF areas of different sizes for different lightpath hold times. The trigger threshold is fixed at a typical value of c = 1. Lower hold time values of upto t h = 3 min represent a somewhat extreme real-time ondemand bandwidth provisioning scenario. Figure 4 shows the bandwidth usage for networks of different sizes and for different triggering thresholds. The lightpath hold time is fixed at a typical value of t h = 12 hrs. For both these plots, the average node degree is fixed at d = 3.5. Note that for a typical lightpath hold time of t h = 12 hours and trigger threshold value of c = 1, the peak bandwidth usage is just 88 Kbps for an OSPF area as big as 5 nodes.
5 III.D CPU Utilization for Path Computation Figure 5 shows the OXC processor utilization for path computation for different OSPF area sizes and lightpath hold times. The average node degree is fixed at d = 3.5. The algorithm is run on a randomly generated connected graph. Running times were converted to CPU utilization by multiplying with the lightpath arrival rates corresponding to different hold times. The peak utilization is observed to be 3.4% on a PowerPC 75 processor, for an OSPF area size of 5 nodes and a lightpath holding time of 3 minutes. % CPU utilization III.E % CPU Utilization for Path Computation Figure 5: CPU utilization for path computation. OXC Memory Requirement Figure 6 shows the OXC memory requirement for running OSPF with optical extensions. Since there are m optical LSAs and n router LSAs, the router memory (bytes) required to store all LSAs is given by 172m + ( d)n. Note that we ignore the support data stored with LSAs, which is minimal. As shown in the figure, memory requirement for a 5-node OSPF area with nodes of average degree 4 is a little above 2 KB. Memory requirement (KBytes) LSA storage memory requirement Figure 6: OXC memory requirement for storing LSAs. IV CONCLUSION 3 min 1 hr 12 hrs 1 day 1 month d = 3. d = 3.25 d = 3.5 d = 3.75 d = 4. We discussed optical extensions to OSPF for routing and topology discovery in optical networks. Analytical performance analysis of these OSPF extensions shows that IP control channel bandwidth usage, OXC memory requirement, and CPU utilization should not be limiting factors for designing optical networks with single OSPF areas, even as big as 5 nodes. Our results contradict the common perception that single area OSPF does not scale beyond 5 to 1 nodes. There are several reasons for these apparently contradictory results: 1. A typical IP router network handles a large number of external LSAs originated by networks running other routing protocols. Since an optical network does not import external routes from other networks in the overlay model [9], it does not have to process external LSAs. Consequently, it can do away with much of the processing overhead [3] of external LSAs for a typical router in an OSPF network. 2. The OXC CPU processor used for running OSPF is much more powerful compared to the last generation of CPUs used in the routers and switches that led to the perception of OSPF s poor scalability, as reported in [3]. 3. In an optical network, paths are computed only by the ingress OXC when the path setup request arrives. This is very different from a typical router network where each node in the network has to compute the routing table each time an LSA is updated. Finally, note that for a lightpath spanning multiple OSPF areas in an optical network, restoration occurs independently in each area, since there is a backup segment protecting the primary path segment in each area. Hence, smaller restoration latency and higher reliability of service (and not OSPF scalability issues) could dictate a multi-area OSPF deployment with smaller area sizes. REFERENCES [1] T. E. Stern and K. Bala, Multiwavelength Optical Networks: A Layered Approach, Prentice Hall, May [2] J. Moy, OSPF: Anatomy of an Internet Routing Protocol, Addison-Wesley, [3] R. Coltun, The OSPF Opaque LSA Option, RFC 237, FORE Systems, August [4] J. Moy, OSPF Protocol Analysis, RFC 1245, July [5] K. Kompella, et al., Link Bundling in MPLS Traffic Engineering, draft-ietf-mpls-bundle-1.txt, November 21. [6] Jonathan P. Lang, et al., Link Management Protocol (LMP), draft-ietf-ccamp-lmp-2.txt, November 21. [7] Sudipta Sengupta and Ramu Ramamurthy, From Network Design to Dynamic Provisioning and Restoration in Optical Cross-Connect Mesh Networks: An Architectural and Algorithmic Overview, IEEE Network Magazine, July/August 21. [8] Leonard Kleinrock, Queueing Systems: Theory, Volume 1, John Wiley & Sons, January [9] B. Rajagopalan, et al., IP over Optical Networks: Architectural Aspects, IEEE Communications Magazine, September 2. [1] K. Kompella, et al., "OSPF Extensions in Support of Generalized MPLS", Internet Draft, <draft-ietf-ccamp-ospfgmpls-extensions-2.txt>, January 22. [11] StarNet Modeler TM, Tellium, Inc.,
Resilient IP Backbones. Debanjan Saha Tellium, Inc.
Resilient IP Backbones Debanjan Saha Tellium, Inc. dsaha@tellium.com 1 Outline Industry overview IP backbone alternatives IP-over-DWDM IP-over-OTN Traffic routing & planning Network case studies Research
More informationOSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
More informationMulti-Protocol Lambda Switching for Packet, Lambda, and Fiber Network
Multi-Protocol Lambda Switching for Packet, Lambda, and Fiber Network Jun Kyun Choi Tel) (042) 866-6122 1 Contents Backgrounds for Optical Network Review of SONET/SDH Technologies Motivations for IP over
More informationThe LSP Protection/Restoration Mechanism in GMPLS. Ziying Chen
The LSP Protection/Restoration Mechanism in GMPLS by Ziying Chen The LSP Protection/Restoration Mechanism in GMPLS by Ziying Chen A graduation project submitted to the Faculty of Graduate and Postdoctoral
More informationMPLS Multi-Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Computer Networks Design and Management - 1 MPLS: introduction
More informationConstraint-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 informationProgress Report No. 15. Shared Segments Protection
NEXT GENERATION NETWORK (NGN) AVAILABILITY & RESILIENCE RESEARCH Progress Report No. 15 Shared Segments Protection The University of Canterbury Team 18 April 2006 Abstract As a complement to the Canterbury
More informationInternet Engineering Task Force (IETF) Request for Comments: November 2015
Internet Engineering Task Force (IETF) Request for Comments: 7688 Category: Standards Track ISSN: 2070-1721 Y. Lee, Ed. Huawei G. Bernstein, Ed. Grotto Networking November 2015 GMPLS OSPF Enhancement for
More informationThe Emerging Optical Control Plane
The Emerging Optical Control Plane Traditional transport networks can be modeled as the interaction of two operating planes: a transport plane and a management plane. In this model, the transport plane
More informationMulti Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network Management and QoS Provisioning - 1 MPLS: introduction
More informationQoS Routing Extensions to OSPF
QoS Routing Extensions to OSPF Jani Lakkakorpi jani.lakkakorpi@nokia.com Abstract This paper briefly describes the extensions suggested to the OSPF [1] protocol to support QoS routes. These extensions
More informationInter-domain Routing with Shared Risk/Resource Groups (SRG)
Inter-domain Routing with Shared Risk/Resource Groups (SRG) Sudheer Dharanikota - sudheer@ieee.org Nayna Networks, Inc. MPLS World Congress 2002 February 8 th 2002 Co-authors Sudheer Dharanikota, Raj Jain
More informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More informationDistributed 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 informationSynergies Between Optical and Packet Rings
Synergies Between Optical and Packet Rings Nasir Ghani Sorrento Networks Inc http://www.sorrentonet.com 50 th IETF Meeting, Minneapolis, MN, March 2001 50 th IETF Meeting, Minneapolis, MN, March 2001 Page
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationOpen Shortest Path First (OSPF)
CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working
More informationNetwork Working Group. Category: Experimental April 2009
Network Working Group L. Berger Request for Comment: 5523 LabN Consulting, LLC Category: Experimental April 2009 Status of This Memo OSPFv3-Based Layer 1 VPN Auto-Discovery This memo defines an Experimental
More informationAn Experimental Analysis on OSPF-TE Convergence Time
An Experimental Analysis on OSPF-TE Convergence Time S. Huang* a, K. Kitayama a, F. Cugini b, F. Paolucci c, A. Giorgetti c, L. Valcarenghi c, P. Castoldi c a Osaka University, Osaka, Japan; b CNIT, Pisa,
More informationSimulation of All Optical Networks
Simulation of All Optical Networks Raul Valls Aranda Communication Department Polytechnic University of Valencia (UPV) C/ Camino de Vera s/n Valencia, Spain Pablo A. Beneit Mayordomo Communication Department
More informationBasic Idea. Routing. Example. Routing by the Network
Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationArc Perturbation Algorithms for Optical Network Design
Applied Mathematical Sciences, Vol. 1, 2007, no. 7, 301-310 Arc Perturbation Algorithms for Optical Network Design Zbigniew R. Bogdanowicz Armament Research, Development and Engineering Center Building
More informationOSPF Commands. adjacency stagger, page 7. authentication-key (OSPF), page 14
OSPF Commands This module describes the commands used to configure and monitor the Open Shortest Path First (OSPF) routing protocol. For detailed information about OSPF concepts, configuration tasks, and
More informationECE442 Communications Lecture 4. Optical Networks
ECE442 Communications Lecture 4. Optical Networks Husheng Li Dept. of Electrical Engineering and Computer Science Spring, 2014 Network Elements 1 WDM networks provide circuit switched end-to-end optical
More informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More informationRouting by the Network
Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationTechniques and Protocols for Improving Network Availability
Techniques and Protocols for Improving Network Availability Don Troshynski dtroshynski@avici.com February 26th, 2004 Outline of Talk The Problem Common Convergence Solutions An Advanced Solution: RAPID
More informationGMPLS Overview Generalized MPLS
GMPLS Overview Generalized MPLS Hanyang Univ ( jijung@hanyang.ac.kr ) Outline GMPLS Overview Draft-ietf-ccamp-gmpls-architecture-00.txt GMPLS IGP Extension Draft-ietf-ccamp-ospf-gmpls-extensions-00.txt
More informationOutline. 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 informationOSPF Commands on Cisco IOS XR Software
This module describes the commands used to configure and monitor the Open Shortest Path First (OSPF) routing protocol. For detailed information about OSPF concepts, configuration tasks, and examples, see
More informationDistributed 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 informationCategory: Standards Track October OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)
Network Working Group K. Kompella, Ed. Request for Comments: 4203 Y. Rekhter, Ed. Updates: 3630 Juniper Networks Category: Standards Track October 2005 Status of This Memo OSPF Extensions in Support of
More informationIEEE 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 informationMulticast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM
Multicast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM Jeong-Mi Kim 1, Oh-Han Kang 2, Jae-Il Jung 3, and Sung-Un Kim 1,4 1 Pukyong National University, 599-1 Daeyeon 3-Dong Nam-Gu, Busan,
More informationMULTICAST EXTENSIONS TO OSPF (MOSPF)
MULTICAST EXTENSIONS TO OSPF (MOSPF) Version 2 of the Open Shortest Path First (OSPF) routing protocol is defined in RFC-1583. It is an Interior Gateway Protocol (IGP) specifically designed to distribute
More informationFigure 1: History has shown that switching and grooming speeds increase as transport speeds increase
EFFICIENT NETWORK SWITCHING HIERARCHY Stephen French*, Dr. Jean-Francois Labourdette, Dr. Krishna Bala and Patricia Miller-Pittman Tellium Inc., 2 Crescent Place, Oceanport, NJ 07757 *sfrench@tellium.com,
More informationIntroduction to Segment Routing
Segment Routing (SR) is a flexible, scalable way of doing source routing. Overview of Segment Routing, page 1 How Segment Routing Works, page 2 Examples for Segment Routing, page 3 Benefits of Segment
More informationTop-Down Network Design
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic
More informationFairness 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 informationHelsinki University of Technology Telecommunications Laboratory. OSPF Routing Protocol Licenciate course seminar paper
Helsinki University of Technology Telecommunications Laboratory OSPF Routing Protocol Licenciate course seminar paper Shkumbin I. Hamiti, 08.10.1996 Communications Laboratory, TKK-HUT email: bini#tiltu.hut.fi
More informationA Segment Routing (SR) Tutorial. R. Bonica NANOG70 June 6, 2017
A Segment Routing (SR) Tutorial R. Bonica NANOG70 June 6, 2017 AKA: SPRING IETF Standardization Source Packet Routing In Networking (SPRING) WG ISIS, OSPF, IDR and MPLS WGs What is SR? A tunneling technology
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationAlcatel-lucent EXAM - 4A Alcatel-Lucent Interior Routing Protocols and High Availability. Buy Full Product.
Alcatel-lucent EXAM - 4A0-101 Alcatel-Lucent Interior Routing Protocols and High Availability Buy Full Product http://www.examskey.com/4a0-101.html Examskey Alcatel-lucent 4A0-101 exam demo product is
More informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
More informationPerformance 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 informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 Agenda OSPF Primer OSPF in Service Provider Networks OSPF BCP - Adding Networks OSPF Command Summary 2 OSPF Primer 3
More informationMaster 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 informationCategory: Experimental Consultant July OSPF-xTE: Experimental Extension to OSPF for Traffic Engineering
Network Working Group Request for Comments: 4973 Category: Experimental P. Srisuresh Kazeon Systems P. Joseph Consultant July 2007 OSPF-xTE: Experimental Extension to OSPF for Traffic Engineering Status
More informationRouting. Advanced Computer Networks: Routing 1
Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s
More informationInternet Engineering Task Force (IETF) Request for Comments: Category: Experimental February 2014 ISSN:
Internet Engineering Task Force (IETF) A. Retana Request for Comments: 7137 S. Ratliff Updates: 5820 Cisco Systems, Inc. Category: Experimental February 2014 ISSN: 2070-1721 Use of the OSPF-MANET Interface
More informationPlexxi Theory of Operations White Paper
White Paper Introduction Cloud computing, virtualization, and distributed application architectures are reshaping data center traffic flows, escalating bandwidth and performance demands, and introducing
More informationMULTILAYER REQUIREMENTS FOR NBI OF IP/MPLS DOMAIN CONTROLLERS
MULTILAYER REQUIREMENTS FOR NBI OF IP/MPLS DOMAIN CONTROLLERS White Paper Contents Scope... 2 NBI Requirements for IP/MPLS Domain Controller... 2 Topology and Traffic Discovery Requirements... 2 Monitoring
More informationOpen Shortest Path First IGP. Intended status: Standards Track
Open Shortest Path First IGP Internet-Draft Intended status: Standards Track Expires: December 28, 2014 S. Hegde H. Raghuveer H. Gredler Juniper Networks, Inc. R. Shakir British Telecom A. Smirnov Cisco
More informationSPARE CAPACITY MODELLING AND ITS APPLICATIONS IN SURVIVABLE IP-OVER-OPTICAL NETWORKS
SPARE CAPACITY MODELLING AND ITS APPLICATIONS IN SURVIVABLE IP-OVER-OPTICAL NETWORKS D. Harle, S. Albarrak, F. Ali Department of Electrical and Electronic Engineering, University of Strathclyde, U. K {d.harle,sbarrak,
More informationInterdomain Routing In Optical Networks
Interdomain Routing In Optical Networks Mark Joseph Francisco, Stephen Simpson, Lambros Pezoulas, Changcheng Huang, Ioannis Lambadaris Carleton University, 1125 Colonel By Drive, Ottawa, ON K1S 5B6 Dept.
More informationOSPF Commands on Cisco ASR 9000 Series Router
OSPF Commands on Cisco ASR 9000 Series Router This module describes the commands used to configure and monitor the Open Shortest Path First (OSPF) routing protocol. For detailed information about OSPF
More informationInternet Engineering Task Force (IETF) Updates: 5614 October 2013 Category: Experimental ISSN:
Internet Engineering Task Force (IETF) R. Ogier Request for Comments: 7038 SRI International Updates: 5614 October 2013 Category: Experimental ISSN: 2070-1721 Abstract Use of OSPF-MDR in Single-Hop Broadcast
More informationC13b: Routing Problem and Algorithms
CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in
More informationOn the design of MPLS-ASON/GMPLS Interconnection Mechanisms
On the design of MPLS- Interconnection Mechanisms Luis Velasco, Ricardo Romeral, Fernando Agraz, Salvatore Spadaro, Jaume Comellas, Gabriel Junyent, and David Larrabeiti Abstract In this paper we propose
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationInternational Journal of Advance Engineering and Research Development. Simulation Based Improvement Study of Overprovisioned IP Backbone Network
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 8, August -2017 e-issn (O): 2348-4470 p-issn (P): 2348-6406 Simulation
More informationRequest for Comments: 1787 T.J. Watson Research Center, IBM Corp. Category: Informational April 1995
Network Working Group Y. Rekhter Request for Comments: 1787 T.J. Watson Research Center, IBM Corp. Category: Informational April 1995 Status of this Memo Routing in a Multi-provider Internet This memo
More informationSession 2: MPLS Traffic Engineering and Constraint-Based Routing (CR)
MPLS Frame Relay Alliance formed in April 2003 Session 2: MPLS Traffic Engineering and Constraint-Based Routing (CR) Copyright 2003 MPLS Frame Relay Alliance Slide 2-12 MPLS Routing h The need for Traffic
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationCategory: Standards Track LabN Consulting, LLC July 2008
Network Working Group Request for Comments: 5252 Category: Standards Track I. Bryskin ADVA Optical Networking L. Berger LabN Consulting, LLC July 2008 Status of This Memo OSPF-Based Layer 1 VPN Auto-Discovery
More informationIntroduction to IEEE 802.1Qca Path Control and Reservation
www.huawei.com Introduction to IEEE 802.1Qca Path Control and Reservation Authors: Hesham ElBakoury Version: 1.0 HUAWEI TECHNOLOGIES CO., LTD. GOAL Present the scope main concepts of the new IEEE 802.1Qca
More informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
More informationInitial motivation: 32-bit address space soon to be completely allocated. Additional motivation:
IPv6 Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS IPv6 datagram format:
More informationChapter 7: Routing Dynamically. Routing & Switching
Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based
More informationSimple 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 informationInternet Engineering Task Force. G. Karagiannis University of Twente. February 2004
Internet Engineering Task Force INTERNET-DRAFT Expires July 2004 A. Bader L. Westberg Ericsson G. Karagiannis University of Twente RMD (Resource Management in Diffserv) QoS-NSLP model draft-bader-rmd-qos-model-00.txt
More informationRouting Information Exchange in Large-Scale WDM Networks
Routing Information Exchange in arge-scale WDM Networs Yong Zhu, Admela Juan and Mostafa Ammar Georgia Institute of echnology, Atlanta, GA 30332, USA {yongzhu, ajuan, ammar}@cc.gatech.edu Abstract In this
More informationIP Multicast Technology Overview
IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take
More informationIP over WDM Networks
IP over WDM Networks N. Chandhok 1, A. Durresi 1, R. Jagannathan 1, S. Seetharaman 1, K. Vinodkrishnan 1 and Raj Jain 2 1 The Ohio State University 2015 Neil Ave., Columbus, OH, 43210, Phone: (614)-688-5610
More informationEXTENDING GENERALIZED MULTI PROTOCOL LABEL SWITCHING TO CONFIGURABLE ALL-OPTICAL NETWORKS
EXTENDING GENERALIZED MULTI PROTOCOL LABEL SWITCHING TO CONFIGURABLE ALL-OPTICAL NETWORKS Jane M. Simmons, Adel A. M. Saleh, Lotfi Benmohamed Corvis Corporation 7065 Gateway Drive Columbia, MD 21046 Phone:
More informationChapter 8 Configuring OSPF
Chapter 8 Configuring OSPF This chapter describes how to configure OSPF on HP routing switches using the CLI and Web management interface. To display OSPF configuration information and statistics, see
More informationNetwork Layer: Routing
Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:
More informationInternet Engineering Task Force (IETF) A. Retana Cisco Systems July 2013
Internet Engineering Task Force (IETF) Request for Comments: 6992 Category: Informational ISSN: 2070-1721 D. Cheng Huawei Technologies M. Boucadair France Telecom A. Retana Cisco Systems July 2013 Routing
More informationOSPF Sham-Link Support for MPLS VPN
Feature History Release Modification 12.2(8)T This feature was introduced. This module describes how to configure and use a sham-link to connect Virtual Private Network (VPN) client sites that run the
More informationMPLS VPN--Inter-AS Option AB
The feature combines the best functionality of an Inter-AS Option (10) A and Inter-AS Option (10) B network to allow a Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) service provider
More informationDynamic GMPLS-based Establishment of Bidirectional Connections in All-Optical Networks
Dynamic GMPLS-based Establishment of Bidirectional Connections in All-Optical Networks Ricardo Martinez, Raül Muñoz Centre Tecnològic de Telecomunicacions de Catalunya, Spain {ricardo.martinez, raul.munoz}@cttc.es
More informationIntroduction to OSPF
Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment
More informationEXAMINING 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 informationRequest for Comments: 3717 Category: Informational Marconi Communications D. Awduche MCI March 2004
Network Working Group Request for Comments: 3717 Category: Informational B. Rajagopalan Consultant J. Luciani Marconi Communications D. Awduche MCI March 2004 Status of this Memo IP over Optical Networks:
More informationMPLS VPN Inter-AS Option AB
First Published: December 17, 2007 Last Updated: September 21, 2011 The feature combines the best functionality of an Inter-AS Option (10) A and Inter-AS Option (10) B network to allow a Multiprotocol
More informationVanguard Managed Solutions
Vanguard Managed Solutions Vanguard Applications Ware IP and LAN Feature Protocols Open Shortest Path First (OSPF) Notice 2003 Vanguard Managed Solutions, LLC 575 West Street Mansfield, Massachusetts 02048
More informationNetwork Configuration Example
Network Configuration Example GMPLS Modified: 2016-12-14 Juniper Networks, Inc. 1133 Innovation Way Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net All rights reserved. Juniper Networks, Junos,
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationNetWare Link-Services Protocol
44 CHAPTER Chapter Goals Describe the Network Link-Service Protocol. Describe routing with NLSP. Describe the data packet used by NLSP. Background The (NLSP) is a link-state routing protocol from Novell
More informationMPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR)
MPLS Traffic Engineering Traffic Protection using Fast Re-route (FRR) Santiago Álvarez August 2008 2007 Cisco Systems, Inc. All rights reserved. 1 MPLS TE Use Cases Strategic Bandwidth Optimization Tactical
More informationEECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.
EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect
More informationCSCD 433/533 Advanced Networks Spring 2016
CSCD 433/533 Advanced Networks Spring 2016 Lecture 13 Router Algorithms and Design Chapter 5 1 Topics Router Algorithms Routing in General Hierarchical routing Interior Gateway Protocols OSPF mention of
More informationConfiguring IP Multicast Routing
34 CHAPTER This chapter describes how to configure IP multicast routing on the Cisco ME 3400 Ethernet Access switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive
More informationOSPFv3 Commands. address-family (OSPFv3), page 4. authentication (OSPFv3), page 7
This module describes the commands used to configure and monitor the IP Version 6 (IPv6) Open Shortest Path First Version 3 (OSPFv3) routing protocol. For detailed information about OSPFv3 concepts, configuration
More informationNetwork Working Group. Category: Standards Track Stanford University March 1994
Network Working Group Request for Comments: 1587 Category: Standards Track R. Coltun RainbowBridge Communications V. Fuller Stanford University March 1994 The OSPF NSSA Option Status of this Memo This
More informationExperimental Study of Dynamic IP Topology Reconfiguration in IP/WDM Networks
Experimental Study of Dynamic IP Topology Reconfiguration in IP/WDM Networks Kevin H. Liu, Changdong Liu, Jorge Pastor, Arunendu Roy, and John Y. Wei Network Operations and Management Research Department,
More informationProtecting an EBGP peer when memory usage reaches level 2 threshold 66 Configuring a large-scale BGP network 67 Configuring BGP community 67
Contents Configuring BGP 1 Overview 1 BGP speaker and BGP peer 1 BGP message types 1 BGP path attributes 2 BGP route selection 6 BGP route advertisement rules 6 BGP load balancing 6 Settlements for problems
More informationÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE. Link State Routing. Jean Yves Le Boudec 2015
ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Link State Routing Jean Yves Le Boudec 2015 1 Contents 1. Link state 2. OSPF and Hierarchical routing with areas 3. Dynamic metrics and Braess paradox 2 1. Link
More informationEnd-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 informationReview for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30
Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30 R1. Let s review some of the terminology used in this textbook. Recall that
More information