000			01764nab a22003017 4500
001			H004.7 COM
003			AR-sfUTN
008			190909b xx |||p|r|||| 00| 0 spa d
040			_cAR-sfUTN
080			_aH004.7 COM
100			_aPeyravian, Mohammad
700			_aKshemkalyani, Ajay D.
245			_aNetwork path caching:: Issues, algorithms and a simulation study
336			_2rdacontent _atexto _btxt
337			_2rdamedia _asin mediación _bn
338			_2rdacarrier _avolumen _bnc
505			_aCaching 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
650			_aALGORITHM
650			_aATM
650			_aCONNECTION
650			_aBANDWIDTH
650			_aPATH SELECTION
650			_aCACHING
650			_aSIMULATION
773			_tComputer communications _wH004.7 COM _nS.T.:H004.7 COM PP2707 _g(vol. 20, nro. 8, Ago. 1997), p. 605-614
942			_cAN
999			_c35674 _d35674