266 search results - page 20 / 54 » Distributed Routing in Tree Networks with Few Landmarks |
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
SPAA
1999
ACM
13 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
EUROMICRO
2007
IEEE
14 years 1 months ago
2007
IEEE
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
WINET
2010
13 years 5 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
ICPP
1994
IEEE
13 years 11 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...