Time complexity of response time estimation of multichannel communication networks

Hiroshi Matsumoto, Wagner Chiepa Cunha, Masafumi Yamashita, Tadashi Ae

Research output: Contribution to journalArticle

Abstract

In the multichannel communication network, more than one message can be transmitted in parallel through several channels. This paper defines response time as the time from the origination of a transmission request to the transmission completion, and discusses the time complexity in estimating the maximum response time in the multichannel communication network. The messages are transmitted in the network using simultaneously a set of channels (called a channel set). In the transmission of a message, a request may be issued for one or more channel sets. It is shown that the computational complexity is either polynomial or NP‐hard, depending on the number of requested channel sets.

Original languageEnglish
Pages (from-to)25-32
Number of pages8
JournalSystems and Computers in Japan
Volume19
Issue number11
DOIs
Publication statusPublished - Jan 1 1988

Fingerprint

Communication Networks
Response Time
Time Complexity
Telecommunication networks
Computational complexity
Polynomials
Completion
Computational Complexity
NP-complete problem
Polynomial

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Time complexity of response time estimation of multichannel communication networks. / Matsumoto, Hiroshi; Cunha, Wagner Chiepa; Yamashita, Masafumi; Ae, Tadashi.

In: Systems and Computers in Japan, Vol. 19, No. 11, 01.01.1988, p. 25-32.

Research output: Contribution to journalArticle

Matsumoto, Hiroshi ; Cunha, Wagner Chiepa ; Yamashita, Masafumi ; Ae, Tadashi. / Time complexity of response time estimation of multichannel communication networks. In: Systems and Computers in Japan. 1988 ; Vol. 19, No. 11. pp. 25-32.
@article{00937792f9714e1b9d4fb445a99d034a,
title = "Time complexity of response time estimation of multichannel communication networks",
abstract = "In the multichannel communication network, more than one message can be transmitted in parallel through several channels. This paper defines response time as the time from the origination of a transmission request to the transmission completion, and discusses the time complexity in estimating the maximum response time in the multichannel communication network. The messages are transmitted in the network using simultaneously a set of channels (called a channel set). In the transmission of a message, a request may be issued for one or more channel sets. It is shown that the computational complexity is either polynomial or NP‐hard, depending on the number of requested channel sets.",
author = "Hiroshi Matsumoto and Cunha, {Wagner Chiepa} and Masafumi Yamashita and Tadashi Ae",
year = "1988",
month = "1",
day = "1",
doi = "10.1002/scj.4690191103",
language = "English",
volume = "19",
pages = "25--32",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "11",

}

TY - JOUR

T1 - Time complexity of response time estimation of multichannel communication networks

AU - Matsumoto, Hiroshi

AU - Cunha, Wagner Chiepa

AU - Yamashita, Masafumi

AU - Ae, Tadashi

PY - 1988/1/1

Y1 - 1988/1/1

N2 - In the multichannel communication network, more than one message can be transmitted in parallel through several channels. This paper defines response time as the time from the origination of a transmission request to the transmission completion, and discusses the time complexity in estimating the maximum response time in the multichannel communication network. The messages are transmitted in the network using simultaneously a set of channels (called a channel set). In the transmission of a message, a request may be issued for one or more channel sets. It is shown that the computational complexity is either polynomial or NP‐hard, depending on the number of requested channel sets.

AB - In the multichannel communication network, more than one message can be transmitted in parallel through several channels. This paper defines response time as the time from the origination of a transmission request to the transmission completion, and discusses the time complexity in estimating the maximum response time in the multichannel communication network. The messages are transmitted in the network using simultaneously a set of channels (called a channel set). In the transmission of a message, a request may be issued for one or more channel sets. It is shown that the computational complexity is either polynomial or NP‐hard, depending on the number of requested channel sets.

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

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

U2 - 10.1002/scj.4690191103

DO - 10.1002/scj.4690191103

M3 - Article

AN - SCOPUS:0024106450

VL - 19

SP - 25

EP - 32

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 11

ER -