DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lim, Jong-Tae | - |
dc.contributor.advisor | 임종태 | - |
dc.contributor.author | Son, Jun-Won | - |
dc.contributor.author | 손준원 | - |
dc.date.accessioned | 2011-12-14T01:49:47Z | - |
dc.date.available | 2011-12-14T01:49:47Z | - |
dc.date.issued | 2002 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=174073&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/37543 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학전공, 2002.2, [ vi, 52 p. ] | - |
dc.description.abstract | When too many users send data too high rate at once, the queue of router will overflow and data will be dropped. Such a situation is called congestion and an algorithm to solve congestion is called a congestion control. Current internet uses Tahoe and Reno of TCP(Transmission Control Protocol) to solve congestion problem. However, since they cannot get network information directly from network, they have global synchronization, bias to longer rtt(round trip time) and unfairness. To solve those problems, we introduce DS (Differentiated Service) network and think that edge router of DS network can send network information to sender. So, we can do network-assisted congestion control, and problems of Tahoe/Reno can be solved. In this thesis, we propose a congestion control algorithm with assistant of edge router. We mathematically analyze our algorithm and verify the result by simulation. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | congestion control | - |
dc.subject | 혼잡제어 | - |
dc.title | (A) study on congestion control algorithm using edge router in differentiated service | - |
dc.title.alternative | 차등서비스의 경계 라우터를 이용한 혼잡제어기법의 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 174073/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 020003248 | - |
dc.contributor.localauthor | Lim, Jong-Tae | - |
dc.contributor.localauthor | 임종태 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.