• Title/Summary/Keyword: 네트워크 운용

Search Result 996, Processing Time 0.031 seconds

Rosary : Topology-Aware Structured P2P Overlay Network for CDN System (Rosary : CDN 시스템을 위한 구조화된 토폴러지-인식 P2P 오버레이 네트워크)

  • Shin Soo-Young;Namgoong Jung-ll;Park Soo-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.818-830
    • /
    • 2005
  • Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.

Adaptive Link Recovery Period Determination Algorithm for Structured Peer-to-peer Networks (구조화된 Peer-to-Peer 네트워크를 위한 적응적 링크 복구 주기 결정 알고리듬)

  • Kim, Seok-Hyun;Kim, Tae-Eun
    • Journal of Digital Contents Society
    • /
    • v.12 no.1
    • /
    • pp.133-139
    • /
    • 2011
  • Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

A Location Recognition and Notification Method of Attacker in Wireless Network Environment (모바일 환경에서의 공격자 위치 특정 및 알람 기법)

  • Bong, Jin-Sook;Park, Sang-Jin
    • Journal of Digital Convergence
    • /
    • v.15 no.7
    • /
    • pp.201-211
    • /
    • 2017
  • Wireless network using dynamic IP and mobile IP technology provides the user with convenience of access and movement. However, this causes the attacker who disguises normal user(pretending to be a regular user) to have more opportunity in regard to access and acquisition of information. This paper help the network administrator and the service provider quickly to recognize the attacker's intention to access network and service. Therefore network administrator and service provider can specify and respond the location of the attacker appropriately. To achieve above, we define an entity (W_L_M) that manages user information of WiFi and LTE network, and propose messages and procedures for attacker's location identification and alarm. The performance evaluation of this paper is based on qualitative analysis. By using the proposed method, some cost (message creation, processing and transmission) occurred but it was analyzed to be less than the total network operation cost. The proposal of this paper is a management method that utilizes existing network information and structure. This method can be used as a reference material to enhance security.

The Uneven Regional Developments of Global Production Networks in the ICT Parts and Components Industry (글로벌 생산 네트워크의 지역별 불균형 발전: ICT 부품·소재 산업을 중심으로)

  • Lee, Soh Eun;Kim, Jung-Ho
    • International Area Studies Review
    • /
    • v.18 no.3
    • /
    • pp.205-229
    • /
    • 2014
  • Global production networks (GPNs) emerged as multinational companies strategically relocated different stages of their value chain over many regions. Since GPNs require moving materials, parts, components and finished products across national borders multiple times, as well as coordinating it efficiently, they are intensified further within an integrated region. Within the region, developed countries which enjoy a comparative advantage in higher value-added tasks specialize in the production of ICT parts and components and exhibit high export RCA indices while developing countries show high import RCA indices. But, as developing countries upgrade technological capabilities and achieve industrial upgrading through participation in GPNs, their level of sophistication improves. East Asian countries have participated in GPNs to a greater degree when compared to countries in other regions because of a variety of factors. They have benefited much as shown by a significant increase in the level of ICT sophistication and export shares, which in turn led to uneven regional developments of GPNs in the ICT parts and components industry.

An Energy Aware Network Construction and Routing Method for Wireless Sensor Network (무선센서네트워크를 위한 에너지 인지형 네트워크 구성 및 라우팅 기법)

  • Hosen, A.S.M. Sanwar;Lee, Hyeak-Ro;Cho, Gi-Hawn
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.225-234
    • /
    • 2012
  • In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

An Energy-Efficient Clustering Scheme in Underwater Acoustic Sensor Networks (수중음향 센서 네트워크에서 효율적인 저전력 군집화 기법)

  • Lee, Jae-Hun;Seo, Bo-Min;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.5
    • /
    • pp.341-350
    • /
    • 2014
  • In this paper, an energy efficient clustering scheme using self organization method is proposed. The proposed scheme selects a cluster head considering not only the number of neighbor nodes but also the residual battery amount. In addition, the network life time is extended by re-selecting the cluster heads only in case the current cluster head's residual energy falls down below a certain threshold level. Accordingly, the energy consumption is evenly distributed over the entire network nodes. The cluster head delivers the collected data from member nodes to a Sink node in a way of multi-hop relaying. In order to evaluate the proposed scheme, we run computer simulation in terms of the total residual amount of battery, the number of alive nodes after a certain amount of time, the accumulated energy cost for network configuration, and the deviation of energy consumption of all nodes, comparing with LEACH which is one of the most popular network clustering schemes. Numerical results show that the proposed scheme has twice network life-time of LEACH scheme and has much more evenly distributed energy consumption over the entire network.

