Filters








1,493 Hits in 6.5 sec

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games [chapter]

Yonatan Aumann, Yair Dombb
2010 Lecture Notes in Computer Science  
We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games.  ...  The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks  ...  In this work, we study the Pareto efficiency, or inefficiency, of two well known games: routing games and load balancing games (also known as job scheduling games).  ... 
doi:10.1007/978-3-642-16170-4_7 fatcat:jr5v6lnerbetvbmijpv3er4k3e

PEMP: Peering Equilibrium MultiPath Routing

Stefano Secci, Jean-Louis Rougier, Achille Pattavina, Fioravante Patrone, Guido Maier
2009 GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference  
Our scheme relies on a game theoretic modelling, with a non-cooperative potential game considering both routing and congestions costs.  ...  We are interested in identifying possible "light" coordination strategies, that would allow carriers to better control their peering links, while preserving their independence and respective interests.  ...  E.g, in the bottom of Fig. 3 AS I may balance the load on l 2 and l 3 , being aware that AS II may balance its load on l 1 and l 2 .  ... 
doi:10.1109/glocom.2009.5425330 dblp:conf/globecom/SecciRPPM09 fatcat:j5fkq6u7dncirnz7rd3ogznyei

Peering Equilibrium Multipath Routing: A Game Theory Framework for Internet Peering Settlements

Stefano Secci, Jean-Louis Rougier, Achille Pattavina, Fioravante Patrone, Guido Maier
2011 IEEE/ACM Transactions on Networking  
Our scheme relies on a game theory modeling, with a non-cooperative potential game considering both routing and congestions costs.  ...  We are interested in identifying possible "light" coordination strategies that would allow carriers to better control their peering links while preserving their independence and respective interests.  ...  For example, in Fig. 4 , AS I may balance the load on and , being aware that AS II may balance its load on and . B.  ... 
doi:10.1109/tnet.2010.2062535 fatcat:mra2sj2kprhfplxrx4vydrctda

Multi-exit discriminator game for BGP routing coordination

Stefano Secci, Jean-Louis Rougier, Achille Pattavina, Fioravante Patrone, Guido Maier
2010 Telecommunications Systems  
We define the routing policy that shall be implemented upon Nash equilibria and Pareto-efficient profiles.  ...  Internet carriers may coordinate to efficiently balance the load, but the current practice is often based on an uncoordinated selfish routing.  ...  In the bottom of Fig. 8 , e.g., AS I may balance the load on l 2 and l 3 , being aware that AS II may or may not balance its load on l 1 and l 2 .  ... 
doi:10.1007/s11235-010-9335-x fatcat:fybudud5ofgzbbusvbbwr76w3q

Resilient Traffic Engineering in a Transit-Edge Separated Internet Routing

Stefano Secci, Kunpeng Liu, Guruprasad K. Rao, Bijan Jabbari
2011 2011 IEEE International Conference on Communications (ICC)  
We model using game theory the interaction between distant independent edge networks exchanging large traffic volumes, with the goal of seeking efficient edge-to-edge load-balanced routing solutions.  ...  The proposed traffic engineering framework relies on a noncooperative potential game, built upon locator and path ranking costs, that indicates efficient equilibrium solution for the edge-toedge load-balancing  ...  LOAD-BALANCING EQUILIBRIUM SOLUTION In this section we concentrate on the game equilibrium properties and on our proposition to compute a multipath routing solution for edge-to-edge load-balancing.  ... 
doi:10.1109/icc.2011.5963439 dblp:conf/icc/SecciLRJ11 fatcat:er5cyaksszhwtacixpkjjiwrpa

Efficient inter-domain traffic engineering with transit-edge hierarchical routing

Stefano Secci, Kunpen Liu, Bijan Jabbari
2013 Computer Networks  
We model the interaction between distant independent edge networks exchanging large traffic volumes using game theory, with the goal of seeking efficient edge-to-edge load-balancing solutions.  ...  The proposed traffic engineering framework relies on a non-cooperative potential game, built upon locator and path ranking costs, that indicates efficient equilibrium solution for the edge-to-edge loadbalancing  ...  In Section 4 we define how efficient edge-to-edge load-balancing routing solutions can be built upon the routing equilibria.  ... 
doi:10.1016/j.comnet.2012.11.012 fatcat:daqzvzvt6jfcnjm7ozppho4wny

The effect of local scheduling in load balancing designs

Ho-Lin Chen, Jason R. Marden, Adam Wierman
2008 Performance Evaluation Review  
Efficiency of selfish routing Now that we have characterized the global optimum and load balancing arrival rates, we can begin to understand the inefficiency in load balancing designs.  ...  In particular, we can view the stationary behavior of the load balancing system as the equilibrium point of a non-atomic routing game. This is often termed a "selfish routing game" [8] .  ... 
doi:10.1145/1453175.1453200 fatcat:7rdroumbo5he3mafvpksbblpja

On the Impact of Heterogeneity and Back-End Scheduling in Load Balancing Designs

H.-L. Chen, J. R. Marden, A. Wierman
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
Load balancing is a common approach to task assignment in distributed architectures.  ...  In this paper, we show that the degree of inefficiency in load balancing designs is highly dependent on the scheduling discipline used at each of the backend servers.  ...  In particular, we can view the stationary behavior of the load balancing system as the equilibrium point of a non-atomic routing game. This is often termed a selfish routing game [17] .  ... 
doi:10.1109/infcom.2009.5062152 dblp:conf/infocom/ChenMW09 fatcat:pdnqp7bw3zdmfchuoza7336rnq

