Computing a Path subject to Multiple Constraints: Advances and Challenges
|
|
- Miranda Park
- 5 years ago
- Views:
Transcription
1 Computing a Path subject to Multiple Constraints: Advances and Challenges Guoliang (Larry) Xue Faculty of Computer Science and Engineering School of Computing, Informatics and Decision Systems Engineering Fulton Schools of Engineering Arizona State University 1
2 Outline/Progress of the Talk Problem Definitions Related Works Fast and Simple Approximation Algorithms The 1 st K-approximation algorithm, scaled max-norm A class of K-approximation algorithms, a norm approach Greedy is good, another K-approximation algorithm Numerical results Faster Approximation Schemes Pseudo-polynomial time algorithms Scaling, rounding, and approximate testing Improved approximation schemes Numerical results Conclusions 2
3 Problem Definitions Given a network where each link e has a cost c(e) and a delay d(e), we are interested in finding a sourcedestination path whose cost is within a given cost tolerance C and whose delay is within a given delay tolerance D. This problem is NP-hard. There are many heuristic algorithms which have no performance guarantee, and sophisticated approximation schemes which are too complicated for protocol implementation. We have designed very simple hop-by-hop routing algorithms that have good performance guarantees, as well as faster approximation schemes. 3
4 Problem Definitions We study the general problem where there are K QoS parameters, for any constant K 2. We are given an undirected graph G(V, E) where each edge e E is associated with K nonnegative weights 1 (e), 2 (e),, K (e). We are also given a source node s and destination node t, along with K positive constants W 1,, W K. The multi-constrained QoS routing problem asks for an s t path p such that k (p) W k, for k=1, 2,, K, where k (p)= e p k (e). For simplicity, we will use K=2 for most part of this talk. In this case, we will talk about cost and delay. 4
5 Problem Definitions (DMCP) 5
6 Problem Definitions (DMCP) 6
7 Illustration of the Problem (C=W 1, D=W 2 ) s (2, 5) x (12, 5) (14, 1) K = 2 W 1 = 16, W 2 = 8 y (10, 0) z The shortest path with regard to the 1 st edge weight is (s, z) The shortest path with regard to the 2 nd edge weight is (s, y, z) Neither of them is a feasible solution! Path (s, x, y, z) is a feasible path. 7
8 Problem Definitions (SMCP) 8
9 Problem Definitions (SMCP) 9
10 Problem Definitions (DCLC) 10
11 Illustrations 11
12 Illustrations 12
13 Outline/Progress of the Talk Problem Definitions Related Works Fast and Simple Approximation Algorithms The 1 st K-approximation algorithm, scaled max-norm A class of K-approximation algorithms, a norm approach Greedy is good, another K-approximation algorithm Numerical results Faster Approximation Schemes Pseudo-polynomial time algorithms Scaling, rounding, and approximate testing Improved approximation schemes Numerical results Conclusions 13
14 Related Works J.M. Jaffe, Algorithms for finding paths with multiple constraints, Networks, S. Chen and K. Nahrstedt, On finding multi-constrained paths, ICC, X. Yuan, Heuristic algorithms for multiconstrained quality of service routing, TNET, R. Hassin, Approximation schemes for the restricted shortest path problems, Mathematics of Operations Research, D.H. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem, Operations Research Letters, G. Xue, A. Sen, W. Zhang, J. Tang, K. Thulasiraman; Finding a path subject to many additive QoS constraints; TNET, G. Xue, W. Zhang, J. Tang, K. Thulasiraman; Polynomial time approximation algorithms for multi-constrained QoS routing; TNET, G. Xue and W. Zhang; Multiconstrained QoS routing: Greedy is Good; Globecom
15 Related Works G. Xue; Minimum cost QoS multicast and unicast routing in communication networks; IPCCC 2000/TCOM2003. A. Junttner et al., Lagrange relaxation based method for the QoS routing problems, INFOCOM A. Goel et al., Efficient computation of delay-sensitive routes from one source to all destinations, INFOCOM T. Korkmaz and M. Krunz, A randomized algorithm for finding a path subject to multiple QoS requirements, COMNET, P. Van Mieghem et al., Concepts of exact QoS routing algorithms, TNET, F.A. Kuipers et al., A comparison of exact and eps-approximation algorithms for constrained routing, NETWORKING, A. Orda and A. Sprintson., Efficient algorithms for computing disjoint QoS paths, INFOCOM,
16 Outline/Progress of the Talk Problem Definitions Related Works Fast and Simple Approximation Algorithms The 1 st K-approximation algorithm, scaled max-norm A class of K-approximation algorithms, a norm approach Greedy is good, another K-approximation algorithm Numerical results Faster Approximation Schemes Pseudo-polynomial time algorithms Scaling, rounding, and approximate testing Improved approximation schemes Numerical results Conclusions 16
17 A Simple/Novel Idea for SMCP The decision problem is to find a path p such that c(p)<=c and d(p)<=d. The optimization problem is to find a path p such that max {c(p)/c, d(p)/d} is minimized. Define l(p) = max {c(p)/c, d(p)/d} as a new path length. The original problem has a feasible solution if and only if there is a path p such that l(p)<=1. The optimization problem is NP-hard as well. The Idea: For each link e, define a new link weight w(e) = max{c(e)/c, d(e)/d}. The shortest path with respect to w(e) can be computed easily, and is within a factor of 2 from the optimal solution. 17
18 A Simple K-Approximation Alg for SMCP 18
19 Illustration of the Concepts (C=W 1, D=W 2 ) s (2, 5) x (12, 5) (14, 1) K = 2 W 1 = 16, W 2 = 8 y (10, 0) z The shortest path with regard to the 1 st edge weight is (s, z), l(p)=20/8. The shortest path with regard to the 2 nd edge weight is (s, y, z), l(p)=11/8. Neither of them is a feasible/optimal solution! The optimal path is (s, x, y, z), l(p)=7/8 19
20 A Simple 2-Approximation Algorithm s (2/16, (2, 5/8 5) 5/8) x (12, 12/165) (14, 14/16 1) K = 2 W 1 = 16, W 2 = 8 y (10, 10/16 0) z The shortest path with regard to the new edge weight is (s, y, z) whose path length is 11/8. This path has a length that is guaranteed to be within a factor of 2 from the optimal value. In this case, we have 11/8 2 7/8. 20
21 Performance Guarantee 21
22 A Simple K-Approximation Alg for SMCP 22
23 The General K-Approximation Alg for SMCP 23
24 The General K-Approximation Alg for SMCP There have been many heuristic algorithms for the problem. Our results, shows that many of these heuristic algorithms actually have guaranteed performance. 24
25 The Greedy Approximation Alg for SMCP 25
26 A Better Greedy 2-Approximation Algorithm A path from sthe to xpath with at path node weights x is chosen [2/16, because 5/8] is stored it has the at node minimum x. The path path length length is 5/8 [0,0] [2/16, 5/8] s (2, 5) x K = 2 (12, 5) (14, 1) W 1 = 16, W 2 = 8 y (10, 0) [12/16, 5/8] [22/16, [12/16, 5/8] 20/8] [4/16, 7/8] [16/16, 6/8] z The optimal solution is (s, x, y, z) with path length 7/8 The path at node y is The chosen path because found by it Greedy has the is minimum (s, x, z) with path path length length among 1 the unmarked nodes 26
27 Numerical Results Algorithms compared Greedy Previously best known K-approximation algorithm FPTAS for the OMCP problem (ε = 0.1) K = 3, W = W 1 = W 2 = W 3 Networks well-known Internet topologies ArpaNet (20 nodes and 32 edges) and ItalianNET (33 nodes, 67 edges) randomly generated topologies BRITE [BRITE] Waxman model [WaxJSAC88], and have the default parameters set by BRITE the edge weights were uniformly generated in a given range (we used the range [1,10]). Three scenarios Infeasible W = 5 Tight W = 10 Loose W = 20 [BRITE] BRITE; [WaxJSAC88] B.M. Waxman; Routing of multipoint connections; IEEE Journal on Selected Areas in Communications; Vol. (1988). 27
28 On ArpaNet Topology The number of better paths: path p1 is better than path p2 if l(p1) < l(p2) For any path p, its relative error is calculated as (l(p) - l(p SMCP ))/ l(p SMCP ), where p SMCP is the path found by SMCP for the source-destination pair. 28
29 On Large Random Network Topologies Scalability of the algorithms, eps= x314, 210x474, 140x560, 160x634. Path quality, eps = 0.1, 100 nodes, 390 links. 29
30 Outline/Progress of the Talk Problem Definitions Related Works Fast and Simple Approximation Algorithms The 1 st K-approximation algorithm, scaled max-norm A class of K-approximation algorithms, a norm approach Greedy is good, another K-approximation algorithm Numerical results Faster Approximation Schemes Pseudo-polynomial time algorithms Scaling, rounding, and approximate testing Improved approximation schemes Numerical results Conclusions 30
31 Problem Definitions (MCPP) 31
32 Problem Definitions (MCPN) 32
33 Pesudo-Poly Time Algs for MCPP and MCPN MCPP can be solved in O(mC K-1 ) time, taking advantage of properties of directed acyclic graphs. MCPN can be solved in O((m+nlogn)C) time, with a novel application of Dijkstra s algorithm. 33
34 Layered Graph for MCPP 34
35 Pesudo-Poly Time Alg for MCPP 35
36 Pesudo-Poly Time Alg for MCPP 36
37 Scaling, Rounding, Approximate Testing 37
38 Scaling, Rounding, Approximate Testing 38
39 Scaling, Rounding, Approximate Testing 39
40 Scaling, Rounding, Approximate Testing 40
41 The FPTAS of Lorenz and Raz 41
42 The FPTAS of Xue et al. 42
43 The FPTAS of Xue et al. 43
44 The FPTAS of Xue et al. 44
45 The FPTAS of Xue et al. 45
46 The OMCP Problem 46
47 Summary of Results For DCLC, we have improved the state of the art from O(mnloglogn+mn/ ) time FPTAS to O(mnlogloglogn+mn/ ) time FPTAS. This is of theoretical value, approaching the conjecture of O(mn/ ) time FPTAS. For SMCP, we have designed the first FPTAS, with a time complexity of O(m(n/ ) K-1 ). For OMCP, we have designed the first FTPAS, with a time complexity of O(mnlogloglogn+m(n/ ) K-1 ). For SMCP, we have also designed a class of very simple K-approximation algorithms, with time complexity of O(m+nlogn). 47
48 Numerical Results 48
49 Numerical Results 49
50 Numerical Results 50
51 Numerical Results 51
52 Outline/Progress of the Talk Problem Definitions Related Works Fast and Simple Approximation Algorithms The 1 st K-approximation algorithm, scaled max-norm A class of K-approximation algorithms, a norm approach Greedy is good, another K-approximation algorithm Numerical results Faster Approximation Schemes Pseudo-polynomial time algorithms Scaling, rounding, and approximate testing Improved approximation schemes Numerical results Conclusions 52
53 Conclusions Practical Algorithms: We knew how to compute a shortest path. OSPF has been proposed by IETF as an RFC. We didn t know how to handle two or more QoS constraints with guaranteed performance. We have algorithms that are simple and provably good. They are as simple as computing a shortest path. The computed path is within a factor of K from optimal. Can these be implemented in routers? Can these be applied in the wireless network domain? What about anypath routing? 53
54 Conclusions Theoretical Questions: We have improved the state of the art for DCLC, approaching the limit of O(mn/ ). Is this limit reachable? We have designed the first FPTAS for SMCP, with a time complexity of O(m(n/ ) K-1 ). We have designed the first FPTAS for OMCP, with a time complexity of O(mnlogloglogn+m(n/ ) K-1 ). Can this be done in O(m(n/ ) K-1 ) time? What guidance do these give us in the design of simple and provably good algorithms? 54
55 Other Research That Our Group Does Relay node placement in sensor networks Coverage, Connectivity and Survivability INFOCOM 07, INFOCOM 08, SECON 10, TOC 07,TON 10 Resource allocation in wireless mesh networks Topology control and QoS provisioning, relay deployment MOBIHOC 05, under review Game theoretic approach to wireless networks Selfish routing, Jamming ICNP 10, in progress Social Networks Identifying social ties from on-line data, SNA in wireless networks In progress 55
56 THANK YOU THANK YOU! 56
Computer Science and Engineering Ira A. Fulton Schools of Engineering
DEJUN YANG Computer Science and Engineering Ira A. Fulton Schools of Engineering 480-252-4741 Arizona State University dejun.yang@asu.edu Tempe, Arizona 85281 http://www.public.asu.edu/~dyang16/ EDUCATION
More informationA Selection Function Based Distributed Algorithm for Delay-Constraint Least-Cost Unicast Routing
A Selection Function Based Distributed Algorithm for Delay-Constraint Least-Cost Unicast Routing Wei Liu Wening Lou Yuguang Fang Department of Electrical and Computer Engineering University of Florida
More informationTHE Internet has become a critical information delivery
IEEE TRANSACTIONS ON BROADCASTING 1 Novel End-to-End Quality of Service Provisioning Algorithms for Multimedia Services in Virtualization-based Future Internet Jun Huang, Changqiao Xu, Member, IEEE, Qiang
More informationA Heuristic Algorithm for the Multi-constrained Multicast Tree
A Heuristic Algorithm for the Multi-constrained Multicast Tree Wen-Lin Yang Department of Information Technology National Pingtung Institute of Commerce No.51, Ming-Sheng East Road, Pingtung City,Taiwan
More informationA Distributed Algorithm for Multi-constrained Anypath Routing in Wireless Mesh Networks
A Distributed Algorithm for Multi-constrained Anypath Routing in Wireless Mesh Networks Xi Fang, Dejun Yang, and Guoliang Xue Arizona State University Abstract Anypath routing, a new routing paradigm,
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 Evaluation of Constraint-Based Path Selection Algorithms
Performance Evaluation of Constraint-Based Path Selection Algorithms Fernando Kuipers, Delft University of Technology Turgay Korkmaz, University of Texas at San Antonio Marwan Krunz, University of Arizona
More informationUnicast and Multicast QoS Routing with Multiple Constraints
481 Unicast and Multicast QoS Routing with Multiple Constraints Dan Wang 1, Funda Ergun 1,andZhanXu 2 1 School of Computer Science, Simon Fraser University, Burnaby BC V5A 1S6, Canada {danw,funda}@cs.sfu.ca
More informationAn Initial Study of the Multi-Constraint Routing Problem Using Genetic Algorithm
An Initial Study of the Multi-Constraint Routing Problem Using Genetic Algorithm Zhongchao Yu Dept. of Computer Science University of Maryand College Park, MD 20742 yuzc@cs.umd.edu ABSTRACT Multi-constrained
More informationBi-directional Search in QoS Routing
Bi-directional Search in QoS Routing F.A. Kuipers and P. Van Mieghem Delft University of Technology Electrical Engineering, Mathematics and Computer Science P.O Box 5031, 2600 GA Delft, The Netherlands
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 informationSABBATICAL REPORT. Submitted to. The Office of the Provost. Dr. Gang Feng. Professor of Electrical Engineering. University of Wisconsin, Platteville.
SABBATICAL REPORT Submitted to The Office of the Provost by Dr. Gang Feng Professor of Electrical Engineering University of Wisconsin, Platteville. October 8, 2013 Abstract In Spring 2013 I was on sabbatical
More informationEfficient QoS Partition and Routing in Multiservice IP Networks
Efficient QoS Partition and Routing in Multiservice IP Networks I. Atov H. T. Tran R. J. Harris RMIT University Melbourne Box 2476V Vic. 3001, Australia Abstract This paper considers the combined problem
More informationA Graph-theoretic QoS-aware Vulnerability Assessment for Network Topologies
A Graph-theoretic QoS-aware Vulnerability Assessment for Network Topologies March 24, 2010 Table of contents 1 Problem Definition and Contributions 2 3 network with small amount of constraints small networks
More informationNETWORK routing essentially consists of two identities,
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 12, NO. 5, OCTOBER 2004 851 Concepts of Exact QoS Routing Algorithms Piet Van Mieghem and Fernando A. Kuipers, Student Member, IEEE Abstract The underlying concepts
More informationResearch Article An Efficient Approximate Algorithm for Disjoint QoS Routing
Mathematical Problems in Engineering Volume 203, Article ID 48949, 9 pages http://dx.doi.org/0.55/203/48949 Research Article An Efficient Approximate Algorithm for Disjoint QoS Routing Zhane Yu, Feng Ma,
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
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 informationOverview of Constraint-Based Path Selection Algorithms for QoS Routing
Overview of Constraint-Based Path Selection Algorithms for QoS Routing F.A. Kuipers, Delft University of Technology T. Korkmaz, University of Texas at San Antonio M. Krunz, University of Arizona P. Van
More informationA comparison of two optimal approaches for the MCOP problem
A comparison of two optimal approaches for the MCOP problem Foucia PM Geelani, PG Scholar, Master of Computer Application, Francis Xavier Engineering College, Vannarpettai. D.Louisa Mary MCA.,M.Phil.,M.Tech.,
More informationQuality of Service Routing
Quality of Service Routing KNOM Tutorial 2004, Jeju, Korea, Nov. 4-5, 2004. November 5, 2004 Kwang-Hui Lee Communication Systems Lab, Changwon National University khlee@changwon.ac.kr Contents Introduction
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 informationMULTI-CONSTRAINED NODE-DISJOINT MULTIPATH QoS ROUTING ALGORITHMS FOR STATUS DISSEMINATION NETWORKS SUPREETH KOUSHIK SHESHADRI
MULTI-CONSTRAINED NODE-DISJOINT MULTIPATH QoS ROUTING ALGORITHMS FOR STATUS DISSEMINATION NETWORKS By SUPREETH KOUSHIK SHESHADRI A thesis submitted in partial fulfillment of the requirements for the degree
More informationInvestigation of QoS Multicast Routing Based on Intelligent Multiple Constrained
Investigation of QoS Multicast Routing Based on Intelligent Multiple Constrained Firas Mahdi Muhsin Al-Salbi Electrical & Electronics Dept., Engineering College, Kerballa University, Kerballa, Iraq Received:
More informationRelay Node Placement in Wireless Sensor Networks
Relay Node Placement in Wireless Sensor Networks 1 Errol L. Lloyd and Guoliang Xue, Senior Member, IEEE Abstract A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform
More informationOverview of Constraint-Based Path Selection Algorithms for QoS Routing
Overview of Constraint-Based Path Selection Algorithms for QoS Routing F.A. Kuipers, Delft University of Technology T. Korkmaz, University of Texas at San Antonio M. Krunz, University of Arizona P. Van
More informationPerformance Evaluation of Delay-Constrained Least-Cost QoS Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation
Performance Evaluation of Delay-Constrained Least-Cost QoS Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation Gang Feng, Christos Douligeris, Kia Makki, Niki Pissinou Telecommunications
More informationQuality-of-Service Routing Antti Pietiläinen Nokia Research Center P.O. Box 422, FIN NOKIA GROUP
Quality-of-Service Routing Antti Pietiläinen Nokia Research Center P.O. ox 422, FIN-00045 NOKIA GROUP Abstract Quality-of-service (QoS) routing is a natural consequence of emerging QoS services. The meaning
More informationCopyright Warning & Restrictions
Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions
More informationTHE goal of quality-of-service (QoS) routing is to find a
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 12, NO. 1, FEBRUARY 2004 17 Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks King-Shan Lui, Member, IEEE, Klara Nahrstedt, Member, IEEE,
More informationApplication Provisioning in Fog Computingenabled Internet-of-Things: A Network Perspective
Application Provisioning in Fog Computingenabled Internet-of-Things: A Network Perspective Ruozhou Yu, Guoliang Xue, and Xiang Zhang Arizona State University Outlines Background and Motivation System Modeling
More informationA Distributed Algorithm for Delay-Constrained Unicast Routing
A Distributed Algorithm for Delay-Constrained Unicast Routing H.F. Salama D.S. Reeves Y. Viniotis Center for Advanced Computing and Communication North Carolina State University Box 79, Raleigh, NC 27695
More informationCURRENT routing schemes typically focus on discovering
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 2, APRIL 2007 413 Multipath Routing Algorithms for Congestion Minimization Ron Banner, Senior Member, IEEE, and Ariel Orda, Fellow, IEEE Abstract Unlike
More informationAn Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu
More informationHeuristic and Exact Algorithms for QoS Routing with Multiple Constraints
2838 PAPER Heuristic and Exact Algorithms for QoS Routing with Multiple Constraints Gang FENG, Kia MAKKI,NikiPISSINOU, and Christos DOULIGERIS, Nonmembers SUMMARY The modern network service of finding
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 informationOn Identifying Stable Ways to Configure Systems
On Identifying Stable Ways to Configure Systems Gagan Aggarwal Mayur Datar Nina Mishra Rajeev Motwani Abstract We consider the often error-prone process of initially building and/or reconfiguring a computer
More informationUnicast Routing: Cost-Performance Tradeoffs
Unicast Routing: Cost-Performance Tradeoffs SELMA YILMAZ IBRAHIM MATTA Computer Science Department Boston University Boston, MA 02215, USA {selma,matta}@cs.bu.edu Technical Report BUCS-TR-2002-018 Abstract
More informationEstablishment of Survivable Connections in WDM Networks using Partial Path Protection
Establishment of Survivable Connections in WDM Networks using Partial Path Protection G. Xue 1, Senior Member, IEEE, W. Zhang 1,J.Tang 1, and K. Thulasiraman 2, Fellow, IEEE Abstract As a generalization
More information1336 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 6, DECEMBER 2006
1336 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 6, DECEMBER 2006 Efficient QoS Partition and Routing of Unicast and Multicast Dean H. Lorenz, Ariel Orda, Fellow, IEEE, Danny Raz, Member, IEEE, and
More informationFault-Tolerant Relay Deployment for k Node-Disjoint Paths in Wireless Sensor Networks
Fault-Tolerant Relay Deployment for k Node-Disjoint Paths in Wireless Sensor Networks Lanny Sitanayah Mobile & Internet Systems Laboratory Department of Computer Science University College Cork, Ireland
More informationProlonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN
Prolonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN Fangting Sun, Mark Shayman Department of Electrical and Computer Engineering University of Maryland,
More informationKeywords: Medium access control, network coding, routing, throughput, transmission rate. I. INTRODUCTION
Performance Analysis of Network Parameters, Throughput Optimization Using Joint Routing, XOR Routing and Medium Access Control in Wireless Multihop Network 1 Dr. Anuradha M. S., 2 Ms. Anjali kulkarni 1
More informationInternet Engineering Task Force (IETF) Request for Comments: Category: Experimental February 2014 ISSN:
Internet Engineering Task Force (IETF) A. Retana Request for Comments: 7137 S. Ratliff Updates: 5820 Cisco Systems, Inc. Category: Experimental February 2014 ISSN: 2070-1721 Use of the OSPF-MANET Interface
More informationAnalysis of Hop Limit in Opportunistic Networks by
Analysis of Hop Limit in Opportunistic Networks by Suzan Bayhan*, Esa Hyytiä, Jussi Kangasharju* and Jörg Ott *University of Helsinki and Aalto University, Finland, Bayhan et al., 17:15-18:00 IEEE ICC
More informationCore-Based GRASP for Delay-Constrained Group Communications
Core-Based GRASP for Delay-Constrained Group Communications Zrinka Lukač Faculty of Economics and Business, University of Zagreb, Zagreb, Croatia zrinka.lukac@zg.t-com.hr Manuel Laguna Leeds School of
More informationInter Domain QoS Routing using VS scheme
Inter Domain QoS Routing using VS scheme Bikramjit Walia and Girish P. Saraph, Member IEEE Department of Electrical Engineering, IIT Bombay, Powai, Mumbai-76, India Abstract Many real-time multimedia and
More information1. Introduction. Abstract
Determining a equence of table Multicast teiner Trees in Mobile Ad Hoc Networks Dr. Natarajan Meghanathan nmeghanathan@jsums.edu Jackson tate University, Jackson, M 3927 Abstract We show that given the
More informationComputing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NP- Hard in polynomial time
Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NP- Hard in polynomial time Sujit P Nale 1, S.P Sonavane 2 Dept. of Computer Science, Walchand College
More informationConnectivity-aware Virtual Network Embedding
Connectivity-aware Virtual Network Embedding Nashid Shahriar, Reaz Ahmed, Shihabur R. Chowdhury, Md Mashrur Alam Khan, Raouf Boutaba Jeebak Mitra, Feng Zeng Outline Survivability in Virtual Network Embedding
More informationCSEP 561 Routing. David Wetherall
CSEP 561 Routing David Wetherall djw@cs.washington.edu Routing Focus: How to find and set up paths through a network Distance-vector and link-state Application Shortest path routing Transport Key properties
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 informationTowards Min- Cost Virtual Infrastructure Embedding
IEEE GLOBECOM 20, San Diego, CA Arizona State University Yu, ue and Zhang ({ruozhouy, xue, xzhan229}@asu.edu) are all with Arizona State University, Tempe, AZ 828. All correspondences should be addressed
More informationFast Exact MultiConstraint Shortest Path Algorithms
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 27 proceedings. Fast Exact MultiConstraint Shortest Path Algorithms
More informationAutomatic Service and Protection Path Computation - A Multiplexing Approach
Automatic Service and Protection Path Computation - A Multiplexing Approach Loay Alzubaidi 1, Ammar El Hassan 2, Jaafar Al Ghazo 3 1 Department of Computer Engineering & Science, Prince Muhammad bin Fahd
More informationAlgorithms and protocols for stateless constrained-based routing
Computer Communications 26 (2003) 1570 1580 www.elsevier.com/locate/comcom Algorithms and protocols for stateless constrained-based routing Baoxian Zhang a, Marwan Krunz b, * a Department of ECE, Queen
More informationMinimum-Cost QoS Multicast and Unicast Routing in Communication Networks
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 5, MAY 2003 817 Minimum-Cost QoS Multicast and Unicast Routing in Communication Networks Guoliang Xue, Senior Member, IEEE Abstract In this paper, we study
More informationEnergy Optimized Routing Algorithm in Multi-sink Wireless Sensor Networks
Appl. Math. Inf. Sci. 8, No. 1L, 349-354 (2014) 349 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/081l44 Energy Optimized Routing Algorithm in Multi-sink
More informationApplications of Geometric Spanner
Title: Name: Affil./Addr. 1: Affil./Addr. 2: Affil./Addr. 3: Keywords: SumOriWork: Applications of Geometric Spanner Networks Joachim Gudmundsson 1, Giri Narasimhan 2, Michiel Smid 3 School of Information
More informationSource Routing Algorithms for Networks with Advance Reservations
Source Routing Algorithms for Networks with Advance Reservations Lars-Olof Burchard Communication and Operating Systems Technische Universitaet Berlin ISSN 1436-9915 No. 2003-3 February, 2003 Abstract
More informationMultiple Sink and Relay Placement in Wireless Sensor Networks
Multiple Sink and Relay Placement in Wireless Sensor Networks Lanny Sitanayah 1 and Kenneth N. Brown 2 and Cormac J. Sreenan 3 Abstract. Wireless sensor networks are subject to failures. Deployment planning
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 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 informationSimple Quality-of-Service Path First Protocol and Modeling Analysis*
Simple Quality-of-Service Path First Protocol and Modeling Analysis* Lin Shen, Mingwei Xu, Ke Xu, Yong Cui, Youjian Zhao Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084
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 informationFaster Algorithms for Constructing Recovery Trees Enhancing QoP and QoS
Faster Algorithms for Constructing Recovery Trees Enhancing QoP and QoS Weiyi Zhang, Guoliang Xue Senior Member, IEEE, Jian Tang and Krishnaiyan Thulasiraman, Fellow, IEEE Abstract Médard, Finn, Barry
More informationWeiyi Zhang AT&T Labs - Research, Middletown, NJ
596 JOURNAL OF COMMUNICATIONS, VOL. 7, NO. 8, AUGUST 212 Mitigating Eavesdropping Attack Using Secure Key Management Scheme in Wireless Mesh Networks Farah Kandah, Yashaswi Singh Department of Computer
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationLoad Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department RPI Mobile Wireless Networks Wireless nodes
More informationON THE PARTIAL PATH PROTECTION SCHEME FOR WDM OPTICAL NETWORKS AND POLYNOMIAL TIME COMPUTABILITY OF PRIMARY AND SECONDARY PATHS
JOURNAL OF INDUSTRIAL AND Website: http://aimsciences.org MANAGEMENT OPTIMIZATION Volume 3, Number 4, November 2007 pp. 625 643 ON THE PARTIAL PATH PROTECTION SCHEME FOR WDM OPTICAL NETWORKS AND POLYNOMIAL
More informationCommunication-constrained p-center Problem for Event Coverage in Theme Parks
Communication-constrained p-center Problem for Event Coverage in Theme Parks Gürkan Solmaz 1, Kemal Akkaya 2 and Damla Turgut 1 1 Department of Elect. Engineering and Computer Science, University of Central
More informationSegmented Arrival Graph based Evacuation Plan Assessment Algorithm Using Linear Programming
Segmented Arrival Graph based Evacuation Plan Assessment Algorithm Using Linear Programming Manki Min Dept. of Electrical Engineering and Computer Science South Dakota State University Brookings, SD 577
More informationQoS-based multi-domain routing under multiple QoS metrics
QoS-based multi-domain routing under multiple QoS metrics Derya Yiltas and Harry Perros Computer Science Department NC State University Raleigh, NC 7511, USA {dyiltas, hp}@csc.ncsu.edu Abstract Applications
More informationPUBLICATIONS. Journal Papers
PUBLICATIONS Journal Papers [J1] X. Wu and L.-L. Xie, Asymptotic equipartition property of output when rate is above capacity, submitted to IEEE Transactions on Information Theory, August 2009. [J2] A.
More informationHeuristic Algorithms for Multi Constrained Quality of Service Routing
IEEE INFOCOM 21 1 Heuristic Algorithms for Multi Constrained Quality of Service Routing Xin uan Xingming Liu Department of Computer Science Florida State University Tallahassee FL 2 xyuan liu @csfsuedu
More informationPAPER Linear and Nonlinear Lagrange Relaxation Algorithms for Delay-Constrained Least-Cost QoS Routing
IEICE TRANS. COMMUN., VOL.E85 B, NO.11 NOVEMBER 2002 2437 PAPER Linear and Nonlinear Lagrange Relaxation Algorithms for Delay-Constrained Least-Cost QoS Routing Gang FENG,ChristosDOULIGERIS, Kia MAKKI,
More informationCoordinated carrier aggregation for campus of home base stations
2015 IEEE 2015 International Symposium on Wireless Communication Systems (ISWCS), Brussels (Belgium), Aug. 2015 DOI: 10.1109/ISWCS.2015.7454390 Coordinated carrier aggregation for campus of home base stations
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 informationCooperative Data Dissemination to Mission Sites
Cooperative Data Dissemination to Mission Sites Fangfei Chen a, Matthew P. Johnson b, Amotz Bar-Noy b and Thomas F. La Porta a a Department of Computer Science and Engineering, the Pennsylvania State University
More informationApproximation Techniques for Utilitarian Mechanism Design
Approximation Techniques for Utilitarian Mechanism Design Department of Computer Science RWTH Aachen Germany joint work with Patrick Briest and Piotr Krysta 05/16/2006 1 Introduction to Utilitarian Mechanism
More informationApplication-Aware Infrastructure Clustering for Cloud Service Placement to Enhance User QoE
Application-Aware Infrastructure Clustering for Cloud Service Placement to Enhance User QoE Dmitrii Chemodanov University of Missouri-Columbia, USA Email: dycbt@mail.missouri.edu Abstract Cloud service
More informationConstruction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen
Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen Outline Motivation and Background Minimum-Weight Spanner Problem Greedy Spanner Algorithm Exact Algorithm:
More informationRouting. Directly Connected IP Networks. Data link layer routing. ifconfig command
Routing Basic principles dr. C. P. J. Koymans Informatics Institute University of Amsterdam (version 1.1, 2010/02/19 12:21:58) Monday, February 22, 2010 Basic setup Directly connected Not directly connected
More informationFog Computing Based Radio Access Networks: Issues and Challenges
Fog Computing Based Radio Access Networks: Issues and Challenges Mugen Peng and Zhongyuan Zhao ({pmg, zyzhao}@bupt.edu.cn) Beijing University of Posts & Telecommunications 2015.10.29 1 Outline Background
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationEnergy Aware Node Placement Algorithm for Wireless Sensor Network
Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 4, Number 6 (2014), pp. 541-548 Research India Publications http://www.ripublication.com/aeee.htm Energy Aware Node Placement Algorithm
More informationEfficiently Monitoring Link Bandwidth in IP Networks
Efficiently Monitoring Link Bandwidth in IP Networks Zhiping Cai, Jianping Yin, Fang Liu, Xianghui Liu, Shaohe Lv School of Computer, National University of Defense Technology 410073 Changsha, Hunan, P.R.China
More informationConstrained-based Multiple Sink Placement for Wireless Sensor Networks
Constrained-based Multiple Sink Placement for Wireless Sensor Networks Joakim Flathagen, Øivind Kure and Paal E. Engelstad Norwegian Defence Research Establishment, Q2S NTNU, UNIK, University of Oslo Abstract
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 informationCSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes
CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 29 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/7/2016 Approximation
More informationWIRELESS broadband networks are being increasingly
1960 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 11, NOVEMBER 2006 Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks Mansoor Alicherry,
More informationFall CS598CC: Approximation Algorithms. Chandra Chekuri
Fall 2006 CS598CC: Approximation Algorithms Chandra Chekuri Administrivia http://www.cs.uiuc.edu/homes/chekuri/teaching/fall2006/approx.htm Grading: 4 home works (60-70%), 1 take home final (30-40%) Mailing
More informationEnergy-efficient routing algorithms for Wireless Sensor Networks
Energy-efficient routing algorithms for Wireless Sensor Networks Chao Peng Graduate School of Information Science Japan Advanced Institute of Science and Technology March 8, 2007 Presentation Flow Introduction
More informationOptimal Topology Design for Overlay Networks
Optimal Topology Design for Overlay Networks Mina Kamel 1, Caterina Scoglio 1, and Todd Easton 2 1 Electrical and computer Engineering Department 2 Industrial and Manufacturing Systems Engineering Department
More informationOn Benefits of Network Coding in Bidirected Networks and Hyper-networks
On Benefits of Network Coding in Bidirected Networks and Hyper-networks Zongpeng Li University of Calgary / INC, CUHK December 1 2011, at UNSW Joint work with: Xunrui Yin, Xin Wang, Jin Zhao, Xiangyang
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.
More informationLSP placement in an MPLS-TP mesh network with shared mesh protection mechanism
LSP placement in an MPLS-TP mesh network with shared mesh protection mechanism CLÁUDIO ROBERTO FERREIRA COSTA, WAGNER LUIZ ZUCCHI Escola Politécnica Departamento de Engenharia de Sistemas Eletrônicos Universidade
More informationC13b: Routing Problem and Algorithms
CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in
More informationNetwork Layer (Routing)
Network Layer (Routing) Where we are in the Course Moving on up to the Network Layer! Application Transport Network Link Physical CSE 61 University of Washington Routing versus Forwarding Forwarding is
More information