메뉴 건너뛰기




Volumn , Issue , 2008, Pages 271-274

Learning minimum delay paths in service overlay networks

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE PROBING; SERVICE OVERLAY NETWORKS;

EID: 51749091958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2008.48     Document Type: Conference Paper
Times cited : (3)

References (13)
  • 2
    • 14944378851 scopus 로고    scopus 로고
    • Traffic matrix estimation on a large ip backbone: A comparison on real data
    • Oct
    • A. Gunnar, M. Johansson, and T. Telkamp. Traffic matrix estimation on a large ip backbone: a comparison on real data. Proc. IMC '04, Oct. 2004.
    • (2004) Proc. IMC '04
    • Gunnar, A.1    Johansson, M.2    Telkamp, T.3
  • 3
    • 51749105642 scopus 로고    scopus 로고
    • IETF. Rfc 2328: Ospf version 2. Apr. 1998
    • IETF. Rfc 2328: Ospf version 2. Apr. 1998.
  • 4
    • 51749106345 scopus 로고    scopus 로고
    • An algorithmic framework for discrete-time flowlevel simulation of data networks
    • Jun
    • L. Jansen, I. Gojmerac, M. Menth, P. Reichl, and P. Tran-Gia. An algorithmic framework for discrete-time flowlevel simulation of data networks. 20th ITC, Jun. 2007.
    • (2007) 20th ITC
    • Jansen, L.1    Gojmerac, I.2    Menth, M.3    Reichl, P.4    Tran-Gia, P.5
  • 5
    • 0030105021 scopus 로고    scopus 로고
    • H. Kushner and F. Vázquez-Abad. Stochastic approximation methods for systems of interest over an infinite time horizon. SlAM J. on Control and Optim, (2):712-756, Oct. 1996.
    • H. Kushner and F. Vázquez-Abad. Stochastic approximation methods for systems of interest over an infinite time horizon. SlAM J. on Control and Optim, (2):712-756, Oct. 1996.
  • 6
    • 51749085567 scopus 로고    scopus 로고
    • Learning minimum delay paths in service overlay networks
    • Tech. Report, ECE, McGill University, Mar
    • H. Li, L. Mason, and M. Rabbat. Learning minimum delay paths in service overlay networks. Tech. Report, ECE, McGill University, Mar. 2008.
    • (2008)
    • Li, H.1    Mason, L.2    Rabbat, M.3
  • 7
    • 0015672792 scopus 로고
    • An optimal learning algorithm for s-model environments
    • Oct
    • L. Mason. An optimal learning algorithm for s-model environments. IEEE Trans. Auto. Control, 18:493-6, Oct. 1973.
    • (1973) IEEE Trans. Auto. Control , vol.18 , pp. 493-496
    • Mason, L.1
  • 8
    • 0022083590 scopus 로고
    • Equilibrium flows, routing patterns and algorithms for store-and-forward networks
    • L. Mason. Equilibrium flows, routing patterns and algorithms for store-and-forward networks. Large Scale Systems, 8:187-209, 1985.
    • (1985) Large Scale Systems , vol.8 , pp. 187-209
    • Mason, L.1
  • 9
    • 29144444595 scopus 로고    scopus 로고
    • Dynamic algorithms for the shortest path routing problem: Learning automata-based solutions
    • Dec
    • S. Misra and B. Oommen. Dynamic algorithms for the shortest path routing problem: Learning automata-based solutions. IEEE trans. Sys. Man, and Cyb. part B: cyb., (6), Dec. 2005.
    • (2005) IEEE trans. Sys. Man, and Cyb. part B: Cyb , vol.6
    • Misra, S.1    Oommen, B.2
  • 10
    • 0029358766 scopus 로고
    • On the use of fractional brownian motion in the theory of connectionless networks
    • Aug
    • I. Norros. On the use of fractional brownian motion in the theory of connectionless networks. IEEE JSAC, 13(6), Aug. 1995.
    • (1995) IEEE JSAC , vol.13 , Issue.6
    • Norros, I.1
  • 13
    • 28044444577 scopus 로고    scopus 로고
    • M. Zhang, Y.and Roughan, C. Lund, and D. Donoho. Estimating point-to-point and point-to-multipoint traffic matrices: An information- theoretic approach. ACM/IEEE Trans. Networking, (5):947-960, Oct. 2005.
    • M. Zhang, Y.and Roughan, C. Lund, and D. Donoho. Estimating point-to-point and point-to-multipoint traffic matrices: An information- theoretic approach. ACM/IEEE Trans. Networking, (5):947-960, Oct. 2005.


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