• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.21-24
• /
• 2000

End-to-end congestion control mechanism have been critical to the robustness and stability of the Internet. Most of today's Internet traffic is TCP, and we expect this to remain so in the future. TCP/IP is the intermediate transport layer candidate for today's applications. TCP uses an adaptive window-based flow control. The congestion avoidance and control algorithms deployed by TCP aims at using the available network bandwidth. This paper compares different congestion control policies, and proposes the new design mechanism for future public networks

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.312-320
• /
• 2003

Recently there is a growing interest in mobile cellular network providing multimedia service. However, the link bandwidth of mobile cellular network is not sufficient enough to provide satisfactory services to users. To overcome this problem, an adaptive framework has been proposed. In this study, we propose a new method of estimating DPR(Degradation Period Ratio) in an adaptive multimedia network where the bandwidth of ongoing call can be dynamically adjusted during its lifetime. DPR is a QoS(Quality of Service) parameter which represents the ratio of allocated bandwidth below a pre-defined target to the whole service time of a call. We improve estimation method of DPR using DTMC(Discrete Time Markov Chain) model by calculate mean degradation period, degradation probability more precisely than in existing studies. Under Threshold CAC(Call Admission Control) algorithm, we present analytically how to guarantee QoS to users and illustrate the method by numerical examples. The proposed method is expected to be used as one of CAC schemes in guaranteeing predefined QoS level of DPR.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.81-86
• /
• 2007

New multimedia services over the cellular/WLAN overlay networks require different Quality of Service (QoS). Therefore, efficient network management system is necessary in order to provide QoS sensitive multimedia services while enhancing network performance. In this paper, we propose a new online network management scheme that implements bandwidth reservation, congestion and transmission control strategies. Our online approach to network management exhibits dynamic adaptability, flexibility, and responsiveness to the current traffic conditions in multimedia overlay networks. Simulation results indicate the superior performance of our proposed scheme to strike the appropriate performance balance between contradictory QoS requirements under widely varying diverse traffic loads.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.379-385
• /
• 2023

Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.941-950
• /
• 2001

In this paper, we present the integrated network architecture for supporting mobile IP in third generation mobile communication networks, and propose the end-to-end QoS control mechanisms of DiffServ and QoS control functions of each network element in the proposed network. First, the QoS supporting schemes of IMT-2000 are described. Second, the necessities of integrating the networks are discussed and the integrated architecture are proposed. Third, the mapping between wireless channels and DiffServ classes are presented. Finally, the end-to-end QoS control mechanisms are proposed. We also analyze the link level protocols with QoS provisioning for mobile multimedia assuming that the system support voice and data traffic simultaneously. In case of data traffic, the delay and throughput of SREJ ARQ and Type-1 Hybrid ARQ scheme are compared, and In case of voice traffic, the packet loss rate of BCH coding is analyzed according to the varying data traffic loads. The results indicate that the adaptive link level protocols are efficient to meet the QoS requirements while the complexities are increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.1067-1074
• /
• 2004

In the wireless mobile networks, it IS important to provide the quality-of-service (QoS) guarantees as they are increasingly expected to support the multimedia applications Although the QoS provisioning problem arises in the wire-line networks as well, the mobility of hosts and the scarcity of bandwidth make QoS provisioning a challenging task in wireless mobile networks. The resource allocation to multimedia applications of varying QoS reqUlrement 15 a complex issue. In this paper, we propose a new adaptive resource allocation scheme based on the concept of the resource reservation and the renegotiation in order to guarantee the QoS of the real-tune traffic. The proposed scheme is aimed at improving the perfonnance in terms of the new call blocking rate, the bandoff dropping rate, and the bandwIdth utilization.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.891-898
• /
• 2003

This paper analyzes and proposes a scheme that improves the performance of the RTP that is developed to support the end-to-end transmission function and QoS monitor function for real-time multimedia data transmission. Although the existing RTP module supports real-time transmission, it has some problems in guaranteeing QoS parameters. To solve this problem, we propose a new Selective Repeat Adaptive Rate Control (SRARC). The SRARC can support QoS by referring to the data transmission status from the client and then classifying the network status into three levels. It selectively transmits multimedia data and dynamically controls transmission rates based on such information as bandwidth, packet loss rate, and latency that can be calculated in data transfer phase. To verify the SRARC, we implement it in real local area networks and compare the QoS parameters of the SRARC with those of the SR and RTP By the experimental results, the SRARC shows better performance in the aspects of bandwidth usage rate, packet loss rates, and transmission delays than the existing RTP schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1367-1374
• /
• 2004

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11 MAC protocol. Enhanced distributed coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has e problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can Improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.