• Title/Summary/Keyword: ATM networks

Search Result 513, Processing Time 0.034 seconds

Algorithm for Generating Traffic Distributions in ATM Networks using 2-D LHCA

  • Cho, Sung-Jin;Kim, Seok-Tae;Kim, Jae-Gyeom;Kim, Han-Doo;Park, Un-Sook
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.176-183
    • /
    • 1999
  • Using Asynchronous Transfer Mode(ATM) which is a high-bandwidth, low-delay, cell switching and multiplexing technology, Broadband-Integrated Services Digital Network (B-ISDN) can support communication services of all kinds. To evaluate the performance of ATM networks, traffic source models to meet the requirements are demanded. We can obtain random traffic distribution for ATM networks by using the Cellular Automata (CA) which have effective random pattern generation capability. In this paper we propose an algorithm using 2-D LHCA to generate more effective random patterns with good random characteristics. And we show that the randomness by 2-D LHCA is better than that of the randomness by 1-D LHCA.

  • PDF

A dynamic multicast routing algorithm in ATM networks (ATM 망에서 동적 멀티캐스트 루팅 알고리즘)

  • 류병한;김경수;임순용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2477-2487
    • /
    • 1997
  • In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

  • PDF

Fast and Seamless Handoff Control in Wireless ATM Networks (무선 ATM 네트워크에서 빠르고 매끄러운 핸드오프 제어)

  • Koh, Jae-Young
    • Convergence Security Journal
    • /
    • v.7 no.1
    • /
    • pp.99-106
    • /
    • 2007
  • We propose a distributed anchor Crossover Switches (CX) searching algorithm to play an important role in ensuring fast and seamless handoff control in wireless ATM networks. Within networks that are grouped together, connection management is done for each group by anchor switches, and Permanent Virtual Circuit (PVC) with a narrow bandwidth is assigned between anchors for exchange of information. The proposed algorithm enables quick searching of a targeted CX, makes management of the overall network easier, and reduces system overhead or propagation delay time, thus providing fast and seamless handoff.

  • PDF

A Methodology for the construction of ATM Network to support the Power Utility Services (전력 통신서비스를 위한 ATM 통신망 구축방법)

  • Yoon, Il-Hwan;Yoo, Jae-Tack;Kim, Il-Dong
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.961-963
    • /
    • 1998
  • Power telecommunication networks, being used to support the operation and management of power utility services, exhibits different characteristics from those of public domain networks. KEPCO is planning to evolve its own power network infrastructure to exploit ATM (Asynchronous Transfer Mode) technology. The ATM network to be developed needs to effectively utilize existing network of KEPCO and to fully support new and emerging power-utility-services. This paper summarizes the features of power communication services and the characteristics of Power telecommunication networks, and reports our evolution methodology for KEPCO network.

  • PDF

A dynamic connection admission control algorithm using variable-sized moving window in ATM networks (가변 크기 Moving Window를 적용한 ATM 망에서의 동적 호 접속 제어 연구)

  • 이수경;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.3
    • /
    • pp.593-603
    • /
    • 1997
  • Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

  • PDF

Design of Robust $H_{\infty}$ Controller with Regional Pole Placements for Congestion Control in ATM Networks (ATM 네트워크의 폭주제어를 위한 극점 배치를 갖는 견실 $H_{\infty}$ 제어기 설계)

  • Kim, Joon Ki;Jeong, Sang Seop;Park, Hong Bae
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.127-130
    • /
    • 2000
  • In this paper, we design the robust H$_{\infty}$ controller for congestion control in ATM (asynchronous transfer mode) networks with the variation of other higher priority sources(e.g., constant bit rate, variable bit rate). Since ABR (available bit rate) sources share the bottleneck node with other higher priority sources, we design the controller which guarantees robustness against time delay and disturbance. The proposed robust H$_{\infty}$ controller with regional pole placements can minimize the variation of the queue size at the predefined desired level. And we also show its robustness through simulation for the ATM networks with time delay and disturbance.

  • PDF

Implicit Scheduling Algorithm for Dynamic Slot Assignment in Wireless ATM Networks (무선 ATM 네트워크에서의 동적 대역 할당을 위한 묵시적 스케쥴링 알고리즘)

  • 황민재;강충구;김용진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1229-1238
    • /
    • 1999
  • To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.

  • PDF

Dynamic Slot Allocation Algorithm of Wireless ATM (무선 ATM에서의 동적 슬롯 할당 알고리즘)

  • Lee, Ji-Hyun;Yu, So-Young;Seo, Ju-Ha
    • Journal of Industrial Technology
    • /
    • v.21 no.A
    • /
    • pp.189-198
    • /
    • 2001
  • In recent years, the predominant part in telecommunications is mobile communications. The next generation network is extending today's voice-only mobile networks to multi-service networks. ATM Network is possible to carry such multi-media traffic and it will be expect to use wireless ATM for the future mobile access network. One of manly important aspects for the performance of wireless ATM is the Medium Access Control (MAC) protocol. The MAC protocol must be able to satisfyingly handle the different ATM services (CBR, VBR, ABR and UBR) with their radically different performance requirements. Additionally, the MAC protocol must be able to cope with the complex radio environment where fading, multi-path propagation interference and burst-errors further complicate the situation. In this paper, a dynamic slot allocation algorithm in wireless ATM is proposed for an efficient channel sharing/media access at the MAC layer. We use equivalent capacity in the allocation of slots for VBR traffic which is variable along the time. It is simple and effective slot allocation method for VBR service. In particular, we consider the slot allocation of a session consisted of several connections for requirement of multimedia traffic. Simulation shows that the cell loss ratio is reduced by re-allocation of extra slots in Mobile Terminal (MT).

  • PDF

ANALYSIS OF DYNAMIC PRIORITY QUEUE WITH APPLICATIONS IN ATM NETWORKS

  • Choi, Doo-Il;Lee, Yu-Tae
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.617-627
    • /
    • 2000
  • ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

QoS oriented bandwidth management scheme on the ATM based IMT-2000 networks (ATM 기반 IMT-2000망에서 QoS에 기반한 대역폭 관리기법)

  • 조성현;양승제;박성한
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.35-38
    • /
    • 1999
  • In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

  • PDF