190
click to vote
INFOCOM
15 years 8 months ago
1991 IEEE 
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
175
click to vote
SIGCOMM
15 years 8 months ago
1991 ACM
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the o...
151
Voted
SIGCOMM
15 years 8 months ago
1991 ACM 
One of the most compelling long term problems facing the IP and emerging 0S1 Internet is growth, At the same time, policy routing-the ability of a packet source to determine the t...
149
click to vote
SIGCOMM
15 years 8 months ago
1991 ACM
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
142
click to vote
INFOCOM
15 years 8 months ago
1991 IEEE
Although the issues of routing and scheduling in packet radio networks are highly interdependent, few studies have addressed their interactions. In this paper, we address the prob...
|
Communications