• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.777-781
• /
• 2004

This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

• 융합신호처리학회논문지
• /
• 제15권4호
• /
• pp.183-191
• /
• 2014

본 논문에서는 전파천문학에서 초고속 전송망을 위한 관측 데이터의 전송 알고리즘의 개발에 대해 기술한다. 전파망원경으로 관측한 VLBI 데이터 처리를 위한 전처리 과정으로, 데이터 전송 알고리즘은 대용량 스토리지 서버에 저장된 VLBI 데이터를 대전상관기의 동기재생처리장치(RVDB)에 1대 1 방식으로 동작하며 VDIF 규격과 VDIFCP, UDP 프로토콜을 사용한다. 제안방법은 대전상관기의 동기재생처리장치의 데이터 전송을 기다리고 있으면 대용량 스토리지 서버의 Mark5B VSI 규격으로 저장된 2048 Mbps 급 VLBI 관측 데이터를 읽은 후 UDP로 전송하는 방식이다. 제안방법의 유효성을 확인하기 위해 대용량 스토리지 서버와 RVDB OCTADDB 사이에 실제 VLBI 관측 데이터를 전송하고 전송 전후의 데이터에 대해 상관처리 시험을 수행한 후 결과를 비교하였으며, 데이터 전송손실이 없이 전송 전후의 결과가 동일함을 확인하였다. 향후 본 연구에서 개발한 데이터 전송 알고리즘은 KaVA 네트워크에서 e-VLBI로도 유용하게 활용할 수 있을 것으로 기대한다.

• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.