Multiuser subcarriers and bit allocation combining adaptive mapping for SC-FDMA system

In this article, a multiuser single carrier frequency division multiple access （SC-FDMA） system is considered, based on which an adaptive subcarrier and bit allocation algorithm is investigated. The algorithm has been used to achieve a subcarrier mapping mode in this system, which combines the advantages of single- and multi-carrier transmissions, such as, low peak to average power ratio, orthogonality of signals of different users, and low complexity. Simulation results show that it has a similar performance as that of the adaptive allocation algorithm in the orthogonal frequency division multiple （OFDM） system and the proposed mapping mode has a performance gain over the two existing mapping modes at the link level.     

A 400 MHz Low Noise Amplifier at Cryogenic Temperature for Superconductor Filter System

A cryogenic low noise amplifier （LNA） using Agilent high electron mobility transistor （HEMT） for 380 MHzto 480 MHz is designed and fabricated, and the excellent cryogenic performance in superconducting receiver front-end for communication system is achieved. A special input impedance matching topology is implemented to provide low noise figure （NF） and good input matching in this cryogenic LNA design. The measurement results show that the NF is within 0.25 dB from the minimum NF of a single transistor, the power gain is above 20 dB, the flatness is within 1 dB, and the maximum input return loss is lower than -20 dB in bandwidth.     

Design and nonlinearity compensation of Fabry-Perot type tunable optical filters for dynamic strain sensing systems

The collected spectrum of the fiber Bragg grating （FBG） and the loss of the detected optical power are discussed with respect to the 3-dB bandwidth of a Fabry-Perot （F-P） type tunable optical filter （TOF）, respectively. And the optimized parameters of the TOF are obtained consequently. It is demonstrated that the relationship between the transmission wave- length of the TOF and its drive voltage is nonlinear. A new method to compensate the nonlinearity of the TOF is proposed. The linear sweeping of the transmission wavelength of the TOF is achieved through modifying the drive voltage using interpolation algorithm. It is observed that the average error and the maximum error of the transmission wavelength are reduced sharply under linear fit. The dynamic strain sensing is realized by use of a reference FBG and moving averaging algorithm in this system.     

THE INNER-SYSTEM LABELING ALGORITHM AND ITS FAIRNESS ANALYSIS

On the basis of inner-system labeling signaling used in the integrated access system, a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services （COS）, and each packet entering the relative independent area （an autonomous system） would be labeled according to the service type or Quality of Service （QoS） in demand, and be scheduled and managed within the system （the system can be enlarged if conforming to the same protocol）. The experimental results show that each of the stream rate in the integrated-services would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.     

Cross-Layer Design and Ant-Colony Optimization Based Routing Algorithm for Low Earth Orbit Satellite Networks

To improve the robustness of the Low Earth Orbit （LEO） satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks （CAL-LSN） is proposed in this paper. In CAL- LSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CAL- LSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation res- ults show that CAL-LSN performs well in bal- ancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the re- quirement of video transmission.     

A Virtual Network Mapping Algorithm Based on Time

As one of the challenges for network virtu- alization, virtual network embedding which maps Virtual network （VN） to the substrate network and allocates re- sources according to the requirements of VN in an efficient way has gained great attention. Existing algorithms gener- ally make their decision according to the present available substrate network resource, especially bandwidth. This paper proposes a time-based VN embedding algorithm. A probability model is formulated to obtain the maximum probability that the available resources of substrate net- work can be used by succeeding VN requests. The prob- ability is set as the weight of the node and the greedy algorithm is employed to embed the virtual node. The reciprocal of the probability is set as the weight of the link and the shortest path algorithm is employed to em- bed the virtual link. Simulation experiments show that the proposed algorithm increases the acceptance rate and the revenue compared to the existing algorithms.     

Buffer-aware resource scheduling scheme for LTE-A uplink relay-assisted network

Due to the constraint of single carrier frequency division multiple access （SC-FDMA） adopted in long term evolution （LTE） uplink, subcarriers allocated to single user equipment （UE） must be contiguous. This contiguous allocation constraint limits resource allocation flexibility and makes the resource scheduling problem more complex. Most of the existing work cannot well meet UE＇s quality of service （QoS） requirement, because they just try to improve system performance mainly based on channel condition or buffer size. This paper proposes a novel resource scheduling scheme considering channel condition, buffer size and packet delay when allocating frequency resource. Firstly, optimization function is formulated, which aims to minimize sum of weight for bits still left in UE buffer after each scheduling slot. QoS is the main concern factor here. Then, to get packet delay information, this paper proposes a delay estimation algorithm. Relay node （RN） is introduced to improve overall channel condition. Specific RN selection strategy is also depicted in the scheme. Most important of all, a creative negotiation mechanism is included in the subcarrier allocation process. It can improve the overall system throughput performance in guarantee of user＇s QoS requirement. Simulation results demonstrate that the scheme can greatly enhance system performance like delay, throughput and jitter.     

