Performance of an in-call buffer-window reservation/allocationscheme for long file transfers

The authors evaluate the performance of both the fixed buffer allocation (FBA) and the adaptive buffer allocation (ABA) schemes, in which the network nodes are allowed to offer less than the requested buffer size. The performance measures of interest are the blocking probability, file transfer delay, and the adaptation speed for ABA for a given buffer size and the offered load. The authors develop and analyze a quasi-birth-death model of the ABA scheme (with exponential file lengths and negligible delay in carrying out reservation and cancellation procedures). In particular, they develop a recursive computational scheme exploiting the structure of the underlying model. This is supplemented by a first-passage time analysis to evaluate the transient behavior of the control strategy. The authors use both analytic and simulation methods. The results demonstrate that the ABA schemes provide significant advantages over the FBA scheme if the parameters are appropriately chosen. They also provide guidelines on the choice of these parameters     

A dynamic transmission capacity allocation scheme for wired/wireless ATM networks

The previous research on administration of the transmission capacity in the wired/ wireless ATM networks only focuses on wired part or wireless part. There are very few people do the work extending to the links associating with handoff in the whole network. This paper develops the algorithms of transmission capacity administration on the link connecting the base station and base station controller (including the air interface of the base station) and the VPs among the base station controllers in the wired/ wireless ATM networks, which adapt to the traffic state of each service in every cellular cell to allocate (provision) transmission capacity and to reserve handoff guard capacity on these links, respectively. By simulating and analyzing the performance of the algorithm, it is found that it does well for the multimedia communication in which the transmission capacity requirement of each service may be widely different, so that the network bandwidth resource can be used efficiently.     

Radio resource allocation for interference management in mobile broadband OFDMA based networks

This paper focuses on the inter‐cell interference (ICI) management problem in the downlink channel for mobile broadband wireless OFDMA‐based systems. This subject is addressed from the standpoint of different interrelated resource allocation mechanisms operating in multi‐cell scenarios in order to exploit frequency and multi‐user diversity: ICI coordination/avoidance and adaptive subcarrier and power allocation. Even though these methods can be applied in a stand‐alone way, a significant performance improvement is achieved if they are jointly designed and operate in a combined basis. Several alternatives for mixed frequency and power ICI coordination schemes are proposed in this paper. Connected with a proper power mask‐based design, the potential gain of a flexible frequency sectorization solution, halfway between fractional/soft frequency reuse and pure frequency sectorization, is explored. The main objective is to outperform fractional/soft frequency reuse offering an attractive trade‐off between cell‐edge user data rates and average cell throughput. Proposals concerning ICI coordination/avoidance have been evaluated in combination with several heuristic adaptive subcarrier and power allocation algorithms. Copyright © 2009 John Wiley & Sons, Ltd.     

Performance trade-offs in input/output buffer design for a non-blocking space-division packet switch

Performance trade-offs in buffer architecture design for a space-division packet switching system is studied. As described in Figure 1, the system is constructed by a non-blocking switch fabric and input/output buffers. The capacity of the non-blocking switch fabric is defined by the maximum number of packets, denoted by m, which can be simultaneously routed from multiple inputs to each output. The buffer size at each input is considered to be finite, equal to K. The emphasis here is placed on the input packet loss probability for systems constructed by different ms and Ks. From the performance point of view, we conclude:

• (a) choosing m = 3 or 4 is sufficient to exploit the maximum utilization of a non-blocking switch fabric
• (b) introducing input buffers of moderate size K significantly reduces the packet loss probability.

     

TCP/IPoverATM的性能研究

 本文讨论将传统的TCP拥塞控制机制和CIPOA用于采用ER(FB)算法和EFCI(CCR)算法的ATM网络时可用比特率业务(ABR)和未确定比特率业务(UBR)的性能.仿真结果表明,无论在缓冲区的需求、带宽分配的公平性、吞吐量和链路利用率方面ABR业务的TCP性能均明显优于UBR业务.对于较简单的网络模型ER(FB)算法的TCP性能优于EFCI(CCR)算法,更优于传统的EFCI算法.     

TCP/IP与ATM的互联及网关功能的实现

人们在工作、学习和生活中提出了更多的通信业务,如高清晰度电视、电视会议、可视电话、点播电视等。对这些多功能化的需求,现今的任何网(包括电话网、用户电报网、公用分组交换数据网、电路交换数据网、数字数据网、LAN、WAN、MAN、ISDN、CATV等)都无法完成。因此,无论从用户角度还是从网络经营者的角度,都希望建立一个单一的网络。这个网络便是B-ISDN(宽带综合业务数字网)。文中主要讨论TCP/IP与ATM的互联,以及网关如何实现TCP/IP与ATM(异步传输模式)之间的协议转换。简单介绍了ATM的概念及分层模型,给出了IP与ATM结合的多种解决方式。     

