• Title/Summary/Keyword: routing table

Search Result 200, Processing Time 0.026 seconds

A Study on Caching Management Technique in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 캐싱 관리 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.12 no.4
    • /
    • pp.91-96
    • /
    • 2012
  • MANET is developed technique fairly among many field of wireless network. Nodes which consist of MANET transmit data using multi-hop wireless connection. Caching scheme is technique which can improve data access capacity and availability of nodes. Previous studies were achieved about dynamic routing protocol to improve multi-hop connection of moving nodes. But management and maintenance of effective cache information because of movement of nodes is not easy. In this study, we proposed cluster-based caching scheme to manage connection by decreasing overhead and moving of nodes as moving node discovers cache of wish information. And HLP was used to maintain effective cache table in each cluster head. Efficiency of proposed technique in this study was confirmed by experiment.

An Efficient Management Scheme of Hierarchical P2P System based on Network Distance (계층적 P2P 시스템의 효율적 관리를 위한 네트워크 거리 기반 운영 기법)

  • Hong, Chung-Pyo;Kim, Cheong-Ghil;Kim, Shin-Dug
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.4
    • /
    • pp.121-127
    • /
    • 2011
  • Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

  • PDF

Vibration Related Branch Line Fatigue Failure (분기관 진동에 의한 피로파괴)

  • 전형식;박보용
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1990.10a
    • /
    • pp.113-124
    • /
    • 1990
  • Tap lines are small branch piping generally less than two inches in diameter. They typically branch off of header piping having a much larger diameter. An example of a common tap line is a 3/4 inch size high point vent or low point drain. Most tap lines have at least one valve near the header tap connection to provide isolation. Two valves are often required for double isolation. A light water reactor(LWR) nuclear power plant will have several hundred tap lines. These lines come in many sizes and shapes and serve numerous functions. A single process piping valve may have three different tap lines associated with it (figure 1). Table 1 delineates the different categories of tap lines. Vibration failures of tap lines are a common occurrence in all industrial plants including nuclear and fossil power plants. These types of failures constitute a significant percentage of all piping related failures. An unscheduled plant shutdown or outage resulting from the failure of a tap line decreases plant reliability and may have a detrimental effect on plant safety. Most tap line vibration failures can be avoided through the use of appropriate routing and support techniques. Standardized designs can be developed for use in a myriad of applications. These designs will not only minimize failures but will also reduce the necessary analysis and installation efforts.

  • PDF

Hardware based set-associative IP address lookup scheme (하드웨어 기란 집합연관 IP 주소 검색 방식)

  • Yun Sang-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.541-548
    • /
    • 2005
  • IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

The Dynamic Flow Admission Control for Providing DiffServ Efficiently in MPLS Networks (MPLS 네트워크에서 DiffServ를 효율적으로 적용하기 위한 동적 흐름 수락 제어)

  • Im, Ji-Yeong;Chae, Gi-Jun
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.45-54
    • /
    • 2002
  • MPLS(Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. In this paper, we propose an dynamic flow admission control supporting DiffServ(Differentiated Services) to provide QoS in MPLS networks. Our proposed model dynamically adjusts the amount of admissible traffic based on transmittable capacity over one outgoing port. It then transmits the Packets while avoiding congested area resulting traffic loss. Ingress LSRs find out the congested area by collecting network state information at QoS state update for QoS routing table. Our Proposed model manages the resource efficiently by protecting the waste of resources that is a critical Problem of DiffServ and makes much more flows enter the network to be served.

An Analysis on Changing Pattern of Economic Active Population by Working Life Table for Korean Men (우리나라 노동생명표에 의한 노동력추이 분석)

  • 조진만
    • Korea journal of population studies
    • /
    • v.13 no.2
    • /
    • pp.1-18
    • /
    • 1990
  • This is a study which attempt to analyze changing patierns of economic active popu-lation, t o estimato- future patterns, and exa- mine vartons problems arises by changing c ire u mst ances of t he labor force market in- clunging soici al, economic ic, heathl th and demoi-graph ic aspects. We have constructed series of wotking life table which are useful in syt uiolyioig the lirocess of growth and structural change of labor force. Work i ng life tables represent ihie life eyele of econrmic' activity in hi ypothetical cohorts, that is. gen-erat i on of men Sn bject at eat' b period ot f their lives th given ra to's o mor tali it y and of par-- tici pation in economic activities. The tabloes prot' ide measorues of the alvet'age he ng t able of economically aeti \- e life. and agespecific rates of en trannee' into and retirement from the hahn' force. In const routing working life tables, age-specific activity rates and life tabole popula- titoto which represents contemporary condi-tions of moortality in Korea au'e the basic' maltoerials. We have derived the age-specific rates foorm economically active population survey, whoich were conducted by the Bureau of Statistics, Economic Planning Borard of the Korean government. Working life tables are constructed for men wtable these materi- als in the year of 1970, 1980 and 1988 by a modified Wolfbein-Wool's method. Some of the findings may be summerized as follow : 1) A central part of constructing working life table is calculation of stationary' economic active population, which represents the number of men in the stationtary population extoected to be in the labor force at each age group in the life span. The stationary economic active population by age have generally a universal pattern, where they rise sharply in the early twenties, approach its' peak in the thirties decline thereafter. at first graolually and then more rapidly at an advanced age. Korean men show the same general pa ttern of age distribution of stationary eco-- nomic active population with sharp increase hegining from the age interval of 20 to 24, reaching to maximum level at older age. The population. however, presumably, increased substantially due to increaseing school atte endance rates. Another difference exiSts in the youngest age groups, that is the activity rate in the year of 1988 is lower than that of Japan. The table shows an analysis of changes in the age distrihution of labor force between 1970, 1980 and 1988. 2) It was shown an analysis of changes in the age distribution and cause of separation from labor force. The entrance rate to labor force has increased from 18~\5 persons to 299 persons per 1000 head of stationary population between that of 1980 than that of 1988 for Korean men in 20~24 age group. The entrace rate to labor force shows a rapid entrance appearance concentrated on the 15~24 age group. The separation rate from labor force by retirment in Korea in the year of 1988 shows a great difference of the about four times as much as that of Japan. 3) The functions of table illustrate the patterns of working life of males in Korea in 1970, 1980 and 1988. The average remaining number of economically active years, e at age 15 in 1988 is 46.39 which is 2.12 years of increase compared with that of at age 15 in 1970,1980 and 1988 are 43.90,44.27 and 46.39 respectively, showing steadily increase dur- ing the past double decade the increase in the length of economically active life various age may be considered to have come both from extention of general life expectancy and from increasing entrance rate to economic activity in high age that of working is far greater in 1988 than that of 1980. The gaps between expectation of life and average remaining years of economically active widened due to rapid improvement of mortality level in Ko- rea. This observation together with the population pressure by the appearance of a group of younger population implies that constant increase of economically inactive population among older age group.

  • PDF

