429 search results - page 6 / 86 » Group Routing without Group Routing Tables |
NGC
2000
Springer
13 years 10 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
Predictable routing is the concept of using prespeci ed patterns to route a net. By doing this, we allow an more accurate prediction mechanism for metrics such as congestion and w...
CCR
2008
13 years 6 months ago
2008
This paper focuses on BGP communities, a particular BGP attribute that has not yet been extensively studied by the research community. It allows an operator to group destinations ...
INFOCOM
2006
IEEE
14 years 22 days ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
CN
2007
13 years 6 months ago
2007
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...