114 search results - page 7 / 23 » Optimal Routing in Binomial Graph Networks |
106
Voted
ALGOSENSORS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
100
click to vote
PDCAT
2005
Springer
15 years 5 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...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
115
click to vote
ENTCS
2007
14 years 11 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
104
click to vote
SPAA
2006
ACM
15 years 5 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...