1523 search results - page 20 / 305 » Projective Torus Networks |
128
Voted
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
132
Voted
INFOCOM
1995
IEEE
15 years 6 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
120
Voted
ICNP
2006
IEEE
15 years 8 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
141
Voted
INFOCOM
2010
IEEE
15 years 15 days ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
141
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...