1204 search results - page 60 / 241 » Optimal Routing in a Small-World Network |
149
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
137
click to vote
INFOCOM
2006
IEEE
15 years 11 months 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...
171
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
178
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
183
click to vote
NETWORKS
2007
15 years 5 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...