This paper considers networks where user traffic is regulated through deterministic traffic
profiles, eg token buckets, and requirescleanguaranteed hard delay bounds. The network's …

The need to guarantee hard delay bounds to traffic flows with deterministic traffic profiles, eg
token buckets, arises in several network settings. It is of interest to offer such guarantees …

In this paper, we define a class of generalized guaranteed rate (GR) scheduling algorithms
that includes algorithms which allocate a variable rate to the packets of a flow. We define …

This paper addresses the problem of providing per-connection end-to-end delay guarantees
in a high-speed network. We consider a network comprised of store-and-forward packet …

ISPs routinely rate-limit user traffic. In addition to correctly enforcing the desired rates, rate-
limiting mechanisms must be able to support rich rate-sharing policies within each traffic …

By extending the system theory under the (min,+) algebra to the time-varying setting, we
solve the problem of constrained traffic regulation and develop a calculus for dynamic …

In this paper we consider upper and lower constraining users' service rates in a slotted,
cross-layer scheduler context. Such schedulers often cannot guarantee these bounds …

A virtual circuit network with arbitrary topology is considered. The traffic streams follow
prespecified routes, different in general for each stream, to reach their destination. A fluid …

In this paper, we investigate the benefits that accrue from the use of multiple paths by a
session coupled with rate control over those paths. In particular, we study data transfers …

This paper develops a framework of traffic shaping which has the goal of increasing the
nodal connection-carrying capacity. The shaping filters are designed to interwork with …