Capacity performance of dynamic provisioning in optical networks

This paper describes an architecture and analyzes the performance of dynamic provisioning of lightpaths in an optical network. In dynamic provisioning, a lightpath is set up in real-time without rearranging the working and protection routes of existing lightpaths, and without the knowledge of future lightpath provisioning events. This paper develops a general model of the physical topology of the optical network, and outlines routing approaches for dynamic provisioning of lightpaths. It analyzes via simulations the performance of dynamically provisioned unprotected, 1+1 protected and mesh-restored lightpaths. The analysis of the efficiency of network utilization of dynamic provisioning focuses on the spare capacity needed for protection, and in particular focuses on the impact of sharing of wavelength channels for mesh-restored lightpaths. The main conclusion from the performance studies is that significant capacity gains are achieved with sharing of wavelength-channels for mesh-restored lightpaths with dynamic provisioning even for sparse topologies, and even at moderate loads     

认知超宽带网络的容量分析

分析了认知超宽带网络的容量,考虑到传输功率限制和主系统接收端的干扰温度限制,通过半解析的方法计算出网络的中断概率和最大支持的用户数,并且通过仿真验证了对容量的分析.仿真表明如果增加主系统的干扰温度限,那么认知UWB网络的容量将极大下降,并且传输功率限制和干扰温度限制之间有一定的相关性.     

Performability analysis of common-channel signaling networks, basedon signaling system 7

Within integrated services digital networks (ISDN), all inter-change signaling messages for ISDN and intelligent network (IN) call controls are carried through a common channel signaling network (CCSN) as a backbone signaling network. Since CCSN usually have very strict reliability requirements as well as good performance objectives, performance and reliability of CCSN need to be jointly analyzed. This paper evaluates the mean end-to-end delay of a single-mated pair (SMP) CCSN for various call-arrival rates in a normal state and several failure states, as a performance index. As a performability index, this paper also analyzes the mean time to unreliable operation (MTUO) of a given network for various call-arrival rates at each signaling end point (SEP) and the failure rate of each signaling transfer point (STP). These results can be used in the design of common-channel signaling networks. This performability evaluation can be further studied for varying the failure rates of SEP and linksets, and the various threshold values of the unreliable operation     

Stochastic performance analysis of non-feedforward networks

Many Internet applications are both delay and loss sensitive, and need network performance guarantees that include bandwidth, delay/delay jitter, and packet loss rate. It is very important to quantify and exploit the capabilities of guaranteed service provisioning of communication networks. In this paper, we study the queueing behaviors of non-feedforward networks (a non-feedforward network is a network in which at least one set of acyclic traffic routes forms a cycle; a feedforward network is a network in which any set of acyclic traffic routes does not form a cycle) with FIFO scheduling discipline and Regulated, Markov On-Off, and Fractional Brownian traffic sources. We develop a new methodology to analyze the probabilistic bounds on the delays experienced by traffic. By leveraging the large deviations and fixed-point techniques, we turn probability problems into deterministic optimization problems and translate a probabilistic delay bound into a fixed point of a non-linear real function. Our contribution in this paper is the derivation of a probabilistic bound on the delays experienced by traffic in non-feedforward networks, based on an assumption, i.e., the tail probability of the difference between the beginning time of a busy interval of a server and the earliest arriving time at the corresponding network ingress of the traffic arrivals that arrive at this server during this busy interval can be bounded by the maximum of the violation probabilities of the accumulative upper stream delay bound suffered by this server‘s traffic arrivals. Consequently, our new results not only consummate the theory of stochastic analysis of network performance, but also facilitate the design of protocols and algorithms for non-feedforward networks to provide performance guarantees to various applications with diverse performance requirements.     

Composite performance and availability analysis of wirelesscommunication networks

With the increasing popularity of wireless communication systems, customers are expecting the same level of service, availability, and performance from the wireless communication networks as the traditional wire-line networks. The traditional pure performance model that ignores failure and recovery but considers resource contention generally overestimates the system's ability to perform a certain job. On the other hand, pure availability analysis tends to be too conservative since performance considerations are not taken into account. To obtain realistic composite performance and availability measures, one should consider performance changes that are associated with failure recovery behavior. A review is first given over the advances in composite performance and availability analysis. Thereafter, three techniques for composite performance and availability analysis are discussed in detail through a queueing system in a wireless communication network. Numerical results show that an approximate model based on a framework originally proposed by Bobbie and Trivedi (1990) provides remarkably accurate predictions on system performance     

Stability and performance analysis of networks supporting elasticservices

We consider the stability and performance of a model for networks supporting services that adapt their transmission to the available bandwidth. Not unlike real networks, in our model, connection arrivals are stochastic, each has a random amount of data to send, and the number of ongoing connections in the system changes over time. Consequently, the bandwidth allocated to, or throughput achieved by, a given connection may change during its lifetime as feedback control mechanisms react to network loads. Ideally, if there were a fixed number of ongoing connections, such feedback mechanisms would reach an equilibrium bandwidth allocation typically characterized in terms of its “fairness” to users, e.g., max-min or proportionally fair. We prove the stability of such networks when the offered load on each link does not exceed its capacity. We use simulation to investigate performance, in terms of average connection delays, for various fairness criteria. Finally, we pose an architectural problem in TCP/IPs decoupling of the transport and network layer from the point of view of guaranteeing connection-level stability, which we claim may explain congestion phenomena on the Internet     

