Sciweavers

3288 search results - page 162 / 658
» Feed-links for network extensions
Sort
View
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
16 years 19 days ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
KIVS
2005
Springer
16 years 11 hour ago
Epidemic Dissemination of Presence Information in Mobile Instant Messaging Systems
This paper presents an approach for exchanging presence information between users of an instant messaging system in a mobile ad hoc network. As major feature, presence information ...
Christoph Lindemann, Oliver P. Waldhorst
ANTSW
2006
Springer
15 years 10 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
USITS
2001
15 years 7 months ago
End-to-End WAN Service Availability
Abstract--This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for...
Bharat Chandra, Michael Dahlin, Lei Gao, Amol Naya...
COMCOM
2007
99views more  COMCOM 2007»
15 years 6 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley