• Title/Summary/Keyword: link state protocol

Search Result 80, Processing Time 0.025 seconds

A study on congesting control scheme for LAN interworkding in connectionless data service (비연결형 데이터 서비스에서 LAN연동을 위한 폭주 제어에 관한 연구)

  • 박천관;전병천;김영선
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.29-38
    • /
    • 1998
  • This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

  • PDF

A Study of method to apply MANET Protocol for Route Optimization in Nested Mobile Network (Nested Mobile Network상의 Route Optimization을 위한 MANET Protocol 적용 방안 연구)

  • Choi, Seung-Won;Kim, Sang-Bok;Kim, Young-Beom
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.269-272
    • /
    • 2005
  • 무선 네트워크 이동성 기술에 대한 연구가 수년간 진행되어 오면서 Mobile Network에 PAN(Personal Area Network)과 유사한 형태의 Nested Mobile Network에 대한 관심이 높아지고 있으며, 이러한 Nested Mobile Network에서의 경로최적화(Route Optimization : RO) 기술에 대한 연구가 활발하게 진행되고 있다. NEMO(NEtwork MObility)의 RO를 위해 제안된 논문 중에 ORC(Optimized Route Cache Protocol)에 대한 제안이 있었다.[1] NEMO Basic Support가 표준안으로 채택되면서 연구 대상에서 거론되지 않고 있지만, 복잡한 이동성 기술인 Nested Mobile Network상의 RO를 위해 다시 검토해 볼 수 있을 것이다. 또한 동일 저자에 의해 제안된 Nested Mobile Network 내부에 Ad-hoc Routing 알고리즘인 OLSR(Optimized Link State Routing Protocol)을 적용한 제안이 발표되었다.[2] 본 논문에서는 ORC와 Nested Mobile Network상의 OLSR Scheme을 적용하여 RO를 위한 방안을 제안하고자 한다.

  • PDF

Routing Algorithm with Adaptive Weight Function based on Possible Available Wavelength in Optical WDM Networks

  • Pavarangkoon, Praphan;Thipchaksurat, Sakchai;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1338-1341
    • /
    • 2004
  • In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

  • PDF

An IS-IS Routing Protocol with Traffic Engineering Extensions in MPLS System (MPLS 시스템에서 트래픽 엔지니어링 확장을 고려한 IS-IS 라우팅 프로토콜)

  • 양미정;박혜경;함진호;김상하
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.5
    • /
    • pp.365-374
    • /
    • 2004
  • This paper proposes the architecture of Intermediate System to Intermediate System routing protocol. IS-IS is a link state routing protocol designed to provide routing in a network layer protocols with datagram services. IS-IS has favored scalability and stability. So, it is important to support IS-IS for the MPLS system used in backbone networks. Especially, IS-IS must provide network state information and available resource information for supporting qualify of services in MPLS network. Therefore, we propose the design architecture of IS-IS routing protocol and the implementation technologies. Also, we propose extended architecture for traffic engineering in ATM based MPLS system.

SE-OLSR: Secure Enhanced Optimized Link State Routing Protocol (보안이 향상된 OLSR 프로토콜)

  • Jeon, Min-Cheol;Kang, Suk-In;Kim, Jong-Uk;Hong, Man-Pyo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06d
    • /
    • pp.105-108
    • /
    • 2011
  • OLSR(Optimized Link State Routing) 프로토콜은 모바일 애드 혹 네트워크(Mobile Ad hoc Networks)에서 사용되는 프로액티브(proactive) 프로토콜이다. OLSR에서는 각 노드가 자신의 MPR(multi-point relay) 노드를 선정하고, MPR 노드를 통해 모든 메시지를 전달한다. 만약 공격자가 네트워크 정보를 조작 하여 자신이 다른 노드들의 MPR로 선정되도록 한다면, 공격자는 주변의 노드의 메시지를 폐기시킬 수 있다. 본 논문에서는 이러한 OLSR의 취약점을 보안하기 위한 SE-OLSR(Secure Enhanced OLSR) 프로토콜을 제안한다.