Capacity analysis of MIMO MRC systems in correlated rayleigh fading environments

In this paper, we analyze the capacity of multiple-input multiple-output systems employing maximal ratio combining under Rayleigh fading environments in the presence of spatial fading correlation at the transmitter or receiver. Based on statistical properties of the largest eigenvalue of correlated complex Wishart matrices, the exact closed-form expressions for the cumulative distribution function and the probability density function of the output signal-to-noise ratio are presented. The results are used to analyze the outage and ergodic capacities of the systems. The analysis shows that ergodic capacity improves with the increase of the channel correlation coefficient and the analytical results are validated by Monte Carlo simulations.     

基于RSVP-TE信令的GMPLS动态性能研究

主要介绍通用多协议标签交换信令性能及测试的相关工作.指出目前急需对多协议标签交换动态性能进行描述,并提出了一组多协议标签交换动态性能参数以期能对网络运营商、设备制造商和应用程序设计者有一定的帮助.最后给出了在现有多协议标签交换光网络平台上的测试结果并对其进行了分析,并讨论了进一步的研究方向.     

Multiuser detection for cooperative networks and performance analysis

We investigate strategies for user cooperation in the uplink of a synchronous direct-sequence code-division multiple-access (DS/CDMA) network employing nonorthogonal spreading codes and analyze their performance. We consider two repetition-based relay schemes: decode-and-forward (DAF) and amplify-and-forward (AAF). Focusing on the use of linear multiuser detectors, we first present cooperation strategies, i.e., signal processing at both the relay nodes and the base station (BS), under the assumption of perfectly known channel conditions of all links; then, we consider the more practical scenario where relays and BS have only partial information about the system parameters, which requires blind multiuser detection methods. We provide performance analysis of the proposed detection strategies in terms of the (asymptotic) signal-to-(interference plus noise) ratio and the bit error rate, and we show that AAF achieves a full second-order diversity when a minimum mean-square-error detector is employed at both the relay side and the BS. A simple, yet effective, partner selection algorithm is also presented. Finally, a thorough performance assessment is undertaken to study the impact of the multiple-access interference on the proposed cooperative strategies under different scenarios and system assumptions.     

Modeling and performance analysis of multihop packet radio networks

The design of packet radio networks involves a large number of issues which interact in a very complex fashion. Many of these pertain to the RF channel and its use, others pertain to the operational protocols. Clearly, no single model can be formulated which incorporates all the necessary parameters and leads to the optimum solution. The one essential element which complicates matters is that, contrary to point-to-point networks in which each channel is utilized by a single pair of nodes, the radio channel in packet radio networks is a multiaccess broadcast resource: i) in a given locality determined by radio connectivity, the channel is shared by many contending users, hence the need for channel access protocols; ii) radio is a broadcast medium and thus the action taken by a node has an effect on the actions taken by neighboring nodes and their outcome. Despite the complexity of the problem, there has been significant progress worth reporting on. The work accomplished so far has been either the analysis of specific examples of networks or an attempt to create models that would be useful in the design of general networks. The purpose of this paper is to survey the various modeling techniques that have been used for the performance analysis of packet radio networks, and to discuss the assumptions underlying these models, their scope of applicability, and some of the results obtained.     

基于P-NOMA的上行水声通信网络容量分析

在通信距离不尽相同节点的最优适用频段可能会部分重叠的背景下,针对水声系统频率资源利用率低的问题,提出了一种基于部分非正交多址接入(Partial Non-orthogonal Multiple Access, P-NOMA)技术的上行链路水声通信方法。该方法中各P-NOMA节点在非重叠频段内采用正交多址接入技术传输信息,在重叠频段内利用最大或受限的发送功率同时同频发送信息给目的节点,目的节点采用串行干扰消除方法提取重叠频段内的各P-NOMA节点信息。根据功率谱密度与容量之间的关系,分析了P-NOMA节点在注水算法和功率均匀分布下的可达容量,以及信干噪比限制对最小发射功率的影响。仿真结果验证了基于P-NOMA技术的水声上行通信网络在系统容量方面具有的优势。     

Service-creation environments for intelligent networks

Service-creation environments (SCEs) for intelligent networks, the next frontier in telecommunications, are discussed. It is stated that as SCEs become part of network structures, the use of real-time software validation to supplement or eventually supersede regression testing must be implemented. Three elements in the Exploratory Intelligent Network project that may satisfy these requirements are discussed: finite-state tests, call-model standards, and fast real-time processors     

Comprehensive performance modeling and analysis of multicasting in optical networks

