Filters








2,326 Hits in 4.6 sec

On the Convergence of Multicast Games in Directed Networks

Angelo Fanelli, Michele Flammini, Luca Moscardelli
2008 Algorithmica  
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is directed.  ...  Namely, a subset of nodes of the network are interested in receiving the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods.  ...  In this paper we first consider the multicast game in directed networks induced by the Shapley Value cost sharing method [33] , which equally distributes the cost of each link among all the down-stream  ... 
doi:10.1007/s00453-008-9212-0 fatcat:lyvj6w74z5dbzb2so5gd272cmi

On the convergence of multicast games in directed networks

Angelo Fanelli, Michele Flammini, Luca Moscardelli
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is directed.  ...  Namely, a subset of nodes of the network are interested in receiving the transmission from a given source node and can share the cost of the used links according to fixed cost sharing methods.  ...  In this paper we first consider the multicast game in directed networks induced by the Shapley Value cost sharing method [33] , which equally distributes the cost of each link among all the down-stream  ... 
doi:10.1145/1248377.1248433 dblp:conf/spaa/FanelliFM07 fatcat:4d7utppn5fewxhml73ztlqgnxi

A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks

J. Yuan, Z. Li, W. Yu, B. Li
2006 IEEE Journal on Selected Areas in Communications  
The optimal and distributed provisioning of high throughput in mesh networks is known as a fundamental but hard problem.  ...  We emphasize the network coding technique for multicast routing and a game theoretic method for interference management, for which efficient and distributed solutions are derived and illustrated.  ...  Network coding has proven to be effective in increasing the multicast throughput [1] - [3] . Network optimization with the use of network coding is one of the main emphases of this paper.  ... 
doi:10.1109/jsac.2006.881617 fatcat:jqobz3t6k5dspaplz44pwl46ma

Multicast Network Design Game on a Ring [article]

Akaki Mamageishvili, Matus Mihalak
2015 arXiv   pre-print
In this paper we study quality measures of different solution concepts for the multicast network design game on a ring topology.  ...  We then initiate the study of myopic sequential price of stability and for the multicast game on the ring we construct a lower bound of 4/3, and provide an upper bound of 26/19.  ...  We thank anonymous reviewer for insightful comments and especially for pointing out the relation between myopic sequential price of stability and graphical multicast cost sharing games.  ... 
arXiv:1507.04222v1 fatcat:jzokjljkfremvflth7dookmyfu

Joint Optimization of Scheduling and Routing in Multicast Wireless Ad Hoc Networks Using Soft Graph Coloring and Nonlinear Cubic Games

Ebrahim Karami, Savo Glisic
2011 IEEE Transactions on Vehicular Technology  
First routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network.  ...  In the proposed game which is a nonlinear cubic game, the strategy sets of the players are links, path, and network components.  ...  If source is sending unicast data, size of its sink set is one. Wireless propagation for this network assumes the following: 1. Omni-directional transmission. 2.  ... 
doi:10.1109/tvt.2011.2161355 fatcat:5dnakw54gbhxnkbvw5rg2x74v4

Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks

Zitian Wang, Zhehan Cao, Ying Cui, Yang Yang
2017 GLOBECOM 2017 - 2017 IEEE Global Communications Conference  
Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region  ...  cache-enabled wireless multicasting network.  ...  Note that the directional derivative of function r : D ! R, where D is a convex set, at point x in direction d is defined by  ... 
doi:10.1109/glocom.2017.8254673 dblp:conf/globecom/WangCCY17 fatcat:5otfdu6tazhilimgr46pj3w4wm

Incentive mechanism in wireless multicast

Bo Hu, H. Vicky Zhao, Hai Jiang
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
To stimulate user cooperation, in this work, we model the interaction among users in the wireless multicast system as a multibuyer multi-seller price-based game, where users pay to receive relay service  ...  In wireless multicast systems, cooperative multicast has been shown to be effective in dealing with heterogeneous channel conditions and improving the system performance.  ...  In the literature, there are limited works on incentive mechanisms for wireless multicast, mainly for ad hoc networks (i.e., a source node intends to multicast to others nodes, some of which do not have  ... 
doi:10.1109/icassp.2011.5946953 dblp:conf/icassp/HuZJ11 fatcat:6ijtee53erdrfnxknf7nctcvja

Coding-Aware Peer-to-Peer Data Repair in Multi-Rate Wireless Networks: A Game Theoretic Analysis

Hsiao-Chen Lu, Wanjiun Liao, Meng Chang Chen, Musaed A. Alhussein
2013 IEEE Journal on Selected Areas in Communications  
Recent research shows that in wireless wide area networks (WWANs), users who subscribe to multicast traffic from WWAN can exchange network-coded packets with one another via their secondary radio interfaces  ...  The impact of the pricing rules and the convergence conditions of the packet repairing game is also analyzed.  ...  In this example, we show that with network coding, only two transmissions are required for the users to cooperatively repair packets for one another, while four transmissions are required in the direct  ... 
doi:10.1109/jsac.2013.sup.0513035 fatcat:emqs5kngibgxfclq7ipqsgn76u

Scalability of a distributed virtual environment based on a structured peer-to-peer architecture

Jiehua Chen, S Grottke, J Sablatnig, R Seiler, A Wolisz
2011 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)  
The overall network load per host as well as the message routing latency grows logarithmically with the number of hosts; this is in partial contradiction to Knutsson et al.'s results.  ...  We investigate the scalability of distributed virtual environments (DVEs) based on a structured peer-to-peer (P2P) overlay. We focus on network load and message routing latency.  ...  The interaction is implemented through direct host communication. III. PROTOTYPICAL GAME SCENARIO SIMMUD SimMud is an abstraction of a simple online game and can be simulated on a single computer.  ... 
doi:10.1109/comsnets.2011.5716424 dblp:conf/comsnets/ChenGSSW11 fatcat:fzpezcyg6fhqnmcd3gfs3dtxaa

