Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Bilal Gonen, Murat Yuksel, Sushil Louis University of Nevada, Reno.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Minimizing Multi-Hop Wireless Routing State under Application- based Accuracy Constraints Mustafa Kilavuz & Murat Yuksel University of Nevada, Reno.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Traffic Engineering With Traditional IP Routing Protocols
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Grid simulation (AliEn) Network data transfer model Eugen Mudnić Technical university Split -FESB.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
A Fair and Dynamic Load Balancing Mechanism F. Larroca and J.L. Rougier International Workshop on Traffic Management and Traffic Engineering for the Future.
Network Aware Resource Allocation in Distributed Clouds.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Towards a More Fair and Robust Internet Backbone Year 1 Status Report Rene Cruz, Tara Javidi, Bill Lin Center for Networked Systems University of California,
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
ISP and Egress Path Selection for Multihomed Networks Amogh Dhamdhere, Constantine Dovrolis Networking and Telecommunications Group Georgia Institute of.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Distance Vector Routing
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
AODV-OLSR Scalable Ad hoc Routing
ECE 544: Traffic engineering (supplement)
Ad Hoc Networks - Performance
Open Issues in Router Buffer Sizing
ISP and Egress Path Selection for Multihomed Networks
Multi-Agent Exploration
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Distributed Channel Assignment in Multi-Radio Mesh Networks
L12. Network optimization
Backbone Traffic Engineering
Prestented by Zhi-Sheng, Lin
Understanding Congestion Control Mohammad Alizadeh Fall 2018
How MAC interacts with Capacity of Ad-hoc Networks – Interference problem Capacity of Wireless Networks – Part Page 1.
Presentation transcript:

Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno

 Many parameters to set in a network  Each may significantly change the overall network performance  Fast response to failures is necessary  Automated configuration and management is much needed in practice  Can be casted as an optimization problem..

 Routers flood information to learn topology  Determine “next hop” to reach other routers…  Compute shortest paths based on link weights  Link weights configured by network operator source:

congestion D S D D S S

 Inversely proportional to link capacity  Proportional to propagation delay  Network-wide optimization based on traffic source:

 Empirical way: Network administrator experience  Problems: error-prone, not scalable source:

 Given a certain offered traffic load matrix, distribute the traffic over the network to achieve the optimal resource utilization source:

Black-Box System Parameter 1 Parameter 2 Parameter n System Response  Map the network to a black-box optimization framework and let the optimization algorithm search for the best configuration  Black-box optimization searches thru the response surface to find the optimum or near-optimum sample.  Key Question: How to accurately characterize the response surface with minimum # of experiments?

Black-Box System Parameter 1 Parameter 2 Parameter n System Response Can we try all possibilities? (Exhaustive search) Assume 1 ≤ X i ≤ 10, i=1:5 Step Size = = 100,000 If one try = 1 sec then 100,000 sec ≈ 28 hours For 10 parameters ≈ 317 years

Black-Box System Parameter 1 Parameter 2 Parameter n System Response Parameter Adjustments Algorithm#3 Algorithm#2 Algorithm#1 Budget Allocator Comparator Current BestSoFar BestSoFar Metric Number of Experiments PTAS Problem

Black-Box System Parameter 1 Parameter 2 Parameter n System Response Parameter Adjustments Algorithm#3 Algorithm#2 Algorithm#1 Budget Allocator Comparator Current BestSoFar BestSoFar Metric Number of Experiments

 An algorithm may be good at one class of problems, but its performance will suffer in the other problems  NFL Theorem: General-purpose universal algorithm is impossible  Key Question: How to design an evolutionary hybrid search algorithm?  Search for the best search  Roulette wheel: Punish the bad algorithms and reward the good ones  Trans-algorithmic  Transfer the best-so-far among the algorithms

 Exploration techniques:  Random sampling  Random walk  Genetic Algorithm  Exploitation techniques:  Downhill simplex  Hillclimbing  Simulated Annealing  Hybrid  Recursive Random Search (RRS), T. Ye et al. ToN 2009

 Exploration techniques:  Random sampling  Random walk  Genetic Algorithm  Exploitation techniques:  Downhill simplex  Hillclimbing  Simulated Annealing  Hybrid  Recursive Random Search (RRS), T. Ye et al. ToN 2009

Black-Box System Parameter 1 Parameter 2 Parameter n System Response Parameter Adjustments Algorithm#3 Algorithm#2 Algorithm#1 Budget Allocator Comparator Current BestSoFar BestSoFar Metric Number of Experiments

Total Budget = Round budget = 300 Algorithm-1 Round-1 budget=100 Algorithm-2Algorithm-3 budget=100 Winner Algorithm-1 Round-2 budget=110 Algorithm-2Algorithm-3 budget=98 budget=92 Winner Algorithm-1 Round-3 budget=106 Algorithm-2Algorithm-3 budget=90 budget=104 Winner Algorithm-1 Round-4 budget=120 Algorithm-2Algorithm-3 budget=92 budget=88 Winner Algorithm-1 Round-5 budget=110 Algorithm-2Algorithm-3 budget=102 budget=88 Winner

RRS is rewarded in the 2 nd round. RRS is the winner in the 1 st round. GA is the second in the 1 st round. SA is the third in the 1 st round. SA is punished more in the 2 nd round. GA is punished in the 2 nd round. SA is punished in the 2 nd round but rewarded in the 3 rd round.

 Network Simulator 2 (NS-2)  We converted our PTAS code into an NS-2 agent and integrate it into the NS-2.  Optimization objective:  minimize the overall packet drop rate  Thus, maximize aggregate network throughput

 22 nodes and 37 links exist.  We used 7 nodes as the edge nodes, and composed 6 × 7=42 TCP flows between those edge nodes.  Simulation metric: number of bytes received at sink nodes of the TCP flows.  We repeated the optimization process 30 times.  Average throughput achieved by each algorithm with 80% confidence intervals. IEEE GLOBECOM Workshops, 2011

Optimization using a separate model of the system Optimization using real-time running system  Assumption: system does not change frequently (backbone networks).  This former approach fails when the network system is dynamic with high failure rates or a variable demand profile.  It is not practical to model such highly variant networks by simulations.

search phase search interval search interval = 5,000 sec Simulation duration = 13,000 sec search phase A two-phase approach: search, no-search

 Key questions:  How frequent should we go into the “search” phase to achieve reasonable improvement by using in-situ trials on the real network?  How much disturbance is given to the system when the optimizer is searching for better configuration parameters?

RRS (Avg throughput=7,698.24) PTAS (Avg throughput= ) GA (Avg throughput=7,596.68) SA (Avg throughput=7,322.22)

Comparison of PTAS with RRS, SA, and GA for using different search phase lengths and different number of rounds for PTAS Although not always, PTAS outperforms on average.

 Need for automated configuration and management of highly dynamic networks.  PTAS with no system model and PTAS with separate system model.  We explore some of the key tradeoffs:  How frequent the search should be done  How long should the search phase be  How worse the search phase can temporarily make the system performance due to its trials.  We apply PTAS and three other search algorithms on  Six well-known objective functions  A network problem on realistic ISP topologies  Wireless ad hoc network