258 search results - page 1 / 52 » Non-cooperative routing in loss networks |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
ICDCS
2005
IEEE
13 years 10 months ago
2005
IEEE
Large-scale competitive P2P networks are threatened by the noncooperation problem,1 where peers do not forward queries to potential competitors. Non-cooperation will be a growing ...
NETCOOP
2007
Springer
13 years 11 months ago
2007
Springer
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
SIGMETRICS
2011
ACM
12 years 7 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
PE
2002
Springer
13 years 4 months ago
2002
Springer
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...