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

Ruttikorn Varakulsiripunth, Norio Shiratori, Shoichi Noguchi

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)279-286
    Number of pages8
    JournalTransactions of the Institute of Electronics and Communication Engineers of Japan. Section E
    VolumeE67
    Issue number5
    Publication statusPublished - 1984 May

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint Dive into the research topics of 'CONGESTION CONTROL SCHEME BASED ON TRAFFIC PRIORITY IN COMPUTER NETWORKS WITH FINITE NODAL BUFFER.'. Together they form a unique fingerprint.

    Cite this