Fault-Tolerant Design of Wavelength-Routed Optical. Networks. S. Ramamurthy and Biswanath Mukherjee
|
|
- Dorothy Franklin
- 5 years ago
- Views:
Transcription
1 DIMACS Series in Discrete Mathematics and Theoretical Computer Science Fault-Tolerant Design of Wavelength-Routed Optical Networks S. Ramamurthy and Biswanath Mukherjee Abstract. This paper considers optical networks which employ wavelengthrouting switches that enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node-pairs. In such networks, the failure of a single ber link may cause the failure of several optical channels. Given a set of lightpaths, that may comprise of a logical topology, and alternate routing tables at each node, this paper examines the following problem: how to allocate capacity in an optimal fashion and assign routes and wavelengths to each lightpath, such that, upon any link failure, lightpaths that are aected by the failure can be reestablished without any blocking. A simple approach, called one-on-one protection, protects against link failures by reserving for each lightpath, a link-disjoint backup lightpath. In this paper, we present an alternate protection scheme called multiplexed-spare-capacity protection, that multiplexes the spare capacity among all lightpaths in the logical topology in an optimal fashion. This paper examines the performance (in terms of capacity utilization) of this approach on representative network topologies, and shows that this approach is superior to one-on-one protection. 1. Introduction Wavelength-division multiplexing (WDM) [1] divides the tremendous bandwidth of a ber (potentially a few tens of terabits per second) into many nonoverlapping wavelengths (WDM channels). Each channel can be operated asynchronously and in parallel at any desirable speed, e.g., peak electronic speed of a few Gbps. An access station may transmit signals on dierent wavelengths, which are coupled into the ber using wavelength multiplexers. An optical signal passing through an optical switch may be routed from an input ber to an output ber without undergoing optoelectronic conversion. The architecture of a wavelength-routed optical network, shown in Fig. 1, consists of wavelength-routing switches (WRSs) (labeled 1 through 15) interconnected by ber links. Each link consists of a pair of unidirectional ber links. Technological constraints dictate that the number of WDM channels that can be supported in a ber be limited to W (whose value is a few tens today, but is expected to improve with time and technological breakthroughs). An access station is connected S. Ramamurthy and B. Mukherjee were supported in parts by NSF Grant No. NCR , and grants from Pacic Bell and UC Micro. 1 c0000 (copyright holder)
2 2 S. RAMAMURTHY AND BISWANATH MUKHERJEE to each WRS. For clarity of exposition, we will consider the access-station/wrs combination as an integrated unit which we will refer to as a network node. A connection request is satised by establishing a lightpath from the source node of the connection to the destination node. A lightpath is an all-optical channel which may span multiple ber links, to provide a circuit-switched interconnection between two nodes. In the absence of wavelength converters, a lightpath would occupy the same wavelength on all ber links that it traverses. This is called the wavelength-continuity constraint. Two lightpaths on a ber link must also be on dierent wavelength channels to prevent the interference of the optical signals. Figure 1 shows the following wavelength-continuous lightpaths: (a) between Nodes 10 and 6 on wavelength 1, and (b) between Nodes 15 and 9 on wavelength WC λ2 10 λ1 1 WC 2 6 WC WC 12 Figure 1. Architecture of a wavelength-routed optical network. A logical topology consists of a set of lightpaths set up to exploit the relative strengths of both optics and electronics - viz., packets of information are carried by the logical topology \as far as possible" in the optical domain using optical switching, but packet forwarding from lightpath to lightpath is performed via electronic packet switching, whenever required. The electronic packet-switching may be performed by an ATM switch (or an IP router), in which case the logical topology is operated as an ATM network (or IP network). In this context, we dene the routing and wavelength assignment problem [2] as follows: Given a trac demand (i.e., the number of lightpaths between each node-pair that comprises a logical topology), route and assign wavelengths to the lightpaths such that some network criteria (such as capacity utilization) is optimized. In such a backbone optical network architecture, the failure of a component such as a ber link can lead to the failure of all the lightpaths that traverse the failed link 1. Since each lightpath is expected to operate at a rate of several Gbps, 1 We assume in this paper that a link is unidirectional, and therefore, a link failure is a unidirectional link failure.
3 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS 3 such a failure can lead to a severe disruption in the network. There are several approaches to ensure network survivability [3]. The approach we consider here is that of restoration, where lightpaths aected by a component failure are rerouted around the failure, by reconguring network components such as wavelength-routing switches, transmitters, receivers, etc. Higher protocol layers (such as ATM or IP) operating on the logical topology may have their own protection schemes, and can recover from link failures. An IP network, for example, recovers from link failures by rerouting data packets around the failed link. However, the recovery time for higher layers is still signicantly large (on the order of seconds), whereas we expect that restoration times at the optical layer will be required to be of the order of milliseconds [8]. It is benecial to consider restoration mechanisms in the optical layer for the following reasons [7]: (a) the optical layer can eciently multiplex protection resources (such as spare wavelengths and bers) among several higher layer network applications, and (b) optical layer restoration provides protection to higher layer protocols that may not have built-in protection. This paper considers single link failures in an optical network. There are two well-known approaches [12, 14] to protecting against link failures: (a) link (or span) restoration, and (b) path restoration. In link restoration, all lightpaths that traverse the failed link are rerouted (utilizing the spare capacity) between the endnodes of the failed link. In path restoration, each lightpath that traverses the failed link is rerouted along a dierent route between the source and destination of the lightpath. In an optical network, path restoration may be preferred over link restoration for reasons that include the follwoing: (a) because of the wavelength-continuity constraint, it may be more capacity-ecient to reroute a lightpath from source to destination, and (b) because the optical layer has little intelligence, failure detection may be possible only at the end-nodes of the lightpath. In this paper we consider path-restoration-based approaches to designing a fault-tolerant optical network. Specically, we address the following problem: Given a set of lightpaths, route and assign wavelengths to the lightpaths, and reserve spare capacity in the network, such that upon any link failure, all the lightpaths aected by the failure can be rerouted without any blocking. The optimization criteria we consider here is the total network capacity used, i.e., the sum of the wavelength utilizations over all the links in the network. We examine two approaches to path restoration: (a) one-on-one protection, and (b) multiplexed-spare-capacity protection. These two approaches perform path restoration upon link failures and are based on precomputed routes. One-on-one protection: One-on-one protection [5] reserves a backup lightpath for every lightpath that needs to be protected against link failures. The backup lightpaths are designed such that they do not share any links with their corresponding primary lightpaths. When a primary lightpath fails because of a link failure, its backup lightpath is activated. Upon detecting a failure, all aected node-pairs (i.e., node-pairs whose primary lightpath route includes the failed link) switch to their backup paths. We dene the oneon-one protection problem as follows: Given a trac demand, nd routes and assign wavelengths to the each primary and backup lightpath, such that some network criteria (such as capacity utilization) is optimized.
4 4 S. RAMAMURTHY AND BISWANATH MUKHERJEE Multiplexed-spare-capacity protection: Given a set of lightpaths to be protected against link failures, we reserve wavelength channels in the links of the network intelligently. Wavelength channels for backup routes are shared among primary lightpaths that are link disjoint. This is possible under the assumption of single-link failures, because the link-disjoint primary lightpaths are assumed not to fail simultaneously and therefore may share wavelength channels for their backup routes. This approach ensures that, upon any link failure, all lightpaths that traverse the failed link can be rerouted around the failed link, without blocking any of them, and at the same time also minimizes the number of wavelength channels that need to be reserved in the links of the network. We dene the multiplexed-spare-capacity protection problem as follows: Given a trac demand, nd routes and assign wavelengths to the each primary lightpath, reserve spare capacity, and determine routes and wavelengths of backup lightpaths, such that some network criteria (such as capacity utilization) is optimized. We note that one-on-one protection is a static scheme in the sense that the wavelength switches are congured at setup time, prior to a link failure, for the working and the backup lightpaths. One-on-one protection also has the feature of being failure-independent, i.e., the restoration process does not need to isolate the faulty link. Multiplexed-spare-capacity protection is a dynamic scheme in the sense that, for each backup lightpath, wavelength switches may need to be congured (depending on the link that fails) after a link failure. Multiplexed-spare-capacity protection is also failure-dependent, i.e., the restoration procedures need to isolate the faulty link prior to conguring the backup lightpaths. The multiplexed-spare-capacity approach trades-o the eciency of spare-capacity allocation with added control complexity needed to isolate the fault and congure wavelength-routing switches (and therefore possibly have increased restoration times), to establish backup lightpaths upon a link failure. We illustrate the above approaches in an example. Consider the network illustrated in Fig. 1. Assume that two lightpaths need to be protected against link failures: (a) the rst lightpath from Node 10 to Node 6 and (b) the second lightpath from Node 15 to Node 9. The routes and wavelengths of working and backup lightpaths in one-on-one protection are illustrated in Table 1. Primary Lightpath Backup Lightpath 10! 6 (10,11,1,6) on 1 (10,9,7,6) on 1 15! 9 (15,6,7,9) on 1 (15,14,12,13,1,11,10,9) on 2 Table 1. The routing and wavelengths of primary and backup lightpaths with one-on-one protection. In the following discussion, a wavelength-link is dened to be a wavelength on a link. A total of 16 wavelength-links are reserved on the links of the network, 6 wavelength-links for the primary lightpaths and 10 wavelength-links for the backup lightpaths. We note that the two working lightpaths { (10,11,1,6), and (15,6,7,9) {
5 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS 5 are link disjoint. As a result, upon any link failure, at most one of the two lightpaths can fail, i.e., both lightpaths cannot fail simultaneously upon a link failure. Therefore, the backup lightpaths can share wavelengths since they will not be activated simultaneously. This observation leads to the routes and wavelength assignments for the working and backup lightpaths illustrated in Fig. 2. We note that a total of 15 wavelength-links are reserved in this case, a reduction of 1 wavelength-link from the one-on-one protection case. Primary Lightpath Backup Lightpath 10! 6 (10,11,1,6) on 1 (10,9,7,6) on 1 15! 9 (15,6,7,9) on 1 (15,14,12,13,1,11,10,9) on 1 Table 2. The routing and wavelengths of primary and backup lightpaths with multiplexed-spare-capacity protection Previous work. The design of a survivable optical network has been studied in [5, 6, 7, 8, 9, 10, 11]. In [5], the authors propose physical protection schemes and a path-restoration scheme based on one-on-one protection. The work in [6] considers fault-tolerant design of optical ring networks. In work in [7, 8] addresses the issues in the design of a survivable optical layer. In [9], the authors propose an algorithm that protects optical mesh networks from link and node failures. In [11], the authors propose analytical methods to estimate capacity utilization in optical networks that are resilient against single link failures. Our work considers a path-restoration-based approach utilizing multiplexed-spare-capacity, for protection against link failure in an optical networks, and in this manner is dierent from previous work. Network survivability, restoration schemes, and optimal spare-capacity design have been studied extensively in circuit-switched transport networks [3, 12, 13, 14] Outline of remaining sections. In Section 2, we develop the Integer Linear Programming (ILP) formulations of the one-on-one and multiplexed-sparecapacity protection problems. A solution approach for the ILP formulation, and the complexity of the solution procedure is considered in Section 3. Section 4 presents numerical results for two representative network topologies. Section 5 concludes the paper with a discussion of the main contributions of this work, and related problems for further research. 2. Problem Formulation In this section, we develop ILP formulations of the dierent protection schemes. Specically, we will develop the following three programs. ILP1: This ILP determines the routing and wavelength assignment for a given set of lightpaths without any failure protection. ILP2: This ILP formulates the one-on-one protection problem. ILP3: This ILP formulates the multiplexed-spare-capacity protection problem.
6 6 S. RAMAMURTHY AND BISWANATH MUKHERJEE In the following subsections, we dene the algorithm to nd routes for lightpaths between node-pairs in the network, and then we develop the notation to describe the ILPs Routing. We assume that alternate routing [4] is utilized to perform the routing of lightpaths in the network. Alternate routing requires each node in the network to have a routing table. The routing table at a node contains a set of precomputed routes to each destination node. Any lightpath (which may be a primary lightpath or a backup lightpath) between a node-pair can be satised by any one of the routes (with a free wavelength) among the set of alternate routes at the source node. We assume that the set alternate routes for each node-pair will contain at-least two routes that are link disjoint, and that the set of alternate routes at each source node exploits the connectivity the network topology (i.e., all link-disjoint routes to each destination are included in the set of alternate routes). Table 3 illustrates the routing table at node 1 for the network in Fig. 1, with two (link-disjoint) alternate routes to each destination node. Destination Route1 Route Table 3. The routing table at Node 1 for the network in Fig. 1, with two alternate routes to each destination Notation. We dene the notation employed to develop the ILPs. We are given the following: (a) the network topology represented as a directed graph G, (b) a demand matrix, i.e., the number of lightpath requests between node-pairs, and (c) alternate routing tables at each node. Given: N: Nodes in the network (numbered 1 through N). Node-pairs are numbered 1 through N (N? 1). E: Links in the network (numbered 1 through E). W : Maximum number of wavelengths on a link. R i : Set of alternate routes for node-pair i. M i = jr i j: Number of alternate routes between node-pair i. R i j : Set of eligible alternate routes between node-pair i after link j fails. d i : Demand for node-pair i, in terms of number of lightpath requests. We require the ILPs to solve for the following variables: s j : Number of spare wavelengths used on link j.
7 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS 7 w j : Number are the primary channels used on link j. g : Number of primary lightpath wavelengths used on route r to satisfy the demand between node-pair i, before any link failures. w takes on the value of 1 if the r th route between node-pair i utilizes wavelength w before any link failures, 0 otherwise. fj : Number of spare wavelengths used on the r th route between node-pair i, after link j fails. w;j takes on the value 1 if the rth route for node-pair i uses spare wavelength w after link j fails, 0 otherwise ILP Formulations ILP1 { Routing and Wavelength Assignment with No Protection.. Minimize the total capacity used: M inimize E j=1 Number of lightpaths on each link is bounded: Demand between each node-pair i is satised: d i = r=1 w=1 w j (2.1) w j W 1 j E (2.2) M i W w 1 i N(N? 1) (2.3) Dene the number of primary lightpaths traversing each link: W w j = w 1 j E (2.4) i=1 r2r i ;j2r w=1 Wavelength-continuity constraint, i.e., only one primary lightpath can use a wavelength w on link j: i=1 r2r i :j2r w 1 1 w W; 1 j E (2.5) ILP2 { One-on-One Protection.. Minimize the total capacity used: M inimize E j=1 Number of lightpaths on each link is bounded: w j (2.6) w j W 1 j E (2.7)
8 8 S. RAMAMURTHY AND BISWANATH MUKHERJEE Demand between a node-pair i is satised, and each primary lightpath has a backup lightpath: 2 d i = M i W r=1 w=1 w 1 i N(N? 1) (2.8) Denition of the number of lightpaths (primary and backup) traversing each link: W w j = w 1 j E (2.9) i=1 r2r i ;j2r w=1 Wavelength-continuity constraint, i.e., only one lightpath can use wavelength w on link j: i=1 r2r i :j2r w 1 1 w W; 1 j E (2.10) When a link fails, demands between all node-pairs can still be satised: W r2r i w=1 j w di 1 j E; 1 i N(N? 1) (2.11) ILP3 { Multiplexed-Spare-Capacity Protection.. Minimize the total capacity used: M inimize E j=1 Number of lightpaths on each link is bounded. Before Fault: Demand between each node-pair is satised. (w j + s j ) (2.12) w j + s j W 1 j E (2.13) M i d i = g 1 i N(N? 1) (2.14) r=1 Denition of the number of primary lightpaths traversing a link: W w j = w 1 j E (2.15) i=1 r2r i ;j2r w=1 Wavelength-continuity constraint for primary lightpaths, i.e., only one primary lightpath can use wavelength w on link j: i=1 r2r i :j2r w 1 1 w W; 1 j E (2.16)
9 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS 9 After Fault: Denition of the total number rerouted lightpaths between node-pair i when link j fails: W W w;j = w r2r i w=1 r2r j i :j2r w=1 1 i N(N? 1); 1 r M i ; 1 j E (2.17) Wavelength-continuity constraint for backup lightpaths, i.e., only one backup lightpath can use (spare) wavelength w on link k: w;j 1 1 w W; 1 j; k E (2.18) i=1 r2r i ;k2r j Spare capacity on each link k meets the restoration demands on that link: i=1 W r2r i :k2r w=1 j w;j <= s k + i=1 W r2r i ;j;k2r w=1 3. Solution Approach w 1 j; k E (2.19) The routing and wavelength assignment problem has been shown to be NPcomplete [2]. We expect the one-on-one protection problem, and the multiplexedspare-capacity protection problems to be NP-complete as well. We have used a freeware LP/ILP solver called lpsolve, to solve the instances of the ILPs generated for two representative network topologies. We note that the number of variables and equations for the ILPs grows rapidly with the size of the network, and therefore, the ILP formulations are practical only for small networks (a few tens of nodes). For larger networks (a few hundreds of nodes), we may need to employ heuristic methods. We also note that any solution to the one-on-one protection problem is also a solution to the corresponding multiplexed-spare-capacity protection problem, and therefore the capacity utilization of the one-on-one protection solution is at-least as much as that for the multiplexed-spare-capacity solution. 4. Illustrative Examples and Discussion The performance of any restoration mechanism is measured by the following criteria: (a) capacity utilization, (b) restoration time, and (c) scalability and implementation complexity. In this paper, we provide numerical results for capacity utilization, and make qualitative comments on the restoration time and complexity of the dierent protection approaches. We performed our studies on two representative networks: (a) a network of interconnected rings illustrated in Fig. 1, and (b) the European optical network [15] illustrated in Fig. 2. These topologies were chosen to be representative of typical mesh topologies employed in telecommunications networks. For each network topology and between each node-pair, we chose a set of three alternate routes, ensuring that at least two routes were link disjoint. For each network topology, we ran ILPs 1, 2, and 3 on random logical topologies, where each logical topology had between 5 and 20 lightpaths.
10 10 S. RAMAMURTHY AND BISWANATH MUKHERJEE Figure 2. Topology of the European optical network Results. We tabulate the results for the interconnected-rings network in Table 4. In each row of the table, we illustrate numerical results for two random logical topologies with the same number of lightpaths. The rst column is the number of lightpaths in the random logical topology. The second column indicates the capacity utilization of the optimal routing and wavelength assignment of the lightpaths obtained from ILP1. The third and fourth column contain three-tuples (l; v; c) for the one-on-one protection (ILP2) and multiplexed-spare-capacity protection (ILP3), respectively, where l is the lower bound for the ILP obtained by relaxing the integer constraints, v is the optimal value of the capacity utilization, and c is the \congestion" value of the optimal solution, where congestion is the wavelength utilization of the link that has the maximum number of lightpaths traversing through itself. The fth column illustrates the gain in capacity utilization of the multiplexed-spare-capacity solution relative to the one-on-one solution. We note that multiplexed-spare-capacity protection provides moderate gains in capacity utilization, as well as in congestion, over one-on-one protection. The numerical results are also illustrated graphically in Fig. 3. Figure 5 illustrates the performance of dierent protection schemes, for the interconnected-rings network, enhanced with two added rings, shown in Fig. 4. We note that the enhanced interconnected-rings network, has a better capacity utilization relative to the interconnected-rings network in 1 for both protection schemes, because there are more link-disjoint and shorter routes between node-pairs. Figure 6 illustrates the performance of dierent protection schemes, for the European optical network illustrated in Fig. 2. Again, we observe that multiplexedspare-capacity protection provides moderate gains in capacity utilization, as well as in congestion, over one-on-one protection.
11 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS Capacity utilization Vs Number of lightpaths No spare capacity One-on-one protection Multiplexed lower bound Multiplexed protection 140 Capacity utilization Number of lightpaths Figure 3. Performance of dierent protection schemes for the interconnected-rings network. Connections No Protection One-on-One (l,v,c) Multiplexed (l,v,c) Gain ,30,2 26,26, ,27,4 25,25, ,32,3 27,27, ,43,3 37,37, ,47,3 41,41, ,44,3 37,37, ,49,3 42,43, ,57,4 48,48, ,55,3 47,47, ,63,5 54,55, ,69,4 63,63, ,67,4 55,55, ,80,5 71,71, ,65,4 55,55, ,77,5 66,66, ,77,6 64,64, ,88,5 74,74, ,88,6 74,74, ,102,7 91,92, ,89,7 74,74, ,93,5 79,79, ,91,7 71,71, ,100,8 83,83, ,116,7 97,97, ,119,7 99,99, ,113,6 93,93, ,114,7 92,92, ,106,7 86,86, ,125,7 99,99, ,122,7 101,101, ,117,7 86,87, ,132,7 104,104,5 28 Table 4. Results for the interconnected-rings network 5. Conclusion Optical networks based on WDM technology can potentially transfer several Gbps of data on each ber link in the network. However, the high bandwidths
12 12 S. RAMAMURTHY AND BISWANATH MUKHERJEE Figure 4. The interconnected-rings network in Fig. 1 with two added rings. Capacity utilization Capacity utilization Vs Number of lightpaths No spare capacity One-on-one protection Multiplexed lower bound Multiplexed protection Extended ring - No spare capacity Extended ring - One-on-one protection Extended ring - Multiplexed lower bound Extended ring - Multiplexed protection Number of lightpaths Figure 5. Performance of dierent protection schemes for the extended interconnected-rings network. carried by links have the drawback that a link failure can potentially lead to the loss of a large amount of data.
13 FAULT-TOLERANT DESIGN OF WAVELENGTH-ROUTED OPTICAL NETWORKS Capacity utilization Vs Number of lightpaths No spare capacity One-on-one protection Multiplexed lower bound Multiplexed protection 140 Capacity utilization Number of lightpaths Figure 6. Performance of dierent protection schemes for the European optical network. This paper considered two restoration mechanisms for protecting a logical topology from single-link failures: (a) one-on-one protection, and (b) multiplexed-sparecapacity protection. One-on-one protection is based on precomputed link-disjoint alternate paths and is failure independent. The backup paths in one-on-one protection are specied and congured statically prior to the occurrence of the failure. Multiplexed-spare-capacity protection is also based on precomputed alternate paths and is failure dependent. The backup paths are computed at setup time but they congured dynamically after a link-failure. This paper formulated the one-on-one protection problem, and the multiplexedspare-capacity protection problem as integer linear programs. The numerical results obtained for two representative network topologies and for random logical topologies indicate that multiplexed-spare-capacity protection provides moderate gains in capacity utilization over one-on-one protection. We are currently performing simulation-based studies on the restoration times for dierent protection schemes, and we will report these results in the future. This paper assumed the existence of fault-detection and isolation capabilities in the network. However, fault-detection and isolation is a challenging problem in optical networks, because of the lack of optical processing within the network. In addition to single-link failures, other failure scenarios in optical networks that merit further study include: channel failures, node failures, and multiple failures of nodes and/or links. The design of the control network, and control protocols for optical layer restoration are important areas for further research. References [1] B. Mukherjee, Optical Communication Networks, New York: McGraw-Hill, July [2] R. Ramaswami and K. N. Sivarajan, \Routing and Wavelength Assignment in All-Optical Networks," IEEE/ACM Transactions on Networking, vol. 3, no. 5, pp , October 1995.
14 14 S. RAMAMURTHY AND BISWANATH MUKHERJEE [3] T. Wu, Fiber Network Service Survivability, Artech House, [4] S. Ramamurthy and B. Mukherjee, \Modeling and Simulation of Fixed Alternate Routing and Wavelength Conversion in Wavelength Routed Optical Networks," Technical Report CSE-97-16, Dept. of Computer Science, UC Davis, November [5] J. Armitage, O. Crochat, and J.-Y. Le Boudec, \Design of a Survivable WDM Photonic Network," Proc., IEEE INFOCOM '97, Kobe, Japan, pp , April [6] O. Gerstel, R. Ramaswami, and G. Sasaki, \Fault Tolerant Multiwavelength Optical Rings with Limited Wavelength Conversion," Proc., IEEE INFOCOM '97, Kobe, Japan, pp , April [7] O. Gerstel, \Opportunities for optical protection and restoration," Proc., OFC '98, San Jose, CA, vol. 2, pp , February [8] P. Bonenfant, \Optical layer survivability: a comprehensive approach," Proc., OFC '98, San Jose, CA, vol. 2, pp , February [9] S. G. Finn, M. Medard, and R. A. Barry, \A new algorithm for bi-directional link selfhealing for arbitrary redundant networks," Proc., OFC '98, San Jose, CA, vol. 2, pp , February [10] E. Karasan, and E. Goldstein, \Optical restoration at the wavelength-multiplex section level in WDM mesh networks," Proc. OFC '98, San Jose, CA, vol. 2, pp , February [11] E. Limal, S. L. Danielsen, and K. E. Stubkjaer, \Capacity utilization in resilient wavelengthrouted optical networks using link restoration," Proc. OFC '98, San Jose, CA, vol. 2, pp , February [12] R. R. Iraschko, M. H. MacGregor, and W. D. Grover, \Optimal Capacity Placement for Path Restoration in Mesh Survivable Networks," Proc., ICC '96, Dallas, Texas, pp , June [13] M. Herzberg, S. J. Bye, and A. Utano, \The Hop-Limit Approach for Spare-Capacity Assignment in Survivable Networks," IEEE/ACM Transactions on Networking, vol. 3, no. 6, pp , December [14] J. Anderson, B. T. Doshi, S. Dravida, and P. Harshavardhana, \Fast Restoration of ATM Networks," IEEE Journal on Selected Areas in Communications, vol. 12, no. 1, pp , January [15] M. Garnot, M. Sotom, and F. Masetti, \Routing Strategies for Optical Paths in WDM Networks," Proc., ICC '97, Montreal, Canada, pp , June Department of Computer Science, University of California, Davis, CA 95616, U.S.A. address: ramu@cs.ucdavis.edu Department of Computer Science, University of California, Davis, CA 95616, U.S.A. address: mukherje@cs.ucdavis.edu
Survivable WDM Mesh Networks
870 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 21, NO. 4, APRIL 2003 Survivable WDM Mesh Networks S. Ramamurthy, Laxman Sahasrabuddhe, Member, IEEE, and Biswanath Mukherjee, Member, IEEE Abstract In a wavelength-division-muliplexing
More informationFixed-Alternate Routing and Wavelength Conversion in. Wavelength-Routed Optical Networks. Department of Computer Science
Fixed-Alternate Routing and Wavelength Conversion in Wavelength-Routed Optical Networks S. Ramamurthy y and Biswanath Mukherjee Department of Computer Science University of California, Davis, CA 9566,
More informationA Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks
A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks Wojciech Molisz and Jacek Rak Gdansk University of Technology, G. Narutowicza 11/12, Pl-8-952 Gdansk, Poland
More informationDistributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks
Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks Balaji Palanisamy, T. Siva Prasad, N.Sreenath 1 Department of Computer Science & Engineering and Information technology Pondicherry
More informationA Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks
Proceedings of the International Conference on Computer and Communication Engineering 008 May 3-5, 008 Kuala Lumpur, Malaysia A Modified Heuristic Approach of Logical Topology Design in WDM Optical Networks
More informationAn 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 informationOptical Communications and Networking 朱祖勍. Nov. 27, 2017
Optical Communications and Networking Nov. 27, 2017 1 What is a Core Network? A core network is the central part of a telecommunication network that provides services to customers who are connected by
More informationWavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks
Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks Amit Shukla, L. Premjit Singh and Raja Datta, Dept. of Computer Science and Engineering, North Eastern Regional Institute
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More informationOPTICAL 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 informationSparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms
Sparse Converter Placement in WDM Networks and their Dynamic Operation Using Path-Metric Based Algorithms Sanjay K. Bose, SMIEEE, Y.N. Singh, MIEEE A.N.V.B. Raju Bhoomika Popat Department of Electrical
More 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 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 informationAnalysis 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 informationA Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,
More informationDesign Methodologies and Algorithms for Survivable C-RAN
16 Regular papers ONDM 218 Design Methodologies and Algorithms for Survivable C-RAN Bahare M. Khorsandi, Federico Tonini, Carla Raffaelli DEI, University of Bologna Viale Risorgimento 2, 4136 Bologna,
More informationn = 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 informationA 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 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 informationSurvivable Lightpath Routing: A New Approach to the Design of WDM-Based Networks
800 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 4, MAY 2002 Survivable Lightpath Routing: A New Approach to the Design of WDM-Based Networks Eytan Modiano, Senior Member, IEEE and Aradhana
More informationSurvivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation
Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation Muhammad S. Javed, Krishnaiyan Thulasiraman, Matthew A. Gaines School of Computer Science, University
More informationMulticonfiguration 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 informationDYNAMIC RECONFIGURATION OF LOGICAL TOPOLOGIES IN WDM-BASED MESH NETWORKS
DYNAMIC RECONFIGURATION OF LOGICAL TOPOLOGIES IN WDM-BASED MESH NETWORKS Shinya Ishida Graduate School of Information Science and Technology, Osaka University Machikaneyama 1-32, Toyonaka, Osaka, 0-0043
More informationA 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 informationNetwork 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 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 informationA2 A1. Virtual. Topology. Design. A l5. l4 l6. Physical. Topology
EIDGEN OSSISCHE TECHNISCHE HOCHSCHULE LAUSANNE POLITECNICO FEDERALE DI LOSANNA SWISS FEDERAL INSTITUTE OF TECHNOLOGY LAUSANNE Communication Systems Division (SSC) EPFL CH-1015 Lausanne, Switzerland http://sscwww.ep.ch
More informationA 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 informationA Novel Efficient Design of Survivable WDM Mesh Networks
1684 JOURNAL OF COMPUTERS, VOL. 9, NO. 7, JULY 2014 A Novel Efficient Design of Survivable WDM Mesh Networks HONG HUI LI, XUE LIANG FU College of Computer and Information Engineering Inner Mongolia Agricultural
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 informationAvailable online at ScienceDirect
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 0 ( 0 ) 900 909 International Conference on Computational Intelligence: Modeling, Techniques and Applications (CIMTA-0) Multicast
More informationSurvivability with P-Cycle in WDM Networks
Survivability with P-Cycle in WDM Networks K. Aparna 1, P. Ramya Krishna 2 JNTUA College of Engineering, Pulivendula Abstract: In this paper we discuss about the Pre-Configured survivability schemes. Network
More informationDYNAMIC 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 informationDesign of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
166 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 Design of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
More informationTHE EXPLOSIVE growth of Web-related services over the. A Practical Approach to Operating Survivable WDM Networks
34 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 A Practical Approach to Operating Survivable WDM Networks Murari Sridharan, Student Member, IEEE, Murti V. Salapaka, and
More informationComparison of Protection Cost at IP or WDM Layer
Comparison of Protection Cost at IP or WDM Layer Mauro Cuna Politecnico di Tori - Tori, Italy Email: {mellia}@tlc.polito.it Marco Mellia Politecnico di Tori - Tori, Italy Email: {mellia}@tlc.polito.it
More informationDynamic 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 informationPreserving Survivability During Logical Topology Reconfiguration in WDM Ring Networks
Preserving Survivability During Logical Topology Reconfiguration in WDM Ring Networks Hwajung Lee, Hongsik hoi, Suresh Subramaniam, and Hyeong-Ah hoi Department of omputer Science and Electrical and omputer
More informationSignal-Quality Consideration for Dynamic Connection Provisioning in All- Optical Wavelength-Routed Networks
Signal-Quality Consideration for Dynamic Connection Provisioning in All- Optical Wavelength-Routed Networks Biswanath Mukherjee Professor of Computer Science, UC Davis mukherje@cs.ucdavis.edu Acknowledgement:
More informationA Review of Fault Management in WDM Mesh Networks: Basic Concepts and Research Challenges
A Review of Fault Management in WDM Mesh Networks: Basic Concepts and Research Challenges Jing Zhang and Biswanath Mukherjee, University of California Abstract This article first presents a broad overview
More informationSplitter 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 informationLogical Topology Design for Linear and Ring Optical Networks
62 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL 20, NO 1, JANUARY 2002 Logical Topology Design for Linear and Ring Optical Networks Amrinder S Arora, Suresh Subramaniam, Member, IEEE, and Hyeong-Ah
More informationWavelength-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 informationWAVELENGTH-DIVISION multiplexed (WDM) optical
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 9, NOVEMBER 2004 1823 A Dynamic Routing Algorithm With Load Balancing Heuristics for Restorable Connections in WDM Networks Lu Ruan, Member,
More informationToward the joint design of electronic and optical layer protection
Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS
More informationA 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 informationTRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS
TRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS K.Pushpanathan 1, Dr.A.Sivasubramanian 2 1 Asst Prof, Anand Institute of Higher Technology, Chennai-603103 2 Prof &
More informationNew and Improved Approaches for Shared-Path Protection in WDM Mesh Networks
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 22, NO. 5, MAY 2004 1223 New and Improved Approaches for Shared-Path Protection in WDM Mesh Networks Canhui (Sam) Ou, Student Member, IEEE, Jing Zhang, Student Member,
More informationProtection Interoperability for WDM Optical Networks
384 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 8, NO 3, JUNE 2000 Protection Interoperability for WDM Optical Networks Olivier Crochat, Member, IEEE, Jean-Yves Le Boudec, Member, IEEE, and Ornan Gerstel,
More informationSpare Capacity Allocation Using Partially Disjoint Paths for Dual Link Failure Protection
Spare Capacity Allocation Using Partially Disjoint Paths for Dual Link Failure Protection Victor Yu Liu Network Advanced Research, Huawei Technologies Santa Clara, California, USA yuliu@ieee.org Abstract
More information1. INTRODUCTION light tree First Generation Second Generation Third Generation
1. INTRODUCTION Today, there is a general consensus that, in the near future, wide area networks (WAN)(such as, a nation wide backbone network) will be based on Wavelength Division Multiplexed (WDM) optical
More informationFault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue
Fault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue Sandip R. Shinde Research Scholar, Sathyabama University, Chennai & Assistant Professor, Vishwakarma
More informationEfficient path protection using Bi-directional WDM transmission technology. Title
Title Efficient path protection using Bi-directional WDM transmission technology Author(s) Li, J; Yeung, KL Citation Globecom - Ieee Global Telecommunications Conference, 2005, v. 4, p. 1910-1914 Issued
More informationMULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION
MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION B. CHIDHAMBARARAJAN a,1 K.KALAMANI a,2 N. NAGARAJAN b,2 S.K.SRIVATSA a,3 Department of Electronics and Communication
More informationTraffic 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 informationIO2654 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 informationMulti-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures
Multi-layer Network Recovery: Avoiding Traffic Disruptions Against Fiber Failures Anna Urra, Eusebi Calle, and Jose L. Marzo Institute of Informatics and Applications (IIiA), University of Girona, Girona
More informationAnalysis and Algorithms for Partial Protection in Mesh Networks
Technical Report, April 2011 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
More informationn = 2 n = 2 n = 1 n = 1 λ 12 µ λ λ /2 λ /2 λ22 λ 22 λ 22 λ n = 0 n = 0 λ 11 λ /2 0,2,0,0 1,1,1, ,0,2,0 1,0,1,0 0,2,0,0 12 1,1,0,0
A Comparison of Allocation Policies in Wavelength Routing Networks Yuhong Zhu a, George N. Rouskas b, Harry G. Perros b a Lucent Technologies, Acton, MA b Department of Computer Science, North Carolina
More information218 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 1, FEBRUARY 2006
218 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 14, NO 1, FEBRUARY 2006 Survivable Virtual Concatenation for Data Over SONET/SDH in Optical Transport Networks Canhui (Sam) Ou, Student Member, IEEE, Laxman
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More 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 information1636 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 15, NO. 9, SEPTEMBER Design of Wavelength-Routed Optical Networks for Packet Switched Traffic
1636 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 15, NO. 9, SEPTEMBER 1997 Design of Wavelength-Routed Optical Networks for Packet Switched Traffic Subrata Banerjee, Jay Yoo, Chien Chen Abstract We consider
More informationTraffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks
Traffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks Ankitkumar N. Patel, Chengyi Gao, and Jason P. Jue Erik Jonsson School of Engineering and Computer Science The University
More informationA NEW TRAFFIC AGGREGATION SCHEME IN ALL-OPTICAL WAVELENGTH ROUTED NETWORKS
A NEW TRAFFIC AGGREGATION SCHEME IN ALL-OPTICAL WAVELENGTH ROUTED NETWORKS Nizar Bouabdallah^'^, Emannuel Dotaro^ and Guy Pujolle^ ^Alcatel Research & Innovation, Route de Nozay, F-91460 Marcoussis, France
More informationOPTICAL NETWORKS. Optical Metro Networks. A. Gençata İTÜ, Dept. Computer Engineering 2005
OPTICAL NETWORKS Optical Metro Networks A. Gençata İTÜ, Dept. Computer Engineering 2005 Introduction Telecommunications networks are normally segmented in a three-tier hierarchy: Access, metropolitan,
More informationProgress Report No. 13. P-Cycles and Quality of Recovery
NEXT GENERATION NETWORK (NGN) AVAILABILITY & RESILIENCE RESEARCH Progress Report No. 13 P-Cycles and Quality of Recovery The University of Canterbury Team 12 April 2006 Abstract Since the p-cycle resilience
More informationROUTING AND WAVELENGTH ASSIGNMENT FOR SCHEDULED AND RANDOM LIGHTPATH DEMANDS: BIFURCATED ROUTING VERSUS NON-BIFURCATED ROUTING
ROUTING AND WAVELENGTH ASSIGNMENT FOR SCHEDULED AND RANDOM LIGHTPATH DEMANDS: BIFURCATED ROUTING VERSUS NON-BIFURCATED ROUTING Mohamed KOUBAA, Nicolas PUECH, and Maurice GAGNAIRE Telecom Paris - LTCI -
More informationEfficient Segmentation based heuristic approach for Virtual Topology Design in Fiber Optical Networks
Efficient Segmentation based heuristic approach for Virtual Topology Design in Fiber Optical Networks P. Venkataravikumar 1, Prof. Bachala Sathyanarayana 2 Research Scholar 1, Department of Computer Science
More informationPrioritized Shufflenet Routing in TOAD based 2X2 OTDM Router.
Prioritized Shufflenet Routing in TOAD based 2X2 OTDM Router. Tekiner Firat, Ghassemlooy Zabih, Thompson Mark, Alkhayatt Samir Optical Communications Research Group, School of Engineering, Sheffield Hallam
More informationMaximizing Reliability in WDM Networks through Lightpath Routing
Maximizing Reliability in WDM Networks through Lightpath Routing The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published
More informationSurvivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks
Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks Ajay Todimala and Byrav Ramamurthy Department of Computer Science and Engineering University of Nebraska-Lincoln Lincoln
More informationDiversity Coded 5G Fronthaul Wireless Networks
IEEE Wireless Telecommunication Symposium (WTS) 2017 Diversity Coded 5G Fronthaul Wireless Networks Nabeel Sulieman, Kemal Davaslioglu, and Richard D. Gitlin Department of Electrical Engineering University
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 informationA 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 informationToward 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 informationIEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 1, FEBRUARY /$ IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 1, FEBRUARY 2010 67 1+NNetwork Protection for Mesh Networks: Network Coding-Based Protection Using p-cycles Ahmed E. Kamal, Senior Member, IEEE Abstract
More informationON JOINT RESTORATION OF PACKET-OVER-OPTICAL NETWORKS
ON JOINT RESTORATION OF PACKET-OVER-OPTICAL NETWORKS Chunxiao Chigan 1,2 Gary W. Atkinson 1 Ramesh Nagarajan 1 Thomas G. Robertazzi 2 1 Bell Labs, Lucent Technologies, 101 Crawfords Corner Road, NJ 07733
More informationAn Efficient Algorithm for Virtual-Wavelength-Path Routing Minimizing Average Number of Hops
An Efficient Algorithm for Virtual-Wavelength-Path Routing Minimizing Average Number of Hops Harsha V. Madhyastha Department of Computer Science and Engineering Indian Institute of Technology, Madras Chennai,
More informationDIVERSION: A Trade-Off Between Link and Path Protection Strategies
DIVERSION: A Trade-Off Between Link and Path Protection Strategies Srinivasan Ramasubramanian and Avinash S. Harjani Department of Electrical and Computer Engineering University of Arizona, Tucson, AZ
More informationA 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 informationShared Protection by Concatenated Rings in Optical WDM Networks
Shared Protection by Concatenated Rings in Optical WDM Networks Hyunseung Choo, Minhan Son, Min Young Chung, and Tae-Jin Lee School of Information and Communication Engineering Sungkyunkwan University
More informationScalable Design of Resilient Optical Grids
Scalable Design of Resilient Optical Grids Marc De Leenheer Ghent University - IBBT On-Demand Network Services for the Scientific Community Terena Networking Conference 2009, June 7 th, Malaga, Spain GRID
More informationResilient 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 informationA 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 informationCost Eective Trac Grooming in WDM Rings. Ori Gerstel and Rajiv Ramaswami
Cost Eective Trac Grooming in WDM Rings Ori Gerstel and Rajiv Ramaswami Tellabs Operations Inc, Optical etwork Group, Hawthorne, Y, fori, rajivg@tellabscom Galen Sasaki U Hawaii, Dept Elec Engg, Honolulu,
More informationApplication-Aware Protection in DWDM Optical Networks
Application-Aware Protection in DWDM Optical Networks Hamza Drid, Nasir Ghani, Bernard Cousin To cite this version: Hamza Drid, Nasir Ghani, Bernard Cousin. Application-Aware Protection in DWDM Optical
More informationTRANSPORT networks are WAN s that provide connectivity
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 7, NO. 5, OCTOBER 1999 767 Provisioning Algorithms for WDM Optical Networks Murat Alanyali, Member, IEEE, and Ender Ayanoglu, Fellow, IEEE Abstract This paper
More informationMODERN RECOVERY MECHANISMS FOR DATA TRANSPORT NETWORKS
MODERN RECOVERY MECHANISMS FOR DATA TRANSPORT NETWORKS IT Specialist Dorina LuminiŃa Copaci Gorj Court IT Expert Constantin Alin Copaci ANRCTI Bucharest Abstract: A large number of recovery mechanisms
More informationResearch 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 informationIterative 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 informationEstablishment of Survivable Connections in WDM Networks using Partial Path Protection
Establishment of Survivable Connections in WDM Networks using Partial Path Protection G. Xue 1, Senior Member, IEEE, W. Zhang 1,J.Tang 1, and K. Thulasiraman 2, Fellow, IEEE Abstract As a generalization
More informationBackup segments. Path after failure recovery. Fault. Primary channel. Initial path D1 D2. Primary channel 1. Backup channel 1.
A Segmented Backup Scheme for Dependable Real Time Communication in Multihop Networks Gummadi P. Krishna M. Jnana Pradeep and C. Siva Ram Murthy Department of Computer Science and Engineering Indian Institute
More informationLayer-Wise Topology Design for Cost Effective IP-Optical Networks
Communications and Networ, 2012, 4, 88-92 http://dx.doi.org/10.4236/cn.2012.41012 Published Online February 2012 (http://www.scirp.org/journal/cn) Layer-Wise Topology Design for Cost Effective IP-Optical
More informationWAVELENGTH CONVERTERS IN DYNAMICALLY- RECONFIGURABLE WDM NETWORKS
IEEE COMMUNICATIONS SURVEYS WAVELENGTH CONVERTERS IN DYNAMICALLY- RECONFIGURABLE WDM NETWORKS JENNIFER M. YATES AND MICHAEL P. RUMSEWICZ, THE ROYAL MELBOURNE INSTITUTE OF TECHNOLOGY JONATHAN P. R. LACEY,
More informationRollout 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 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 informationHierarchical Traffic Grooming in WDM Networks
Hierarchical Traffic Grooming in WDM Networks George N. Rouskas Department of Computer Science North Carolina State University Joint work with: Rudra Dutta (NCSU), Bensong Chen (Google Labs), Huang Shu
More informationCost-Effective Traffic Grooming in WDM Rings
618 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 Cost-Effective Traffic Grooming in WDM Rings Ornan Gerstel, Member, IEEE, Rajiv Ramaswami, Fellow, IEEE, and Galen H. Sasaki, Member,
More informationHierarchical Traffic Grooming Formulations
Hierarchical Traffic Grooming Formulations Hui Wang, George N. Rouskas Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206 USA Abstract Hierarchical
More information