Quality-of-service in packet networks: basic mechanisms and directions

Guérin, Roch; Peris, V.

doi:10.1016/s0169-7552(98)00261-x

Cited by 168 publications

(66 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ideally, this solution should also provide mechanisms for endto-end QoS enforcement, covering network-related QoS guarantees as well. This subject, however, is too broad and a lot of quality research [GP99,CC97] has already been made concerning this topic. We decided, therefore, to focus our work on host-related QoS issues only.…”

Section: Architectural Requirementsmentioning

confidence: 99%

A Mobile Agent Infrastructure for QoS Negotiation of Adaptive Distributed Applications

Cardoso

Kon

2004

On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE

View full text Add to dashboard Cite

Abstract. QoS-aware distributed applications such as certain Multimedia and Ubiquitous Computing applications can benefit greatly from the provision of QoS guarantees from the underlying system and middleware infrastructure. They must avoid execution glitches that affect the user's perception of the application output. Most research in QoS support for distributed systems focuses on three aspects of QoS management: admission control, resource reservation, and scheduling. However, in highly dynamic distributed environments, effective means for QoS negotiation and re-negotiation are also essential. We believe that mobile agents, due to its inherent flexibility and agility, can play an important role in this scenario, specially during the application adaptation process. We designed a mobile-agent-based infrastructure that provides services such as resource monitoring, QoS brokering, and QoS enforcement. Furthermore, our infrastructure offers a powerful mechanism for QoS negotiation. In this paper, we describe the architecture and prototype implementation of this infrastructure. First, we discuss the motivations and related works. We, then, present the architectural design and discuss implementation issues concerning the infrastructure prototype. Finally, we introduce a sample application called ReflectorAglet -a QoS-aware adaptive audio reflector -and present preliminary experimental results. MotivationMultimedia applications (such as video and audio streaming) and Ubiquitous Computing services are examples of distributed applications that have a clear need for quality of service guarantees. The success of this class of applications is tightly related to the user's level of satisfaction. These systems must avoid, at all costs, performance losses that might affect the user's perception of the application output. As a consequence, QoS-related services have become an important part of the infrastructure of distributed systems to enable the development of applications such as the ones described above.

show abstract

Section: Architectural Requirementsmentioning

confidence: 99%

A Mobile Agent Infrastructure for QoS Negotiation of Adaptive Distributed Applications

Cardoso

Kon

2004

On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE

View full text Add to dashboard Cite

show abstract

“…Note that, allocating R equal is a widely used approach [8], [9] to provide end-to-end delay guarantees under the Guaranteed Services framework. Our next theorem states that R equal need not always be the optimal solution and gives an explicit condition for R equal to be or not to be the optimal solution.…”

Section: A the Unbounded Link Capacities Case And Non-optimality Of mentioning

confidence: 99%

“…Now suppose that the optimal rate R equal is not available on some links of the route. In most of the approaches [8], [9], the flow is blocked. But, in fact, the delay bound eqn.…”

Section: A the Unbounded Link Capacities Case And Non-optimality Of mentioning

confidence: 99%

See 1 more Smart Citation

Optimal per-node rate allocation to provide per-flow end-to-end delay guarantees in a network of routers supporting guaranteed service class

Diwan

Kuri²,

Kumar³

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)

View full text Add to dashboard Cite

Abstract-In this paper, we investigate the problem of providing worst-case end-to-end delay guarantee to a token bucket constrained flow traversing a series of N packet schedulers. We consider a network of routers that support the Guaranteed Service class of the IETF Integrated Services (IntServ) Working Group; this service class is proposed to provide Quality of Service (QoS) in the Internet. Under this framework, a worst-case end-to-end delay bound to a flow is provided by allocating a rate at each network element on the path of the flow. We associate a cost with allocating a rate at each link. The cost is assumed to be a convex and non-decreasing function of rate. We investigate the problem of obtaining an optimal rate allocation for a flow that minimizes the total cost subject to the delay requirement and the available link capacity constraints. Allocating an identical rate at each link on the path of a flow is a widely used approach under the Guaranteed Service framework. We investigate the optimality of this approach and show that under certain conditions, it need not be optimal. Moreover, we investigate the optimal solution to the total cost minimization problem and give scenarios in which we can explicitly obtain the optimal solution. Based on these results, we present an algorithm for optimal rate allocation that is based on multiple rates. However, with blocking probability as the performance criterion, we find through simulations, that the optimal rate allocation algorithm is only marginally better for connections with longer path lengths at the expense of those with shorter path lengths. We also observe that the performances of both the algorithms are very close and so, in practice, the simpler identical rate algorithm may be sufficient.

show abstract

“…• Priority Queuing (PQ): In PQ [12], a number of distinct queues is created and a level of priority is assigned to each one. Packets are scheduled from a particular priority queue in First ComeFirst Served order only when all queues of higher priority are empty.…”

Section: A Scheduling Issuesmentioning

confidence: 99%

A study of QoS performance for real time applications over a differentiated services network

Tsolakou

Nikolouzou

Venieris

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications

View full text Add to dashboard Cite

Abstract:The Differentiated Service Architecture (DiffServ) is currently a popular research topic as a lowcost method to provide Quality of Service to the different applications in the Internet. This paper addresses the definition and deployment of specific network services in a DiffServ environment. The proposed network services are described, while our main focus is the real-time delay-sensitive applications such as voice and video.The corresponding services for those applications are further analyzed and simulated. The analysis includes the influence of different algorithms that could implement the corresponding services for voice and video as well as the QoS performance under these algorithms. Sim ulation outcomes prove that the fundamental principles of the network services are fulfilled and provide an evaluation of the proposed algorithms.

show abstract

Quality-of-service in packet networks: basic mechanisms and directions

Cited by 168 publications

References 55 publications

A Mobile Agent Infrastructure for QoS Negotiation of Adaptive Distributed Applications

A Mobile Agent Infrastructure for QoS Negotiation of Adaptive Distributed Applications

Optimal per-node rate allocation to provide per-flow end-to-end delay guarantees in a network of routers supporting guaranteed service class

A study of QoS performance for real time applications over a differentiated services network

Contact Info

Product

Resources

About