Home About us Contact
|
Home About us Contact | ||
|
|
||
Asynchronous Transfer Mode (asynchronous + transfer_mode)
Selected AbstractsHeuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2002Der-Rong Din Abstract In this paper, we investigate the extended cell assignment problem which optimally assigns new adding and splitting cells in Personal Communication Service (PCS) to switches in a wireless Asynchronous Transfer Mode (ATM) network. Given cells in a PCS network and switches on an ATM network (whose locations are fixed and known), we would like to do the assignment in an attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem, and finding an optimal solution to this problem is NP-hard. A heuristic algorithm and a simulated annealing algorithm are proposed to solve this problem. The heuristic algorithm, Extended Assignment Algorithm (EEA), consists of two phases, initial assigning phase and cell exchanging phase. First, in the initial assigning phase, the initial assignments of cells to switches are found. Then, these assignments are improved by performing cell exchanging phase in which two cells are repeatedly exchanged in different switches with great reduction of the total cost. The simulated annealing algorithm, ESA (enhanced simulated annealing), generates constraint-satisfied configurations, and uses three configuration perturbation schemes to change current configuration to a new one. Experimental results indicate that EAA and ESA algorithms have good performances. Copyright © 2002 John Wiley & Sons, Ltd. [source] Performance of the Dual-Banyan ATM switch under arbitrary traffic patterns,EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 4 2003Igor Radusinovic Dual-Banyan (DB) is a buffered banyan asynchronous transfer mode (ATM) switch encompassing multiple input-queueing (bifurcated queueing) as its buffering strategy. This paper describes a new analytical model for a performance evaluation of the DB switch under arbitrary traffic patterns. The model developed and presented enables the computation of the switch normalized throughput and the average packet delay by iterative calculations. The efficiency of the given model is verified through a comparison with simulation results, too. We compare throughputs of DB switch and input buffer banyan, and show that DB switch has significantly better performance levels. Copyright © 2003 AEI. [source] An adaptive path routing scheme for satellite IP networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2003Jing Chen Abstract Mobile satellites can be considered as the promising solution to the global IP network. In order to provide quality of service (QoS) in future networks, mobile satellite can be integrated with the asynchronous transfer mode (ATM) to switch IP datagrams in the space. For such a network, new and sophisticated routing and handoff algorithms are essential. In this paper, a new scheme called adaptive path routing scheme (APRS) is proposed. It is shown that the APRS can provide superior performance for routing and handoff in mobile satellite networks compared with conventional schemes. Copyright © 2003 John Wiley & Sons, Ltd. [source] Measured average cell rate-based congestion avoidance schemeINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2001Hyun M. Choi Abstract Techniques for congestion control of available bit-rate (ABR) traffic in ATM (asynchronous transfer mode) networks remain an important issue. Several congestion control schemes have been proposed to adjust the cell rates of sources with a modified or mean allowed cell rate. To make these schemes work effectively in practice, the modified or mean allowed cell rate must converge under all conditions. However, it is not easy to obtain an accurate value, and an inaccurate value could result in network performance degradation such as severe oscillations and considerable unfairness. Therefore, we propose a measured average cell rate-based congestion avoidance for ABR traffic in ATM networks. The scheme has high throughput and achieves shorter queue lengths without congestion. With measured average cell rate, the scheme provides fast convergence to a start-up virtual connection (VC) and rate of equalization from different initial conditions of the sources. Thus, this scheme provides better fairness among connections. Copyright © 2001 John Wiley & Sons, Ltd. [source] The effect of physical and link layers on IP QoSBELL LABS TECHNICAL JOURNAL, Issue 2 2003Jeffrey H. Dunn In the traditional Internet Engineering Task Force (IETF) network model, Internet protocol (IP) provided only an unreliable, best-effort delivery service. As a result, the effects of the physical and data-link layers on IP performance were ignored. In the current Internet service provider (ISP) environment, service-level agreements (SLA) require that IP-based services provide quality of service (QoS) guarantees. These guarantees (e.g., asynchronous transfer mode [ATM], connection admission control, and frame relay [FR] traffic policing) are often based on or enforced through physical and link-layer provisioning parameters. In this paper, we examine the effects of the ATM and FR physical and data-link layers and their interworking on IP performance. Specifically, we characterize the impact of ATM and FR impairments, traffic policing, and interworking on IP traffic. © 2003 Lucent Technologies Inc. [source] | ||||||||||