• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.345-354
• /
• 2008

Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.80-92
• /
• 2007

IPTV Services that is representative union service of broadcasting and telecommunication need guarantee of QoS, efficiency of multicasting, and hish bandwidth on the network. Because typical TDM based metro transport network was designed by transporting fixed voice traffic with stable and recovering method, it has a defect of bottleneck and a waste of bandwidth for acceptance of data traffic with burst feature and then all of data are treated equally at the transport network because it cannot classify between advanced high end service and best effort low end service. for completely resolving this kind of problem about increasing burst traffic and QoS issues, firstly we need to new design for transport network. This paper presents transformation method from TDM based metro transport network to packet based transport network and advantage and effectiveness of packet based transport network and also indicates technical factor and characters about method of packet transport system. As a result of research, the Packet Transport System, which is a transmission network for packet delivery, take in not only a specific character of legacy TDM but QoS, Multicast and high bandwidth, then, it is able to keep an effective bandwidth and a stabilized performance of packet transmissions. Additionally, if a fault be occurred on an optical link, the system is able to guarantee a differential QoS by an each service class using an algorithm to make certain of a traffic existence and contain a protective mechanism.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.215-224
• /
• 2013

With the rising popularity of smart-phones, the supply of Internet protocol television is largely increased and it causes the wireless communication network load to be increased. To overcome such an overloading problem, 3GPP is now working on the standardization of MBMS since LTE Release 6 specification. MBMS has good performance in bandwidth efficiency by sharing the same bandwidth with the mulitple MBMS users having the same content. According to the proposed algorithm, in heterogeneous networks having a dispersed Single-cell MBMS where 3GPP network and Wi-Fi network are mixed, if the number of MBMS users, who are belonging to cells supporting a dispersed Single-cell MBMS, is more than a specified threshold, the MBMS priority policy is operated. Otherwise, the Wi-Fi priority policy is executed. As the simulation results show both the increase of total available bandwidth ratio and the decrease of network usage cost, it is confirmed that the proposed scheme allows the network efficiency to be maximized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.101-110
• /
• 2011

With the deployment of broadband networking technology, many clients are enabled to receive various Video on Demand (VoD) services. To support many clients, the network should be designed by considering the following factors: viewer's waiting time, buffer requirement at each client, number of channel required for video delivery, and video segmentation complexity. Among the currently available VoD service approaches, the Polyharmonic and Staircase broadcasting approaches show best performance with respect to each viewer's waiting time and buffer requirement, respectively. However, these approaches have the problem of dividing a video into too many segments, which causes very many channels to be managed and used at a time. To overcome this problem, we propose Polyharmonic-Staircase-Staggered (PSS) broadcasting approach that uses the Polyharmonic and Staircase approaches for the head part transmission and the Staggered approach for the tail part transmission. It is simple and bandwidth efficient. The numerical results demonstrate that our approach shows viewer's waiting time is comparable to that in the Harmonic approach with a slight increase in the bandwidth requirement, and saves the buffer requirement by about 60\% compared to the Harmonic broadcasting approach by simply adjusting the video partitioning coefficient factor. More importantly, our approach shows the best performance in terms of the number of segments and the number of channels managed and used simultaneously, which is a critical factor in real operation of VoD services. Lastly, we present how to configure the system adaptively according to the video partitioning coefficient.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.65-78
• /
• 2009

The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns from them. Because mining frequent tree patterns has a wide range of applications such as xml mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms suffer from several serious pitfalls in finding frequent tree patterns from massive tree datasets. Some of the major problems are due to (1) modeling data as hierarchical tree structure, (2) the computationally high cost of the candidate maintenance, (3) the repetitious input dataset scans, and (4) the high memory dependency. These problems stem from that most of these algorithms are based on the well-known apriori algorithm and have used anti-monotone property for candidate generation and frequency counting in their algorithms. To solve the problems, we base a pattern-growth approach rather than the apriori approach, and choose to extract maximal frequent subtree patterns instead of frequent subtree patterns. The proposed method not only gets rid of the process for infrequent subtrees pruning, but also totally eliminates the problem of generating candidate subtrees. Hence, it significantly improves the whole mining process.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.751-762
• /
• 1998

The purpose of this study is to enhance the quality of multimedia service under the heterogeneous end-terminals and network environment by monitoring the data receiving status of the group members regularly when the sender multicasts real-time multimedia data to a group. Especially, it focuses to reduce the total number of status information responded to the sender from the receivers. Accordingly. it upgrades the sender's performance by suppressing the number of status information packets generated by the receivers. The key idea of this study starts from how we profile the activity of all the members in a group. We assume that the receiver status in the worst status, so called primary receiver, represents the status of the whole group. This means that the whole group is assumed as being degraded in performance if the primary receiver is degraded, and that the whole group is assumed as being upgraded if the primary one is upgraded. In this algorithm, the primary receiver announces its status information to the whole group prior to other receivers, ana every receiver listening to the primary and other receivers' status compares its own status with them. Accordingly, any receiver may give up the status notification in case its status is not worse than others, resulting in the reduction of unnecessary responses to the sender.