Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation

碩士 === 國立中山大學 === 資訊工程研究所 === 84 === Asynchronous Transfer Mode (ATM) can support both circuit switching and packet switching. Due to the advance of multiplexing technology and switching technology, different traffic sources with different...

Full description

Bibliographic Details
Main Authors: Shiu, Duan-ruei, 徐端瑞
Other Authors: Lai, Wei-kuang
Format: Others
Language:zh-TW
Published: 1996
Online Access:http://ndltd.ncl.edu.tw/handle/89993626625768141327
id ndltd-TW-084NSYSU392004
record_format oai_dc
spelling ndltd-TW-084NSYSU3920042015-10-13T14:34:58Z http://ndltd.ncl.edu.tw/handle/89993626625768141327 Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation 公平可靠的逐站流量控制加上有效的緩衝區配置 Shiu, Duan-ruei 徐端瑞 碩士 國立中山大學 資訊工程研究所 84 Asynchronous Transfer Mode (ATM) can support both circuit switching and packet switching. Due to the advance of multiplexing technology and switching technology, different traffic sources with different Quality of Service(QoS) requirements can be transmitted in a network. However, without adequete flow control mechanisms, congestion could happen. This will reduce total network throughputs and increase data loss rates. Among all service types, ABR (available Bit Rate) is used primarly for transferring data files. Data files are sensitive to loss and thus flow control is required. In this paper, we adopt a hop-by-hop credit-based flow control scheme to satisfy the characteristics of ABR traffics. In order to efficiently utilize buffer spaces, receiver-oriented adaptive buffer allocation is considered in our scheme. Besides, we introduce the concept of request cell to let senders request credits needed from receivers. Results show zero cell loss, high bandwidth utilization, reliable transfer, and fair sharing of available bandwidth are achived. Lai, Wei-kuang 賴威光 1996 學位論文 ; thesis 51 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立中山大學 === 資訊工程研究所 === 84 === Asynchronous Transfer Mode (ATM) can support both circuit switching and packet switching. Due to the advance of multiplexing technology and switching technology, different traffic sources with different Quality of Service(QoS) requirements can be transmitted in a network. However, without adequete flow control mechanisms, congestion could happen. This will reduce total network throughputs and increase data loss rates. Among all service types, ABR (available Bit Rate) is used primarly for transferring data files. Data files are sensitive to loss and thus flow control is required. In this paper, we adopt a hop-by-hop credit-based flow control scheme to satisfy the characteristics of ABR traffics. In order to efficiently utilize buffer spaces, receiver-oriented adaptive buffer allocation is considered in our scheme. Besides, we introduce the concept of request cell to let senders request credits needed from receivers. Results show zero cell loss, high bandwidth utilization, reliable transfer, and fair sharing of available bandwidth are achived.
author2 Lai, Wei-kuang
author_facet Lai, Wei-kuang
Shiu, Duan-ruei
徐端瑞
author Shiu, Duan-ruei
徐端瑞
spellingShingle Shiu, Duan-ruei
徐端瑞
Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
author_sort Shiu, Duan-ruei
title Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
title_short Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
title_full Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
title_fullStr Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
title_full_unstemmed Fair and Reliable Hop-by-Hop Flow Control with Efficient Buffer Allocation
title_sort fair and reliable hop-by-hop flow control with efficient buffer allocation
publishDate 1996
url http://ndltd.ncl.edu.tw/handle/89993626625768141327
work_keys_str_mv AT shiuduanruei fairandreliablehopbyhopflowcontrolwithefficientbufferallocation
AT xúduānruì fairandreliablehopbyhopflowcontrolwithefficientbufferallocation
AT shiuduanruei gōngpíngkěkàodezhúzhànliúliàngkòngzhìjiāshàngyǒuxiàodehuǎnchōngqūpèizhì
AT xúduānruì gōngpíngkěkàodezhúzhànliúliàngkòngzhìjiāshàngyǒuxiàodehuǎnchōngqūpèizhì
_version_ 1717754153442213888