Sciweavers

727 search results - page 73 / 146
» A Calculus of Bounded Capacities
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
INFOCOM
1997
IEEE
13 years 12 months ago
Integrated Rate and Credit Feedback Control for ABR Service in ATM Networks
We propose a ow-control scheme that combines the merits of credit- and rate-based ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal...
Xi Zhang, Kang G. Shin, Qin Zheng
SIGCOMM
1996
ACM
13 years 12 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multiantenna broadcast channel, simultaneous transmission to multiple users by joint beamforming and scheduling is capable of achieving high throughput, which grows double log...
Kaibin Huang, Robert W. Heath Jr., Jeffrey G. Andr...
FSTTCS
2010
Springer
13 years 5 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...