Port partitioning and dynamic queueing for IP forwarding

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 528
  • Download : 390
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.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2002-08
Language
English
Article Type
Article
Citation

COMPUTERS OPERATIONS RESEARCH, v.29, no.9, pp.1157 - 1172

ISSN
0305-0548
DOI
10.1016/S0305-0548(01)00022-3
URI
http://hdl.handle.net/10203/7243
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0