Robust Design of Virtual Topology for WDM Networks under Bandwidth Demand Uncertainties

In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing （WDM） networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defined as minimizing the maximum value amongp percentiles of the bandwidth demand distribution on all Hght-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm （ID-MLTDA） that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks.     

Design and nonlinearity compensation of Fabry-Perot type tunable optical filters for dynamic strain sensing systems

The collected spectrum of the fiber Bragg grating(FBG) and the loss of the detected optical power are discussed with respect to the 3-dB bandwidth of a Fabry-Perot(F-P) type tunable optical filter(TOF),respectively.And the optimized parameters of the TOF are obtained consequently.It is demonstrated that the relationship between the transmission wave-length of the TOF and its drive voltage is nonlinear.A new method to compensate the nonlinearity of the TOF is proposed.The linear sweeping of the transmission wavelength of the TOF is achieved through modifying the drive voltage using interpolation algorithm.It is observed that the average error and the maximum error of the transmission wavelength are reduced sharply under linear fit.The dynamic strain sensing is realized by use of a reference FBG and moving averaging algorithm in this system.     

AN ADAPTIVE FEC SCHEME FOR Ka-BAND SATELLITE COMMUNICATIONS

Rain attenuation is the major problem for Ka-band satellite communications, and the fading due to rain can be well described by a lognormally distributed, first-order autoregressive model. Forward Error-control Coding (FEC) techniques can be used to reduce the effect of the rain attenuation, but the use of FEC causes a reduction in the bandwidth efficiency. In order to increase the bandwidth efficiency as well as maintain high link availability, an Adaptive Forward Error-control Coding (AFEC) scheme with rain fading prediction is proposed and analyzed in this paper. The results show that AFEC offers a good trade-off between link availability and bandwidth efficiency.     

统计优先级多址接入协议的改进与仿真

统计优先级的多址接入（Statistical Priority-based Multiple Access,SPMA）协议的优良性能符合未来数据链的发展趋势。经典的SPMA协议中存在固定门限设置导致的吞吐量下降、退避时间设置过于简单和低优先级分组“饥饿”等三个问题。针对这些问题,提出了统计差值退避算法和虚拟时间戳排队算法。统计差值退避算法使用负载统计量和优先级门限的差值,计算出合理的分组退避时间。虚拟时间戳排队算法根据接入带宽的最低要求,按照虚拟完成时间大小进行分组接入。结合这两个算法,设计了基于SPMA的介质访问控制层改进协议,并使用OPNET软件对改进协议进行了仿真。仿真结果表明,相比于SPMA协议的传统算法,改进协议的系统吞吐量更大且更稳定,优先级平均时延更低,同时保证了低优先级业务的最小带宽接入需求。     

Unicast-based inference of network link delay distributions with finite mixture models

Providers of high quality-of-service over telecommunication networks require accurate methods for remote measurement of link-level performance. Recent research in network tomography has demonstrated that it is possible to estimate internal link characteristics, e.g., link delays and packet losses, using unicast probing schemes in which probes are exchanged between several pairs of sites in the network. We present a new method for estimation of internal link delay distributions using the end-to-end packet pair delay statistics gathered by back-to-back packet-pair unicast probes. Our method is based on a variant of the penalized maximum likelihood expectation-maximization (PML-EM) algorithm applied to an additive finite mixture model for the link delay probability density functions. The mixture model incorporates a combination of discrete and continuous components, and we use a minimum message length (MML) penalty for selection of model order. We present results of Matlab and ns-2 simulations to illustrate the promise of our network tomography algorithm for light cross-traffic scenarios.     

一种适用于宽带无线IP网络的分组调度算法

自适应调制技术在许多新型的无线分组网络如WCDMA HSDPA、HiperLAN/2中得到广泛采用.本文在充分考虑自适应调制系统链路带宽随时隙呈不平均分布特点的基础上,提出一种全新的调度算法,自适应区分补偿公平队列(ADCFQ).该算法采用了基于工作量的分析方法,设计了不同功能的多个子队列,可以为系统所有待发流提供基本的QoS保证,为各个流公平共享剩余带宽,并能够通过合理的补偿机制克服无线环境中突发错误影响.分析和仿真结果表明,这一算法可以满足目标要求.此外,仿真中,针对自适应链路的特点,本文还提出了一种基于多状态Markov链的信道建模方法.     

A joint-ONU interval-based dynamic scheduling algorithm for Ethernet passive optical networks

