Sciweavers

1414 search results - page 275 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
ICPPW
2002
IEEE
14 years 14 days ago
A Fast Handoff Scheme For IP over Bluetooth
Recently, the low price and the small size of the mobile device makes a great success in personal mobile communication. A lot of people use a cell phone, PDA, and laptop computer ...
Sang-Hun Chung, Hyunsoo Yoon, Jung Wan Cho
INFOCOM
2010
IEEE
13 years 6 months ago
Coupled 802.11 Flows in Urban Channels: Model and Experimental Evaluation
Abstract—Contending flows in multi-hop 802.11 wireless networks compete with two fundamental asymmetries: (i) channel asymmetry, in which one flow has a stronger signal, potent...
Joseph Camp, Ehsan Aryafar, Edward W. Knightly
IPPS
2008
IEEE
14 years 1 months ago
LiteLoad: Content unaware routing for localizing P2P protocols
In today’s extensive worldwide Internet traffic, some 60% of network congestion is caused by Peer to Peer sessions. Consequently ISPs are facing many challenges like: paying fo...
Shay Horovitz, Danny Dolev
ICDCS
1999
IEEE
13 years 12 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta