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)
— 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(More)
—In small cell-based Internet protocol routers, multi-cast traffic is generally handled by appending to each cell a local multicast label (LML) containing a bitmap with as many bits as switch ports, so as to identify the ports to which a copy of the cell has to be transferred. This approach is not feasible for switches having 128 ports or more, because the(More)
With the explosive growth in the demand for cloud services, the Data Center and Data Center Interconnect have to achieve hyper-scale and provide unprecedented elasticity and resource availability. The underlay network infrastructure has to scale to support tens of millions of physical endpoints at low cost; the virtualized overlay layer has to scale to(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)
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)
— 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)