Tight bounds for the maximum throughput of time-multiplex switches

Yiu Wing Leung

doi:10.1109/26.539766

Tight bounds for the maximum throughput of time-multiplex switches

Yiu Wing Leung^*

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Journal article › peer-review

2 Citations (Scopus)

Abstract

The throughput of a time-multiplex switch can be maximized by resolving transmission conflict such that the maximum number of packets are switched in each slot. In this letter, we propose an upper-bound and a lower-bound for the maximum throughput of time-multiplex switches. These bounds are given in closed-form expressions, they are very tight, and they are significantly tighter than the bounds proposed in [1].

Original language	English
Pages (from-to)	1257-1260
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	44
Issue number	10
DOIs	https://doi.org/10.1109/26.539766
Publication status	Published - Oct 1996

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Access to Document

10.1109/26.539766

Cite this

@article{726a4665bd5c4f94aa0383ff78594aa4,

title = "Tight bounds for the maximum throughput of time-multiplex switches",

abstract = "The throughput of a time-multiplex switch can be maximized by resolving transmission conflict such that the maximum number of packets are switched in each slot. In this letter, we propose an upper-bound and a lower-bound for the maximum throughput of time-multiplex switches. These bounds are given in closed-form expressions, they are very tight, and they are significantly tighter than the bounds proposed in [1].",

author = "Leung, \{Yiu Wing\}",

note = "This project is supported by the HKPU Research Grant 340/113. Publisher Copyright: {\textcopyright} 1996 IEEE",

year = "1996",

month = oct,

doi = "10.1109/26.539766",

language = "English",

volume = "44",

pages = "1257--1260",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "IEEE",

number = "10",

}

TY - JOUR

T1 - Tight bounds for the maximum throughput of time-multiplex switches

AU - Leung, Yiu Wing

PY - 1996/10

Y1 - 1996/10

N2 - The throughput of a time-multiplex switch can be maximized by resolving transmission conflict such that the maximum number of packets are switched in each slot. In this letter, we propose an upper-bound and a lower-bound for the maximum throughput of time-multiplex switches. These bounds are given in closed-form expressions, they are very tight, and they are significantly tighter than the bounds proposed in [1].

AB - The throughput of a time-multiplex switch can be maximized by resolving transmission conflict such that the maximum number of packets are switched in each slot. In this letter, we propose an upper-bound and a lower-bound for the maximum throughput of time-multiplex switches. These bounds are given in closed-form expressions, they are very tight, and they are significantly tighter than the bounds proposed in [1].

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

U2 - 10.1109/26.539766

DO - 10.1109/26.539766

M3 - Journal article

AN - SCOPUS:0030258738

SN - 0090-6778

VL - 44

SP - 1257

EP - 1260

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 10

ER -

Tight bounds for the maximum throughput of time-multiplex switches

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this