OBS网络中基于优先级抢占的恢复机制

提出一种新的支持光突发交换网络中优先级抢占的快速恢复机制.该机制对不同优先级的业务采取不同的恢复策略,实现故障的快速恢复.同时采用阈值检测方式支持优先级抢占,减少受影响链路中较高优先级业务的丢包.仿真结果表明,基于优先级抢占的恢复机制具有较低的丢包率,对高优先级业务丢包率性能改善更为明显.     

ATM local area networks

LAN emulation offers a best-effort, connectionless, packet transfer service at the MAC sublayer, implemented on top of a connection-oriented ATM network LAN emulation using switched virtual connections requires address resolution to locate the destination end station followed by connection establishment to the resulting ATM address. Address resolution may be implemented by a broadcast technique or by an address server. The broadcast method is the simplest for small networks but a combination of both is probably better. The use of the MAC address to identify an end station, with dynamic binding to its current physical location in the ATM network, allows the ATM LAN segment to be viewed as a virtual LAN. The virtual LAN model permits end stations to move and change physical location while maintaining connection to the same ATM LAN segment. This greatly simplifies the management of large data networks     

Topological considerations of ATM networks

This article considers two hierarchical routing models based on the optimization of the size of topology databases and routing complexity, respectively. Some design guidelines are also suggested for an hierarchical PNNI structure of a network topology. Copyright © 1999 John Wiley & Sons, Ltd.     

ATM technology for corporate networks

Asynchronous transfer mode (ATM) technology is discussed in relation to the requirements of corporate networking. An introduction to ATM switch architecture is presented. The various approaches to ATM switch design that have appeared in previously published literature are reviewed. A discussion is presented of some current issues facing the development of the ATM networks. It is argued that much simpler solutions to many of these issues may be adopted in the context of the corporate network than is permissible for the public broadband network     

Traffic profiles in ATM networks

A lot of studies have been made to characterize and model sources of ATM traffic (voice, data, video) and to evaluate the performance of a multiplexer whose input is a superposition of these sources, using different methods and techniques (fluid flow, matrix-analytic, etc.). However, in order to better understand the end-to-end performance of ATM connections, characterizations and models of ATM traffic inside the network (i.e. after passage through one or more network elements) are needed. In this paper we intend to study the following problems: (i) Traffic profile of an ATM connection after being policed, in particular worst case traffic, and evaluation of the performance of the related statistical multiplexer. (ii) Traffic profile of the output of a multiplexer (characterized by means of the interdeparture time distribution and the index of dispersion for counts and the index of dispersion for interarrival times). (iii) Traffic profile of a single connection after passing a multiplexer. The aim is to obtain useful characterizations and models of ATM traffic in order to evaluate the performance and the efficiency of ATM network elements and of traffic control functions.This work was supported in part by the Commission of the European Communities, under project RACE R2024 (Research and Development on Advanced Communications in Europe) on Broadband Access Facilities.     

Cell multiplexing in ATM networks

Formulates, analyzes, and compares several connection multiplexing algorithms for a multiplexer residing in the equivalent terminal of the asynchronous transfer mode (ATM) layer at the user premise. The primary goal is to find an algorithm that efficiently combats the cell delay variation (CDV) introduced by the multiplexer. Several performance criteria are examined, one of which is unique to ATM networks. This one is the proportion of arriving cells that do not conform to the traffic contract of the connection. The conformance is being tracked by a generic cell rate algorithm (GCRA) recommended (but not mandatory) by CCITT. Other criteria are the classical buffer requirements and the cell delay. Service fairness among connections is also evaluated with respect to each performance criterion. The impact of the following five multiplexing policies on the performance criteria are evaluated for constant bit rate (CBR) traffic sources. The policies are first in, first out (FIFO), round robin (RR), least time to reach bound (LTRB), most behind expected arrival (MBEA), and golden ratio (GR). Extensive numerical examples reveal that there is no single policy that is best across all criteria. With respect to cell conformance, most behind expected arrival (MBEA) emerges as the preferred one. FIFO is best with respect to cell delay, except for high utilizations where RR dominates. The LTRB is marginally better than all other policies with respect to buffer requirements     

Protocols for ATM access networks

The development and standardization of ATM (asynchronous transfer mode) and signaling protocols for BISDN (broadband integrated services digital network) are considered. A view of both ATM and signaling protocols in which the key design guideline is service flexibility is presented. The approaches suggested are intended to create a service-independent broadband facility that is also sensitive to both service performance and network efficiency. Key issues are raised that will require serious consideration by standards groups, manufacturers, and service providers as BISDN moves toward production     

