NDLI: Min-Cost Multicast of Selfish Information Flows

Content Provider	IEEE Xplore Digital Library
Author	Zongpeng Li
Copyright Year	2007
Description	Author affiliation: Univ. of Calgary, Calgary (Zongpeng Li)
Abstract	We study multicast in a non-cooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, through appropriate cost allocation and other economic measures, with replicable and encodable properties of information flows considered. We show that known cost allocation schemes are not sufficient. We provide a shadow-price based cost allocation for networks without capacity limits, and show it enforces minimum-cost multicast. This improves previous result where a 2-approximate multicast flow is enforced. For capacitied networks, computing cost allocation by ignoring edge capacities will not yield correct results. We show that an edge tax scheme can be combined with a cost allocation to strictly enforce optimal multicast flows in this more realistic case. If taxes are not desirable, they can be returned to flows while maintaining weak enforcement of the optimal flow. We relate the taxes to VCG payment schemes and discuss an efficient primal-dual algorithm that simultaneously computes the taxes, the cost allocation, and the optimal multicast flow.
Starting Page	231
Ending Page	239
File Size	238626
Page Count	9
File Format	PDF
ISBN	1424410479
ISSN	0743166X
DOI	10.1109/INFCOM.2007.35
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-05-06
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cost function Routing Environmental economics Computer networks Finance Game theory Network topology Network coding Nash equilibrium Multicast algorithms
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Min-Cost Selfish Multicast With Network Coding

Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows

Selfish Distributed Compression Over Networks: Correlation Induces Anarchy

Min-cost selfish multicast with network coding (2006)

On a Local Heuristic for a Reverse Multicast Forwarding Game

Min-cost selfish multicast with network coding (2006).

Bottleneck Routing Games in Communication Networks

Selfish Distributed Compression over Networks

Matrix games in the multicast networks: maximum information flows with network switching

Min-Cost Multicast of Selfish Information Flows

Similar Documents

Min-Cost Selfish Multicast With Network Coding

Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows

Selfish Distributed Compression Over Networks: Correlation Induces Anarchy

Min-cost selfish multicast with network coding (2006)

On a Local Heuristic for a Reverse Multicast Forwarding Game

Min-cost selfish multicast with network coding (2006).

Bottleneck Routing Games in Communication Networks

Selfish Distributed Compression over Networks

Matrix games in the multicast networks: maximum information flows with network switching

Min-Cost Multicast of Selfish Information Flows