674 search results - page 39 / 135 » Scalable simulation of complex network routing policies |
148
click to vote
DEBS
2008
ACM
15 years 7 months ago
2008
ACM
In this effort we tackle the important issue of providing Quality of Service (QoS) guarantees to subscribers, when routing event notifications in a publish-subscribe domain. In ...
161
click to vote
INFOCOM
2009
IEEE
16 years 23 days ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
164
click to vote
ICNP
2006
IEEE
16 years 4 days 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 ...
144
click to vote
ESM
2000
15 years 7 months ago
2000
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...
155
click to vote
GLOBECOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...