Time complexity of response time estimation of multichannel communication networks

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

研究成果: Contribution to journalArticle査読

抄録

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.

本文言語英語
ページ(範囲)25-32
ページ数8
ジャーナルSystems and Computers in Japan
19
11
DOI
出版ステータス出版済み - 1 1 1988

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 情報システム
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学

フィンガープリント

「Time complexity of response time estimation of multichannel communication networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル