• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.89-94
• /
• 2012

In this paper, we considered the performances of PMIPv6 and DMM in the viewpoints of traffic load change and packet delivery latency time, where a new buffering in the previous MAAR is proposed to reduce packet loss during handover. To show the superiority of the DMM and to validate the operation of the buffering scheme, we accomplished its simulation under the typical handover. Our performance comparison results show that the DMM is better than the performance of traffic load change and packet delivery latency time of PMIPv6. We can see that the proposed buffering scheme is better than the existing one in terms of packet loss.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.323-332
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two schemes in terms of the reference time used in calculating the timestamp of arriving packet; the Finish-Time (FT) and Start-Time (ST) schemes. The FT scheme, used in most schedulers, that has the property of an inversely rate-proportional latency is suitable to support various delay bounds because it can adjust the latency of a flow with raising the flow's reserved rate. However, the scheme may incur some bandwidth loss due to excess rate reservation. Meanwhile, although the ST scheme does not suffer from the bandwidth loss, it is hard to support multiple delay bounds because of its latency property relying on the number of flows. This paper is devoted to propose a ST scheme based scheduler to effectively support multiple delay bounds and analyze its performance comparing to the FT scheme based scheduler. The comparison results show that the proposed scheduler gives better utilization by up to 50%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1207-1214
• /
• 2002

A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks support a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of O(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these properties, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2002

IETF proposed Fast Handover mechanism tn reduce the latency during which the mobile node is effectively dusconnected from the Internet. In this paper, we propose three buffering strategies and a bicasting strategy to resolve packet loss and packet disordering problems in Fast Hangover mechanism. Through Java-based simulation we show thats, packet loss and disordering problems have been resolved by our proposal. As the result the buffering and bicasting strategies can reduce the handover delay caused by packet loss and packet disordering, in addition.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1536-1546
• /
• 2008

RSVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing (WFQ) algorithm to secure required qualities of traffic flows. A RSVP-capable router based on the LOFQ (Latency optimized fair queuing) algorithm had been proposed to improve the performance of the WFQ-based RSVP-router, but it required not only the RESV message to be expanded but also its performance could be evaluated only through simulation. This paper proposed a LOFQ based RSVP-capable router using the conventional RESV message and developed an algorithm to analyze the performance of the LOFQ based RSVP-capable routers. The performance evaluation using the developed algorithm showed that in terms of performance improvement the proposed router is inferior to the one using the expanded RESV message under a small packet size, but on the range of a large packet size both routers provide the same improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.495-501
• /
• 2011

IEFT proposed MIPv6 for supporting IP movement. Mobile Node is involved signaling that cause handover latency in MIPv6. Recently, Proxy Mobile IPv6 is proposed by IETF for network-based mobility management to reduce overhead in mobile node still suffers from packet loss. PMIPv6 can decrease handover latency which related overhead in MN by using network agent. Therefore, MIPSHOP Working Group proposed fast handover for PMIPv6, fu this paper, we proposed packet bicasting scheme on dual interface mobile node that can support fast handover using PMIPv6 schemes. Further, a numerical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with another procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.377-386
• /
• 2008

In this paper, a new handover management scheme has been proposed to reduce handover latency and to support fast handover without packet losses, so that it may be applicable to the wireless mobile Internet system such as IPv6-based WiBro system. To minimize the handover latency in processing of movement detection, we propose the handover management scheme which simplifies the handover message exchanging procedure between mobile subscriber station (MSS) and network by integrating layer 2 and layer 3 handovers efficiently based on the layer2 information. To reduce the processing delay from new care-of-address (NCoA) configuration during handover, we propose that NCoA is created, distributed and managed by new access control router (NACR). In addition, in order to minimize the packet transmission delay and eliminate the packet losses, the proposed scheme employs a crossover router (CR) which is upper network located over PACR and NACR and employs the packet buffering for MSS. The simulation study shows that the proposed scheme achieves loss-free packet delivery and low latency in the environment of narrow overlapped cell area or high velocity of the MSS, comparing the performance with the conventional schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.1-10
• /
• 2009

In a network-based approach such as Proxy Mobile IPv6 (PMIPv6), the serving network controls the mobility management on behalf of a Mobile Node (MN), thereby eliminating a MN from any mobility-related signaling. Although PMIPv6 is being standardized by the IETF NetLMM WG, PMIPv6 still suffers from a lengthy handover latency and the on-the-fly packet loss during a handover. Therefore, this paper presents an enhanced fast handover scheme for PMIPv6. The proposed handover scheme uses the Neighbor Discovery message of IPv6 to reduce the handover latency and packet buffering at the Mobile Access Gateway (MAG) to avoid the on-the-fly packet loss during a handover. In addition, it uses an additional packet buffering at the Local Mobility Anchor (LMA) to solve the packet ordering problem. We evaluate the performance of the proposed handover scheme using both analytical model and simulation. The numerical analysis shows that the proposed scheme has a relatively shorter handover latency. Simulation results demonstrate that the proposed scheme could avoid the on-the-fly packet loss and ensure the packet sequence.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.331-338
• /
• 2006

Most fair packet schedulers supporting quality-of-services of real-time multimedia applications are based on the finish time design scheme in which the expected transmission finish time of each packet is used as its timestamp. This scheme can adjust the latency of a flow with raising the flow's scheduling rate but it may suffer from severe bandwidth loss due to the coupled rate and delay allocation. This paper first introduces the concept of delay resource, and then proposes a scheduling method to improve the bandwidth utilization in which delay resource being lost due to the coupled allocation is transformed into bandwidth one. The performance evaluation shows that the proposed method gives higher bandwidth utilization by up to 50%.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.113-121
• /
• 2004

Existing Cellular IP increases the network traffic load, packet loss and handoff latency because of duplicate packet. In this paper, we propose using a Combined Cache that unites a pasing cache with a routing cache and a Improved Adaptive Semi-soft handoff that minimizes to occur the duplicate packet. As a computer simulation, we consider packet loss, handoff latency and traffic load in network. In proportion the number of nodes, mobile hosts and downlinks of node in access network increased, the proposed method is largely improved in comparison with existing Cellular If that uses semi-soft handoff.