What constitutes useful system work? Keeping our feet on the ground Injong Rhee NCSU.

Slides:



Advertisements
Similar presentations
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Advertisements

XORs in The Air: Practical Wireless Network Coding
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks Michael Barry, Andrew T Campbell, Andras Veres
Tradeoffs between performance guarantee and complexity for distributed scheduling in wireless networks Saswati Sarkar University of Pennsylvania Communication.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
XPRESS: A Cross-Layer Backpressure Architecture for Wireless Multi-Hop Networks Rafael Laufer, Theodoros Salonidis, Henrik Lundgren, Pascal Le Guyadec.
CS 408 Computer Networks Congestion Control (from Chapter 05)
1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.
A Case for Relative Differentiated Services and the Proportional Differentiation Model Constantinos Dovrolis Parameswaran Ramanathan University of Wisconsin-Madison.
Designing Networks with Little or No Buffers or Can Gulliver Survive in Lilliput? Yashar Ganjali High Performance Networking Group Stanford University.
TCP Problems in Multi-hop Wireless Networks Ajit C. Warrier and Injong Rhee North Carolina State University.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
Dynamic routing – QoS routing Load sensitive routing QoS routing.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Copyright: UC Riverside Alleviating the effects of mobility on TCP Performance Signal Strength based Link Management Fabius Klemm *, Srikanth Krishnamurthy.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
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:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
TCP Behavior across Multihop Wireless Networks and the Wired Internet Kaixin Xu, Sang Bae, Mario Gerla, Sungwook Lee Computer Science Department University.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
1 National Research Council - Pisa - Italy Marco Conti Italian National Research Council (CNR) IIT Institute MobileMAN Architecture and Protocols 2nd MobileMAN.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Mobile Routing protocols MANET
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,
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks 1 Bo Ji, 2 Changhee Joo and 1 Ness B. Shroff 1 Department of ECE, The 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.
Multirate Anypath Routing in Wireless Mesh Networks Rafael Laufer †, Henri Dubois-Ferrière ‡, Leonard Kleinrock † Acknowledgments to Martin Vetterli and.
Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Qos support and adaptive video. QoS support in ad hoc networks MAC layer techniques: – e - alternation of contention based and contention free periods;
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laborartory.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
ProbeCast: MANET Admission Control via Probing Soon Y. Oh, Gustavo Marfia, and Mario Gerla Dept. of Computer Science, UCLA Los Angeles, CA 90095, USA {soonoh,
The Importance of Being Opportunistic Sachin Katti Dina Katabi, Wenjun Hu, Hariharan Rahul, and Muriel Medard.
Data Link Layer Architecture for Wireless Sensor Networks Charlie Zhong September 28, 2001.
MAC Protocols for Sensor Networks
Data Center Network Architectures
Topics in Distributed Wireless Medium Access Control
In defense of random access
Multi-channel, multi-radio wireless networks
William Stallings Data and Computer Communications
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Kevin Lee & Adam Piechowicz 10/10/2009
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Mesh Media Access Coordination Ad Hoc Group Report Out
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Presentation transcript:

What constitutes useful system work? Keeping our feet on the ground Injong Rhee NCSU

Gap between Systems and Theory work Systems Practical working solutions. Glamorously put “Systems approaches.” Disparagingly put “Ad Hoc”, Engineering Tweaks/Hacks.” No well-defined metrics. What do they optimize for? Good for specific scenarios/cases, but unknown/unproven bad corner cases. Theory Works for all cases within the defined scope. Within well-defined metrics, always optimal. But loaded with impractical assumptions and hidden performance costs. Can’t be used in reality, at least in the current platforms.

This practice continues; the gap never closes.

Congestion Control as an example Systems Lots of little add-ons/Hacks to TCP. – E.g., ELFN, ATP,ADTCP, ADTFRC,LRED,NRED,COPAS, CAR,Split TCP,FeW, EXACT, etc. Non-TCP based approaches – Fusion (sensor), Rate limiting, CODA,C3L, IFRC, etc. Tweaking many knobs based on simple intuitions. Works well for specific setups (sensors, mesh, etc). Theory [Tassiulas and Ephremides’92] Differential-backlog based back-pressure. Many follow-up work applied for cross-layer optimization involving scheduling, routing, Congestion control, power control. Throughput-optimal solving an NP-hard scheduling problem in realistic interference models. Requires routing to almost random locations before congestion. Works only for throughput.

Closing the gap Systems Approaches Borrow intuitions from theoretical results. Heuristics designed to overcome impractical components, but still congruent with other features of the theoretical schemes. – Optimized to the same direction that the original components are intended to. Results: Improved performance without much loss of generality (without bad corner cases).

WiseNet Testbed 50 nodes of Soekris 4826, 266Mhz CPU and 128MB SDRAM. MAC is Atheros IEEE chipset (5212) using the MadWifi-NG driver.

Video Demo

8 Source A B C D E F congestion Queue Differential (QD) Each node overhears neighbors’ transmission and f or each active destination queue, computes the dif ference of queue sizes for each destination queue. E.g., Node C for a destination R: – QD C (R) = Q C (R) - Q F (R). F QD=1 QD=3QD=2 R

9 Source A C D B QD = 3 QD = -1 Scheduling Schedules the link with the largest queue differen tial first. Queue Differential (QD) removes the dependence on absolute queue sizes. MAC provides a higher priority on the packet whos e next hop link has larger QD. QD = 2

10 A C D B backpressure source Backpressure and source rat e control Upstream gets backpressure because its transmission gets l ower priority and thus, its queue builds up. As a result, it thr ottles its transmission rate. Ultimately, backpressure can propagate to the source and t he source simply rate-controls based on its queue size. No Explicit End-to-End Feedback!!

11 DiffQ Architecture (bird’s eye view) ‏

Practical results providing rules of thumb for performance upper bounds Engineers need to know how much performance gain certain features provide in real systems. – Topology control is a good example Much theoretical work exists using graph theory, but tons of assumptions about MAC and interference models. But what message do we have for practitioners? It is good, but how much? What do you typically see when you deploy a practical implementation of it?

Know Thee Performance Metrics Most notorious metric: Fairness. Most system work is vague about this; typically they look for “equal” performance. Example: – MAC: all competing nodes have the same throughput? Why equal throughput? Not all nodes can transmit well. Different Interferences, Topologies, etc. Wouldn’t proportional share or equal time more approproate? – Congestion control: why all flows should have the same through? Some flows are under more interferences and “traffic” because of different paths they take.

No “point” solutions Controls only one or two knobs and improve performance on one or two metrics, but might hurt the overall performance. MAC – Modify MAC to provide certain performance guarantees, but what about other applications requiring different metrics? – Shouldn’t MAC remain general enough, yet flexible to support various application needs at the same time? – Desirable features: expose knobs to upper-layers and let them fix the knobs. Congestion control

Building easy-to-use yet realistic platforms to test and validate.