• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2006.06b
• /
• pp.301-307
• /
• 2006

As container traffic in the world increases rapidly, size if containership is become bigger and bigger. With these trends, many studies have. been done on such big ships by consultant, naval architects, port designers, ship operators, economists etc,. with different points of view and results. But previous studies were concentrated on hardware and theoretical side. Therefore the objective of this paper is to analyze response and intention of ship's user such as shipping companies and forwarding companies about prospects of mega-ship size, preference of Mega ship, problem and handling time of Mega ship.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.727-732
• /
• 2015

These days, many researchers are working on Future Internet and a new networking paradigm called Software Defined Networking draws a great attention. In this paper, we redefine Software Defined Networking as Service Defined Networking which means that packets are categorized according to types of services. By using Service Defined Networking, we are not only dealing with the way to utilize the network resources efficiently but we also propose an algorithm to minimize the waiting time for packets to be delivered. This proposed algorithm can solve the delay problem, one of the most significant problems caused by network congestion. Also, since we are adopting Service Defined Networking, network resource utilization can be improved compared to the existing network.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.222-230
• /
• 2009

A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.227-234
• /
• 2002

MPLS which integrates routing of layer 3 and switching of layer 2, enables support for fast forwarding, traffic engineering and virtual private network services. GSMP is open interface protocol between a label switch and a controller, and it provides connection, configuration, event, performance management and synchronization. In the GSMP open interface, the functions of network management can be located either in the controller or in the label switch. To simplify the label switch and enhance the efficiency of resources, we adopt the network management model, in which the SNMP agent is located in the controller and is interworked with the GSMP. We presented the interworking scenrios between the GSMP and the network management of MPLS. We implemented the controller to verify the realization of our adopted network management model, and measured the connection setup delay of the provisioned connection.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.438-450
• /
• 2006

Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.929-938
• /
• 2015

In opportunistic networks, each message is delivered to the destination by repeating, storing, carrying, and forwarding the message. Recently, with the vitalization of social networks, a large number of existing articles have shown performance improvement when delivering the message and considering its social relational networks. However, these works only deliver messages when they find nodes, assuming that every node cooperates with each other unconditionally. Moreover, they only consider the number of short-term contacts and local social relations, but have not considered each node's average relation with the destination node. In this paper, we propose novel message sending techniques for opportunistic networks using nodes' social network characteristics. In this scheme, each message is delivered to the destination node with fewer copies by delivering it mostly through nodes that have high intimacy with the destination node. We are showing that our proposed scheme presents a 20% performance increase compared to existing schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.336-349
• /
• 2001

Intelligent Network (IN) is an architectural framework for the rapid and uniform provision of advanced services. Therefore, Next-generation IN platform should support fast service handling, the dynamic adaptation of various services according to various requirements of users. In this paper, we design and implement the Service Control Point (SCP) that is based on the Internet environment. Especially, we consider the service flexibility, the dynamic distribution of service and propose a set of mechanisms to optimize the performance of this platform. This SCP consists of the platform kernel to control intemal operations, tbe service manager to control all of services, SLPI (Service Logic processing Program Instance) manager to manage each service, and SLPI to handle service interaction. In addition, we propose the Service Creation Environment (SCE) to create easily services on the implemented platfonn and show the example of Call Forwarding service operated on this platform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.