Sciweavers

307 search results - page 23 / 62
» Subjective-Cost Policy Routing
Sort
View
CCR
2004
86views more  CCR 2004»
13 years 7 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott
ICPADS
2007
IEEE
14 years 2 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down
PODC
2005
ACM
14 years 1 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
POLICY
2007
Springer
14 years 2 months ago
Call Management Policy Specification for the Asterisk Telephone Private Branch Exchange
A VoIP PBX supports flexible call handling functionality for selective forwarding, cost based outward call routing, recording calls etc. Both users and administrators need a flexi...
George Konstantoulakis, Morris Sloman