• Title/Summary/Keyword: 라우터 수

Search Result 355, Processing Time 0.026 seconds

A Study on the Parallel Routing in Hybrid Optical Networks-on-Chip (하이브리드 광학 네트워크-온-칩에서 병렬 라우팅에 관한 연구)

  • Seo, Jung-Tack;Hwang, Yong-Joong;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.8
    • /
    • pp.25-32
    • /
    • 2011
  • Networks-on-chip (NoC) is emerging as a key technology to overcome severe bus traffics in ever-increasing complexity of the Multiprocessor systems-on-chip (MPSoC); however traditional electrical interconnection based NoC architecture would be faced with technical limits of bandwidth and power consumptions in the near future. In order to cope with these problems, a hybrid optical NoC architecture which use both electrical interconnects and optical interconnects together, has been widely investigated. In the hybrid optical NoCs, wormhole switching and simple deterministic X-Y routing are used for the electrical interconnections which is responsible for the setup of routing path and optical router to transmit optical data through optical interconnects. Optical NoC uses circuit switching method to send payload data by preset paths and routers. However, conventional hybrid optical NoC has a drawback that concurrent transmissions are not allowed. Therefore, performance improvement is limited. In this paper, we propose a new routing algorithm that uses circuit switching and adaptive algorithm for the electrical interconnections to transmit data using multiple paths simultaneously. We also propose an efficient method to prevent livelock problems. Experimental results show up to 60% throughput improvement compared to a hybrid optical NoC and 65% power reduction compared to an electrical NoC.

Experimental Design of AODV Routing Protocol with Maximum Life Time (최대 수명을 갖는 AODV 라우팅 프로토콜 실험 설계)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.29-45
    • /
    • 2017
  • Ad hoc sensor network is characterized by decentralized structure and ad hoc deployment. Sensor networks have all basic features of ad hoc network except different degrees such as lower mobility and more stringent energy requirements. Existing protocols provide different tradeoffs among some desirable characteristics such as fault tolerance, distributed computation, robustness, scalability and reliability. wireless protocols suggested so far are very limited, generally focusing on communication to a single base station or on aggregating sensor data. The main reason having such restrictions is due to maximum lifetime to maintain network activities. The network lifetime is an important design metric in ad hoc networks. Since every node does a router role, it is not possible for other nodes to communicate with each other if some nodes do not work due to energy lack. In this paper, we suggest an experimental ad-hoc on-demand distance vector routing protocol to optimize the communication of energy of the network nodes.The load distribution avoids the choice of exhausted nodes at the route selection phase, thus balances the use of energy among nodes and maximizing the network lifetime. In transmission control phase, there is a balance between the choice of a high transmission power that lead to increase in the range of signal transmission thus reducing the number of hops and lower power levels that reduces the interference on the expense of network connectivity.

Distributed Hierarchical Location Placement of Core Nodes in the OCBT Multicast Protocol (OCBT 멀티캐스트 프로토콜에서 core 노드의 분산 계층 위치 결정)

  • 황경호;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.90-95
    • /
    • 2000
  • In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

  • PDF

A Design of SPI-4.2 Interface Core (SPI-4.2 인터페이스 코어의 설계)

  • 손승일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1107-1114
    • /
    • 2004
  • System Packet Interface Level 4 Phase 2(SPI-4.2) is an interface for packet and cell transfer between a physical layer(PHY) device and a link layer device, for aggregate bandwidths of OC-192 ATM and Packet Over Sonet/SDH(POS), as well as 10Gbps Ethernet applications. SPI-4.2 core consists of Tx and Rx modules and supports full duplex communication. Tx module of SPI-4.2 core writes 64-bit data word and 14-bit header information from the user interface into asynchronous FIFO and transmits DDR(Double Data Rate) data over PL4 interface. Rx module of SPI-4.2 core operates in vice versa. Tx and Rx modules of SPI-4.2 core are designed to support maximum 256-channel and control the bandwidth allocation by configuring the calendar memory. Automatic DIP4 and DIP-2 parity generation and checking are implemented within the designed core. The designed core uses Xilinx ISE 5.li tool and is described in VHDL Language and is simulated by Model_SIM 5.6a. The designed core operates at 720Mbps data rate per line, which provides an aggregate bandwidth of 11.52Gbps. SPI-4.2 interface core is suited for line cards in gigabit/terabit routers, and optical cross-connect switches, and SONET/SDH-based transmission systems.

An Efficient Dynamic Network Status Update Mechanism for QoS Routing (QoS 라우팅을 위한 효율적인 동적 네트워크 상태 정보 갱신 방안)

  • Kim, Jee-Hye;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.65-76
    • /
    • 2002
  • QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.

Development of a Moving Monitor System for Growing Crops and Environmental Information in Green House (시설하우스 이동형 환경 및 생장 모니터링 시스템 개발)

  • Kim, Ho-Joon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.3
    • /
    • pp.285-290
    • /
    • 2016
  • In rural area, our farmers confront decreasing benefits owing to imported crops and increased cost. Recently, the government encourage the 6th Industry that merges farming, rural resources, and information and communication technology. Therefor the government makes an investment in supplying 'smart greenhouse' in which a farmer monitor growing crops and environment information to control growing condition. The objective of this study is developing an Moving Monitor and Control System for crops in green House. This system includes a movable sensing unit, a controlling unit, and a server PC unit. The movable sensing unit contains high resolution IP camera, temperature and humidity sensor and WiFi repeater. It rolls on a rail hanging beneath the ceiling of a green house. The controlling unit contains embedded PC, PLC module, WiFi router, and BLDC motor to drive the movable sensing unit. And the server PC unit contains a integrated farm management software and home pages and databases in which the images of crops and environment informations. The movable sensing unit moves widely in a green house and gathers lots of information. The server saves these informations and provides them to customers with the direct commercing web page. This system will help farmers to control house environment and sales their crops in online market. Eventually It will be helpful for farmers to increase their benefits.

