Sciweavers

831 search results - page 43 / 167
» Adapting to a reliable network path
Sort
View
ICDS
2008
IEEE
15 years 6 months ago
A New Server Selection Strategy for Reliable Server Pooling in Widely Distributed Environments
In order to provide a generic, applicationindependent and resource-efficient framework for server redundancy and session failover, the IETF RSerPool WG is currently standardizing ...
Xing Zhou, Thomas Dreibholz, Erwin P. Rathgeb
HPDC
2007
IEEE
15 years 6 months ago
Ridge: combining reliability and performance in open grid platforms
Large-scale donation-based distributed infrastructures need to cope with the inherent unreliability of participant nodes. A widely-used work scheduling technique in such environme...
Krishnaveni Budati, Jason D. Sonnek, Abhishek Chan...
TAMC
2009
Springer
15 years 6 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
CLADE
2004
IEEE
15 years 3 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
LCN
2008
IEEE
15 years 6 months ago
Spatially Disjoint Multipath Routing protocol without location information
—Multipath routing permits the discovery and use of multiple paths between a source and a destination. We develop a distributed on-demand multipath routing protocol for MANETs ca...
Juan Jose Galvez, Pedro M. Ruiz, Antonio F. G&oacu...