Performance analysis of channel de-allocation schemes for dynamic resource allocation in GSM/GPRS networks

Channel de-allocation for GSM voice call (DASV) has been considered for dynamic resource allocation in GSM/GPRS networks. Two new de-allocation schemes are proposed: de-allocation for GPRS packet (DASP) and de-allocation for both GSM voice call and GPRS packet (DASVP). An analytic model with general GPRS data channel requirement is derived to evaluate the performance of the schemes in terms of GSM voice call incompletion probability, GPRS packet dropping probability, average GPRS packet transmission time and channel utilisation.     

Buffer management and scheduling schemes for TCP/IP over ATM‐GFR

Today ATM technology is facing challenges from integrated service IP, IP switching, gigabit IP router and gigabit ethernet. Although ATM is approved by ITU‐T as the standard technology in B‐ISDN, its survivability is still in question. Since ATM‐UBR (unspecified bit rate) provides no service guarantee and ATM‐ABR (available bit rate) is still unattainable for most users, many existing users have little or no incentives to migrate to ATM technology. The guaranteed frame rate (GFR) service is introduced to deal with this dilemma. The GFR can guarantee the minimum cell rate (MCR) with fair access to excess bandwidth. This paper studies various schemes to support the GFR. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP traffic is carried. Through simulations, it is shown that only per‐VC queueing with weighted round robin (WRR) can guarantee minimum cell rate. Among all the schemes that have been explored, we recommend dynamic threshold–early packet discard (DT–EPD) integrated with MCR+ (a WRR variant) to support the GFR service. Copyright © 2001 John Wiley & Sons, Ltd.     

Performance analysis of A dynamic channel allocation technique for satellite mobile cellular networks

This paper deals with an efficient dynamic channel allocation (DCA) technique suitable for applications in mobile satellite cellular networks. A cost function is defined to allow an optimum selection of channels to be allocated on demand. A mobility model suitable for low earth orbit (LEO) satellite systems is presented. The performance of the novel DCA technique in terms of call blocking probability has been derived by simulations. The obtained results are compared with those achieved by a fixed channel allocation (FCA) technique to show a better behaviour.     

Performance of joint multilevel/AES‐LDPCC‐CPFSK schemes over wireless sensor networks

In wireless sensor networks, data encryption and channel coding are considered together for ensuring secure and robust communication. In order to achieve this purpose, we introduce a new joint scheme, namely ‘Multilevel/Advanced Encryption Standard‐Low Density Parity Check Coded‐Continuous Phase Frequency Shift Keying (ML/AES‐LDPCC‐CPFSK)’. AES algorithm is the most powerful and widely used symmetric key cryptography in providing secure data transmission. LDPC codes have very large Euclidean distance and use iterative decoding algorithms. In this study, we have increased error performance employing multilevel structure to AES and LDPC. In all communications systems, phase discontinuities of modulated signals result in extra bandwidth requirements. CPFSK, which is a special type of continuous phase modulation, is a powerful solution for this problem. In this paper, we simulate error performance of ML/AES‐LDPCC‐CPFSK for regular LDPC codes. Simulation results are drawn for 4CPFSK, 8CPFSK and 16CPFSK over wireless cooperative sensor networks. Using this scheme, we are able to improve bit error performance, channel throughput, security level of communication and reduction in complexity compared with related schemes such as various turbo code structures. Copyright © 2009 John Wiley & Sons, Ltd.     

Performance evaluation of CSMA/ID MAC protocol for IP over WDM ring networks

In this paper, a packet pre‐classification media access control protocol based on a carrier sense multiple access with idle detection (CSMA/ID) scheme is investigated for supporting IP packets over all‐optical WDM ring networks. The purpose of the protocol is to increase throughput and to decrease the packet transmission delay of IP packets over optical networks in a metropolitan area network. This protocol avoids both packet collision and packet fragmentation. In order to improve the utilization of the network, the packets transmitted from a local area network are first pre‐classified into various class queues of an access point (AP) according to their length. After checking the available space based on the wavelength received by the receivers of the AP, the packets in the queues are transmitted. An analytical model is developed to evaluate the performance of the protocol, with simulation results showing good network efficiency. The proposed network has short‐term variations that introduce unfairness conditions. This problem could be overcome by assigning a quota on individual queues to allow all queues fair access. Copyright © 2008 John Wiley & Sons, Ltd.     

