• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.490-508
• /
• 2013

One of the most important scalability issues facing the current Internet is the rapidly increasing rate of BGP updates (BGP churn), to which route flap and path exploration are the two major contributors. Current countermeasures would either cause severe reachability loss or delay BGP convergence, and are becoming less attractive for the rising concern about routing convergence as the prevalence of Internet-based real time applications. Based on the observation that highly active prefixes usually repeatedly explore very few as-paths during path exploration, we propose a router-level mechanism, Path Exploration Aggregation (PEA), to scale BGP without either causing prefix unreachable or slowing routing convergence. PEA performs aggregation on the transient paths explored by a highly active prefix, and propagates the aggregated path instead to reduce the updates caused by as-path changes. Moreover, in order to avoid the use of unstable routes, PEA purposely prolongs the aggregated path via as-path prepending to make it less preferred in the perspective of downstream routers. With the BGP traces obtained from RouteViews and RIPE-RIS projects, PEA can reduce BGP updates by up to 63.1%, shorten path exploration duration by up to 53.3%, and accelerate the convergence 7.39 seconds on average per routing event.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.749-766
• /
• 2021

Cyber powers around the world are conducting cyber information-gathering activities in cyberspace, a global domain within the Internet-based information environment. Accordingly, it is imperative to obtain the latest information through the cyber intelligence preparation of the battlefield (IPB) process to prepare for future cyber operations. Research utilizing the cyber battlefield visualization method for effective cyber IPB and situation awareness aims to minimize uncertainty in the cyber battlefield and enable command control and determination by commanders. This paper designed architecture by classifying cyberspace into a physical, logical network layer and cyber persona layer to visualize the cyber battlefield using BGP archive data, which is comprised of BGP connection information data of routers around the world. To implement the architecture, BGP archive data was analyzed and pre-processed, and cyberspace was implemented in the form of a Di-Graph. Information products that can be obtained through visualization were classified for each layer of the cyberspace, and a visualization method was proposed for performing cyber IPB. Through this, we analyzed actual North Korea's BGP and OSINT data to implement North Korea's cyber battlefield centered on the Internet network in the form of a prototype. In the future, we will implement a prototype architecture based on Elastic Stack.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.20-25
• /
• 2021

In the background of the rapid development of the IoT, smart home work is becoming more and more important to each science and technology company. Smart home provides a safe, comfortable, high-quality, high-performance smart home living space compared to general homes, and at the same time It is responding to the low-carbon, eco-friendly global trend. Growth drivers driving the smart home market are increasing the number of Internet users, increasing disposable income in developing countries, increasing the importance of remote home monitoring, and increasing the need for energy saving and low carbon. In 2013-2014, Xiaomi launched a series of smart routers and smart home hardware devices. In 2015, it announced the latest product of the Xiaomi Ecological Chain, the "Smart Home Package," and in 2016 launched the MIJIA brand to invest in various smart product companies. In 2017, Xiaomi announced a plan to build an open smart hardware MIOT platform. We investigated the management strategy of Xiaomi home smart service based on IOT. The management strategy was divided into cost lead strategy, differentiation strategy of Xiaomi home service, and AIOT strategy of Xiaomi smart home.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.406-413
• /
• 2013

In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.3
• /
• pp.135-149
• /
• 2008

Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but they have a limitation to figure out the pattern of the distributed global scale network attack. In this paper, we propose an efficient and fast method for detecting distributed global-scale network attack symptoms in high-speed backbone networks. The proposed method is implemented at the aggregate traffic level. So, our proposed scheme has much lower computational complexity, and is implemented in very high-speed backbone networks. In addition, the proposed method can detect attack patterns, such as attacks in which the target is a certain host or the backbone infrastructure itself, via collaboration of edge routers on the backbone network. The effectiveness of the proposed method are demonstrated via simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1752-1767
• /
• 2015

As a special type of mobile ad-hoc network, Vehicular Ad-hoc Network (VANET) is considered as an attractive topic by many researchers. In VANETs, vehicles act as routers and clients, which are connected with each other through unreliable wireless links. Due to the dynamic nature of vehicles, developing communication protocols for VANETs is a challenging task. In this paper, we tackle the problem of real-world VANET operations and propose a new dual-level communication scheme through the combination of power and rate control algorithms. Based on the game theoretic approach, the proposed scheme effectively formulates the interactive situation among several vehicles. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse VANET environments.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.1-4
• /
• 2005

Information communication environment integrates communication, broadcasting and internet, and Digital Convergence service emerges in result. Thus, the effective routers are needed so that they can transmit a huge number of data to core internet through appropriate base center. Therefore, the network guaranteeing QoS in transport layer supports interoperability with different wireless networks. So as to users receive necessary information anywhere seamlessly, the network architecture focuses on packet transmission and it is efficient for the control layer switches and controls packets between different networks. Since individual users take advantage of different services and data, the effective router architecture must be designed. Hence in this paper we design monitoring technique to solve security problem and to support premium service to ultimate users. Thereafter, we run opnet simulation and show the improvement of proposed router architecture.

• Journal of Science and Technology Studies
• /
• v.10 no.1
• /
• pp.73-106
• /
• 2010

Internet users want to use IP sharing routers for reducing their cost and managing their terminals easy. Network service providers(NSPs) forced their subscribers pay extra charges to use extra terminal like IP router, since 1998 in Korea. The NSPs asserted that IP sharing routers would harm their networks or would impose extra load on their networks, but they were unable to prove their assertion. Users and manufacturing companies insisted on the legitimacy of IP routers, because the IP router is a kind of terminal for end-users, and as such, the right of selection of an IP router belongs to the user. The interest in and beliefs of the relevant social groups about IP router will be deduced through their interpretation. It draws the technological frame of two social groups, NSPs and IP router-manufacturing companies. The rough struggle between two social groups come from their frames. The article shows how society constructs a particular information technology.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.