• 제목/요약/키워드: Bandwidth Requirements

검색결과 329건 처리시간 0.032초

Design and Implementation of SDN-based 6LBR with QoS Mechanism over Heterogeneous WSN and Internet

  • Lee, Tsung-Han;Chang, Lin-Huang;Cheng, Wei-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권2호
    • /
    • pp.1070-1088
    • /
    • 2017
  • Recently, the applications of Internet of Things (IoTs) are growing rapidly. Wireless Sensor Network (WSN) becomes an emerging technology to provide the low power wireless connectivity for IoTs. The IPv6 over low-power wireless personal area networks (6LoWPAN) has been proposed by IETF, which gives each WSN device an IPv6 address to connect with the Internet. The transmission congestion in IoTs could be a problem when a large numbers of sensors are deployed in the field. Therefore, it is important to consider whether the WSN devices have be completely integrated into the Internet with proper quality of service (QoS) requirements. The Software Defined Network (SDN) is a new architecture of network decoupling the data and control planes, and using the logical centralized control to manage the forwarding issues in large-scale networks. In this research, the SDN-based 6LoWPAN Border Router (6LBR) is proposed to integrate the transmission from WSNs to Internet. The proposed SDN-based 6LBR communicating between WSNs and the Internet will bring forward the requirements of end-to-end QoS with bandwidth guarantee. Based on our experimental results, we have observed that the selected 6LoWPAN traffic flows achieve lower packet loss rate in the Internet. Therefore, the 6LoWPAN traffic flows classified by SDN-based 6LBR can be reserved for the required bandwidth in the Internet to meet the QoS requirements.

Calculation of Spectral Efficiency for Estimating Spectrum Requirements of IMT-Advanced in Korean Mobile Communication Environments

  • Chung, Woo-Ghee;Lim, Eun-Taek;Yook, Jong-Gwan;Park, Han-Kyu
    • ETRI Journal
    • /
    • 제29권2호
    • /
    • pp.153-161
    • /
    • 2007
  • In this paper, we analyze the algorithm of the methodology developed by ITU for the calculation of spectrum requirements of IMT-Advanced. We propose an approach to estimate user density using traffic statistics, and to estimate spectrum efficiencies using carrier-to-interference ratio distribution and capacity theory as well as experimental data under Korean mobile communication environments. We calculate the IMT-Advanced spectrum requirements based on the user density and spectral efficiencies acquired from the new method. In the case of spectral efficiency using higher modulation and coding schemes, the spectrum requirement of IMT-Advanced is approximately 2700 MHz. When applying a $2{\times}2$ multiple-input multiple-output (MIMO) antenna system, it is approximately 1500 MHz; when applying a $4{\times}4$ MIMO antenna system, it is approximately 1050 MHz. Considering that the development of new technology will increase spectrum efficiency in the future, the spectrum requirement of IMT-Advanced in the Korean mobile communication environment is expected to be approximately 1 GHz bandwidth.

  • PDF

Channel-Based Scheduling Policy for QoS Guarantees in Wireless Links

  • Kim Jeong Geun;Hong Een-Kee
    • Journal of Internet Computing and Services
    • /
    • 제5권6호
    • /
    • pp.11-20
    • /
    • 2004
  • Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

  • PDF

Implementation of On-demand QoS management System for Bandwidth Resource Allocation (대역폭 자원 할당을 위한 주문형 Qos 관리 시스템 구현)

  • Lee, Dongwook;Yi, Dong-Hoon;Kim, Jongwon;Sanggil Jung;Okhwan Byun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제29권4B호
    • /
    • pp.444-454
    • /
    • 2004
  • To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.

Bandwidth Requirement Estimation Method for Future Wireless Railway Communication Systems (차세대 철도통합무선망을 위한 주파수 소요량 계산방법)

  • Jeong, Minwoo;Yoon, Hyungoo;Park, Duk-Kyu;Kim, Kyung-Hee;Lee, Sukjin
    • Journal of the Korean Society for Railway
    • /
    • 제16권6호
    • /
    • pp.540-550
    • /
    • 2013
  • The Future Wireless Railway Communication System(FWRCS) has attracted attention for the various advantages of such a system like efficient management, precise periodicity of operation and speedy travel. Related to it, the area of bandwidth requirement estimation for the FWRCS is being researched actively because there is a great need for accurate bandwidth distribution. In this paper, sophisticated bandwidth requirement estimation method for FWRCS is proposed by modifying ITU-R M.1390. With this method, the expected frequency requirements for the present, for five years from now, and for 10 years from now can be calculated by applying the data gathered from the actual field.

