2497 search results - page 4 / 500 » Requirements for models of achievable routing |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
WSC
2007
13 years 9 months ago
2007
Lean principles require the identification of an ideal system state along with an associated policy to achieve that state. This paper discusses the use of multi-criteria models in...
JUCS
2002
13 years 7 months ago
2002
: ATM virtual path (VP) contains bundles of virtual channels (VCs). A VP layer network can be used as a server layer network of VC layer networks and each VC layer network can be a...
SENSYS
2003
ACM
14 years 21 days ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
CCCG
2008
13 years 9 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...