2006-08-30 ICDT'06 - Capillary routing with FEC - Emin Gabrielyan 1 Capillary-routing with Forward Error Correction (FEC) ICDT’06 - International Conference.

Slides:



Advertisements
Similar presentations
GSA Pizza Talk - EPFL - Capillary routing with FEC by E. Gabrielyan 1 Capillary Multi-Path Routing for reliable Real-Time Streaming with FEC.
Advertisements

Ch. 12 Routing in Switched Networks
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Opportunistic Routing Is Missing Its Opportunities! Sachin Katti & Dina Katabi.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
IPv4 - The Internet Protocol Version 4
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Jump to first page A. Patwardhan, CSE Digital Fountains Main Ideas : n Distribution of bulk data n Reliable multicast, broadcast n Ideal digital.
D.J.C MacKay IEE Proceedings Communications, Vol. 152, No. 6, December 2005.
Rome, February 14, 2013 Status of the Project Report on the first year activities With the support of the Prevention, Preparedness and Consequence.
David Ripplinger, Aradhana Narula-Tam, Katherine Szeto AIAA 2013 August 21, 2013 Scheduling vs Random Access in Frequency Hopped Airborne.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
Sang-Chun Han Hwangjun Song Jun Heo International Conference on Intelligent Hiding and Multimedia Signal Processing (IIH-MSP), Feb, /05 Feb 2009.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Using Redundancy to Cope with Failures in a Delay Tolerant Network Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source:
Fountain Codes Amin Shokrollahi EPFL and Digital Fountain, Inc.
1 NETWORK CODING Anthony Ephremides University of Maryland - A NEW PARADIGM FOR NETWORKING - February 29, 2008 University of Minnesota.
Multi-Path Multimedia Transmission in Ad-hoc Networks Related Work Marcin Michalak
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
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.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Data Communications and Networking
Packet Loss Characterization in WiFi-based Long Distance Networks Authors : Anmol Sheth, Sergiu Nedevschi, Rabin Patra, Lakshminarayanan Subramanian [INFOCOM.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Emin Gabrielyan, Three Topics in Parallel Communications 1 Three Topics in Parallel Communications Public PhD Thesis presentation by Emin Gabrielyan.
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
1 National Research Council - Pisa - Italy Marco Conti Italian National Research Council (CNR) IIT Institute MobileMAN Architecture and Protocols 2nd MobileMAN.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
DISPERSITY ROUTING: PAST and PRESENT Seungmin Kang.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Wireless Sensor Networks COE 499 Energy Aware Routing
Error control in video Streaming. Introduction Development of different types of n/ws such as internet, wireless and mobile networks has created new applications.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Threshold Phenomena and Fountain Codes Amin Shokrollahi EPFL Joint work with M. Luby, R. Karp, O. Etesami.
Computer Networks with Internet Technology William Stallings
CprE 545 project proposal Long.  Introduction  Random linear code  LT-code  Application  Future work.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC Maciej Kurant EPFL, Switzerland Infocom 2009, April 19-25, Rio de Janeiro.
Chengdu, China - ITST06, p Rating of Routing - E. Gabrielyan 1 Rating of Routing by Redundancy Overall Need 6th International Conference.
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
ITERATIVE CHANNEL ESTIMATION AND DECODING OF TURBO/CONVOLUTIONALLY CODED STBC-OFDM SYSTEMS Hakan Doğan 1, Hakan Ali Çırpan 1, Erdal Panayırcı 2 1 Istanbul.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
Raptor Codes Amin Shokrollahi EPFL. BEC(p 1 ) BEC(p 2 ) BEC(p 3 ) BEC(p 4 ) BEC(p 5 ) BEC(p 6 ) Communication on Multiple Unknown Channels.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
3GPP2 TSG-C SWG1.2 Maui, HI C R2/C of 12 TSG-C WG3/SWG1.2 joint meeting 12/07/05 BCMCS FEC evaluation simulation requirements.
INTRODUCTION:- The approaching 4G (fourth generation) mobile communication systems are projected to solve still-remaining problems of 3G (third generation)
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
William Stallings Data and Computer Communications
ICTTA 2006 – Capillary routing with FEC - Emin Gabrielyan
Multi-path Routing for Real-time Streaming with Erasure Resilient Codes International Conference on Wireless Networks – ICWN’06 – Monte Carlo Resort, Las.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Dr. John P. Abraham Professor UTPA
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Dr. John P. Abraham Professor UTRGV, EDINBURG, TX
IT351: Mobile & Wireless Computing
Dr. John P. Abraham Professor UTPA
Networked Real-Time Systems: Routing and Scheduling
Presentation transcript:

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan 1 Capillary-routing with Forward Error Correction (FEC) ICDT’06 - International Conference on Digital Telecommunications, August by Emin Gabrielyan, Switzernet.com (VoIP) and Swiss Federal Institute of Technology (EPFL) Switzerland Switzernet

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan2 Structure of my talk The advantages of packet level Forward Error Correction (FEC) in Off-line streaming Difficulties arising in application of packet level FEC in Real-time streaming How the difficulties of application of FEC in real-time streaming are solved by multi-path routing Generating multi-path routing patterns of various path diversity Relation between the diversity factor and the advantageousness of the routing (for real-time streaming)

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan3 Off-line streaming of a file using Digital Fountain FEC A file can be chopped into equally sized source packets Digital fountain code can unlimitedly generate different checksum packets … … … … …

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan4 Decoding of a file encoded by Digital Fountain Codes It is sufficient to collect a fixed number of checksum packets and the file can be recovered Choice of packets is not important only the number of packets matters As if with water fountain: you need to fill your cup by collecting a sufficient quantity of any drops … … …

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan5 An application: Delivery of large files over satellite link For example delivery of recurrent update of GPS maps to thousands of vehicles There is no feedback channels Continuous reception may require a constant visibility of 24 hours or more

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan6 Arbitrary network losses The visibility of a car is however fragmental and is arbitrary due to: Tunnels Whether conditions Underground parking, etc

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan7 Raptor (digital fountain) code in satellite one-way transmissions Solution is broadcasting with digital fountain code If reception is interrupted the missing packets are collected later Raptor code is also a new standard for MBMS in 3G mobile networks

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan8 Unrestricted buffering time at the receiver Reliability of off-line applications can be significantly improved with FEC codes The benefit of off-line applications from FEC codes is spectacular This befit relies on time diversity There is no need of real-time delivery of information to the end user

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan9 Time diversity If packets for information recovery are not collected at the present period of time… The missing quantity can be collected later Later… And later…

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan10 Real-time streaming While in off-line streaming the data can be hold in the receiver buffer … In real-time streaming the receiver is not permitted to keep data too long in the playback buffer

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan11 Long failures on a single path route If the failures are short and fine-grained, by transmitting a large number of FEC packets, receiver may constantly have in time a sufficient number of checksum packets If the failure lasts longer than the playback buffering limit, no FEC can protect the real-time communication

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan12 Reliable Off-line streaming Reliable real- Time streaming Applicability of FEC in Real-Time streaming Time diversity Playback buffer limit Real-time streaming In off-line streaming losses can be compensated by other packets received later In real-time streaming losses can be compensated by other packets received via another path Path diversity is an orthogonal method making FEC applicable also for real-time streaming Path diversity

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan13 Only multi-path patterns Intuitively we imagine the path diversity ax as shown: It is clear that compared with single path routing any multi path routing is good High diversity decreases the impact of individual link failures, but uses much more links, increasing the overall failure probability Which level of path diversity is the optimal and requires the minimal encoding efforts of the sender We must study many multi-path routings patterns of different diversity (without single path routing) in order to answer this question Single path routing Multi-path routing Path diversity

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan14 Capillary routing As a method for obtaining multi-path routing patterns of various path diversity we relay on capillary routing algorithm For any given network and pair of nodes it produces layer by layer routing patterns of increasing path diversity Path diversity= Layer of Capillary Routing

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan15 Capillary routing - introduction Capillary routing first offers a simple multi-path routing pattern At each successive layer it recursively spreads out the individual sub-flows of the previous layer Therefore the path diversity develops as the layer number increases

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan16 Reduce the maximal load of all links Capillary routing – first layer The construction relies on an iterative LP process First take the shortest path flow and minimize the maximum load of all links This will split the flow over a few main parallel routes

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan17 Capillary routing – second layer At the second layer identify the bottleneck links of the first layer Then minimize the flow of all remaining links, except the bottleneck links of the first layer Reduce the load of the remaining links

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan18 Capillary routing – algorithm Identify the bottlenecks of the second layer …and at the third layer reduce the maximal load of all remaining links, except the bottlenecks of the first and second layers Repeat this iteration until all links of the communication path are enclosed in bottlenecks of the constructed layers

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan19 Network samples The network samples for applying capillary routing are obtained from a random walk MANET Nodes are moving in a rectangular area If the nodes are sufficiently close and are within the range of the coverage there is a link between the nodes [diagram]diagram

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan20 Capillary routing examples Here is an example of capillary routing on a small random walk ad-hoc network with 9 nodes [diagram]diagram An example of capillary routing on a larger network with 130 nodes [diagram]diagram

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan21 Weak static and strong dynamic FEC We have now hundreds of network samples For each network sample we have a dozen of multi- path routing suggestions of different path diversity To evaluate these multi-path routing pattern for real- time streaming we assume a real-time application, where The sender uses a small constant amount of FEC checksum packets to combat weak losses and The sender can dynamically increase the number of FEC packets in case of serious failures

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan22 Weak FEC codes If we need the real-time streaming to constantly tolerate a given weak packet loss rate t We can compute accordingly the needed FEC block length = FEC t We assume Reed-Solomon code source packets redundant packets FEC block

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan23 Packet Loss Rate = 3% Packet Loss Rate = 30% Strong FEC codes When the packet loss rate observed at the receiver is below the tolerable limit t (let’s say it is 5%) the sender transmits at its usual rate But when the packet loss rate exceeds the tolerable limit, the sender adaptively increases the FEC block size by adding more redundant packets

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan24 Overall number of redundant packets Assume a uniform probability of link failures in the network Depending on the choice of the multi-path routing between the source and destination, the sender may be required to transmit more or less redundant packets Heavily loaded links may cause serious losses requiring significant amount of FEC packets from the sender Many lightly loaded links increase the overall failure rate and also may require in total a large number of FEC packets to be transmitted during the communication time

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan25 Redundancy Overall Requirement The overall amount of dynamically transmitted redundant packets during the whole communication time is proportional: to the duration of communication and the usual transmission rate to a single link failure frequency and its average duration and to a coefficient characterizing the given multi-path routing pattern

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan26 Equation for ROR This routing coefficient is computed according the above equation, where FEC r(l) is the FEC transmission block size in case of the complete failure of link l, which is a function of the load of the link under the given routing pattern FEC t is the FEC block size at default streaming (tolerating loss rate t)

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan27 ROR coefficient Smaller the ROR coefficient of the multi-path routing pattern, better is the choice of multi- path routing for real-time streaming By measuring ROR coefficient of multi-path routing patterns of different path diversity, we can evaluate the advantages (or disadvantages) of diversification Multi-path routing patterns of different diversity are created by capillary routing algorithm

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan layer1 layer2 layer3 layer4 layer5layer6 layer7layer8layer9 layer10 capillarization Average ROR rating ROR as a function of diversity Here is ROR as a function of the capillarization level It is an average function over 25 different network samples (obtained from MANET) The constant tolerance of the streaming is 5.1% Here is ROR function for a stream with a static tolerance of 4.5% Here are ROR functions for static tolerances from 3.3% to 7.5% 3.3% 3.9% 4.5% 5.1% 7.5% 6.3%

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan29 ROR rating over 200 network samples ROR function of the routing’s capillarization computed on several sets of network samples Each set contains 25 network samples Network samples are obtained from random walk MANET Almost in all cases path diversity obtained by capillary routing algorithm reduces the overall amount of FEC packets

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan30 Conclusions Except a few pathological cases in typical network environment strong path diversity is beneficiary for real- time streaming Capillary routing patterns significantly reduce the overall number of redundant packets required from the sender Today’s commercial real-time streaming applications do not rely on packet level FEC, since with single path routing FEC is helpless With multi-path routing patterns real-time applications can have great advantages from application of FEC When the underlying routing cannot be changed, for example in public Internet, rely computers of an overly network can be used to achieve a multi-path communication flow

ICDT'06 - Capillary routing with FEC - Emin Gabrielyan31 Questions ? Thank you ! Questions ? or