• Title/Summary/Keyword: ring network

Search Result 327, Processing Time 0.027 seconds

Performability Analysis of Token Ring Networks using Hierarchical Modeling

  • Ro, Cheul-Woo;Park, Artem
    • International Journal of Contents
    • /
    • v.5 no.4
    • /
    • pp.88-93
    • /
    • 2009
  • It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

A Novel Ring-based Multicast Framework for Wireless Mobile Ad hoc Network

  • Yubai Yang;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.430-432
    • /
    • 2004
  • Multicasting is an efficient means of one to many (or many to many) communications. Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in ad hoc network. Protocols and approaches currently proposed on this issue could be classified mainly into four categories, tree-based, meshed-based, statelessness and hybrid. In this article, we borrow the concept of Eulerian ring in graph theory and propose a novel ring-based multicast framework--Hierarchical Eulerian Ring-Oriented Multicast Architecture (HEROMA) over wireless mobile Ad hoc network. It is familiar with hybrid protocol based on mesh and tree who concentrates on efficiency and robustness simultaneously. Architecture and recovery algorithm of HEROMA are investigated in details. Simulation result is also presented, which show different level of improvements on end-to-end delay in scenario of small scale.

  • PDF

An Optimization Model and Heuristic Algorithms for Multi-Ring Design in Fiber-Optic Networks (광전송망에서의 다중링 설계를 위한 최적화 모형 및 휴리스틱 알고리즘)

  • 이인행;이영옥;정순기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.15-30
    • /
    • 2000
  • The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.

  • PDF

Flush Optimizations to Guarantee Less Transient Traffic in Ethernet Ring Protection

  • Lee, Kwang-Koog;Ryoo, Jeong-Dong
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.184-194
    • /
    • 2010
  • Ethernet ring protection (ERP) technology, which is defined in ITU-T Recommendation G.8032, has been developed to provide carrier grade recovery for Ethernet ring networks. However, the filtering database (FDB) flush method adopted in the current ERP standard has the drawback of introducing a large amount of transient traffic overshoot caused by flooded Ethernet frames right after protection switching. This traffic overshooting is especially critical when a ring provides services to a large number of clients. According to our experimental results, the traditional FDB flush requires a link capacity about sixteen times greater than the steady state traffic bandwidth. This paper introduces four flush optimization schemes to resolve this issue and investigates how the proposed schemes deal with the transient traffic overshoot on a multi-ring network under failure conditions. With a network simulator, we evaluate the performance of the proposed schemes and compare them to the conventional FDB flush scheme. Among the proposed methods, the extended FDB advertisement method shows the fastest and most stable protection switching performance.

A Design of a Register Insertion Backbone Ring Network (레이스터 인서션 Backbone 링 네트워크에 관한 연구)

  • 강철신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.8
    • /
    • pp.796-804
    • /
    • 1992
  • This paper presents a design of a backbone network which uses a rigister-Insertion ring structure, The introduction of a high speed register in sertton backbone ring enables high performance inter-network 4ommunicatlons In a simple and modular structure at low cost and Its concurrent communications.. Two or more bridge nodes can be used to construct a register Insertion backbone ring network. The high bandwidth of the backbone ring sup ports heavy traffic for Inter-segment Eornrnunicatlons. The bridge node does both local address filtering to block data entering the ring and remote address filtering to block data entering the local LAN segment . Title local address greatly reduces the rate on the backbone ring and the remote address filterlng greatly reduces the traffic rate on each LAN segment. An feature makes the network the network reconflguratlon simpler and transparent to users. A throughput analysis Is used to deterrune the bandwidth of the backbone rlr)g transmission medium.

  • PDF

