Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks
|
|
- Jeffery Summers
- 5 years ago
- Views:
Transcription
1 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 of Science and Technology (NERIST), Nirjuli, Arunachal Pradesh-799 ABSTRACT In this paper, we present a polynomial time algorithm that gives a good solution to the routing and wavelength assignment (RWA) problem in a ring topology. A ring topology is an important form of network topology as it is simple, easy to deploy and fault tolerant. One of the major design issues in wavelength-division multiplexed networks is the assignment of the limited number of wavelengths among network stations so that greater capacity can be achieved. The problem of RWA is known to be NP-hard problem. This paper presents an algorithm that assigns the available number of wavelengths efficiently to maximize one-hop traffic in a ring topology. For a N-node ring topology the algorithm uses dynamic programming with time-complexity of O(N 3 W) for W available wavelengths. Index Terms Lightpath, routing and wavelength assignment (RWA), optical networks, wavelength-division multiplexed (WDM), traffic matrix, one-hop traffic. I. INTRODUCTION Optical networks employing wavelength-division multiplexing (WDM) is seen as the technology of the future. With the explosive growth of Internet and bandwidthintensive applications such as video-on-demand and multimedia conferencing the demand for bandwidth at lower costs is increasing day by day. A WDM optical network consists of wavelength routing nodes interconnected by pointto-point optical fiber links in an arbitrary topology. The WDM is a multiplexing technique that has led to efficient bandwidth utilizations up to few Tb/s. WDM network architecture is classified into three groups: broadcast-and-select networks, wavelength routed networks, and linear light wave networks. Wavelength routed networks can avoid problems such as: lack of wavelength reuse, power splitting loss, and scalability to wide area networks (WANs). In such networks, a message is sent from one node to another using a wavelength continuous route called a lightpath, without requiring any optical-electronic-optical conversion and buffering at the intermediate nodes. This process is known as wavelength routing. An algorithm used for selecting routes and wavelengths to establish lightpaths is Corresponding author, raja_datta_nerist@yahoo.com, Ph no: known as routing and wavelength assignment (RWA) algorithm. The wavelength assignment must obey the following constraints: (a) Two lightpaths must not be assigned the same wavelength on a given link and (b) If no wavelength conversion is available, then a lightpath must be assigned the same wavelength on all the links in each route. Number of wavelengths available over a link is always limited, so they should be assigned in such a way that maximum logical connections can be established. Many researchers have studied the RWA problem and proposed various heuristic algorithms. The schemes differ in the assumptions on traffic pattern, availability of wavelength converter and desired objectives. Ramaswami and Sivaranjan [] formulated RWA problem as Integer Linear Program (ILP) which is an NP-hard problem. There is a vast body of literature describing routing and wavelength assignment heuristics [2,3,4]. Most of the good heuristic policies are based on the approach where most of the traffic can be handled in one-hop. By one-hop we mean one optical hop, where data travels from source node to destination node without any optical electronic optical (O/E/O) or wavelength conversion. Ozdaglar and Bertsekas[5] adopted a (quasi-)static view of the problem and proposed a integer linear programming formulation. Zhang and Acampora [3] introduced one of the most popular heuristic algorithms for RWA. Given the long-term average traffic between node pairs in the form of a traffic matrix, largest-traffic-first scheme was used to line up the connection requests for setting up the lightpaths. The scheme designs the logical topology by first attempting to set up lightpath between the node-pairs having the largest traffic between them in the traffic matrix. It then attempts to set up lightpath for the node pairs having the next largest traffic and so on, the constraints being the physical topology and the limited number of wavelengths per link. For a physical topology of N nodes, in the worst case, the complexity of the algorithm is O(N 4 ). Datta, Mitra, Ghose and Sengupta [6] proposed a polynomial time algorithm, which attempts to optimize the assignment of a wavelength in terms of maximizing one-hop traffic in a tree topology. The algorithm sets up lightpaths in a tree topology with a single wavelength in a way that can handle maximum one-hop traffic. In this paper, we present a polynomial time algorithm, which tries to maximize one hop-traffic in a ring topology for wavelength selective WDM network. A ring topology is an important form of network topology as it is simple, easy to deploy and fault tolerant. We show that the worst-case complexity of our algorithm for a ring with N-nodes is O(N 3 )
2 in case of a single wavelength. With the help of simulations, we compare our work in a WDM framework with one of the best-known heuristic wavelength assignment algorithms presented in [4]. The simulation results show a considerable improvement in terms of one-hop traffic. For a network of N-nodes, in static case, the traffic demand between any pair of nodes can be specified by a traffic matrix. The demand between node pairs is assumed to be bidirectional. It is assumed that the allocation of a single lightpath can take care of the entire traffic between any two nodes. The rest of the paper is organized as follows: In section II, we present our ring-topology algorithm. Simulation results are presented in Section III and we give the conclusion in Section IV. II. THE RING-TOPOLOGY ALGORITHM In this section, we present the algorithm for assigning multiple wavelengths to establish lightpaths in a ring topology. A. Basic Concept The algorithm uses the concept of cutting a node of a ring topology into two halves so as to form a line topology. For assignment of every wavelength, we start at any one end of the line (i.e one half of the cut node) and proceed towards the other end (the other half of the cut node) computing the maximum traffic and lightpath allocation at each node. We call the line topology as a node-cut. The optimal allocation of lightpaths for that node-cut is finally stored at the end node. The node-pairs those have not been allocated a wavelength are then tried with other available wavelengths similarly. Thus, we cut each and every node and repeat the whole procedure calculating the maximum traffic handled for each node-cut. The node-cut that leads to the establishment of lightpaths that can handle the maximum one-hop traffic is selected, and the corresponding assignment of wavelengths are considered to be efficient in terms of maximizing one-hop traffic. As an example, let us consider a line topology of three nodes; say,, and 2 [Fig. (a)] and its corresponding traffic matrix in Fig. (b). 2 Fig (a): Example of Wavelength Assignment in Line Topology Fig (b): An Imaginary Traffic Matrix Let the traffic between two node n and node n 2 be denoted by T(n, n 2 ). If two lightpaths are established, one between node and node and the other between node and node 2 the total traffic handled is x= T(,) + T(,2) = = 32 Instead, if a single lightpath is established between node and node 2, then the traffic handled is x2= T(,2) = 86 As only one of the above options can be established with a single wavelength, the first one is chosen so that more traffic can be handled in that case. Thus optimal lightpath establishment will be --2. Fig. 2(a) and 2(b) shows how a 4-node ring topology can be converted to a line topology by cutting node into two halves. cut Fig 2: (a) Ring Topology wit a node-cut 2 3 Fig 2: (b) Ring converted to line after node is cut into two halves. We next present our algorithm for the establishment of lightpaths in a ring topology. In our algorithm, we assume that each node contains the information of the maximum traffic that can be handled, with one wavelength, and also the information of the establishment of lightpaths at that node. B. The Algorithm We assume that the long term average (relative) traffic demand between nodes of a ring is given by an N N traffic matrix T, where N is the number of network nodes, and the (i, j) th element, t ij the long-term average traffic demand between node i and node j. The diagonal elements of the matrix are zero. Though the average traffic demand between any two nodes may be asymmetric, we assume a symmetric traffic matrix i.e., t ij = t ji. This is because, if a lightpath is assigned between any two nodes, it is expected to carry traffic for both the ways. We use the following notations to present the algorithm. The input to this algorithm is a ring R with n nodes. Let the n nodes be represented sequentially with the subscript starting from to n-. If any node i is cut to stretch the ring into a line, its one part (one end of the line) is denoted by cnode and the other part by cnode n (the other end of the line). Thus the number of nodes become n+, and they can now be represented as cnode, cnode, cnode 2 cnode n. Let V(i) denote the value of traffic stored at node i and L w (i) denote 2 3
3 the lightpath allocations stored at node i for wavelength w. l(i,j) denotes a lightpath between node i and node j. W be the number of available wavelengths. Let total_traf denote the total traffic handled after assignment of all the available wavelengths in a particular node-cut. Let max_tot_traf denotes the maximum of all the total_traf calculated for every node-cut. light_node_cut represents the intermediate lightpath allocation for a node-cut and light_final denotes the final lightpath allocation at the end of the algorithm. Let function reset() initializes the node-contents V(i) to zero and L w (i)) to null. Also initially the value of max_tot_traf is zero. We now present the dynamic optimal ring algorithm in pseudo-code as a function Opt-Ring as follows. Opt-Ring (n, W, T) for (node-cut from k = to n- ) reset(); T =T; total_traf=; for (wavelength from to W) max_traf = ; for(i = to n) V(i)= ; for (i = n- to ) for(j = i+ to n) if (i == ) if (T (cnode i,cnode j )==V(cnode j )) Check whether lightpath stored in V(cnode j )is a direct lightpath between cnode j and cnode n. If yes, make the traffic of the longer path as zero (If the paths are equal any one can be made zero); if(max_traf < (T (cnode i,cnode j )+V(cnode j )) max_traf = T (cnode i,cnode j )+V(cnode j ); V(cnode i ) = max_traf; if (T ( cnode i,cnode j )!= ) L w (cnode i ) = l(cnode i,cnode j ) + L w (cnode j ); T (cnode i, cnode j )=; else L w (cnode i ) = L w (cnode j ); total_traf = total_traf + V(cnode ); light_node_cut w = L w (cnode ); light_node_cut = light_node_cut + light_node_cut w ; if(max_tot_traf < total_traf) max_tot_traf = total_traf; light_final = light_node_cut corresponding to node-cut with max_tot_traf; The algorithm first cuts a node of the ring topology to convert it into a line topology. It then assigns the first available wavelength as follows: The algorithm works in a bottom-up fashion. Given the allocation of lightpaths in terms of maximizing one-hop traffic in an end-section of a line topology (e.g. the section 2-3- of the line topology in Fig. 2 (b)), it computes the allocation of lightpaths till the preceding node by adding a link (the section of the line in Fig. 2 (b)). It continues to compute the allocation of lightpaths dynamically in this fashion till it reaches the beginning node of the line topology. The algorithm keeps the value of the maximum one-hop traffic that can be handled till a node (say i) in V(i) and corresponding lightpath allocation in L (i). The maximum traffic is computed by adding the traffic between the node i and node i+with V(i+), then between the node i and node i+2 with V(i+2), and so on till the end node of the line. The combination that gives the maximum one-hop traffic is chosen to be kept in V(i) and corresponding lightpath in L (i). Due to wavelength constraint it will not be possible to assign a single wavelength to all the node-pairs of the line. The node-pairs that cannot be assigned the first wavelength are then tried with the next available wavelength similarly for possible establishment of lightpaths by making the traffic of the already allocated node-pairs as zeroes. This is continued for all the available wavelengths and the maximum traffic along with corresponding lightpath establishment stored temporarily. The algorithm next cuts another node of the ring topology to convert it into a line topology and computes the maximum traffic along with its wavelength allocation according to the same principle as discussed above. This continues till all the nodes are cut and the maximum one-hop traffic computed for all the N line topologies (where N is the number of nodes in the Ring topology). The allocation of wavelengths in terms of maximizing one-hop traffic is then the lightpath establishment of the line topology that gives the maximum one-hop traffic. C. Complexity Analysis In the algorithm, the loops of i and j while finding out the node contents gives a complexity of O(N 2 ), where N is the total number of nodes in a Ring topology. For wavelength assignment with a single wavelength, the complexity for cutting each and every node and examining becomes O(N 3 ). Hence the overall time complexity with W wavelengths is O(N 3 W). D. Illustrative Example We consider the example ring with four nodes as shown in fig.2 (a) to show how the algorithm works. Let the available number of wavelengths (W) be 3. Let T(i,j) be the traffic between any two nodes i and j. We refer to Fig: 3 for the corresponding traffic matrix. Cutting the ring at node, we have: cnode cnode cnode 2 cnode 3 cnode 4 2 3
4 Fig 3: Imaginary Traffic Matrix for the Ring topology of Fig. 3(a) For the first available wavelength: At cnode 4: V(cnode 4 ) =, L(cnode 4 ) = null. At cnode 3: V(cnode 3 ) = T(cnode 3, cnode 4 ) + V(cnode 4 ) = T(3,) + V() = 77 + = 77 L(cnode 3 ) = cnode 3 --cnode 4, Corresponding lightpath stored is 3. At cnode 2: V(cnode 2 ) = max(t(cnode 2, cnode 3 )+ V(cnode 3 ), T(cnode 2, cnode 4 )+ V(cnode 4 )) = max(t(2,3)+v(3), T(2,)+V()) = max( , 86 + ) = 36. L(cnode 2 ) = l (cnode 2, cnode 3 ) + L(cnode 3 ) = cnode 2 cnode 3 cnode 4, Corresponding lightpath stored is 2 3. At cnode : V(cnode ) = max(t(cnode, cnode 2 )+ V(cnode 2 ), T(cnode, cnode 3)+ V(cnode 3), T(cnode, cnode 4) + V(cnode 4)) = max(t(,2)+v(2), T(,3)+V(3), T(,) + V()) = max( , , 83 + ) = 85. L(cnode ) = l (cnode, cnode 2) + L(cnode 2) = cnode cnode 2 cnode 3 cnode 4, Corresponding lightpath stored is 2 3. At cnode : V(cnode ) = max(t(cnode, cnode )+V(cnode ), T(cnode, cnode 2) + V(cnode 2), T(cnode, cnode 3) + V(cnode 3), T(cnode, cnode 4) + V(cnode 4)) = max(t(,)+v(), T(,2)+V(2), T(,3) + V(3), T(,) + V()) = max( , , + 77, +) = 268. (Note: T(,3) is made zero above as T(,3) = V(3) and the path of T(,3) is longer.) L(cnode ) = l (cnode, cnode ) + L(cnode ) = cnode cnode cnode 2 cnode 3 cnode 4, Corresponding lightpath stored is 2 3. Therefore the maximum one-hop traffic that can be handled with the first available wavelength is 268. The traffic in the traffic matrix for the node-pairs where lightpaths have already been established are made zero. For the second available wavelength: Now we try to establish lightpaths with the second wavelength for the node-pairs that are still unallocated. At cnode 4: V(cnode 4) =, L(cnode 4) = null. At cnode 3: V(cnode 3 ) = T(cnode 3, cnode 4 ) + V(cnode 4 ) = T(3,) + V() = + =. (Note: as lightpath between nodes cnode 3 and cnode 4 has already been established by the first wavelength the traffic between the nodes is made zero.) At cnode 2: V(cnode 2) = max(t(cnode 2, cnode 3 )+ V(cnode 3 ), T(cnode 2, cnode 4 )+ V(cnode 4 )) = max(t(2,3)+v(3), T(2,)+V()) = max ( +, 86+) = 86. L(cnode 2) = cnode 2 cnode 4, Corresponding lightpath stored is 2. At cnode : V(cnode ) = max(t(cnode, cnode 2 )+ V(cnode 2 ), T(cnode, cnode 3)+V(cnode 3), (cnode, cnode 4)+V(cnode 4)) = max(t(,2)+v(2), T(,3)+V(3), T(,) + V()) = max(+86, 9 +, + ) = 9. L(cnode ) = cnode cnode 3, Corresponding lightpath stored is 3. At cnode : max(t(cnode, cnode ) + V(cnode ), T(cnode, cnode 2) + V(cnode 2), T(cnode, cnode 3) + V(cnode 3), T(cnode, cnode 4) + V(cnode 4)) = max(t(,)+v(), T(,2)+V(2), T(,3)+V(3), T(,)+V()) = max( + 9, + 86, 77 +, + ) = 9. L(cnode ) = l (cnode, cnode ) + L(cnode ) = cnode cnode 3, Corresponding lightpath stored is 3. Therefore the maximum one-hop traffic that can be handled by first and second wavelength is = = 358. Similarly we compute for the third available wavelength and find that the maximum one-hop traffic that can be handled is 86 and the corresponding lightpath stored is 2. Therefore the maximum one-hop traffic that can be handled by all the three wavelengths is = = 444. The corresponding lightpaths established are shown in Fig 4. λ3 λ2 λ λ λ λ cnode = cnode = cnode 2=2 cnode 3=3 cnode 4 =4 Fig 4: Establishment of lightpath for node-cut. In a similar way, we cut other remaining nodes one by one, calculating the one-hop traffic and the corresponding allocation of lightpaths for each node-cut as in Fig 5. The node-cut that gives the maximum one-hop traffic and its corresponding allocation of lightpaths will be a good solution of lightpath establishment with regard to maximizing one-hop traffic in the Ring topology of Fig.2 (a). (a) cnode cnode cnode 2 cnode 3 cnode (b) cnode cnode cnode 2 cnode 3 cnode (c) cnode cnode cnode 2 cnode 3 cnode Fig 5 (a) Ring cut at node, (b) Ring cut at node 2, (c) Ring cut at node 3
5 IV. SIMULATION RESULTS We evaluate the performance of our proposed algorithm by simulating Ring networks of different sizes, and compare the results with that of the popular heuristic algorithm as presented in [4] in which close to optimal solution can be obtained. We generate the long-term average traffic randomly for each case, where the relative traffic between any two nodes vary from to units. We also assume that a single lightpath can take care of all the traffic demands between two nodes of a network. The heuristic algorithms used in the simulations are indexed as follows. Algo: The algorithm presented by Zhang and Acampora in [4] (discussed in Section I). Algo2: Our ring topology algorithm of Section II. We consider the performance measure as the maximum onehop traffic (i.e. the total traffic carried in the network in one optical hop). In Fig.6 and Fig 7 we show the normalized onehop traffic where the maximum value is normalized to one. Fig 6 shows the cases of 2 node, 3 node and 4 node ring topologies with wavelength W=8. We notice an improvement of 6%, 33% and 42% in cases of 2-node, 3-node and 4- node ring topologies respectively when lightpaths are established by Algo 2. This is due to the fact that Algo allo- One-hop Traffic Algo Algo Nodes Fig 6: Normalized one-hop traffic for 2, 3 and 4 nodes ring topology with wavelengths W= 8. One-hop Traffic Algo Algo Nodes Fig 7: Normalized one-hop traffic for 2, 3 and 4 nodes ring topology with wavelengths W=2. -cates wavelengths considering largest-traffic-first scheme, which may not give the best allocation of wavelengths for maximizing one-hop traffic. This is because once a wavelength is allocated between two nonadjacent nodes it is not possible to allocate the same wavelength between the intermediate nodes due to wavelength constraint, even if more one-hop traffic can be handled in the latter case. Fig 7 shows the simulation results for the cases of 2-,3-, and 4-node ring topologies with 2 available wavelengths (W = 2). In these cases the improvements are around %, 2% and 35%. From both these figures it is interesting to observe that the difference is lesser in case of smaller topologies with same number of available wavelengths. This is mainly due to lesser wavelength constraints. Thus, it can be seen that the algorithm proposed here gives much better performance than the earlier proposed popular heuristic. IV. CONCLUSION We have presented an algorithm for establishment of lightpaths in a ring topology with regard to maximizing onehop traffic. Our algorithm allocates available wavelengths by first converting a n-node ring topology into n number of line topologies, and then optimally allocating the wavelengths in each of the line topologies. The line topology that gives the maximum one-hop traffic is chosen and the corresponding wavelength allocation becomes a good solution of lightpaths in the original ring topology. Through simulation we show that our algorithm performs better than one of the best-known existing heuristic algorithms with respect to maximizing onehop traffic. REFERENCES [] R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective, San Mateo, CA: Morgan Kaufmann, 998. [2] I. Chlamtac, A. Ganz, and G. Karmi, Lightpath communication: A novel approach to high bandwidth optical WAN s, IEEE Trans. Commun., vol. 4, pp. 7 82, July 992. [3] Z. Zhang and A. Acampora, A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use, IEEE/ACM Trans. Networking, vol. 3, pp , June 995. [4] C. S. R. Murthy & M. Gurusamy. WDM Optical Networks: Concepts, Designs and Algorithms. Pearson Education Inc., 22 [5] A. Ozdaglar and D. P. Bertsekas, Routing and wavelength assignment in optical networks, IEEE/ACM Trans. Networking, vol., pp , April. 23. [6] R. Datta, B. Mitra, S. Ghose and I. Sengupta, An algorithm for optimal assignment of a wavelength in a tree topology and its applications in WDM networks, IEEE Journal on Selected Areas in Communication, Vol. 22, No. 9, pp.589-6, November 24.
OPTICAL NETWORKS. Virtual Topology Design. A. Gençata İTÜ, Dept. Computer Engineering 2005
OPTICAL NETWORKS Virtual Topology Design A. Gençata İTÜ, Dept. Computer Engineering 2005 Virtual Topology A lightpath provides single-hop communication between any two nodes, which could be far apart in
More 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 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 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 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 Wavelength Assignment Heuristic to Minimize SONET ADMs in WDM rings
A Wavelength Assignment Heuristic to Minimize SONET ADMs in WDM rings Xin Yuan Amit Fulay Department of Computer Science Florida State University Tallahassee, FL 32306 {xyuan, fulay}@cs.fsu.edu Abstract
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 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 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 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 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 informationMaximization of Single Hop Traffic with Greedy Heuristics
Maximization of Single Hop Traffic with Greedy Heuristics Esa Hyytiä Networking Laboratory, HUT, Finland, email: esa@netlab.hut.fi, ABSTRACT Maximization of the single hop traffic has been proposed as
More informationAn Integer Programming Approach to Packing Lightpaths on WDM Networks 파장분할다중화망의광경로패킹에대한정수계획해법. 1. Introduction
Journal of the Korean Institute of Industrial Engineers Vol. 32, No. 3, pp. 219-225, September 2006. An Integer Programming Approach to Packing Lightpaths on WDM Networks Kyungsik Lee 1 Taehan Lee 2 Sungsoo
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 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 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 informationSurvivable Routing in WDM Weighted Networks
Survivable Routing in WDM Weighted Networks Debasis Mandal 1, Satyajit Nath 2, Bivas Mitra 3 Infosys Technologies Ltd, Pune 1, CMC Ltd., Kolkata 2, IIT, Kharagpur 3 Email: debasis.mandal@gmail.com 1, satyajit.nath@cmcltd.com
More informationAdaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks
Adaptive Weight Functions for Shortest Path Routing Algorithms for Multi-Wavelength Optical WDM Networks Tibor Fabry-Asztalos, Nilesh Bhide and Krishna M. Sivalingam School of Electrical Engineering &
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 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 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 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 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 informationLink Selection Algorithms for Link-Based ILPs and Applications to RWA in Mesh Networks
Link Selection Algorithms for Link-Based ILPs and Applications to RWA in Mesh Networks Zeyu Liu, George N. Rouskas Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206,
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 informationMulticast Scheduling in WDM Switching Networks
Multicast Scheduling in WDM Switching Networks Zhenghao Zhang and Yuanyuan Yang Dept. of Electrical & Computer Engineering, State University of New York, Stony Brook, NY 11794, USA Abstract Optical WDM
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 informationAn Efficient Algorithm for Solving Traffic Grooming Problems in Optical Networks
An Efficient Algorithm for Solving Traffic Grooming Problems in Optical Networks Hui Wang, George N. Rouskas Operations Research and Department of Computer Science, North Carolina State University, Raleigh,
More informationFault-Tolerant Design of Wavelength-Routed Optical. Networks. S. Ramamurthy and Biswanath Mukherjee
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
More informationOptical networking technology
1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the
More informationA Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks
Tamkang Journal of Science and Engineering, Vol. 14, No. 1, pp. 81 89 (2011) 81 A Novel High Performance Multicast Scheme on Virtual Ring-Based 2D Torus Topology in DWDM Networks I-Shyan Hwang 1 *, San-Nan
More informationA Customizable Two-Step Framework for General Equipment Provisioning in Optical Transport Networks
A Customizable Two-Step Framework for General Equipment Provisioning in Optical Transport Networks Limin Tang, Wanjun Huang, Miguel Razo, Arularasi Sivasankaran, Paolo Monti, Marco Tacca, Andrea Fumagalli
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 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 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 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 informationDesign of Large-Scale Optical Networks Λ
Design of Large-Scale Optical Networks Λ Yufeng Xin, George N. Rouskas, Harry G. Perros Department of Computer Science, North Carolina State University, Raleigh NC 27695 E-mail: fyxin,rouskas,hpg@eos.ncsu.edu
More 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 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 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 informationPAPER Optimum Regular Logical Topology for Wavelength Routed WDM Networks
1540 PAPER Optimum Regular Logical Topology for Wavelength Routed WDM Networks Jittima NITTAYAWAN, Student Member and Suwan RUNGGERATIGUL a), Member SUMMARY Several regular topologies have been proposed
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 informationRWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, and Hyunseung Choo Lambda Networking Center School of Information
More 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 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 informationDeadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids
Deadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids Hitesh Kulkarni, Arush Gadkar, and Vinod M. Vokkarane Department of Computer and Information Science University
More informationA Study of Waveband Switching With Multilayer Multigranular Optical Cross-Connects
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER 2003 1081 A Study of Waveband Switching With Multilayer Multigranular Optical Cross-Connects Xiaojun Cao, Student Member, IEEE,
More informationOn Optimal Traffic Grooming in WDM Rings
110 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 On Optimal Traffic Grooming in WDM Rings Rudra Dutta, Student Member, IEEE, and George N. Rouskas, Senior Member, IEEE
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 informationNode Placement Optimization Techniques in Multihop Lightwave Based de Bruijn Graph Network
262 IJCSNS International Journal of Computer Science and Network Security, VOL. No.7, July 2 Node Placement Optimization Techniques in Multihop Lightwave Based de Bruijn Graph Network Tarun Kumar Ghosh,
More informationAn Algorithm for Traffic Grooming in WDM Mesh Networks with Dynamically Changing Light-Trees
An Algorithm for raffic rooming in WDM Mesh Networks with Dynamically Changing Light-rees Xiaodong Huang, Farid Farahmand, and Jason P. Jue Department of Computer Science Department of Electrical Engineering
More 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 Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks
A Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks Technical Report UTD/EE/4/2009 September 2009 Miguel Razo, Shreejith Billenahalli, Wanjun
More 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 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 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 informationDESIGNING AN OPTIMAL VIRTUAL TOPOLOGY IN WDM BASED TOROIDAL OPTICAL NETWORKS
DESIGNING AN OPTIMAL VIRTUAL TOPOLOGY IN WDM BASED TOROIDAL OPTICAL NETWORKS Dhivya Muralishankar Department of Computer Science North Carolina State University Raleigh, North Carolina dmurali@unity.ncsu.edu
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 informationA Novel Optimization Method of Optical Network Planning. Wu CHEN 1, a
A Novel Optimization Method of Optical Network Planning Wu CHEN 1, a 1 The engineering & technical college of chengdu university of technology, leshan, 614000,china; a wchen_leshan@126.com Keywords:wavelength
More 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 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 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 informationDesigning WDM Optical Networks using Branch-and-Price
Designing WDM Optical Networks using Branch-and-Price S. Raghavan Smith School of Business & Institute for Systems Research University of Maryland College Park, MD 20742 raghavan@umd.edu Daliborka Stanojević
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 informationDelayed reservation decision in optical burst switching networks with optical buffers
Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multicast traffic grooming in tap-and-continue WDM mesh networks Author(s) Citation Lin, Rongping; Zhong,
More informationOptical Networks: from fiber transmission to photonic switching
Optical Networks: from fiber transmission to photonic switching Wavelength-Routing Networks Fabio Neri and Marco Mellia TLC Networks Group Electronics Department e-mail: lastname@polito.it http://www.tlc-networks.polito.it/
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 informationElsevier Editorial System(tm) for Optical Switching and Networking Manuscript Draft
Elsevier Editorial System(tm) for Optical Switching and Networking Manuscript Draft Manuscript Number: OSN-D-12-00081R1 Title: Constrained Light-tree Design for WDM Mesh Networks with Multicast Traffic
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 informationSurvivable 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 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 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 informationA New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization
A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization Víctor M. Aragón, Ignacio de Miguel, Ramón J. Durán, Noemí Merayo, Juan Carlos Aguado, Patricia Fernández,
More 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 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 informationPerformance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multi Hop Communications Using Logical Topologies on Optical Torus Networks Xin Yuan Rami Melhem Rajiv Gupta Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science
More 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 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 informationPerformance of Multi-hop Communications Using Logical Topologies on Optical Torus Networks 1
Journal of Parallel and Distributed Computing 61, 748766 (2001) doi:10.1006jpdc.2000.1711, available online at http:www.idealibrary.com on Performance of Multi-hop Communications Using Logical Topologies
More informationDynamic service Allocation with Protection Path
www.ijcsi.org 115 Dynamic service Allocation with Protection Path Loay Alzubaidi Department of Computer Engineering & Science, Prince Muhammad bin Fahd University AL-Khobar, Saudi Arabia Abstract Path
More informationREDUCTION OF BLOCKING PROBABILITY IN SHARED PROTECTED OPTICAL NETWORK
REDUCTION OF BLOCKING PROBABILITY IN SHARED PROTECTED OPTICAL NETWORK Nirmala L Devi 1, V M Pandharipande 2, 1 Department of Electronics and Communications Engineering, Osmania University, Hyderabad, India-500007.
More informationSpectrum Allocation Policies in Fragmentation Aware and Balanced Load Routing for Elastic Optical Networks
Spectrum Allocation Policies in Fragmentation Aware and Balanced Load Routing for Elastic Optical Networks André C. S. Donza, Carlos R. L. Francês High Performance Networks Processing Lab - LPRAD Universidade
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 informationFlow Isolation in Optical Networks
Flow Isolation in Optical Networs Hui Wang, George N. Rousas Operations Research / Department of Computer Science North Carolina State University Raleigh, NC 27695-8206 USA Email: {hwang4,rousas}@ncsu.edu
More informationCapacity planning and.
Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have
More 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 informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
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 informationA Token Based Distributed Algorithm for Medium Access in an Optical Ring Network
A Token Based Distributed Algorithm for Medium Access in an Optical Ring Network A. K. Turuk, R. Kumar, and R. Badrinath Department of Computer Science and Engineering Indian Institute of Technology Kharagpur
More informationTraffic Grooming in WDM Networks
TOPICS IN LIGHTWAVE SERIES Traffic Grooming in Networks Eytan Modiano, MIT Philip J. Lin, Tellabs ABSTRACT The recent emergence of wavelength-division multiplexing technology has led to a tremendous increase
More informationI R TECHNICAL RESEARCH REPORT. A Local Optimization Algorithm for Logical Topology Design and Traffic Grooming in IP over WDM Networks
TECHNICAL RESEARCH REPORT A Local Optimization Algorithm for Logical Topology Design and Traffic Grooming in IP over WDM Networks by Kwang-Il Lee, Mark Shayman TR 2003-3 I R INSTITUTE FOR SYSTEMS RESEARCH
More informationDynamic Routing and Resource Assignment Algorithm in Sloted Optical Networks
TELKOMNIKA, Vol. 11, No. 4, April 2013, pp. 1813~1821 ISSN: 2302-4046 1813 Dynamic Routing and Resource Assignment Algorithm in Sloted Optical Networks Bisheng Quan* 1, Hui Li 2, Zichun Le 3 1,2,3 College
More informationVol. 6, No. 5 May 2015 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Solutions of Routing and Wavelength Assignment in Wavelength Division Multiplexing Optical Network: A Survey Noha Alsulami, Mohamed Khamis Information Technology Department, Faculty of Computing & Information
More informationPerformance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming
Proc. of Int. Conf. on Emerging Trends in Engineering and Technology Performance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming Vikas Kaushik 1, R.S Chauhan 2 1 JMIT Radaur/ECE
More 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 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 informationCapacity planning and.
Some economical principles Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Assume users have
More informationA PRACTICAL AND COST-EFFECTIVE APPROACH TO EFFICIENT TRAFFIC GROOMING IN WDM MESH NETWORKS
Chapter 1 A PRACTICAL AND COST-EFFECTIVE APPROACH TO EFFICIENT TRAFFIC GROOMING IN WDM MESH NETWORKS Harsha V. Madhyastha Department of Computer Science and Engineering University of Washington Seattle,
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 information