Message latency in hypercubic computer networks with the bursty traffic pattern

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

An interconnection network is a crucial component of parallel computers because the overall system performance is very sensitive to the latency of messages delivered by the network to communicate among collaborating processors. This paper presents an analytical performance model to calculate message latency in circuit-switched hypercubic networks in the presence of bursty traffic pattern, which is a typical scenario for multimedia applications. A message in circuit switching may need a number of connection attempts before successfully setting up a path from source to destination. The proposed model uses the approach of superposing infinite bursty traffic streams to capture the effective traffic entering the network from a source node, which includes the traffic generated by the source and those due to many connection attempts. Results obtained from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.

Original languageEnglish
Pages (from-to)207-222
Number of pages16
JournalComputers and Electrical Engineering
Volume30
Issue number3
DOIs
Publication statusPublished - Apr 2004

Fingerprint

Computer networks
Switching circuits
Switching networks
Networks (circuits)
Experiments

Keywords

  • MMPP/G/1 queueing theory
  • Multimedia applications
  • Parallel computers
  • Performance modelling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Message latency in hypercubic computer networks with the bursty traffic pattern. / Min, Geyong; Ould-Khaoua, Mohamed.

In: Computers and Electrical Engineering, Vol. 30, No. 3, 04.2004, p. 207-222.

Research output: Contribution to journalArticle

@article{070fe968fe0545219be460007962d680,
title = "Message latency in hypercubic computer networks with the bursty traffic pattern",
abstract = "An interconnection network is a crucial component of parallel computers because the overall system performance is very sensitive to the latency of messages delivered by the network to communicate among collaborating processors. This paper presents an analytical performance model to calculate message latency in circuit-switched hypercubic networks in the presence of bursty traffic pattern, which is a typical scenario for multimedia applications. A message in circuit switching may need a number of connection attempts before successfully setting up a path from source to destination. The proposed model uses the approach of superposing infinite bursty traffic streams to capture the effective traffic entering the network from a source node, which includes the traffic generated by the source and those due to many connection attempts. Results obtained from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.",
keywords = "MMPP/G/1 queueing theory, Multimedia applications, Parallel computers, Performance modelling",
author = "Geyong Min and Mohamed Ould-Khaoua",
year = "2004",
month = "4",
doi = "10.1016/j.compeleceng.2002.04.001",
language = "English",
volume = "30",
pages = "207--222",
journal = "Computers and Electrical Engineering",
issn = "0045-7906",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Message latency in hypercubic computer networks with the bursty traffic pattern

AU - Min, Geyong

AU - Ould-Khaoua, Mohamed

PY - 2004/4

Y1 - 2004/4

N2 - An interconnection network is a crucial component of parallel computers because the overall system performance is very sensitive to the latency of messages delivered by the network to communicate among collaborating processors. This paper presents an analytical performance model to calculate message latency in circuit-switched hypercubic networks in the presence of bursty traffic pattern, which is a typical scenario for multimedia applications. A message in circuit switching may need a number of connection attempts before successfully setting up a path from source to destination. The proposed model uses the approach of superposing infinite bursty traffic streams to capture the effective traffic entering the network from a source node, which includes the traffic generated by the source and those due to many connection attempts. Results obtained from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.

AB - An interconnection network is a crucial component of parallel computers because the overall system performance is very sensitive to the latency of messages delivered by the network to communicate among collaborating processors. This paper presents an analytical performance model to calculate message latency in circuit-switched hypercubic networks in the presence of bursty traffic pattern, which is a typical scenario for multimedia applications. A message in circuit switching may need a number of connection attempts before successfully setting up a path from source to destination. The proposed model uses the approach of superposing infinite bursty traffic streams to capture the effective traffic entering the network from a source node, which includes the traffic generated by the source and those due to many connection attempts. Results obtained from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.

KW - MMPP/G/1 queueing theory

KW - Multimedia applications

KW - Parallel computers

KW - Performance modelling

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

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

U2 - 10.1016/j.compeleceng.2002.04.001

DO - 10.1016/j.compeleceng.2002.04.001

M3 - Article

VL - 30

SP - 207

EP - 222

JO - Computers and Electrical Engineering

JF - Computers and Electrical Engineering

SN - 0045-7906

IS - 3

ER -