285 search results - page 19 / 57 » Relating two formal models of path-vector routing |
PODC
2005
ACM
15 years 3 months ago
2005
ACM
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
85
Voted
ICCSA
2007
Springer
15 years 3 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
92
Voted
ALGOSENSORS
2009
Springer
15 years 24 days 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...
SYNASC
2008
IEEE
15 years 3 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...