• Title/Summary/Keyword: dynamic bandwidth request

Search Result 45, Processing Time 0.02 seconds

Service Differentiation Scheme Based on Burst Size Controlling Algorithm in Optical Internet (광 인터넷에서 버스트 크기 제어 알고리즘 기반 서비스 차등화 기법)

  • Lee, Yonggyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.562-570
    • /
    • 2022
  • The supply expansion of 5G services and personal smart devices has caused the sharp increase of data traffic and the demand of various services. Again, these facts have resulted in the huge demand of network bandwidth. However, existing network technologies using electronic signal have reached the limit to accommodate the demand. Therefore, in order to accept this request, optical internet has been studied actively. However, optical internet still has a lot of problems to solve, and among these barriers a very urgent issue is to develop QoS technologies. Hence, in order to achieve service differentiation between classes in optical internet, especially in OBS network, a new QoS method automatically tuning the size of data bursts is proposed in this article. Especially, the algorithm suggested in this article is based on fiber delay line.

A Service Architecture to support IP Multicast Service over UNI 4.0 based ATM Networks (UNI 4.0 기반 ATM 망에서의 IP 멀티캐스트 지원 방안을 위한 서비스 구조)

  • Lee, Mee-Jeong;Jung, Sun;Kim, Ye-kyung
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.3
    • /
    • pp.348-359
    • /
    • 2000
  • Most of the important real time multimedia applications require multipoint transmissions. To support these applications in ATM based Intermet environments, it is important to provide efficient IP multicast transportations over ATM networks. IETF proposed MARS(Multicast Address Resolution Server) as the service architecture to transport connectionless IP multicast flows over connection oriented ATM VCs. MARS assumes UNI3.0/3.1 signalling. Since UNI3.0/3.1 does not provide any means for receivers to request a join for a multicast ATM VC, MARS provides overlay service to relay join request from IP multicast group members to the sources of the multicast group. Later on, ATM Forum standardized UNI4.0 signalling which is provisioned with a new signalling mechanism called LIJ(Leaf Initiated Join). LIJ enables receivers to directly signal the source of an ATM VC to join. In this paper, we propose a new service architecture providing IP multicast flow transportation over ATM networks deploying UNI4.0 signalling. The proposed architecture is named UNI4MARS. It comprises service components same as those of the MARS. The main functionality provided by the UNI4MARS is to provide source information to the receivers so that the receivers may exploit LIJ to join multicast ATM VCs dynamically. The implementation overhead of UNI4MARS and that of MARS are compared by a course of simulations. The simulation results show that the UNI4MARS supports the dynamic IP multicast group changes more efficiently with respect to processing, memory and bandwidth overhead.

  • PDF

FPGA Implementation of a Grant Distribution Algorithm for the MAC in the ATM-PON (ATM-PON에서 MAC을 위한 승인분배 알고리즘의 FPGA 구현)

  • Kim, Tae-Min;Chung, Hae;Shin, Gun-Soon;Kim, Jin-Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.10
    • /
    • pp.1-9
    • /
    • 2001
  • The MAC (Medium Access Control) protocol is needed for the OLT(Optical Line Termination) to allocate bandwidth to ONUs(Optical Network Units) and ONTs(Optical Network Terminations) dynamically in the ATM PON(Passive Optical Network). With the protocol, the OLT gathers ONUs' informations and provides grants efficiently to each ONU. Two important functions of the MAC protocol is the grant request procedure and the grant distribution algrithm. The latter has the greatest arithmetic portion in the TC(Transmission Convergence) module, occupies a relatively large portion of the overall chip area, has often been the limiting factor in terms of speed, and should be designed to guarantee the quality of service for various traffics. In this paper, we implement the MAC with the FPGA which can allocate grants dynamically according to the queue length information and the number of active ONUs and distribute grants uniformly to minimize the cell delay variation for each ONU. The structure of the MAC scheduler for the dynamic bandwidth assignment has a programmable look-up table. Also, it has a simple structure, the less chip area, and the lower delay time.

  • PDF

Shared Resource Management Scheme in Advance and Immediate Reservations for Effective Resource Allocation (효율적인 자원 할당을 위한 사전 예약과 즉석 예약 간 공유 자원 관리)

  • 이동훈;김종원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.685-696
    • /
    • 2004
  • Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

Batching delivery for VCR-like functions in video-on-demand service system (주문형 비디오 서비스 시스템에서 VCR 기능을 위한 Batching 전송)

  • 박호균;유황빈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2852-2859
    • /
    • 1997
  • Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.

  • PDF