메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Specification of network services and mapping algorithms

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; HEURISTIC METHODS; NETWORK MANAGEMENT; PROBLEM SOLVING; RESOURCE ALLOCATION;

EID: 35148875023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2006.302144     Document Type: Conference Paper
Times cited : (1)

References (17)
  • 1
    • 33846012075 scopus 로고
    • A. Aho, R. Sethi, and J. Ullman, Compilers, Addison-Wesley
    • A. Aho, R. Sethi, and J. Ullman, Compilers - Principle, Techniques and Tools. Addison-Wesley, 1986.
    • (1986) Principle, Techniques and Tools
  • 2
    • 0031997974 scopus 로고    scopus 로고
    • A note on the complexity of dijkstra's algorithm for graphs with weighted vertices
    • M. Barbehenn, "A note on the complexity of dijkstra's algorithm for graphs with weighted vertices." IEEE Trans. Comput., vol. 47. no. 2, 1998.
    • (1998) IEEE Trans. Comput , vol.47 , Issue.2
    • Barbehenn, M.1
  • 4
    • 0038646660 scopus 로고    scopus 로고
    • Configuring Sessions in Programmable Networks with Capacity Constraints
    • May
    • S. Choi and J. Turner, "Configuring Sessions in Programmable Networks with Capacity Constraints," in Proc. of IEEE ICC, May 2003.
    • (2003) Proc. of IEEE , vol.199
    • Choi, S.1    Turner, J.2
  • 5
  • 7
    • 0002906463 scopus 로고    scopus 로고
    • Router Plugins: A Software Architecture for Next Generation Routers
    • Vancouver, British Columbia, Canada: ACM Press, New York, NY, USA, Sep
    • D. Decasper, Z. Dittia, G. Parulkar, and B. Plattner, "Router Plugins: A Software Architecture for Next Generation Routers," in Proc. of the ACM SIGCOMM'98 Conf. Vancouver, British Columbia, Canada: ACM Press, New York, NY, USA, Sep. 1998.
    • (1998) Proc. of the ACM SIGCOMM'98 Conf
    • Decasper, D.1    Dittia, Z.2    Parulkar, G.3    Plattner, B.4
  • 8
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connexion with Graphs
    • E. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, 1959.
    • (1959) Numerische Mathematik , vol.1
    • Dijkstra, E.1
  • 10
    • 0000485646 scopus 로고
    • An introduction to randomized algorithms
    • Nov
    • R. M. Karp, "An introduction to randomized algorithms," Discrete Applied Mathematics, vol. 34, no. 1-3, pp. 165-201, Nov. 1991.
    • (1991) Discrete Applied Mathematics , vol.34 , Issue.1-3 , pp. 165-201
    • Karp, R.M.1
  • 12
    • 0040291388 scopus 로고    scopus 로고
    • E. Kohler, R. Morris, B. Chen, J. Jannotti, M. Kaashoek, and C. Modular, The Click Modular Router, ACM Transactions on Computer Systems, 18(3), Aug. 2000.
    • E. Kohler, R. Morris, B. Chen, J. Jannotti, M. Kaashoek, and C. Modular, "The Click Modular Router," ACM Transactions on Computer Systems, vol. 18(3), Aug. 2000.
  • 16
    • 0030246198 scopus 로고    scopus 로고
    • Quality of Service Routing for Supporting Multimedia Applications
    • Institute of Electrical and Electronics Engineers, Sept
    • Z. Wang and J. Crowcroft, "Quality of Service Routing for Supporting Multimedia Applications," in JSAC, vol. 14. Institute of Electrical and Electronics Engineers, Sept. 1996.
    • (1996) JSAC , vol.14
    • Wang, Z.1    Crowcroft, J.2


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