• Title/Summary/Keyword: advance resource reservation

Search Result 10, Processing Time 0.031 seconds

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.

PA-RSVP: An Efficient RSVP Protocol for Real-time Services in the Mobile Internet (PA-RSVP: 무선 인터넷에서 실시간 서비스를 위한 효율적인 RSVP 프로토콜)

  • Kim Taehyoun;Park Hyosoon;Lee Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1B
    • /
    • pp.7-16
    • /
    • 2005
  • Resource Reservation Protocol(RSVP) can provide Quality-of-Service(QoS) guarantees for real-time services in wired networks. However, RSVP suffers from mobility problem in the mobile Internet. Therefore, to provide seamless QoS services, it is needed that a mobile node makes a reservation everywhere it visits. Recently, many protocols have been proposed to provide QoS guarantees through advance resource reservation. But, these proposals have problems with a waste of bandwidth and the signaling overhead due to advance resource reservation. In this paper, we propose new advance resevation protocol, Proportional Aggregate RSVP(PA-RSVP) to minimize the resource reservation bandwidth and the signaling overhead in the mobile Intemet while providing QoS guarantees. Based on the performance evaluation, we show that the proposed protocol provides an improved performance over existing protocols under various system conditions.

Mobility and QoS Support in 4G Wireless Networks

  • Kim Taehyoun;Lee Jaiyong
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.178-191
    • /
    • 2005
  • Fourth-generation (4G) wireless networks will be the IP-based cellular networks integrating Internet with the existing cellular networks. Two important issues should be concerned in the IP-based cellular networks, IP mobility, and quality-of-service (QoS) guarantees. In this paper, we proposed two mechanisms to solve the problems with IP mobility and RSVP-based QoS provisioning. First, virtual-IP (VIP) allocation scheme in areas with a large rate of handoff can minimize the wireless signaling overhead due to IP mobility. The access routers (ARs) create dynamically the VIP zone by using the measured handoff rate derived from the history of the handoff into neighboring ARs. We show that VIP allocation scheme reduces the binding update messages in the wireless link than hierarchical mobile IPv6. Second, the new advance resource reservation protocol called proportional aggregate RSVP (PA-RSVP) can minimize waste of bandwidth and soft state refresh overhead due to IP mobility. It allocates the bandwidth in advance between the mobility anchor point and neighboring ARs using proportional aggregate reservation. We also show that PA-RSVP provides an improved performance over existing protocols.

Advance Reservation Framework with Protection Management for Virtual Circuit Services (가상회선 서비스를 위해 보호 관리 기능을 갖는 사전 예약 프레임워크)

  • Lim, Huhnkuk;Lee, Kyungmin;Cha, Youngwook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.902-910
    • /
    • 2013
  • The most representative research network in Korea, KREONET, has developed DynamicKL, an advance reservation based Network Service Agent (NSA) for user driven virtual circuit services. DynamicKL provides reservation, provisioning, release, termination, and inquiry web services for network resources by using an open standard network service interface (NSI), as well as web services for network resources by using a GUI interface. In addition, it has the RICE interface to support a protection management function per VC for virtual circuits and reservations. In this article, a protection management per VC for provisioned VCs and reservations is addressed in the DynamicKL framework, as a contribution to the VC protection management issue, which results in more manageable and reliable VC services compared to other advance reservation frameworks. An administrator can detect successful or unsuccessful VC protections in the event of a primary link failure and successful or unsuccessful VC retrievals after a primary link repair, by using RICE.

An Efficient Network Resource Reservation Mechanism with Mobility in Nested Heterogeneous Mobile Networks (중첩 이종 무선 망 환경에서 단말의 이동 속도를 고려한 효과적인 망 자원 예약)

  • Park, In-Soo;Tak, Dong-Kuk;Kim, Won-Tae;Park, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.83-98
    • /
    • 2007
  • The handover between different radio access networks, especially where their coverage overlaps, suffers various complications since the different access networks provide different service characteristics. One way to reduce service interruptions and QoS (i.e., bandwidth, throughput, delay) degradations during the inter-technology handover is to reserve the required resource in advance. The resource reservation algorithm should minimize the handover latency and maximize the resource utilization based on the accurate estimation on mobile's location, velocity, movement pattern and service requirements. In this paper, we propose a resource reservation algorithm based on the mobile terminal velocity and the cell selection probability, which maximizes resource utilization ana reduces network overhead. We compare the proposed algorithm with PMS(Predictive Mobility Support) and VCDS(Velocity and Call Duration Support scheme) based on 3-layer network model under various scenarios.

