NDLI: Maximizing throughput in wireless networks via gossiping

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

Stardust: tracking activity in a distributed storage system

Maximizing throughput in wireless networks via gossiping

GPS scheduling: selection of optimal weights and comparison with strict priorities

NetQuest: a flexible framework for large-scale network measurement

An efficient algorithm for the exact analysis of multiclass queueing networks with large population sizes

Automatic logging of operating system effects to guide application-level architecture simulation

Confidence intervals for priority sampling

Robust network connectivity: when it's the big picture that matters

Fluid modeling of pollution proliferation in P2P networks

QuickProbe: available bandwidth estimation in two roundtrips

Performance and reliability: the ubiquitous challenge

Exploiting redundancy to conserve energy in storage systems

Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications

The impact of reneging in processor sharing queues

Robust traffic matrix estimation with imperfect information: making use of multiple data sources

Transient analysis of tree-Like processes and its application to random access systems

An analytical model for cache replacement policy performance

Finding probably better system configurations quickly

Packet classifiers in ternary CAMs can be smaller

Fast statistical spam filter by approximate classifications

Flexible time-windows for advance reservation in LambdaGrids

Impacts of channel variability on link-level throughput in wireless networks

Tail asymptotics for policies favoring short jobs in a many-flows regime

Data streaming algorithms for estimating entropy of network traffic

Bounding stationary results of Tandem networks with MAP input and PH service time distributions

Understanding the management of client perceived response time

The Erlang model with non-poisson call arrivals

Design of a novel statistics counter architecture with optimal space and time efficiency

Analyzing persistent state interactions to improve state management

Partially overlapped channels not considered harmful

On light and heavy traffic approximations of balanced fairness

On suitability of Euclidean embedding of internet hosts

Fundamental characteristics of queues with fluctuating load

On the way to a distributed systems calculus: an end-to-end network calculus with data scaling

Delay-optimal scheduling in bandwidth-sharing networks

Throughput performance of popular JMS servers

Optimizing the HPCC randomaccess benchmark on blue Gene/L Supercomputer

Peer-to-peer streaming of stored media: the indirect approach

Analysis of a new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors

Applying architectural vulnerability Analysis to hard faults in the microprocessor

A multicommodity flow model for distributed stream processing

A characterization of a java-based commercial workload on a high-end enterprise server

Optimizing transmission rate in wireless channels using adaptive probes

Consolidating clients on back-end servers with co-location and frequency control

Congestion responsiveness of internet traffic: (a fresh look at an old problem)

Towards deterministic network diagnosis

Modeling adoptability of secure BGP protocols

Maximizing throughput in wireless networks via gossiping

Content Provider	ACM Digital Library
Author	Shah, Devavrat Zussman, Gil Modiano, Eytan
Abstract	A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed algorithms for networks in which a node can converse with at most a single neighbor at a time have been presented. These algorithms guarantee 50% of the maximum possible throughput. We present the first distributed scheduling framework that guarantees maximum throughput. It is based on a combination of a distributed matching algorithm and an algorithm that compares and merges successive matching solutions. The comparison can be done by a deterministic algorithm or by randomized gossip algorithms. In the latter case, the comparison may be inaccurate. Yet, we show that if the matching and gossip algorithms satisfy simple conditions related to their performance and to the inaccuracy of the comparison (respectively), the framework attains the desired throughput.It is shown that the complexities of our algorithms, that achieve nearly 100% throughput, are comparable to those of the algorithms that achieve 50% throughput. Finally, we discuss extensions to general interference models. Even for such models, the framework provides a simple distributed throughput optimal algorithm.
Starting Page	27
Ending Page	38
Page Count	12
File Format	PDF
ISBN	1595933190
DOI	10.1145/1140277.1140283
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-06-26
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Matching Stability Wireless networks Gossip algorithms Scheduling Distributed algorithms
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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