This paper presents an admission control framework for Expedited Forwarding (EF) traf®c in a Differentiated Service Network. The aim is to overcome the limitations, in terms of achievable ef®ciency, which are proper of a deterministic ªworst-caseº approach based on the zero-loss assumption. An admission control procedure is de®ned which provides quanti®able end-to-end QoS guarantees in terms of...

In this paper, we address the problem of guaranteeing end-to-end (ETE) delay of packets in a distributed system where the technique of time division multiplex access (TDMA) is adopted, and the application at the destination node requires to process the packets at a regular rate. We present a time slot allocation algorithm to satisb the transmission rate requirement, and to minimize the scheduli...

Today’s middleware applications tend to be complicated, and consist of tiers that form a nested chain of objects or processes. For a real-time nested application, predictability is crucial, even when faults and restarts occur. Nested applications make it challenging to predict the processing time when faults occurs. The fault-detection and recovery times are influenced by the number of tiers, t...

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the the fraction of traffic that exceeds an end–to–end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection–carrying capacity....

The access model of exporting NFS volumes to clients suffers from two problems. First, the server depends on the client to specify the user credentials to use and has no flexible mechanism to map or restrict the credentials given by the client. Second, when the server exports a volume, there is no mechanism to ensure that users accessing the server are only able to access their own files. We ad...

Quality of service (QoS) mechanisms are needed in integrated networks so that the performance requirements of heterogeneous applications are met. In this paper, we outline a framework for predicting end-to-end QoS at the application layer based on mapping of QoS guarantees across layers in the protocol stack and concatenation of guarantees across multiple dissimilar sub-networks. Mapping is nee...

To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First...

Packaging constraints motivate a two-level interconnection network for a multiprocessor. A single node in the global network contains multiple processors connected by a local network. An important issue in two-level networks is how alternative numbers of processors per node changes the per link traac in the global network. In the case of a hypercube global network we consider three communicatio...