• Title/Summary/Keyword: Bandwidth Utilization

Search Result 370, Processing Time 0.037 seconds

Segment Scheduling Scheme for Efficient Bandwidth Utilization of UHD Contents Streaming in HTTP Adaptive Streaming (HTTP 적응적 스트리밍에서 UHD 콘텐츠의 효율적인 대역폭 활용을 위한 세그먼트 전송 기법)

  • Kim, Heekwang;Chung, Kwangsue
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.340-342
    • /
    • 2018
  • 최근 네트워크 기술과 스마트 단말의 보급으로 인해 비디오 스트리밍 서비스에 대한 수요가 증가하게 되었다. 네트워크를 효율적으로 사용하여 비디오 스트리밍 서비스를 제공하기 위해 적응적으로 전송률을 조절하는 HTTP (HyperText Transfer Protocol) 적응적 스트리밍 서비스가 주목 받게 되었다. UHD (Ultra High Definition) 콘텐츠는 HD (High Definition) 콘텐츠에 비해 적어도 4 배 이상의 크기를 갖기 때문에 끊김 없는 UHD 콘텐츠 스트리밍 서비스를 제공하기 위해서는 많은 가용 대역폭이 필요하다. 기존의 HTTP 적응적 스트리밍 방식은 정상 상태 (Steady State)에서 가용 대역폭보다 낮은 품질의 비디오 세그먼트를 일정 시간마다 주기적으로 요청하여 다운로드 받는다. 정상 상태에서는 가용 대역폭과 콘텐츠의 인코딩 율에 차이에 따라 On-Off 구간의 패턴이 반복되어 발생하고, 빈번한 Off 구간에 의해서 대역폭이 낭비되는 문제점이 있다. 따라서 본 논문에서는 HTTP 적응적 스트리밍에서 UHD 콘텐츠의 효율적인 대역폭 활용을 위한 세그먼트 전송 기법을 제안한다. 제안하는 기법은 Off 구간의 빈도수를 줄이기 위한 집단 세그먼트 전송 방식과 대역폭 낭비를 최소화 하기 위한 세그먼트 품질 조절기법으로 구성되어 있다.

  • PDF

Implementation and Performance Evaluation of Linux-based Scheduler for improving MPTCP Performance in Heterogeneous Networks (이종 망에서 MPTCP 성능 향상을 위한 리눅스 기반의 스케줄러 구현 및 성능 평가)

  • Ahn, Jong-won;Kim, Do-ho;Kim, Min-seob;Lee, Jae-yong;Kim, Byung-chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.448-450
    • /
    • 2019
  • Multipath TCP (MPTCP) is a standardized transport layer protocol for maximizing the use of finite network resources by using multiple interfaces simultaneously. If the characteristics of each path are the same, there is an advantage in terms of stability and bandwidth utilization compared to the existing single TCP. However, if the path characteristics are different, the performance is lower than that of a single TCP. There are many complex reasons for this, but one of the biggest impacts is the bufferbloat, which dramatically increases the latency. In this paper, we implemented an algorithm that improved MPTCP performance degradation due to bufferbloat in Linux - based testbed and compared performance with existing MPTCP scheduler.

  • PDF

Resource allocation algorithm for space-based LEO satellite network based on satellite association

  • Baochao Liu;Lina Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.6
    • /
    • pp.1638-1658
    • /
    • 2024
  • As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Performance Enhancement Method Through Science DMZ Data Transfer Node Tuning Parameters (Science DMZ 데이터 전송 노드 튜닝 요소를 통한 성능 향상 방안)

  • Park, Jong Seon;Park, Jin Hyung;Kim, Seung Hae;Noh, Min Ki
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.2
    • /
    • pp.33-40
    • /
    • 2018
  • In an environment with a large network bandwidth, maximizing bandwidth utilization is an important issue to increase transmission efficiency. End-to-end transfer efficiency is significantly influenced by factors such as network, data transfer nodes, and intranet network security policies. Science DMZ is an innovative network architecture that maximizes transfer performance through optimal solution of these complex components. Among these, the data transfer node is a key factor that greatly affects the transfer performance depending on storage, network interface, operating system, and transfer application tool. However, tuning parameters constituting a data transfer node must be performed to provide high transfer efficiency. In this paper, we propose a method to enhance performance through tuning parameters of 100Gbps data transfer node. With experiment result, we confirmed that the transmission efficiency can be improved greatly in 100Gbps network environment through the tuning of Jumbo frame and CPU governor. The network performance test through Iperf showed improvement of 300% compared to the default state and NVMe SSD showed 140% performance improvement compared to hard disk.

A Study on Terrestrial UHDTV Broadcasting and Construction of Direct Reception Environment by DVB-T2 (DVB-T2기반으로 지상파 UHDTV방송과 직접수신환경 구축 연구)

  • Park, Sung-Kyu;Jo, Young-Joon;Kim, Dong-Woo;Park, Goo-Man
    • Journal of Broadcast Engineering
    • /
    • v.18 no.4
    • /
    • pp.572-588
    • /
    • 2013
  • In this paper, 4K-UHDTV or 8K-UHDTV and UHD-3DTV that the next generation broadcasting implementation and the possibility of direct receiving environment construction is analyzed on the terrestrial broadcasting. Particularly, we investigated the possibility by analyzing the previous and related works with regard to UHDTV transmission by DVB-T2 that is one of the best commercialized transmission mode. In order that the UHDTV broadcasting succeeds once again after completion of digital terrestrial switch over at the end of 2012, the ultra high resolution image transfer is important. However, the direct, the indoor and ubiquitous receiving environment is important in not only TV but also the personal type multimedia terminal in the sense of UHDTV service penetration. Therefore, in this paper, by using SFN and high error-correcting mode in DVB-T2 standard, the efficient frequency utilization and effective reception environment construction is illustrated. Particularly, SFN network constitution by 2 mutually different frequencies including the VHF bandwidth and UHF band, and etc. is shown. And the method that builds the free wireless receive environment by using SFN low power radio repeater and for home use gap filler is proposed. And the effect and frequency amount required are presented, when UHDTV broadcasting use 10MHz bandwidth.

Implementation of a TCP/IP Offload Engine Using High Performance Lightweight TCP/IP (고성능 경량 TCP/IP를 이용한 소프트웨어 기반 TCP/IP 오프로드 엔진 구현)

  • Jun, Yong-Tae;Chung, Sang-Hwa;Yoon, In-Su
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.369-377
    • /
    • 2008
  • Today, Ethernet technology is rapidly developing to have a bandwidth of 10Gbps beyond 1Gbps. In such high-speed networks, the existing method that host CPU processes TCP/IP in the operating system causes numerous overheads. As a result of the overheads, user applications cannot get the enough computing power from the host CPU. To solve this problem, the TCP/IP Offload Engine(TOE) technology was emerged. TOE is a specialized NIC which processes the TCP/IP instead of the host CPU. In this paper, we implemented a high-performance, lightweight TCP/IP(HL-TCP) for the TOE and applied it to an embedded system. The HL-TCP supports existing fundamental TCP/IP functions; flow control, congestion control, retransmission, delayed ACK, processing out-of-order packets. And it was implemented to utilize Ethernet MAC's hardware features such as TCP segmentation offload(TSO), checksum offload(CSO) and interrupt coalescing. Also we eliminated the copy overhead from the host memory to the NIC memory when sending data and we implemented an efficient DMA mechanism for the TCP retransmission. The TOE using the HL-TCP has the CPU utilization of less than 6% and the bandwidth of 453Mbps.

Blind Adaptive Equalization of Partial Response Channels (부분 응답 채널에서의 블라인드 적응 등화 기술에 관한 연구)

  • 이상경;이재천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11A
    • /
    • pp.1827-1840
    • /
    • 2001
  • In digital data transmission/storage systems, the compensation for channel distortion is conducted normally using a training sequence that is known a priori to both the sender and receiver. The use of the training sequences results in inefficient utilization of channel bandwidth. Sometimes, it is also impossible to send training sequences such as in the burst-mode communication. As such, a great deal of attention has been given to the approach requiring no training sequences, which has been called the blind equalization technique. On the other hand, to utilize the limited bandwidth effectively, the concept of partial response (PR) signaling has widely been adopted in both the high-speed transmission and high-density recording/playback systems such as digital microwave, digital subscriber loops, hard disk drives, digital VCRs and digital versatile recordable disks and so on. This paper is concerned with blind adaptive equalization of partial response channels whose transfer function zeros are located on the unit circle, thereby causing some problems in performance. Specifically we study how the problems of blind channel equalization associated with the PR channels can be improved. In doing so, we first discuss the existing methods and then propose new structures for blind PR channel equalization. Our structures have been extensively tested by computer simulation and found out to be encouraging in performance. The results seem very promising as well in terms of the implementation complexity compared to the previous approach reported in literature.

  • PDF

A Two-Step Call Admission Control Scheme using Priority Queue in Cellular Networks (셀룰러 이동망에서의 우선순위 큐 기반의 2단계 호 수락 제어 기법)

  • 김명일;김성조
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.461-473
    • /
    • 2003
  • Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

A Tunable Transmitter - Tunable Receiver Algorithm for Accessing the Multichannel Slotted-Ring WDM Metropolitan Network under Self-Similar Traffic

  • Sombatsakulkit, Ekanun;Sa-Ngiamsak, Wisitsak;Sittichevapak, Suvepol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.777-781
    • /
    • 2004
  • This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

  • PDF