• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.695-698
• /
• 2007

The control of electrical appliances residing in the home network can be accomplished via Internet with the UPnP expansion without modifying an existing UPnP. In this paper, we propose the Internet Gateway that consists of an UPnP IGD(Internet Gateway Device) DCP(Device Control Protocol) and an UPnP Bridge as a system to control electrical appliances of home network. UPnP IGD DCP is to enable the configurable initiation and sharing of Internet connections as well as assuring advanced connection-management features and management of host configuration service. It also supports transparent Internet access by non-UPnP-certified devices. UPnP Bridge searches for local home network devices by sending control messages, while control point of UPnP Bridge looks up devices of interest on the Internet, subsequently furnishing the inter-networking controlling among devices which belong to different home network systems. With our approach, devices on one home network can control home electrical appliances on the other hone network via Internet through IGD DCP with control commands of UPnP.

• Journal of Navigation and Port Research
• /
• v.36 no.1
• /
• pp.1-7
• /
• 2012

A concept of the "e-Navigation" was introduced in 2005 and implementation strategies are under way by IMO/IALA in the maritime safety area. Specially VTS is an important maritime traffic monitoring and aids to navigation system which is aims to improve safety, navigation efficiency and protect the marine environment. The demand of the inter-VTS networking has been increased and standardization is underway for realization of shore side collaboration for maritime safety in IALA. But there may be security problems in the inter-VTS networks if they have not proper security mechanism. The hacking of realtime ship position and sensitive maritime surveillance information caused a critical accident of vessel, human life and environment by terrorist. This paper aims to design of a secure inter-VTS network structure and related security protocol for secure sharing of sensitive maritime data.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.781-786
• /
• 2004

In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.745-752
• /
• 2005

BGP is a unique routing protocol in broadband internet. It chooses routing paths considering internet hierarchy and local policies. As BGP routers selectively bypass routing information to a subset of neighboring BGP routers, connectivity by way of a series of links between source and destination nodes does not mean reachability of routing information of the two. In emergency when BGP routers or links over wide range are not available, BGP routers have to use links that are not normally used to keep reachability. This paper listed out the requirements for BGP backup routing and proposed a routing solution that hides most demerits in currently published ones. The proposed backup operates in three tiers according to network damage. Under this rule, BGP routers use tier-0 routing paths at normal. If networks are impaired, they choose tier-1 paths. If networks are seriously damaged, tier-2 paths are allowed to use. Also this paper proves that the proposed backup guarantees stability and safeness. As results, the proposed backup is very adaptive to light network damages as well as serious ones and provides strong routing reachability at all times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1655-1665
• /
• 2017

Recently data centers are being constructed actively by many cloud service providers, enterprises, research institutes, etc. Generally, they are built on tree topology using ECMP data forwarding scheme for load balancing. In this paper, we examine data center network topologies like tree topology and fat-tree topology, and load balancing technologies like MLAG and ECMP. Then, we propose a scheduling algorithm to efficiently transmit particular files stored on the hosts in the data center to the destination node outside the data center, where fat-tree topology and OpenFlow protocol between infrastructure layer and control layer are used. We run performance analysis by numerical method, and compare the analysis results with those of ECMP. Through the performance comparison, we show the outperformance of the proposed algorithm in terms of throughput and file transfer completion time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.406-425
• /
• 2012

Deploying advanced home networking technologies and modern home-networked devices in residential environments provides a playground for new home applications and services. Because home multimedia entertainment is among the most essential home applications, this paper presents an appealing home media content sharing scenario: home-networked devices can discover neighboring devices and share local media content, as well as enormous amounts of Internet media content in a convenient and networked manner. This ideal scenario differs from traditional usages that merely offer local media content and require tedious manual operations of connection setup and file transfer among various devices. To achieve this goal, this study proposes a proxy gateway architecture for home multimedia content distribution. The proposed architecture integrates several functional mechanisms, including UPnP-based device discovery, home gateway, Internet media provision, and in-home media content delivery. This design addresses several inherent limitations of device heterogeneity and network interoperability on home and public networks, and allows diverse home-networked devices to play media content in an identical and networked manner. Prototypical implementation of the proposed proxy gateway architecture develops a proof-of-concept software, integrating a BitTorrent peer-to-peer client, a UPnP protocol stack, and a UPnP AV media server, as well as media distribution and management components on the OSGi home gateway platform. Practical demonstration shows the proposed design and scenario realization, offering users an unlimited volume of media content for home multimedia entertainment.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.5 no.3
• /
• pp.27-45
• /
• 2010

It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.492-504
• /
• 2009

The delivery of multimedia that efficiently adapts its bit-rate to changing network characteristics and conditions is one of the important challenging tasks in the design of today's real-time multimedia streaming systems such as IPTV, Mobile IPTV and so on. In these work, the primary focus is on network congestion, to improve network stability and inter-protocol fairness. However, these existing works have problems which do not support QoE (Quality of Experience), because they did not consider essential characteristics of contents playback such as the media continuity. In this paper, we propose a novel rate control scheme for improving the QoE of multimedia streaming service in the Internet congestion, called NCAR (Network and Client-Aware Rate control), which is based on network-aware congestion control and client-aware flow control scheme. Network-aware congestion control of the NCAR offers an improving reliability and fairness of multimedia streaming, and reduces the rate oscillation as well as keeping high link utilization. Client-aware flow control of NCAR offers a removing the media discontinuity and a suitable receiver buffer allocation, and provides a good combination of low playback delay. Simulation results demonstrate the effectiveness of our proposed schemes.