Linear Precoding Technique for Cooperative MIMO Communication Systems Using Selection-Type Relaying (선택적 중계 기법을 적용한 다중 안테나 기반 협력 통신 시스템의 선형 전처리 기술)

  • Yoo, Byung-Wook;Lee, Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.24-29
    • /
    • 2010
  • Selection-type relaying protocol, which is one of cooperative relaying protocols, provides low decoding complexity and improved system performance due to selection diversity. In this paper, we deal with linear precoding technique that minimize the error probability of cooperative MIMO system. Under the assumption that full channel state information is available at whole nodes, linear source and relay precoders, which minimize mean squared error of the estimated symbol vector, are proposed. Moreover, unlikely to the conventional selection-type relaying protocol using a fixed threshold signal-to-noise-ratio, new transmission link selection algorithm selects direct link or relay link as a transmission link, is introduced. Simulation results show that the proposed linear precoder with the transmission link selection algorithm outperforms the conventional precoders for two-hop relaying protocols or selection-type relaying protocols.

A Study on OSPF for Active Routing in Wireless Tactical Communication Network (전술통신망에서 능동적 라우팅을 위한 OSPF에 대한 연구)

  • Lee, Seung-Hwan;Lee, Jong-Heon;Lee, Hoon-Seop;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1211-1218
    • /
    • 2010
  • OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.

Enhancing Irregular Repetition Slotted ALOHA with Polarization Diversity in LEO Satellite Networks

  • Su, Jingrui;Ren, Guangliang;Zhao, Bo;Ding, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3907-3923
    • /
    • 2020
  • An enhanced irregular repetition slotted ALOHA (IRSA) protocol is proposed by using polarization characteristic of satellite link and MIMO detection in low earth orbit (LEO) satellite networks, which is dubbed polarized MIMO IRSA (PM-IRSA). In the proposed scheme, one or two packets in one slot can be decoded by employing polarized MIMO detection, and more than two collided packets in multiple slots which can construct the virtual MIMO model can be decoded by the MIMO detection algorithm. The performance of the proposed scheme is analyzed with the density evolution (DE) approach and the degree distribution is optimized to maximize the system throughput by using a differential evolution. Numerical results certify our analysis and show that the normalized throughput of the proposed PM-IRSA can achieve 1.89 bits/symbol.

An Efficient Altruistic Looking Protocol for the Mobile Transaction Management System (이동 데이터베이스 시스템을 위한 효율적인 이타적 잠금기법)

  • 권혁신;김세윤;김응모
    • Journal of Information Technology Applications and Management
    • /
    • v.11 no.1
    • /
    • pp.53-67
    • /
    • 2004
  • We propose an advanced transaction scheduling protocol to improve the concurrency and to guarantee the mobility for the mobile database management systems. Mobility, portability, and wireless link In mobile computing environment can cause certain drawbacks, and thus it is more difficult to solve the concurrency control problems. However, a locking scheme should be used to guarantee the data consistency and to prevent the data conflicts. It is well known that data consistency is guaranteed by standard transaction scheduling schemes like two-phase locking (2PL). It has two of operation, lock and unlock. But 2PL does not give solution for mobile system. Altruistic Locking (AL) and classifying transactions, we adapt, can give solution for the previous problems. AL, as an advanced protocol, has attempted to reduce delay effects associated with lock release moment by the use of donation. In this paper, we extend those approaches and classify the transactions to reduce delay effects of short-lived transaction caused by long-lived transaction. In addition, we show efficient solution for the case of disconnection occurrence. Our protocol, namely, Mobile Altruistic Locking (MAL) is shown to be efficiently used in order to reduce delay effects and to guarantee database consistency in a state of the slippery connection in mobile database systems.

  • PDF

A TEST Frame Application Technique for Improving Data Communication and Topology Update Function in Ad-Hoc Tactical Wireless Networks (Ad-Hoc 전술 무선 통신망에서 데이터 통신 및 토폴로지 갱신 기능 향상을 위한 TEST 프레임 적용 기법)

  • You, Ji-Sang;Baek, In-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2007
  • In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.