Sciweavers

429 search results - page 22 / 86
» Group Routing without Group Routing Tables
Sort
View
FPGA
2006
ACM
125views FPGA» more  FPGA 2006»
13 years 11 months ago
Armada: timing-driven pipeline-aware routing for FPGAs
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...
Kenneth Eguro, Scott Hauck
IWSOS
2009
Springer
14 years 1 months ago
Self-organization of Internet Paths
The Internet consists of a constantly evolving complex hierarchical architecture where routers are grouped into autonomous systems (ASes) that interconnect to provide global connec...
Tom Kleiberg, Piet Van Mieghem
WOWMOM
2006
ACM
118views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Evaluating Different One to Many Packet Delivery Schemes for UMTS
It is known that multicasting is an efficient method of supporting group communication as it allows the transmission of packets to multiple destinations using fewer network resour...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
ICN
2005
Springer
14 years 26 days ago
Optimizing Inter-domain Multicast Through DINloop with GMPLS
This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalized multiprotocol label switching) to overcome the scalability problems existing in current i...
Huaqun Guo, Lek Heng Ngoh, Wai-Choong Wong
NSDI
2004
13 years 8 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues