### Abstract

The authors discuss the problem of determining the maximum response time for any messages in the network. In the model presented, the network consists of input ports at which messages are originated and channels to transmit messages. The authors first consider the case in which a message is originated at every input port only once and prove the problem to be NP-hard. Under additional conditions, it is shown that the problem is solvable on O(n) time, where n is the number of input ports. Based on this polynomial case, the authors extend the problem to the case in which messages are repeatedly originated at every input port and prove that the maximum response time for a sequence of consecutive messages originated at any input port can be computed in polynomial time.

Original language | English |
---|---|

Title of host publication | Unknown Host Publication Title |

Publisher | IEEE |

Pages | 198-207 |

Number of pages | 10 |

ISBN (Print) | 0818608153 |

Publication status | Published - Dec 1 1987 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*Unknown Host Publication Title*(pp. 198-207). IEEE.

**RESPONSE TIME ESTIMATION OF REAL-TIME NETWORKS.** / Ae, Tadashi; Yamashita, Masafumi; Matsumoto, Hiroshi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Unknown Host Publication Title.*IEEE, pp. 198-207.

}

TY - GEN

T1 - RESPONSE TIME ESTIMATION OF REAL-TIME NETWORKS.

AU - Ae, Tadashi

AU - Yamashita, Masafumi

AU - Matsumoto, Hiroshi

PY - 1987/12/1

Y1 - 1987/12/1

N2 - The authors discuss the problem of determining the maximum response time for any messages in the network. In the model presented, the network consists of input ports at which messages are originated and channels to transmit messages. The authors first consider the case in which a message is originated at every input port only once and prove the problem to be NP-hard. Under additional conditions, it is shown that the problem is solvable on O(n) time, where n is the number of input ports. Based on this polynomial case, the authors extend the problem to the case in which messages are repeatedly originated at every input port and prove that the maximum response time for a sequence of consecutive messages originated at any input port can be computed in polynomial time.

AB - The authors discuss the problem of determining the maximum response time for any messages in the network. In the model presented, the network consists of input ports at which messages are originated and channels to transmit messages. The authors first consider the case in which a message is originated at every input port only once and prove the problem to be NP-hard. Under additional conditions, it is shown that the problem is solvable on O(n) time, where n is the number of input ports. Based on this polynomial case, the authors extend the problem to the case in which messages are repeatedly originated at every input port and prove that the maximum response time for a sequence of consecutive messages originated at any input port can be computed in polynomial time.

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

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

M3 - Conference contribution

AN - SCOPUS:0023565443

SN - 0818608153

SP - 198

EP - 207

BT - Unknown Host Publication Title

PB - IEEE

ER -