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

Ruttikorn Varakulsiripunth, Norio Shiratori, Shoichi Noguchi

    Research output: Contribution to journalArticle

    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

    Fingerprint

    Computer networks
    Flow control
    Telecommunication networks

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    CONGESTION CONTROL SCHEME BASED ON TRAFFIC PRIORITY IN COMPUTER NETWORKS WITH FINITE NODAL BUFFER. / Varakulsiripunth, Ruttikorn; Shiratori, Norio; Noguchi, Shoichi.

    In: Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, Vol. E67, No. 5, 05.1984, p. 279-286.

    Research output: Contribution to journalArticle

    @article{17049ec6ad6741d5861dfce410a5e0cb,
    title = "CONGESTION CONTROL SCHEME BASED ON TRAFFIC PRIORITY IN COMPUTER NETWORKS WITH FINITE NODAL BUFFER.",
    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.",
    author = "Ruttikorn Varakulsiripunth and Norio Shiratori and Shoichi Noguchi",
    year = "1984",
    month = "5",
    language = "English",
    volume = "E67",
    pages = "279--286",
    journal = "Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E",
    issn = "0387-236X",
    number = "5",

    }

    TY - JOUR

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

    AU - Varakulsiripunth, Ruttikorn

    AU - Shiratori, Norio

    AU - Noguchi, Shoichi

    PY - 1984/5

    Y1 - 1984/5

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0021425621&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0021425621&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0021425621

    VL - E67

    SP - 279

    EP - 286

    JO - Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E

    JF - Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E

    SN - 0387-236X

    IS - 5

    ER -