• Title/Summary/Keyword: Advance reservation

Search Result 32, Processing Time 0.037 seconds

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.

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.

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.

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.

Reservation based Dispatching Rule for On-Time Delivery in System LSI Semiconductor FAB (시스템 LSI 반도체 FAB의 납기만족을 위한 예약 기반의 디스패칭 룰)

  • Seo, Jeongchul;Chung, Yongho;Park, Sangchul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.3
    • /
    • pp.236-244
    • /
    • 2014
  • Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

A QoS Guaranteed Mechanism Using the FRSVP in the Hierarchical Mobile IPv6 (계층적 이동 IPv6 네트워크에서 FRSVP를 이용한 QoS 보증 방안)

  • Kim Bo-Gyun;Hong Choong-Seon;Lee Dae-Young
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.419-428
    • /
    • 2005
  • This paper divides domains into the intra, inter domain according to the mobile node's movement and .proposes the Fast RSVP algorithm on the HMIPv6. It is done to advance reservation using L2 beacon signal when MN is located to overlapped cell area. In case of intra-region handoff, the advance reservation is reserved at the nearest common router and In case of inter-region handoff, it is done to advance reservation through the other site MAP's QA(QoS Agent) to the AR and optimize CN's path. Because of using the bandwidth efficiently and switching the data path quickly, the proposal algorithm minimizes the service disruption by data routing.

A Study on Factors Influencing Chinese Tourists' Intention to Use Online Travel Reservation Services (방한 중국인의 온라인 여행 예약 서비스 사용의도에 미치는 영향 요인에 대한 연구)

  • Han, Jing Hao;Kwon, Hyuk Jin;Kim, Dongsoo
    • The Journal of Society for e-Business Studies
    • /
    • v.18 no.4
    • /
    • pp.257-272
    • /
    • 2013
  • As visiting of Chinese tourists to Korea have increased gradually, Chinese people who use online travel reservation services for their visits to Korea have increased accordingly. In addition, the growth of the online reservation services in China is very rapid. Therefore, it is necessary to study the factors affecting the Chinese tourists' intention to use the online travel reservation services in order to advance e-business in the travel industry. This paper presents a new research model based on Technology Acceptance Model (TAM) including perceived risk, service factors, online reviews and user satisfaction. Also, it analyzes factors affecting the Chinese tourists' intention to use the online travel reservation services. The results of this study show that the key influencers of the online travel reservation services are perceived usefulness, perceived ease, and perceived risk. Additionally, based on these results, this paper proposes practical suggestions to solve the existing problems and improve online travel reservation websites in China.

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

Asymptotic Analysis on Service Differentiation with Customer Arrival Information (고객 도착 정보를 이용한 서비스 차별화에 관한 점근적 분석)

  • Choi, Ki-Seok
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.2
    • /
    • pp.115-135
    • /
    • 2008
  • An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

Constructing a Reservation Table for Automated Guided Vehicles in Port Container Terminal (컨테이너 터미널에서의 AGV의 교착방지를 위한 주행영역 예약 표 작성방법)

  • Jeon, Su-Min;Kim, Kap-Hwan
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.85-94
    • /
    • 2008
  • Automated Guided Vehicles (AGVs) are important equipment in automated container terminals. To utilize AGVs for transporting containers from a position to another, the deadlock is a serious problem that must be solved before they are deployed to real operations. This study assumes that traveling area for AGVs are divided into a large number of grid-blocks and, as a method of traffic control, grid-blocks are reserved in advance during the travel of AGVs. The purposes of the reservation are to make the room between AGVs and to prevent deadlocks. Because the size of an AGV is much larger than the size of a grid-block on guide paths, this study assumes an AGV may occupy more than one grid-block at the same time. This study suggests a method for constructing a table of reservation schedules by using a simulation. A sensitivity analysis was conducted to evaluate the performance of the reservation method in this study.

  • PDF