Performance Analysis of a Dynamic Bandwidth Allocation Scheme for improving the delay of the real time traffic in an EPON (EPON에서 실시간 트래픽의 지연성능 향상을 위한 동적 대역할당방안의 성능분석)

  • Park, Chul-Geun;Lee, Yu-Tae;Chung, Hae;You, Geon-Il;Kim, Jong-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제28권11B호
    • /
    • pp.1023-1030
    • /
    • 2003
  • In this paper, we deal with an effective dynamic bandwidth allocation(DBA) scheme in order to support the qualify of services (QoS) in the customer access network which supports various applications with own service requirements. we discuss the DBA scheme for upstream traffic in the EPON which support both the delay sensitive traffic such as voice and real-time video and non-real time traffic such as data and BE. We propose the new DBA scheme which guarantee the delay performance of the real time traffic and utilize the upstream bandwidth effectively in the limited resource environment. We analize the delay performance of the proposed scheme by simulation.

A Distributed Precedence Queue Mechanism to Assign Efficient Bandwidth in CAN Networks (CAN 네트워크상의 효율적인 대역 할당을 위한 분산 선행대기 열 기법)

  • 최호식;이장명
    • Journal of Institute of Control, Robotics and Systems
    • /
    • 제10권11호
    • /
    • pp.1058-1064
    • /
    • 2004
  • This paper presents a distributed precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system, which keeps a fixed priority in data transaction. The mechanism is implemented in the upper sub-layer of the data link layer(DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry, and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmission. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

CUDA based Lossless Asynchronous Compression of Ultra High Definition Game Scenes using DPCM-GR (DPCM-GR 방식을 이용한 CUDA 기반 초고해상도 게임 영상 무손실 비동기 압축)

  • Kim, Youngsik
    • Journal of Korea Game Society
    • /
    • 제14권6호
    • /
    • pp.59-68
    • /
    • 2014
  • Memory bandwidth requirements of UHD (Ultra High Definition $4096{\times}2160$) game scenes have been much more increasing. This paper presents a lossless DPCM-GR based compression algorithm using CUDA for solving the memory bandwidth problem without sacrificing image quality, which is modified from DDPCM-GR [4] to support bit parallel pipelining. The memory bandwidth efficiency increases because of using the shared memory of CUDA. Various asynchronous transfer configurations which can overlap the kernel execution and data transfer between host and CUDA are implemented with the page-locked host memory. Experimental results show that the maximum 31.3 speedup is obtained according to CPU time. The maximum 30.3% decreases in the computation time among various configurations.

Design of Synchronization and T-STD Model for 3DTV Service over Hybrid Networks

  • Yun, Kugjin;Cheong, Won-Sik;Lee, Gwangsoon;Li, Xiaorui;Kim, Kyuheon
    • ETRI Journal
    • /
    • 제38권5호
    • /
    • pp.838-846
    • /
    • 2016
  • The objective of digital broadcasting has evolved from providing a plain video service to offering a realistic visual experience. Technologies such as 3DTV and UHDTV have been suggested to achieve this new objective by providing an immersive and stereoscopic visual experience. However, owing to the high bandwidth requirements of such services, the broadcasting industry has faced a challenge to find a new transport mechanism for overcoming the bandwidth limitation. The standardization organizations, the Advanced Television Systems Committee, Digital Video Broadcasting, and Telecommunications Technology Association, have been working on the integration of broadcasting and a broadband network (IP) to resolve the bandwidth issue of realistic video services. This paper introduces a frame-level timeline synchronization and transport system target decoder model for providing a stable 3DTV service over a hybrid network. The experimental results indicate that the proposed technologies can be successfully adopted as a reference model in a broadcast-broadband hybrid 3DTV service and other IP-associated hybrid broadcasting services.

A Queue Policy for Multimedia Communications

  • Jeong, Seong-Ho
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.129-132
    • /
    • 2002
  • To support UDP-based real-time multimedia applications over the Internet, it is necessary to provide a certain amount of bandwidth within the network so that the performance of the applications will not be seriously affected during periods of congestion. Since the flow rates of some of these applications do not back of during periods of congestion, it is also necessary to protect flow-controlled TCP flows from unresponsive or aggressive UDP flows. To achieve these goals, we propose a simple queue policy to support multimedia applications, called threshold-based queue management (TBQM). TBQM isolates UDP flows efficiently from TCP flows to protect TCP flows while supporting bandwidth requirements of UDP applications that require QoS. In addition, TBQM supports drop fairness between TCP flows without maintaining per-flow state. We also present some experimental results to show that the proposed queue policy can work well.

  • PDF