메뉴 건너뛰기




Volumn 349, Issue 1-2, 2005, Pages 329-348

Reinforcement learning for congestion-avoidance in packet flow

Author keywords

Computer network; Congestion control; Mean field approximation; Packet flow; Reinforcement learning; Scale free network; Small world network

Indexed keywords

APPROXIMATION THEORY; COMPUTER NETWORKS; FRACTALS; NEURAL NETWORKS; PROBLEM SOLVING; REINFORCEMENT; TOPOLOGY;

EID: 12344309100     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2004.10.015     Document Type: Article
Times cited : (11)

References (17)
  • 2
    • 0004141908 scopus 로고    scopus 로고
    • third ed. Prentice-Hall Englewood Cliffs, NJ
    • A.S. Tanenbaum Computer Networks third ed. 1998 Prentice-Hall Englewood Cliffs, NJ
    • (1998) Computer Networks
    • Tanenbaum, A.S.1


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