Network congestion avoidance through probabilistic packet injection scheduling based on mixed minimax strategy네트워크 혼잡 회피를 위한 추정손실 최소화 전략에 기반한 확률적 패킷 전송 스케쥴링

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 613
  • Download : 0
Tree-saturation in lossless network significantly degrades network throughput. In this paper, we propose Probabilistic Packet Injection Scheduling Protocol (PPISP), a congestion control mechanism in large-scale systems based on probabilistic injection to avoid hot-spot traffic. PPISP incorporates mixed minimax strategy, in game theory, to dynamically adjust packet injection probability. Using queuing delay at network buffer, PPISP detect congestion created at network and estimates the number of sources competing at congested channel to verify how many players exists in the game. Our simulation result showed that PPISP achieves 31\% improvement in throughput on hot-spot traffic pattern. Moreover, PPISP stabilizes network performance of background Uniform Random traffic on multiple hot-spot traffic pattern.
Advisors
Kim, Dong-Junresearcher김동준
Description
한국과학기술원 : 웹사이언스공학전공,
Publisher
한국과학기술원
Issue Date
2014
Identifier
569160/325007  / 020114286
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 웹사이언스공학전공, 2014.2, [ iv, 25 p. ]

Keywords

tree saturation; 혼잡 회피; congestion avoidance; 트리형 포화

URI
http://hdl.handle.net/10203/197106
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=569160&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0