Delay and Energy Efficiency Tradeoff for Information Pushing System

Samrat Nath, Jingxian Wu, Jing Yang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We study the optimum designs of a unicast push-based information delivery system, where information is sent from a server to a user by using server-initiated pushing actions. Information arrives at the server at random and the server adopts a 'hold-then-serve' strategy, where new information is temporarily stored in a queue for a later one-time transmission. At any given time instant the server decides whether to stop waiting and push all information in the queue to the user, or to keep waiting based on the current queue status and the long-term design objective. A shorter waiting time can preserve the 'freshness' or timeliness of the information, which can be measured by using various delay penalty functions. However, frequent pushing actions will increase the power consumption of user devices by frequently waking up the client. The objective is to identify the optimum stopping rule that can optimize the tradeoff between the delay penalty and energy consumption. Motivated by the fact that different applications have different delay requirements, we adopt three different types of delay penalty functions, including linear, exponential, and logarithmic penalty functions. Using optimum stopping theories, optimum stopping rules are developed to minimize a weighted combination of delay penalty and energy efficiency. Different Pareto-optimum tradeoffs between delay and energy efficiency can be achieved by tuning the weight coefficient in the objective function. In particular, if the delay penalty function is convex, it is proved that the one-step look ahead stopping rule is optimum.

Original languageEnglish (US)
Article number8382314
Pages (from-to)1027-1040
Number of pages14
JournalIEEE Transactions on Green Communications and Networking
Volume2
Issue number4
DOIs
StatePublished - Dec 1 2018

Fingerprint

Energy efficiency
Information systems
Servers
Electric power utilization
Energy utilization
Tuning

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Renewable Energy, Sustainability and the Environment

Cite this

@article{575b6d79096c4d5d8a4517c5b2db08e1,
title = "Delay and Energy Efficiency Tradeoff for Information Pushing System",
abstract = "We study the optimum designs of a unicast push-based information delivery system, where information is sent from a server to a user by using server-initiated pushing actions. Information arrives at the server at random and the server adopts a 'hold-then-serve' strategy, where new information is temporarily stored in a queue for a later one-time transmission. At any given time instant the server decides whether to stop waiting and push all information in the queue to the user, or to keep waiting based on the current queue status and the long-term design objective. A shorter waiting time can preserve the 'freshness' or timeliness of the information, which can be measured by using various delay penalty functions. However, frequent pushing actions will increase the power consumption of user devices by frequently waking up the client. The objective is to identify the optimum stopping rule that can optimize the tradeoff between the delay penalty and energy consumption. Motivated by the fact that different applications have different delay requirements, we adopt three different types of delay penalty functions, including linear, exponential, and logarithmic penalty functions. Using optimum stopping theories, optimum stopping rules are developed to minimize a weighted combination of delay penalty and energy efficiency. Different Pareto-optimum tradeoffs between delay and energy efficiency can be achieved by tuning the weight coefficient in the objective function. In particular, if the delay penalty function is convex, it is proved that the one-step look ahead stopping rule is optimum.",
author = "Samrat Nath and Jingxian Wu and Jing Yang",
year = "2018",
month = "12",
day = "1",
doi = "10.1109/TGCN.2018.2846524",
language = "English (US)",
volume = "2",
pages = "1027--1040",
journal = "IEEE Transactions on Green Communications and Networking",
issn = "2473-2400",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

Delay and Energy Efficiency Tradeoff for Information Pushing System. / Nath, Samrat; Wu, Jingxian; Yang, Jing.

In: IEEE Transactions on Green Communications and Networking, Vol. 2, No. 4, 8382314, 01.12.2018, p. 1027-1040.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Delay and Energy Efficiency Tradeoff for Information Pushing System

AU - Nath, Samrat

AU - Wu, Jingxian

AU - Yang, Jing

PY - 2018/12/1

Y1 - 2018/12/1

N2 - We study the optimum designs of a unicast push-based information delivery system, where information is sent from a server to a user by using server-initiated pushing actions. Information arrives at the server at random and the server adopts a 'hold-then-serve' strategy, where new information is temporarily stored in a queue for a later one-time transmission. At any given time instant the server decides whether to stop waiting and push all information in the queue to the user, or to keep waiting based on the current queue status and the long-term design objective. A shorter waiting time can preserve the 'freshness' or timeliness of the information, which can be measured by using various delay penalty functions. However, frequent pushing actions will increase the power consumption of user devices by frequently waking up the client. The objective is to identify the optimum stopping rule that can optimize the tradeoff between the delay penalty and energy consumption. Motivated by the fact that different applications have different delay requirements, we adopt three different types of delay penalty functions, including linear, exponential, and logarithmic penalty functions. Using optimum stopping theories, optimum stopping rules are developed to minimize a weighted combination of delay penalty and energy efficiency. Different Pareto-optimum tradeoffs between delay and energy efficiency can be achieved by tuning the weight coefficient in the objective function. In particular, if the delay penalty function is convex, it is proved that the one-step look ahead stopping rule is optimum.

AB - We study the optimum designs of a unicast push-based information delivery system, where information is sent from a server to a user by using server-initiated pushing actions. Information arrives at the server at random and the server adopts a 'hold-then-serve' strategy, where new information is temporarily stored in a queue for a later one-time transmission. At any given time instant the server decides whether to stop waiting and push all information in the queue to the user, or to keep waiting based on the current queue status and the long-term design objective. A shorter waiting time can preserve the 'freshness' or timeliness of the information, which can be measured by using various delay penalty functions. However, frequent pushing actions will increase the power consumption of user devices by frequently waking up the client. The objective is to identify the optimum stopping rule that can optimize the tradeoff between the delay penalty and energy consumption. Motivated by the fact that different applications have different delay requirements, we adopt three different types of delay penalty functions, including linear, exponential, and logarithmic penalty functions. Using optimum stopping theories, optimum stopping rules are developed to minimize a weighted combination of delay penalty and energy efficiency. Different Pareto-optimum tradeoffs between delay and energy efficiency can be achieved by tuning the weight coefficient in the objective function. In particular, if the delay penalty function is convex, it is proved that the one-step look ahead stopping rule is optimum.

UR - http://www.scopus.com/inward/record.url?scp=85067529954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067529954&partnerID=8YFLogxK

U2 - 10.1109/TGCN.2018.2846524

DO - 10.1109/TGCN.2018.2846524

M3 - Article

VL - 2

SP - 1027

EP - 1040

JO - IEEE Transactions on Green Communications and Networking

JF - IEEE Transactions on Green Communications and Networking

SN - 2473-2400

IS - 4

M1 - 8382314

ER -