DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Chae Young | ko |
dc.contributor.author | Cho, HK | ko |
dc.date.accessioned | 2008-09-01T01:16:50Z | - |
dc.date.available | 2008-09-01T01:16:50Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2002-08 | - |
dc.identifier.citation | COMPUTERS OPERATIONS RESEARCH, v.29, no.9, pp.1157 - 1172 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7243 | - |
dc.description.abstract | With the increase of internet protocol (IP) packets the performance of routers became an important issue in internet/working. In this paper we examine the matching algorithm in gigabit router which has input queue with virtual output queueing. Dynamic queue scheduling is also proposed to reduce the packet delay and packet loss probability. Port partitioning is employed to reduce the computational burden of the scheduler in a switch which matches the input and output ports for fast packet switching. Each port is divided into two groups such that the matching algorithm is implemented within each pair of groups in parallel. The matching is performed by exchanging the pair of groups at every time slot. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. In dynamic queue scheduling, a popup decision rule for each delay critical packet is made to reduce both the delay of the delay critical packet and the loss probability of loss critical packet. Computational results show that MMPP has the lowest delay and requires the least buffer size. The throughput is illustrated to be linear to the packet arrival rate. which can be achieved under highly efficient matching algorithm. The dynamic queue scheduling is illustrated to be highly effective when the occupancy of the input buffer is relatively high. | - |
dc.description.sponsorship | This research was supported by the fund from Electronics and Telecommunications Research Institute. | en |
dc.language | English | - |
dc.language.iso | en | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Port partitioning and dynamic queueing for IP forwarding | - |
dc.type | Article | - |
dc.identifier.wosid | 000176237300004 | - |
dc.identifier.scopusid | 2-s2.0-0036680955 | - |
dc.type.rims | ART | - |
dc.citation.volume | 29 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 1157 | - |
dc.citation.endingpage | 1172 | - |
dc.citation.publicationname | COMPUTERS OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/S0305-0548(01)00022-3 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Lee, Chae Young | - |
dc.contributor.nonIdAuthor | Cho, HK | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | IP-forwarding | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | switch | - |
dc.subject.keywordAuthor | dynamic-queueing | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.