Analysis of Delayed Reservation Scheme in Server-based QoS Management Network
|
|
- Gwendolyn Pierce
- 8 years ago
- Views:
Transcription
1 Analysis of Delayed Reservation Scheme in Server-based QoS Management Network Takeshi Ikenaga Ý, Kenji Kawahara Ý, Tetsuya Takine Þ, and Yuji Oie Ý Ý Dept. of Computer Science and Electronics, Kyushu Institute of Technology / TAO of Japan Þ Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University Abstract This paper proposes an analytical model for delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the related blocking probability and the waiting time distribution of requests, and discuss its performance by means of numerical results. The numerical results show that the delayed scheme can improve the blocking probability by about two order of magnitude compared with the conventional reservation scheme even when a small acceptable waiting time (e.g. 20% of average flow duration). We can conclude that the delayed reservation scheme can lead to significant improvement in a server-based QoS management network performance. Introduction On the Internet, various kinds of multimedia application have used, such as video-conferencing and Internet telephony. In addition, the traffic volume is increasing explosively with non real-time communication by Web browsing and peer-to-peer style file-sharing (or file-exchange) applications. Thus, the traditional best effort Internet must be changed to support real-time applications which need a QoS guarantee. To provide QoS-aware communication, some architectures such as the Integrated Services (IntServ) [] [2] and the Differentiated Services (DiffServ) [3] [4] [5] have been introduced by working groups of the Internet Engineering Task Force (IETF). Moreover, Bandwidth Broker architecture [6] [7] and COPS (Common Open Policy Service) protocol [8] have been also proposed in the IETF for realizing centralized server-based policy and/or bandwidth management. We focus here on the intra domain (e.g. campus network) QoS management by using centralized QoS server such as Bandwidth Broker or Policy Server that provides a function of end-to-end resource allocation [9]. Conventional resource reservation protocols [0] are immediately rejecting requests, when they are not acceptable because there are no available resources upon their arrivals. Some recent work on deferred reservations [] has introduced mechanisms This work was supported in part by TAO of Japan under the Project Japan Gigabit Network research project (JGN-R40), and a Grant-in Aid for Scientific Research on Priority Areas (2) (409074) of the Ministry of Education, Culture, Sports, Science and Technology, Japan. to reduce the overall blocking probability compared to that with the all-or-nothing reservation approach. The hop-byhop deferral scheme proposed there enforces reservation requests to wait at intermediate routers if there is no available path ahead of them. The requests waiting at the router can be forwarded if any path to their destinations becomes available. Thus, the scheme can not make use of multiple available paths between a source and a destination once the deferral process begins. We have proposed a delayed path reservation scheme for a server-based QoS management network and examined the effectiveness of this scheme through computer simulation [2]. Multiple paths can be utilized efficiently, unlike in the above scheme. In this paper, we propose an analytical model for delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the related blocking probability and the waiting time distribution of requests, and discuss its performance by means of numerical results. From numerical results, we will show that the delayed reservation scheme is very effective in improving the blocking probability in some context of practical interest even if acceptable waiting time is small, say 20% of the average communication time (or service time in the terminology of the queueing system). The rest of this paper is organized as follows. In Section 2, we present a motivation of delayed path reservation scheme and describes its basic approach. In Section 3, we analyze the model. In Section 4, we give some numerical results to show the effectiveness of our scheme, and we conclude in Section 5. 2 Delayed Reservation In this section, we describe the outline of our QoS management scheme and the proposed delayed reservation scheme. 2. Motivation Figure shows a basic model of a server-based QoS management network. The key components of this framework are the user terminal, router, and resource manager (the QoS management server). The QoS management server knows the network topology and manages QoS information such as physical/available bandwidth of links of the whole network.
2 User Terminal Request Response Server Provisioning Data Flow Resource Management QoS Routing User Terminal Figure. Server-based QoS management model To provide QoS for end-to-end communication, network resources should be reserved according to the QoS requirements. When resources need to be reserved along a path from a sender to a receiver, a resource allocation request is first sent to the QoS management server. But if the network is overloaded, many requests will be rejected. A user who receives a reject message will have three alternatives to choose: Use best-effort communication even if the desired quality of service cannot be expected. (start communication with downgraded QoS) Send the QoS request again after waiting for some duration. (retry manually) Abandon the communication attempt. We are interested here in the first two cases, where requests can wait for a while instead of being immediately rejected. If a user is willing to tolerate an initial setup delay, which is referred to as the acceptable waiting time from now on, we will be able to improve the blocking probability by delaying the path reservation. Then, we will propose a scheme to improve the blocking probability by delaying the path reservation to some extent if there is no available path meeting the requirement when requested. 2.2 Delayed Reservation Scheme Delayed path reservation scheme can be described as follows.. The QoS management server receives a path reservation request from a user and tries to find a route meeting the requested QoS. (a) If a new request is acceptable, the server will accept it and accordingly allocate the network resources. (b) If a new request is not acceptable, it will be stored in the tail of the waiting buffer. If the waiting buffer is already full, the server will reject the request. 2. When a network resource is released because of the termination of a previously accepted communication, the server will examine whether requests waiting in the buffer can be accepted. Request Arrival N Reject (Timeout) Delay c servers Figure 2. Queueing Model Accept 3. When a request has been forced to wait longer than the user s acceptable waiting time, it will be rejected and deleted from a buffer. Therefore, a request can be rejected in two cases when there are no resources available that meet its requirement and there is no space in the waiting buffer, and when the waiting time in the buffer exceeds the acceptable waiting time. 3 Analytical Model In the network, we assume that QoS requests from users arrive at one QoS server according to Poisson process with parameter, and that the distribution of the processing time of one request follows the exponential distribution with parameter. If the server can deal with up to requests simultaneously and it further accommodates Æ requests in the waiting room, we can model the server as ÅÅ Æ queueing system. It is natural for the server to block some request when its waiting time exceeds Ì, so that we should analyze the ÅÅ Æ system with waiting time limits (Figure 2), and derive the waiting time distribution and the blocking probability of requests. Ô Æµ First of all, we will derive the steady state probability,, that the number of requests are in the system when the buffer size is set to Æ. When we take a view of transition of the number of requests in the system, we find that the state when it is or less and that when it is over change alternatively. Furthermore, we can find that the duration of the former state follows i.i.d. and it is independent of Æ, namely, the conditional steady state probability Õ on the duration when the number of requests is or less in the system is also independent of Æ. Thus, we first derive its average duration when Æ. At this time, i.e., in the ÅÅ queueing system, Ô µ ( ) is given as follows. Ô µ Ò Ò Ò Ô µ Ô µ µ () Therefore, we can give the conditional steady state probability Õ as Ô µ Õ Ô µ µ (2) Furthermore, the average duration when the number of requests in the system is becomes, the relation of Ô µ 2
3 and is given by the following proportional expression, Ô µ Ô µ (3) Here, we define the average duration when the number of requests in the system is over as Ƶ, which is dependent on Æ, so we finally get Ô Æµ as follows. Ô Æµ Ƶ Õ µ (4) From Eq. (4), we should focus on the behavior of the duration when the number of requests is over and derive Ƶ. In the following subsections, we will investigate it in two cases, namely, Æ and Æ. 3. Case when Æ As previously mentioned, the state when the number of requests in the system is or less and that when it is over change alternatively, thus we only focus on the latter state in detail. In this duration, the maximum number Æ of waiting room is set to, so that the number of waiting requests becomes or. Let denote the random variable in terms of the period when the number of waiting requests is and be that when it is. Since we assume the analytical model as ÅÅ Æ system, both variables are independent each other. Thus the Laplace transform of the probability distribution function of the sum of and, µ, can be defined as follows. µ In order to derive µ, we must show all the events occurring in the duration when the number of requests in the system is over. After it becomes, one of following three events will occur:. The service of any one of requests is finished and the number of requests being serviced becomes. 2. New request arrives at the server and the number of requests in the system gets. However, if the waiting time of this request exceeds Ì, the request will be deleted. 3. New request arrives at the server, and then it will be served. Let Ò denote the above event Ò Ò ¾ µ. Moreover, on the condition that any of these events occur, let denote the random variable in terms of the period when the number of waiting requests is and be that when it is. After the beginning of this duration, some request arrives at the server according to Poisson process with parameter, and that the distribution of the processing time of some request out of ones being serviced follows the exponential distribution with parameter. Here, we denote the indicator function of event by µ, the Laplace transform in terms of the event Ò Ò ¾ µ is derived as follows. µ µ ¾ µ ¾µ µ µ Ü Ü Ü Ü (5) Ü Ü Ì µ Ü Ì Ü (6) Ì Ü Ü Ý Ü Ýµ Ü Ý (7) When event occurs, the duration when the number of requests in the system is over ends, and if event ¾ or happens, the duration starts again due to the memoryless property of exponential distribution. Thus, the Laplace transform µ can be expressed by the following equation. µ µ ¾ µ µ µ (8) By using Eq. (8), we can get the average duration when the number of requests in the system is over, µ, as follows. µ ÐÑ µ (9) We define the probability Ô µ Ô µ as, so that the probability that a new arrival request is served immediately is given by µ µ (0) the probability Ô µ that the new arrival request waits for the waiting room is also given by Ô µ ÐÑ µ µ µ () Since the QoS management server rejects the waiting requests when it does not finish to serve any one of requests being serviced until its waiting time gets Ì, the associated probability is defined as Ô µ Ì (2) Furthermore, the probability Ô µ that the new arrival request is immediately blocked is as follows. Ô µ ÐÑ µ µ µ (3) From Eqs. (2) and (3), we can define the blocking probability, È,as È Ô µ Ô µ Ì Ô µ (4) 3
4 and the probability distribution function Ï Üµ of the waiting time of requests that can be served is derived as follows. Ï Üµ Ô µ Ü µ if ÜÌ È if Ü Ì (5) 3.2 Case when Æ Next, we deal with the case when Æ, namely, ÅÅ queueing system with waiting time limits when. As same in the previous subsection, we will focus on the state that the number of requests in the system is over. Namely, we ignore the state that the number of requests is or less. Therefore, the virtual waiting time of the assumed system is identical to that of the queueing system with waiting time limits Ì on the condition that both service time and vacation time follow the exponential distribution with parameter. This model has been analyzed in [3], so that some performance measures we are interested in are directly given from analytical results obtained in [3]. Let Ï Üµ be the probability distribution function of the virtual waiting time when the limitation Ì is,wegive it as Ï Üµ Ü µý Ü Ýµ Ý (6) From Eq. () in [3], the average duration when the number of requests in the system is over, µ, is given as follows. µ Ï Ì µ (7) where and the probability that some new arrival request is stored in the waiting room is derived by µ µ (8) From Eq. (3) in [3], we can define the blocking probability, È, that the waiting time of requests in the system reaches Ì, as follows. È µ Ï Ì µµ (9) Ï Ì µ Furthermore, from Eq. (4) in [3], the probability distribution function Ï Üµ of the waiting time of served requests is thus derived as follows. Ï Üµ Ï Üµ Ï Ì µ if ÜÌ if Ü Ì (20) N=, /µ=80, c= ρ = =0.2 =0.5 Figure 3. Blocking probability (Æ ) ρ =0.8 ρ =0.6 ρ =0.4 /µ=80, c= N= Figure 4. Blocking probability (Æ ) 4 Numerical Results In this section, we will investigate the effectiveness of the delayed path reservation scheme described in Section 2, by showing performances of the blocking probability and waiting time as functions of the number of servers, the offered load µ and the acceptable waiting time Ì. We will first show numerical results in the case that Æ, and then Æ by generally setting the average flow duration to 80 (sec.) and to 0. Furthermore, we change some parameters according to the actual network topology and explain the effectiveness of the scheme. 4. Case when Æ We first show the case when Æ, i.e., if the QoS server can not find any QoS path for the request from some router, only one request can wait in the QoS server. Figure 3 illustrates the impact of the ratio Ì of the acceptable waiting time to the average flow duration on the blocking probability. In this figure, the x-axis indicates the offered load. Compared with the case of, it is found that the blocking probability improves by about 50 % when and Ì ¾. However, even if Ì is set to larger value, the blocking probability keeps almost same value. To investigate the sensitivity of this limitation, the blocking 4
5 Waiting Time maximum 99 percentile 98 percentile N=, /µ=80, c=0, ρ = Figure 5. Waiting Time (Æ ) Waiting Time maximum ρ =0.6 ρ =0.7 ρ =0.8 N=, /µ=80, c=0, 98 percentile Figure percentile Waiting Time (Æ ) N=, /µ=80, c=0 = =0.2 e-05 =0.3 =0.4 e Figure 7. Blocking probability (Æ ) ρ =0.8 ρ =0.6 ρ = ρ /µ=80, c=0 N= Figure 8. Blocking probability (Æ ) probability as a function of Ì is also shown in Figure 4. We can see from this figure that it does not improve further when Ì ¾ independently of. Figure 5 shows maximum, 99- and 98-percentile waiting times as a function of the ratio Ì. Here, the maximum waiting time equals Ì and is in proportion to Ì becomes is fixed to 80. However, although both 99- and 98-percentile waiting times becomes larger as Ì increases, they keep almost the same value when it exceeds about For example, if Ì, 99- and 98-percentile waiting times become about 30% and 5% of the maximum one, respectively. The impact of the offered load on the 98- percentile waiting time is also shown in Figure 6, and it is found that even if is set to i.e., relatively high, the 98- percentile waiting time becomes quite smaller than a half of maximum one. Thus when Æ, we can conclude that performance does not improve when the acceptable waiting time Ì is set to 25% of the average flow duration or larger due to the strict limitation of the buffer size. 4.2 Case when Æ Next we will deal with the case when the buffer size of waiting requests Æ. Figure 7 shows the impact of Ì on the blocking probability, as a function of the offered load. We can see from this figure that the blocking probability improves by about one order of magnitude when and Ì. As same in the previous subsection, the blocking probability as a function of Ì is also shown in Figure 8. Unlike in the case of Æ, the blocking probability is monotonously decreasing as Ì. However, as shown in Figure 9, both 99- and 95-percentile waiting times are monotonously increasing as Ì. It is found that 99- and 95-percentile waiting times are about 75% and 30% of the maximum one, respectively, over a wide range of Ì. 4.3 Impact of We will examine the impact of parameter. It can be thought that is the maximum number of paths which can be set up by QoS management server. In an actual network, the value of is determined by the number of routers, the number of links, link bandwidth, request bandwidth, network topology, etc. Figure 0 shows the impact of on the blocking probability, as a function of the offered load. We can see from this figure, large results in low È when Ì and are fixed. Figure represents È as a function of. For Æ, the delayed reservation scheme improves È by about 40% compared with the over a wide range of when. In contrast, the case when Æ, large leads to large improvement on È compared with the. Therefore, in a network where is rela- 5
6 Waiting Time maximum 99 percentile 95 percentile N=, /µ=80, c=0, ρ = Figure 9. Waiting Time (Æ ) c=0 c=20 c=30 c=40 N=, /µ=80, =0.2 e Figure 0. Blocking probability (Æ Ì ¾) tively large, the delayed reservation scheme can improve the blocking probability even when a small acceptable waiting time (Ì ) are assumed. 5 Conclusions In this paper, we propose an analytical model for delayed reservation scheme, which can be exactly analyzed. Conventional resource reservation protocols are immediately rejecting requests, when they are not acceptable because there are no available resources upon their arrivals. We focus on a way to improve the blocking probability by delaying the path reservation to some extent if a user is willing to tolerate an initial setup delay, which we refer to as the acceptable waiting time. We then evaluate the performance of this scheme by focusing on the blocking probability and the waiting time, by applying our analytical model to a serverbased QoS management network. From numerical results, the delayed scheme can improve the blocking probability by about two order of magnitude compared with the conventional reservation scheme even when a small acceptable waiting time (e.g. 20% of average flow duration,, ). We can conclude that the delayed reservation scheme can lead to significant improvement in a server-based QoS management network performance. ρ e-05 /µ=80, =0.2, ρ =0.6 N= N= e c Figure. Waiting Time ( Ì ¾ ) References [] J. Wroclawski, Specification of the Controlled Load Quality of Service, RFC 22, Sep [2] S. Shenker, C. Partridge, and R. Guérin, Specification of Guaranteed Quality of Service, RFC 222, Sep [3] S. Blake, et al., An Architecture for Differentiated Services, RFC 2475, Dec [4] J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, Assured Forwarding PHB Group, RFC 2597, Jun [5] A. Charny, et al., An Expedited Forwarding PHB (Per-Hop Behavior), RFC 3246, Mar [6] K. Nichols, V. Jacobson, and L. Zhang, A Two-bit Differentiated Services Architecture for the Internet, RFC 2638, Jul [7] H. Manzoor and M. Yoshida, ENICOM S BAND- WIDTH BROKER, Proc. IEEE SAINT200, pp , Jan [8] D. Durham, Ed., et al., The COPS (Common Open Policy Service) Protocol, RFC 2748, Jan [9] G. Apostolopoulos, et al., Server Based QoS Routing, Proc. IEEE GLOBECOM 99, pp , Dec [0] R. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, Resource ReSerVation Protocol (RSVP) Version Functional Specification, RFC 2205, Sep [] S. Norden and J. Turner, DRES: Network Resource Management using Deferred Reservations, Proc. IEEE GLOBECOM 0, pp , Nov [2] T. Ikenaga, Y. Isozaki, Y. Hori, and Y. Oie, Performance Evaluation of Delayed Reservation Schemes in Server-based QoS Management, to appear in Proc. IEEE GLOBECOM 2002, Nov [3] T. Takine and T. Hasegawa, A Note on Å Vacation Systems with Waiting Time Limits, Advances in Applied Probability, vol.22, no.2, pp.53 58,
QoS in multi-service IP networks
QoS in multi-service IP networks Vasco Nuno Sousa Simões Pereira Department of Informatics Engineering of the University of Coimbra vasco@dei.uc.pt Abstract Today, an increasing number of applications
More informationHow To Provide Qos Based Routing In The Internet
CHAPTER 2 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 22 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 2.1 INTRODUCTION As the main emphasis of the present research work is on achieving QoS in routing, hence this
More informationImplement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network
Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Zuo-Po Huang, *Ji-Feng Chiu, Wen-Shyang Hwang and *Ce-Kuen Shieh adrian@wshlab2.ee.kuas.edu.tw, gary@hpds.ee.ncku.edu.tw,
More informationPerformance 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
More informationQoS 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:
More informationQuality 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:
More informationSupporting End-to-End QoS in DiffServ/MPLS Networks
Supporting End-to-End QoS in DiffServ/MPLS Networks Ji-Feng Chiu, *Zuo-Po Huang, *Chi-Wen Lo, *Wen-Shyang Hwang and Ce-Kuen Shieh Department of Electrical Engineering, National Cheng Kung University, Taiwan
More informationHow To Share Bandwidth On A Diffserv Network
Proceedings of the 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, 14-17 May 2007, Penang, Malaysia Bandwidth Sharing Scheme in DiffServ-aware
More informationInvestigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions
Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Steve Gennaoui, Jianhua Yin, Samuel Swinton, and * Vasil Hnatyshin Department of Computer Science Rowan University
More informationA Review on Quality of Service Architectures for Internet Network Service Provider (INSP)
A Review on Quality of Service Architectures for Internet Network Service Provider (INSP) Herman and Azizah bte Abd. Rahman Faculty of Computer Science and Information System Universiti Teknologi Malaysia
More informationA 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
More informationIntegrated Service (IntServ) versus Differentiated Service (Diffserv)
Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook Computer Networking A Top- Down Approach Featuring the Internet ACN: IntServ and DiffServ
More informationFigure 1: Network Topology
Improving NGN with QoS Strategies Marcel C. Castro, Tatiana B. Pereira, Thiago L. Resende CPqD Telecom & IT Solutions Campinas, S.P., Brazil E-mail: {mcastro; tatibp; tresende}@cpqd.com.br Abstract Voice,
More informationQuality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints
Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationQuality of Service on the Internet: Evaluation of the IntServ Architecture on the Linux Operative System 1
Quality of Service on the Internet: Evaluation of the IntServ Architecture on the Linux Operative System 1 Elisabete Reis elreis@dei.uc.pt Polytechnic Institute of Coimbra Fernando Melo fmelor@dei.uc.pt
More informationMultimedia Requirements. Multimedia and Networks. Quality of Service
Multimedia Requirements Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Transfer/Control Protocols Quality of Service
More informationEXPERIMENTAL STUDY FOR QUALITY OF SERVICE IN VOICE OVER IP
Scientific Bulletin of the Electrical Engineering Faculty Year 11 No. 2 (16) ISSN 1843-6188 EXPERIMENTAL STUDY FOR QUALITY OF SERVICE IN VOICE OVER IP Emil DIACONU 1, Gabriel PREDUŞCĂ 2, Denisa CÎRCIUMĂRESCU
More information4 Internet QoS Management
4 Internet QoS Management Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se September 2008 Overview Network Management Performance Mgt QoS Mgt Resource Control
More information18: Enhanced Quality of Service
18: Enhanced Quality of Service Mark Handley Traditional best-effort queuing behaviour in routers Data transfer: datagrams: individual packets no recognition of flows connectionless: no signalling Forwarding:
More informationQoS in IP networks. Computer Science Department University of Crete HY536 - Network Technology Lab II 2000-2001. IETF Integrated Services (IntServ)
QoS in IP networks Computer Science Department University of Crete HY536 - Network Technology Lab II 2000-2001 IETF Integrated Services (IntServ) Connection-oriented solution (end-to-end) QoS guarantees
More information16/5-05 Datakommunikation - Jonny Pettersson, UmU 2. 16/5-05 Datakommunikation - Jonny Pettersson, UmU 4
Multimedia Networking Principles Last time Classify multimedia Multimedia Networking Applications Streaming stored audio and video Identify the network Real-time Multimedia: Internet Phone services the
More informationPFS 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
More informationQuality of Experience and Quality of Service
Communicate Simply Quality of Experience and Quality of Service For IP Video Conferencing Timothy M. O Neil Director of Technical Marketing Polycom Video Communications Table of Contents Introduction...1
More informationQuality of Service for IP Videoconferencing Engineering White Paper
Engineering White Paper Subha Dhesikan Cisco Systems June 1 st, 2001 Copyright 2002 Cisco Systems, Inc. Table of Contents 1 INTRODUCTION 4 2 WHY QOS? 4 3 QOS PRIMITIVES 5 4 QOS ARCHITECTURES 7 4.1 DIFFERENTIATED
More information3 Analysis of LSR Model
Performance Analysis for QoS Provisioning in MPLS Networks Shogo Nakazawa, Hitomi Tamura, Kenji Kawahara, Yuji Oie Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka,
More informationAn Analysis of the DiffServ Approach in Mobile Environments
1 An Analysis of the DiffServ Approach in Mobile Environments Torsten Braun, University of Berne, Switzerland. (braun@iam.unibe.ch) Claude Castelluccia, INRIA Rhône-Alpes, France. (claude.castelluccia@inrialpes.fr)
More informationOn Traffic Types and Service Classes in the Internet
On Traffic Types and Service Classes in the Internet Mansour J. Karam, Fouad A. Tobagi Abstract In today s Internet, various traffic types having different characteristics and requirements (e.g., voice,
More informationCS640: Introduction to Computer Networks. Why a New Service Model? Utility curve Elastic traffic. Aditya Akella. Lecture 20 QoS
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 QoS Why a New Service Model? Best effort clearly insufficient Some applications need more assurances from the network What is the basic
More informationChapter 7 outline. 7.5 providing multiple classes of service 7.6 providing QoS guarantees RTP, RTCP, SIP. 7: Multimedia Networking 7-71
Chapter 7 outline 7.1 multimedia networking applications 7.2 streaming stored audio and video 7.3 making the best out of best effort service 7.4 protocols for real-time interactive applications RTP, RTCP,
More information6.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
More informationCHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs
CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).
More informationAnalysis of IP Network for different Quality of Service
2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Analysis of IP Network for different Quality of Service Ajith
More informationA Prototype Implementation of the Two-Tier Architecture for Differentiated Services
A Prototype Implementation of the Two-Tier Architecture for Differentiated Services AndreasTerzis,JunOgawa,SoniaTsui,LanWang,LixiaZhang UCLA Computer Science Department {terzis, ogawa, sonia, lanw, lixia}@cs.ucla.edu
More informationVIDEO STREAMING OVER SOFTWARE DEFINED NETWORKS WITH SERVER LOAD BALANCING. Selin Yilmaz, A. Murat Tekalp, Bige D. Unluturk
VIDEO STREAMING OVER SOFTWARE DEFINED NETWORKS WITH SERVER LOAD BALANCING Selin Yilmaz, A. Murat Tekalp, Bige D. Unluturk College of Engineering, Koç University, 34450 Sariyer, Istanbul, Turkey ABSTRACT
More informationNetwork-based Quality of Service for Polycom IP Videoconferencing
Network-based Quality of Service Date: June 2005 Copyright 2005: Pinacl Solutions UK Ltd INTRODUCTION... 3 INFORMATION SOURCES...3 NETWORK-BASED QUALITY OF SERVICE (NQOS) SERVICE LEVELS... 3 Best eft service...3
More informationVoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications
VoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications Veselin Rakocevic School of Engineering and Mathematical Sciences City University, London, UK V.Rakocevic@city.ac.uk
More informationInternet Quality of Service
Internet Quality of Service Weibin Zhao zwb@cs.columbia.edu 1 Outline 1. Background 2. Basic concepts 3. Supporting mechanisms 4. Frameworks 5. Policy & resource management 6. Conclusion 2 Background:
More informationfor guaranteed IP datagram routing
Core stateless distributed admission control at border routers for guaranteed IP datagram routing Takahiro Oishi Masaaki Omotani Kohei Shiomoto NTT Network Service Systems Laboratories, NTT corporation
More informationCS 268: Lecture 13. QoS: DiffServ and IntServ
CS 268: Lecture 13 QoS: DiffServ and IntServ Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720-1776 1
More informationNetworkbased. Quality of Service. Communicate Simply. For IP Video Conferencing
Communicate Simply Networkbased Quality of Service For IP Video Conferencing Timothy M. O Neil Director of Technical Marketing Polycom Video Communications Table of Contents Introduction...1 Information
More informationQoS in VoIP. Rahul Singhai Parijat Garg
QoS in VoIP Rahul Singhai Parijat Garg Outline Introduction The VoIP Setting QoS Issues Service Models Techniques for QoS Voice Quality Monitoring Sample solution from industry Conclusion Introduction
More informationIncremental QoS Deployment based on Network Brokers
Incremental QoS Deployment based on Network Brokers Alfonso Gazo-Cervero, José Luis González-Sánchez Telematics Engineering Section. Computer Science Department. University of Extremadura Escuela Politécnica
More informationQuality of Service Mechanisms and Challenges for IP Networks
Quality of Service Mechanisms and Challenges for IP Networks Prof. Augustine C. Odinma, Ph.D. * and Lawrence Oborkhale, M.Eng. Department of Electrical, Electronic & Computer Engineering, Lagos State University
More informationQuality 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
More informationCS/ECE 438: Communication Networks. Internet QoS. Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE
CS/ECE 438: Communication Networks Internet QoS Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE Introduction The Internet only provides a best effort service
More informationKing Fahd University of Petroleum & Minerals Computer Engineering g Dept
King Fahd University of Petroleum & Minerals Computer Engineering g Dept COE 543 Mobile and Wireless Networks Term 111 Dr. Ashraf S. Hasan Mahmoud Rm 22-148-3 Ext. 1724 Email: ashraf@kfupm.edu.sa 12/24/2011
More informationReal-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
More informationAchieving QoS for TCP traffic in Satellite Networks with Differentiated Services
1 Achieving QoS for TCP traffic in Satellite Networks with Differentiated Services Arjan Durresi 1, Sastri Kota 2, Mukul Goyal 1, Raj Jain 3, Venkata Bharani 1 1 Department of Computer and Information
More informationApplying 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
More informationA New Proposal for Assuring Services in Internet
A New Proposal for Assuring Services in Internet Maria-Dolores Cano, Fernando Cerdan, Joan Garcia-Haro, Josemaria Malgosa-Sanahuja Department of Information echnologies and Communications Polytechnic University
More informationAn Economic Analysis of Multiple Internet QoS Channels
An Economic Analysis of Multiple Internet QoS Channels Dale O. Stahl Department of Economics The University of Texas Austin, TX 78712 Rui Dai Andrew B. Whinston MSIS Department The University of Texas
More informationHow To Provide Quality Of Service In Multiiservice Ip Networks
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 17, August 2004, 261-274 A Novel Approach for Providing Quality of Service in Multiservice IP Networks Mirjana Stojanović and Vladanka Aćimović-Raspopović
More informationConstructing End-to-End Traffic Flows for Managing Differentiated Services Networks
Constructing End-to-End Traffic Flows for Managing Differentiated Services Networks Jae-Young Kim 1, James Won-Ki Hong 1, Sook-Hyun Ryu 1, and Tae-Sang Choi 2 1 Department of Computer Science and Engineering
More informationNetwork management and QoS provisioning - QoS in the Internet
QoS in the Internet Inernet approach is based on datagram service (best effort), so provide QoS was not a purpose for developers. Mainly problems are:. recognizing flows;. manage the issue that packets
More informationSmart Queue Scheduling for QoS Spring 2001 Final Report
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS Smart Queue Scheduling for QoS Spring 2001 Final Report By Haijing Fang(hfanga@sfu.ca) & Liu Tang(llt@sfu.ca)
More informationBest-Effort Low-Delay Service
Best-Effort Low-Delay Jörg Diederich Institute of Operating Systems and Computer Networks Technical University of Braunschweig Germany Email: dieder@ibr.cs.tu-bs.de Mark Doll, Martina Zitterbart Institute
More informationA 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
More informationAdopting SCTP and MPLS-TE Mechanism in VoIP Architecture for Fault Recovery and Resource Allocation
Adopting SCTP and MPLS-TE Mechanism in VoIP Architecture for Fault Recovery and Resource Allocation Fu-Min Chang #1, I-Ping Hsieh 2, Shang-Juh Kao 3 # Department of Finance, Chaoyang University of Technology
More informationPerformance Evaluation of the Impact of QoS Mechanisms in an IPv6 Network for IPv6-Capable Real-Time Applications
Journal of Network and Systems Management, Vol. 12, No. 4, December 2004 ( C 2004) DOI: 10.1007/s10922-004-0672-5 Performance Evaluation of the Impact of QoS Mechanisms in an IPv6 Network for IPv6-Capable
More informationHow To Improve Performance On A Ccdn (Dns)
Enhanced Content Delivery Network to Improve the QoE 1 Sachendra Singh Solanky, 2 Sandra Brigit Johnson, 3 Vakkalagadda Eswar Praphul 1 M.Tech Student SCSE, VIT University Chennai-600048, 2 M.Tech Student
More informationAdaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks
Adaptive Bandwidth Management and QoS Provisioning in Large Scale Ad Hoc Networks Kaixin Xu, Ken Tang, Rajive Bagrodia Scalable Network Technologies, Inc. {xkx, ktang,rlb}@scalable-networks.com Mario Gerla
More informationA Policy Framework for Integrated and Differentiated Services in the Internet
A Policy Framework for Integrated and Differentiated Services in the Internet Raju Rajan Dinesh Verma Sanjay Kamat AT&T Labs IBM T. J. Watson Labs Bell Labs Eyal Felstaine Allot Communications Shai Herzog
More informationQuality of Service for MANETs connected to the Internet
Quality of Service for MANETs connected to the Internet Andreas J. Kassler 1, ChenShanShan 2 1 Karlstad University, Computer Science Department, Universitetgatan 2, 65188 Karlstad, Sweden, kassler@ieee.org
More informationOn the Impacts of Distributed and Dynamic Mobility Management Strategy: A Simulation Study
On the Impacts of Distributed and Dynamic Mobility Management Strategy: A Simulation Study Seil Jeon Instituto de Telecomunicações Campus Universitário de Santiago Aveiro, Portugal seiljeon@av.it.pt Sérgio
More informationMulticast Network Administration Control in Diff Services
MASURMNT-BASD MULTICAST ADMISSION CONTROL IN DIFFSRV NTWORKS Olli Alanen, Mikko Pääkkönen, Timo Hämäläinen, Mikko Ketola and Jyrki Joutsensalo Department of Mathematical Information Technology University
More informationDisjoint Path Algorithm for Load Balancing in MPLS network
International Journal of Innovation and Scientific Research ISSN 2351-8014 Vol. 13 No. 1 Jan. 2015, pp. 193-199 2015 Innovative Space of Scientific Research Journals http://www.ijisr.issr-journals.org/
More informationAn Intelligent Agent Based QoS Provisioning and Network Management System
An Intelligent Agent Based QoS Provisioning and Network Management System ANGELOS MICHALAS 1, MALAMATI LOUTA 2, GEORGE KOUZAS 1 1 School of Electrical and Computer Engineering National Technical University
More informationRBA-RIO Rate Based Adaptive Red With In and Out. Algorithm for DiffServ AF PHB
RBA-RIO Rate Based Adaptive Red With In and Out Algorithm for DiffServ AF PHB Zhang Mgjie Zhu Peidong Su Jshu Lu Xicheng School of Computer, National University of Defense Technology, Changsha 410073,
More informationFuzzy 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
More informationThe 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
More informationOn Providing Survivable QoS Services in the Next Generation Internet
On Providing Survivable QoS Services in the Next Generation Internet Anotai Srikitja and David Tipper Dept. of Information Science and Telecommunications University of Pittsburgh Pittsburgh, PA 1526 USA
More informationMPLS Management using Policies
MPLS Management using Policies M. Brunner, J. Quittek C&C Research Laboratories, NEC Europe Ltd. Adenauerplatz 6, 69115 Heidelberg, Germany [brunner quittek]@ccrle.nec.de Abstract Multi-Protocol Label
More informationUsing Differentiated Services to Support Internet Telephony
Using Differentiated Services to Support Internet Telephony Fugui Wang and Prasant Mohapatra Department of Computer Science and Engineering Michigan State University East Lansing, MI 48824 Email: {wangfugu,
More informationRecovery Modeling in MPLS Networks
Proceedings of the Int. Conf. on Computer and Communication Engineering, ICCCE 06 Vol. I, 9-11 May 2006, Kuala Lumpur, Malaysia Recovery Modeling in MPLS Networks Wajdi Al-Khateeb 1, Sufyan Al-Irhayim
More informationANALYSIS OF LONG DISTANCE 3-WAY CONFERENCE CALLING WITH VOIP
ENSC 427: Communication Networks ANALYSIS OF LONG DISTANCE 3-WAY CONFERENCE CALLING WITH VOIP Spring 2010 Final Project Group #6: Gurpal Singh Sandhu Sasan Naderi Claret Ramos (gss7@sfu.ca) (sna14@sfu.ca)
More informationQuality of Service Support in Mobile ad-hoc IP Networks *
Quality of Service Support in Mobile ad-hoc IP Networks * Derya H. Cansever GTE Laboratories 40 Sylvan Road Waltham, MA 02454 Arnold M. Michelson GTE Government Systems 400 John Quincy Adams Road Taunton,
More informationHow to Design and Test a Packet Drop Management System
A Queue Management System for Differentiated- Services IP Routers Goncalo Quadros, Antonio Alves, Joao Silva, Henrique Matos, Edmundo Monteiro, Fernando Boavida CISUC Center for Informatics and Systems
More informationA Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman
A Preferred Service Architecture for Payload Data Flows Ray Gilstrap, Thom Stone, Ken Freeman NASA Research and Engineering Network NASA Advanced Supercomputing Division NASA Ames Research Center Outline
More informationIP-Telephony Quality of Service (QoS)
IP-Telephony Quality of Service (QoS) Bernard Hammer Siemens AG, Munich Siemens AG 2001 1 Presentation Outline End-to-end OoS of VoIP services Quality of speech codecs Network-QoS IntServ RSVP DiffServ
More informationEQ-BGP: an efficient inter-domain QoS routing protocol
EQ-BGP: an efficient inter-domain QoS routing protocol Andrzej Beben Institute of Telecommunications Warsaw University of Technology Nowowiejska 15/19, 00-665 Warsaw, Poland abeben@tele.pw.edu.pl Abstract
More informationDifferentiated Services
March 19, 1998 Gordon Chaffee Berkeley Multimedia Research Center University of California, Berkeley Email: chaffee@bmrc.berkeley.edu URL: http://bmrc.berkeley.edu/people/chaffee 1 Outline Architecture
More informationQuality 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,
More informationFactors to Consider When Designing a Network
Quality of Service Routing for Supporting Multimedia Applications Zheng Wang and Jon Crowcroft Department of Computer Science, University College London Gower Street, London WC1E 6BT, United Kingdom ABSTRACT
More informationPerformance Analysis of Integrated Service over Differentiated Service for Next Generation Internet
COPYRIGHT 2010 JCIT, ISSN 2078-5828 (PRINT), ISSN 2218-5224 (ONLINE), VOLUME 01, ISSUE 01, MANUSCRIPT CODE: 100717 Performance Analysis of Integrated Service over Differentiated Service for Next Generation
More informationMotivation. QoS Guarantees. Internet service classes. Certain applications require minimum level of network performance:
QoS Guarantees Motivation introduction call admission traffic specification link-level scheduling call setup protocol reading: Tannenbaum, 393-395, 458-471 Ch 6 in Ross/Kurose Certain applications require
More informationA Fast Path Recovery Mechanism for MPLS Networks
A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationA Novel QoS Framework Based on Admission Control and Self-Adaptive Bandwidth Reconfiguration
Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. V (2010), No. 5, pp. 862-870 A Novel QoS Framework Based on Admission Control and Self-Adaptive Bandwidth Reconfiguration
More informationRequirements 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.
More informationChallenges and Approaches in Providing QoS Monitoring
Challenges and Approaches in Providing QoS Monitoring Yuming Jiang, Chen-Khong Tham, Chi-Chung Ko Department of Electrical Engineering National University of Singapore 10 Kent Ridge Crescent, Singapore
More informationLecture 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
More informationProgrammable Network Functionality for Improved QoS of Interactive Video Traffic
rogrammable Network Functionality for Improved QoS of Interactive Video Traffic Brendan McAllister, Alan Marshall and Roger Woods Institute of Electronics, Communications and Information Technology. (ECIT),
More informationA New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks
A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationESTIMATION OF TOKEN BUCKET PARAMETERS FOR VIDEOCONFERENCING SYSTEMS IN CORPORATE NETWORKS
ESTIMATION OF TOEN BUCET PARAMETERS FOR VIDEOCONFERENCING SYSTEMS IN CORPORATE NETWORS J.Glasmann, M. Czermin, A. Riedl Lehrstuhl für ommunikationsnetze, Technische Universität München, Arcisstr. 21, 80333
More informationAn Active Packet can be classified as
Mobile Agents for Active Network Management By Rumeel Kazi and Patricia Morreale Stevens Institute of Technology Contact: rkazi,pat@ati.stevens-tech.edu Abstract-Traditionally, network management systems
More informationAn example of traffic-accomodating application.
An example of traffic-accomodating application. ***, S. Giordano**,.P. Cremonese* *** m.podesta@tlcpi.finsiel.it Finsiel S.p.A via Matteucci 34 Pisa Italy ph +39 050 968526 fax +39 050 968525 ** silvia.giordano@epfl.ch
More informationImproving QOS in IP Networks. Principles for QOS Guarantees. Principles for QOS Guarantees (more) Principles for QOS Guarantees (more)
Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential
More informationA Multilevel Policy-Based Network Management System for Differentiated Services Network
A Multilevel Policy-Based Network Management System for Differentiated Services Network Yu Kang, Song Ouyang Department of Computer Science, Central South University, Changsha, Hunan, P. R. China 410083
More informationThe Evolution of the Generalized Differentiated Services Architecture and the Changing Role of the Internet Engineering Task Force*
The Evolution of the Generalized Differentiated Services Architecture and the Changing Role of the Internet Engineering Task Force* Abstract: by Günter Knieps Discussion Paper Institut für Verkehrswissenschaft
More informationEnd-host 1. Sink CPE DSLAM. End-host 2
Assessment of Voice over IP as a Solution for Voice over ADSL Abhishek Ram, Luiz A. DaSilva and Srinidhi Varadarajan (aram@vt.edu) (ldasilva@vt.edu) (srinidhi@cs.vt.edu) Department of Computer Science
More information