@inproceedings{d18d817cfddc460cbef186c24f921e06,
title = "Design DiffServ multicast with selfish agents",
abstract = "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.",
keywords = "Algorithm mechanism design, Approximation algorithms, DiffServ, Multicast, Selfish agents",
author = "WeiZhao Wang and Xiang-Yang Li and Zheng Sun",
year = "2005",
month = jun,
day = "22",
doi = "10.1007/11496199_24",
language = "English",
isbn = "9783540262244",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "214--223",
editor = "Nimrod Megiddo and Yinfeng Xu and Binhai Zhu",
booktitle = "International Conference on Algorithmic Applications in Management",
address = "Germany",
edition = "1st",
note = "First International Conference on Algorithmic Applications in Management, AAIM 2005 ; Conference date: 22-06-2005 Through 25-06-2005",
}