• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.61-68
• /
• 2003

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2292-2302
• /
• 1997

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and maximizing channel utilization. In PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme has to be performed for loss sensitive data packet, and so data packets can get their quality of service. Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. But in service aspects, if a fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency. So in this study, the terminal which wants to request for ABR tyupe service, acquires a minimum bandwidth from system for thefirst time. If the system has extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol cansupporty the data service with loss sensitivity and maintain their channel utilization high. Also high priority services like voice can be satisfied with their QoS by APRMA.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2000.11a
• /
• pp.463-470
• /
• 2000

In this paper, we describe a wireless MAC protocol named APRMA(Abitrary Period Reservation Multiple Access), which is capable of supporting the ABR type data service and maximizing channel utilization. In original PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the. time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, so data packets can get their quality of service. The aspects of service, if fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency So in this study, the terminal which wants to request for ABR type service, acquires a minimum bandwidth from system for the first time. If the system have extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization highly. Also high Priority services like voice can be satisfied with their QoS by APRMA.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.140-147
• /
• 1999

ABR uses the extra network resource more efficiently which uses not the guaranteed service in ATM and supports the best effort which the characteristics of application is bursty and maximum transfer rate is high. Switches for using ABR flow control differentiate EFCI switches (which supply only the congestion state information) from ER switches (which supply fair rate to source). This paper analyses the switches operation technique for efficiently managing ABR traffic in case which the network mixes EFCI switches and ER switches in ATM.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.95-98
• /
• 1998

In this paper, we propose a cell scheduling algorithm for ABR traffic in ATM multiplexer. Proposed Algorithm can support ABR service more efficiently than existing WRR and DWRR algorithm. We evaluate the performances of proposed algorithm through computer simulation. Also, we model the VBR and the ABR traffics as ON/OFF source, and the CBR traffic as a Poisson source. And the simulation shows that proposed algorithm better performance over other cell scheduling algorithm in tem of mean cell delay time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3002-3010
• /
• 2000

ATM forum defined several ATM oriented services such as ABR, VBR, CBR, UBR, and others. Among them, ABR service is considered as one of the most appropriate ones in the LAN environment. ABR controls network traffic by using RM cells according to ATM forum standard. In particular, the point-to-multipoint ABR service in general uses consolidation algorithms to solve feedback implosion at the branch point. Consolidation algorithms alleviate propagation delay and network congestion problem: thus, the efficiency of consolidation algorithm is closely related to the network performance. In this paper, we describe the limitation of existing consolidation algorithms based on thorough analysis, and then propose an algorithm that performs better than the existing algorithms. We show that the proposed algorithm improves network performance through a parametric simulation, In our simulation the performance measure is the cell rate which is controlled by exploiting the congestion depth. We also found that the proposed algorithm not only improves efficiency of network, but also eliminates the consolidation noise.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.148-158
• /
• 1999

ABR traffic form ATM LAN is controlled through RM cell, and the interface function to public ATM network is necessary to provide ABR service efficiently. This paper presnets new interface architecture, which is based on "Projected Node" [6]. using AIPU(ABR Interface Proxy Unit) to support ABR traffic streams incoming from ATM LAN in the public ATM network. For the efficient interworking, the AIPU has designed for interworking functions with ERICA switch mechanism. Conventional ERICA switch mechanism specified in TM 4.0 is basically used for short distance comparative to public network, however AIPU adopts the novel control mechanism to cover logng roud trip time (RTT). To improve the problems and to provide a dynamic range of UCI(Update Count Interval), this paper proposes, a novel control scheme, DUCI ( Dynamic Update Count Interval. And the paper shows inefficiencies of ERICA mechanism with fixed UCI through the simulation results, and represents the performance enhancement of DUCI mechanism developed to adjust the update count interval dynamically.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.28-34
• /
• 1998

In ATM networks CBR data traffic is sent in constant bit rate, and VBR data traffic in variable bit rate. Therefore unused bandwidth at network capacity may exist. To avoid waste of network resourcesm, ABR traffic utilizes the unused bandwidth to the utmost after CBR and VBR data traffic being first served. In this paper, a transfer rate-based congestion control algorithm is proposed for efficient ABR service in ATM networks. In the proposed algorithm the ATM switch first calculates bandwidth according to variable cell transfer rate in an ABR source. records this value in ER field in a RM cell, and then transmits a RM Cell to an ABR source. In this way the proposed algorithm dynamically allocates bandwidth to each ABR source, and the switch also can rapidly adapt to a change of a transfer rate of an source. The performance simulation of the proposed algorithm has batter performance in terms of source condition and link utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1208-1221
• /
• 1998

We survey several issues for implementing the end-to-end flow control function for ABR service and propose a structure for implementation. In the proposed design, control parameters are calculated and maneuvered by software for easy implementation and efficiency adaptbility for the changes of parameters while the cells are emitted at the rate according to the allowed cell rate with the hardware implementation for real time processing. The proposed structure can cope with the changes of the specifications including the calculation of the control parameters and their application. Hence, the structure is expected to contribute to providing the ABR serice in the future ATM networks.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1880-1893
• /
• 1996

In this paper, we propose the fuzzy traffic control method in ABR service for the effective use of ATM link. This method, a modified version of EPRCA which is one of rate control methods in ABR service, controls the values of the transmission rates of source by using the fuzzy traffic inference based on switch buffer size and buffer variate rate. For this method, we developed a model and algorithm of the fuzzy traffic control method and a fuzzy traffic controller, after studying fuzzy and neural networks which applied to ATM traffic control and EPRCA. For the fuzzy traffic controller, we also designed a membership function, fuzzy control rules and a max-min inferencing method. We conducted a simulation and compared the link utilization of the fuzzy traffic control method with that of the EPRCA method. The results of the simulation indicated that, compared to EPRCA, the fuzzy traffic control method improves the link utilization by 2.3% in a normal distribution model and by 2.7% in the MMPP model of the source.