Deterministic Routing to Buffered Channels

Zvi Rosberg

doi:10.1109/TCOM.1986.1096552

Deterministic Routing to Buffered Channels

Zvi Rosberg

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Consider n exponential transmission channels which transmit information with different rates. Every channel has a buffer which is capable of storing an unlimited number of messages. A new message first arrives at the controller, which immediately routes it to one of the channels according to an infinite deterministic routing sequence. A cost per unit of staying time is charged in each of the channels (channel dependent cost), and the long-run average staying cost is taken as the cost criterion. For every n and a Poisson arrival process, a lower bound to the cost is found and a new routing policy, the golden ratio policy, is presented and its cost is evaluated. It is shown that for a variety of system parameters, the golden ratio routing policy has a cost close.to the lower bound.

Original language	English
Pages (from-to)	504-507
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	34
Issue number	5
DOIs	https://doi.org/10.1109/TCOM.1986.1096552
State	Published - 1 Jan 1986
Externally published	Yes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCOM.1986.1096552

Cite this

@article{e3155862720c406abd93a88f9e6d4809,

title = "Deterministic Routing to Buffered Channels",

abstract = "Consider n exponential transmission channels which transmit information with different rates. Every channel has a buffer which is capable of storing an unlimited number of messages. A new message first arrives at the controller, which immediately routes it to one of the channels according to an infinite deterministic routing sequence. A cost per unit of staying time is charged in each of the channels (channel dependent cost), and the long-run average staying cost is taken as the cost criterion. For every n and a Poisson arrival process, a lower bound to the cost is found and a new routing policy, the golden ratio policy, is presented and its cost is evaluated. It is shown that for a variety of system parameters, the golden ratio routing policy has a cost close.to the lower bound.",

author = "Zvi Rosberg",

year = "1986",

month = jan,

day = "1",

doi = "10.1109/TCOM.1986.1096552",

language = "English",

volume = "34",

pages = "504--507",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - Deterministic Routing to Buffered Channels

AU - Rosberg, Zvi

PY - 1986/1/1

Y1 - 1986/1/1

N2 - Consider n exponential transmission channels which transmit information with different rates. Every channel has a buffer which is capable of storing an unlimited number of messages. A new message first arrives at the controller, which immediately routes it to one of the channels according to an infinite deterministic routing sequence. A cost per unit of staying time is charged in each of the channels (channel dependent cost), and the long-run average staying cost is taken as the cost criterion. For every n and a Poisson arrival process, a lower bound to the cost is found and a new routing policy, the golden ratio policy, is presented and its cost is evaluated. It is shown that for a variety of system parameters, the golden ratio routing policy has a cost close.to the lower bound.

AB - Consider n exponential transmission channels which transmit information with different rates. Every channel has a buffer which is capable of storing an unlimited number of messages. A new message first arrives at the controller, which immediately routes it to one of the channels according to an infinite deterministic routing sequence. A cost per unit of staying time is charged in each of the channels (channel dependent cost), and the long-run average staying cost is taken as the cost criterion. For every n and a Poisson arrival process, a lower bound to the cost is found and a new routing policy, the golden ratio policy, is presented and its cost is evaluated. It is shown that for a variety of system parameters, the golden ratio routing policy has a cost close.to the lower bound.

UR - https://www.scopus.com/pages/publications/0022717668

U2 - 10.1109/TCOM.1986.1096552

DO - 10.1109/TCOM.1986.1096552

M3 - Article

AN - SCOPUS:0022717668

SN - 0090-6778

VL - 34

SP - 504

EP - 507

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 5

ER -

Deterministic Routing to Buffered Channels

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this