When ignorance helps: Graphical multicast cost sharing games

Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
2010 Theoretical Computer Science  
Following the framework introduced in [7], we study the impact of social knowledge graphs on the fundamental multicast cost sharing game in which all the players want to receive the same communication  ...  In non-cooperative games played on highly decentralized networks the assumption that each player knows the strategy adopted by any other player may be too optimistic or even infeasible.  ...  In this paper we analyze the consequences of the presence of social knowledge graphs in the fundamental multicast cost sharing game defined in [2] , in which the players are network users interested in  ... 
doi:10.1016/j.tcs.2009.10.007 fatcat:pfgk24bbt5hlletajl3osikfge

The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant

Vittorio Bilo, Michele Flammini, Luca Moscardelli
2013 2013 IEEE 54th Annual Symposium on Foundations of Computer Science  
They also provided an instance of broadcast games in directed graphs for which PoS = H n , thus completely characterizing the PoS of network design games in the directed case.  ...  Broadcast games are multicast games in which there is a player associated to every node of the network. In their seminal paper, Anshelevich et al.  ... 
doi:10.1109/focs.2013.74 dblp:conf/focs/BiloFM13 fatcat:e4u4o7fg5rfjddb7ikdk2gclr4

A New Deep Q-Network Design for QoS Multicast Routing in Cognitive Radio MANETs

Thong-Nhat Tran, Toan-Van Nguyen, Kyusung Shim, Daniel Benevides Da Costa, Beongku An
2021 IEEE Access  
Simulation results show that the DQMR protocol outperforms multicast ad hoc on-demand distance vector routing protocol in terms of routing delay, control overhead, and PDR.  ...  INDEX TERMS Cognitive mobile ad hoc networks, cross-layer, deep Q-network, game theory, QoS multicast routing.  ...  This shorttime convergence may expedite the feasibility of the practical implementation of the channel-time slot allocation based on game theory in CR-MANETs.  ... 
doi:10.1109/access.2021.3126844 fatcat:76lqpquj3zgddewjln3s5iwiqe

Route Optimization Technique to Support Multicast in Mobile Networks [chapter]

Kiyong Park, Sunyong Han, Bok-gyu Joo, Keecheon Kim, Jinpyo Hong
2004 Lecture Notes in Computer Science  
Meanwhile, as the needs of group communications increase in the internet, supporting multicast services became a challenging issue on NEMO as on Mobile IP.  ...  This paper explores issues and problems of providing multicast service on mobile networks and presents a route optimization technique along with an architecture that enables optimal and efficient multicast  ...  MIP-BT (Bi-directional Tunneling) and MIP-RS (Remote Subscription) In MIP-BT, a mobile node in a foreign network receives multicast data packets from the mobility agent in the home network by bi-directional  ... 
doi:10.1007/978-3-540-24688-6_153 fatcat:z2wnos6ezjaetfq4aqfiy2ge3i

Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks

Ying Cui, Zitian Wang, Yang Yang, Feng Yang, Lianghui Ding, Liang Qian
2018 IEEE Transactions on Communications  
Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region  ...  cache-enabled wireless multicasting network.  ...  In general, it is quite difficult to guarantee that an iterative algorithm can converge to an NE of a game, especially for a large-scale wireless network.  ... 
doi:10.1109/tcomm.2018.2807445 fatcat:as2dripscnh4xbdoxv5tzpdrhi

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves [chapter]

Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
2006 Lecture Notes in Computer Science  
We study a multicast game in communication networks in which a source sends the same message or service to a set of destinations and the cost of the used links is divided among the receivers according  ...  Multicast, Nash equilibria, price of anarchy, limited number of best responses.  ...  Existence and convergence to Nash equilibriaAs an extension of our work on Nash equilibria in multicast transmissions in wireless networks [2] , it is not difficult to prove the following results on the  ... 
doi:10.1007/11821069_32 fatcat:qtsb4ap7ajebxnftjttsxp34n4
« Previous Showing results 1 — 15 out of 2,326 results