CONGESTION CONTROL SCHEME BASED ON TRAFFIC PRIORITY IN COMPUTER NETWORKS WITH FINITE NODAL BUFFER.

Ruttikorn Varakulsiripunth, Norio Shiratori, Shoichi Noguchi

    研究成果: Article査読

    1 被引用数 (Scopus)

    抄録

    Store-and-forward communication networks with no effective means of flow control are subject to congestion under heavy load conditions. In this paper a distributed congestion control policy, called PF-C, with nodal buffer management strategy based on traffic priorities is proposed and analyzed. The limited number of buffers (limit value) at any node to be occupied by each class of packets are assigned. The mechanism of this policy is that a packet which arrived at a given node is rejected if the total number of allocated buffers exceeds a limit value corresponding to its class. Rejected packets are dropped from the network and considered as lost. This policy is analyzed in the context of symmetrical networks, whereby a queueing model is developed.

    本文言語English
    ページ(範囲)279-286
    ページ数8
    ジャーナルTransactions of the Institute of Electronics and Communication Engineers of Japan. Section E
    E67
    5
    出版ステータスPublished - 1984 5

    ASJC Scopus subject areas

    • Engineering(all)

    フィンガープリント 「CONGESTION CONTROL SCHEME BASED ON TRAFFIC PRIORITY IN COMPUTER NETWORKS WITH FINITE NODAL BUFFER.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル