NDLI: On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Please wait, while we are loading the content...

On delivery times in packet networks under adversarial traffic

Object location in realistic networks

Fighting against two adversaries: page migration in dynamic networks

Packet-mode policies for input-queued switches

Balanced graph partitioning

Scheduling against an adversarial network

Sharing the cost of multicast transmissions in wireless networks

A scalable lock-free stack algorithm

Effectively sharing a cache among threads

Improved combination of online algorithms for acceptance and rejection

Online algorithms for network design

Dynamic analysis of the arrow distributed protocol

Adaptive channel queue routing on k-ary n-cubes

Simple efficient load balancing algorithms for peer-to-peer systems

Online hierarchical cooperative caching

Parallelism versus memory allocation in pipelined router forwarding engines

Bi-criteria algorithm for scheduling jobs on cluster platforms

On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Selfish load balancing and atomic congestion games

DCAS is not a silver bullet for nonblocking algorithm design

Cache-oblivious shortest paths in graphs using buffer heap

Time complexity of practical parallel steiner point insertion algorithms

Expansion properties of (secure) wireless networks

Optimal early stopping uniform consensus in synchronous systems with process omission failures

Compact name-independent routing with minimum stretch

Consistent and compact data management in distributed storage systems

New results on web caching with request reordering

Lower bounds for graph embeddings and combinatorial preconditioners

On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs

Pagoda: a dynamic overlay network for routing, data management, and multicasting

How to route and tax selfish unsplittable traffic

Efficient orchestration of sub-word parallelism in media processors

Online algorithms for prefetching and caching on parallel disks

The inherent queuing delay of parallel packet switches

The effect of faults on network expansion

Writing-all deterministically and optimally using a non-trivial number of asynchronous processors

Geometric generalizations of the power of two choices

An NC algorithm for finding a maximal acyclic set in a graph

Efficient search in unstructured peer-to-peer networks

The potential in energy efficiency of a speculative chip-multiprocessor

On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Content Provider	ACM Digital Library
Author	Li, Baochun Cui, Yi Nahrstedt, Klara
Abstract	In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split the traffic and feed them into multiple trees. While in single-tree solutions, bandwidth of leaf nodes may remain largely under-utilized, multi-tree solutions increase the chances for a node to contribute its bandwidth by being a relaying node in at least one of the trees. We study the following problems: (1) What is the maximum capacity multi-tree solutions can exploit from overlay networks? (2) When multiple sessions compete within the same network, what is the relationship of two contradictory goals: achieving fairness and maximizing overall throughput? (3) What is the impact of IP routing in achieving at constraining the optimal performance of overlay multicast.We extend the multicommodity flow model to the case of overlay data dissemination, where each commodity is associated with an overlay session, rather than the traditional source-destination pair. We first prove that the problem is solvable in polynomial time, then propose an ε-approximation algorithm, assuming that each commodity can be split in arbitrary ways. The solution to this problem establishes the theoretical upper bound of overall throughput that any multi-tree solution could reach. We then study the same problem with the restriction that each commodity can only be split and fed into a limited number of trees. A randomized rounding algorithm and an online tree-construction algorithm are presented. All these algorithms are evaluated by extensive simulations.
Starting Page	160
Ending Page	169
Page Count	10
File Format	PDF
ISBN	1581138407
DOI	10.1145/1007912.1007937
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-06-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Multicast Multicommodity flow Overlay
Content Type	Text
Resource Type	Article

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

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

1On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

Capacity of wireless networks with multiple types of multicast sessions

Capacity and Flow Assignment in survivable overlay networks with dual homing architecture

High-bandwidth routing in dynamic peer-to-peer streaming

Optimal capacity sharing of networks with multiple overlays (2006)

On the capacity of multiple unicast sessions in undirected graphs

On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Similar Documents

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

1On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

On Achieving Optimized Capacity Utilization in Application Overlay Networks with Multiple Competing Sessions (2004)

Capacity of wireless networks with multiple types of multicast sessions

Capacity and Flow Assignment in survivable overlay networks with dual homing architecture

High-bandwidth routing in dynamic peer-to-peer streaming

Optimal capacity sharing of networks with multiple overlays (2006)

On the capacity of multiple unicast sessions in undirected graphs

On achieving optimized capacity utilization in application overlay networks with multiple competing sessions