Sciweavers

454 search results - page 2 / 91
» The Capacity Allocation Paradox
Sort
View
JACM
2002
107views more  JACM 2002»
13 years 5 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
AAAI
2000
13 years 6 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
JSAC
2006
107views more  JSAC 2006»
13 years 5 months ago
Efficiency and Braess' Paradox under pricing in general networks
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
Xin Huang, Asuman E. Ozdaglar, Daron Acemoglu
ACMICEC
2006
ACM
152views ECommerce» more  ACMICEC 2006»
13 years 11 months ago
Capacity allocation with competitive retailers
This paper addresses a problem in supply chain management that how scarce resources can be efficiently allocated among competing interests. We present a formal model of allocation...
Masabumi Furuhata, Dongmo Zhang
ISCC
2006
IEEE
109views Communications» more  ISCC 2006»
13 years 11 months ago
A Call Level Adaptive Bandwidth Allocation Scheme Based on Lyapunov Control Theory
— In this paper, we propose an adaptive capacity allocation scheme at the call level for a blocked call cleared loss system. The scheme aims to maintain the connection blocking p...
Hesham Bin-Abbas, David Tipper