Mobile data management has been an active area of research for the past fifteen years. Besides dealing with mobility itself, issues central in data management for mobile computin...
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
Interconnection architectures range from complete networks, that have a diameter of D = 1 but are impractical except when the number n of nodes is small, to low-cost, minimally co...
This paper presents an analytical methodology to obtain steady state throughput of a uniformly and fully loaded regular network. The network operates using deflection routing under...