Jorge Arturo Cobb

Learn More
— We present a scheduling protocol, called Time-Shift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predetermined packet rate and an upper bound on packet delay. The protocol is an improvement over existing protocols because it satisfies the properties of rate-proportional delay,(More)
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at most one channel from u to v. However, it is often desirable to have multiple channels between nodes. That is, for every pair of network nodes u and v, there may be multiple(More)
The stable-paths problem is an abstraction of the basic func-tionality of the Internet's BGP routing protocol. This abstraction has received considerable attention, due to the instabilities observed in BGP. In this abstraction, each process informs its neighboring processes of its current path to the destination. From the paths received from its neighbors ,(More)
Deoxygenation-dependent association of hemoglobin tetramers appears to be widespread among amphibians, reptiles, and possibly all or most birds. The evidence for this conclusion depends largely on oxygen equilibria of whole blood which have Hill coefficients that reach values as high as 5-7 at 80-90% oxygenation. Computer simulation of the sedimentation(More)
Consider a network of computers interconnected by point-to-point communication channels. Before generating network packets, each source in the network reserves a fraction of the packet rate of each output channel in the path to its destination. We define a family of scheduling protocols, called Universal Timestamp-Scheduling, to forward packets in this(More)
Let a flow be a sequence of packets sent from a source computer to a destination computer. Routers at the core of the Internet do not maintain any information about the flows that traverse them. This has allowed for great speeds at the routers, at the expense of providing only best-effort service. In this paper, we consider the problem of fairly allocating(More)