• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.1
• /
• pp.23-35
• /
• 2008

Mobile IP (MIP) is the solution supporting the mobility of Mobile Nodes (MNs), however, it is known to lack the support for NEtwork MObility (NEMO). NEMO manages situations when an entire network, composed of one or more subnets, dynamically changes its point of attachment to the Internet. NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this weakness, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents, especially when a large number of Mobile Routers (MRs) and MNs exist in the environment such as train, bus, ship, or aircraft. In this paper, a solution to reduce the cost of delivering the BU messages is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to 32.9% over IPDbased, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.52-63
• /
• 1998

In this paper, several improvements to a copy network proposed previously for multicast packet switching are described. The improvements provide a solution to some problems inherent in multicasting. The input fairness problem caused by overf low is solved by a dynamic starting point decider(DSD), which can calculate running sums of copy requests starting from any input port. The starting point is changed adaptively in every time slot based on both the fill level of the input buffers in current time slot and the overflow situations of the previous time slot. Using the fill level of the conventional network. The DSD also provides the function of regulating overall copy requests according to the amount of input traffics. This is an essential function in improving overall throughputs of the copy networks. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the DSD in a straightforward manner. The hardware for the DSD is derived with the objective of simple architectures for the high speed operation. Simulation study of the copy network under various traffic conditions is presented to evaluate its performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.1-8
• /
• 2005

In this paper, we study a call admission control algorithm for supporting multicast service under the BcN environment where broadcasting, communication and Internet are converging to be one. It is necessary to control service requests with a certain criteria in order to guarantee QoS because the system capacity is limited. As a possible solution, we divide one multicast service into 3 classes and set up a threshold per each class to control service request. Especially, for the purpose of system benefit, we define system pay-off rate 'GAIN' with the term 'Reward' and 'Penalty' according to admit and reject service request. And we confine the range of threshold which makes GAIN to be maximized. For the performance analysis, we model the system as M/M/m/m queueing system, investigate GAIN under various conditions and show the effectiveness of the proposed algorithm.

• 한국ITS학회:학술대회논문집
• /
• 2010.05a
• /
• pp.145-147
• /
• 2010

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.356-356
• /
• 2006

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.210-210
• /
• 2006

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.463-463
• /
• 2006

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.90-90
• /
• 2004

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.249-252
• /
• 2001

This paper focuses on the consideration of not only QoS parameters in wired network, but also QoS parameters in wireless network that supported for the Efficient QoS in the Al1 Service Levels. So, We supposed the "Efficient QoS Model" that guaranteed the QoS parameters "Loss Profile" , "Service Degradation" , "Latency and Jittering" , "Mobility of Mobile User" , "Probability of seamless communication" in wired-wireless networks. And the Method of Efficient QoS support that we supposed consists of "Multicast Routing-RSVP Protocol architecture based on Mobile IP" and "Protocols internetworking model ".

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3206-3213
• /
• 1998

피코셀룰라망은 셀 반경이 수십 미터 내외인 피코셀로 구성된다. 작은 셀은 이동 호스트의 작은 핸드오프를 초대한다. 이동 사용자에게 중단없는 연결 서비스를 제공하기 위해서는 새로운 핸드오프 방법이 필요하다. 본 논문에서는 멀티캐스트 연결에 기초한 핸드오프 방법을 제안한다. 제안한 방법(SGMH: SubGroup Multicast-based Handoff)은 핸드오프 처리 지연뿐만 아니라 버퍼 오버헤드를 최소화한다. 분석과 시뮬레이션을 통해 블록킹 확률에 대해 성능 평가를 했다.