In this chapter we introduce the basic network calculus concepts of arrival, service curves
and shapers. The application given in this chapter concerns primarily networks with …

The generalized processor sharing (GPS) discipline is proven to have two desirable
properties:(a) it can provide an end-to-end bounded-delay service to a session whose traffic …

Network calculus is a theory dealing with queuing systems found in computer networks. Its
focus is on performance guarantees. Central to the theory is the use of alternate algebras …

3. The Internet: Concepts, History, and Challenges. Concepts. Basic Internet Technology.
Addressing. Routing. Endpoint Control. History. Challenges. Summary. 4. Atm Networks …

We develop a general model, called latency-rate servers (/spl Lscr//spl Rscr/servers), for the
analysis of traffic scheduling algorithms in broadband packet networks. The behavior of …

While today's computer networks support only best-effort service, future packet-switching
integrated-services networks will have to support real-time communication services that …

We use previous network calculus results to study some properties of lossless multiplexing
as it may be used in guaranteed service networks. We call network calculus a set of results …

Existing approaches for providing guaranteed services require routers to manage per flow
states and perform per flow operations [9, 21]. Such a stateful network architecture is less …

Hierarchical Packet Fair Queueing (H-PFQ) algorithms have the potential to simultaneously
support guaranteed real-time service, rate-adaptive best-effort, and controlled link-sharing …

To our knowledge, at the time of writing no methodology exists to dimension a sensor
network so that a worst case traffic scenario can be definitely supported. In this paper, the …