• Title/Summary/Keyword: Bandwidth Reservation

Search Result 109, Processing Time 0.036 seconds

Performance Evaluation of the Internet Phone based on Resource Reservation Protocol (자원 예약 프로토콜에 기반한 인터넷 폰의 성능분석)

  • 조재만
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.03a
    • /
    • pp.27-31
    • /
    • 1998
  • The growing usage of multimedia communication applications with specific bandwidth and real-time delivery requirements has created the needs for quality of service(QoS). In response to the growing demand for an integrated services, the Reservation Protocol(RSVP) has been designed to exchange resource reservation among routers in the internet. RSVP protocol provides the quality of service for real-time applications but the network efficiency is reduced because of the limited bandwidth. In order to use network resources efficiently. We compare the resource efficiency of traditional reservation methods with that of the proposed method and evaluate the performance of the internet phone.

  • PDF

A Window based Resource Reservation Scheme to Improve Bandwidth Utilization in Mobile Networks (모바일 네트워크에세 대역폭 이용율 향상을 위한 윈도우 기반의 자원 예약 기법)

  • Park Si-Yong;Park Sung-Ho;Chung Ki-Dong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.227-234
    • /
    • 2006
  • In this paper, we propose a window based resource reservation scheme to minimize an waste bandwidth due to resource reservation in mobile networks. Specially, this scheme decides a proper timing to reserve resource by using the number of movement, which is provided by the differentiated handoff estimation model, among inner regions. In the previous resource reservation scheme[6], it requests a resource reservation to neighboring cells as soon as a mobile host enters or creates into a cell. But, after a proper time based on the number of movements in the differentiated handoff estimation model passes, the proposed scheme requests a resource reservation to neighboring cells. Because of this reason, it can improve resource utilization on mobile networks. And, this scheme differentiates resource reservation according to a request ratio for resource reservation to each neighboring cell. Also, this scheme improves resource reservation acceptance rate and bandwidth utilization.

Soft-State Bandwidth Reservation Mechanism for Slotted Optical Burst Switching Networks

  • Um, Tai-Won;Choi, Jun-Kyun;Guo, Jun;Ryu, Won;Lee, Byung-Sun
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.216-226
    • /
    • 2008
  • This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality-of-service constraints. To this end, we have developed a soft-state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.

  • PDF

Performance Analysis of Population-Based Bandwidth Reservation Scheme with Various Request Reservation Ratios (요청 예약 비율에 따른 Population-Based Bandwidth Reservation 구조의 성능 분석)

  • Kwon, Se-Dong;Han, Man-Yoo;Park, Hyun-Min
    • The KIPS Transactions:PartC
    • /
    • v.9C no.3
    • /
    • pp.385-398
    • /
    • 2002
  • To accommodate the increasing number of mobile terminals in the limited radio spectrum, wireless systems have been designed as micro/picocellular architectures for a higher capacity. This reduced coverage area of a cell has caused a higher rate of hand-off events, and the hand-off technology for efficient process becomes a necessity to provide a stable service. Population-based Bandwidth Reservation(PBR) Scheme is proposed to provide prioritized handling for hand-off calls by dynamically adjusting the amount of reserved bandwidth of a cell according to the amount of cellular traffic in its neighboring cells. We analyze the performance of the PBR scheme according to the changes of a fractional parameter, f, which is the ratio of request reservation to the total amount of bandwidth units required for hand-off calls that will occur for the next period. The vague of this parameter, f should be determined based on QoS(Quality of Service) requirement. To meet the requirement the value of Parameter(f) must be able to be adjusted dynamically according to the changing traffic conditions. The best value of f can be determined by a function of the average speed of mobile stations, average call duration, cell size, and so on. This paper considers the average call duration and the cell size according to the speed of mobile stations. Although some difference exists as per speed, in the range of 0.4 $\leq$ f $\leq$ 0.6, Blocking Probability, Dropping Probability and Utilization show the best values.

