• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.721-733
• /
• 2010

In this paper, we propose a scalable content-based routing scheme for the tactical mobile ad-hoc networks where the nodes usually move together forming a group. Our scheme is classified as a content-based routing scheme based on publish and subscribe model. The nodes compose a cluster according to their position and interest. Our scheme allows multi-level cluster nesting. As a publish/subscribe model does, each node announces its interest to the cluster head who aggregates and announces the interests from cluster members to its neighbor cluster head. Actual data messages are delivered to the end node via cluster header in the reverse direction of the interest announcement. Using Qualnet simulator, we evaluated the performance of our scheme in comparison with two well-known content-based routing schemes. Simulation results show that our scheme maintains higher message delivery ratio as number of nodes increases whereas the two schemes show much lower delivery ratio. In addition, as the group mobility gets faster our scheme incurs less or similar control message overhead compared with the two schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.304-308
• /
• 2014

As users generate lots of contents anytime and anywhere with an explosive growth of the number of mobile devices, Content centric networking (CCN) has emerged as a new networking architecture. However, the efficient CCN routing scheme is required for ad hoc network support because of its one to one message exchange characteristics. So, this paper proposes the new CCN ad hoc routing scheme using on-demand approach, which includes the secure routing configuration scheme based on multiple hash operation. It is shown from the simulation that the proposed method can provide lower control overhead because of its two-fold routing configuration architecture.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.19-28
• /
• 2002

A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity. and asynchrony. Content-barred publish/subscribe systems are widely being studied to implement the extent notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

• ETRI Journal
• /
• v.36 no.5
• /
• pp.819-828
• /
• 2014

To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.10a
• /
• pp.32-35
• /
• 2001

현재 중. 소형조선소의 소헝선박설계는 실무자의 경험에 의해 설계가 이루어지고 있다. 이러한 이유로 지금까지 소형선박설계는 정보의 생성과 교환 및 축적이 원활하지 못해 많은 문제점을 가지고 있다. 본 연구에서는 소형선박설계의 정보 공유와 협동설계를 위한 방법으로 최근 인터넷의 발달로 인한 분산환경에서의 동시공학개념의 접근방법을 제시하였다. 이를 위해 소형선박의 초기설계에서 기본정보의 생성을 위한 주요치수선정 프로그램을 개발하고 생성된 정보의 공유를 위해 에이전트기반 시스템개념을 적용하고자 하였다. 특히 제어에이전트의 주요기능인 Content-Based Routing 개념을 제시함으로 에이전트를 기반으로 한 설계시스템의 통합화를 보이고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.78-87
• /
• 2015

Content-Centric Networking(CCN) is a new networking paradigm to search for the routing information needed to find a data from the content name, unlike conventional IP networks. In CCN, the mobility management, one of the CCN challenges, is consists of consumer mobility and content provider mobility. Among both, in the case of the content provider mobility, it requires too much overhead and time to update routing information on the corresponding routers. In this paper, we propose Popularity-based Pushing CCN(PoPCoN) which considers the content popularity to support effective mobility of content provider in CCN. Our proposed algorithm shortens content download time for the consumer and reduces the network overhead during mobility as compared to the existing approaches.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.355-365
• /
• 2011

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

• The Journal of Society for e-Business Studies
• /
• v.9 no.3
• /
• pp.277-288
• /
• 2004

The purpose of multimedia contents transmission is to resolve the large size and nonformal issues. Various multicasting technologies have been researched to support these issues. This paper suggests a technique to build multicast routing for safe and reliable transmission of multimedia contents. Network server nodes have their own weight with respect to communication loads. The weight is computed by a server's communication load with others. This suggests low delay routing with two or more edge server of content delivery network. We will show the weighted inter-server routing technique and analyze the network performance improvement caused by lower network traffic and delay.