• Title/Summary/Keyword: network bandwidth

Search Result 2,109, Processing Time 0.035 seconds

Design and Implementation of Video Streaming Service Quality Control System through Available Bandwidth Management (가용대역폭 관리를 통한 영상 스트리밍 서비스 품질 제어 시스템 설계 및 구현)

  • Lee, In-Sun;Kim, Hyun-Jong;Choi, Seong-Gon
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.36-44
    • /
    • 2010
  • In this paper, we propose video quality control system(VQCS) which can control video service quality through the monitoring of end-to-end available bandwidth for video streaming service like IPTV in NGN convergence network. Various multimedia services such as video, voice and gaming service can be provided by IPTV, and these services require large amounts of bandwidth. At this time, video quality degradation like video jerkiness, block distortion and blurring is caused when network available bandwidth is insufficient. Available bandwidth monitoring method is need to stably control video streaming quality. So, we periodically calculate the amount of the packets in link and measure available bandwidth by using total length field in IP header at terminal. Scalability extractor in network selects suitable video streaming data rate based on available bandwidth and transports video streaming with adaptive data rate to prevent video quality deterioration.

An Efficient Algorithm of Network Bandwidth Allocations for Multimedia Services (멀티미디어 서비스를 위한 효율적인 대역폭 할당)

  • 김정택;고인선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1112-1123
    • /
    • 2002
  • Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.

Adaptive Call Admission and Bandwidth Control in DVB-RCS Systems

  • Marchese, Mario;Mongelli, Maurizio
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.568-576
    • /
    • 2010
  • The paper presents a control architecture aimed at implementing bandwidth optimization combined with call admission control (CAC) over a digital video broadcasting (DVB) return channel satellite terminal (RCST) under quality of service (QoS) constraints. The approach can be applied in all cases where traffic flows, coming from a terrestrial portion of the network, are merged together within a single DVB flow, which is then forwarded over the satellite channel. The paper introduces the architecture of data and control plane of the RCST at layer 2. The data plane is composed of a set of traffic buffers served with a given bandwidth. The control plane proposed in this paper includes a layer 2 resource manager (L2RM), which is structured into decision makers (DM), one for each traffic buffer of the data plane. Each DM contains a virtual queue, which exactly duplicates the corresponding traffic buffer and performs the actions to compute the minimum bandwidth need to assure the QoS constraints. After computing the minimum bandwidth through a given algorithm (in this view the paper reports some schemes taken in the literature which may be applied), each DM communicates this bandwidth value to the L2RM, which allocates bandwidth to traffic buffers at the data plane. Real bandwidth allocations are driven by the information provided by the DMs. Bandwidth control is linked to a CAC scheme, which uses current bandwidth allocations and peak bandwidth of the call entering the network to decide admission. The performance evaluation is dedicated to show the efficiency of the proposed combined bandwidth allocation and CAC.

OFPT: OpenFlow based Parallel Transport in Datacenters

  • Liu, Bo;XU, Bo;Hu, Chao;Hu, Hui;Chen, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4787-4807
    • /
    • 2016
  • Although the dense interconnection datacenter networks (DCNs) (e.g. FatTree) provide multiple paths and high bisection bandwidth for each server pair, the single-path TCP (SPT) and ECMP which are widely used currently neither achieve high bandwidth utilization nor have good load balancing. Due to only one available transmission path, SPT cannot make full use of all available bandwidth, while ECMP's random hashing results in many collisions. In this paper, we present OFPT, an OpenFlow based Parallel Transport framework, which integrates precise routing and scheduling for better load balancing and higher network throughput. By adopting OpenFlow based centralized control mechanism, OFPT computes the optimal path and bandwidth provision for each flow according to the global network view. To guarantee high throughput, OFPT dynamically schedules flows with Seamless Flow Migration Mechanism (SFMM), which can avoid packet loss in flow rerouting. Finally, we test OFPT on Mininet and implement it in a real testbed. The experimental results show that the average network throughput in OFPT is up to 97.5% of bisection bandwidth, which is higher than ECMP by 36%. Besides, OFPT decreases the average flow completion time (AFCT) and achieves better scalability.

