Sciweavers

24 search results - page 2 / 5
» Lower Bounds for One-to-one Packet Routing on Trees using Ho...
Sort
View
SPAA
1994
ACM
13 years 9 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
INFOCOM
2003
IEEE
13 years 10 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 9 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
ICCCN
2008
IEEE
13 years 11 months ago
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
Navodaya Garepalli, Kartik Gopalan, Ping Yang
NETGAMES
2003
ACM
13 years 10 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...