Optimization models for congestion control with multipath routing in TCP/IP networks
|
|
- Merilyn Carpenter
- 8 years ago
- Views:
Transcription
1 Optimization models for congestion control with multipath routing in TCP/IP networks Roberto Cominetti Cristóbal Guzmán Departamento de Ingeniería Industrial Universidad de Chile Workshop on Optimization, Games and Dynamics Novembre 2011, Institut Henri Poincaré, Paris
2 Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 2 / 27
3 Overview 1 TCP/IP communication protocols 2 Congestion control and network utility maximization 3 Congestion control with Markovian multipath routing Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 3 / 27
4 TCP/IP Single path routing Communication network G = (N, A) Each source s S transmits packets from origin o s to destination d s At which rate? Along which route? Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 4 / 27
5 Congestion measures: link delays / packet loss Switch/Router Links have random delays λ a = λ a + ɛ a with E(ɛ a ) = 0 λ a = Queuing + Transmission + Propagation Finite queuing buffers packet loss probability p a Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 5 / 27
6 TCP/IP Current protocols Route selection (RIP/OSPF/IGRP/BGP/EGP) Dynamic adjustment of routing tables Slow timescale evolution (15-30 seconds) Network Layer 3 Rate control (TCP Reno/Tahoe/Vegas) Dynamic adjustment of source rates congestion window Fast timescale evolution ( milliseconds) Transport Layer 4 Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 6 / 27
7 TCP Congestion window control Packets Acks Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 7 / 27
8 TCP Congestion window control Packets Acks x s = source rate congestion window round-trip time = W s τ s Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 8 / 27
9 TCP Congestion control Sources adjust transmission rates in response to congestion Basic principle: higher congestion smaller rates x s : source transmission rate [packets/sec] λ a : link congestion measure (loss pbb, queuing delay) y a = s a x s q s = a s λ a (aggregate link loads) (end-to-end congestion) Decentralized algorithms xs t+1 = F s (xs t, qs) t (TCP source dynamics) λ t+1 a = G a (λ t a, ya) t (AQM link dynamics) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 9 / 27
10 TCP Congestion control Sources adjust transmission rates in response to congestion Basic principle: higher congestion smaller rates x s : source transmission rate [packets/sec] λ a : link congestion measure (loss pbb, queuing delay) y a = s a x s q s = a s λ a (aggregate link loads) (end-to-end congestion) Decentralized algorithms xs t+1 = F s (xs t, qs) t (TCP source dynamics) λ t+1 a = G a (λ t a, ya) t (AQM link dynamics) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 9 / 27
11 TCP Congestion control Sources adjust transmission rates in response to congestion Basic principle: higher congestion smaller rates x s : source transmission rate [packets/sec] λ a : link congestion measure (loss pbb, queuing delay) y a = s a x s q s = a s λ a (aggregate link loads) (end-to-end congestion) Decentralized algorithms xs t+1 = F s (xs t, qs) t (TCP source dynamics) λ t+1 a = G a (λ t a, ya) t (AQM link dynamics) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 9 / 27
12 Example: TCP-Reno / packet loss probability AIMD control { W t Ws t+τs = s + 1 Ws t /2 if Ws t packets are successfully transmitted one or more packets are lost (duplicate ack s) π t s = a s (1 pt a) = success probability (per packet) Additive congestion measure q t s ln(π t s) λ t a ln(1 p t a) Approximate model for rate dynamics } qs t = a s λt a E(Ws t+τs Ws t ) e qt s Ws t (Ws t + 1) + (1 e qt s Ws t ) Ws t /2 ] xs t+1 = xs t + 1 2τ s [e τsqt s xt s (x t s + 2 τ s ) xs t Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 10 / 27
13 Example: TCP-Reno / packet loss probability AIMD control { W t Ws t+τs = s + 1 Ws t /2 if Ws t packets are successfully transmitted one or more packets are lost (duplicate ack s) π t s = a s (1 pt a) = success probability (per packet) Additive congestion measure q t s ln(π t s) λ t a ln(1 p t a) Approximate model for rate dynamics } qs t = a s λt a E(Ws t+τs Ws t ) e qt s Ws t (Ws t + 1) + (1 e qt s Ws t ) Ws t /2 ] xs t+1 = xs t + 1 2τ s [e τsqt s xt s (x t s + 2 τ s ) xs t Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 10 / 27
14 Example: TCP-Reno / packet loss probability AIMD control { W t Ws t+τs = s + 1 Ws t /2 if Ws t packets are successfully transmitted one or more packets are lost (duplicate ack s) π t s = a s (1 pt a) = success probability (per packet) Additive congestion measure q t s ln(π t s) λ t a ln(1 p t a) Approximate model for rate dynamics } qs t = a s λt a E(Ws t+τs Ws t ) e qt s Ws t (Ws t + 1) + (1 e qt s Ws t ) Ws t /2 ] xs t+1 = xs t + 1 2τ s [e τsqt s xt s (x t s + 2 τ s ) xs t Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 10 / 27
15 Example: AQM / Droptail RED-REM Marking probability on links controlled by AQM p t a = ϕ a (r t a) as a function of the link s average queue length r t+1 a = (1 α)r t a + αl t a Loss probability vs. average queue length Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 11 / 27
16 Network Utility Maximization Kelly, Maullo and Tan (1998) proposed an optimization-based model for distributed rate control in networks. Low, Srikant, etc. ( ) showed that current TCP/AQM control algorithms solve an implicit network optimization problem. During last decade, the model has been used and extended to study the performance of wired and wireless networks. Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 12 / 27
17 Steady state equations x t+1 λ t+1 s = F s (xs t, qs) t (TCP source dynamics) a = G a (λ t a, ya) t (AQM link dynamics) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 13 / 27
18 Steady state equations x s = F s (x s, q s ) (TCP source equilibrium) λ a = G a (λ a, y a ) (AQM link equilibrium) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 13 / 27
19 Steady state equations x s = F s (x s, q s ) (TCP source equilibrium) λ a = G a (λ a, y a ) (AQM link equilibrium) x s = f s (q s ) λ a = ψ a (y a ) (decreasing) (increasing) q s = a s λ a y a = s a x s Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 13 / 27
20 Steady state equations x s = F s (x s, q s ) (TCP source equilibrium) λ a = G a (λ a, y a ) (AQM link equilibrium) x s = f s (q s ) λ a = ψ a (y a ) q s = a s λ a y a = s a x s (decreasing) (increasing) x s = f s ( a s λ a) λ a = ψ a ( s a x s) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 13 / 27
21 Examples Workshop on Optimization, Games and Dynamics IHP, Paris, Novembre 2011 TCP-Reno (loss probability) q s = f 1 s (x s ) 1 τ sx s ln(1 + 2 τ sx s ) λ a = ψ a (y a ) δya c a y a TCP-Vegas (queueing delay) q s = f 1 s (x s ) ατs x s λ a = ψ a (y a ) y a c a y a Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 14 / 27
22 Steady state Primal optimality x s = f s ( a s λ a) λ a = ψ a ( s a x s) f 1 s (x s ) = a s λ a = a s ψ a( u a x u) optimal solution of strictly convex program (P) min x s S U s(x s ) + a A Ψ a( s a x s) U s( ) = f 1 s ( ) Ψ a( ) = ψ a ( ) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 15 / 27
23 Steady state Primal optimality x s = f s ( a s λ a) λ a = ψ a ( s a x s) f 1 s (x s ) = a s λ a = a s ψ a( u a x u) optimal solution of strictly convex program (P) min x s S U s(x s ) + a A Ψ a( s a x s) U s( ) = f 1 s ( ) Ψ a( ) = ψ a ( ) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 15 / 27
24 Steady state Dual optimality x s = f s ( a s λ a) λ a = ψ a ( s a x s) ψ 1 a (λ a ) = s a x s = s a f s( b s λ b) optimal solution of strictly convex program (D) min λ a A Ψ a(λ a ) + s S U s ( a s λ a) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 16 / 27
25 Steady state Dual optimality x s = f s ( a s λ a) λ a = ψ a ( s a x s) ψ 1 a (λ a ) = s a x s = s a f s( b s λ b) optimal solution of strictly convex program (D) min λ a A Ψ a(λ a ) + s S U s ( a s λ a) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 16 / 27
26 Theorem (Low 2003) x s = f s ( a s λ a) λ a = ψ a ( s a x s) x and λ are optimal solutions for (P) and (D) respectively Relevance: Reverse engineering of existing protocols / forward engineering (f s, ψ a ) Design distributed stable protocols to optimize prescribed utilities Flexible choice of congestion measure q s Limitations: Ignores delays in transmission of congestion signals Improper account of stochastic phenomena Single-path routing Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 17 / 27
27 Theorem (Low 2003) x s = f s ( a s λ a) λ a = ψ a ( s a x s) x and λ are optimal solutions for (P) and (D) respectively Relevance: Reverse engineering of existing protocols / forward engineering (f s, ψ a ) Design distributed stable protocols to optimize prescribed utilities Flexible choice of congestion measure q s Limitations: Ignores delays in transmission of congestion signals Improper account of stochastic phenomena Single-path routing Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 17 / 27
28 Theorem (Low 2003) x s = f s ( a s λ a) λ a = ψ a ( s a x s) x and λ are optimal solutions for (P) and (D) respectively Relevance: Reverse engineering of existing protocols / forward engineering (f s, ψ a ) Design distributed stable protocols to optimize prescribed utilities Flexible choice of congestion measure q s Limitations: Ignores delays in transmission of congestion signals Improper account of stochastic phenomena Single-path routing Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 17 / 27
29 Markovian Network Utility Maximization (MNUM) Increase transmission rates: single path multi-path Goal: design distributed TCP protocols with multi-path routing Packet-level protocol that is stable and satisfies optimality criteria Model based on the notion of Markovian traffic equilibrium Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 18 / 27
30 MNUM: integrated routing & rate control Cross-layer design: routing + rate control Based on a common congestion measure: delay Link random delays λ a = λ a + ɛ a with E(ɛ a ) = 0 λ a = Queuing + Transmission + Propagation Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 19 / 27
31 MNUM: Markovian multipath routing At switch i, packets headed to destination d are routed through the outgoing link a A + i that minimizes the observed cost-to-go τ i d = min a A + λ a + τj d i } {{ } a z a d Markov chain with transition matrix P d ij = { P( z d a z d b, b A+ i ) if i = i a, j = j a 0 otherwise Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 20 / 27
32 MNUM: Markovian multipath routing At switch i, packets headed to destination d are routed through the outgoing link a A + i that minimizes the observed cost-to-go τ i d = min a A + λ a + τj d i } {{ } a z a d Markov chain with transition matrix P d ij = { P( z d a z d b, b A+ i ) if i = i a, j = j a 0 otherwise Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 20 / 27
33 Expected flows (invariant measures) The flow φ d i entering node i and directed towards d φ d i = os =i x s + a A ds =d i v d a splits among the outgoing links a = (i, j) according to v d a = φ d i P d ij Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 21 / 27
34 Expected costs Letting z d a = E( z d a ) and τ d i = E( τ d i ), we have z d a = λ a + τ d j a τ d i = ϕ d i (zd ) with ϕ d i (zd ) E(min a A + [za d + ɛ d a ]) i Moreover ( P z a d z b d, b A+ i ) = ϕd i za d (z d ) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 22 / 27
35 Expected costs Letting z d a = E( z d a ) and τ d i = E( τ d i ), we have z d a = λ a + τ d j a τ d i = ϕ d i (zd ) with ϕ d i (zd ) E(min a A + [za d + ɛ d a ]) i Moreover ( P z a d z b d, b A+ i ) = ϕd i za d (z d ) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 22 / 27
36 Markovian NUM Definition x s = f s (q s ) λ a = ψ a (y a ) y a = d v a d q s = τ s τs 0 (source rate control) (link congestion) (total link flows) (end-to-end queuing delay) where τ s = τ ds o s with expected costs given by { z d (ZQ) a = λ a + τj d a τi d = ϕ d i (zd ) and expected flows v d satisfying (FC) φ d i = os =i x s + a A ds =d i v d a = φ d i v d a i d ϕ d i (z d ) a A + za d i Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 23 / 27
37 MNUM Characterization: Dual problem (ZQ) defines implicitly za d and τi d as concave functions of λ x s = f s (q s ) with q s = τo ds s (λ) τo ds s (λ 0 ) yields x s as a function of λ (FC) then defines va d as functions of λ MNUM conditions ψa 1 (λ a ) = y a = d v a d (λ) Theorem MNUM optimal solution of the strictly convex program (D) min λ a A Ψ a(λ a ) + s S U s (q s (λ)) Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 24 / 27
38 MNUM Characterization: Primal problem Theorem MNUM optimal solution of where min (x,y,v) P s S U s (x s ) + a A Ψ a (y a ) + d D χ d (v d ) = sup z d (ϕ d i a (z d ) za d )va d a A χ d (v d ) and P is the polyhedron defined by flow conservation constraints. Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 25 / 27
39 SUMMARY Described an optimization model for TCP/IP equilibrium rates Model extended to multipath routing & rate control (MNUM) Inspired from packet-level distributed protocols Implementable under current TCP/IP standards FUTURE WORK Simulation and testing of MNUM-based protocols Investigate stochastic-stability of protocols Investigate delay-stability of protocols ECN mechanisms for congestion signals Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 26 / 27
40 SUMMARY Described an optimization model for TCP/IP equilibrium rates Model extended to multipath routing & rate control (MNUM) Inspired from packet-level distributed protocols Implementable under current TCP/IP standards FUTURE WORK Simulation and testing of MNUM-based protocols Investigate stochastic-stability of protocols Investigate delay-stability of protocols ECN mechanisms for congestion signals Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 26 / 27
41 Some references F. Kelly, A. Maulloo, D. Tan: Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of Operation Research, (1998). H. Yaïche, R. Mazumdar and C. Rosenberg: A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Transactions on Networking, (2000). M. Chiang, S. H. Low, A. R. Calderbank, J. C. Doyle: Layering as optimization decomposition, Proceedings of IEEE, (2006). J. B. Baillon, R. Cominetti: Markovian traffic equilibrium, Mathematical Programming (2007). R. Cominetti, C. Guzmán: Network congestion control with Markovian multipath routing, Submitted (2011). Cominetti-Guzmán (Universidad de Chile) Congestion control with multipath routing 27 / 27
Optimization of Communication Systems Lecture 6: Internet TCP Congestion Control
Optimization of Communication Systems Lecture 6: Internet TCP Congestion Control Professor M. Chiang Electrical Engineering Department, Princeton University ELE539A February 21, 2007 Lecture Outline TCP
More informationSeamless Congestion Control over Wired and Wireless IEEE 802.11 Networks
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Vasilios A. Siris and Despina Triantafyllidou Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas
More informationFunctional Optimization Models for Active Queue Management
Functional Optimization Models for Active Queue Management Yixin Chen Department of Computer Science and Engineering Washington University in St Louis 1 Brookings Drive St Louis, MO 63130, USA chen@cse.wustl.edu
More informationControlling the Internet in the era of Software Defined and Virtualized Networks. Fernando Paganini Universidad ORT Uruguay
Controlling the Internet in the era of Software Defined and Virtualized Networks Fernando Paganini Universidad ORT Uruguay CDS@20, Caltech 2014 Motivation 1. The Internet grew in its first 30 years with
More informationAN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS
AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS Srikanth Tiyyagura Department of Computer Science and Engineering JNTUA College of Engg., pulivendula, Andhra Pradesh, India.
More informationA Separation Principle for Optimal IaaS Cloud Computing Distribution
A Separation Principle for Optimal IaaS Cloud Computing Distribution Felix Kottmann, Saverio Bolognani, Florian Dörfler Automatic Control Laboratory, ETH Zürich Zürich, Switzerland Email: {felixk, bsaverio,
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationTCP in Wireless Mobile Networks
TCP in Wireless Mobile Networks 1 Outline Introduction to transport layer Introduction to TCP (Internet) congestion control Congestion control in wireless networks 2 Transport Layer v.s. Network Layer
More informationAdaptive Virtual Buffer(AVB)-An Active Queue Management Scheme for Internet Quality of Service
Adaptive Virtual Buffer(AVB)-An Active Queue Management Scheme for Internet Quality of Service Xidong Deng, George esidis, Chita Das Department of Computer Science and Engineering The Pennsylvania State
More informationHorizon: Balancing TCP over multiple paths in wireless mesh networks
Horizon: Balancing TCP over multiple paths in wireless mesh networks Bozidar Radunovic, Christos Gkantsidis, Dinan Gunawardena, Peter Key Microsoft Research Cambridge, UK Wireless Mesh Networks Goals 1.
More informationPerformance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow
International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter
More informationLecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage
Lecture 15: Congestion Control CSE 123: Computer Networks Stefan Savage Overview Yesterday: TCP & UDP overview Connection setup Flow control: resource exhaustion at end node Today: Congestion control Resource
More information1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.
Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one
More informationThe Quality of Internet Service: AT&T s Global IP Network Performance Measurements
The Quality of Internet Service: AT&T s Global IP Network Performance Measurements In today's economy, corporations need to make the most of opportunities made possible by the Internet, while managing
More informationActive Queue Management (AQM) based Internet Congestion Control
Active Queue Management (AQM) based Internet Congestion Control October 1 2002 Seungwan Ryu (sryu@eng.buffalo.edu) PhD Student of IE Department University at Buffalo Contents Internet Congestion Control
More informationTransport layer issues in ad hoc wireless networks Dmitrij Lagutin, dlagutin@cc.hut.fi
Transport layer issues in ad hoc wireless networks Dmitrij Lagutin, dlagutin@cc.hut.fi 1. Introduction Ad hoc wireless networks pose a big challenge for transport layer protocol and transport layer protocols
More informationRate-Based Active Queue Management: A Green Algorithm in Congestion Control
Rate-Based Active Queue Management: A Green Algorithm in Congestion Control Balveer Singh #1, Diwakar Saraswat #2 #1 HOD Computer Sc. & Engg. #2 Astt. Prof. Computer Sc. & Engg PKITM Mathura (UP) India
More informationAn implementation of optimal dynamic load balancing based on multipath IP routing
An implementation of optimal dynamic load balancing based on multipath IP routing Juan Pablo Saibene, Richard Lempert and Fernando Paganini Facultad de Ingeniería, Universdad ORT, Montevideo, Uruguay Abstract
More informationProtagonist International Journal of Management And Technology (PIJMT) Online ISSN- 2394-3742. Vol 2 No 3 (May-2015) Active Queue Management
Protagonist International Journal of Management And Technology (PIJMT) Online ISSN- 2394-3742 Vol 2 No 3 (May-2015) Active Queue Management For Transmission Congestion control Manu Yadav M.Tech Student
More informationChapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
More informationIntroduction to LAN/WAN. Network Layer
Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services
More informationReferring to the above question, the end-to-end delay (transmission delay plus propagation delay) is
CS326e Quiz 3 The first correct 10 answers will be worth 1 point each. Each subsequent correct answer will be worth 0.2 points. Circle the correct answer. UTEID In the following 7 problems, we are sending
More informationCSE3214 Computer Network Protocols and Applications. Chapter 1 Examples and Homework Problems
CSE3214 Computer Network Protocols and Applications Chapter 1 Examples and Homework Problems Example 1 (review question 18) (1) How long does it take a packet of length 1000 bytes to propagate over a link
More informationTCP/IP Performance with Random Loss and Bidirectional Congestion
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 541 TCP/IP Performance with Random Loss and Bidirectional Congestion T. V. Lakshman, Senior Member, IEEE, Upamanyu Madhow, Senior Member,
More information2004 Networks UK Publishers. Reprinted with permission.
Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationAnalysis of TCP Performance Over Asymmetric Wireless Links
Virginia Tech ECPE 6504: Wireless Networks and Mobile Computing Analysis of TCP Performance Over Asymmetric Kaustubh S. Phanse (kphanse@vt.edu) Outline Project Goal Notions of Asymmetry in Wireless Networks
More informationChaoyang University of Technology, Taiwan, ROC. {changb,s9227623}@mail.cyut.edu.tw 2 Department of Computer Science and Information Engineering
TCP-Taichung: A RTT-based Predictive Bandwidth Based with Optimal Shrink Factor for TCP Congestion Control in Heterogeneous Wired and Wireless Networks Ben-Jye Chang 1, Shu-Yu Lin 1, and Ying-Hsin Liang
More information17: Queue Management. Queuing. Mark Handley
17: Queue Management Mark Handley Queuing The primary purpose of a queue in an IP router is to smooth out bursty arrivals, so that the network utilization can be high. But queues add delay and cause jitter.
More information4 Internet QoS Management
4 Internet QoS Management Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se September 2008 Overview Network Management Performance Mgt QoS Mgt Resource Control
More informationMaster s Thesis. A Study on Active Queue Management Mechanisms for. Internet Routers: Design, Performance Analysis, and.
Master s Thesis Title A Study on Active Queue Management Mechanisms for Internet Routers: Design, Performance Analysis, and Parameter Tuning Supervisor Prof. Masayuki Murata Author Tomoya Eguchi February
More informationQuestion: 3 When using Application Intelligence, Server Time may be defined as.
1 Network General - 1T6-521 Application Performance Analysis and Troubleshooting Question: 1 One component in an application turn is. A. Server response time B. Network process time C. Application response
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationOn Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?
On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex? Hiroyuki Ohsaki and Masayuki Murata Graduate School of Information Science and Technology Osaka
More informationLecture 8 Performance Measurements and Metrics. Performance Metrics. Outline. Performance Metrics. Performance Metrics Performance Measurements
Outline Lecture 8 Performance Measurements and Metrics Performance Metrics Performance Measurements Kurose-Ross: 1.2-1.4 (Hassan-Jain: Chapter 3 Performance Measurement of TCP/IP Networks ) 2010-02-17
More informationCongestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?
Congestion Control Review What is congestion control? 15-441 Computer Networking What is the principle of TCP? Lecture 22 Queue Management and QoS 2 Traffic and Resource Management Resource Management
More informationPacket Queueing Delay
Some Active Queue Management Methods for Controlling Packet Queueing Delay Mahmud H. Etbega Mohamed, MSc PhD 2009 Design and Performance Evaluation of Some New Versions of Active Queue Management Schemes
More informationAnalyzing Marking Mod RED Active Queue Management Scheme on TCP Applications
212 International Conference on Information and Network Technology (ICINT 212) IPCSIT vol. 7 (212) (212) IACSIT Press, Singapore Analyzing Marking Active Queue Management Scheme on TCP Applications G.A.
More informationPareto Set, Fairness, and Nash Equilibrium: A Case Study on Load Balancing
Pareto Set, Fairness, and Nash Equilibrium: A Case Study on Load Balancing Atsushi Inoie, Hisao Kameda, Corinne Touati Graduate School of Systems and Information Engineering University of Tsukuba, Tsukuba
More informationR2. The word protocol is often used to describe diplomatic relations. How does Wikipedia describe diplomatic protocol?
Chapter 1 Review Questions R1. What is the difference between a host and an end system? List several different types of end systems. Is a Web server an end system? 1. There is no difference. Throughout
More informationUsing Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT:
Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT: In view of the fast-growing Internet traffic, this paper propose a distributed traffic management
More informationAn enhanced TCP mechanism Fast-TCP in IP networks with wireless links
Wireless Networks 6 (2000) 375 379 375 An enhanced TCP mechanism Fast-TCP in IP networks with wireless links Jian Ma a, Jussi Ruutu b and Jing Wu c a Nokia China R&D Center, No. 10, He Ping Li Dong Jie,
More informationRing Protection: Wrapping vs. Steering
Ring Protection: Wrapping vs. Steering Necdet Uzun and Pinar Yilmaz March 13, 2001 Contents Objectives What are wrapping and steering Single/dual fiber cut Comparison of wrapping and steering Simulation
More informationWhy Congestion Control. Congestion Control and Active Queue Management. Max-Min Fairness. Fairness
Congestion Control and Active Queue Management Congestion Control, Efficiency and Fairness Analysis of TCP Congestion Control A simple TCP throughput formula RED and Active Queue Management How RED wors
More informationApplying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks
Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Jian Chen and Victor C.M. Leung Department of Electrical and Computer Engineering The
More informationNetwork congestion, its control and avoidance
MUHAMMAD SALEH SHAH*, ASIM IMDAD WAGAN**, AND MUKHTIAR ALI UNAR*** RECEIVED ON 05.10.2013 ACCEPTED ON 09.01.2014 ABSTRACT Recent years have seen an increasing interest in the design of AQM (Active Queue
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationUsing median filtering in active queue management for telecommunication networks
Using median filtering in active queue management for telecommunication networks Sorin ZOICAN *, Ph.D. Cuvinte cheie. Managementul cozilor de aşteptare, filtru median, probabilitate de rejectare, întârziere.
More informationMultipath TCP design, and application to data centers. Damon Wischik, Mark Handley, Costin Raiciu, Christopher Pluntke
Multipath TCP design, and application to data centers Damon Wischik, Mark Handley, Costin Raiciu, Christopher Pluntke Packet switching pools circuits. Multipath pools links : it is Packet Switching 2.0.
More informationTCP for Wireless Networks
TCP for Wireless Networks Outline Motivation TCP mechanisms Indirect TCP Snooping TCP Mobile TCP Fast retransmit/recovery Transmission freezing Selective retransmission Transaction oriented TCP Adapted
More informationCS268 Exam Solutions. 1) End-to-End (20 pts)
CS268 Exam Solutions General comments: ) If you would like a re-grade, submit in email a complete explanation of why your solution should be re-graded. Quote parts of your solution if necessary. In person
More informationSTANDPOINT FOR QUALITY-OF-SERVICE MEASUREMENT
STANDPOINT FOR QUALITY-OF-SERVICE MEASUREMENT 1. TIMING ACCURACY The accurate multi-point measurements require accurate synchronization of clocks of the measurement devices. If for example time stamps
More informationParallel TCP Data Transfers: A Practical Model and its Application
D r a g a n a D a m j a n o v i ć Parallel TCP Data Transfers: A Practical Model and its Application s u b m i t t e d t o the Faculty of Mathematics, Computer Science and Physics, the University of Innsbruck
More informationTCP, Active Queue Management and QoS
TCP, Active Queue Management and QoS Don Towsley UMass Amherst towsley@cs.umass.edu Collaborators: W. Gong, C. Hollot, V. Misra Outline motivation TCP friendliness/fairness bottleneck invariant principle
More informationComparative Analysis of Congestion Control Algorithms Using ns-2
www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,
More informationWhat is CSG150 about? Fundamentals of Computer Networking. Course Outline. Lecture 1 Outline. Guevara Noubir noubir@ccs.neu.
What is CSG150 about? Fundamentals of Computer Networking Guevara Noubir noubir@ccs.neu.edu CSG150 Understand the basic principles of networking: Description of existing networks, and networking mechanisms
More informationData Center Networking with Multipath TCP
Data Center Networking with Multipath TCP Costin Raiciu, Christopher Pluntke, Sebastien Barre, Adam Greenhalgh, Damon Wischik, Mark Handley Hotnets 2010 報 告 者 : 莊 延 安 Outline Introduction Analysis Conclusion
More informationDistributed Rate Assignments for Simultaneous Interference and Congestion Control in CDMA-Based Wireless Networks
1 Distributed Rate Assignments for Simultaneous Interference and Congestion Control in CDMA-Based Wireless Networks Jennifer Price and Tara Javidi Department of Electrical and Computer Engineering University
More informationREM: Active Queue Management
: Active Queue Management Sanjeewa Athuraliya and Steven H. Low, California Institute of Technology Victor H. Li and Qinghe Yin, CUBIN, University of Melbourne Abstract We describe a new active queue management
More informationHow will the programme be delivered (e.g. inter-institutional, summerschools, lectures, placement, rotations, on-line etc.):
Titles of Programme: Hamilton Hamilton Institute Institute Structured PhD Structured PhD Minimum 30 credits. 15 of Programme which must be obtained from Generic/Transferable skills modules and 15 from
More informationRobust Router Congestion Control Using Acceptance and Departure Rate Measures
Robust Router Congestion Control Using Acceptance and Departure Rate Measures Ganesh Gopalakrishnan a, Sneha Kasera b, Catherine Loader c, and Xin Wang b a {ganeshg@microsoft.com}, Microsoft Corporation,
More informationRequirements for Simulation and Modeling Tools. Sally Floyd NSF Workshop August 2005
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005 Outline for talk: Requested topic: the requirements for simulation and modeling tools that allow one to study, design,
More informationTCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)
TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) *Slides adapted from a talk given by Nitin Vaidya. Wireless Computing and Network Systems Page
More informationHow To Write A Transport Layer Protocol For Wireless Networks
Chapter 9: Transport Layer and Security Protocols for Ad Hoc Wireless Networks Introduction Issues Design Goals Classifications TCP Over Ad Hoc Wireless Networks Other Transport Layer Protocols Security
More informationPer-Flow Queuing Allot's Approach to Bandwidth Management
White Paper Per-Flow Queuing Allot's Approach to Bandwidth Management Allot Communications, July 2006. All Rights Reserved. Table of Contents Executive Overview... 3 Understanding TCP/IP... 4 What is Bandwidth
More informationCongestion Control of Active Queue Management Routers Based on LQ-Servo Control
Congestion Control of Active Queue Management outers Based on LQ-Servo Control Kang Min Lee, Ji Hoon Yang, and Byung Suhl Suh Abstract This paper proposes the LQ-Servo controller for AQM (Active Queue
More informationInternet Congestion Control for Future High Bandwidth-Delay Product Environments
Internet Congestion Control for Future High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs MIT-LCS ICSI Tellabs dk@mit.edu mjh@icsi.berkeley.edu crhors@mit.edu Abstract Theory
More informationAbout the Stability of Active Queue Management Mechanisms
About the Stability of Active Queue Management Mechanisms Dario Bauso, Laura Giarré and Giovanni Neglia Abstract In this paper, we discuss the influence of multiple bottlenecks on the stability of Active
More informationTransport Layer Protocols
Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements
More informationCA-AQM: Channel-Aware Active Queue Management for Wireless Networks
CA-AQM: Channel-Aware Active Queue Management for Wireless Networks Yuan Xue, Hoang V. Nguyen and Klara Nahrstedt Abstract In a wireless network, data transmission suffers from varied signal strengths
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
More informationPerformance Evaluation of Active Queue Management Using a Hybrid Approach
1196 JOURNAL OF COMPUTERS, VOL. 7, NO. 5, MAY 2012 Performance Evaluation of Active Queue Management Using a Hybrid Approach Chin-Ling Chen* Chia-Chun Yu Department of Information Management, National
More informationDesign and Modeling of Internet Protocols. Dmitri Loguinov March 1, 2005
Design and Modeling of Internet Protocols Dmitri Loguinov March 1, 2005 1 Agenda What is protocol scalability Why TCP does not scale Future high-speed applications AQM congestion control Other work at
More informationActive Queue Management A router based control mechanism
Active Queue Management A router based control mechanism Chrysostomos Koutsimanis B.Sc. National Technical University of Athens Pan Gan Park B.Sc. Ajou University Abstract In this report we are going to
More informationData Networks Summer 2007 Homework #3
Data Networks Summer Homework # Assigned June 8, Due June in class Name: Email: Student ID: Problem Total Points Problem ( points) Host A is transferring a file of size L to host B using a TCP connection.
More informationBRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,
More informationAnalysis of Internet Transport Service Performance with Active Queue Management in a QoS-enabled Network
University of Helsinki - Department of Computer Science Analysis of Internet Transport Service Performance with Active Queue Management in a QoS-enabled Network Oriana Riva oriana.riva@cs.helsinki.fi Contents
More informationNOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
More informationAPPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM
152 APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM A1.1 INTRODUCTION PPATPAN is implemented in a test bed with five Linux system arranged in a multihop topology. The system is implemented
More informationChapter 3 ATM and Multimedia Traffic
In the middle of the 1980, the telecommunications world started the design of a network technology that could act as a great unifier to support all digital services, including low-speed telephony and very
More informationA Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman
A Preferred Service Architecture for Payload Data Flows Ray Gilstrap, Thom Stone, Ken Freeman NASA Research and Engineering Network NASA Advanced Supercomputing Division NASA Ames Research Center Outline
More informationStudent, Haryana Engineering College, Haryana, India 2 H.O.D (CSE), Haryana Engineering College, Haryana, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A New Protocol
More informationQuality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic
More informationTCP and UDP Performance for Internet over Optical Packet-Switched Networks
TCP and UDP Performance for Internet over Optical Packet-Switched Networks Jingyi He S-H Gary Chan Department of Electrical and Electronic Engineering Department of Computer Science Hong Kong University
More informationA Survey: High Speed TCP Variants in Wireless Networks
ISSN: 2321-7782 (Online) Volume 1, Issue 7, December 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com A Survey:
More informationIRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks
IRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks Zhibin Wu, Sachin Ganu and Dipankar Raychaudhuri WINLAB, Rutgers University 2006-11-16 IAB Research Review, Fall 2006 1 Contents
More informationActive Queue Management of TCP Flows with Self-scheduled Linear Parameter Varying Controllers
IT J OMPUT OMMU, ISS 1841-9836 8(6):838-844, December, 213. Active Queue Management of TP Flows with Self-scheduled Linear Parameter Varying ontrollers. Kasnakoglu osku Kasnakoglu TOBB University of Economics
More informationChapter 6: Conclusion
Chapter 6: Conclusion In this research we have designed the bandwidth optimization control protocol to manage the proposed Dual-bandwidth data path for the CDMA2000-WLAN integrated network. The user s
More informationActive Queue Management and Wireless Networks
Active Queue Management and Wireless Networks Vikas Paliwal November 13, 2003 1 Introduction Considerable research has been done on internet dynamics and it has been shown that TCP s congestion avoidance
More informationImproving Quality-of-Service in Ad hoc Wireless Networks with Adaptive Multi-path Routing
Improving Quality-of-Service in Ad hoc Wireless Networks with Adaptive Multi-path Routing Sajal K. Das *, A. Mukherjee +, S. Bandyopadhyay +, Krishna Paul #, D. Saha^ * Department of Computer Science and
More informationOn real-time delay monitoring in software-defined networks
On real-time delay monitoring in software-defined networks Victor S. Altukhov Lomonosov Moscow State University Moscow, Russia victoralt@lvk.cs.msu.su Eugene V. Chemeritskiy Applied Research Center for
More informationAnswer: that dprop equals dtrans. seconds. a) d prop. b) d trans
Chapter 1 1) p. 98: P-6 This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by single link
More informationImproving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.
More informationSJBIT, Bangalore, KARNATAKA
A Comparison of the TCP Variants Performance over different Routing Protocols on Mobile Ad Hoc Networks S. R. Biradar 1, Subir Kumar Sarkar 2, Puttamadappa C 3 1 Sikkim Manipal Institute of Technology,
More informationOn the Interaction and Competition among Internet Service Providers
On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers
More informationMobile Computing/ Mobile Networks
Mobile Computing/ Mobile Networks TCP in Mobile Networks Prof. Chansu Yu Contents Physical layer issues Communication frequency Signal propagation Modulation and Demodulation Channel access issues Multiple
More informationTCP in Wireless Networks
Outline Lecture 10 TCP Performance and QoS in Wireless s TCP Performance in wireless networks TCP performance in asymmetric networks WAP Kurose-Ross: Chapter 3, 6.8 On-line: TCP over Wireless Systems Problems
More informationLecture Objectives. Lecture 07 Mobile Networks: TCP in Wireless Networks. Agenda. TCP Flow Control. Flow Control Can Limit Throughput (1)
Lecture Objectives Wireless and Mobile Systems Design Lecture 07 Mobile Networks: TCP in Wireless Networks Describe TCP s flow control mechanism Describe operation of TCP Reno and TCP Vegas, including
More informationNetwork management and QoS provisioning - QoS in the Internet
QoS in the Internet Inernet approach is based on datagram service (best effort), so provide QoS was not a purpose for developers. Mainly problems are:. recognizing flows;. manage the issue that packets
More informationCS 78 Computer Networks. Internet Protocol (IP) our focus. The Network Layer. Interplay between routing and forwarding
CS 78 Computer Networks Internet Protocol (IP) Andrew T. Campbell campbell@cs.dartmouth.edu our focus What we will lean What s inside a router IP forwarding Internet Control Message Protocol (ICMP) IP
More information