|
|
|
Volumn 2, Issue , 1998, Pages 533-539
|
|
Linear complexity algorithms for maximum throughput in radio networks and input queued switches
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
CELLULAR RADIO SYSTEMS;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL COMPLEXITY;
COMPUTER NETWORKS;
ITERATIVE METHODS;
MATHEMATICAL MODELS;
PACKET SWITCHING;
RANDOM PROCESSES;
RESOURCE ALLOCATION;
SCHEDULING;
TELECOMMUNICATION NETWORKS;
MAXIMUM THROUGHPUT SCHEDULING POLICIES;
PACKET TRANSMISSION TIME;
RADIO NETWORKS;
DATA COMMUNICATION SYSTEMS;
|
|
EID: 0031701310
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (284)
|
|
References (7)
|
