Sciweavers

206 search results - page 18 / 42
» Design and Implement of SD-Anycast Routing Protocol
Sort
View
ICDCS
2003
IEEE
15 years 3 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
FCCM
2009
IEEE
123views VLSI» more  FCCM 2009»
15 years 1 months ago
Scalable High Throughput and Power Efficient IP-Lookup on FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
Hoang Le, Viktor K. Prasanna
FPL
2008
Springer
107views Hardware» more  FPL 2008»
14 years 11 months ago
Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
Hoang Le, Weirong Jiang, Viktor K. Prasanna
CDC
2008
IEEE
187views Control Systems» more  CDC 2008»
15 years 4 months ago
Controlled random access MAC for network utility maximization in wireless networks
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
Robert J. McCabe, Nikolaos M. Freris, P. R. Kumar
ICWN
2004
14 years 11 months ago
Demand-Driven Clustering in MANETs
Abstract-- Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far [1], all these protocols are proactive...
Curt Cramer, Oliver Stanze, Kilian Weniger, Martin...