Class Gated Dynamic Bandwidth Allocation Algorithm for supporting QoS in the EPON (EPON 시스템에서 효율적인 QoS 제공을 위한 Class Gated 동적 대역 할당 알고리즘)

  • Hwang Jun-Ho;Kim Hyo-Won;Yoo Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.94-103
    • /
    • 2006
  • Ethernet passive optical network (EPON) has drawn many attention as a promising access network technology for FTTH because it can provide a high bandwidth with a low cost. Since the uplink bandwidth in the EPON system is shared by many users, it is necessary for an EPON system to have an efficient bandwidth allocation mechanism. To support QoS in EPON, the previous bandwidth allocation schemes employ strict priority queueing (SPQ). Since SPQ gives unlimited priority to higher service class, the QoS of lower service classes gets worse. In this paper, we propose Class Gated DBA (Dynamic Bandwidth Allocation) algorithm in which the bandwidth is requested / granted in a service class basis. To avoid the monopoly in bandwidth usage by higher classes the maximum bandwidth that is allocate to each service class is limited (fairness between services classes). In addition, to avoid the monopoly in bandwidth usage by some particular users, each ONU runs fairness bandwidth allocation algorithm within each service classes. Through computer simulations, it is verified that the proposed algorithm achieves a good level of QoS, and at the same time maintains a good level of fairness between both service classes and users.

A Study on a Traffic Conditioning Scheme for Alleviating a bias against Reserved Bandwidth Size in Differentiated Services Network (차별 서비스 네트워크에서 예약 대역폭의 편향성을 완화하는 트래픽 조절 기법 연구)

  • 이성근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.228-235
    • /
    • 2002
  • Differentiated services network (DiffServ) aims to provide the same service to a group of connections that have similar Quality of Service requirements. One of the essential function to realize DiffServ is the traffic conditioning mechanisms to support the required services. The paper proposes the enhanced traffic conditioning mechanism which alleviates a bias against reserved bandwidth size. The simulation results show that the new mechanism is rather insensitive of size of reserved bandwidth, and performs better both in terms of throughput assurance and fair distribution of excess bandwidth in case of well-provisioned and over-provisioned network environment.

Unused Bandwidth Allocation Method of TWDM PON (TWDM PON의 미사용 대역폭 분배 방법)

  • Hong, Sung Hark;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.745-746
    • /
    • 2013
  • TWDM PON (time and wavelength division multiplexed passive optical network) uses multiple wavelengths to transmit packets upstream and downstream. In upstream transmission, if we use only one wavelength, the unused bandwidth is equally distributed to each ONU (optical network unit). In contrast, when multiple wavelengths are used, the unused remainders of wavelengths are different from each other. Therefore, it is difficult to fairly allocate the unused bandwidth to each ONU. This paper proposes a new method to allocate the unused bandwidth to each ONU in TWDM PON which uses multiple wavelengths.

  • PDF

A New Dynamic Bandwidth Assigmnent Algorithm for Ethernet-PON (Ethernet-PON을 위한 새로운 동적 대역 할당 알고리즘)

  • Jang, Seong-Ho;Jang, Jong-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.4
    • /
    • pp.441-446
    • /
    • 2003
  • Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. The PON architecture is very simple but it requires a MAC protocol for control of upstream traffic. The MAC protocol must support QoS (Quality of Service) administration function by various traffic class, efficient dynamic bandwidth assignment function, CDV (Ceil Delay Variation) minimization function etc. This paper proposes a dynamic bandwidth assignment algorithm of the MAC protocol for a broadband access network using an Ethernet Passive Optical Network supporting various traffic class. We compare our proposed with MDRR algorithm using simulation, and confirmed that our proposed Request-Counter algorithm produces shorter average cell delay.

An Efficient QoS-Aware Bandwidth Re-Provisioning Scheme in a Next Generation Wireless Packet Transport Network (차세대 이동통신 패킷 수송망에서 서비스 품질을 고려한 효율적인 대역폭 재할당 기법)

  • Park, Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1A
    • /
    • pp.30-37
    • /
    • 2006
  • In this paper, we propose a QoS-aware efficient bandwidth re-provisioning scheme in a next generation wireless packet transport network. At the transport network layer, it classifies the traffic of the radio network layer into a real time class and a non-real time class. Using an auto-regressive time-series model and a given packet loss probability, our scheme predicts the needed bandwidth of the non-real time class at every re-provisioning interval. Our scheme increases the system capacity by releasing the unutilized bandwidth of the non-real time traffic class for the real-time traffic class while insuring a controllable upper bound on the packet loss probability of a non-real time traffic class. Through empirical evaluations using the real Internet traffic traces, our scheme is validated that it can increase the bandwidth efficiency while guaranteeing the quality of service requirements of the non-real time traffic class.

An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks (연결 지향 네트워크에서 최초 가용 구간을 찾는 효율적인 알고리즘)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.3
    • /
    • pp.73-80
    • /
    • 2010
  • The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.