A Traffic-Classification Method Using the Correlation of the Network Flow (네트워크 플로우의 연관성 모델을 이용한 트래픽 분류 방법)

  • Goo, YoungHoon;Lee, Sungho;Shim, Kyuseok;Sija, Baraka D.;Kim, MyungSup
    • Journal of KIISE
    • /
    • v.44 no.4
    • /
    • pp.433-438
    • /
    • 2017
  • Presently, the ubiquitous emergence of high-speed-network environments has led to a rapid increase of various applications, leading to constantly complicated network traffic. To manage networks efficiently, the traffic classification of specific units is essential. While various traffic-classification methods have been studied, a methods for the complete classification of network traffic has not yet been developed. In this paper, a correlation model of the network flow is defined, and a traffic-classification method for which this model is used is proposed. The proposed network-correlation model for traffic classification consists of a similarity model and a connectivity model. Suggestion for the effectiveness of the proposed method is demonstrated in terms of accuracy and completeness through experiments.

A Sensor Overlay Network Providing Middleware Services on Wireless Sensor Networks (무선 센서 네트워크에서 미들웨어 서비스를 제공하는 센서 오버레이 네트워크)

  • Kim, Yong-Pyo;Jung, Eui-Hyun;Park, Yong-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.653-660
    • /
    • 2009
  • A research for middleware of WSN can provide sensor applications with avoiding tight coupling of hardware, ease of development, and abstract data access. However, previous works have some limitations which should install their own middleware onto the all sensor nodes resulting in computational and communication overhead. In order to address it, we proposed a virtual sensor overlay network, called TinyONet-Lite which introduced virtual sensors to model a virtual counterpart of physical sensors. These virtual sensors dynamically grouped into an overlay network, Slice, which provides middleware services. We implemented TinyONet-Lite on mote class hardware with TinyOS. In accordance with experiments and comparison with existing researches, TinyONet-Lite was proved to show advantages of extensibility, dynamic service composition and reducing overhead.

A Resource Scheduling Based on Iterative Sorting for Long-Distance Airborne Tactical Communication in Hub Network (허브 네트워크에서의 장거리 공중 전술 통신을 위한 반복 정렬 기반의 자원 스케줄링 기법)

  • Lee, Kyunghoon;Lee, Dong Hun;Lee, Dae-Hong;Jung, Sung-Jin;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1250-1260
    • /
    • 2014
  • In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

Framework for Automatic Generation of Network Management Program (네트워크 관리 프로그램 자동 생성 프레임워크)

  • Lee, Myung-Jin;Kim, Eun-Hee;Shin, Moon-Sun;Lee, Eung-Jae;Ryu, Keun-Ho
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.933-940
    • /
    • 2005
  • As the appearance of very high speed telecommunication network, volume of network, is enlarged and complicated, management of the various network equipments and hosting systems become more complicated and significant. Recently, there have been various researches on network management system that is capable of managing and operating the network environment based on SNMP (Simple Network Management Protocol). SNMP has many advantages, which is easy to implement and has a simple structure. However, as the network structure has become more complicated, it has caused a number of problems like the increase of network load and limit of the network management scope in terms of the network expansion and efficiency. Especially, it needs expensive cost and time for developing a network because many network developers are almost depended manually for developing it till now. In this paper, we propose a framework for network management program that automates the generation of information for network management. The Proposed framework is able to automatically generate a network management program by using information related with equipments which were provided along with the network equipments and SNMP library Thus, we ill make not only the SNMP network structure expansion become easier but also errors maintaining and development time of the network management program were dramatically reduced by using generated network program through our proposed framework.