Sciweavers

37 search results - page 6 / 8
» Orthogonal Connector Routing
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
TWC
2010
13 years 2 months ago
Fairness-aware radio resource management in downlink OFDMA cellular relay networks
Abstract-- Relaying and orthogonal frequency division multiple access (OFDMA) are the accepted technologies for emerging wireless communications standards. The activities in many w...
Mohamed Salem, Abdulkareem Adinoyi, Mahmudur Rahma...
ICDCN
2010
Springer
14 years 2 months ago
Channel Assignment in Virtual Cut-through Switching Based Wireless Mesh Networks
Conventional wireless networks employ a contention based channel access mechanism, which not only imposes high latency but also reduces goodput of the network. Lack of interference...
Dola Saha, Aveek Dutta, Dirk Grunwald, Douglas C. ...
INFOCOM
2003
IEEE
14 years 20 days ago
A Distributed and Adaptive Signal Processing Approach to Reducing Energy Consumption in Sensor Networks
— We propose a novel approach to reducing energy consumption in sensor networks using a distributed adaptive signal processing framework and efficient algorithm 1 . While the to...
Jim Chou, Dragan Petrovic, Kannan Ramchandran
CORR
2010
Springer
78views Education» more  CORR 2010»
13 years 7 months ago
Flow-Cut Gaps for Integer and Fractional Multiflows
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
Chandra Chekuri, F. Bruce Shepherd, Christophe Wei...