• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.028 seconds

LSP Congestion Control methods in ATM based MPLS on BcN

  • Kim Chul soo;Park Na jung;Ahn Gwi im;Lee Jung tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4A
    • /
    • pp.241-249
    • /
    • 2005
  • ATM based MPLS(Multiprotocol Label Switching) is discussed for its provisioning QOS commitment capabilities, Traffic engineering and smooth migration for BcN in Korea. At this time, due to the comprehensive nature of ATM protocol, ATM has been adapted as the backbone system for carrying Internet traffic[1,2,3,4]. This paper presents preventive congestion control mechanisms for detecting HTR(Hard-To-Reach) LSP(Label Switched Path) in ATM based MPLS systems. In particular, we have introduced a HTR LSP detection method using network signaling information in an ATM layer. MPLS related studies can cover LSP failures in a physical layer fault, it can not impact network congestion status. Here we will present the research results for introducing HTR LSP detection methods and control mechanisms and this mechanism can be implementing as SOC for high speed processing a packet header. We concluded that it showed faster congestion avoidance abilities with a more reduced system load and maximized the efficiency of network resources by restricting ineffective machine attempts.

A Message Transfer Scheme for Efficient Message Passing in the Highly Parallel Computer SPAX (고속병렬컴퓨터(SPAX)에서의 효율적인 메시지 전달을 위한 메시지 전송 기법)

  • 모상만;신상석;윤석한;임기욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1162-1170
    • /
    • 1995
  • In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

  • PDF

An Iterative Analysis of Single-Hop B-MAC Networks Under Poisson Traffic

  • Jung, Sung-Hwan;Choi, Nak-Jung;Kwon, Tae-Kyoung
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.40-50
    • /
    • 2012
  • The Berkeley-medium access control (B-MAC) is a lightweight, configurable and asynchronous duty cycle medium access control (MAC) protocol in wireless sensor networks. This article presents an analytic modelling of single-hop B-MAC protocol under a Poisson traffic assumption.Our model considers important B-MAC parameters such as the sleep cycle, the two stage backoff mechanism, and the extended preamble. The service delay of an arriving packet and the energy consumption are calculated by an iterative method. The simulation results verify that the proposed analytic model can accurately estimate the performance of single-hop B-MAC with different operating environments.

An Efficient TCP Congestion Control Scheme in ATM Networks (ATM 망에서 효율적인 TCP 폭주 제어 기법)

  • 최지현;김남희;김변곤;전용일;정경택;전병실
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1653-1660
    • /
    • 2003
  • In this paper, we proposed an enhanced TCP congestion control algorithm using RTT with congestion window parameter cwnd to minimize the effect of TCP congestion. The proposed scheme could avoid the occurrence of frequent congestion and decrease the delay caused by the recovery time and the using amount of switch buffer. Through the simulation, we showed that the proposed scheme cm acquire higher performance than the existing scheme. There are 22.56% improvement at the average using buffer efficiency, and packet drop rate is 0.1% which is less than existing scheme.

Improving TCP Performance with Bandwidth Estimation and Selective Negative Acknowledgment in Wireless Networks

  • Cheng, Rung-Shiang;Lin, Hui-Tang
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.236-246
    • /
    • 2007
  • This paper investigates the performance of the transmission control protocol (TCP) transport protocol over IEEE 802.11 infrastructure based wireless networks. A wireless link is generally characterized by high transmission errors, random interference and a varying latency. The erratic packet losses usually lead to a curbing of the flow of segments on the TCP connection and thus limit TCP's performance. This paper examines the impact of the lossy nature of IEEE 802.11 wireless networks on the TCP performance and proposes a scheme to improve the performance of TCP over wireless links. A negative acknowledgment scheme, selective negative acknowledgment (SNACK), is applied on TCP over wireless networks and a series of ns-2 simulations are performed to compare its performance against that of other TCP schemes. The simulation results confirm that SNACK and its proposed enhancement SNACK-S, which incorporates a bandwidth estimation model at the sender, outperform conventional TCP implementations in 802.11 wireless networks.

Control Network using Bluetooth with Wire Network (유선 네트워크 기반의 근거리 무선 통신을 이용한 제어용 네트워크)

  • Gwak, Jae-Hyeok;Im, Jun-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.476-479
    • /
    • 2003
  • Recently, Bluetooth has been regarded as a new technology for short-range wireless connection. Although initial application of Bluetooth technology has been focused mainly on replacing cables between hand-held devices due to a limited packet size and short-range, general wireless telecommunication such as PAN and Ad hoc networks via Bluetooth-equipped devices is expected to be one of the most popular applications. Wireless equipments have been used to exchange data between host and mobile unit. The exchanging data may be several bytes of control command and the value of sensors with ultra-sonic, vision sensor, and encoder from mobile robot. However, most wireless equipments have some drawbacks such as lack of authentication, large size and high price. On the other hand, the benefits of Bluetooth are small size, low power, low price except short-range. Especially, there are some difficulties when wireless modules are used in indoor environments. In this paper, a method of using wire network in Bluetooth network is investigated as a solution to overcome the short-range problem of Bluetooth and difficulty in indoor environment.

  • PDF

Virtual Output Queue Structure for Fair Uni and Multicasting in Metro WDM Network (메트로 WDM 링 네트워크상에서의 공평성에 관한 연구)

  • Yang, Hyo-Sik
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.2
    • /
    • pp.55-60
    • /
    • 2008
  • Packet-switched wavelength division multiplexing (WDM) ring networks have been extensively studied as solutions to the increasing amount of traffic in metropolitan area networks, which is widely expected to be a mix of unicast and multicast traffic. In this paper we study the fairness between unicasting and multicasting in slotted packet-switched WDM ring networks that employ a tunable transmitter and fixed tuned receiver at each node and a posteriori buffer selection. We find that single-step longest queue selection algorithm generally results in unfairness between unicasting and multicasting or a lilted relative priority for multicast vs. unicast traffic. We present the various virtual output queue structures and their performance.

Role-Based Network Access Control System on Open Network Two-Factor Authentication (네트워크 이중 인증을 통한 역할 기반 개방형 네트워크 접근 통제 시스템의 구현)

  • Lee, Chun-Jae;Cho, Ki-Ryang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8B
    • /
    • pp.502-508
    • /
    • 2007
  • This paper proposes a method to shut out all of the not certified network access packet by embodying the two-factor(MAC ADDRESS, ID/PASSWORD) authentication system. The Authenticating Gateway System takes over central server's policy and permit or hold up the packet by inherited policy. And checks the whether or not patched the OS version and getting influenced from computer virus. And takes the information about client's resources(H/W, S/W) without Agent in the client. That makes more stability of network operating circumstance and fast facing the attack from hackers. In the fixed mobile network circumstance, This method provides more simplicity and less expenses than IEEE802.1x authentication system(cisco nac).

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

  • Oh, Se-Yoon;Hong, Hyun-Ha;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.4
    • /
    • pp.311-322
    • /
    • 2002
  • Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

  • PDF

Hybrid Scheduling Algorithm based on DWDRR using Hysteresis for QoS of Combat Management System Resource Control

  • Lee, Gi-Yeop
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.21-27
    • /
    • 2020
  • In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.