And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival.

Slides:



Advertisements
Similar presentations
RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.
Advertisements

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.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
David Ripplinger, Aradhana Narula-Tam, Katherine Szeto AIAA 2013 August 21, 2013 Scheduling vs Random Access in Frequency Hopped Airborne.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
The Power of Explicit Congestion Notification Aleksandar Kuzmanovic Northwestern University
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
© Manasa Quantifying Metrics for Resilient and Survivable Networks EECS 801 Graduate Reading © 2008–Manasa K 6 June 2008 Manasa K Department of Electrical.
Reduced TCP Window Size for Legacy LAN QoS II Niko Färber Sept. 20, 2000.
Scalable On-Demand Media Streaming With Packet Loss Recovery Anirban Mahanti, Derek L. Eager, Mary K. Vernon, and David J. Sundaram-Stukel IEEE/ACM Trans.
The Crosspoint Queued Switch Yossi Kanizo (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) and David Hay (Politecnico di Torino, Italy)
Multiple Sender Distributed Video Streaming Thinh Nguyen (IEEE Member) Avideh Zakhor (IEEE Fellow) IEEE Transactions on multimedia 2004.
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
17/10/2003TCP performance over ad-hoc mobile networks. 1 LCCN – summer 2003 Uri Silbershtein Roi Dayagi Nir Hasson.
Investigation of TDMA solution for the hidden terminal problem (With “ Wavion ” ) Final Report Presentation.
Submission doc.: IEEE /0097r0 Slide 1 Performance Analysis of Frequency Selective Scheduling Date: Authors: Ningbo Zhang, BUPT January.
Using Redundancy and Interleaving to Ameliorate the Effects of Packet Loss in a Video Stream Yali Zhu, Mark Claypool and Yanlin Liu Department of Computer.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Multiple Sender Distributed Video Streaming Nguyen, Zakhor IEEE Transactions on Multimedia April 2004.
CS332 Ch. 28 Spring 2014 Victor Norman. Access delay vs. Queuing Delay Q: What is the difference between access delay and queuing delay? A: I think the.
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
The Transport Layer (L4) Provides an end-to-end, reliable transport service between l4 entities –Reliable - error-free, in- sequence, no loss or duplication.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
Fair Real-time Traffic Scheduling over Wireless Local Area Networks Insik Shin Joint work with M. Adamou, S. Khanna, I. Lee, and S. Zhou Dept. of Computer.
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
Influence of Transmission Power on the Performance of Ad Hoc Networks Crystal Jackson SURE 2004.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
Estimating Bandwidth of Mobile Users Sept 2003 Rohit Kapoor CSD, UCLA.
The effect of router buffer size on the TCP performance K.E. Avrachenkov*, U.Ayesta**, E.Altman*, P.Nain*,C.Barakat* *INRIA - Sophia Antipolis, France.
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
Nov Chung-Hsien Hsu1 Round Robin with Look Ahead: A New Scheduling Algorithm for Bluetooth Daqing Yang, Gouri Nair, Balaji Sivaramakrishnan, Harishkumar.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Performance Evaluation of TCP over Multiple Paths in Fixed Robust Routing Wenjie Chen, Yukinobu Fukushima, Takashi Matsumura, Yuichi Nishida, and Tokumi.
Review. Why can average request time be used to determine the work-load required for saturation?
1 Delay Aware Link Scheduling for Multi- Hop TDMA Wireless Networks Petar Djukic * and Shahrokh Valaee + *University of California +University of Toronto,
Jeopardy Category 1 Category 1 Category 2 Category 3 Category 4 Category
1.INTRODUCTION The use of the adaptive codebook (ACB) in CELP-like speech coders allows the achievement of high quality speech, especially for voiced segments.
Fast motion estimation and mode decision for H.264 video coding in packet loss environment Li Liu, Xinhua Zhuang Computer Science Department, University.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
1 Transport Control Protocol for Wireless Connections ElAarag and Bassiouni Vehicle Technology Conference 1999.
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
Network teleology Damon Wischik
OverQos: Less Bandwidth for More Reliable Service ?? --A Criticism Hongyu Gao Gregory Peaker.
Submission doc.: IEEE 11-14/0866r0 July 2014 Johan Söder, Ericsson ABSlide 1 Traffic modeling and system capacity performance measure Date:
Yuan-Cheng Lai and Yen-Hung Chen Department of Information Management National Taiwan University of Science and Technology AINA 2008 Accept rate: 2008.
Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
Event Generation Channel Access Process Channel Release Process Traffic Transmission Process Simulation Control Simulation Flowchart - total.
System Study of the Wireless Multimedia Ad-hoc Network based on IEEE g Authors Chung-Wei Lee Jonathan C.L. Liu & Kun Chen Yu-Chee Tseng & S.P. Kuo.
Cooperative Adaptive Partner Selection for Real-Time Services in IEEE j Multihop Relay Networks Cheng-Kuan Hsieh, Jyh-Cheng Chen, Jeng-Feng Weng.
Shou-Chih Lo and Chia-Wei Tseng National Dong Hwa University A Novel Multi-channel MAC Protocol for Wireless Ad Hoc Networks VTC 2007-spring.
Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Agenda Background Project goals Project description –General –Implementation –Algorithms Simulation results –Charts –Conclusions.
Congestion Control in Data Networks and Internets
HCF and EDCF Simulations
ns-2 simulation of TCP + CBR traffic
MR2RP: The Multi-Rate and Multi-Range Routing Protocol for IEEE 802
Radio Link Layer tuning in HSPA Evolution Laura Kneckt Supervisor : Professor Jyri Hämäläinen Instructor: M. Sc. Stefan Wager.
Presentation transcript:

And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival rate λ =200, i.e. average of 12 requests per second

Zero Packet Loss

.5% Packet Loss

5% Packet Loss

15% Packet Loss

Zero Packet Loss

.5% Packet Loss

5% Packet Loss

15% Packet Loss

Conclusions - number of connections influence zero packet loss –average delay is not effected by number of connections. –additional connections cause performance degradation as a result of TCP overhead. non zero packet loss –all algorithms benefit from additional connections. Categories algorithm effected the most –additional connections minimize channel stalls (which are a result of TCP error recovery). average delay improvement better total throughput

Conclusions – algorithm influence zero packet loss –average delay is similar for all algorithms possibly effected by low request arrival rate non zero packet loss –Single Queue algorithm provides the best results for average delay and total throughput. –Categories algorithm is the worst option. Although the categories algorithm doesn’t achieve any improvement in terms of average delay and total performance,it could improve a “punishment rate” significantly.

Final Conclusions: SQ CAT RR

The end