Performance analysis of a channel allocation scheme for multi‐service mobile cellular networks

This paper presents a new channel allocation scheme, namely the dynamic partition with pre‐emptive priority (DPPP) scheme, for multi‐service mobile cellular networks. The system is modelled by a two‐dimensional Markov process and analysed by the matrix‐analytic method. A pre‐emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real‐time (RT) traffic at the expense of some degradation of non‐real‐time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi‐service environments. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance evaluation of a buffer-based CSMA/CD protocol for single channel optical Ethernet LAN

Using CSMA/CD, Ethernet suffers capture effect that makes it unsuitable for supporting real-time multimedia traffic. It does not guarantee delay bound and behaves poorly under heavy load conditions, leading to excessive delay, throughput degradation and packet loss because of excessive collisions. Aim of this paper is to increase throughput and reduce average packet transfer delay of CSMA/CD-based LAN by reducing collisions and eliminating packet loss. Here, each user has a finite buffer capacity that helps to reduce collisions and Ethernet capture effect. At the same time, to eliminate packet loss, a new special-jamming signal is used. The network performance in terms of throughput, average packet transfer delay and percentage of collision based on the proposed protocol shows significant improvements. Throughput is increased more than 10% whereas average packet transfer delay and percentage of collision are reduced to less than 1.5 ms and 3%, respectively, compared to conventional protocol.     

Performance analysis of congestion avoidance algorithms with non‐zero MCR guarantee for ABR service in ATM networks

This paper proposes a novel explicit rate allocation algorithm called Fast Rate Allocation Congestion Avoidance (FRACA) algorithm supporting non‐zero minimum cell rate (MCR). The non‐zero MCR guarantee strategy for ABR service in ATM networks focused in this paper is MCR plus equal share (The ATM Forum Traffic Management Specification, version 4.0. April 1996). The main goals for designing the algorithm are the fast convergence according to the max–min fairness criteria, fairness among all sessions, maximum network utilization while the switch queue length is properly controlled. At the same time, it should work well under a wide range of network conditions without the need for adjusting the algorithm parameters. The performance of the proposed algorithm is evaluated and compared with the Generic Weighted Fairness (GWF) ERICA + (J Comput Comm 2000; 149). Simulation results show that the proposed algorithm achieves the design goals in the evaluated scenarios. Copyright © 2004 John Wiley & Sons, Ltd.     

短波FH/DQPSK系统中分组turbo码的性能分析

本文基于短波跳频（FH）系统的特点，对短波FH/DQPSK系统中分组trubo码的性能进行了分析，并给出了平均误码上限的数学表达式。数值模拟的结果表明，采用分组turbo码编码的FH/DQPSK系统，在短波慢瑞利衰落的信道下，当译码迭代数为4次，SNR=6.8dB时，可使系统的误码率降到10^-5左右。     

A temperature window for the synthesis of single-walled carbon nanotubes by catalytic chemical vapor deposition of CH4 over Mo-Fe/MgO catalyst

A temperature window of single-walled carbon nanotubes （SWCNTs） growth has been studied by Raman spectroscopy. The results presented when temperature lower than 750℃, there were few SWCNTs formed, and when temperature higher than 900℃, mass amorphous carbons were formed in the SWCNTs bundles due to the self-decomposition of CH4. The temperature window of SWCNTs efficiently growth is between 800 and 900℃, and the optimum growth temperature is about 850℃. These results were supported by transmission electron microscope images of samples formed under different temperature. The temperature window is important for large-scale production of SWCNTs by catalytic chemical vapor deposition method.     

Performance modeling of FEC‐based unequal error protection for H.264/AVC video streaming over burst‐loss channels

Unequal error protection systems are a popular technique for video streaming. Forward error correction (FEC) is one of error control techniques to improve the quality of video streaming over lossy channels. Moreover, frame‐level FEC techniques have been proposed for video streaming because of different priority video frames within the transmission rate constraint on a Bernoulli channel. However, various communication and storage systems are likely corrupted by bursts of noise in the current wireless behavior. If the burst losses go beyond the protection capacity of FEC, the efficacy of FEC can be degraded. Therefore, our proposed model allows an assessment of the perceived quality of H.264/AVC video streaming over bursty channels, and is validated by simulation experiments on the NS‐2 network simulator at a given estimate of the packet loss ratio and average burst length. The results suggest a useful reference in designing the FEC scheme for video applications, and as the video coding and channel parameters are given, the proposed model can provide a more accurate evaluation tool for video streaming over bursty channels and help to evaluate the impact of FEC performance on different burst‐loss parameters. Copyright © 2014 John Wiley & Sons, Ltd.