Cache coherence protocols: evaluation using a multiprocessor simulation model
ACM Transactions on Computer Systems (TOCS)
Data networks
Caching in the Sprite network file system
ACM Transactions on Computer Systems (TOCS)
Bandwidth management and congestion control framework of the broadband network architecture
Computer Networks and ISDN Systems
ATM: theory and application
The Performance of Cache-Based Error Recovery in Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
Automatic Network Clustering for Fast Path Selection
Proceedings of the IFIP TC6/WG6.4 Fifth International Conference on High Performance Networking V
A distributed table-driven route selection scheme for establishing real-time video channels
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Optimistic lookup of whole NFS paths in a single operation
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
A New Solution to Coherence Problems in Multicache Systems
IEEE Transactions on Computers
Connection caching to reduce signaling loads with applications to softswitch telephony
Computer Networks: The International Journal of Computer and Telecommunications Networking
A distributed cache architecture with snooping for QoS routing in large networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploiting the temporal dimension in QoS-aware multicast routing
Computer Communications
Benefits of traffic engineering using QoS routing schemes and network controls
Computer Communications
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
| Hi-index | 0.24 |
Caching of network paths in a connection-oriented communication network provides a means to store computed paths for later reuse. We propose that network path caching can provide an efficient way to eliminate, whenever possible, the expensive path computation algorithm that has to be performed in setting up a network connection. This paper is the first known work on network path caching in decentralized connection-oriented networks. It first identifies and analyses the issues that arise in caching network paths. Based on our extensive study of network path caching schemes, we then propose two path caching algorithms to reduce the number of path computations in the network when a new connection is to be established. A simulation study of the two algorithms is then presented. We conclude that both algorithms perform very well and significantly reduce the number of path computations in setting up connections.