• Title/Summary/Keyword: 지연 한계 보장

Search Result 41, Processing Time 0.026 seconds

Congestion Control Scheme for Multimedia Streaming Service in Broadband Wireless Networks (광대역 무선 네트워크에서 멀티미디어 스트리밍 서비스를 위한 혼잡 제어 기법)

  • Lee, Eun-Jae;Chung, Kwang-Sue
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2553-2562
    • /
    • 2013
  • It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.

Dynamic Slot Allocation Algorithm for Efficient Transmission of VBR Services in Wireless ATM Networks (무선 ATM 망에서 VBR 서비스의 효율적인 전송을 위한 동적 슬롯 할당 알고리즘)

  • Ahn, Kye-Hyun;Park, Byoung-Joo;Baek, Seung-Kwon;Kim, Eung-Bae;Kim, Young-Chon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.11
    • /
    • pp.30-40
    • /
    • 2001
  • In this paper, we propose a dynamic slot allocation algorithm for efficient transmission of VBR services in wireless ATM networks. The proposed algorithm is based on a hybrid dynamic parameter(DP) control which combines the strength of in-band control and out-of-band control by considering the variation characteristics of buffer length in distributed mobile terminals. This algorithm consists of four sub-algorithms: dynamic parameter determination algorithm, dynamic parameter transmission algorithm, estimation algorithm of the number of request slots, and prorated-allocation algorithm. As the proposed allocation algorithm based on the hybrid DP control scheme can offer nearly precise MAC level estimations of the requirements for each VBR, the algorithm makes it possible to obtain ideal allocation efficiency. The allocation efficiency of the algorithm is shown by numerical analysis. Simulation results show that the proposed algorithm has better performance than conventional schemes in terms of allocation efficiency, delay and cell loss ratio under VBR traffic.

  • PDF

Scheduling Scheme for Guaranteeing High Quality of Service in 10G EPON (10G EPON에서 높은 QoS를 보장하는 스캐줄링 방법)

  • Jun, Jae-Hyun;Jung, Min-Suk;Kim, Min-Jun;Choi, Yong-Do;Kim, Sung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.351-355
    • /
    • 2010
  • The service which is required wide bandwidth is growing in these days, so building up High Speed communication system is being required. The Task Force team of IEEE 802.3ah set the EPON as a standard; next generation subscriber access network. For offering a high quality service, 10G EPON that is changed from 1Gbps uplink downlink bandwidth to 10Gbps is come up. Although Kramer had studied 10G EPON there was a QoS limitation, when load is low, End-to-End maximum delay is increased. This paper is suggesting time synch ronization method, resource reservation method, band width allocation method. We confirmed that 10EPON was able to offer quality service by the result of the OPNET.

Congestion Control Scheme for Efficient Multimedia Transmission in Broadband Wireless Networks (광대역 무선 네트워크에서 효율적인 멀티미디어 전송을 위한 혼잡 제어 기법)

  • Lee, Eunjae;Chung, Kwangsue
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1599-1609
    • /
    • 2014
  • TCP does not ensure the bandwidth and delay bound required for multimedia streaming services in broadband wireless network environments. In this paper, we propose a new congestion control scheme for efficient multimedia transmission, called COLO TCP (Concave Increase Slow Start Logarithmic Increase Congestion Avoidance TCP). The COLO TCP prevents the burst packet loss by applying the concave increase algorithm in slow start phase. In the congestion avoidance phase, COLO TCP uses the logarithmic increase algorithm that quickly recovers congestion window after packet loss. To highly utilize network bandwidth and reduce packet loss ratio, COLO TCP uses additive increase algorithm and adaptive decrease algorithm. Through simulation results, we prove that our COLO TCP is more robust for random loss. It is also possible for efficient multimedia transmission.

Power-Efficient Broadcasting Scheme for Mobile VOD System (모바일 VOD 시스템의 전력효율을 감안한 브로드캐스팅 기법)

  • Choi, Young;Choi, Hwang-Kyu
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.612-622
    • /
    • 2007
  • As compared with wired network environment, mobile VOD service in wireless network environment is difficult to guarantee the quality of VOD service due to the limitation of the system resources. Moreover, the wireless network has small bandwidth resources and short access range so that has limitations for providing the service to a large number of mobile clients. The limited battery capacity of a mobile device becomes an obstacle to mobile clients for enjoying VOD service for a long time. Therefore, these drawbacks should be considered in developing mobile VOD applications. This paper proposes a new technique for improving QoS of mobile VOD service by jointly use of broadcasting technique, which can provide VOD service to a large number of mobile clients simultaneously, and bursty communication technique, which can reduce the power consumption of a mobile device. With having these two techniques, streaming data are divided into segments, each of which is grouped into a particular packet and then transmitted at a time in the busty communication manner. In the performance evaluation, the power consumption on WNIC of a mobile device can be reduced by over 80%, and the initial service delay can be reduced in proportion to the number of channels compared with the existing staggered broadcasting technique.

  • PDF

Evaluation and Comparative Analysis of Scalability and Fault Tolerance for Practical Byzantine Fault Tolerant based Blockchain (프랙티컬 비잔틴 장애 허용 기반 블록체인의 확장성과 내결함성 평가 및 비교분석)

  • Lee, Eun-Young;Kim, Nam-Ryeong;Han, Chae-Rim;Lee, Il-Gu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.2
    • /
    • pp.271-277
    • /
    • 2022
  • PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

A Study on the Efficient Load Balancing Method Considering Real-time Data Entry form in SDN Environment (SDN 환경에서 실시간 데이터 유입형태를 고려한 효율적인 부하분산 기법 연구)

  • Ju-Seong Kim;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1081-1086
    • /
    • 2023
  • The rapid growth and increasing complexity of modern networks have highlighted the limitations of traditional network architectures. The emergence of SDN (Software-Defined Network) in response to these challenges has changed the existing network environment. The SDN separates the control unit and the data unit, and adjusts the network operation using a centralized controller. However, this structure has also recently caused a huge amount of traffic due to the rapid spread of numerous Internet of Things (IoT) devices, which has not only slowed the transmission speed of the network but also made it difficult to ensure quality of service (QoS). Therefore, this paper proposes a method of load distribution by switching the IP and any server (processor) from the existing data processing scheduling technique, RR (Round-Robin), to mapping when a large amount of data flows in from a specific IP, that is, server overload and data loss.

Characteristics and Methods of Bandwidth Allocation According to Flow Features for QoS Control on Flow-Aware Network (Flow-Aware Network에서 QoS제어를 위해 Flow 특성에 따른 대역할당 방법과 특성)

  • Kim, Jae-Hong;Han, Chi-Moon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.39-48
    • /
    • 2008
  • Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

An Admission Control Mechanism to guarantee QoS of Streaming Service in WLAN (WLAN에서 스트리밍 서비스의 QoS를 보장하기 위한 승인 제어 기술)

  • Kang, Seok-Won;Lee, Hyun-Jin;Lee, Kyu-Hwan;Kim, Jae-Hyun;Roh, Byeong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.595-604
    • /
    • 2009
  • The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

A Study on the Build of Equipment Predictive Maintenance Solutions Based on On-device Edge Computer

  • Lee, Yong-Hwan;Suh, Jin-Hyung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.165-172
    • /
    • 2020
  • In this paper we propose an uses on-device-based edge computing technology and big data analysis methods through the use of on-device-based edge computing technology and analysis of big data, which are distributed computing paradigms that introduce computations and storage devices where necessary to solve problems such as transmission delays that occur when data is transmitted to central centers and processed in current general smart factories. However, even if edge computing-based technology is applied in practice, the increase in devices on the network edge will result in large amounts of data being transferred to the data center, resulting in the network band reaching its limits, which, despite the improvement of network technology, does not guarantee acceptable transfer speeds and response times, which are critical requirements for many applications. It provides the basis for developing into an AI-based facility prediction conservation analysis tool that can apply deep learning suitable for big data in the future by supporting intelligent facility management that can support productivity growth through research that can be applied to the field of facility preservation and smart factory industry with integrated hardware technology that can accommodate these requirements and factory management and control technology.