Sciweavers

914 search results - page 147 / 183
» Branch and Bound on the Network Model
Sort
View
INFOCOM
2008
IEEE
16 years 21 days ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SPAA
2004
ACM
15 years 11 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
ICNP
2002
IEEE
15 years 11 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 10 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
TMC
2008
138views more  TMC 2008»
15 years 6 months ago
Airtime Fairness for IEEE 802.11 Multirate Networks
Under a multirate network scenario, the IEEE 802.11 DCF MAC fails to provide airtime fairness for all competing stations since the protocol is designed for ensuring max-min through...
Tarun Joshi, Anindo Mukherjee, Younghwan Yoo, Dhar...