|
|
|
Volumn 2, Issue , 1996, Pages 928-936
|
|
Approximating max-min fair rates via distributed local scheduling with partial information
a
a
NONE
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
BANDWIDTH;
COMPUTER SIMULATION;
NETWORK PROTOCOLS;
OPTIMIZATION;
PACKET NETWORKS;
PACKET SWITCHING;
SCHEDULING;
TELECOMMUNICATION TRAFFIC;
TOPOLOGY;
ACCESS DELAY;
BUS NETWORKS;
CONCURRENT ACCESS;
DISTRIBUTED LOCAL SCHEDULING;
MAX MIN FAIRNESS;
RING NETWORKS;
SPATIAL BANDWIDTH REUSE;
TRANSMISSION DELAY;
LOCAL AREA NETWORKS;
|
|
EID: 0029754879
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (26)
|
|
References (13)
|
