Sciweavers

1017 search results - page 116 / 204
» Throughput-centric routing algorithm design
Sort
View
IPTPS
2003
Springer
14 years 3 months ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes
SIGCOMM
2010
ACM
13 years 10 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
DAC
2008
ACM
14 years 11 months ago
Enhancing timing-driven FPGA placement for pipelined netlists
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...
Kenneth Eguro, Scott Hauck
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 1 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ICC
2009
IEEE
127views Communications» more  ICC 2009»
13 years 7 months ago
Starburst SSD: An Efficient Protocol for Selective Dissemination
Abstract--We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hie...
Tahir Azim, Qasim Mansoor, Philip Levis