A Study on Congestion Control for LAN Interworking in ATM Network (ATM 망에서 LAN 연동을 위한 폭주 제어에 관한 연구)

  • Park, Chun-Kwan
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.122-133
    • /
    • 1998
  • The CL network fer CBDS(Connectionless Broadband Data Service) defined by ITU-(International Telecommunication Union-Telecommunication) consists of CL(ConnectionLess) servers which route frames and links which connect between CL user and CL server or between CL servers[1][2]. In this configuration, two kinds of congestion, CL link congestion and CL server congestion may occur. Therefore this paper has proposed the scheme that can deal with the above congestion state of LAN traffic efficiently in interworking LANs in ATM network. Proposed schemes ale link-by-link scheme and hybrid scheme. Link-by-link scheme uses the ABR feedback loops of AIM layer between CL user and CL server or between CL servers, and the header translation table carrying out the routing function of frame. And hybrid scheme is the scheme that adds end-to-end loop to link-by-link scheme and then uses RM message using CLNAP-PDU(ConnectionLess Network Access Protocol - Protocol Data Units) of CL layer. These schemes can be implemented easily because of using the ABR loop of ATM layer, end-to-end loop of CL layer, and the routing function of CL server. In this paper the characteristic and effects of two schemes in CL server bas been compared and analyzed.

  • PDF

Peer-to-Peer System using Super Peers for Mobile Environments (모바일 환경에서 슈퍼 피어를 이용한 피어-투-피어 시스템)

  • Han, Jung-Suk;Song, Jin-Woo;Lee, Kwang-Jo;Yang, Sung-Bong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.286-290
    • /
    • 2008
  • As the number of mobile device users increases, many researches on peer-to-peer(P2P) systems in mobile environments have been carried out. In this paper, we propose a couple of double-layered P2P file sharing systems to overcome the 'flooding' problem in previous mobile P2P systems. We classify peers into two groups, super peers and sub-peers to establish new routing tables. A super peer manages its sub-peers in the systems. The first proposed system partitions the service area into small cells, each of which is a square. Each super peer is located near the center of the square. The second system selects super peers which have the largest number of adjacent peers. As file transmission and file searches are managed mainly by super peers, unnecessary multi-broadcasting could be avoided. The experimental results show that the proposed systems outperform a typical file sharing system in terms of the amount of message traffic with about $1.2{\sim}1.6$ times improvement on the average.

Low-power 6LoWPAN Protocol Design (저 전력 6LoWPAN 프로토콜 설계)

  • Kim, Chang-Hoon;Kim, Il-Hyu;Cha, Jung-Woo;Nam, In-Gil;Lee, Chae-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.4
    • /
    • pp.274-280
    • /
    • 2011
  • Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.

R-Tree Construction for The Content Based Publish/Subscribe Service in Peer-to-peer Networks (피어투피어 네트워크에서의 컨텐츠 기반 publish/subscribe 서비스를 위한 R-tree구성)

  • Kim, Yong-Hyuck;Kim, Young-Han;Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.1-11
    • /
    • 2009
  • A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.