An analytical approach for the modeling of real-time services over IP network (original) (raw)
Related papers
Calculating End-to-End Queuing Delay for Real-Time Services on an IP Network
Lecture Notes in Computer Science, 2003
A crucial factor for real-time (interactive) services is the end-to-end delay experienced by the application. The contribution resulting from the queuing delay induced by the network nodes is the most difficult to assess. First, it is a stochastic quantity which should be aggregated over many (possibly different) network nodes. Secondly, the queuing delay in a single node stems from two different mechanisms: one related to interference with other interactive flows and one related to interference with the ubiquitous best-effort data flows. Earlier work assessed these two components separately, leading to a 'worst case' result. This paper models both components and develops formulas to calculate exact results for the end-to-end queuing delay. Results are shown indicating an improvement up to 45% over the worst-case method. The formulae developed in this paper are expected to be useful in network dimensioning, in setting network performance requirements and in admission control mechanisms.
2007
Converged network seamlessly integrates different communications media such as data, voice and multimedia on a single platform. It refers to convergence both types of network and technologies as well as convergence between the different layers of network architecture. In this paper, we examine a priority-based queuing model and perform the mathematical analysis of different media calls processing in converged network environment. We use for this purpose a queuing system model M3/G3/1/NPRP in order to process effectively input jobs/requests (or packets). Tasks within this queuing system get a higher priority if they are handling a real-time event. We present in our paper mathematical results of the expected response and waiting time, and build hypothetical diagrams for the further practical usage in real-time system. A modeling method developed in this paper will be used for the fast configuration and testing of new converged network applications and services.
Effects of Various Queuing Algorithms for Network Services
INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH (IJEDR) (ISSN:2321-9939), 2014
with recent development and research, various network services like FTP (file transfer), VoIP, videoconferencing (streaming), E-mail are going to more useful in current generation. In such services some of services like email, web browsing (HTTP), FTP (file transfer) are not much sensitive to delay of transmitted data. Services like VoIP (voice), video conferencing are very sensitive to delay, jitter (delay variation), and packet losses of transmitted data. Therefore they require various traffic management systems for efficient data transmission. Queuing disciplines is such a traffic management system in various network services for efficient data transmission. Queuing algorithms FIFO(first in first out), PQ(priority queue), WFQ(weight fair queue) are implemented in OPNET and some of the parameter including end to end delay, and packet received are studied and effect of various queuing algorithms on this parameters is analysed.
1994
A crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an important QOS measure of interest. In this paper we study (through simulation) the end-to-end delay distribution seen by individual sessions under simple rst-come rst-served (FCFS) multiplexing in a network model with two signicant features: (1) all tra c is connection-oriented, (2) cross tra c along routes is representative of that seen by calls in a moderately sized wide area network (i.e., less than 100 switches). We compare these delay distributions with the worst case analytic delay bounds predicted by three di erent techniques for providing such bounds (two of which require a more sophisticated link-level scheduling policy). We also consider the per-hop delay distributions seen as a session progresses \deeper" into the network and determine the sensitivity of these delay distributions to the manner in which the interfering tra c is modeled. Finally, we use our delay distribution results to examine the tradeo between the QOS requested by a call, the manner in which the QOS guarantee is provided, and the number of calls that are admitted at the requested QOS.
Queuing Systems for the Internet
IEICE Transactions on Communications
This article proposes a versatile model of a multiservice queueing system with elastic traffic. The model can provide a basis for an analysis of telecommunications and computer network systems, internet network systems in particular. The advantage of the proposed approach is a possibility of a determination of delays in network nodes for a number of selected classes of calls offered in modern telecommunications networks.
ACM Conference on Communications Architectures, Protocols and Applications, 1993
A crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an important QOS measure of interest. In this paper we study (through simulation) the end-to-end delay distribution seen by individual sessions under simple rstcome rst-served (FCFS) multiplexing in a network model with two signi cant features: (1) all tra c is connectionoriented, (2) cross tra c along routes is representative of that seen by calls in a moderately sized wide area network (i.e., less than 100 switches). We compare these delay distributions with the worst case point-valued analytic delay bounds predicted by three di erent techniques for providing such bounds (two of which require a more sophisticated linklevel scheduling policy). We also consider the per-hop delay distributions seen as a session progresses \deeper" into the network and determine the sensitivity of these delay distributions to the manner in which the interfering tra c is modeled. Finally, we use our delay distribution results to examine the tradeo between the QOS requested by a call, the manner in which the QOS guarantee is provided, and the number of calls that are admitted at the requested QOS.
1992
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We rst review the characteristics of real-time applications. We observe that, contrary to the popular view that real-time applications necessarily require a xed delay bound, some realtime applications are more exible and can adapt to current network conditions. We then propose an ISPN architecture that supports two distinct kinds of real-time service: guaranteed service, which is the traditional form of realtime service discussed in most of the literature and involves pre-computed worst-case delay bounds, and predicted service which uses the measured performance of the network in computing delay bounds. We then propose a packet scheduling mechanism that can support both of these real-time services as well as accommodate datagram trac. We also discuss two other aspects of an overall ISPN architecture: the service interface and the admission control criteria.
2014
— This paper presents performance analysis of different queuing scheduling disciplines for Internet applications and services using Optimized Network Engineering Tool (OPNET). Mainly, we focus on various queuing scheduling disciplines including Modified Weighted Round Robin (MWRR), First in-First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). This modeling and simulation are based on the effects of these queuing scheduling disciplines on packet delivery for three next generation Internet streaming applications: File Transfer
Controlling queuing delays for real-time communication
ACM SIGCOMM Computer Communication Review, 2018
Real-time media communication requires not only congestion control, but also minimization of queuing delays to provide interactivity. In this work we consider the case of real-time communication between web browsers (WebRTC) and we focus on the interplay of an end-to-end delay-based congestion control algorithm, i.e. the Google congestion control (GCC), with two delay-based AQM algorithms, namely CoDel and PIE, and two flow queuing schedulers, i.e. SFQ and Fq_Codel. Experimental investigations show that, when only GCC flows are considered, the end-to-end algorithm is able to contain queuing delays without AQMs. Moreover the interplay of GCC flows with PIE or CoDel leads to higher packet losses with respect to the case of a DropTail queue. In the presence of concurrent TCP traffic, PIE and CoDel reduce the queuing delays with respect to DropTail at the cost of increased packet losses. In this scenario flow queuing schedulers offer a better solution.
Real-time queueing theory: A tutorial presentation with an admission control application
Queueing systems, 2000
Real-time scheduling, or scheduling with respect to a deadline, is critical in many application areas such as telecommunications, control systems, and manufacturing. This paper presents a novel approach to real-time scheduling based on a queueing theory model. Using real-time queueing theory (RTQT), one can analytically determine the distribution of the lead-time profile (ie, the time until the deadline is reached) of customers waiting for service. Emphasis is placed on the development of the equations used to ...