Sciweavers

133 search results - page 9 / 27
» Maximizing throughput in queueing networks with limited flex...
Sort
View
85
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
Chee-Wei Tan, Daniel Pérez Palomar, Mung Ch...
91
Voted
ISCAPDCS
2003
14 years 11 months ago
Efficient Data Allocation for a Cluster of Workstations
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
14 years 11 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
CONEXT
2008
ACM
14 years 11 months ago
Exploiting multi-flow diversity for mitigating intra-flow interference in wireless mesh networks
We consider the problem of improving network capacity in wireless mesh networks from the angle of multi-flow diversity. As consecutive packets on a multihop path can interfere wit...
Taewoon Kim, Hyuk Lim, Chaegwon Lim
89
Voted
INFOCOM
1997
IEEE
15 years 1 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