# The monitoring of the network traffic based on queuing theory

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp The monitoring of the network traffic based on queuing theory Wang Jian-Ping 1,, Huang Yong 1, 1 School of Information Engineer, Henan Institute of Science and Technology, Xinxiang, , china Abstract Network traffic monitoring is an important way for network performance analysis and monitor. The article explains how to build the basic model of network traffic analysis based on Queuing Theory, using this, we can obtain the network traffic forecasting ways and the stable congestion rate formula, combining the general network traffic monitor parameters, we can realize the estimation and monition process for the network traffic rationally. Keywords 1 Foreword Queuing Theory; M/M/1 queue; traffic monitor; congestion rate; Markov Process Queuing Theory, also called random service theory, is a branch of Operation Research in Maths, it s a subject which researches the random regulation of queuing phenomenon, and builds up the maths model by analyzing the date of the network. Through the prediction of the system, we can reveal the regulation about the queuing probability and choose the optimal method for the system. Adopting Queuing Theory to estimate the network traffic, which becomes the important ways of network performance prediction, analysis and estimation, through this way, we can imitate the true network, it s useful and reliable for organizing, monitoring and defending the network. 2 The maths model of the Queuing theory In network communication, from sending, transferring to receiving datačňthe proceeding of the data coding, decoding and sending to the higher layer, With all these process,we can find a simple queuing model. According to the Queuing Theory, this correspond procedure can be abstracted as Queuing theory model [9], like figure 1 showing to us. Supposing this kind of simple data transmitting system satisfies the queue model M/M/1[5]. Supported by the natural science foundation of Education Department of Henan province grant NO He was born in 1981, in BaoJi, ShaanXi province of china, he is a master candidate, his research area is Computer Network and Operation Research. He was born in 1970, in ChangSha, Hunan province of China, he is a lecturer, his research area is Computer Graphics and Computer Software.

2 The Monitoring of the Network Traffic based on Queuing Theory 61 Figure 1: The abstract model of communication process From the figure above, λ stands for the sending rate of the sender, T N is regarded as transportation delay time, λ means the arriving speed of the data packets,n q is the quantity of data packets stored in the buffer,γis the lost rate of the receiver,and T S = T J + T D + T C is the service time of data packets in the queue. T J, T D and T C stand for the decoding, dispatching and handling time separately. The sender is abstracted to be a queue, whose sending rate is λ. In model M/M/1, the two M represent the sending process of the sender and the receiving process of the receiver separately. They both follow the Markov Process[2], also keep to Poisson Distribution, while the number 1 stands for the channel. Using N(t)=t as the length of the queue at the moment of t, so the probability of the queue whose length is n,can be shown as the following formula. According to the formula 1,we can know the equation 2: p n (t) = p[n(t) = n] (1) { p n(t) = λ p n 1 (t) + µ p n+1 (t) (λ + µ)p n (t),n = 0,1,2... p 0 (t) = µ p 1(t) λ p 0 (t) (2) In equation 2, supposing λ as the arrival rate while µ as the service rate, when t, we can get the stable solution of the equation p n (t). p n (t) = ρ(1 ρ)n = 0,1,2,... (3) In formula 3, using ρ = λ/µ 1 as the probability of the service. N stands for the length of the queue under the balanced condition, It includes the average volume of all the data packets which enter the processing module and store in the buffer. N = n=0 np n = n=0 p n (1 ρ) = ρ 1 ρ If N q shows the average volume of the buffer s data packets, We can conclude the following formula N q = N ρ = ρ 1 ρ ρ = ρ2 1 ρ If the processing module is regarded as a closed region, the parameter is brought into the formula 5,using the Little Law, we can get the equation(6) (4) (5)

3 62 The 7th International Symposium on Operations Research and Its Applications { ρ = λts λ = λ (6) After putting equation (6) into the equation (5) and sorting it out, we can get the formula(7) (λ T s ) 2 + λt S N q N q = 0 (7) According to the derivative formula (7), we make a conclusion, among three variables, the service time,the sending rate, and the buffer, if we know any two variables,it is easy to gain the numerical value of the third one.so these three variables are the key parameters for measuring the performance of the transmission system. 3 Queuing theory and the network traffic monitor 3.1 The method of monitoring the network traffic Traffic monitoring is the basic way for scheduling, concerting and operating the net[7]. Network usually uses Peak Information Rate(PIR),Peak Burst Length(PBL),Commitment Information Rate(CIR),Commitment Burst Length(CBL),Extra Information Rate(EIR)and Extra Burst Length(EBL),the six parameters as the network traffic monitoring parameters. Using the six parameters above, we can realize two kinds of Bandwidth Measurement Algorithms, they are PIR/CIR Algorithms and CIR/EIR Algorithms[8], PIR/CIR uses four parameters, they are PIR,PBL,CIR and CBL.CIR/EIR also uses four parameters, they are CIR,CBL, EIR and EBL. In these algorithms, each of the PIR/PBL,CIR/CBL, EIR/EBL informs a Token Bucket partly[6],from this we know that every algorithms contains two token buckets, so they are called dual-token buckets algorithms. 3.2 Forecasting the network traffic using Queuing Theory The network traffic is very common[4], What s worse, when the traffic becomes under extreme situation, it will lead to the net s paralysis[1]. There are a great deal of research about monitoring the congestion at present,besides, the documents which make use of Queuing Theory to research the traffic rate appear more and more. for forecasting the traffic rate, we often test the data disposal function of the router used in the network. Supposing a router s arrival rate of data flow in groups is λ, and the average time which the routers use to dispose each group is 1 µ, the buffer of the routers is C, if a certain group arrives, the waiting length of the queue in groups has already reached, so the group has to be lost. When the arriving time of group timeouts, the group has to resend, Supposing the group s average waiting time is 1 µ, we identify p i(t) to be the arrival probability of the queue length for the routers group at the moment of t, supposing the queue length is i: p(t) = (p 0 (t), p 1 (t),..., p n 1 (t)),i = 0,1,...,C + 1 (8) Then the queuing system of the router s date groups satisfies simple Markov Process[10], according to Markov Process, we can make the diversion strength of matrix as follow:

4 The Monitoring of the Network Traffic based on Queuing Theory 63 Q = λ λ µ (λ + µ + ν) λ + ν µ (λ + µ + 2ν) λ + 2ν Network Congestion Rate µ (λ + µ +Cν) λ +Cν µ µ Network congestion rate is changing all the time [3], the instantaneous congestion rate and the stable congestion rate are often used to analysis the network traffic in network monitor. The instantaneous rate A C (t) is the congestion rate at the moment of t.the A C (t) can be obtained by solving the system length of the queue s probability distributing, which called p n 1 (t).according to some properties of Markov Process, we know thatp i (t)(i = 0,...,C + 1)satisfies the following differential equation systems: p 0 (t) λ p 0(t) + µ p 1 (t) p λ (t) = [λ + (k 1)ν]p k 1(t) [λ + µ + kν]p k (t) + µ p k+1(t), k = 1,...,C P C+1 (t) = [λ +Cν]p (10) C(t) µ p C+1 (t) p 0 (0) = 1, p 2 (0) = p 3 (0) =... = p C+1(0)=0 By solving this differential equation systems, we get the instantaneous congestion rate A 0 (t) is A 0 (t) = P 1 (t) = (9) λ µ + λ (1 e (µ+λ)t ) (11) The instantaneous congestion rate can t be used to measure the stable operating condition of the system, so we must obtain the stable congestion rate of the system. The so-called stable congestion rate means it will not change with the time changing, when the system works in a stable operating condition. The definition of the stable congestion rate is A C (t) = lim t A C (t) (12) Supposing ρ = lim p(t) as the distributing of the stable length of the queue, C as t the buffer of the router, the stable congestion rate can be obtained in two ways: firstly, we obtain the instantaneous congestion rate,then make its limit out. According to its definition, it can be obtained with the distributing of the length of the queue. Secondly, according to the Markov Process, we know that the distributing of the stable length of queue can be get through evaluating equation (13) pq = 0 C+1 P i = 1 i=n (13)

5 64 The 7th International Symposium on Operations Research and Its Applications In the equation p = (p 0, p 1,..., p C+1 ), When C=0, the equation (13) s evaluation is A 0 = P 1 + When C=1, the equation (13) s evaluation is A 1 = P 2 = When C =2, the equation (13) s evaluation is A 3 = P 4 = 1 λ µ + λ λ(λ + ν) λ(λ + ν) + µ(µ + λ) µ (λ + µ + 2ν)A 2 (λ + ν)(1 A 1 )A 0 + µ on the analogy of this, we conclude that,the stable congestion rate is (14) (15) (16) A C = P C+1 = 1 µ (λ + µ +Cν)A C 1 (λ + (C 1)ν(1 A c 1 )A C 1 + µ (17) 4 Conclusion The article explains how to build the queue model based on the Queuing Theory, how to realize calculation and analyzing the network traffic through M/M/1 Queuing Theory, and then gets the forecast way and the formula of the stable congestion rate of the network traffic. The network traffic monitoring model which is tested, experimented and analyzed by the actually system,shows that using the Queuing Theory will optimize the network traffic, it s convenient and simple for calculating and monitoring the network traffic properly. References [1] Wang Ting, Wang Yu. Survey on a Queue Theory Based Handover Scheme for UAVS Communication Network. Chinese Journal of Sensors and Actuators, 2007, 04 [2] Li Da-Qi, Shen Jun-Yi. Queuing Theory Supervising K-Means Clustering Algorithm and ITS Application in Optimized Design of TTC Network.Journal of Astronautics, 2007, 03 [3] Han Jing, Guo Fang, Shi Jin-Hua. Research on the traffic monitoring of the distributed network based on human immune algorithm. Microcomputer Information, 2007, 18 [4] Wang Pei-Fa, Zhang Shi-wei, Li Jun. The Application and Achievement of SVG in Network Netflow Monitor Field. Microelectronics & Computer, 2005, 04 [5] Ren Xiang-Cai, Xiong Qi-Bang. An Application of Mobile Agent for IP Network Traffic Management.Computer Engineering, 2002, 11 [6] Davison B D. A Web Caching Primer. IEEE Internet Computing, 2001, 5(4) [7] Guo Yang, Gong Wei-Bo, Don Towsley. Timestepped Hybrid Simulation (TSHS) for Large Scale Networks. In: Proceedings of IEEE Infocom Israel: IEEE, 2000

6 The Monitoring of the Network Traffic based on Queuing Theory 65 [8] Jong Suk Ahn, Peter B Danzig. Packet Network Simulation: Speed up and Accuracy Versus Timing Granularity. IEEE/ACM Trans on Networking, 1996, 4(5) [9] Vern Paxson, Sally Floyd. Why We Don t Know How To Simulate the Internet. In: Proceedings of the 1997 Winter Simulation Conference. USA: ACM, 1997 [10] Gunther N. The Practical Performance Analyst. New York: McGraw-Hill, 1998 [11] ITU-T G.729A. Coding of Speech at 8kbps using Conjugate-Structure Algebraic Code-excited Linear-prediction Coding. USA: ITU-T, 1998

### Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow

International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter

### Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.

### Research on the UHF RFID Channel Coding Technology based on Simulink

Vol. 6, No. 7, 015 Research on the UHF RFID Channel Coding Technology based on Simulink Changzhi Wang Shanghai 0160, China Zhicai Shi* Shanghai 0160, China Dai Jian Shanghai 0160, China Li Meng Shanghai

### Fuzzy Active Queue Management for Assured Forwarding Traffic in Differentiated Services Network

Fuzzy Active Management for Assured Forwarding Traffic in Differentiated Services Network E.S. Ng, K.K. Phang, T.C. Ling, L.Y. Por Department of Computer Systems & Technology Faculty of Computer Science

### 1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one

### Quality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?

18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic

### 6.6 Scheduling and Policing Mechanisms

02-068 C06 pp4 6/14/02 3:11 PM Page 572 572 CHAPTER 6 Multimedia Networking 6.6 Scheduling and Policing Mechanisms In the previous section, we identified the important underlying principles in providing

### Modeling and Simulation of Queuing Scheduling Disciplines on Packet Delivery for Next Generation Internet Streaming Applications

Modeling and Simulation of Queuing Scheduling Disciplines on Packet Delivery for Next Generation Internet Streaming Applications Sarhan M. Musa Mahamadou Tembely Matthew N. O. Sadiku Pamela H. Obiomon

### Step-coordination Algorithm of Traffic Control Based on Multi-agent System

International Journal of Automation and Computing 6(3), August 2009, 308-313 DOI: 10.1007/s11633-009-0308-z Step-coordination Algorithm of Traffic Control Based on Multi-agent System Hai-Tao Zhang 1 Fang

### Quality of Service Routing Network and Performance Evaluation*

Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,

### MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt

MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt A great proportion of essential services are moving into internet space making the

### QoS issues in Voice over IP

COMP9333 Advance Computer Networks Mini Conference QoS issues in Voice over IP Student ID: 3058224 Student ID: 3043237 Student ID: 3036281 Student ID: 3025715 QoS issues in Voice over IP Abstract: This

### Comparative Analysis of Congestion Control Algorithms Using ns-2

www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,

### Examining Self-Similarity Network Traffic intervals

Examining Self-Similarity Network Traffic intervals Hengky Susanto Byung-Guk Kim Computer Science Department University of Massachusetts at Lowell {hsusanto, kim}@cs.uml.edu Abstract Many studies have

### Network congestion, its control and avoidance

MUHAMMAD SALEH SHAH*, ASIM IMDAD WAGAN**, AND MUKHTIAR ALI UNAR*** RECEIVED ON 05.10.2013 ACCEPTED ON 09.01.2014 ABSTRACT Recent years have seen an increasing interest in the design of AQM (Active Queue

### Sources: Chapter 6 from. Computer Networking: A Top-Down Approach Featuring the Internet, by Kurose and Ross

M ultimedia Communication Multimedia Systems(Module 5 Lesson 3) Summary: Beyond Best-Effort Motivating QoS Q uality of Service (QoS) Scheduling and Policing Sources: Chapter 6 from Computer Networking:

### Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks

Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Jian Chen and Victor C.M. Leung Department of Electrical and Computer Engineering The

### Tutorial 7 : Link layer part I

Lund University ETSN01 Advanced Telecommunication Tutorial 7 : Link layer part I Author: Antonio Franco Course Teacher: Emma Fitzgerald February 12, 2015 Contents I Before you start 3 II Exercises 3 1

### COMPARATIVE ANALYSIS OF DIFFERENT QUEUING MECHANISMS IN HETROGENEOUS NETWORKS

COMPARATIVE ANALYSIS OF DIFFERENT QUEUING MECHANISMS IN HETROGENEOUS NETWORKS Shubhangi Rastogi 1, Samir Srivastava 2 M.Tech Student, Computer Science and Engineering, KNIT, Sultanpur, India 1 Associate

### Performance Evaluation of Active Queue Management Using a Hybrid Approach

1196 JOURNAL OF COMPUTERS, VOL. 7, NO. 5, MAY 2012 Performance Evaluation of Active Queue Management Using a Hybrid Approach Chin-Ling Chen* Chia-Chun Yu Department of Information Management, National

### BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS

GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,

### Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic

Telecommunication Systems 24:2 4, 275 292, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort

### ISSN: 2321-7782 (Online) Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies

ISSN: 2321-7782 (Online) olume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com

### On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?

On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex? Hiroyuki Ohsaki and Masayuki Murata Graduate School of Information Science and Technology Osaka

### A Proxy-based Architecture for Multimedia Transmission

Proceedings of the 8th WSEAS International Conference on Automation and Information, Vancouver, Canada, June 19-21, 2007 322 A Proxy-based Architecture for Multimedia Transmission WANG DA-ZHEN [1,2], WAN

### Voice over IP. Overview. What is VoIP and how it works. Reduction of voice quality. Quality of Service for VoIP

Voice over IP Andreas Mettis University of Cyprus November 23, 2004 Overview What is VoIP and how it works. Reduction of voice quality. Quality of Service for VoIP 1 VoIP VoIP (voice over IP - that is,

### A Hybrid Load Balancing Policy underlying Cloud Computing Environment

A Hybrid Load Balancing Policy underlying Cloud Computing Environment S.C. WANG, S.C. TSENG, S.S. WANG*, K.Q. YAN* Chaoyang University of Technology 168, Jifeng E. Rd., Wufeng District, Taichung 41349

### VoIP QoS on low speed links

Ivana Pezelj Croatian Academic and Research Network - CARNet J. Marohni a bb 0 Zagreb, Croatia Ivana.Pezelj@CARNet.hr QoS on low speed links Julije Ožegovi Faculty of Electrical Engineering, Mechanical

### Real-time apps and Quality of Service

Real-time apps and Quality of Service Focus What transports do applications need? What network mechanisms provide which kinds of quality assurances? Topics Real-time versus Elastic applications Adapting

### QoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS

Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

### Research Article Average Bandwidth Allocation Model of WFQ

Modelling and Simulation in Engineering Volume 2012, Article ID 301012, 7 pages doi:10.1155/2012/301012 Research Article Average Bandwidth Allocation Model of WFQ TomášBaloghandMartinMedvecký Institute

### Observingtheeffectof TCP congestion controlon networktraffic

Observingtheeffectof TCP congestion controlon networktraffic YongminChoi 1 andjohna.silvester ElectricalEngineering-SystemsDept. UniversityofSouthernCalifornia LosAngeles,CA90089-2565 {yongminc,silvester}@usc.edu

### A Hysteretic Model of Queuing System with Fuzzy Logic Active Queue Management

A Hysteretic Model of Queuing System with Fuzzy Logic Active Queue Management Vladimir Deart, Andrey Maslennikov Moscow Technical University of Communications and Informatics Moscow, Russia vdeart@mail.ru,

### Quality of Service (QoS)) in IP networks

Quality of Service (QoS)) in IP networks Petr Grygárek rek 1 Quality of Service (QoS( QoS) QoS is the ability of network to support applications without limiting it s s function or performance ITU-T T

### A Novel Load Balancing Optimization Algorithm Based on Peer-to-Peer

A Novel Load Balancing Optimization Algorithm Based on Peer-to-Peer Technology in Streaming Media College of Computer Science, South-Central University for Nationalities, Wuhan 430074, China shuwanneng@yahoo.com.cn

### Congestion Control Overview

Congestion Control Overview Problem: When too many packets are transmitted through a network, congestion occurs t very high traffic, performance collapses completely, and almost no packets are delivered

### CURRENT wireless personal communication systems are

Efficient Radio Resource Allocation in a GSM and GPRS Cellular Network David E Vannucci & Peter J Chitamu Centre for Telecommunications Access and Services School of Electrical and Information Engineering

### Frame Metering in 802.1Q Version 01

Frame Metering in 802.1Q Version 01 Stephen Haddock January 15, 2013 1 Overview Frame metering introduced in 802.1ad-2005 in conjunction with the DEI bit of the S-VLAN tag. The DEI bit was introduced to

### A Network Simulation Experiment of WAN Based on OPNET

A Network Simulation Experiment of WAN Based on OPNET 1 Yao Lin, 2 Zhang Bo, 3 Liu Puyu 1, Modern Education Technology Center, Liaoning Medical University, Jinzhou, Liaoning, China,yaolin111@sina.com *2

### Chapter 1. Introduction

Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset

### AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS

AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS Srikanth Tiyyagura Department of Computer Science and Engineering JNTUA College of Engg., pulivendula, Andhra Pradesh, India.

### CSE3214 Computer Network Protocols and Applications. Chapter 1 Examples and Homework Problems

CSE3214 Computer Network Protocols and Applications Chapter 1 Examples and Homework Problems Example 1 (review question 18) (1) How long does it take a packet of length 1000 bytes to propagate over a link

### Optimizing Congestion in Peer-to-Peer File Sharing Based on Network Coding

International Journal of Emerging Trends in Engineering Research (IJETER), Vol. 3 No.6, Pages : 151-156 (2015) ABSTRACT Optimizing Congestion in Peer-to-Peer File Sharing Based on Network Coding E.ShyamSundhar

### Active Queue Management and Wireless Networks

Active Queue Management and Wireless Networks Vikas Paliwal November 13, 2003 1 Introduction Considerable research has been done on internet dynamics and it has been shown that TCP s congestion avoidance

### Protagonist International Journal of Management And Technology (PIJMT) Online ISSN- 2394-3742. Vol 2 No 3 (May-2015) Active Queue Management

Protagonist International Journal of Management And Technology (PIJMT) Online ISSN- 2394-3742 Vol 2 No 3 (May-2015) Active Queue Management For Transmission Congestion control Manu Yadav M.Tech Student

### The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback

The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback Hamada Alshaer Université Pierre et Marie Curie - Lip 6 7515 Paris, France Hamada.alshaer@lip6.fr

### Adaptive Coding and Packet Rates for TCP-Friendly VoIP Flows

Adaptive Coding and Packet Rates for TCP-Friendly VoIP Flows C. Mahlo, C. Hoene, A. Rostami, A. Wolisz Technical University of Berlin, TKN, Sekr. FT 5-2 Einsteinufer 25, 10587 Berlin, Germany. Emails:

### Reliable Multicast Protocol with Packet Forwarding in Wireless Internet

Reliable Multicast Protocol with Packet Forwarding in Wireless Internet Taku NOGUCHI, Toru YOSHIKAWA and Miki YAMAMOTO College of Information Science and Engineering, Ritsumeikan University 1-1-1, Nojihigashi,

### Analyzing Marking Mod RED Active Queue Management Scheme on TCP Applications

212 International Conference on Information and Network Technology (ICINT 212) IPCSIT vol. 7 (212) (212) IACSIT Press, Singapore Analyzing Marking Active Queue Management Scheme on TCP Applications G.A.

### 17: Queue Management. Queuing. Mark Handley

17: Queue Management Mark Handley Queuing The primary purpose of a queue in an IP router is to smooth out bursty arrivals, so that the network utilization can be high. But queues add delay and cause jitter.

### Towards a Content Delivery Load Balance Algorithm Based on Probability Matching in Cloud Storage

Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 2211-2217 2211 Open Access Towards a Content Delivery Load Balance Algorithm Based on Probability

### Analysis of QoS parameters of VOIP calls over Wireless Local Area Networks

Analysis of QoS parameters of VOIP calls over Wireless Local Area Networks Ayman Wazwaz, Computer Engineering Department, Palestine Polytechnic University, Hebron, Palestine, aymanw@ppu.edu Duaa sweity

### Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

### A QOS BASED LOAD BALANCED SWITCH

A QOS BASED LOAD BALANCED SWITCH Vishnu Prasath Badri narayanan, Manigandan S K Veltech Hightech Dr.RR and Dr.SR Engineering college,india ABSTRACT The simple architecture with high forwarding capacity

### Performance improvement of active queue management with per-flow scheduling

Performance improvement of active queue management with per-flow scheduling Masayoshi Nabeshima, Kouji Yata NTT Cyber Solutions Laboratories, NTT Corporation 1-1 Hikari-no-oka Yokosuka-shi Kanagawa 239

### DDoS Attack Detection Using Flow Entropy and Packet Sampling on Huge Networks

DDoS Attack Detection Using Flow Entropy and Packet Sampling on Huge Networks Jae-Hyun Jun School of Computer Science and Engineering Kyungpook National University jhjun@mmlab.knu.ac.kr Cheol-Woong Ahn

### Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm

Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

### Indepth Voice over IP and SIP Networking Course

Introduction SIP is fast becoming the Voice over IP protocol of choice. During this 3-day course delegates will examine SIP technology and architecture and learn how a functioning VoIP service can be established.

### Modeling and Evaluation of Web Services in Mobile Networks Using Stochastic Colored Petri Nets

Journal of Advances in Computer Research Quarterly ISSN: 2008-6148 Sari Branch, Islamic Azad University, Sari, I.R.Iran (Vol. 4, No. 4, November 2013), Pages: 37-50 www.jacr.iausari.ac.ir Modeling and

### ECE 333: Introduction to Communication Networks Fall 2002

ECE 333: Introduction to Communication Networks Fall 2002 Lecture 14: Medium Access Control II Dynamic Channel Allocation Pure Aloha In the last lecture we began discussing medium access control protocols

### Congestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?

Congestion Control Review What is congestion control? 15-441 Computer Networking What is the principle of TCP? Lecture 22 Queue Management and QoS 2 Traffic and Resource Management Resource Management

### Content Distribution Scheme for Efficient and Interactive Video Streaming Using Cloud

Content Distribution Scheme for Efficient and Interactive Video Streaming Using Cloud Pramod Kumar H N Post-Graduate Student (CSE), P.E.S College of Engineering, Mandya, India Abstract: Now days, more

### What is CSG150 about? Fundamentals of Computer Networking. Course Outline. Lecture 1 Outline. Guevara Noubir noubir@ccs.neu.

What is CSG150 about? Fundamentals of Computer Networking Guevara Noubir noubir@ccs.neu.edu CSG150 Understand the basic principles of networking: Description of existing networks, and networking mechanisms

### Adaptive Sampling for Network Performance Measurement Under Voice Traffic

Sampling for Network Performance Measurement Under Voice Traffic Wenhong Ma and Changcheng Huang Optical Networks Laboratory Department of Systems and Computer Engineering, Carleton University 1125 Colonel

### Active Queue Management

Course of Multimedia Internet (Sub-course Reti Internet Multimediali ), AA 2010-2011 Prof. 6. Active queue management Pag. 1 Active Queue Management Active Queue Management (AQM) is a feature that can

### An Efficient Load Balancing Technology in CDN

Issue 2, Volume 1, 2007 92 An Efficient Load Balancing Technology in CDN YUN BAI 1, BO JIA 2, JIXIANG ZHANG 3, QIANGGUO PU 1, NIKOS MASTORAKIS 4 1 College of Information and Electronic Engineering, University

### Optical interconnection networks with time slot routing

Theoretical and Applied Informatics ISSN 896 5 Vol. x 00x, no. x pp. x x Optical interconnection networks with time slot routing IRENEUSZ SZCZEŚNIAK AND ROMAN WYRZYKOWSKI a a Institute of Computer and

### Performance Analysis of Interleaving Scheme in Wideband VoIP System under Different Strategic Conditions

Performance Analysis of Scheme in Wideband VoIP System under Different Strategic Conditions Harjit Pal Singh 1, Sarabjeet Singh 1 and Jasvir Singh 2 1 Dept. of Physics, Dr. B.R. Ambedkar National Institute

### CoMPACT-Monitor: Change-of-Measure based Passive/Active Monitoring Weighted Active Sampling Scheme to Infer QoS

CoMPACT-Monitor: Change-of-Measure based Passive/Active Monitoring Weighted Active Sampling Scheme to Infer QoS Masaki Aida, Keisuke Ishibashi, and Toshiyuki Kanazawa NTT Information Sharing Platform Laboratories,

### A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks

A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks Didem Gozupek 1,Symeon Papavassiliou 2, Nirwan Ansari 1, and Jie Yang 1 1 Department of Electrical and Computer Engineering

### Design call center management system of e-commerce based on BP neural network and multifractal

Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(6):951-956 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Design call center management system of e-commerce

### Network traffic monitoring system design based on the unconstrained

Networ traffic monitoring system design based on the unconstrained clustering queuing School of Telecommunications and Information Engineering, Xi'an University of Posts & Telecommunications, Xi an Shaanxi,

### A Policy-Based Admission Control Scheme for Voice over IP Networks

Journal of Computer Science 5 (11): 817-821, 2009 ISSN 1549-3636 2009 Science Publications A Policy-Based Admission Control Scheme for Voice over IP Networks Sami Alwakeel and Agung Prasetijo Department

### A Topology-Aware Relay Lookup Scheme for P2P VoIP System

Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme

### Requirements of Voice in an IP Internetwork

Requirements of Voice in an IP Internetwork Real-Time Voice in a Best-Effort IP Internetwork This topic lists problems associated with implementation of real-time voice traffic in a best-effort IP internetwork.

### 5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.

5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt

### Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation

Establishing How Many VoIP Calls a Wireless LAN Can Support Without Performance Degradation ABSTRACT Ángel Cuevas Rumín Universidad Carlos III de Madrid Department of Telematic Engineering Ph.D Student

### Robust Router Congestion Control Using Acceptance and Departure Rate Measures

Robust Router Congestion Control Using Acceptance and Departure Rate Measures Ganesh Gopalakrishnan a, Sneha Kasera b, Catherine Loader c, and Xin Wang b a {ganeshg@microsoft.com}, Microsoft Corporation,

### Curso de Telefonía IP para el MTC. Sesión 2 Requerimientos principales. Mg. Antonio Ocampo Zúñiga

Curso de Telefonía IP para el MTC Sesión 2 Requerimientos principales Mg. Antonio Ocampo Zúñiga Factors Affecting Audio Clarity Fidelity: Audio accuracy or quality Echo: Usually due to impedance mismatch

### CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM

INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM Mohammad Badruzzama Khan 1, Ayesha Romana 2, Akheel Mohammed

### A Passive Method for Estimating End-to-End TCP Packet Loss

A Passive Method for Estimating End-to-End TCP Packet Loss Peter Benko and Andras Veres Traffic Analysis and Network Performance Laboratory, Ericsson Research, Budapest, Hungary {Peter.Benko, Andras.Veres}@eth.ericsson.se

### Lecture 16: Quality of Service. CSE 123: Computer Networks Stefan Savage

Lecture 16: Quality of Service CSE 123: Computer Networks Stefan Savage Final Next week (trust Blink wrt time/location) Will cover entire class Style similar to midterm I ll post a sample (i.e. old) final

### The network we see so far. Internet Best Effort Service. Is best-effort good enough? An Audio Example. Network Support for Playback

The network we see so far CSE56 - Lecture 08 QoS Network Xiaowei Yang TCP saw-tooth FIFO w/ droptail or red Best-effort service Web-surfing, email, ftp, file-sharing Internet Best Effort Service Our network

### Assignment #2 for Computer Networks

Assignment # for Computer Networks Savvas C. Nikiforou Department of Computer Science and Engineering University of South Florida Tampa, FL 6 Abstract The purpose of this assignment is to compare the queueing

### Rate-Based Active Queue Management: A Green Algorithm in Congestion Control

Rate-Based Active Queue Management: A Green Algorithm in Congestion Control Balveer Singh #1, Diwakar Saraswat #2 #1 HOD Computer Sc. & Engg. #2 Astt. Prof. Computer Sc. & Engg PKITM Mathura (UP) India

### Referring to the above question, the end-to-end delay (transmission delay plus propagation delay) is

CS326e Quiz 3 The first correct 10 answers will be worth 1 point each. Each subsequent correct answer will be worth 0.2 points. Circle the correct answer. UTEID In the following 7 problems, we are sending

### An Efficient Transmission Scheme for Short Message Service in IEEE 802.16 Systems

An Efficient Transmission Scheme for Short Message Service in IEEE 802.16 Systems Sung-Min Oh* and Jae-Hyun Kim* *Ajou University, School of Electrical and Computer Engineering smallb01@ajou.ac.kr and

### Performance Analysis of Queuing Disciplines for Different Internet Service Protocols

Performance Analysis of Queuing Disciplines for Different Internet Service Protocols Neha Ghaisas Department of Computer Engineering, R.R Sedamkar Professor and Dean Academics, Rashmi Thakur Asst. Professor,

### Basic Multiplexing models. Computer Networks - Vassilis Tsaoussidis

Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,

### NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS

NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper

### Virtual Routing Model and PI Rate Control Algorithm in High-band width Wireless LAN

, pp. 79-9 http://dx.doi.org/.457/ijsip.5.8.5.9 Virtual Routing Model and PI Rate Control Algorithm in High-band width Wireless LAN SHEN JianFei Hunan Mass media Vocational Technical College, Hunan province

### Voice Service Support over Cognitive Radio Networks

Voice Service Support over Cognitive Radio Networks Ping Wang, Dusit Niyato, and Hai Jiang Centre For Multimedia And Network Technology (CeMNeT), School of Computer Engineering, Nanyang Technological University,

### IMPROVING QUALITY OF VIDEOS IN VIDEO STREAMING USING FRAMEWORK IN THE CLOUD

IMPROVING QUALITY OF VIDEOS IN VIDEO STREAMING USING FRAMEWORK IN THE CLOUD R.Dhanya 1, Mr. G.R.Anantha Raman 2 1. Department of Computer Science and Engineering, Adhiyamaan college of Engineering(Hosur).

### PERFORMANCE ANALYSIS OF VOIP TRAFFIC OVER INTEGRATING WIRELESS LAN AND WAN USING DIFFERENT CODECS

PERFORMANCE ANALYSIS OF VOIP TRAFFIC OVER INTEGRATING WIRELESS LAN AND WAN USING DIFFERENT CODECS Ali M. Alsahlany 1 1 Department of Communication Engineering, Al-Najaf Technical College, Foundation of

### Lectures 5 & / Introduction to Queueing Theory

Lectures 5 & 6 6.263/16.37 Introduction to Queueing Theory MIT, LIDS Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS PS PS Packet Network PS PS

### PFS scheme for forcing better service in best effort IP network

Paper PFS scheme for forcing better service in best effort IP network Monika Fudała and Wojciech Burakowski Abstract The paper presents recent results corresponding to a new strategy for source traffic

### Using median filtering in active queue management for telecommunication networks

Using median filtering in active queue management for telecommunication networks Sorin ZOICAN *, Ph.D. Cuvinte cheie. Managementul cozilor de aşteptare, filtru median, probabilitate de rejectare, întârziere.