NDLI: An optimal scheduling policy for a two-flow priority queue with alternate paths

Content Provider	IEEE Xplore Digital Library
Author	Hamouda, E. Mitton, N. Simplot-Ryl, D.
Copyright Year	2012
Description	Author affiliation: INRIA Lille-Nord Europe, France (Mitton, N.; Simplot-Ryl, D.) \|\| University of California Riverside, USA (Hamouda, E.)
Abstract	We consider a path-scheduling problem at a resource constrained node A that transmits two types of flows to a given destination through alternate paths. Type-1 flow is assumed to have a higher priority than type-2 flow thus, it is never rejected upon arrival. Type-2 flow, on the other hand, may be denied admission to the queue. Once accepted to the system, a packet joins queue 1 and is guaranteed service independent of its type. Instead of being rejected from service, packets have the option to be served at a slower server behind a second queue (queue 2) at node A. The slow server is intended mostly to serve low priority packets, therefore, type-1 packets are charged a switching cost in the event they are sent to queue 2. Transmitted packets receive a reward depending on which queue they were served at. The reward represents the resources saved for making that decision. A good path-scheduling policy at node A can reduce resource consumption at node A, extend the life of the efficient path, maximizes the service of both flows and guarantees the service of at least the high priority flow to the full extent. We propose and solve the path-scheduling problem for node A, which maximizes the average reward of successfully transmitting flows to a given sink, by dynamically assigning packets to one of the queues based on the packet type, the instantaneous queue lengths and the average reward for the associated path. We formulated the path-scheduling problem as a Markov decision process and show that the optimal policy is threshold-type.
Starting Page	1
Ending Page	8
File Size	200910
Page Count	8
File Format	PDF
ISBN	9781467322355
e-ISBN	9781618399823
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-07-08
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Society for Modeling & Sim
Subject Keyword	threshold routing Optimal scheduling energy efficiency Markov processes Routing admission control Markov decision process Scheduling Vectors performance optimization Servers Delay
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

Policy iteration for parameterized Markov decision processes and its application

Energy and delay optimal epidemic relaying in delay tolerant networks

Admission control of an M/M/1 queue with multiple deterioration states

Optimal threshold policies in a two-class preemptive priority queue with admission and termination control

Delay control for CDF scheduling using Markov decision process

Individual, Class-based, and Social Optimal Admission Policies in Two-Priority Queues

Optimal routing between alternate paths with different network transit delays (2006)

Optimal control of customer admission to an open Jackson network

A two-stage M/G/1 queue with discretionary priority

An optimal scheduling policy for a two-flow priority queue with alternate paths

Similar Documents

Policy iteration for parameterized Markov decision processes and its application

Energy and delay optimal epidemic relaying in delay tolerant networks

Admission control of an M/M/1 queue with multiple deterioration states

Optimal threshold policies in a two-class preemptive priority queue with admission and termination control

Delay control for CDF scheduling using Markov decision process

Individual, Class-based, and Social Optimal Admission Policies in Two-Priority Queues

Optimal routing between alternate paths with different network transit delays (2006)

Optimal control of customer admission to an open Jackson network

A two-stage M/G/1 queue with discretionary priority

An optimal scheduling policy for a two-flow priority queue with alternate paths