Neuro-fuzzy control in ATM networks

The aynchronous transfer mode (ATM) has been deemed the transfer technique of choice in an integrated environment supporting multimedia services. The authors present an extensive review of fuzzy-logic-based and artificial-neural-network-based traffic control mechanisms that have been proposed in the field of asynchronous transfer mode networking. Following a qualitative review of the models used, system architectures suggested and results obtained, future trends and directions are briefly discussed     

Data communication in ATM networks

An increasing number of customers require LAN access with high bandwidth and low delay over long distances. To satisfy these needs, several high-speed network techniques have been developed. Asynchronous transfer mode (ATM) is superior compared to other networking technologies, as it offers high bandwidth and is scalable in the sense that the bandwidth capacity of an ATM system is not fundamentally limited to the technology itself. Initial ATM installations will operate as subnetworks of existing networks and MAC layer protocols. One of the main challenges in ATM is the transparent support of existing connectionless LAN services. Several activities have been launched within international standard bodies and forums to specify ways of providing data communication services over ATM. Most notable examples are Switched Multimegabit Data Service (SMDS) and the similar Connectionless Broadband Data Service (CBDS) supported mostly by public network service providers. But also other approaches such as IP over ATM, and LAN emulation that show more adherence to the existing local and campus area networking paradigms. The article presents the requirements and architecture of the LAN emulation service. It describes the alternative methods for carrying IP packets over ATM, a public broadband service architecture and CBDS. The traffic management aspects of the data communication services are also discussed     

IP multicasting over ATM networks

The Internet protocol (IP) multicast model involves a combination of intrasubnet and intersubnet multicast mechanisms. Technologies supporting a given subnet are expected to have native mechanisms for supporting intrasubnet forwarding of packets sent to multicast destinations. Multicast routers attach to subnets and provide intersubnet forwarding of multicast packets, using interdomain multicast routing protocols developed by the Internet Engineering Task Force (IETF). Unfortunately, ATM networks based on UNI 3.0 or UNI 3.1 signaling service do not provide the native multicast support expected by IP. This has led the IETF to develop the “MARS model”-a fairly complex mechanism for emulating intrasubnet multicast support required when running IPs over ATMs. This paper takes a high level look at the IP multicast service, examines the limitations of the ATM point-to-multipoint virtual channel service, and describes the major architectural points of the MARS model     

Applications of ATM in global networks

This article describes the market drivers, objectives, and consequences of introducing ATM into public and private networks. To serve the diverse needs of environments and applications, ATM presents a broad choice of characteristics to users and providers. To harness this diversity and bring structure to the choices, this article discusses ATM transfer capabilities (ATCs) and quality of service (QoS) classes as specified in ITU-T Study Group 13. Industry aims to achieve consistency between the ITU-T and ATM Forum specifications. This article includes consideration of AALs and interworking in developing network strategies. Providers will offer a selection of the possible services defined for ATM. Also, each provider will communicate their strategy for preferred network utilization and efficient traffic through incentives to users     

Distributed restoration in an ATM test bed network

Network resilience is a crucial area of concern for telecommunications network operators who aim to provide high availability services supported by a broadband platform based on ATM technology. This paper describes the development of an ATM test bed network which incorporates resilience by executing distributed restoration in the event of failures. Since the work originated from collaborative research between BT Laboratories and Alcatel Telecom of Belgium, the paper highlights challenges faced in developing a restorable network, both by a network operator, and a switch manufacturer.     

Neural networks for adaptive traffic control in ATM networks

Neural networks (NNs) have several valuable properties for implementing ATM traffic control. The authors present NN-based solutions for two problems arising in connection admission control, affecting the grade of service (GOS) at both the cell and call levels, and propose that neural networks may increase the network throughput and revenue     

Route optimization in mobile ATM networks

This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in mobile ATM (Asynchronous Transfer Mode) networks based on the PNNI (Private Network-to-Network Interface) standard. The route optimization algorithm uses hierarchical route information of the connection and summarized topology and loading information of the network to determine a “crossover node” such that adjusting the connection from that crossover node results in an optimally routed connection. Handoff management schemes that perform local rerouting of connections have been proposed in order to support fast handoffs. These methods result in suboptimally routed connections. In this paper, we demonstrate how this route optimization algorithm can be used to optimize the route of a connection after such a handoff is executed, as the second phase of a two-phase handoff scheme. This route optimization procedure can also be executed as part of the handoff procedure resulting in a one-phase handoff scheme. Applying this route optimization algorithm, we propose two one-phase schemes, the one-phase optimal scheme and the one-phase minimal scheme. A comparative performance analysis of one- and two-phase handoff schemes is presented. Measures of comparison are handoff latency and the amount of network resources used by a connection. Handoff latency in the one-phase optimal scheme is greater than that in the two-phase schemes, and handoff latency in the one-phase minimal scheme is smaller than that in the two-phase schemes. The one-phase methods show a significant increase in efficiency of the connection compared to the two-phase methods. This revised version was published online in June 2006 with corrections to the Cover Date.     

