• Title/Summary/Keyword: resource reservation protocol

Search Result 88, Processing Time 0.023 seconds

A Secure Location-Based Service Reservation Protocol in Pervasive Computing Environment

  • Konidala M. Divyan;Kim, Kwangjo
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2003.12a
    • /
    • pp.669-685
    • /
    • 2003
  • Nowadays mobile phones and PDAs are part and parcel of our lives. By carrying a portable mobile device with us all the time we are already living in partial Pervasive Computing Environment (PCE) that is waiting to be exploited very soon. One of the advantages of pervasive computing is that it strongly supports the deployment of Location-Based Service(s) (LBSs). In PCE, there would be many competitive service providers (SPs) trying to sell different or similar LBSs to users. In order to reserve a particular service, it becomes very difficult for a low-computing and resource-poor mobile device to handle many such SPs at a time, and to identify and securely communicate with only genuine ones. Our paper establishes a convincing trust model through which secure job delegation is accomplished. Secure Job delegation and cost effective cryptographic techniques largely help in reducing the burden on the mobile device to securely communicate with trusted SPs. Our protocol also provides users privacy protection, replay protection, entity authentication, and message authentication, integrity, and confidentiality. This paper explains our protocol by suggesting one of the LBSs namely“Secure Automated Taxi Calling Service”.

  • PDF

Resource Allocation scheme for WiMedia UWB MAC (WiMedia UWB MAC의 자원할당 방안)

  • Nam, Jungmin;Baek, Seungho;Huh, Jaedoo;Lee, Sungchang
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.1
    • /
    • pp.53-59
    • /
    • 2007
  • Wimedia UWB(Ultra-Wideband) platform provides data rates up to 480Mbps in WPAN (Wireless Personal Area Network). Wimedia conformant devices access to the channels through superframe concept for communications. As the channel resource is limited, the optimal channel time required for each device needs to be estimated to share the resource efficiently among the devices. In this paper, we propose a scheme to estimate the required channel time in a super frame to satisfy the QoS of the application on a device. The channel time is estimated from the service rate which is computed from the TSPEC of the application. In the process of the estimation, we take the frame overhead for data transmission as well as the overhead due to the acknowledgement scheme, preamble, and MDSU size into consideration. We also analyze and compare the throughputs for different acknowledgement scheme, preamble, and MDSU size situations. The estimated channel time required for a given service rate is allocated in the unit of MAS(Medium Access Slot).

  • PDF

A Weighted Fair Queuing Scheduler Guaranteeing Differentiated Packet Loss Rates (차별화된 패킷 손실률을 보장하는 가중치 기반 공정 큐잉 스케줄러)

  • Kim, Tae Joon
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1453-1460
    • /
    • 2014
  • WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

