Time complexity of response time estimation of multichannel communication networks

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

Research output: Contribution to journalArticlepeer-review


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
Issue number11
Publication statusPublished - Nov 1988
Externally publishedYes

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Time complexity of response time estimation of multichannel communication networks'. Together they form a unique fingerprint.

Cite this