An Efficient Resource Reservation Scheme based on Gray-Cell in Wireless Mobile Networks (그레이 셀을 이용한 무선 이동 네트워크에서의 효율적인 자원 예약 방안)

  • 노희경;장문정;김태은;이미정
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.146-157
    • /
    • 2004
  • In order to provide continuous QoS guaranteed to a mobile user, it is required to deploy some kind of mechanisms which reserves resources in advance at the locations to which the mobile user is expected to move. An important issue with regards to these mechanisms is to minimize the waste of resources caused by redundant reservations while keeping up the QoS guaranteed services to the user In this paper, we propose a wireless network domain structure which deploys a special cell, called “a gray cell”. The boundaries of two or more neighboring domains are surrounded by the gray cells, and the gray cells are supposed to belong to all of its neighboring domains. Based on this wireless domain structure, we propose a mechanism which completely removes the waste of redundant resource reservation in the wireless network domain while greatly reducing the risk of reservation disruption caused by inter-domain handover. Using simulation, it is shown that the proposed mechanism can deal with inter-domain handover as effectively as it does with intra-domain handover. It is also presented that the proposed mechanism outperforms existing mechanisms with respect to reservation disruption time and packet losses caused by handovers.

Dynamic resource reservation scheme for connection rerouting on ATM-based PCN (ATM-based PCN에서의 연결재라우팅을 위한 유선망자원 예약방안)

  • 장경훈;심재정;김덕진;강경훈
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.11-20
    • /
    • 1997
  • It is a recent trend that mobile communications and PCS are intergrated into the broadband network. Broadband mutlimedia traffic will be transported over the integrated network. In this paper, we propose a connection re-routing method for fast inter-switch hadoffs and dynamic resurce reservation scheme, which is based on the proposed re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing, the proposed re-routing method is to reserve VPI/VCIs for possible inter-swich handoff calls in advance. Our reservation scheme is to statistically reserve the fixed resources for possible inter-switch handoff calls, according to the QoS of the handoff calls. The simmulation reslts show that our proposed scheme satisfies the required QoS of handoff calls and keep the dropping probability of handoff calls lower than other schemes.

  • PDF

A Design of Resource Reservation Mechanism with Micro Host Mobility (단말의 마이크로 이동성을 고려한 자원예약 메커니즘의 설계)

  • Koh, Kwang-Sin;Cha, Woo-Suk;Ahn, Jae-Young;Cho, Gi-Wan
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.733-742
    • /
    • 2002
  • It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.

Handoff QoS guarnatee on ATM-based wired/wireless integrated network (ATM기반 유무선 통합망에서 이동성으로 인한 핸드오프 QoS보장 방안)

  • 장경훈;강경훈;심재정;김덕진
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.10
    • /
    • pp.33-51
    • /
    • 1997
  • On ATM-based wired/wireless integrated network, we apply the connection re-routing method[1] which reduced the inter-cluster handoff delay by reserving VPI/VCLs for possible inter-cluster handoff calls in advance. Additionally, we propose wired resource reservation methods, which are ausiliary method and split method, for handoff QoS guarantee of various expected services. The characteristics of these methods reserve wired connection resources based on the information on the possible inter-cluster handoff calls. With mathematical analysis, we also propose each algorithm and cost function for deciding an optimal amount in reserving resources. With numberical examples, we can see that the auxiliary method effectively reduces the cost in all cases(.alpha.>.betha., .alpha.=.betha., and .alpha.<.betha.). The split method has a little cost-reduction effects, when handoffs call does not have priority over new calls (that is, .alpha..leq..betha.) and the total capacity is relatively large. In other cases, the split method, however, has effective cost-reduction effects. The numerical resutls show that these reservation methods ca flexibly cope with the time-variant environment and meet the QoS requriements on the inter-cluster handoff calls.

  • PDF

An Implementation of Bandwidth Broker Based on COPS for Resource Management in Diffserv Network (차별화 서비스 망에서 COPS 기반 대역 브로커 설계 및 구현)

  • 한태만;김동원;정유현;이준화;김상하
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.518-531
    • /
    • 2004
  • This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.

  • PDF