BUPT COMTEST R&D CENTER Network Coding-based Protection Strategy with Data Traffic Prediction Scheduling Algorithm Shasha Liang 2011-09-15.

Slides:

Advertisements

Similar presentations

APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.

Advertisements

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

Introduction to Computer Networks Spanning Tree 1.

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.

© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Jaringan Komputer Lanjut Packet Switching Network.

LOGO Video Packet Selection and Scheduling for Multipath Streaming IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 9, NO. 3, APRIL 2007 Dan Jurca, Student Member,

Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks Michael Barry, Andrew T Campbell, Andras Veres

VIPER – Voice over IP with Enhanced Resiliency Abstract: VoIP call quality is subject to Internet conditions, and users may experience periods of low quality.

High Performance Router Architectures for Network- based Computing By Dr. Timothy Mark Pinkston University of South California Computer Engineering Division.

1 Layer-Encoded Video in Scalable Adaptive Streaming Michael Zink, Jens Schmitt, and Ralf Steinmetz, Fellow, IEEE IEEE TRANSACTIONS ON MULTIMEDIA, VOL.

Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.

1 Version 3.0 Module 6 Ethernet Fundamentals. 2 Version 3.0 Why is Ethernet so Successful? In 1973, it could carry data at 3 Mbps Now, it can carry data.

Limited Application of ExOR Yao Zhao. Limited Application Static –No mobility Small Scale –Tens of nodes Dense network Maybe Only Rooftop Networks File.

1 Staleness vs.Waiting time in Universal Discrete Broadcast Michael Langberg California Institute of Technology Joint work with Jehoshua Bruck and Alex.

Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.

5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.

William Stallings Data and Computer Communications 7th Edition

Multi-Path Multimedia Transmission in Ad-hoc Networks Related Work Marcin Michalak

Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,

UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.

Virtual Active Networks Gong Su Mar. 9, Network Computing Models Traditional: end-to-end, Client-server software at end nodes The network is but.

Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.

1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007.

Data Communications and Networking

Table Of Contents Introduction What is WAN? Point to Point Links Circuit Switching Packet Switching WAN Virtual Circuits WAN Dialup Services WAN Devices.

Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.

Communication Networks

High-Performance Networks for Dataflow Architectures Pravin Bhat Andrew Putnam.

DISPERSITY ROUTING: PAST and PRESENT Seungmin Kang.

Multimedia Support for Wireless W-CDMA with Dynamic Spreading By Ju Wang Mehmet Ali Elicin And Jonathan C.L. Liu Lecture by Seth Caplan.

1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.

Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,

Ahmed Osama. What is Delay Tolerant Network?What is Delay Tolerant Network? DTN- WINC- Nile University2 IntroductionChallengesSummary S S D D No continuous.

Computer Networks with Internet Technology William Stallings

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.

Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.

Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Anna Urra, Eusebi Calle, Jose L Marzo Institute of Informatics.

BZUPAGES.COM Presentation On SWITCHING TECHNIQUE Presented To; Sir Taimoor Presented By; Beenish Jahangir 07_04 Uzma Noreen 07_08 Tayyaba Jahangir 07_33.

Overload Prediction Based on Delay in Wireless OFDMA Systems E. O. Lucena, F. R. M. Lima, W. C. Freitas Jr and F. R. P. Cavalcanti Federal University of.

1 Delay Aware Link Scheduling for Multi- Hop TDMA Wireless Networks Petar Djukic * and Shahrokh Valaee + *University of California +University of Toronto,

TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks

Page 1 The department of Information & Communications Engineering Dong-uk, kim A Survey of Packet Loss Recovery Techniques for Streaming.

UNIVERSITY OF JYVÄSKYLÄ 2005 Multicast Admission Control in DiffServ Networks Department of Mathematical Information Technology University of Jyväskylä.

Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,

(Slide set by Norvald Stol/Steinar Bjørnstad

Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.

Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.

1 A Cross-Layer Scheduling Algorithm With QoS Support in Wireless Networks Qingwen Liu, Student Member, IEEE, Xin Wang, Member, IEEE, and Georgios B. Giannakis,

Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)

A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,

Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.

Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.

Scheduling Mechanisms Applied to Packets in a Network Flow CSC /15/03 By Chris Hare, Ricky Johnson, and Fulviu Borcan.

Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.

Virtual Active Networks

Presented by Kristen Carlson Accardi

Multiple Access Problem: When two or more nodes transmit at the same time, their frames will collide and the link bandwidth is wasted during collision.

Advanced Computer Networks

Network Survivability

Virtual Active Networks

Aggressiveness Protective Fair Queuing for Bursty Applications

The Impact of Multihop Wireless Channel on TCP Performance

Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. I propose ‘extent of resource pooling’

Project proposal Multi-stream and multi-path audio transmission

Requirements of Computing in Network

Presentation transcript:

BUPT COMTEST R&D CENTER Network Coding-based Protection Strategy with Data Traffic Prediction Scheduling Algorithm Shasha Liang

COMPANY LOGO BUPT COMTEST R&D CENTER Contents Background 1 Protection strategies 2 Simulation and result analysis 3 Conclusion 4

COMPANY LOGO BUPT COMTEST R&D CENTER Background pre-designed protection: reserves enough bandwidth, when a failure occurs, backup paths are used to reroute the transmission and to recover the data. 1+1 and 1:1 protection is the typical technique of the pre- designed protection. The 1+1 protection need extra indicated protection links, hence the cost of which is not acceptable in most situations. Link failures Dynamic restoration: when the failure occurs, dynamic recovery is used to recover the data transmitted in the links that are suffered from failures. Although there is no need extra links with dynamic restoration technique, the recovery time is usually longer, and 100% service recovery cannot be guaranteed.

COMPANY LOGO BUPT COMTEST R&D CENTER Protection strategies Extra link is not applied in network coding-based protection strategies. Protection against single link failure is guaranteed. We give the network model as follows, then we will introduce how to select appropriate link to transmit protection packets.

COMPANY LOGO BUPT COMTEST R&D CENTER Scheduling algorithms RR Max idle The path with lower traffic load are selected to transmit protection data. PF Define a priority for each path and high priority path will be firstly selected. The strategy is that each path is used to carry protection packets in turn, that is to say, each path has equal dispatched chance.

COMPANY LOGO BUPT COMTEST R&D CENTER Simulation and result analysis Encoded packets are added to a working link which will collide with the data packets. The data packet has to wait in the cache which will lead to data packet delay. Now we give some simulations as follows:

COMPANY LOGO BUPT COMTEST R&D CENTER Simulation and result analysis Fig4. An unevenness data traffic Fig5. Average delay of package length

COMPANY LOGO BUPT COMTEST R&D CENTER Conclusion In this paper we present a new network protection strategy against link failure. It base on network coding and data traffic prediction scheduling algorithm. When some paths have heavy load, the strategy PF can reduce more than 50% packets delay comparing strategy RR. The strategy PF also achieve the relative average, making network traffic get to a certain extent balance on each path. To fit the diverse services and networks, more precise traffic prediction model should be researched, we believe that network protection could be done more intelligently.

BUPT COMTEST R&D CENTER