Bandwidth Reservation Policy for Cellular Networks Using Geographical Information (지리적 정보를 사용한 셀룰러 네트워크 대역폭 예약 정책)

  • Yu, Jae-Bong;Park, Chan-Young;Park, Joon-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10B
    • /
    • pp.891-899
    • /
    • 2006
  • Generally, a geographical area consists of many regions called cells in wireless networks. Each mobile host(MH) in a cell communicates with a base station(BS) located in the center of the cell. The BSs are connected to each other by a static wired network. Since users are expected to move around during communication sessions, one of the most important QoS factors is related to the handoff. But, the handoff could fail due to unavailability of sufficient bandwidth in the next cell. As the individual cell size gradually shrinks to accommodate increasing the number of MHs, the probability of successful handoffs can be dropped. In this paper, we suppose a bandwidth reservation method to guarantee MHs against connection failure in case of frequent handoffs. This method predicts the mobility based on the geographical information and assigns the bandwidth reservation in proportion to the speed of MHs' motion. As a result, we can expect more exact moving path of MH and to reduce the waste of bandwidth.

A Split Reservation Protocol for Mobile Hosts in Wireless Networks

  • Kang, Yoo-Hwa;Suh, Young-Joo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.111-113
    • /
    • 2000
  • We discuss the problem of resource reservation, such as bandwidth, for delay sensitive application in wireless networking environment. As multimedia application is becoming a critical role of the current mobile network, the resource reservation become very important to support the real-time service. In this paper, we propose and evaluate a new resource reservation protocol, called Split Reservation Protocol, in wireless network. The simulation results show that our proposed protocol outperforms an existing protocol called MPSVP in terms of network overhead.

  • PDF

Performance of burst-level bandwidth reservation protocols for multiple hop ATM LANs (다중 HOP으로 구성된 ATM LAN용 버스트 레벨의 대역 예약프로토콜의 성능분석)

  • 윤종호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1200-1207
    • /
    • 1996
  • The paper presents and analyzes two efficient burst-level bandwidth reservation protocols for multi-hop ATM Local Area Networks. With the tell-and-wait (TNW) protocol and the tell-and-go (TNG) protocol[6], a negative acknowledgmen(NACK) message representing the bandwidth starvation on a switch on the source-destnation path can be always sent by a destination. We note that the protocols waste more bandwidth as the round-trip delay increases, since the switches on the path must reserve the bandwidth until the NACK will arrive. Based on this pitfall, the proposed protocols allow and ATM node, rather than a destination node to send a NACK. This allowance can save the needless bandwidth wastage. Using the thinned load approximation method, we show the proposed protocols have good performance and practical simplicity. Thus, the proposed protocols may be candidates for the ABR service in multi-hop ATM LANs and ATM WANs.

  • PDF

Multiaccess Scheme with Implicit Reservation for VSAT Data commmunication (VSAT 데이터 통신을 위한 묵시적 예약 방식의 다중접속 기법)

  • 이창건;최양희;정선종;김종상
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.7
    • /
    • pp.1-16
    • /
    • 1994
  • In this paper, we propose a new multiple access scheme for VSAT(Very Small Aperture Terminal) data communications. The proposed scheme has better performance in terms of delay throughput than Controlled Multiaccess Scheme which has excellent performance. The proposed scheme use the spare reservation method, adaptation method to offered load, and fixed bandwidth reservation method. In this paper, we analyze the performance using simple queueing model and present the simulation results. When network traffic is very low, the new scheme and the controlled multiaccess scheme have almost the same access delay characteristic. As the network load becomes higher, the new scheme's access delay gain becomes larger. Futhermore, even when the network traffic is very high it is possible to access satellite link within the delay similar to one round-trip delay. In addition to access delay performance enhancement, the new scheme has facility that supports fixed bandwidth reservation. So it shows more enhanced performance in the environment that stream traffic is dominant such as in VSAT communication environment.

  • PDF

Reservation based Resource Management for SDN-based UE Cloud

  • Sun, Guolin;Kefyalew, Dawit;Liu, Guisong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5174-5190
    • /
    • 2016
  • Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

Design of Dynamic Slot Assignment Protocol for Wireless Multimedia Communication (무선 멀티미디어 통신을 위한 동적 슬롯 할당 MAC 프로토콜 설계)

  • Yoe Hyun;Kang Sang-Wook;Koh Jin-Gwang
    • Journal of Internet Computing and Services
    • /
    • v.4 no.5
    • /
    • pp.61-68
    • /
    • 2003
  • In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

  • PDF