Performance analysis of cut-through buffered banyan networks with finite buffer size

In this paper, we present an analytic model to estimate the performance of cut-through buffered banyan networks with finite buffer size. Two conflict resolution policies are considered in order to resolve conflicts when two packets are destined to the same output link, and their performances are compared. Our analytic model enables analysis of the networks in which buffers are unevenly distributed, i.e., each stage has a different buffer size. It is shown that if buffers are properly distributed in the network, higher throughput and lower delay are possible, although the improvement is considered small. Finally, in order to validate our model, some analytic results are compared to simulation.     

Effective cell loss analysis of a nonblocking ATM switch with nonuniform traffic

This paper quantifies a trade-off existing between cell loss and cell delay in an ATM switch with arbitrary input and output buffer sizes. TheEffective Cell Loss is introduced as a cell loss performance measure which combines both the cell loss due to buffer overflow and the cell loss due to excessive delay. ThisEffective Cell Loss measure allows one to design optimal input and output buffer sizes for a given cell loss requirement. Our analysis is versatile enough to easily study the adverse effect due to nonuniform traffic patterns at a switch. Study shows that the nonuniform traffic may jeopardize ATM switches designed under the uniform traffic assumption. For some examples, we have provided both numerical and computer simulation results to show the validity and usefulness of our analysis.     

IP与ATM结合技术研究

对现有的IP与ATM相结合的技术进行讨论，以及各自的优缺点进行分析，并指出了进一步的研究方向。     

基于QoS参数的ATM网络性能评价模型

该文对ATM网络的CBR、VBR、ABR三种业务类型采用分组延迟时间作为评价指标,考虑到服务质量指标QoS对网络性能的影响,建立了基于QoS参数的ATM网络性能评价模型,并给出了相应的解析式。利用计算机仿真方法对该模型进行仿真试算,结果表明这种性能评价模型基本可用。     

Open Signaling for ATM Networks: A Vexed Question of Performance

Based on a clear separation between switching hardware and control software, the concept of open signaling creates an open programmable networking environment in which network entities can be realized as high level software objects with well-defined interfaces. This underlying architecture facilitates the creation of multiple mechanisms of network control, supporting applications for connection management. The feasibility of a connection management framework however depends mainly on the performance of CORBA because of binding overheads associated with remote invocations. It has been proposed that an implementation with reasonable performance may require certain criteria to be integrated into the design, including caching of network states, aggregation of access to the switch server object, and parallel processing of a single call request. This paper considers the effectiveness of these design criteria and the associated performance issues of a connection management system for ATM networks.     

一种新的容错ATM交换机结构的冗余路径分析

异步传输模式ATM是国际化电信联盟建议用于宽带综合业务数字网（B－ISDN）的传输模式。容错是提高网络可靠性的主要方法。该文讨论了一种新的容错ATM交换机结构。该结构以Banyan交换机结构为基础,通过增加子交换单元和扩展链路来增加冗余路径的数目,该结构可以容错多个故障,并且冗余路径的数目随着交换机级数的增加而指数增长。同现有文献中其它容错ATM交换机对比分析可以看出,在具有相近的交换元素个数的前提下,建议的交换机提供了更高的容错能力。     

Analysis of Source Rate Adaption for ATM networks using a dynamic flow model

This paper focuses on using Source Rate Adaption (SRA) as a viable flow control scheme in Asynchronous Transfer Mode (ATM) networks. A modeling technique related to conducting performance evaluation studies using a dynamic flow model has been developed. SRA control strategies at node, domain or network levels have been proposed. Computer simulations verify the validity of the model and strategies.     

Analysis of a finite buffer queue with different scheduling and push-out schemes

A queueing system M₁, M₂/G₁, G₂/1/N with different scheduling and push-out scheme is analyzed in this paper. This work is motivated by the study of the performance of an output link of ATM switches with traffic of two classes with different priorities. However, the queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priority traffic. General service time distributions are allowed for classes 1 and 2 and a general service discipline function, ₁(i, j), is introduced where ₁(i, j) is the probability that a class 1 packet will be served, given that there are i class 1 and j class 2 packets waiting for service. An exact solution is obtained for the loss probabilities for classes 1 and 2, the queue length distribution and the mean waiting time for class 1. The queue length distribution and the mean waiting time for class 2 are calculated approximately. It is shown that the approximation is an upper bound and the error due to the approximation is very small when the loss probability of class 2 is small (e.g., less than 0.01).     

ATM交换控制电路设计验证技术

异步传输模式(ATM)技术作为宽带应用的基本技术用在局域网和广域网中。该文结合ATM技术应用,以ATM交换机的一组芯片设计为研究对象,针对其中一款ATM交换控制电路的FPGA原型,提出一种基于Tcl语言的自动化验证方法,实现ATM交换控制电路的功能验证。应用结果表明：话音业务和IP业务均通信正常,中继信令测试正常。     

基于ATM的MPLS网络仿真模型设计与实现

利用计算机仿真分析MPLS网络的性能是深入研究MPLS技术的有效途径。该文通过分析基于ATM的MPLS技术,在借鉴OPNET仿真软件中MPLS模型的基础上,实现了基于ATM的标签交换路由器模型,构建了基于ATM的MPLS网络仿真模型。利用该仿真模型建立的MPLS仿真试验网络,数据传输性能明显优于非MPLS网络。该模型的开发对于MPLS网络的性能分析具有一定的意义。     

Performance and robustness analysis of a fuzzy-immune flow controller in ATM networks with time-varying multiple time-delays

