2497 search results - page 270 / 500 » Requirements for models of achievable routing |
178
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
194
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the...
170
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
— A significant amount of research effort is being carried out by the research community to increase the scope and usefulness of wireless sensor networks; to optimise life time ...
172
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
205
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
Three-dimensional Network-on-Chip (3-D NoC) is an emerging research topic exploring the network architecture of 3-D ICs that stack several smaller wafers for reducing wire length ...