Multicasting is becoming increasingly important in today's networks. In optical networks, optical splitters facilitate the multicasting of optical signals. By eliminating the transmission of redundant traffic over certain links, multicasting can improve network performance. However, in a wavelength-division multiplexed (WDM) optical network, the lack of wavelength conversion necessitates the establishment of a single multicast circuit (light-tree) on a single wavelength. On the other hand, establishing several unicast connections (lightpaths) to satisfy a multicast request, while requiring more capacity, is less constrained in terms of wavelength assignment. The objective of the paper is to evaluate the tradeoff between capacity and wavelength continuity in the context of optical multicasting. To this end, we develop accurate analytical models with moderate complexity for computing the blocking probability of multicast requests realized using light-trees, lightpaths, and combinations of light-trees and lightpaths. Numerical results indicate that a suitable combination of light-trees and lightpaths performs best when no wavelength conversion is present.     

Capacity analysis of based-regular-topologies cognitive wireless mesh networks with power control

Capacity analysis is a fundamental and essential work for evaluating the performance of cognitive wireless mesh network （CWMN） which is considered a promising option for the future network. Power control is an efficient way to avoid interference and improve capacity of wireless mesh networks. In this paper, a quantitative result of the per-node average throughput capacity of CWMN with power control is deduced for the first time, which is much helpful for understanding the limitations of CWMN. Firstly, under the large-scale channel fading model and protocol interference model, a closed-form expression for the maximum channel capacity of each node with power control is presented, under the constraint that the interference tolerated by the primary users （PUs） does not exceed a threshold. And then, with the deduced channel capacity result, the per-node average throughput capacity of CWMN is derived based on two regular topologies, i.e. square topology and triangle topology. The simulation results indicate that the capacity is effectively improved with power control, and affected by topology, tolerated interference threshold, the number of cognitive users （CUs） and primary users （PUs）.     

Capacity analysis of reservation-based random access for broadband wireless access networks

In this paper we propose a novel model for the capacity analysis on the reservation-based random multiple access system, which can be applied to the medium access control protocol of the emerging WiMAX technology. In such a wireless broadband access system, in order to support QoS, the channel time is divided into consecutive frames, where each frame consists of some consequent mini-slots for the transmission of requests, used for the bandwidth reservation, and consequent slots for the actual data packet transmission. Three main outcomes are obtained: first, the upper and lower bounds of the capacity are derived for the considered system. Second, we found through the mathematical analysis that the transmission rate of reservationbased multiple access protocol is maximized, when the ratio between the number of mini-slots and that of the slots per frame is equal to the reciprocal of the random multiple access algorithm?s transmission rate. Third, in the case of WiMAX networks with a large number of subscribers, our analysis takes into account both the capacity and the mean packet delay criteria and suggests to keep such a ratio constant and independent of application-level data traffic arrival rate.     

Multi-parameter performance analysis for decentralized cognitive radio networks

In this paper, we investigate the impact of primary user activity, secondary user activity, interface switching, channel fading and finite-length queuing on the performance of decentralized cognitive radio networks. The individual processes of these service-disruptive effects are modeled as Markov chains based on cross-layer information locally available at the network nodes. A queuing analysis is conducted and various performance measures are derived regarding the packet loss, throughput, spectral efficiency, and packet delay distribution. Numerical results demonstrate the impact of various system parameters on the system performance, providing insights for cross-layer design and autonomous decision making in decentralized cognitive radio networks.     

Fourier-Bessel error performance analysis of 1024-QAM in errorburst generating environments

A closed form performance evaluation of 1024-QAM in error burst generating channels is demonstrated. The noise model employed (which closely models atmospheric and ignition noise) consists of the additive mixture noise and a stream of Poisson impulses with amplitude areas distributed according to a bilateral Rayleigh PDF. The results show that nonGaussian impulsive noise degrades the system performance significantly in comparison with the system performance in cochannel interference and demonstrate that the used Fourier-Bessel series approach is a powerful and very accurate computational tool     

Capacity of two-layered satellite networks

Wireless Networks - Satellite networks have great potential in providing global ubiquitous broadband communication. In this paper, we explore the capacity of both single-layered and two-layered...     

Capacity of wireless erasure networks

In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.     

Capacity estimation and TCP performance enhancement over mobile WiMAX networks - [WiMAX update]

The mobile WiMAX system is based on IEEE 802.16e, which defines radio interface supporting several classes of Internet Protocol applications and services. While the mobile WiMAX system is being deployed, IEEE 802.16m TG is developing an amendment to the IEEE 802.16e to greatly improve the system performance, and it is focusing not only on the PHY and MAC performance but also on a level of end-to-end performance improvement that includes the scope of the network and application to embrace the strong market request and interest. To evaluate the mobile WiMAX system capacity and performance, all the aspects of performance evaluation ? from air link to application ? are required. For the network and application-level capacity and performance analysis, we first provide an overview of mobile WiMAX systems, especially of the OFDMA/TDD systems of IEEE 802.16e and then describe subscriber and application profiles that include traffic-mix ratio, data-session attempts for applications, diurnal-application traffic distribution, and the application-traffic model. Afterward, the simulation results of network- traffic characteristics and demand estimation are provided. Finally, in the last section, we provide simulation results of end-to-end application performance evaluation using the examples of VoIP and a TCP/IP performance-enhancement method that can be implemented in the mobile WiMAX MAC or MAC/IP cross layer.