• Title/Summary/Keyword: Ethernet Switch

Search Result 64, Processing Time 0.266 seconds

A Scheduling and Synchronization Technique for RAPIEnet Switches Using Edge-Coloring of Conflict Multigraphs

  • Abbas, Syed Hayder;Hong, Seung Ho
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.321-328
    • /
    • 2013
  • In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

Study of Dynamic Scheduler that use Policy Daemon of COS base in Hight Speed Ethernet Switch (Hight Speed Ethernet Switch 에서 COS기반의 Policy Daemon을 이용한 Dynamic Scheduler 에 대한 연구)

  • 최정일;황진옥;민성기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.316-318
    • /
    • 2004
  • 유선, 무선을 합하여 초고속 네트워크의 사용이 급격하게 증가됨에 따라 고속의 네트워크 통신 서비스에 대한 요구가 증가 하였으며 차별화된 인터넷 서비스에 대한 요구가 증가함에 따라 IP 기반의 스위치가 등장하게 되었다. 이러한 스위치의 이슈는 IT 포워딩, 고속 스위치 패브릭 등의 문제를 포함하게 된다. 현재까지의 모든 패킷 스위치는 그 내부적으로 HOL블로킹에 의한 성능 저하의 영향을 최소화하기 위하여 여러 가지 스케줄링 알고리즘을 사용한다. 본 논문에서는 Gigabit 으로 동작하는 패킷 스위치 중에서 Strict Priority 알고리즘, Round Robin 알고리즘을 분석하고 각각의 스케줄러가 COS 기반과 어떤 관계가 있으며 더불어 COS 기반에 따라, 스케줄러를 동적으로 변경하여 기존의 Static 하게 정책적으로 사용되던Algorithm 과의 차별성을 두어 동적 스케줄러의 선택에 의한 Packet 처리 성능향상을 보이도록 한다.

  • PDF

Methods of constructing optimal topology to improve performance of STP (STP의 성능 향상을 위한 최적의 토폴로지 구성방법)

  • Park Sung-Han;Jang Jong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.2
    • /
    • pp.271-275
    • /
    • 2006
  • In STP, network performance differs depending on topology configuration. Therefore, we need to configure right topology for the optimal efficiency of networking. This paper suggest the optimal topology configuration for efficient networking between ethernet switchs. It finds out the best topology configuration by calculation mathematical model which uses transmission time between root switch and other switchs in the same domain. And it also analysed performance difference on locations of root switch. Through the performance analysis, we could conclude that placing the root switch in the center is the most efficient.

Dynamic Routing and Priority-based Data Transmission Schemes in Avionic Ethernet for Improving Network QoS (항공전자 이더넷의 네트워크 성능 향상을 위한 동적 라우팅 기법 및 우선순위기반 데이터 전송 기법)

  • Lee, Won Jin;Kim, Yong Min
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.4
    • /
    • pp.302-308
    • /
    • 2019
  • Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

A Design of 256GB volume DRAM-based SSD(Solid State Drive) (256GB 용량 DRAM기반 SSD의 설계)

  • Ko, Dea-Sik;Jeong, Seung-Kook
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.4
    • /
    • pp.509-514
    • /
    • 2009
  • In this paper, we designed and analyzed 256GB DRAM-based SSD storage using DDR1 memory and PCI-e interface. SSD is a storage system that uses DRAM or NAND Flash as primary storage media. Since the SSD read and write data directly to memory chips, which results in storage speeds far greater than conventional magnetic storage devices, HDD. Architecture of the proposed SSD system has performance of high speed data processing duo to use multiple RAM disks as primary storage and PCI-e interface bus as communication path of RAM disks. We constructed experimental system with UNIX, Windows/Linux server, SAN Switch, and Ethernet Switch and measured IOPS and bandwidth of proposed SSD using IOmeter. In experimental results, it has been shown that IOPS, 470,000 and bandwidth,800MB/sec of the DDR-1 SSD is better than those of the HDD and Flash-based SSD.

  • PDF

A Localized Software-based Approach for Fault-Tolerant Ethernet (LSFTE)

  • Vu, Huy Thao;Kim, Se Mog;Pham, Anh Hoang;Rhee, Jong Myung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.3 no.3
    • /
    • pp.51-61
    • /
    • 2010
  • Nowadays, there are various networked systems with many computers. In most networked systems, a crucial objective is to keep transmitting and/or receiving data continuously even though failures exist. How can one make a computer continue transmitting and/or receiving data even when there are some errors on a link? Fault-Tolerant Ethernet (FTE) can be a solution to this question. In this paper, we propose a Localized Software-based Fault-Tolerant Ethernet (LSFTE). Our new approach fulfills the general FTE requirements. It takes advantage of redundant cable lines to maintain communication in a faulty environment. A software layer, which uses a simple and effective algorithm, is added above the LAN card driver software to detect and overcome faults. For our approach, there is no need to change the existing hardware or the end-use interfaces. Furthermore, the fault-detection time is reduced significantly compared to the conventional software-based approach.

  • PDF

A Study of a Rate Limit Method for QoS Guarantees in Ethernet (이더넷에서의 QoS 보장을 위한 대역제한에 관한 연구)

  • Chung, Won-Young;Park, Jong-Su;Kim, Pan-Ki;Lee, Jung-Hee;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.100-107
    • /
    • 2007
  • Recently, a study of BcN(Broadband convergence Network) is progressing continuously, and it is important to improve the quality of the service according to subscribers because a scale of network is about to be larger. It is more important to manage QoS(Quality of Service) of all subscribers in layer 2 than layer 3 network since managing it in layer 3 network cost both additional processes and large hardware. Moreover, QoS based on Best-Effort service has been developed because tots of subscribers should use limited resource in BcN. However, they want to be supplied with different service even though they pay more charge. Therefore, it is essential to assign the different bandwidth to subscribers depending on their level of charge. The method of current Rate Limiter limits the bandwidth of each port that does not offer fair service to subscribers. The Rate Limiter proposed in this paper limits bandwidth according to each subscriber. Therefore, subscribers can get fair service regardless of switch structure. This new Rate Limiter controls the bandwidth of subscribers according to the information of learning subscriber and manages maximum performance of Ethernet switch and QoS.

Implementation of an OpenFlow-based Access Point Virtual Switch for Monitoring and Virtualization of Legacy Wireless LAN

  • Lee, Hyung-Bong;Park, Ji-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.65-72
    • /
    • 2016
  • Network virtualization is an emerging technology for solving the rigidity of the physical network infrastructure. The innovative technique virtualizes all resources in the network, including the network links and nodes, and provides a number of virtual networks on a single network infrastructure. In order to realize a virtual network, a thorough and complete monitoring of all resources in the network should be performed firstly. OpenFlow is an open source stack for network virtualization. However, it is impossible to apply OpenFlow to AP-based legacy wireless LAN environment because OpenFlow targets ethernet-based LAN environment. In this paper, we implement an adaptor-styled virtual switch for AP-based wireless LAN through customizing the Open vSwitch which is a virtual switch of OpenFlow. The evaluation test results show that the implemented OpenFlow stack operates successfully. The implemented OpenFlow stack can now be plugged immediately in existing AP-based wireless LAN environment and plays network resource monitoring. In the future, we can develop wireless LAN virtualization applications on the wireless OpenFlow stack.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems (배전계통 최적 재구성 문제에 PC 클러스터 시스템을 이용한 병렬 유전 알고리즘-타부 탐색법 구현)

  • Mun Kyeong-Jun;Song Myoung-Kee;Kim Hyung-Su;Kim Chul-Hong;Park June Ho;Lee Hwa-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.556-564
    • /
    • 2004
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search(GA-TS) algorithm to search an optimal solution of a reconfiguration in distribution system. The aim of the reconfiguration of distribution systems is to determine switch position to be opened for loss minimization in the radial distribution systems, which is a discrete optimization problem. This problem has many constraints and very difficult to solve the optimal switch position because it has many local minima. This paper develops parallel GA-TS algorithm for reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10% of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node aster predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium Ⅳ CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution systems in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution qualify. speedup. efficiency and computation time.