Sciweavers

6110 search results - page 896 / 1222
» Graceful Network Operations
Sort
View
MONET
2002
162views more  MONET 2002»
15 years 6 months ago
AMRoute: Ad Hoc Multicast Routing Protocol
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical c...
Jason Xie, Rajesh R. Talpade, Anthony McAuley, Min...
TON
2002
99views more  TON 2002»
15 years 6 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
NETWORK
2007
93views more  NETWORK 2007»
15 years 6 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin
CIKM
2010
Springer
15 years 5 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...