Dynamic Threshold-Based Multicast Scheme for N-Screen Services in Indoor and Ship Area Networks (선박 및 실내 N-스크린 서비스를 위한 동적 Threshold 기반 멀티캐스트 기술)

  • Hur, Kyeong;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1369-1376
    • /
    • 2015
  • A wireless bridge is essential to transmit control and managing information to sensors or instruments from a central integrated ship area network station. In this paper, a WiMedia Distributed-MAC(D-MAC) protocol is adopted for development of a seamless N-Screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU(One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a Dynamic Threshold-based Multicast(DTM) technology is proposed and analyzed. For this technology, a new Hard/Soft Vertical Region(HVR-SVR) based time slot allocation and a multicast resource reservation scheme are combined. From simulation results, proposed DTM scheme expands the number of time slots available for unicast and multicast realtime N-Screen reservations with various service time interval requests. Furthermore, it enhances performances in vewpoints of realtime N-Screen data reservation conflict and throughput.

An Efficient Dynamic Network Status Update Mechanism for QoS Routing (QoS 라우팅을 위한 효율적인 동적 네트워크 상태 정보 갱신 방안)

  • Kim, Jee-Hye;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.65-76
    • /
    • 2002
  • QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.

A Study of Routing and Signaling Extensions of GMPLS for QoS Provision in NGN (NGN에서 QoS 제공을 위한 GMPLS의 라우팅 및 시그널링 화장 연구)

  • 장석기;박광채
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.925-933
    • /
    • 2003
  • Network is expected to be developed into optical Internet network collected IP layer and optical layer, but GMPLS is risen at the transitional evolution stage because of the present technology level. GMPLS that MPLS is extended and generalized is able to support not only the packet switching device but also the devices which perform switching in time, wavelength, and space domain. To implement the common control plane to these various switching types, GMPLS extends the existing MPLS signaling and routing protocol. In this paper, we describe the overview of GMPLS technology, and then we will refer to the OSPF(Open Shortest Path First), which was used to exchange the status information of link, as the plan of routing extension to exchange the information of various link type, bandwidth, link protection type etc. And also, we describe the definition of new protocol, so called, LMP that is a signaling protocol for solving complex problem which manages hundreds and thousands of links between two nodes. And we will examine and analyze the plan of signaling protocol extension to apply signaling protocol RSVP-TE(Resource Reservation Protocol) for traffic engineering in MPLS to network, and the message objects and formats associated with modified RSVP.

An Efficient Soft Handoff Scheme Using Enhanced Resource Resonation Technique in Wireless MIPv6 Networks

  • Park, Tae-Hyun;Park, Ho-Ryong;Chun, Sang-Hun;Kwak, Kyung-Sup
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.571-574
    • /
    • 2002
  • In a recent wireless network environments, dynamic host configuration protocol (BHCP) service is used to assign IP addresses to mobile terminals. In IPv6 networks, it is necessary to introduce the concept of handoff to support a seamless service to mobile terminals. In a general soft handoff technique used by code-division multiple acces (CDMA) communication systems, the powers received to base station are simply compared to determine which base station will handle the signal to and from each mobile termins. However, in IPv6 network, to transmit data-oriented services, it is necessary to support an enhanced soft handoff technique with more security and quality of service. In this paper, we propose a scheme to reduce a signaling process of handoff in IPv6 network. Also, we propose a technique to reduce wasted reservation resources and to guarantee quality of service (QoS) using DHCP.

  • PDF

Optimum AR Discovery On The MIPv6 Access Network (MIPv6 무선접근망에서 MN의 최적 AR 발견 방안)

  • 김지영;정재일
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.205-207
    • /
    • 2003
  • AII IP망으로써의 성격을 지닌 차세대 인터넷망의 구축은 앞으로 다양한 서비스의 제공은 물론, 새로운 접속 기술의 개발을 앞당기게 될 것이다. 앞으로 제공될 서비스들은 시간에 민감하고, 대용량의 대역폭을 요구할 뿐만 아니라, 이동 중에도 적합한 서비스 품질(QoS Qualify of Service)의 보장을 요구한다. 현재, 호스트가 이동 중에 접점을 변경할 경우, 서비스의 무결절성을 보장해 주기 위해 가장 활발하게 연구가 진행되고 있는 protocol은 MIPv6(Mobile IPv6)이다. 그러나 MIPv6는 Best Effort 패킷 전송을 위해 디자인 되어 있기 때문에 QoS 보장 부분이 미약하다. 따라서 QoS 보장을 위해 IntServ에서 QoS 지원을 위해 구현된 시그널링 프로토콜인 RSVP(Resource Reservation)와의 연동에 관한 연구들이 많이 진행되고 있다. 본 논문에서는 무선 access망에서 MIPv6와 RSVP를 기반으로 MN(mobile node)에게 서비스를 제공 해줄 수 있는 여러 AR(Access Router)들로부터 정보를 받아 저장하고 가장 적합한 AR을 찾는 방법을 제안한다. 이를 통해 라우터의 가용 자원에 따라 MN이 접점을 이동한 경우 적절한 AR로 빠른 핸드오프가 가능하여 핸드오프 시 발생되는 지연 시간(latency)을 감소 시켜 줄 수 있다.

  • PDF

An QoS Support Mechanism Using Hierarchical Dynamic Anchor Agent in Mobile IP Environment (Mobile IP 환경에서 계층적 동적 앵커 에이전트를 이용한 QoS 지원 방안)

  • Cha, Woo-Suk;Cho, Gi-Hwan
    • Annual Conference of KIPS
    • /
    • 2003.05b
    • /
    • pp.1489-1492
    • /
    • 2003
  • 이동 컴퓨팅 환경에서 사용자의 이동 특성은 실시간 멀티미디어 서비스를 제공하기 위해서 요구되는 QoS(Quality of Service)에 심각한 영향을 미친다. RSVP(Resource reservation Protocol)는 유선을 기반으로 실시간 서비스를 제공하기 위해서 제안된 프로토콜로써 이동 환경에 적용하기에는 부적합하다. MRSVP(Mobile RSVP)는 RSVP를 기반으로 사용자의 이동이 QoS에 미치는 영향을 최소화하기 위해서 사용자가 이동할 것으로 예상되는 영역에 대한 자원을 미리 예약하는 프로토콜이다. 본 논문은 기존의 MRSVP를 확장하여 Mobile IP 지역등록(Regional Registration) 프로토콜과 이웃 라우터 발견 메커니즘(Neignbor Router Discovery Mechanism)을 결합하여 동적 앵커 에이전트(DAA: Dynamic Anchor Agent)를 계층적으로 구성하는 QoS지원 방안을 제안한다. 이는 기존의 MRSVP에서 미리 예약되는 자원예약 범위를 네트워치 위상을 고려하여 지역적으로 제한함으로써 자원예약을 최소화하는 반면에 기존의 MRSVP와 유사한 수준의 QoS 보장을 목적으로 한다.

  • PDF

Resource Reservation Protocol For Mobile Hosts (이동 호스트를 위한 자원 예약 프로토콜)

  • Park, Jin;Suh, Young-Joo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.142-144
    • /
    • 2001
  • 멀티미디어 에플리케이션과 모바일 컴퓨팅지원은 현재 컴퓨터 시스템에서 가장 부각되는 두 가지 분야이다. 이 두 분야가 부각될수록 인터넷상에서 이동 호스트에게 QoS를 지원해야 할 펄요성은 더욱 커진다. RSVP는 송신 호스트와 수신 호스트간에 일정한 수준의 QoS를 보장하기 위한 자원 예약 프로토콜이다. 그러나 RSVP는 유선 네트워크의 고정 호스트들을 위해서 설계되었기 때문에 이를 이동 네트워크에 그대로 접목하는 것은 적합하지 않다. 본 논문에서는 무선 네트워크에서 이동 호스트에게 QoS를 효율적으로 지원하기 위해서 '지역성'을 노려하는 새로운 프로토콜을 제안한다. 제안된 프로토콜을 주요 요소로서 LRP(지역 예약 관리자)와 그 예약 서비스 범위를 나타내는 타임아웃 값을 사용하고 모바일 IP의 루트 옵티마이제이션을 프로토콜 환경으로 사용한다.

  • PDF