IPSN 2010. Simple example Theory Background 3 key challenges  Choose an appropriate penalty function  high end-to-end packet delays  Scalability.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

1 Building a Fast, Virtualized Data Plane with Programmable Hardware Bilal Anwer Nick Feamster.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Advanced Data Structures
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Comparison and Analysis of FIFO, PQ, and WFQ Disciplines on multimedia
Efficient Network Flooding and Time Synchronization with Glossy
5/4/2006EE228A – Communication Networks 1 Congestion Control to Reduce Latency in Sensor Networks for Real-Time Applications Presented by Phoebus Chen.
1 Voice Over IP (VoIP) is a common technology for performing voice calls over the Internet. Voice Over IP (VoIP) is a common technology for performing.
Computer Networks Performance Metrics Advanced Computer Networks.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
ECE 201 Circuit Theory I1 Maximum Power Transfer Maximize the power delivered to a resistive load.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Computer Networks: Performance Measures1 Computer Network Performance Measures.
A Novel Approach for Transparent Bandwidth Conservation David Salyers, Aaron Striegel University of Notre Dame Department of Computer Science and Engineering.
Adaptive Routing in (Q)NoC
UC Berkeley, EECS Congestion Control and Fairness for Many-to-One Routing in Sensor Networks Background  sensor motes route data back to base.
TAMU and NSWC July Objectives Keep network activity anonymous and unobservable Provide QoS-guaranteed communication services Be upward and downward.
Focused Beam Routing protocol for Underwater Acoustic Networks Josep Miquel Jornet Montana, Milica Stojanovic, Michele Zorzi, Proc. WuWNet 2008.
Networks: Performance Measures1 Network Performance Measures.
Hongyi Wu Center for Advanced Computer Studies University of Louisiana at Lafayette Delay/Fault-Tolerant Mobile Sensor Networks.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
Dragonfly Topology and Routing
QoS in MPLS SMU CSE 8344.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Synchronization and Communication in the T3E Multiprocessor.
End-to-End QoS Specification Issues in the Wired and Wireless Environment 通工所 陳昱豪.
Damian Gordon.  What is a queue?  It’s a structure that conforms to the principle of First In, First Out (FIFO).  The first item to join the.
Queueing Theory [Bose] “The basic phenomenon of queueing arises whenever a shared facility needs to be accessed for service by a large number of jobs or.
High-Level Interconnect Architectures for FPGAs An investigation into network-based interconnect systems for existing and future FPGA architectures Nick.
Wireless Network Coding Martin Xu. Outline Introduction New Solutions – COPE – ANC Conclusions.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Hao Chen, Guoliang Yao, Hao Liu National ASIC System Engineering Research Center Southeast University WICOM 2008.
The Network Layer Introduction  functionality and service models Theory  link state and distance vector algorithms  broadcast algorithms  hierarchical.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
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.
Augmenting the Backpressure Collection Protocol to Support Multiple Sinks Varun Shimoga Prakash, Dr. Omprakash Gnawali Networked Systems Laboratory Dept.
TESTING as a SERVICE An Emitac Enterprise Solutions offering that can be offered on CLOUD as well.
Remote Controller & Presenter Make education more efficiently
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan Networks and Mobile Systems Group MIT Computer Science and.
4/19/20021 TCPSplitter: A Reconfigurable Hardware Based TCP Flow Monitor David V. Schuehler.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Computer Engineering and Networks Laboratory How Was Your Journey? Uncovering Routing Dynamics in Deployed Sensor Networks with Multi-hop Network Tomography.
Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
A Perspective on Network Interference and Multiple Access Control Michael J. Neely University of Southern California May 2008 Capacity Region 
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Adaptive Inverse Multiplexing for Wide-Area Wireless Networks Alex C. Snoeren MIT Laboratory for Computer Science IEEE Globecom ’99 Rio de Janeiro, December.
Chengzhi Li and Edward W. Knightly Schedulability Criterion and Performance Analysis of Coordinated Schedulers.
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laborartory.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
Network Layer4-1 Chapter 4 Network Layer All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Jia Uddin Embedded System Lab.  MPLS  IMANET  IMANET network model  Proposed model of IMANET with MPLS  Conclusion.
Review of Useful Definitions Statistical multiplexing is a method of sharing a link among transmissions. When computers use store-and-forward packet switching,
Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP.
دكتر ميرزا حسن حسيني مولفان: تهيه كننده: دكتر ميرزا حسن حسيني.
BACK SOLUTION:
Goal Control the amount of traffic in the network
Tarun Banka Department of Computer Science Colorado State University
Choose the best answer for each problem.
I UNDERSTAND CONCEPTS OF CYBERSECURITY
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
POWER CHALLENGES Several Ways To Solve 7 CHALLENGES.
Horizon: Balancing TCP over multiple paths in wireless mesh networks
By Pramit Choudhary, Balaji Raao & Ravindra Bhanot
Presentation transcript:

IPSN 2010

Simple example

Theory Background

3 key challenges  Choose an appropriate penalty function  high end-to-end packet delays  Scalability - Large queue sizes

3 key challenges - solution  Choose an appropriate penalty function

 React to loading threat

3 key challenges - solution  high end-to-end packet delays Using LIFO LIFO FIFO

3 key challenges - solution  Scalability - Large queue sizes Use Floating Queue Backpressure = sizeof( Virtual Q ) + sizeof( Data Q)

Experiment

Experiment – static network  Goodput & delivery efficiency BCPCTP 0.25PPS PPS

Experiment – static network  Delay performance

Experiment – static network  Scalability Maximum data queue size = 11

Experiment – static network  Reorder density CTP: 99.9% in-order delivery for 0.25pps & 1.0pps

Experiment – external interference  interference

Experiment – external interference  Highly mobile sinks