<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

1996 - 199952000 - 20013

Settings

🏛️國立陽明交通大學機構典藏

Subject: search.filters.subject.asynchronous transfer mode

Search Results

Now showing 1 - 8 of 8
  • Thumbnail Image
    Item type:Item,
    Design of a power-spectrum-based ATM connection admission controller for multimedia communications
    (1998-02-01)
    Chang, CJ
    ;
    Lin, CH
    ;
    Guan, DS
    ;
    Cheng, RG
    ;
    電信工程研究所
    This paper proposes a power-spectrum-based connection admission controller design in asynchronous transfer mode (ATM) switches for multimedia communications, The controller contains a power-spectrum-indexed table for managing multimedia call requests, where traffic characteristics of call requests are described by the power spectrum, The power spectrum can be obtained from the claimed traffic parameters of peak rate, mean rate, and peak rate duration; the pow er spectrum has been shown to have a dominant effect on system performance, The results show that the proposed power-spectrum-based connection admission control method achieves higher system utilization and lower call-blocking probability than the equivalent-capacity allocation method.
  • Thumbnail Image
    Item type:Item,
    Design of a power-spectrum-based ATM connection admission controller for multimedia communications
    (1998-02-01)
    Chang, CJ
    ;
    Lin, CH
    ;
    Guan, DS
    ;
    Cheng, RG
    ;
    電信工程研究所
    This paper proposes a power-spectrum-based connection admission controller design in asynchronous transfer mode (ATM) switches for multimedia communications, The controller contains a power-spectrum-indexed table for managing multimedia call requests, where traffic characteristics of call requests are described by the power spectrum, The power spectrum can be obtained from the claimed traffic parameters of peak rate, mean rate, and peak rate duration; the pow er spectrum has been shown to have a dominant effect on system performance, The results show that the proposed power-spectrum-based connection admission control method achieves higher system utilization and lower call-blocking probability than the equivalent-capacity allocation method.
  • Thumbnail Image
    Item type:Item,
    Design and analysis of a growable multicast ATM switch
    (2000-07-01)
    Wang, KC
    ;
    Cheng, MH
    ;
    資訊工程學系
    ;
    Department of Computer Science
    This work designs and analyzes a cost-effective growable multicast asynchronous transfer mode (ATM) switch that has a new grouping network structure. The proposed switch can easily be enlarged by using more stages, since both cell routing and contention resolution are designed to distribute ol er switch elements. Experimental results indicate that, by allowing valid cells to enter grouping networks from two directions (the west and north sides), the modular ATM sa itch proposed herein not only meets the ATM performance requirements for both unicasting and multicasting but also uses fen er switch elements and has a shorter cell delay than the ATM switch.
  • Thumbnail Image
    Item type:Item,
    A simplified approach based on source control for ATM ABR service
    (2001-08-15)
    Lee, CL
    ;
    Chen, YC
    ;
    Chen, JR
    ;
    資訊工程學系
    ;
    Department of Computer Science
    The available bit rate (ABR) service is designed to provide efficient support of data traffic in ATM networks. A variety of rate-based flow control approaches have been proposed to support ABR service. Most of these approaches improve both the fairness among active connections and the link utilization by putting more and more complexity into a switch. In this article, we propose a flow control approach in which part of rate-calculation work is moved from switches to end-systems. As a result, the proposed approach reduces the rate-calculation effort in the switch. This may reduce the switch complexity and thus the implementation cost. Furthermore, it mitigates the difficulty for setting the measurement interval in switches. as well as features lower and more stable queue occupancy in the network. Simulation results are presented to demonstrate that the proposed approach achieves better performance than ERICA +, a well-known switch algorithm. (C) 2001 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Design and analysis of a merging algorithm for multipoint-to-point ABR service in ATM networks
    (2001-10-01)
    Lee, CL
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In this paper, we propose a merging algorithm, which can provide efficient support for multipoint-to-point ABR service in ATM networks. By forwarding the FRM cells belonging to the VC with the largest FRM-cell arrival rate in a merge point, the proposed algorithm can achieve better link utilization than existing merging algorithms. In addition, the proposed algorithm reduces the number of FRM cells forwarded by a C merge point. As a result, it can reduce the control overhead of ABR service. Most importantly, it does not incur extra complexity in switches. We also discuss the impact of different network topologies on our algorithm. Simulation results show that the proposed algorithm is able to achieve better performance while requiring significantly fewer RM cells. (C) 2001 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Estimates of loss probabilities for delay-sensitive traffic in ATM networks
    (1996-06-20)
    Lai, KC
    ;
    Lee, TH
    ;
    傳播研究所
    ;
    電控工程研究所
    ;
    Institute of Communication Studies
    Simple estimates of loss probabilities for heterogeneous delay-sensitive traffic in ATM networks are presented. Cells of different connections can have different loss priorities. Numerical results show that the estimates, which are derived from the bufferless fluid flow model, are close to the actual cell loss probabilities.
  • Thumbnail Image
    Item type:Item,
    Estimation-based call admission control with delay and loss guarantees in ATM networks
    (1997-04-01)
    Hah, JM
    ;
    Yuang, MC
    ;
    交大名義發表
    ;
    資訊工程學系
    ;
    National Chiao Tung University
    Call admission control (CAC) has been accepted as a potential solution for supporting a variety of traffic sources demanding different quality of service guarantees in asynchronous transfer mode networks. Basically, CAC is required to consume a minimum of time and space to make call acceptance decisions. In the paper a CAC algorithm is presented based on a novel estimation method, called quasilinear dual-class correlation (QLDC). All heterogeneous traffic calls are initially categorised into various classes. According to the number of calls in each traffic class, QLDC conservatively and precisely estimates the cell delay and cell loss ratio for each traffic class via simple vector multiplication. These vectors are computed in advance from the results of three dual arrival queuing models, M-[N1] + I-[N2]/D/1/K, M-1([N1]) + M-2([N2])/D/1/K and I-1([N1]) + I-2([N2)]/D/1/K, where M and I represent the Bernoulli process and the interrupted Bernoulli process, respectively. Consequently, the authors' QLDC-based CAC, as will be shown, yields low time complexity O(C) (in vector multiplications) and space complexity O(WC2) (in bytes), where C is the total number of traffic classes and W is the total number of aggregate load levels. Numerical examples are also employed to justify that QLDC-based estimated results profoundly agree with simulation results in both the single-node and end-to-end cases.
  • Thumbnail Image
    Item type:Item,
    Optimal bit allocation for coding of video signals over ATM networks
    (1997-08-01)
    Chen, JJ
    ;
    Lin, DW
    ;
    電子工程學系及電子研究所
    ;
    電信研究中心
    ;
    Department of Electronics Engineering and Institute of Electronics
    We consider optimal encoding of video sequences for ATM networks. Two cases are investigated, In one, the video units are coded independently (e.g., motion JPEG), while in the other, the coding quality of a later picture may depend on that of an earlier picture (e.g., H.26x and MPEGx). The aggregate distortion-rate relationship for the latter case exhibits a tree structure, and its solution commands a higher degree of complexity than the former. For independent coding, we develop an algorithm which employs multiple Lagrange multipliers to find the constrained bit allocation, This algorithm is optimal up to a convex-hull approximation of the distortion-rate relations in the case of CBR (constant bit-rate) transmission, It is suboptimal in the case of VER (variable bit-rate) transmission by the use of a suboptimal transmission rate control mechanism for simplicity. For dependent coding, the Lagrange-multiplier approach becomes rather unwieldy, and a constrained tree search method is used. The solution is optimal for both CBR and VER transmission if the full constrained tree is searched, Simulation results are presented which confirm the superiority in coding quality of the encoding algorithms, We also compare the coded video quality and other characteristics of VER and CBR transmission.