A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks
|
|
- Lee Lewis
- 6 years ago
- Views:
Transcription
1 Int J Communications, Network and System Sciences, 2009, 2, doi:104236/ijcns Published Online December 2009 ( A New Multicast Waelength Assignment Algorithm in Waelength-Conerted Optical Networks Anping WANG, Qiwu WU, Xianwei ZHOU, Jianping WANG Department of Communication Engineering, School of Information Engineering, Uniersity of Science and Technology Beijing, Beijing, China wuqiwu700@163com Receied September 14, 2009; reised October 25, 2009; accepted Noember 23, 2009 Abstract In this paper, we propose a new multicast waelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree The whole procedure of NGWA algorithm is separated into two phases: the partial waelength assignment phase and the complete waelength assignment phase It tries to minimize the total number of waelength conersions of the multicast tree Meanwhile, the number of different waelengths used is minimized locally Through illustratie example and simulation experiments, it is proed that the NGWA algorithm works well and achiees satisfactory performance in terms of the aerage number of waelength conersions and the aerage blocking probability Keywords: WDM Network, Multicast, Waelength Assignment, Waelength Conersion 1 Introduction Multicast is an efficient way to implement one-to-many communication The problem of finding a multicast tree and allocating aailable waelength for each link of the tree is known as the Multicast Routing and Waelength Assignment (MC-RWA) problem, which plays a key role in supporting multicasting oer WDM networks [1] Since improper waelength assignment will cause low network capacity and high connecting blocking probability, the problem of how to assign waelengths for the multicast tree becomes an important problem in a WDM optical network According to the different number of multicast connecting requests, the multicast waelength assignment (MC-WA) problem can be diided into two categories: MC-WA for single multicast which was studied in [2 5] and MC-WA for multiple multicasts which was studied in [6 8] But to our best knowledge, few studies hae been done on the multicast waelength assignment (MC-WA) problem to minimize both the total number of waelength conersions of the multicast tree and the number of different waelengths used Based on the aboe, we will propose a greedy algorithm to sole the MC-WA problem The rest of the paper is organized as follows Section 2 introduces the network model and the problem specification Section 3 proposes a new multicast waelength assignment algorithm, and an illustratie example is gien The simulation results are shown in Section 4 Finally, the paper is concluded in Section 5 2 Problem Formulation 21 Network Model The assumptions for the MC-WA problem in this paper are gien as follows: 1) The WDM network is an arbitrary connected graph 2) All links in the network are equipped with the same set of waelengths 3) All nodes are proided with full waelength conersion capacity and light splitting capacity Let a directed graph G=(V, E, M) is used to represent a WDM network where V is the ertex set with V =n, E represents the set of links and M={λ 1, λ 2, λ k,} is the set of waelengths supported by each link with M =k Meanwhile, let M() e M be the set of aailable waelengths on link e In the graph G=(V, E, M), each ertex node V or each edge e E is associated with the following costs: Waelength usage cost, C w (e, λ i ), the cost of using waelength λ i on link e, which is used to computer the multicast tree in multicast routing algorithm Waelength conersion cost, C c (, λ p, λ q ), the waelength conersion cost from input waelength λ p to output waelength λ q at node, and if λ p =λ q, then C c (, λ p,
2 913 λ q )=0 Otherwise, if either λ p or λ q is not aailable, then C c (, λ p, λ q )= Note that the waelength conersion cost between any two different aailable waelengths is the same in this paper, ie, C c (, λ p, λ q )=1 Hence, it s obious that the total cost of waelength conersions can be reduced to the number of waelength conersions Let r(s:d) be a multicast request, where s is the source node and D is the set of all destination nodes And the route from the source to each of the destinations is represented to be a multicast tree T(V T, E T ) In the tree T, let e be the input link of node, A(e ) be the aailable waelength set on the input link of node excepting the rout node, Out() be the set of output links of node, and Q() be the set of child nodes of node Gien a multicast tree T and the aailable waelength set A(e ) of all links in the tree, a waelength assignment of T is defined as a function F:E a M, such that, for each e E T, F(e ) A(e ) Therefore, the multicast waelength assignment is used to assign one appropriate waelength F(e ) A(e ) on each link of the tree For each non-root node in the tree T, we define a cost function C c (T,λ) to be the number of waelength conersions needed in the sub-tree rooted at, assuming waelength λ is assigned on the input link of node For each leaf node, we set C c (T,λ)=0 Hence, the total number of waelength conersions of the tree can be defined as follows: CT( F) = C( λ), λ A () (1) Q( s) 22 Problem Specification Based on the aboe, the MC-WA problem in this paper can be described as follows: gien a multicast tree T(V T, E T ) rooted at node s and aailable waelength set A(e ) on the input link of each non-root node, the multicast waelength assignment problem is to assign the waelength set F(e ) A(e ) on the input link for each nonroot node of the tree, while the total number of waelength conersions for the tree T, C T (F), is minimized Based on Equation (1), the MC-WA problem can be formulated as follows: Min CT( F) = Min C( λ), λ A ( ) (2) Q( s) According to Equation (2), we can find that the total number of waelength conersions of the tree T is the summation of the number of waelength conersions of sub-trees that rooted at each child node of the root node 3 The Proposed Algorithm 31 The NGWA Algorithm In this subsection, we will propose a new multicast waelength assignment algorithm called NGWA The objectie of the algorithm aims to minimize the total Parameter T r(s:d) e Out() Q() A(e ) H(e ) F(e ) MU(λ i ) Pare() C c (T,λ) C T (F) Table 1 Parameter and definition Definition Multicast tree Multicast request, where s is the source and D is the set of all destination nodes Input link of node Set of output links of node Set of child nodes of node Set of aailable waelengths on the input link of node Candidate waelength(s) on e in the tree Assigned waelength on the input link of node in the tree Counter of assigned waelength λ i Parent node of the node Number of waelength conersions needed in the sub-tree rooted at Total number of waelength conersions for the tree T number of waelength conersions of the multicast tree as few as possible; meanwhile, the number of different waelengths used is minimized locally The main parameters in our proposed algorithm are gien in Table 1 The basic steps of the NGWA algorithm are gien below Input: Multicast tree T and aailable waelength set A() Output: Waelength assignment for the multicast tree T Begin Let the N nodes of T hae a topological order 0, 1,, N-1, beginning from the root node //Partial waelength assignment phase: For (i=1 up to N-1) Do = i If node is not a leaf node, Then Computer the candidate waelength(s): H ( e ) = A ( ) A ( ) K A ( ), where Q () i 1 2 Q( ) If He ( ) 2 Then Sae the set He ( ) and the node is marked as uncompleted Else Fe ( ) = He ( ), MUFe ( ( )) = MUFe ( ( )) + 1, the node is marked as completed Else If state of Pare() is already marked as completed and Ae ( ) = 1 Then Fe ( ) = Ae ( ) Endfor // Complete waelength assignment phase:
3 914 For (i= N-1 up to 1) Do = i If state of node is already marked as uncompleted Then Fe ( ) = λ, where λ He ( ), and MU( λ ) is maximum among all waelengths currently MU( Fe ( )) = MU( Fe ( )) + 1 Endfor End The whole procedure of the NGWA algorithm is separated into two phases: the partial waelength assignment phase and the complete waelength assignment phase They are depicted as follows, respectiely 1) In the partial waelength assignment phase, the local optimality strategy is used to computer the set of candidate waelengths on e which is aailable on the maximum number of output links If there are more than two candidate waelengths, the corresponding node is marked as uncompleted Otherwise, it assigns the only waelength on e Meanwhile, the node is marked as completed and the counter of the corresponding waelength increases by one For each leaf node D if the waelength of input link of parent node of the leaf node is assigned and the number of aailable waelength on e is only one, then the only aailable waelength is assigned to link e 2) In the complete waelength assignment phase, the main task is to deal with the nodes that are marked as uncompleted according to the order of bottom-up in the tree Similar to the method of Most-Used [9], it chooses the waelength that is the most-used in the multicast tree from the candidate waelengths so as to make full use of the oerall waelength utilization situation on the tree and reduce the number of different waelengths used Theorem 1: The time complexity of NGWA algorithm is no more than O(N), where N= V T Proof: The time complexity is obious In the first phase, the time of spanning all non-root nodes in the tree is O(N-1), where N= V T In the second phase, the time complexity is same as the first phase Therefore, the time complexity of NGWA algorithm is no more than O(N), where N= V T 32 Illustratie Example To help further illustrate how the NGWA algorithm works, a multicast tree is gien in Figure 1(a) Figures 1(b) and 1(c) depict the two phase s executie results of the NGWA algorithm, respectiely It s clear that the frequency of each waelength λ i (i=1,2,3,4) used in the tree is 2, 9, 1, and 0, respectiely And the total number of waelength conersions is 4 4 Simulation Results We carry out a simulation study to see how well the proposed algorithm works, and compare the performance Figure 1 The illustratie examples of (a) A gien multicast tree (b) The result of the first phase (c) The result of the second phase of our proposed NGWA algorithm to the old greedy algorithm proposed in [2] in terms of the aerage number of waelength conersions and the aerage blocking probability In iew of briefness, the old greedy waelength assignment algorithm is abbreiated to OGWA
4 Our simulation works are carried out on the platform of Network Simulator ersion 2 (NS2) [10] The network model and arious parameters are set as follows: 1) The network graphs used in the simulations are constructed by using the approach proposed by [11] Each link is assumed to consist of M waelengths 2) While the multicast trees are built for the fixed multicast connecting requests by using Dijkstra s shortest path algorithm, the multicast trees of the multicast request arriing at random are built dynamically For simplicity, the max number of aailable waelengths and the multicast group size are abbreiated to L and G respectiely Note that the multicast group size is used to represent the fraction of nodes that are destinations If there is no specific declaration, the simulation parameters are configured as follows: V =200 M =8 G=04 and L=12 The first experiment aims at assessing the effect of the max number of aailable waelengths and the multicast group size (G) on the aerage number of waelength conersions of all the multicast trees for each algorithm The results of the experiments are depicted in Figures 2 and 3 As can be seen, our NGWA algorithm outperforms the OGWA algorithm This also shows that more aailable waelengths imply that it will result in less waelength conersions The second experiment aims at assessing the aerage blocking performance by arying the multicast group size (G) Figure 4 shows the result of the experiment It can be seen that with the increase of multicast group size, the difference between these algorithms in the aerage blocking performance is slight But, compared with the OGWA algorithm, the NGWA algorithm achiees better aerage blocking performance 5 Conclusions 915 Figure 2 Number of waelength conersions s max number of aailable waelengths Figure 3 Number of waelength conersions s multicast group size In this paper, we study the multicast waelength assignment (MC-WA) problem in WDM networks with full waelength conersion capability, and propose a new multicast waelength assignment algorithm consisting of two phases called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree Through simulation experiments, it s proed that the proposed algorithm works well and achiees satisfactory performance in terms of the total number of waelength conersions and the aerage blocking probability 6 Acknowledgements This research was supported by the National High Technology Research and Deelopment Program of P R China (No2009AA01Z217, No2009AA01Z209) and also supported by the National Natural Science Foundation of P R China (No , No ) Figure 4 Blocking probability s multicast group size
5 916 7 References [1] Y Z Zhou and G S Poo, Optical multicast oer waelength-routed WDM network: A surey, Optical Switching and Networking, Vol 2, No 3, pp , Noember 2005 [2] B Chen and J Wang, Efficient routing and waelength assignment for multicast in WDM networks, IEEE Journal of Selected Areas Communication, Vol 20, No 1, pp , January 2002 [3] G S Poo and Y Zhou, A new multicast waelength assignment algorithm in waelength-routed WDM networks, IEEE Journal of Selected Areas Communication, Vol 24, No 4, January 2006 [4] R Libeskind-Hadas and R Melhem, Multicast routing and waelength assignment in multi-hop optical networks, IEEE/ACM Transactions on Networking, Vol 10, No 5, October 2002 [5] J Wang, B Chen, and R N Uma, Dynamic waelength assignment for multicast in all-optical WDM networks to maximize the network capacity, IEEE Journal of Selected Areas Communication, Vol 21, No 8, pp , October 2003 [6] X H Jia, D Z Du, X D Hu, et al, Optimization of waelength assignment for QoS multicast in WDM networks, In Proceedings of IEEE Transactions on Communication, Vol 49, No 2, pp , February 2001 [7] I S Hwang, S N Lee, and Y F Chuang, Multicast waelength assignment with sparse waelength conerters to maximize the network capacity using ILP formulation in WDM mesh networks, Photonic Network Communication, Vol 12, No 2, pp , August 2006 [8] Y W Chen, and I H Peng, Study of multicast waelength arrangement for maximizing network capacity in WDM networks with sparse waelength conerters, Photonic Network Communication, Vol 15, No 2, pp , April 2008 [9] M Saad and Z Luo, On the routing and waelength assignment in multi-fiber WDM networks, IEEE Journal of Selected Areas Communication, Vol 22, No 9, pp , June 2004 [10] The Network Simulator ersion 2, [11] B M Waxman, Routing of multipoint connections, IEEE Journal of Selected Areas Communication, Vol 6, No 9, pp , December 1988
Online multicasting in WDM networks with shared light splitter bank
Photon Netw Commun (9) 17:1 9 DOI 1.7/s1117-8-138-x Online multicasting in WDM networks with shared light splitter bank Yuzhen Liu Weifa Liang Received: 11 November 7 / Accepted: 18 June 8 / Published
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 informationDELAY-CONSTRAINED MULTICAST ROUTING ALGORITHM BASED ON AVERAGE DISTANCE HEURISTIC
DELAY-CONSTRAINED MULTICAST ROUTING ALGORITHM BASED ON AVERAGE DISTANCE HEURISTIC Zhou Ling 1, 2, Ding Wei-xiong 2 and Zhu Yu-xi 2 1 Department of Information Science and Engineer, Central South University,
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 informationOnline Broadcasting and Multicasting in WDM Networks with Shared Light Splitter Bank
1 Online Broadcasting and Multicasting in WDM Networks with Shared Light Splitter Bank Weifa Liang Yuzhen Liu Department of Computer Science Australian National University Canberra, ACT 2, Australia Abstract
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 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 informationA Modified Tabu Search Algorithm to Solve Vehicle Routing Problem
Journal of Computers Vol. 29 No. 3, 2018, pp. 197-209 doi:10.3966/199115992018062903019 A Modified Tabu Search Algorithm to Sole Vehicle Routing Problem Qinhong Fu 1, Kang Zhou 1*, Huaqing Qi 2, Falin
More informationx 1 w 1 y 1 z 1 w 2 x 2 y 2 z 2 x 3 w 3 n 1 n 2 n 3 z3 y 3
DIRECTED TREE NETWORKS Technological deelopments in the eld of optical communication networks using waelengthdiision multiplexing hae triggered intensie research in an optimization problem concerning the
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 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 informationBICUBIC UNIFORM B-SPLINE SURFACE REFINEMENT
On-Line Geometric Modeling Notes BICUBIC UNIFORM B-SPLINE SURFACE REFINEMENT Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science Uniersity of California, Dais Oeriew
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 informationVirtual Source-Based Minimum Interference Path Multicast Routing with Differentiated QoS Guarantees in the Next Generation Optical Internet
Virtual Source-Based Minimum Interference Path Multicast Routing with Differentiated QoS Guarantees in the Next Generation Optical Internet Suk-Jin Lee 1, Kyung-Dong Hong 1, Chun-Jai Lee 1, Moon-Kyun Oh
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 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 informationService Overlay Forest Embedding for Software-Defined Cloud Networks
Serice Oerlay Forest Embedding for Software-Defined Cloud Networks Jian-Jhih Kuo, Shan-Hsiang Shen, Ming-Hong Yang, De-Nian Yang, Ming-Jer Tsai and Wen-Tsuen Chen Inst. of Information Science, Academia
More informationVirtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements
Proceedings of the Applied Telecommunication Symposium (part of Advanced Simulation Technologies Conference) Seattle, Washington, USA, April 22 26, 21 Virtual Circuit Blocking Probabilities in an ATM Banyan
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 and Computer Science Osaka University, Japan 1 Background: Inter-Domain Wavelength-Routed
More informationMulticast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs
Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs X.-D. Hu and T.-P. Shuai Inst. of Applied Math. Chinese Academy of Sciences Beijing, China {xdhu, shuaitp}@mail.amss.ac.cn
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 informationTHE RESEARCH ON LPA ALGORITHM AND ITS IMPROVEMENT BASED ON PARTIAL INFORMATION
THE RESEARCH O LPA ALGORITHM AD ITS IMPROVEMET BASED O PARTIAL IFORMATIO 1 SHEG XI 1 School of Finance, Shandong Polytechnic Uniersity, Jinan, 250353 China ABSTRACT With the growing expansion of data size,
More informationSelective Refinement Of Progressive Meshes Using Vertex Hierarchies
Selectie Refinement Of Progressie Meshes Using Vertex Hierarchies Yigang Wanga, Bernd Fröhlichb and Martin Göbelc a,c Fraunhofer-Institut für Medienkommunication, Germany b Bauhaus-Uniersität Weimar, Germany
More informationExpertise-Based Data Access in Content-Centric Mobile Opportunistic Networks
Expertise-Based Data Access in Content-Centric Mobile Opportunistic Networks Jing Zhao, Xiaomei Zhang, Guohong Cao, Mudhakar Sriatsa and Xifeng Yan Pennsylania State Uniersity, Uniersity Park, PA IBM T.
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 informationHeuristic Algorithms for Finding Light-Forest of Multicast Routing on WDM Network
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 25, 83-103 (2009) Heuristic Algorithms for Finding Light-Forest of Multicast Routing on WDM Networ Department of Computer Science and Information Engineering
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
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 informationMinimum Spanning Tree in Fuzzy Weighted Rough Graph
International Journal of Engineering Research and Deelopment ISSN: 2278-067X, Volume 1, Issue 10 (June 2012), PP.23-28 www.ijerd.com Minimum Spanning Tree in Fuzzy Weighted Rough Graph S. P. Mohanty 1,
More informationCERIAS Tech Report
CERIAS Tech Report 2001-68 The Effect of Matching Watermark and Compression Transforms in Compressed Color Images by Raymond B. Wolfgang and Christine I. Podilchuk and Edward J. Delp Center for Education
More informationHeuristic Algorithms for Multiconstrained Quality-of-Service Routing
244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service
More 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 informationAN ALGORITHM OF LOW-COST MULTICAST BASED ON DELAY AND DELAY VARIATION CONSTRAINT
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 2, Number 1, Pages 51 58 c 2006 Institute for Scientific Computing and Information AN ALGORITHM OF LOW-COST MULTICAST BASED ON DELAY AND
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 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 informationPerformance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]
Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China
More informationDiscovery of BGP MPLS VPNs
Discoery of BGP MPLS VPNs Sarit Mukherjee, Tejas Naik, Sampath Rangarajan Center for Networking Research Bell Labs, Holmdel, NJ sarit@bell-labs.com, {tnaik, sampath}@research.bell-labs.com Abstract. BGP/MPLS
More informationHidden Line and Surface
Copyright@00, YZU Optimal Design Laboratory. All rights resered. Last updated: Yeh-Liang Hsu (00--). Note: This is the course material for ME550 Geometric modeling and computer graphics, Yuan Ze Uniersity.
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 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 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 informationCommunication Networks I December 4, 2001 Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page 1
Communication Networks I December, Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page Communication Networks I December, Notation G = (V,E) denotes a
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 informationMonitor Developer s Guide
IBM Tioli Priacy Manager for e-business Monitor Deeloper s Guide Version 1.1 SC23-4790-00 IBM Tioli Priacy Manager for e-business Monitor Deeloper s Guide Version 1.1 SC23-4790-00 Note: Before using this
More informationVirtual Network with Security Guarantee Embedding Algorithms
2782 JOURNAL OF COMPUERS, OL. 8, NO. 11, NOEMBER 2013 irtual Network with Security Guarantee Embedding Algorithms Chiqiang Xing National Digital switching System Engineering & echnological R&D Center,
More informationAnalysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture
242 IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.1, January 2009 Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture
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 informationA Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Journal Articles Computer Science and Engineering, Department of 8-2005 A Link Bundled Auxiliary Graph Model for Constrained
More informationRobinhood: Towards Efficient Work-stealing in Virtualized Environments
1 : Towards Efficient Work-stealing in Virtualized Enironments Yaqiong Peng, Song Wu, Member, IEEE, Hai Jin, Senior Member, IEEE Abstract Work-stealing, as a common user-leel task scheduler for managing
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 informationIs Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks? Fen Zhou, and Miklós Molnár IRISA / INSA Rennes Campus de Beaulieu Rennes, France, 35042 Email: {fen.zhou,
More informationComparative Study of PES Net and SyCCo Bus: Communication Protocols for Modular Multilevel Converter
Comparatie Study of PES Net and SyCCo Bus: Communication Protocols for Modular Multileel Conerter Hao Tu, Srdjan Lukic FREEDM Systems Center Department of Electrical and Computer Engineering North Carolina
More informationReducing the Size of Routing Tables for Large-scale Network Simulation
Reducing the Size of Routing Tables for Large-scale Network Simulation Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasumoto, Teruo Higashino and Kenichi Taniguchi Graduate School of Engineering Science,
More informationA Bit-Window based Algorithm for Balanced and Efficient Object Placement and Lookup in Large-scale Object Based Storage Cluster
A Bit-Window based Algorithm for Balanced and Efficient Object lacement and Lookup in Large-scale Object Based Storage Cluster enuga Kanagaelu A*STA Data Storage Institute, Singapore Email:renuga_KANAGAVELU@dsia-staredusg
More informationTaxonomy Dimensions of Complexity Metrics
96 Int'l Conf. Software Eng. Research and Practice SERP'15 Taxonomy Dimensions of Complexity Metrics Bouchaib Falah 1, Kenneth Magel 2 1 Al Akhawayn University, Ifrane, Morocco, 2 North Dakota State University,
More informationAll-Optical Multipoint-to-Point Routing in WDM Mesh Networks
Anal of Telecommunication manuscript No. (will be inserted by the editor) All-Optical Multipoint-to-Point Routing in WDM Mesh Networks Fen Zhou Miklós Molnár Bernard Cousin Received: date / Accepted: date
More informationLight-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks Fen Zhou, and Miklós Molnár IRISA / INSA Rennes Campus de Beaulieu Rennes, France, 35042 Email: {fen.zhou, molnar}@irisa.fr
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 informationECE250: Algorithms and Data Structures Single Source Shortest Paths Dijkstra s Algorithm
ECE0: Algorithms and Data Strctres Single Sorce Shortest Paths Dijkstra s Algorithm Ladan Tahildari, PEng, SMIEEE Associate Professor Software Technologies Applied Research (STAR) Grop Dept. of Elect.
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 informationOptimally-balanced Hash Tree Generation in Ad Hoc Networks
African Journal of Information and Communication Technology, Vol. 6, No., September Optimally-balanced Hash Tree Generation in Ad Hoc Networks V. R. Ghorpade, Y. V. Joshi and R. R. Manthalkar. Kolhapur
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 informationARELAY network consists of a pair of source and destination
158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 55, NO 1, JANUARY 2009 Parity Forwarding for Multiple-Relay Networks Peyman Razaghi, Student Member, IEEE, Wei Yu, Senior Member, IEEE Abstract This paper
More informationVirtual Backbone Construction for Cognitive Radio Networks without Common Control Channel
Virtual Backbone Construction for Cognitie Radio Networks without Common Control Channel Ying Dai, Jie Wu, and ChunSheng Xin Department of Computer and Information Sciences, Temple Uniersity, Philadelphia,
More informationCost-based Pricing for Multicast Streaming Services
Cost-based Pricing for Multicast Streaming Services Eiji TAKAHASHI, Takaaki OHARA, Takumi MIYOSHI,, and Yoshiaki TANAKA Global Information and Telecommunication Institute, Waseda Unviersity 29-7 Bldg.,
More informationCONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS 1 JAMES SIMS, 2 NATARAJAN MEGHANATHAN 1 Undergrad Student, Department
More informationPermutation and Complementary Algorithm to Generate Random Sequences for Binary Logic
Int. J. Communications, Network and System Sciences, 0, 4, 345-350 doi:0.436/ijcns.0.45039 Published Online May 0 (http://www.scirp.org/journal/ijcns) Permutation and Complementary Algorithm to Generate
More informationInternational Journal of Multidisciplinary Research and Modern Education (IJMRME) Impact Factor: 6.725, ISSN (Online):
COMPUTER REPRESENTATION OF GRAPHS USING BINARY LOGIC CODES IN DISCRETE MATHEMATICS S. Geetha* & Dr. S. Jayakumar** * Assistant Professor, Department of Mathematics, Bon Secours College for Women, Villar
More informationCandidate-Cycle-based Heuristic Algorithm for Node-and-Link Protection of Dynamic Multicast Traffic in Optical DWDM Networks
Candidate-Cycle-based Heuristic Algorithm for Node-and-Link Protection of Dynamic Multicast Traffic in Optical DWDM Networks Ahmed Frikha, Samer Lahoud, and Bernard Cousin University of Rennes 1, IRISA,
More information2 Video Quality Assessment framework for ROI-based Mobile Video Adaptation
3rd International Conference on Multimedia Technology(ICMT 2013) A Noel Scheme of Video Quality Estimation for the ROI Transcoding Video Ting Yao 1. Abstract. Because of the limitation of bandwidth and
More informationIBM. Client Configuration Guide. IBM Explorer for z/os. Version 3 Release 1 SC
IBM Explorer for z/os IBM Client Configuration Guide Version 3 Release 1 SC27-8435-01 IBM Explorer for z/os IBM Client Configuration Guide Version 3 Release 1 SC27-8435-01 Note Before using this information,
More informationPartitioning Trees with Supply, Demand and Edge-Capacity
The Tenth International Symposium on Operations Research and Its Applications (ISORA 2011) Dunhuang, China, August 28 1, 2011 Copyright 2011 ORSC & APORC, pp. 1 8 Partitioning Trees with Supply, Demand
More informationTriangulated Views Selection for Image-based Walkthrough
Proceedings of the International MultiConference of Engineers and Computer Scientists 009 Vol I IMECS 009, March 8-0, 009, Hong Kong Triangulated Views Selection for Image-based Walkthrough Chang Ok Yun,
More informationApplication Layer Multicast Algorithm
Application Layer Multicast Algorithm Sergio Machado Universitat Politècnica de Catalunya Castelldefels Javier Ozón Universitat Politècnica de Catalunya Castelldefels Abstract This paper presents a multicast
More informationTechnology Mapping Targeting Routing Congestion under Delay Constraints
1 Technology Mapping Targeting Routing Congestion under Delay Constraints Rupesh S. Shelar, Member, IEEE, Prashant Saxena, and Sachin S. Sapatnekar, Fellow, IEEE Abstract Routing congestion has become
More informationOptimal WCET-Aware Code Selection for Scratchpad Memory
Optimal WCET-Aware Code Selection for Scratchpad Memory Hui Wu, Jingling Xue, Sri Parameswaran School of Computer Science and Engineering The Uniersity of New South Wales {huiw,jingling,sridean}@cse.unsw.edu.au
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
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 informationMaximizing the Lifetime of Dominating Sets
Maximizing the Lifetime of Dominating Sets Thomas Moscibroda and Roger Wattenhofer {moscitho, wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory, ETH Zurich 892 Zurich, Switzerland
More informationA Novel Secure Localization Scheme Against Collaborative Collusion in Wireless Sensor Networks
A Noel Secure Localization Scheme Against Collaboratie Collusion in Wireless Sensor Networks Jinfang Jiang 1, Guangjie Han 1,2, Lei Shu 2, Han-Chieh Chao 3, Shojiro Nishio 2 1 Department of Information
More informationOn The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches
On The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches E. Miller R. Libeskind-Hadas D. Barnard W. Chang K. Dresner W. M. Turner
More informationAn Adaptive Content Distribution Protocol for Clustered Mobile Peer-to-Peer Networks
An Adaptie Content Distribution Protocol for Clustered Mobile Peer-to-Peer Networks Long Vu, Rahul Malik, Qiyan Wang, Klara Nahrstedt Department of Computer Science, Uniersity of Illinois 21 N. Goodwin
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 informationChapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP
Chapter 4: outline 4. introduction 4. irtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IP4 addressing ICMP IP6 4.5 routing algorithms link state
More informationA Flexible Scheme of Self Recovery for Digital Image Protection
www.ijcsi.org 460 A Flexible Scheme of Self Recoery for Digital Image Protection Zhenxing Qian, Lili Zhao 2 School of Communication and Information Engineering, Shanghai Uniersity, Shanghai 200072, China
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 informationLu Ruan. Assistant Professor Department of Computer Science, Iowa State University, Ames, IA.
Lu Ruan Associate Professor of Computer Science Iowa State University Ames, IA 50011 Phone: 515-294-2259 Email: ruan@cs.iastate.edu Web: http://www.cs.iastate.edu/~ruan RESEARCH INTERESTS WDM optical networks.
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationA Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks
A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks Arie M.C.A. Koster, Zuse Institute Berlin (ZIB), Takustr. 7, D-495 Berlin, koster@zib.de Matthias
More informationPolynomial Value Iteration Algorithms for Deterministic MDPs
Polynomial Value Iteration Algorithms for Deterministic MDPs Omid Madani Department of Computing Science Uniersity of Alberta Edmonton, AL Canada T6G 2E8 madani@cs.ualberta.ca Abstract Value iteration
More informationOVERVIEW AND REFERENCE
V I R T U A L A U D I O S P A C E with integrated Dense-Array EEG OVERVIEW AND REFERENCE Andrew Butcher, M.Sc. Matthew Tata, Ph.D. Canadian Centre for Behaioural Neuroscience The Uniersity of Lethbridge
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 informationTwo-Stage Fault-Tolerant k-ary Tree Multiprocessors
Two-Stage Fault-Tolerant k-ary Tree Multiprocessors Baback A. Izadi Department of Electrical and Computer Engineering State University of New York 75 South Manheim Blvd. New Paltz, NY 1561 U.S.A. bai@engr.newpaltz.edu
More informationVirtual Topologies for Multicasting with Multiple Originators in WDM Networks
Virtual Topologies for Multicasting with Multiple Originators in WDM Networks Ian Ferrel Adrian Mettler Edward Miller Ran Libeskind-Hadas Department of Computer Science Harvey Mudd College Claremont, California
More informationEVOLVING HYPERPARAMETERS OF SUPPORT VECTOR MACHINES BASED ON MULTI-SCALE RBF KERNELS
EVOLVING HYPERPARAMETERS OF SUPPORT VECTOR MACHINES BASED ON MULTI-SCALE RBF KERNELS Tanasanee Phienthrakul and Boonserm Kijsirikul Department of Conputer Engineering, Chulalongkorn Uniersity, Thailand
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 informationLightpath Blocking Performance Analytical Model for a Single ROADM Node with Intra-Node Add/Drop Contention [Invited]
Lightpath Blocking Performance Analytical Model for a Single ROADM Node with Intra-Node Add/Drop Contention [Invited] Li Gao, Yongcheng Li and Gangxiang Shen* School of Electronic and Information Engineering,
More informationBranch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks
Branch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks Franz Rambach Student of the TUM Telephone: 0049 89 12308564 Email: rambach@in.tum.de
More informationIBM Contact Optimization Version 9 Release 1 October 25, User's Guide
IBM Contact Optimization Version 9 Release 1 October 25, 2013 User's Guide Note Before using this information and the product it supports, read the information in Notices on page 139. This edition applies
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 information