Desigen of HAN/RT(Home ATM Network with Ring Topology)(Home ATM Network with Ring Topology) (링형 토폴로지를 갖는 댁내 ATM 망의 설계)

  • 이재욱;고윤섭;전영애;박용진
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.359-361
    • /
    • 1998
  • 초고속 정보통신망의 등장과 다양한 서비스 및 통신기능을 갖춘 정보가전의 개발로 인하여 댁내 통신망 개발의 중요성이 대두되고 있다. 본 논문에서는 댁내의 정보 가전들간에 경제적으로 ATM 기반의 고속 통신 기술을 제공하는HAN/RT(Home ATM Network with Ring Topology)프로토콜을 제안한다. HAN/RT는 저가이며 단순한 기능만을 가진 스위치로 셀 스위칭을 수행하며, 스위치의 복잡한 기능을 제어기에 적재하며 효율적인 망구조를 설계한다. 또한 HAN/RT에서의 셀 교환 시나리로에 대하여 기술한다.

  • PDF

Routing Algorithms on a Ring-type Data Network (링 구조의 데이터 통신망에서의 라우팅 방안)

  • Ju, Un-Gi
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.238-242
    • /
    • 2005
  • This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

  • PDF

A WDM Based Multichannel All-Optical Ring Network (파장 분할 다중화에 의한 다 채널 광 링 통신망의 성능 분석)

  • 박병석;강철신;신종덕;정제명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.1
    • /
    • pp.159-169
    • /
    • 1994
  • A multichannel optical slotted ring network is designed using a wavelength division multiplexing(WDM) technique and photonic packet switching devices. The electronics speed bottleneck is removed out of the ring, which allows utilization of the full bandwidth for the optical fiber transmission medium. The ring channel adopts a slotted ring concept with a destination cell remove strategy for the eing access mechanism. The slot size in the ring is selected as the same as that of ATM based cell in order to be used as B-ISDN Access Networks. In this paper, we devised a mathematical method to measure the average transfer delay characteristics of the network. The analytical method turned out to yield accurate results over a broad range of parameters in comparison to simulation results. From the study, we observed the average transfer delay of the network as the network parameters vary.

  • PDF

Impacts of Hierarchy in Ethernet Ring Networks on Service Resiliency

  • Lee, Kwang-Koog;Ryoo, Jeong-Dong;Kim, Young-Lok
    • ETRI Journal
    • /
    • v.34 no.2
    • /
    • pp.199-209
    • /
    • 2012
  • In transport networks, a multi-ring architecture is very useful to facilitate network planning and to design and provide more resilient services for customers. Unlike traditional synchronous optical network multi-rings, the service resiliency of Ethernet-based multi-rings is significantly impacted by the ring hierarchy because a link or node failure in a certain level ring triggers filtering database flush actions in all higher level rings as well as in the ring with the failure, and consequently a large amount of duplicated data frames may be flooded. In this paper, we investigate how the ring hierarchy impacts the service resiliency of multi-ring networks. Based on extensive experiments on various single- and multiple-link failures, we suggest two effective inter-ring connection rules to minimize the transient traffic and to ensure more resilient multi-ring networks. In addition, we consider a flush optimization technique called e-ADV, and show that the combination of e-ADV and multi-ring structures satisfying our inter-ring connection rules results in a more attractive survivability performance.

Performance Evaluation of the WDM Ring Network Based on Photonic Slot Routing (광-슬롯 경로 배정 방식을 기반으로 한 WDM 링의 성능 평가)

  • 한상현;이호숙;소원호;은지숙;김영천
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.154-157
    • /
    • 1999
  • Photonic Slot Routing(PSR) is a promising approach to solve the fundamental scalability problem of all-optical packet switched WDM networks. In photonic slot routing, packets destined for the same subnetwork are aggregated to form a photonic slot which is jointly routed as a single unit of information through the network. The relative location of the nodes from bridge may cause to fairness problem in the unidirectional WDM ring network based on PSR. As photonic slots from different subnetworks can originate contentions at the bridge, packets may be dropped and retransmitted. Thus we evaluated the performance of PSR based WDM ring network in the point of fairness for each node and slot contentions at the bridge. Simulation results show that the PSR based WDM ring requires a slot access mechanism to guarantee the transmission fairness and efficient switch architecture to resolve slot contention at the bridge.

  • PDF