Data networks
Communication networks: a first course
Communication networks: a first course
Networking in distributed real-time systems
Networking in distributed real-time systems
Statistical real-time channels on multiaccess networks
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point Networks
IEEE Transactions on Parallel and Distributed Systems
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
Multiplexing statistical real-time channels in a multi-access network
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Performance Evaluation of Dependable Real-Time Communication with Elastic QoS
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Utility Accrual Channel Establishment in Multihop Networks
IEEE Transactions on Computers
Localized Credit Based QoS Routing: Performance Evaluation Using
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
| Hi-index | 0.00 |
To guarantee the delivery of real-time messages before their deadline, a real-time channel or connection must be established before the transmission of any message belonging to the connection. During this channel establishment phase, one must first select a route between the source and destination of this channel and then reserve sufficient resources along this route so that the worst-case end-to-end delay over the selected route may not exceed the user-specified delay bound. We propose an efficient distributed route selection scheme that is guaranteed to find a 驴qualified驴 route, if any, satisfying the performance requirement of the requested channel without compromising any of the existing guarantees. The proposed scheme can also eliminate the common reliability/performance bottleneck of a centralized route selection scheme while improving efficiency over the centralized and other distributed schemes. Although the proposed solution starts with searching all possible routes in parallel, it prunes infeasible routes quickly, and its worst-case operational overhead is shown to be only a linear function of the number of links in the network. Several examples and simulation results are presented to demonstrate the effectiveness of the proposed distributed route selection scheme as compared to sequential route-search schemes.