DISPERSITY ROUTING: PAST and PRESENT 2011-04-25 Seungmin Kang.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Jaringan Komputer Lanjut Packet Switching Network.
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 – Circuit Switching and Packet Switching.
CS 408 Computer Networks Congestion Control (from Chapter 05)
Optical communications & networking - an Overview
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
Semester Copyright USM EEE442 Computer Networks The Data Link / Network Layer Functions: Switching En. Mohd Nazri Mahmud MPhil (Cambridge, UK)
William Stallings Data and Computer Communications 7th Edition
Multi-Path Multimedia Transmission in Ad-hoc Networks Related Work Marcin Michalak
Lecture 1, 1Spring 2003, COM1337/3501Computer Communication Networks Rajmohan Rajaraman COM1337/3501 Textbook: Computer Networks: A Systems Approach, L.
Switching Techniques Student: Blidaru Catalina Elena.
Data Communications and Networking
29-Aug-154/598N: Computer Networks Switching and Forwarding Outline –Store-and-Forward Switches.
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 – Circuit Switching and Packet Switching.
Introduction to Networks CS587x Lecture 1 Department of Computer Science Iowa State University.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
EITnotes.com For more notes and topics visit:
1 Next Few Classes Networking basics Protection & Security.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Circuit & Packet Switching. ► Two ways of achieving the same goal. ► The transfer of data across networks. ► Both methods have advantages and disadvantages.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Data and Computer Communications Circuit Switching and Packet Switching.
William Stallings Data and Computer Communications 7 th Edition Chapter 1 Data Communications and Networks Overview.
Computer Networks with Internet Technology William Stallings
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Multipath Routing in Wireless Mesh Networks Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on Author: Nagesh S. Nandiraju,
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Lect1..ppt - 01/06/05 CDA 6505 Network Architecture and Client/Server Computing Lecture 4 Frame Relay by Zornitza Genova Prodanoff.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Computer Networks Chapter 8 – Circuit Switching versus Packet Switching.
Data and Computer Communications 8 th and 9 th Edition by William Stallings Chapter 10 – Circuit Switching and Packet Switching.
1 The Latency/Bandwidth Tradeoff in Gigabit Networks UBI 527 Data Communications Ozan TEKDUR , Fall.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Muhammad Waseem Iqbal Lecture # 20 Data Communication.
Unit 1:Frame Relay.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Wireless ATM PRESENTED BY : NIPURBA KONAR.
Network Survivability
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 4 Frame Relay Chapter 4 Frame Relay.
Data and Computer Communications
Congestion Control (from Chapter 05)
Switching Techniques.
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Congestion Control (from Chapter 05)
Optical communications & networking - an Overview
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

DISPERSITY ROUTING: PAST and PRESENT Seungmin Kang

In This Paper  Why dispersity routing was considered  How changes in networks have made dispersity routing less usefule and more difficult to implement  Disperity routing is currently(2007) being proposed for MANET’s and delay tolerant networks

Dispersity Routing  The earliest use of dispersity routing was as an alternative to adaptive routing  To equalize the load on the network  To reduce the queuing delays  Dispersity routing has been proposed as a means of increasing the available transmission rate between a source and destination by obtaining the cut-set of the rates between a source and destination rather than the rate of a single link

Dispersity Routing  Multi-path routing rule for ARPA-net(Advanced Research Projects Agency Network)  Distributes the data between a source and destination over several paths through the network instead of concentrating it on a single path  There are two types of disperity routing  Non-redundant dispersity routing  Redundant dispersity routing  A source partitions the message into smaller, apporximately equal length, sub-messages and transmits the sub-messages on different paths to the destination

Non-redundant Dispersity Routing  Non-redundant dispersity routing over 4 channels

Non-redundant Dispersity Routing  Adaptive Routing  Equalizes the load on the network by re-routing messages through less congested regions of the network  Dispersity Routing  Equalizes the load by spreading each message over more of network  When the link utilization are equalized, dispersity routing results in smaller queuing delays than adaptive routing  Because the queues serve a larger number of smaller customers

Redundant Dispersity Routing  Redundant dispersity routing over 4 channels Can use erasure correction procedures to determine missing sub-messages

Redundant Dispersity Routing  Divide a message into fewer sub-messages than there are paths  Redundancy is more useful to deal with the unexpected  If the traffic on a single path becomes extremely high, the user can receive the message on the other paths and does not have to wait until the message on the most congested path is received

Changes in Physical Layer  In the early 1970’s  Use microwave transmission  DWDM (Dense Wavelength Division Multiplexing) has increased the transmission rates that the fibers can carry  Programmable facilities switches have reduced the time needed to supply private lines to the users  Theses changes have reduced the need to the dispersity routing  To increase the bandwidth available to users  To disperse larger users over a network in order to avoid blocking the other network users

Changes in Physical Layer  In the early of 1990’s  Applications, such as transferring medical images, required higher rate access link to avoid unacceptable user delays  Increasing the access rate could result in a small number of users congesting the backbone links  Dispersity routing was considered for these applications  To increase the transmission rate available to high speed medical applications  To eliminate the delay caused by transmission errors in time critical applications

Changes in the Use of the Network  Packet networks have changed from specialized networks, serving a few hundred users, to ubiquitous networks, and serve hundreds of millions of users  The link transmission rates have increased  The average message lengths have increased  The link utilization have remained about the same  The average number of users sharing a link has increased  The variance of the link utilization and the queuing delays have become small  Eliminate the need for dispersity routing

Wireless Networks - MANETS  Redundant dispersity routing has been proposed to survive path changes in MANET’s (Mobile Adhoc NETwork)  A source set up multiple disjoint paths  Redundant sub-message deliver the data after a path has failed  Two problems  Maintaining multiple disjoint paths  Maintaining multiple disjoint paths in MANET’s, using the current resource discovery and routing mechanism, is unreasonable  The limited bandwidth in MANET’s  Should use ARQ strategies, rather than forward erasure correction 

Wireless Networks - MANETS  Can use non-redundant dispersity routing and partial retransmission to survive path failures  The advantage of non-redundant dispersity routing over single path transmissions  Following a transmission error, we retransmit a smaller fraction of the message  Following a path failure, the source and destination continue to communicate, although at a reduced rate

Wireless Networks – Robotic Routing  Multi-path geographic routing on a field with obstacles 1. Trace an obstacle 2. The information is retained in the message 3. The information is returned to the source 4. The source uses the information to select forwarding location

Wireless Networks – Robotic Routing  Robotic Routing  Determines a path around an obstacle when a node cannot locate a forwarding node that is closer to the destination  The routing procedure applies rules developed for robotics to packet forwarding  E.g) robot to trace an obstacle by placing its right hand on the obstacle (in wireless network, this rule is used to determine the next node on a path)  Robotic routing is used to both guarantee that a message finds a path when one exists and to plan subsequent communication between the source and destination

Wireless Networks – Robotic Routing  Robotic Routing  Missed paths and routing loops in robotic routing Missed path Disallowed!

Wireless Network  Robotic routing on a grid structure Impossible for communications paths between grid elements to jump over one another Rule : Above, below, right of left of our current grid

Intermittently Connected Networks  Do not have reverse path and cannot implement ARQ techniques used in non-redundant dispersity routing  Require the forward erasure-correction capabilities in redundant dipersity routing  Redundant dispersity routing can be used to trade-off delay and resources

Conclusion  Changes in networks have made dispersity routing less attractive in wired networks  MANET’s and intermittently connected networks have characteristics that originally made dispersity routing attractive and justify applying dispersity routing in the new environment