Sciweavers

995 search results - page 31 / 199
» Minimizing Congestion in General Networks
Sort
View
INFOCOM
1991
IEEE
13 years 11 months ago
A Neural Network Approach to Routing in Multihop Radio Networks
Although the issues of routing and scheduling in packet radio networks are highly interdependent, few studies have addressed their interactions. In this paper, we address the prob...
Jeffrey E. Wieselthier, Craig M. Barnhart, Anthony...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 8 months ago
Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks
In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that ...
Moufida Maimour
INFOCOM
1996
IEEE
14 years 9 days ago
Time Scale Analysis of Explicit Rate Allocation in ATM Networks
Rate based congestion management for computer communication networks has been the focus of considerable research recently. Dierent variants to the end-to-end rate based algorithm ...
Anna Charny, K. K. Ramakrishnan
WOWMOM
2005
ACM
130views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
PARMA: A PHY/MAC Aware Routing Metric for Ad-Hoc Wireless Networks with Multi-Rate Radios
Ad-hoc wireless networks with multi-rate radios (such as 802.11a, b, g) require a new class of MAC/PHY aware metrics that take into account factors such as physical-layer link spe...
Suli Zhao, Zhibin Wu, Arup Acharya, Dipankar Raych...
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 8 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...