Mrinalini Sawhney CS-710 Presentation 2006/09/12

Slides:



Advertisements
Similar presentations
Achieving Throughput Fairness in Wireless Mesh Network Based on IEEE Janghwan Lee and Ikjun Yeom Division of Computer Science KAIST
Advertisements

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
Ion Stoica, Scott Shenker, and Hui Zhang SIGCOMM’98, Vancouver, August 1998 subsequently IEEE/ACM Transactions on Networking 11(1), 2003, pp Presented.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia Zhang, Mario Gerla INFOCOM2003,
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
Collisions & Virtual collisions in IEEE networks Libin Jiang EE228a Communication Networks.
Random Early Detection Gateways for Congestion Avoidance
The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Comparison of Routing Metrics for a Static Multi-Hop Wireless Network Richard Draves, Jitendra Padhye, Brian Zill Microsoft Research Presented by: Jón.
Congestion Control in Multi-hop Wireless Mesh Networks Ihsan Ayyub Qazi.
Wireless Access Research Congestion Avoidance in Source Routed Ad-Hoc Networks Bryan Hogan, Michael Barry, Ronan Skehill, Sean McGrath
An End-to-end Approach to Increase TCP Throughput Over Ad-hoc Networks Sarah Sharafkandi and Naceur Malouch.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
ACN: CSFQ1 CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ1.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Effects of Multi-Rate in Ad Hoc Wireless Networks
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Multipath Routing in Wireless Mesh Networks Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on Author: Nagesh S. Nandiraju,
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks V. Gambiroza, B. Sadeghi, and E. Knightly Rice University.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Load Balancing of Multipath Source Routing in Ad Hoc Networks Lianfang Zhang, Zenghua Zhao, Yantai Shu, and Lei Wang Department of Computer Science Tianjin.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Puzzle You have 2 glass marbles Building with 100 floors
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
MAC Protocols for Sensor Networks
IMPROVING OF WIRELESS MESH NETWORKS.
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
Architecture and Algorithms for an IEEE 802
Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Mobility in based Multihop networks
A comparison of Ad-Hoc Routing Protocols
Ramakrishna Gummadi, Ramesh Govindan, Konstantinos Psounis
Random Early Detection Gateways for Congestion Avoidance
TCP in Mobile Ad-hoc Networks
An extension of IEEE e QoS for MESH Networks
The Impact of Multihop Wireless Channel on TCP Performance
“Promoting the Use of End-to-End Congestion Control in the Internet”
The War Between Mice & Elephants by, Matt Hartling & Sumit Kumbhar
Study of performance of regular TCP in MANETs (using simulator).
Network Research Center Tsinghua Univ. Beijing, P.R.China
Performance Implications of DCF to ESS Mesh Networks
Performance Implications of DCF to ESS Mesh Networks
User Cooperation for Improving Spatial Spectral Utilization in Multhop Wireless Networks March 1, 2006 Chansu Yu 3/1/2006 NEONet 2006.
Performance Implications of DCF to ESS Mesh Networks
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented by:
Presentation transcript:

Mrinalini Sawhney CS-710 Presentation 2006/09/12 A Novel Queue Management Mechanism for Improving Performance of Multihop Flows in IEEE 802.11s based Mesh Networks Nagesh S. Nandiraju et al. , 2006 IEEE IPCCC Mrinalini Sawhney CS-710 Presentation 2006/09/12

Contents Introduction Problem Definition Related works Queue Management in Multihop Networks (QMMN) Data structures The QMMN algorithm Performance Analysis Performance with UDP flows Performance with one TCP flow with interfering UDP traffic Conclusion QMMN

Introduction #. of hops bandwidth Wireless Mesh Networks Issues QMMN Forward traffic in a hop-by-hop fashion Idea is similar to multi-hop ad hoc networks Intermediate nodes act as router by forwarding data Advantage Extension in the network coverage area without any additional infrastructure Issues Bandwidth decreases with an increase in the # of hops Spatial based throughput performance Flows spanning multiple hops Vs flow traversing fewer hops No considertion to # of hops in current queueing mechanisms #. of hops bandwidth QMMN

Problem Definition QMMN The unfairness problem in multi-hop networks A packet needs to be forwarded by mesh points Is a fair treatment provided to all flows ? 2 1 3 Internet QMMN

Problem Definition - Proof Mobile Stations forward UDP packets to internet gateway node (AP0) Communicating using 802.11s based interface A huge unfairness in the throughput achieved by different flows QMMN

Recent Works Most existing QM scheme -> congestion in the Internet router RED Maintains 2 thresholds viz. minth maxth No flow level differentiation FRED No consideration for various issues inherent to multihop wireless networks Jun & Sichitui [7] Suggest maintaining a separate queue for each individual source at all relaying nodes Others Do not consider link layer buffer management This paper Exposes the role of buffer management in the dismal performance of multihop flows - QMMN QMMN

Queue Management in Multihop Networks (QMMN)[1/6] A novel link layer queue management scheme Guarantees fair buffer share at each intermediate mesh point Irrespective of the hop length Depends on -> source node’s granted buffer quota Data Structures Each mesh point maintains a fairness table Field in the table Source Address Max_Share Fair_Share Occupied_Share Arrival_rate Maintains a global variable residual_share = max_share – fair_share QMMN

Queue Management in Multihop Networks (QMMN)[2/6] max_share – fair_share AP 1 AP 0 Total buffer space # of sources in the table = Max Share QMMN

Queue Management in Multihop Networks (QMMN)[3/6] AP 1 AP 0 QMMN

Queue Management in Multihop Networks (QMMN)[4/6] Estimate the average arrival rate of traffic from each source using moving averages new_fair_share for a source is calculated as, Finally, fair_share & residual_share are given by α = 0.3, a good estimate for calculations QMMN

Queue Management in Multihop Networks (QMMN)[5/6] This condition Makes the residual share is not monopolized by any single source Limits usage of the residual buffer space by a node As the MAC layer dequeues packets from the buffer -> update the occupied_share of the corresponding source At any time, if there is a residual space A mesh point can buffer more packets than its estimated fair_share QMMN

Queue Management in Multihop Networks (QMMN)[6/6] Main idea Drop packets from aggressive sources Limits usage of the residual buffer space by a node Which packet to drop ? Packets traversing several hops and consuming considerable network resources Vs near by sources QMMN

Performance Analysis Simulation Scenario QMMN QMMN algorithm Vs default link layer drop tail queue Simulation time ->100sec Static routing Constant packet size of 1024 bytes Packets get forwarded towards the Internet gateway (AP0) QMMN

Performance Analysis with UDP flow 1 2 3 QMMN

Performance Analysis with TCP flow 1 2 3 TCP UDP QMMN

Conclusions Buffer management at the intermediate nodes degrades the performance of multihop networks The role of buffer management in the dismal performance of multihop flows Controlling the throughput of short hop length flows QMMN algorithm improves the performance of multihops without changing the MAC-layer QMMN

Thank you!! QMMN