• 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 KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.975-983
• /
• 1999

최근 네트워크의 속도가 빨라지고 멀티미디어 데이터를 다루기 위한 기술들이 개발됨에 따라 많은 멀티미디어 응용 프로그램들이 인터넷에 등장하고 있다. 그러나 이들 응용프로그램들은 수신자에게 전송되는 영상.음성의 품질이 낮기 때문에 기대만큼 빠르게 확산되지 못하고 있다. 영상.음성의 품질이 낮은 이유는 현재 인터넷이 실시간 응용프로그램이 요구하는 만큼 빠르고 신뢰성 있게 데이터를 전송할 수 없기 때문이다. 현재 인터넷의 내부구조를 바꾸지 않고 품질을 높이기 위해 많은 연구들이 진행되고 있는데 그 중 하나는 동적으로 변화하는 인터넷의 상태에 맞게 멀티캐스트 트래픽의 전송율을 조절하는 종단간의 흐름제어이다. 본 논문은 기존의 흐름제어 기법인 IVS와 RLM의 성능을 개선시키기 위한 두 가지 흐름제어 기법을 소개한다. IVS는 송신자가 주기적으로 측정된 네트워크 상태에 따라 전송율을 일정하게 조절한다. 송신자가 하나의 데이타 스트림을 생성하는 IVS와는 달리 RLM에서는 송신자가 계층적 코딩에 의하여 생성된 여러개의 데이타 스트림을 전송하고 각 수신자는 자신의 네트워크 상태에 맞게 데이타 스트림을 선택하는 기법이다. 그러나 IVS는 송신자가 전송율을 일정하게 증가시키고, RLM은 각자의 네트워크 상태를 고려하지 않고 임의의 시간에 하나 이상의 데이타 스트림을 받기 때문에 성능을 저하시킬 수 있다. 본 논문에서는 TCP-like IVS와 Adaptive RLM이라는 두 가지 새로운 기법을 소개한다. TCP-like IVS는 송신자가 전송율을 동적으로 결정하고, Adaptive RLM은 하나 이상의 데이타 스트림을 받기 위해 적당한 시간을 선택할 수 있다. 본 논문에서는 시뮬레이션을 통해 여러 가지 네트워크 구조에서 두 가지 방식이 기존의 방식에 비하여 더욱 높은 대역폭 이용율과 10~20% 정도 적은 패킷손실율을 이룬다는 것을 보여준다.Abstract Nowadays, many multimedia applications for the Internet are introduced as the network gets faster and many techniques manipulating multimedia data are developed. These multimedia applications, however, do not spread widely and are not fast as expected at their introduction time due to the poor quality of image and voice delivered at receivers. The poor quality is mainly attributed to that the current Internet can not carry data as fast and reliably as the real-time applications require. To improve the quality without modifying the internal structure of the current Internet, many researches are conducted. One of them is an end-to-end flow control of multicast traffic adapting the sending rate to the dynamically varying Internet state. This paper proposes two flow-control techniques which can improve the performance of the two conventional techniques; IVS and RLM. IVS statically adjusts the sending rate based on the network state periodically estimated. Differently from IVS in which a sender produces one single data stream, in RLM a sender transmits several data streams generated by the layered coding scheme and each receiver selects some data streams based on its own network state. The more data streams a receiver receives, the better quality of image or voice the receiver can produce. The two techniques, however, can degrade the performance since IVS increases its sending rate statically and RLM accepts one more data stream at arbitrary time regardless of the network state respectively. We introduce two new techniques called TCP-like IVS and Adaptive RLM; TCP-like IVS can determine the sending rate dynamically and Adaptive RLM can select the right time to add one more data stream. Our simulation experiments show that two techniques can achieve better utilization and less packet loss by 10-20% over various network topologies.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1438-1449
• /
• 2011

UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.643-645
• /
• 2010

The Internet-based multimedia services such as IPTV is being expanded with the development of technology to support the convergence of broadcasting and telecommunications technology for the control seems to be growing larger. Especially for the real-time TV broadcast multicast control technology to support the authentication and resource control, in addition to the technology services that enhance the value of technology for a variety of services in both directions seems to be developed. And, Internet-based transmission system transmit the video content for the video content delivery using RTP(Real Time Transport Protocol). Standardization body, IETF(Internet Engineering Task Force) within the RTP, according to a variety of audio and video formats only transmission format(RTP Payload Format) Establish a separate standard and scalable video content "RTP Payload Format for SVC(Switched Virtual Connection) Video" the standardization is currently processing. In this paper we are improving the quality of broadcasting and telecommunication systems, so that the upper layer by the application can react adaptively to the existing MPEG2-TS and RTP who are provided by a variety of content applied to a variety of devices consumers ETE(End- to-End) QoS(Quality of Service) for enhance the system who was designed and implemented.

• 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.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.24-37
• /
• 2001

This paper deals with our experience for the design and implementation of Transport and Session managers in the Integrated Streaming Service Architecture (IS SA) that was developed by the authors. The ISSA is a streaming framework that allows to develop integrated multimedia streaming applications such as VOD system in unicast/multicast and real-time broadcastOive-cast). It also facilities standard real-time transport protocols such as RTp(Real-Time Transport Protocol)/RTCP(Real-time Control Protocol) and RTSP(Real-Time Streaming ProtocoD that allows to user openness. The ISSA supports diverse media fonnats and is independent from underlying networks and operating systems, and compatible with the global real-time multimedia database system (BeeHive) so that streaming media are efficiently retrieved, stored, and serviced. The role of the Transport Manager is to do packetization and depacketization for the different types of multimedia data and delivers the packetized media data in real-time. The Transport Manager uses RTP protocol. The role of the Session Manager is to establish and control the media channel by using RTSP protocol and to deliver the database transactions for the multimedia database by using RTTP(Real-Time Transaction Protocol) protocol. Both the Transport and Session Manager are doing their functions through the network interface in the ISSA that allows developers to various network programming interfaces and provides flexibility to the system.

• 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.3 no.1
• /
• pp.81-90
• /
• 2002

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems. Load balancing, unpredictable communication delays, and networking failures can be the example of the series of problems. Therefore. sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted group communication, CORBA does not address these paradigms adequately. It mainly deals with point-to-point communication and does not support the development of reliable applications that include predictable behavior in distributed systems. In this paper, we present our design, implementation and performance analysis of the group communication using the CORBA-ORB. JAVA-RML and Socket based on distributed computing Performance analysis will be estimated latency-lime according to object increment, in case of group communication using ORB of CORBA the average is 14.5172msec, in case of group communication using RMI of Java the average is 21.4085msec, in case of group communication using socket the average is becoming 18.0714msec. Each group communication using multicast and UDP can be estimated 0.2735msec and 0.2157msec. The performance of the CORBA-ORB group communication is increased because of the increased object by the result of this research. This study can be applied to the fault-tolerant client/server system, group-ware. text retrieval system, and financial information systems.

• 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.