A transceiver circuit for ATM networks

This paper presents a transceiver digital circuit. The circuit is responsible for the emission of packets to the asynchronous transfer mode (ATM) network as well as for the manipulation of received ATM packets belonging to virtual connections. It has been designed to support data communication services. The circuit, which can be used in terminals or in interworking units and switches, implements basic functions of the lower layers of the ATM protocol reference model. The transmission functionality includes cell buffering, header error control, cell assembling, rate coupling and information insertion. The receiver realizes information extraction, rate decoupling, cell buffering, header error detection and correction, connection identity fields extraction and identification, cell disassembling and classification, and idle cell discarding functions. The circuit has been implemented on applications specific integrated circuit (ASIC) chips.     

Engineering ATM networks for congestion avoidance

With the combination of telecommunication, entertainment and computer industries, computer networking is adopting a new method called Asynchronous Transfer Mode (ATM) networking. Congestion control plays an important role in the effective and stable operation of ATM networks. Traffic management concerns with the design of a set of mechanisms which ensure that the network bandwidth, buffer and computational resources are efficiently utilized while meeting the various Quality of Service (QoS) guarantees given to sources as part of a traffic contract. In this paper, the most widely recognized congestion control schemes for ABR service are investigated. Some of these schemes show either lack of scalability or fairness while other well‐behaved schemes may require a highly complex switch algorithm that is unsuitable for implementation in cell‐switching high‐speed ATM networks. A new and improved congestion control scheme is proposed to support the best‐effort ABR traffic. This algorithm provides the congestion avoidance ability with high throughput and low delay, in addition to achieving the max–min fairness allocation. This revised version was published online in June 2006 with corrections to the Cover Date.     

Mobile multicasting in wireless ATM networks

Multicasting is a desired function in both wired and wireless networks. Currently, multicasting‐based applications have pervasive presence and influence in our Internet. Wireless ATM aims to support different traffic types over a high speed wireless network. In particular, traditional approaches towards multicasting in wired networks cannot be directly applied to mobile ATM networks. This includes the mechanism proposed to handle mobility in wired networks. In this paper, we address the issues behind multicasting in wireless ATM networks and the underlying mechanisms to support handoffs of both unicast and multicast connections. Through simulation, we evaluated the performance of optimal core‐based tree (CBT), late‐joined CBT, optimal source‐based tree (SBT), and late‐joined SBT during changing multicast host membership conditions. In addition, we evaluated the impact of multicast receivers' migration on the total link cost of the resultant multicast tree. Simulation results revealed that source‐based trees incur more total link costs under both dynamic host membership and receivers' migration scenarios. However, it generates less control messages than the distributed CBT and SBT approaches. This revised version was published online in June 2006 with corrections to the Cover Date.     

Flow enforcement algorithms for ATM networks

Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared     

Adaptive bandwidth management in ATM networks

A framework for adaptive bandwidth management in ATM based networks is proposed. It is based on a layered approach which includes bandwidth allocation to virtual networks. The central concept of this approach is adaptive estimation of the effective bandwidth required, by connections carried in the network. To achieve reliable results the estimation process takes into account both the traffic source declarations and the connection superposition process measurements on the network links. This is done in an optimization framework provided by estimation theory. A study, based on a linear two-state Kalman filter, shows that the proposed approach provides good adaptation to undeclared changes in traffic parameters and that the network performance is significantly improved when compared to the effective bandwidth allocation based solely on the source parameters declarations. These features allow more relaxed source parameter declarations and at the same time permit less stringent source policing. Thus the two bottlenecks influencing bandwidth management in ATM networks can be significantly widened.     

Polyhedral switching structures for ATM networks

The authors propose switching structures based on regular and non-regular polyhedra which ensure better QoS than the ATM switching networks known to date. The key idea of this solution is based on placing elementary switches on a sphere-shaped surface. Any set of adjacent switches forms a polygon, and the polygons in turn form a polyhedron