Cooperative content distribution and traffic engineering

Wenjie Jiang, Rui Zhang-Shen, Jennifer Rexford, Mung Chiang
2008 Proceedings of the 3rd international workshop on Economics of networked systems - NetEcon '08  
Providing content services in a provider network presents new opportunities for coordination between server selection (to match servers with subscribers) and traffic engineering (to select efficient routes  ...  Leveraging ideas from cooperative game theory, we propose that the system implements a Nash bargaining solution that significantly improves the fairness and efficiency of the joint system.  ...  [6] studies the problem of load balancing through overlay routing, and how to alleviate race conditions among multiple co-existing overlays.  ... 
doi:10.1145/1403027.1403030 dblp:conf/sigcomm/JiangZRC08 fatcat:b3pmfsuazvggxfapzsy7xcpmky

A Resilient Routing Policy for Peering Management

Stefano Secci, Huaiyuan Ma, Bjarne Emil Helvik, Jean-Louis Rougier
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
In this paper, we propose a resilient PEMP execution policy accounting for the occurrence of potential impairments (traffic matrix variations, intra-AS and peering link failures) that may occurr in both  ...  Our policy is aimed at offering more dependability and better performance to the routing decision with respect to the current practice (e.g., hot-potato routing).  ...  Multipath and load-balancing can be implemented in both internal and external routing.  ... 
doi:10.1109/glocom.2010.5683622 dblp:conf/globecom/SecciMHR10 fatcat:mpzp4xuarrdmtb4tvo5ool6jx4

Energy Efficiency in Multi-hop CDMA Networks: A Game Theoretic Analysis [article]

Sharon Betz, H. Vincent Poor
2006 arXiv   pre-print
The energy efficiencies resulting from the use of different linear multiuser receivers in this context are compared, looking at both the non-cooperative game and the Pareto optimal solution.  ...  A game-theoretic analysis is used to study the effects of receiver choice on the energy efficiency of multi-hop networks in which the nodes communicate using Direct-Sequence Code Division Multiple Access  ...  One approach that has been very successful in researching energy efficient communications in both cellular and multi-hop networks is the game-theoretic approach described in [1, 2] .  ... 
arXiv:cs/0605098v1 fatcat:a47kj46nlbemhirpkiqlbrflpe

Performance–Cost Trade-Off Strategic Evaluation of Multipath TCP Communications

Stefano Secci, Guy Pujolle, Thi Mai Trang Nguyen, Sinh Chung Nguyen
2014 IEEE Transactions on Network and Service Management  
The resulting potential game always allows selecting multiple equilibria, leading to a strategic load-balancing distribution over the available interfaces, possibly constraining their use with respect  ...  In practice, the use of different access technologies is subject to different interconnection costs, and mobile users have preferences on interfaces jointly depending on performance and cost factors.  ...  In the game, incoming costs affect the Pareto-efficiency (because of the G d pure externality).  ... 
doi:10.1109/tnsm.2014.2321838 fatcat:g4xnjh3o2jg5jnoaaxyefax7lm

Resilient Inter-Carrier Traffic Engineering for Internet Peering Interconnections

Stefano Secci, Huaiyuan Ma, Bjarne E. Helvik, Jean-Louis Rougier
2011 IEEE Transactions on Network and Service Management  
In this paper, we propose a resilient PEMP execution policy accounting for the occurrence of potential impairments (traffic matrix variations, intra-AS and peering link failures) that may occur in both  ...  Our policy is aimed at offering more dependability and better performance to the routing decision with respect to the current practice (e.g., hot-potato routing).  ...  Multipath and load-balancing can be implemented in both internal and external routing.  ... 
doi:10.1109/tnsm.2011.110311.100064 fatcat:qrfy7bganrgwddt6qcf3jf5nia

Comprehensive Review of SDN Controller Placement Strategies

Bassey Isong, Reo Molose, Adnan M. Abu-Mahfouz, Nosipho Dladlu
2020 IEEE Access  
controllers, and load balancing in its objective function.  ...  and Coalitional Games Simulations: MATLAB Topologies: Fat-tree and VL2 Real-world datacenter Cost, Load balancing Data Center [49] Non-zero-sum based game theory Simulations: MATLAB Random  ... 
doi:10.1109/access.2020.3023974 fatcat:73esdrjiobbfdc2tnfqdzn5ef4

A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms, and Open Problems

Zesong Fei, Bin Li, Shaoshi Yang, Chengwen Xing, Hongbin Chen, Lajos Hanzo
2017 IEEE Communications Surveys and Tutorials  
Wireless sensor networks (WSNs) have attracted substantial research interest, especially in the context of performing monitoring and surveillance tasks.  ...  First, we provide an overview of the main optimization objectives used in WSNs.  ...  In [219] a Nash-equilibrium based game model, a cooperative coalition game model and an evolutionary game model were used for solving MOP.  ... 
doi:10.1109/comst.2016.2610578 fatcat:muagmfeguzbshb5w7ceaxddapm
« Previous Showing results 1 — 15 out of 1,493 results