A Source-Level Discovery Methodology for Vulnerabilities of Linux Kernel Variables (리눅스 커널 변수 취약성에 대한 소스레벨 발견 방법론)

  • Ko Kwangsun;Kang Yong-hyeog;Eom Young Ik;Kim Jaekwang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.6
    • /
    • pp.13-25
    • /
    • 2005
  • In these days, there are various uses of Linux such as small embedded systems, routers, and huge servers, because Linux gives several advantages to system developers by allowing to use the open source code of the Linux kernel. On the other hand, the open source nature of the Linux kernel gives a bad influence on system security. If someone wants to exploit Linux-based systems, the attacker can easily do it by finding vulnerabilities of their Linux kernel sources. There are many kinds of existing methods for lading source-level vulnerabilities of softwares, but they are not suitable for finding source-level vulnerabilities of the Linux kernel which has an enormous amount of source code. In this paper, we propose the Onion mechanism as a methodology of finding source-level vulnerabilities of Linux kernel variables. The Onion mechanism is made up of two steps. The Int step is to select variables that may be vulnerable by using pattern matching mechanism and the second step is to inspect vulnerability of each selected variable by constructing and analyzing the system call trees. We also evaluate our proposed methodology by applying it to two well-known source-level vulnerabilities.

Cache-Friendly Adaptive Video Streaming Framework Exploiting Regular Expression in Content Centric Networks (콘텐트 중심 네트워크에서 정규표현식을 활용한 캐시친화적인 적응형 스트리밍 프레임워크)

  • Son, Donghyun;Choi, Daejin;Choi, Nakjung;Song, Junghwan;Kwon, Ted Taekyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1776-1785
    • /
    • 2015
  • Content Centric Network (CCN) has been introduced as a new paradigm due to a shift of users's perspective of using Internet from host-centric to content-centric. On the other hand, a demand for video streaming has been increasing. Thus, Adaptive streaming has been introduced and researched for achieving higher user's satisfaction. If an architecture of Internet is replaced with CCN architecture, it is necessary to consider adaptive video streaming in CCN according to the demand of users. However, if the same rate decision algorithm used in Internet is deployed in CCN, there are a limitation of utilizing content store (CS) in CCN router and a problem of reflecting dynamic requirements. Therefore, this paper presents a framework adequate to CCN protocol and cache utilization, adapting content naming method of exploiting regular expression to the rate decision algorithm of the existing adaptive streaming. In addition, it also improves the quality of video streaming and verifies the performance through dynamic expression strategies and selection algorithm of the strategies.

Implementation of Hybrid Firewall System for Network Security (전산망 보호를 위한 혼합형 방화벽 시스템 구현)

  • Lee, Yong-Joon;Kim, Bong-Han;Park, Cheon-Yong;Oh, Chang-Suk;Lee, Jae-Gwang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1593-1602
    • /
    • 1998
  • In this paper, a hybrid firewall system using the screening router, dual-homed gateway, screened host galeway and the application level gateway is proposed, The screened host gateway is comjXlsed of screening router, DMZ and bastion host. All external input traffics are filtered by screening router with network protrcol filtering, and transmitted to the bastion host performing application level filtering, The dual homed gateway is an internlediate equipment prohibiting direct access from external users, The application level gateway is an equipment enabling transmission using only the proxy server. External users can access only through the public servers in the DMZ, but internal users can aeee through any servers, The rule base which allows Telnet only lo the adrnilllslratol is applied to manage hosts in the DMZ According to the equipmental results, denial of access was in orderof Web. Mail FTP, and Telnet. Access to another servers except for server in DMZ were denied, Prolocol c1mials of UDP was more than that of TCP, because the many hosts broadcasted to networds using BOOTP and NETBIOS, Also, the illegal Telnet and FTP that transfer to inside network were very few.

  • PDF

Comparison and Analysis of Name-Based Routing Protocols for Information-Centric Network (정보 중심 네트워크를 위한 이름 기반 라우팅 프로토콜의 비교 및 분석)

  • Kim, Jung-Jae;Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Huyn
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.4
    • /
    • pp.1969-1975
    • /
    • 2013
  • ICN (Information-Centric Network) is a next generation Internet communication technology for converting existing Internet communication paradigm to information-based communication paradigm to efficiently use a large amount of information that exists on the Internet. Therefore, unlike existing Internet communication technologies focused on the process of communication using the host address, ICN focuses on the purpose of communication for each information by defining the information of everything that exists on the Internet. For this purpose, ICN uses NbR (Name-based Routing) methods that assign a name to each piece of information, all routers participating in ICN have the physical storage so that they are able to share information with each other. NbR methods on ICN are divided into one-phase routing and two-phase routing depending on how to reach at the storage of each router. However, currently proposed NbR methods cause many problems because they do not reflect the unique characteristics of ICN. Therefore, this paper looked at various NbR issues from caching, access time, distribution, mobility, scaliability, and dissemination of information for an efficient NbR method, and analyzed existing methods proposed for ICN. This paper also proposed a research direction to study the efficient NbR for ICN based on the analysis information.