For the Asynchronous Transfer Mode （ATM） networks with time-varying multiple time-delays, a more realistic model for the available bit rate （ABR） traffic class with explicit rate feedback is introduced. A fuzzy-immune controller is designed, which can adjust the rates of ABR on-line, overcome the bad effect caused by the saturation nonlinearity and satisfy the weighted fairness. Also, the sufficient condition that guarantees the stability of the closed-loop system with a fuzzy-immune controller is presented in theory for the first time. The algorithm exhibits good performance, and most importantly, has a solid theoretical foundation and can be implemented in practice easily. Simulation results show that the control system is rapid, adaptive, robust, and meanwhile, the quality of service （QoS） is guaranteed.     

基于网络模拟的多媒体网络性能评价方法

计算机模拟是多媒体网络性能评价的一种重要手段。该文在分析多媒体网络特点及其性能评价指标的基础上,着重讨论了运用计算机模拟技术对多媒体网络进行性能评价的方法。还根据讨论结果完成了一个模拟实验,对一个特定多媒体网络在不同多媒体业务下的一些性能指标进行了分析,并根据分析结果,给出了该性能指标的性能空间。     

IP Over ATM与IP Over SDH/SONET技术

首先对当今IPOverATM技术采用的设计方案（局域网仿真，IP交换，标签交换）进行了详细的分析与比较，然后在总体上将IPOverATM与IPOverSDH/SONET技术进行了比较。     

On the design of efficient ATM routing schemes

In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks; (ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight.     

Overview of ATM networks: functions and procedures

The purpose of this paper is to present an overview of the ATM technique. The basic principles of the ATM transfer technique, the B-ISDN layered protocol reference model, as well as the architecture and the main functions of the ATM network, are described in this tutorial. In particular, we present the main characteristics of the ATM technique, the structure of the ATM cell, the functions which deal with the protection from errored cells (HEC procedure) and the identification of the boundaries of the ATM cells (cell delineation and scrambling). The VP/VC concept is explained in detail, and the main principles and functions of the three lowest layers (Physical, ATM and Adaptation) of the B-ISDN layered protocol reference model are surveyed. The issue of Quality of Service parameters in ATM networks is reviewed, and the problem of the allocation of the network resources in response to user demands, as well as the problems of congestion control, Usage Parameter Control (UPC) and traffic modelling in ATM networks, are assessed. Finally, we present ‘possible’ sets of traffic characterization parameters, and show how possible B-ISDN sources can be modelled according to the basic on-off ATM traffic source model.     

Performance improvement for applying network virtualization in fiber-wireless （FiWi） access networks

Fiber-wireless （FiWi） access networks, which are a combination of fiber networks and wireless networks, have the advantages of both networks, such as high bandwidth, high security, low cost, and flexible access. However, with the increasing need for bandwidth and types of service from users~ FiWi networks are still relatively incapable and ossified. To alleviate bandwidth tension and facilitate new service deployment, we attempt to apply network virtualization in FiWi networks, in which the network＇s control plane and data plane are separated from each other. Based on a previously proposed hierarchical model and service model for FiWi network virtualization, the process of service implementation is described. The performances of the FiWi access networks applying network virtualization are analyzed in detail, including bandwidth for links, throughput for nodes, and multipath flow transmission. Simulation results show that the FiWi network with virtualization is superior to that without.     

基于模糊神经网络的ATM网络业务量智能预测

文章尝试将模糊神经网络方法引入ATM网络的业务量预测中。ATM网络业务源一般是随机产生的时变信号,其模型一般很难描述。文章充分考虑了模糊神经网络的学习功能,通过对相关模型的仿真,能够很好地描述ATM网络中的业务流特性,对多媒体的业务量做出了准确的预测。与传统的神经网络方法比较,具有更好的逼近效果。     

Scalable dynamic Monitoring,Analysis and Tuning Environment for parallel applications

Parallel/distributed systems are continuously growing. This allows and enables the scalability of the applications, either by considering bigger problems in the same period of time or by solving the problem in a shorter time. In consequence, the methodologies, approaches and tools related to parallel paradigm should be brought up to date to support the increasing requirements of the applications and the users. MATE (Monitoring, Analysis and Tuning Environment) provides automatic and dynamic tuning for parallel/distributed applications. The tuning decisions are made according to performance models, which provide a fast means to decide what to improve in the execution. However, MATE presents some bottlenecks as the application grows, due to the fact that the analysis process is made in a full centralized manner. In this work, we propose a new approach to make MATE scalable. In addition, we present the experimental results and the analysis to validate the proposed approach against the original one.     

Performance comparison of different multicast routing strategies in disruption tolerant networks

Disruption Tolerant Networks (DTNs) technologies are emerging solutions to networks that experience frequent partitions. As a result, multicast design in DTNs is a considerably more difficult problem compared to that in Internet and mobile ad hoc networks. In this paper, we first investigate three basic DTN multicast strategies, including unicast-based multicast (U-Multicast), static-tree-based multicast (ST-Multicast) and dynamic-tree-based multicast (DT-Multicast) strategies. Then we focus on studying two DT-Multicast routing schemes: Dynamic Tree Based Routing (DTBR) and On-demand Situation-aware Multicast (OS-Multicast), which address the challenges of utilizing opportunistic links to conduct dynamic multicast structures in DTNs. Performances of different strategies are then evaluated by simulations, including applying the real-world DTN traces. Our results show that OS-Multicast and DTBR can achieve higher message delivery ratio than that of using U-Multicast and ST-Multicast strategies. Also, to get better performance, we recommend that system designers select OS-Multicast when the source traffic rate is low.