Design DiffServ Multicast with Selfish Agents

Differentiated service (DiffServ) is a mechanism to provide the Quality of Service (QoS) with a certain performance guarantee. In this paper, we study how to design DiffServ multicast when the participants (i.e., relay links) are selfish. We assume that each link ei is associated with a cost coefficient ai such that the cost of ei to provide a multicast service with bandwidth demand x is ai · x. We first show that a previous approximation algorithm does not directly induce a truthful mechanism. We then give a new polynomial time 8-approximation algorithm to construct a DiffServ multicast tree. Based on this tree, we design a truthful mechanism for DiffServ multicast, i.e., we give a polynomial-time computable payment scheme to compensate all chosen relay links such that each link ei maximizes its profit when it reports its privately cost coefficient ai truthfully.

[1]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[2]  Noam Nisan,et al.  Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.

[3]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[4]  Xiaohua Jia,et al.  A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem , 2002, J. Glob. Optim..

[5]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[6]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[7]  Kathleen Nichols,et al.  Differentiated Services Operational Model and Definitions , 1998 .

[8]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[9]  Nicholas F. Maxemchuk,et al.  Video Distribution on Multicast Networks , 1997, IEEE J. Sel. Areas Commun..

[10]  Ding-Zhu Du,et al.  Grade of Service Steiner Minimum Trees in the Euclidean Plane , 2001, Algorithmica.

[11]  Xiang-Yang Li,et al.  Towards truthful mechanisms for binary demand games: a general framework , 2005, EC '05.

[12]  Henning Schulzrinne,et al.  Pricing network resources for adaptive applications in a differentiated services network , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2000, IEEE/ACM Transactions on Networking.

[14]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[15]  Marek Karpinski,et al.  Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem , 2003, WADS.

[16]  Thomas L. Magnanti,et al.  Heuristics, LPs, and Trees on Trees: Network Design Analyses , 1996, Oper. Res..

[17]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[18]  Xiang-Yang Li,et al.  Design multicast protocols for non-cooperative networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Cristina G. Fernandes,et al.  Primal-dual algorithms for QoS multimedia multicast , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[20]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .