Sciweavers

133 search results - page 8 / 27
» Maximizing throughput in queueing networks with limited flex...
Sort
View
FOCS
1993
IEEE
13 years 11 months ago
Throughput-Competitive On-Line Routing
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
TC
2010
13 years 2 months ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
INFOCOM
2008
IEEE
14 years 2 months ago
iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks
—A major barrier for the adoption of wireless mesh networks is severe limits on throughput. Many in-network packet mixing techniques at the network layer [1], [2], [3] as well as...
Richard Alimi, Erran L. Li, Ramachandran Ramjee, H...
INFOCOM
2003
IEEE
14 years 27 days ago
Pricing strategies under heterogeneous service requirements
— This paper analyzes a communication network with heterogeneous customers. We investigate priority queueing as a way to differentiate between these users. Customers join the net...
Michel Mandjes
INFOCOM
2008
IEEE
14 years 2 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff