NDLI: Message Multicasting in Heterogeneous Networks

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Guha, Sudipto Naor, Joseph (Seffi) Bar-Noy, Amotz Schieber, Baruch
Copyright Year	2000
Abstract	In heterogeneous networks, sending messages may incur different delays on different links, and each node may have a different switching time between messages. The well-studied telephone model is obtained when all link delays and switching times are equal to one unit. We investigate the problem of finding the minimum time required to multicast a message from one source to a subset of the nodes of size k. The problem is NP-hard even in the basic telephone model. We present a polynomial-time algorithm that approximates the minimum multicast time within a factor of O(log k). Our algorithm improves on the best known approximation factor for the telephone model by a factor of $O(\frac{\log n}{\log\log k})$. No approximation algorithms were known for the general model considered in this paper.
Starting Page	347
Ending Page	358
Page Count	12
File Format	PDF
ISSN	00975397
DOI	10.1137/S0097539798347906
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	2
Volume Number	30
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2006-07-27
Access Restriction	Subscribed
Subject Keyword	postal model LogP model heterogeneous networks combinatorial optimization Analysis of algorithms and problem complexity Approximation algorithms Graph theory approximation algorithms Graph algorithms Network design and communication Communication networks multicast
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

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

Analysis of a near-metric TSP approximation algorithm

A 2-Approximation Algorithm for the Directed Multiway Cut Problem

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Fast Algorithms for Bipartite Network Flow

On Local Search and Placement of Meters in Networks

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

Approximation Algorithms for Minimum-Time Broadcast

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Message Multicasting in Heterogeneous Networks

Similar Documents

Analysis of a near-metric TSP approximation algorithm

A 2-Approximation Algorithm for the Directed Multiway Cut Problem

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Fast Algorithms for Bipartite Network Flow

On Local Search and Placement of Meters in Networks

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

Approximation Algorithms for Minimum-Time Broadcast

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Message Multicasting in Heterogeneous Networks