Time complexity of response time estimation of multichannel communication networks
| Autor: | Wagner Chiepa Cunha, Masafumi Yamashita, Tadashi Ae, Hiroshi Matsumoto |
|---|---|
| Rok vydání: | 1988 |
| Předmět: |
Polynomial
Computational complexity theory business.industry Response time Data_CODINGANDINFORMATIONTHEORY Telecommunications network Theoretical Computer Science Set (abstract data type) Computational Theory and Mathematics Transmission (telecommunications) Hardware and Architecture business Time complexity Algorithm Computer Science::Information Theory Information Systems Computer network Communication channel Mathematics |
| Zdroj: | Systems and Computers in Japan. 19:25-32 |
| ISSN: | 1520-684X 0882-1666 |
| DOI: | 10.1002/scj.4690191103 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text