NDLI: The traveling miser problem

Content Provider	IEEE Xplore Digital Library
Author	Breitgand, D. Raz, D. Shavitt, Y.
Copyright Year	1993
Abstract	Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time and often can be delayed by the network without hurting functionality. This paper proposes a new framework to handle this low priority, but resource consuming traffic in such a way that it incurs a minimal interference with the higher priority traffic. Consequently, this improves the network goodput. The key idea is allowing the network nodes to delay data by locally storing it. This can be done, for example, in the Active Network paradigm. In this paper we show that such a model can improve the network's goodput dramatically even if a very simple scheduling algorithm for intermediate parking is used. The parking imposes additional load on the intermediate nodes. To obtain minimal cost schedules we define an optimization problem called the traveling miser problem. We concentrate on the on-line version of the problem for a predefined route, and develop a number of enhanced scheduling strategies. We study their characteristics under different assumptions on the environment through a rigorous simulation study. We prove that if only one link can be congested, then our scheduling algorithm is O(log₂B) competitive, where B is congestion time, and is 3-competitive, if additional signaling is allowed
Sponsorship	IEEE Computer Society IEEE Communications Society Association for Computing Machinery (ACM)
Starting Page	711
Ending Page	724
Page Count	14
File Size	977048
File Format	PDF
ISSN	10636692
Volume Number	14
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Telecommunication traffic Traffic control Timing Monitoring Delay effects Scheduling algorithm Application software Interference Cost function Algorithm design and analysis on-line algorithms Active networks competitive analysis delay tolerant networks network management
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Computer Science Applications Software

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

The traveling miser problem

The travelling miser problem

The Traveling Miser Problem Abstract — Various

Latency-rate servers: a general model for analysis of traffic scheduling algorithms

Optimal delay-constrained minimum cost loop algorithm for local computer network

Delay Analysis for Wireless Networks With Single Hop Traffic and General Interference Constraints

Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models

Call admission control algorithms for tandem generalized processor sharing networks

Generalized guaranteed rate scheduling algorithms: a framework

The traveling miser problem

Similar Documents

The traveling miser problem

The travelling miser problem

The Traveling Miser Problem Abstract — Various

Latency-rate servers: a general model for analysis of traffic scheduling algorithms

Optimal delay-constrained minimum cost loop algorithm for local computer network

Delay Analysis for Wireless Networks With Single Hop Traffic and General Interference Constraints

Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models

Call admission control algorithms for tandem generalized processor sharing networks

Generalized guaranteed rate scheduling algorithms: a framework

The traveling miser problem