메뉴 건너뛰기




Volumn 33, Issue 3, 2003, Pages 297-312

Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques

Author keywords

ATM QoS routing; Computational intelligence; Reinforcement learning algorithm

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTER SIMULATION; LEARNING ALGORITHMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; QUALITY OF SERVICE; RESOURCE ALLOCATION; SWITCHING SYSTEMS; THEOREM PROVING;

EID: 0242334153     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2003.817354     Document Type: Article
Times cited : (96)

References (35)
  • 1
    • 0004256207 scopus 로고    scopus 로고
    • Traffic control and congestion control in B-ISDN
    • Geneva, ITU-T, Recommendation 1.371
    • "Traffic Control and Congestion Control in B-ISDN,", Geneva, ITU-T, Recommendation 1.371, 1996.
    • (1996)
  • 3
    • 0003645568 scopus 로고    scopus 로고
    • Private network-network interface specification version 1.0 (PNNI 1.0)
    • The ATM Forum Technical Committee, ATM forum af-pnni-0055.000
    • "Private Network-Network Interface Specification Version 1.0 (PNNI 1.0)," The ATM Forum Technical Committee, ATM forum af-pnni-0055.000, 1996.
    • (1996)
  • 4
    • 0242355667 scopus 로고    scopus 로고
    • QoS-based routing in networks with inaccurate information: Theory and algorithms
    • IBM Res. Rep., RC 20515
    • R. Guerin and A. Orda, "QoS-Based Routing in Networks With Inaccurate Information: Theory and Algorithms,", IBM Res. Rep., RC 20515, 1996.
    • (1996)
    • Guerin, R.1    Orda, A.2
  • 5
    • 0029284617 scopus 로고
    • Topology aggregation for hierarchical routing in ATM networks
    • W. Lee, "Topology aggregation for hierarchical routing in ATM networks," Comput. Commun. Rev., pp. 82-92, 1995.
    • (1995) Comput. Commun. Rev. , pp. 82-92
    • Lee, W.1
  • 6
    • 61849167522 scopus 로고    scopus 로고
    • Spanning tree method for link state aggregation in large communication networks
    • ____, "Spanning tree method for link state aggregation in large communication networks," in Proc. IEEE INFOCOM, Apr. 1995, pp. 297-302.
    • Proc. IEEE INFOCOM, Apr. 1995 , pp. 297-302
    • Lee, W.1
  • 9
    • 0242387215 scopus 로고    scopus 로고
    • Performance analysis of PNNI routing in ATM networks: Hierarchical reduced load approximation
    • Univ. Maryland, Institute System Research Tech. Rep. TR 97-65
    • H. Xie and J. Baras, "Performance Analysis of PNNI Routing in ATM Networks: Hierarchical Reduced Load Approximation," Univ. Maryland, Institute System Research Tech. Rep. TR 97-65, 1997.
    • (1997)
    • Xie, H.1    Baras, J.2
  • 11
    • 0032665343 scopus 로고    scopus 로고
    • Routing with end-to-end QoS guarantees in broadband networks
    • June
    • A. Orda, "Routing with end-to-end QoS guarantees in broadband networks," IEEE/ACMT-Networking, vol. 7, no.3, pp. 365-374, June 1999.
    • (1999) IEEE/ACMT-Networking , vol.7 , Issue.3 , pp. 365-374
    • Orda, A.1
  • 12
    • 1242314485 scopus 로고    scopus 로고
    • QoS routing in networks with uncertain parameters
    • Dec.
    • D. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM T-Net, pp. 768-778, Dec. 1998.
    • (1998) IEEE/ACM T-Net , pp. 768-778
    • Lorenz, D.1    Orda, A.2
  • 13
    • 0032047632 scopus 로고    scopus 로고
    • A scalable QoS-based inter-domain routing scheme in a high speed wide area network
    • Apr.
    • S. H. Kim, K. Lim, and C. Kim, "A scalable QoS-based inter-domain routing scheme in a high speed wide area network," Comput. Commun., vol. 21, pp. 390-399, Apr. 1998.
    • (1998) Comput. Commun. , vol.21 , pp. 390-399
    • Kim, S.H.1    Lim, K.2    Kim, C.3
  • 14
    • 0033349052 scopus 로고    scopus 로고
    • On the distribution of routing computation in hierarchical ATM networks
    • Dec.
    • E. Felstaine and R. Cohen, "On the distribution of routing computation in hierarchical ATM networks," IEEE/ACM Trans. Net., vol. 7, no. 6, pp. 906-916, Dec. 1999.
    • (1999) IEEE/ACM Trans. Net. , vol.7 , Issue.6 , pp. 906-916
    • Felstaine, E.1    Cohen, R.2
  • 15
    • 0033901086 scopus 로고    scopus 로고
    • On scalable QoS routing: Performance evaluation of topology aggregation
    • F. Hao and E. Zegura, "On scalable QoS routing: performance evaluation of topology aggregation," in Proc. IEEE INFOCOM, Mar. 2000, pp. 147-156.
    • Proc. IEEE INFOCOM, Mar. 2000 , pp. 147-156
    • Hao, F.1    Zegura, E.2
  • 17
    • 0026866306 scopus 로고
    • Ergodic discretized estimator learning automata with high accuracy and high adaptation rate for nonstationary environments
    • May
    • A. V. Vasilakos and G. Papadimitriou, "Ergodic discretized estimator learning automata with high accuracy and high adaptation rate for nonstationary environments," Neurocomput., vol. 4, pp. 181-196, May 1992.
    • (1992) Neurocomput. , vol.4 , pp. 181-196
    • Vasilakos, A.V.1    Papadimitriou, G.2
  • 18
    • 0242292645 scopus 로고    scopus 로고
    • On the use of a stochastic estimator learning algorithm to the ATM routing problem: A methodology
    • A. F. Atlasis, M. P. Saltouros, and A. V. Vasilakos, "On the use of a stochastic estimator learning algorithm to the ATM routing problem: A methodology," in Proc. IEEE GLOBECOM, Dec. 1998.
    • Proc. IEEE GLOBECOM, Dec. 1998
    • Atlasis, A.F.1    Saltouros, M.P.2    Vasilakos, A.V.3
  • 19
    • 0242387214 scopus 로고    scopus 로고
    • The use of learning algorithms in ATM networks call admission control problem: A methodology
    • Amsterdam, North Holland, The Netherlands
    • A. F. Atlasis, A. V. Vasilakos, and N. H. Loukas, "The use of learning algorithms in ATM networks call admission control problem: A methodology," in Computer Networks Amsterdam, North Holland, The Netherlands.
    • Computer Networks
    • Atlasis, A.F.1    Vasilakos, A.V.2    Loukas, N.H.3
  • 28
    • 0026225346 scopus 로고
    • Equivalent capacity and its application to bandwidth allocation in high-speed networks
    • Sept.
    • R. Guerin, H. Ahmadi, and M. Naghshineh, "Equivalent capacity and its application to bandwidth allocation in high-speed networks," IEEE J. Select. Areas Commun., vol. 9, pp. 968-981, Sept. 1991.
    • (1991) IEEE J. Select. Areas Commun. , vol.9 , pp. 968-981
    • Guerin, R.1    Ahmadi, H.2    Naghshineh, M.3
  • 29
    • 0020191755 scopus 로고
    • Stochastic theory of a data-handling system with multiple sources
    • Oct.
    • D. Anick, D. Mitra, and M. M. Sondhi, "Stochastic theory of a data-handling system with multiple sources," Bell Syst. Tech. J., vol 61, pp. 1871-1894, Oct. 1982.
    • (1982) Bell Syst. Tech. J. , vol.61 , pp. 1871-1894
    • Anick, D.1    Mitra, D.2    Sondhi, M.M.3
  • 30
    • 0031372634 scopus 로고    scopus 로고
    • A performance comparison of competitive on-line routing and state-dependent routing
    • L. Zhang, M. Andrews, S. Bhatt, and K. Krishnan, "A performance comparison of competitive on-line routing and state-dependent routing," in Proc. IEEE GLOBECOM, 1997, pp. 1813-1819.
    • Proc. IEEE GLOBECOM, 1997 , pp. 1813-1819
    • Zhang, L.1    Andrews, M.2    Bhatt, S.3    Krishnan, K.4
  • 34
    • 0029278149 scopus 로고
    • A new approach learning automata: Stochastic estimator learning algorithms
    • A. Vasilakos and G. Papadimitriou, "A new approach learning automata: Stochastic Estimator Learning Algorithms," in Neurocomputing, 1995, vol. 7, pp. 275-297.
    • (1995) Neurocomputing , vol.7 , pp. 275-297
    • Vasilakos, A.1    Papadimitriou, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.