237 search results - page 6 / 48 » High-performance adaptive routing for networks with arbitrar... |
INFOCOM
2002
IEEE
14 years 14 days ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
PODC
2003
ACM
14 years 24 days ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— It has been a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc n...
22
Voted
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
In order for collective communication routines to achieve high performance on different platforms, they must be able to adapt to the system architecture and use different algori...