This paper proposes a new dynamic bandwidth allocation system for Ethernet Passive Optical Networks (EPONs), subject to requirements of fairness, efficiency, and cost. An Optical Line Terminal (OLT)-centric bandwidth allocation model is proposed which employs a credit pooling technique combined with a weighted-share policy to partition the upstream bandwidth among different classes of service, and to prevent Optical Network Units (ONUs) from monopolizing the bandwidth. The OLT-centric model allows global optimization of network resources, a characteristic which is not found in many earlier proposals. Supported by the new bandwidth allocation, the paper proposes a joint-ONU interval-based packet scheduling algorithm, referred to herein as COPS (Class-of-service Oriented Packet Scheduling), that meets the requirements set out above. We compare COPS with another well-known scheduling algorithm which employed a standard priority-based bandwidth sharing. We show that COPS is superior in terms of network utilization and maximum packet delay, with the consequence of an increase in average packet delay for the premium traffic. This drawback is overcome by combining COPS with a rate-based optimization scheme.     

支持QoS的多链路最少变换动态带宽分配算法

提出一种支持QoS的多链路最少变换动态带宽分配方法（MCDBA）,该方法实现了支持不同的QoS等级,量化了带宽分配的大小,在满足一定QoS限制的条件下最小化带宽分配变换次数。仿真结果验证了MCDBA能有效地减少数据分组的时延和提高系统的带宽利用率,MCDBA可用于解决大规模网络链路接入的复杂QoS控制的实际问题。     

A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks

Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in multihop wireless networks. Besides minimum throughput and delay bounds for each flow, our scheduling disciplines seek to achieve fair and maximum allocation of the shared wireless channel bandwidth. However, these two criteria can potentially be in conflict in a generic-topology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new scheduling model that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum fair allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA/CA protocol.     

Evaluation and characterization of available bandwidth probing techniques

The packet pair mechanism has been shown to be a reliable method to measure the bottleneck link capacity on a network path, but its use for measuring available bandwidth is more challenging. In this paper, we use modeling, measurements, and simulations to better characterize the interaction between probing packets and the competing network traffic. We first construct a simple model to understand how competing traffic changes the probing packet gap for a single-hop network. The gap model shows that the initial probing gap is a critical parameter when using packet pairs to estimate available bandwidth. Based on this insight, we present two available bandwidth measurement techniques, the initial gap increasing (IGI) method and the packet transmission rate (PTR) method. We use extensive Internet measurements to show that these techniques estimate available bandwidth faster than existing techniques such as Pathload, with comparable accuracy. Finally, using both Internet measurements and ns simulations, we explore how the measurement accuracy of active probing is affected by factors such as the probing packet size, the length of probing packet train, and the competing traffic on links other than the tight link.     

Multiple link failure recovery in survivable optical networks

Survivability is of critical importance in high-speed optical communication networks. A typical approach to the design of survivable networks is through a protection scheme that pre-determines and reserves backup bandwidth considering single/double link failure scenarios. In this article, a greedy algorithm is presented to reserve backup bandwidth considering multiple (F > 2) link (SRLG) failure scenarios. A bandwidth-saving joint selection scheme of working and protection paths is presented for protection against random multiple-link failures under dynamic traffic. Simulation shows that the algorithm can achieve maximum sharing of backup bandwidth for protection against random multiple-link failure with significant amount of bandwidth saving.     

Power Control for Link Quality Protection in Cellular DS-CDMA Networks with Integrated (Packet and Circuit) Services

The problem of admission control in a DS-CDMA network carrying a heterogeneous mix of traffic is addressed. In an interference limited system such as DS-CDMA, admission of a new user impacts the performance of all other users, as well as the system capacity. The admission process is concerned with two factors: (1) maintaining the QoS of active users, (2) allocating bandwidth to new users. We propose a simple power control algorithm and prove that it is optimal in the sense of maintaining active link quality while maximizing free capacity for new admissions. The algorithm scales the powers of active links appropriately to achieve link protection and improved tolerance of the link to new interference from bursty sources. This algorithm can be used to overlay bursty packet data services without compromising QoS of active circuits.     

Bandwidth utilization efficiency enhancement for OFDM‐based WSN

Normally IEEE 802.16 (WiMAX) is used for mainly downlink traffic applications. However in the upper tier of 2‐tier (WiMAX‐WiFi) wireless sensor network, the uplink bandwidth faces bottlenecks for high throughput. In this paper, a solution has been proposed for this limitation of uplink bandwidth allocation through the use of queuing theoretic performance modeling. A Markov‐modulated Poisson process traffic model has been formed for orthogonal frequency division multiple access‐based transmission along with discrete time Markov chain system model for queuing. A downlink traffic pattern has been defined for wireless sensor network nodes. Analytical methods are used to estimate the performance parameters like throughput, delay, and probability of packet drop for resource allocation. An algorithm is formulated to find out minimum resource requirement for downlink and to transfer rest of the resources to uplink bandwidth allocation, for throughput enhancement. Uplink frame utilization is determined through another discrete time Markov chain model for adaptive triggering between the proposed maximum and the normal downlink to uplink ratio operations, for efficient distribution of bandwidth resources. Algorithm and simulation results prove outstanding improvement in the uplink throughput around 50%, without degrading the downlink throughput.