메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2155-2160

Evolutionary routing-path selection in congested communication networks

Author keywords

Evolutionary algorithm; Fairness relation; Maxmin fairness; Network congestion; Networking

Indexed keywords

COMMUNICATION NETWORKS; CONGESTION AVOIDANCE; CROSS-OVER; EVOLUTIONARY APPROACH; GENERAL APPROACH; GRAPH STRUCTURES; LINK-SHARING; MAX-MIN FAIRNESS; MUTATION OPERATORS; NETWORK CONGESTIONS; NETWORK TRAFFIC; PATH SELECTION; PATH SELECTION STRATEGIES; PATH SET; SINGLE PATH; SMALL POPULATION;

EID: 74849110544     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2009.5346274     Document Type: Conference Paper
Times cited : (3)

References (8)
  • 2
    • 46149117518 scopus 로고    scopus 로고
    • Reducing congestion effects in wireless networks by multipath routing
    • Washington, DC, USA: IEEE Computer Society, Online, Available:, http://dx.doi.org/10.1109/ICNP.2006.320202
    • L. Popa, C. Raiciu, I. Stoica, and D. Rosenblum, "Reducing congestion effects in wireless networks by multipath routing," in ICNP '06: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols. Washington, DC, USA: IEEE Computer Society, 2006, pp. 96-105. [Online]. Available: http://dx.doi.org/http://dx.doi.org/10.1109/ICNP. 2006.320202
    • (2006) ICNP '06: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols , pp. 96-105
    • Popa, L.1    Raiciu, C.2    Stoica, I.3    Rosenblum, D.4
  • 3
    • 33645768772 scopus 로고    scopus 로고
    • Stability of end-to-end algorithms for joint routing and rate control
    • April
    • F. Kelly and T. Voice, "Stability of end-to-end algorithms for joint routing and rate control," ACM SIGCOMM Computer Communication Review, vol. 35, no. 2, pp. 5-12, April 2005.
    • (2005) ACM SIGCOMM Computer Communication Review , vol.35 , Issue.2 , pp. 5-12
    • Kelly, F.1    Voice, T.2
  • 4
    • 0034297878 scopus 로고    scopus 로고
    • Fair end-to-end window-based congestion control
    • October
    • J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. on Networking, vol. 8, no. 5, pp. 556-557, October 2000.
    • (2000) IEEE/ACM Trans. on Networking , vol.8 , Issue.5 , pp. 556-557
    • Mo, J.1    Walrand, J.2
  • 6
    • 0003794137 scopus 로고
    • Prentice-Hall, Englewood Cliffs, New Jersey
    • D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, Englewood Cliffs, New Jersey, 1992.
    • (1992) Data Networks
    • Bertsekas, D.1    Gallager, R.2
  • 7
    • 53849131686 scopus 로고    scopus 로고
    • M. Köppen, M. Tsuru, and Y. Oie, Evolutionary approach to maxmin-fair network-resource allocation, in Proceedings of The 2008 International Symposium on Applications and the Internet (SAINT 2008), SAINT08 Workshops, 2008.
    • M. Köppen, M. Tsuru, and Y. Oie, "Evolutionary approach to maxmin-fair network-resource allocation," in Proceedings of The 2008 International Symposium on Applications and the Internet (SAINT 2008), vol. SAINT08 Workshops, 2008.


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