Fabio M. Chiussi

Learn More
This paper develops a framework for statistically guaranteeing end-to-end delay bounds to leaky-bucket-constrained flows transporting real-time traffic in a network of switches using Earliest Deadline First (EDF) packet scheduling and per-hop traffic shaping. We first analyze the delay-bound violation probabilities at an isolated EDF scheduler fed by fluid(More)
Generalized Processor Sharing (GPS) has gained much popularity in recent years as a simple and effective scheduling mechanism for the provisioning of Quality of Service (QoS) in emerging high-speed networks. For supporting deterministic end-to-end delay guarantees, GPS is known to be sub-optimal in comparison to the Earliest Deadline First (EDF) scheduling(More)
Current mobile networks provide link-layer mobility as a mobile host changes its point of attachment within the scope of an access node, and provide wide-area mobility through global mobility protocols such as Mobile IP. Recently, several proposals have been made for an intermediate level of mobility support, called micro-mobility which addresses the issues(More)
In this paper, we study shared-memory switches under multicast bursty traffic and characterize the relation between their performance and the multicast distribution that defines the mix of multicast traffic arriving at the switches. We consider two schemes that have been used in practical realizations of these switches to replicate multicast cells: 1)(More)
Inverse Multiplexing for ATM (IMA) has been standardized by the ATM Forum to provide a high-capacity logical link by grouping several lower-capacity physical links. IMA is intrinsically point-to-point, assumes congestion-free links, and only tolerates relatively constant differential delays between the links. In this paper, we generalize the notion of(More)
The continuous growth in the demand for diversified quality-of-service (QoS) guarantees in broad band networks introduces new challenges in the design of packet switches that scale to large switching capacities. Packet scheduling is the most critical function involved in the provision of individual bandwidth and delay guarantees to the switched flows. Most(More)
In this paper, we develop an analytical framework for providing statistical delay guarantees in an Earliest Deadline First (EDF) scheduler which multiplexes traf-c from multiple markovian sources with heterogeneous delay requirements. Our framework permits the computation of steady-state delay bound violation probabilities (i.e., the fraction of traac that(More)
Abstract— The provision of Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, Earliest Deadline First (EDF) scheduling in conjunction with per-hop traffic shaping (jointly(More)