A comparison of UPS for powering hybrid fiber/coaxial networks

Four distinct uninterruptible power supply topologies are presented here for powering hybrid fiber/coaxial (HFC) networks. Topologies based on a low frequency isolation transformer are found to have better efficiency than the topologies with high frequency transformer. However, the latter topologies have much better performance in terms of transient response, quality of the output voltage, input power factor, total harmonic distortion of the input current, size and weight. The series-parallel resonant based UPS topology is found to have best overall performance for the emerging HFC applications     

TCP for high performance in hybrid fiber coaxial broad-band accessnetworks

Motivated by the phenomenal growth of the Internet in recent years, a number of cable operators are in the process of upgrading their cable networks to offer data services to residential subscribers, providing them direct access to a variety of community content as well as to the Internet. Using cable modems that implement sophisticated modulation-demodulation circuitry, these services promise to offer a several hundredfold increase in access speeds to the home compared to conventional telephone modems. Initial experiences indicate that cable networks are susceptible to a variety of radio-frequency (RF) impairments that can result in significant packet loss during data communication. In the face of such losses, the transmission control protocol (TCP) that is predominantly used by data applications degrades dramatically in performance. Consequently, subscribers of broad-band data services may not perceive the projected hundredfold increase in performance. We analyze the performance of TCP under different network conditions using simulations and propose simple modifications that can offer up to threefold increase in performance in access networks that are prone to losses. These modifications require only minor changes to TCP implementations at the local network servers alone (and not at subscribers' PCs)     

A hybrid channel allocation method for wireless communication networks

In this paper a new hybrid channel allocation method is presented, which focuses on both nominal and dynamic channel allocation. Copyright © 2000 John Wiley & Sons, Ltd.     

Joint resource allocation for hybrid NOMA-assisted MEC in 6G networks

Multi-access Edge Computing (MEC) is an essential technology for expanding computing power of mobile devices, which can combine the Non-Orthogonal Multiple Access (NOMA) in the power domain to multiplex signals to improve spectral efficiency. We study the integration of the MEC with the NOMA to improve the computation service for the Beyond Fifth-Generation (B5G) and the Sixth-Generation (6G) wireless networks. This paper aims to minimize the energy consumption of a hybrid NOMA-assisted MEC system. In a hybrid NOMA system, a user can offload its task during a time slot shared with another user by the NOMA, and then upload the remaining data during an exclusive time duration served by Orthogonal Multiple Access (OMA). The original energy minimization problem is non-convex. To efficiently solve it, we first assume that the user grouping is given, and focuses on the one group case. Then, a multilevel programming method is proposed to solve the non-convex problem by decomposing it into three subproblems, i.e., power allocation, time slot scheduling, and offloading task assignment, which are solved optimally by carefully studying their convexity and monotonicity. The derived solution is optimal to the original problem by substituting the closed expressions obtained from those decomposed subproblems. Furthermore, we investigate the multi-user case, in which a close-to-optimal algorithm with low-complexity is proposed to form users into different groups with unique time slots. The simulation results verify the superior performance of the proposed scheme compared with some benchmarks, such as OMA and pure NOMA.     

Allocation and scheduling algorithms for IEEE 802.14 and MCNS inhybrid fiber coaxial networks

IEEE 802.14 and MCNS (multimedia cable network system) are two standards developed for the hybrid fiber coaxial (HFC) CATV networks. Both standards model an upstream channel as a stream of minislots. But their philosophies on resolving collisions in the shared upstream channel are rather different, where IEEE 802.14 adopts the priority+FIFO first-transmission rule and the n-ary tree retransmission rule, and MCNS adopts the binary exponential backoff algorithm with adjustable window sizes. Both provide reservation access, while IEEE 802.14 and MCNS also support isochronous access and immediate access, respectively. In this paper, we try to prepare a suggestion list for vendors on how to allocate minislots for reservation access and immediate access and how to schedule the reserved bandwidth, which greatly affect the performance of a cable network and are left open by the standards     

光无线混合宽带接入网QoS感知DBA算法

针对光无线混合宽带接入网的特点,提出一种考虑公平性的Qo S感知DBA算法(QDBA)。仿真结果表明:与已有算法相比,QDBA具有较高的吞吐量和较低的平均时延,同时具有更好的公平性和Qo S保障。     

Resource allocation for broadband networks

The major benefit of a broadband integrated ATM (asynchronous transfer mode) network is flexible and efficient allocation of communications bandwidth for communications services. However, methods are needed for evaluating congestion for integrated traffic. The author suggests evaluating congestion at different levels, namely the packet level, the burst level, and the call level. Congestion is measured by the probabilities of packet blocking, burst blocking, and call blocking. He outlines the methodologies for comparing these blocking probabilities. The author uses the congestion measures for a multilayer bandwidth-allocation algorithm, emulating some function of virtual circuit setup, fast circuit switching, and fast packet switching at these levels. The analysis also sheds insight on traffic engineering issues such as appropriate link load, traffic integration, trunk group and switch sizing, and bandwidth reservation criteria for two bursty services     

Resource planning and bandwidth allocation in hybrid fiber–coax residential networks

The introduction of new high bandwidth services such as video-on-demand by cable operators will put a strain on existing resources. It is important for cable operators to know how many resources to commit to the network to satisfy customer demands. In this paper, we develop models of voice and video traffic to determine the effect of demand growth on hybrid fiber–coax networks. We obtain a set of guidelines that network operators can use to build out their networks in response to increased demand. We begin with one type of traffic and generalize to an arbitrary number of high-bandwidth constant bit rate (CBR) like services to obtain service blocking probabilities. We consider the effect of supporting variable bit rate (VBR) packet-switched traffic in addition to CBR services. These computations help us to determine how cable networks would function under various conditions (i.e., low, medium, and heavy loads). We also consider how the growth rate of the popularity of such services would change over time, and how this impacts network planning. Our findings will help cable operators estimate how much bandwidth they need to provision for a given traffic growth model and connection blocking requirement.     

Power allocation in cognitive radio networks over Rayleigh-fading channels with hybrid intelligent algorithms

In this paper, we introduce a hybrid strategy which combines pattern search (PS) optimization and genetic algorithm (GA) to address the problem of power allocation in cognitive radio networks. Considering the fluctuating interference thresholds in cognitive networks, an approach for promoting the coexistence of licensed users and cognitive users is designed. Secondly, based on the analysis of transmission outage probability, a corresponding objective function with regard to the power allocation over Rayleigh fading channels is obtained. It is a difficult task to obtain this objective function directly by using traditional methods, such as common mathematical deduction or linear programming, due to the nonlinearity and complexity of the underlying optimization problem. Inspired by the concept of intelligent algorithms, we employ the scheme of combining PS optimization and GA method, which are both efficient intelligent algorithms to address this challenge. The advantage of this hybrid strategy is that it can overcome the instability problem of GA as well as the local convergency problem of PS method. Thus, the hybrid intelligent method can attain a global and steady outcome. We improve the performance of power allocation strategy with an acceptable increase in computation overhead. The numerical results are encouraging and show that the proposed approach is worthy of consideration in achieving complicated power optimization. Hence, we achieve steady and rational outcomes by applying the proposed hybrid strategy when traditional method is to be ineffective in addressing the nonlinear objective.     

Segmented-core single-mode fiber optimized for bending performance

The performance of a matched-clad single-mode fiber design presently under development is described. Fibers of this design, which is based on the segmented-core approach, have been fabricated with a higher delta than simple matched-clad step-index single-mode fibers without a sacrificial increase in either the fiber cutoff or zero dispersion wavelengths. The resulting improvements in both macrobending and microbending performance is detailed     

Contention resolution and QoS provisioning using sparse fiber delay lines in WDM networks

In this paper, we combine fiber delay lines (FDL) and optical wavelength conversion (OWC) as the solution for the burst contention problem in optical burst switching (OBS). We present a placement algorithm, k-WDS, for the sparse placement of FDLs at a set of selected nodes in the network. The algorithm can handle both uniform and non-uniform traffic patterns. Our extensive performance tests show that k-WDS provides more efficient placement of optical fiber delay lines than the well-known approach of placing the resources at nodes with the highest experienced burst loss. Performance results are also given to compare the benefit of using FDLs alone, OWCs alone, as well as a mixture of both FDLs and OWCs. A new algorithm, A-WDS, for the placement of an arbitrary numbers of FDLs and OWCs is presented and evaluated under different uniform and non-uniform traffic loads using network simulation of the NSFNET topology and randomly generated graphs. The paper is concluded by presenting the design of a cost-effective optical switch equipped with variable-delay FDL bank. Based on the switch design, a scheme to provide differentiated services for multiple classes of traffic is presented and evaluated.     

Prioritized resource allocation for stressed networks

Overloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This results in a simple algorithm suitable for multimedia and packet networks. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in terms of the amount of resources required and sensitivity to load variations. An upper limit policy can also be deployed much faster when a large overload occurs from a disaster event     

Resource allocation based on dynamic hybrid overlay/underlay for heterogeneous services of cognitive radio networks

In cognitive radio networks (CRNs), hybrid overlay and underlay sharing transmission mode is an effective technique to improve the efficiency of radio spectrum. Unlike existing works in literatures where only one secondary user (SU) uses both overlay and underlay mode, the different transmission modes should dynamically be allocated to different SUs according to their different quality of services (QoS) to achieve the maximal efficiency of radio spectrum. However, dynamic sharing mode allocation for heterogeneous services is still a great challenge in CNRs. In this paper, we propose a new resource allocation method based on dynamic allocation hybrid sharing transmission mode of overlay and underlay (Dy-HySOU) to obtain extra spectrum resource for SUs without interfering with the primary users. We formulate the Dy-HySOU resource allocation problem as a mixed-integer programming to optimize the total system throughput with simultaneous heterogeneous QoS guarantee. To decrease the algorithm complexity, we divide the problem into two sub-problems: subchannel allocation and power allocation. Cutset is used to achieve the optimal subchannel allocation, and the optimal power allocation is obtained by Lagrangian dual function decomposition and subgradient algorithm. Simulation results show that the proposed algorithm further improves spectrum utilization with simultaneous fairness guarantee, and the achieved Dy-HySOU diversity gain is satisfying.     

An economic mechanism for request routing and resource allocation in hybrid CDN–P2P networks

Hybrid content delivery networks (HCDN) benefit from the complementary advantages of P2P (Peer to Peer) networks and CDNs (Content Delivery Network). In order to extend a traditional CDN and enable it to offer hybrid content delivery service, we have modified a traditional domain name system‐based request routing mechanism. The proposed scheme relies on an oligopolistic mechanism to balance the load on the edge servers and employs a truthful profit‐maximizing auction to maximize the contribution of users in the P2P content delivery. In particular, economics of content delivery in HCDNs is studied, and it is shown that through our request routing mechanism, it is possible to deliver higher quality of service to majority of end‐users, increase the net profit of the HCDN provider and decrease the content distribution cost at the same time. Copyright © 2015 John Wiley & Sons, Ltd.     

Power allocation for cooperative relaying in wireless networks

Power allocation strategies are developed for amplify-and-forward cooperative relaying networks in fading channels. The average signal-to-noise ratio (SNR) and outage performances are optimized in some sense by maximizing the sum and product, respectively, of the average SNR of the direct link and an upper bound on the SNR of the relay link. The power allocation strategies require knowledge of only the mean strengths of the channels.     

A hybrid cycle bandwidth allocation scheme with differentiated services support in Ethernet passive optical networks

The Ethernet passive optical network (EPON) has emerged as one of the most promising solutions for next generation broadband access networks. Designing an efficient upstream bandwidth allocation scheme with differentiated services (DiffServ) support is a crucial issue for the successful deployment of EPON, carrying heterogeneous traffic with diverse quality of service (QoS) requirements. In this article, we propose a new hybrid cycle scheme (HCS) for bandwidth allocation with DiffServ support. In this scheme, the high-priority traffic is transmitted in fixed timeslots at fixed positions in a cycle while the medium- and low-priority traffic are transmitted in variable timeslots in an adaptive dynamic cycle. A suitable local buffer management scheme is also proposed to facilitate QoS implementation. We develop a novel feature providing potentially multiple transmission opportunities (M-opportunities) per-cycle for high-priority traffic. This feature is significant in improving delay and delay-variation performance. The HCS provides guaranteed services in a short-cycle scale for delay and jitter sensitive traffic while offering guaranteed throughput in a moderately long-time scale for bandwidth sensitive traffic and at the same time maximizing throughput for non-QoS demanding best-effort traffic. We develop analytical performance analysis on the deterministic delay bound for high-priority traffic and minimum throughput guarantees for both high- and medium-priority traffic. On the other hand, we also conduct detailed simulation experiments. The results show a close agreement between analytical approach and simulation. In addition, the simulation results show that the HCS scheme is able to provide excellent performance in terms of average delay, delay-variation, and throughput as compared with previous approaches.

宽带多径备份路由优化功率算法的研究

提出了一种适用于宽带的多径备份路由优化功率（MBOP）算法，该算法利用多路径和备份路由，并对网络的发射功率进行优化，减小网络总发射功率，适用于网络结构动态变化的移动无线自组织网络和发射功率严格受限的UWB网络。仿真结果表明，该算法可以显著地提高网络的吞吐量，对时延和网络负载开销有小幅度改善。     

Robust resource allocation for NOMA-assisted heterogeneous networks

As a promising technology to improve spectrum efficiency and transmission coverage, Heterogeneous Network (HetNet) has attracted the attention of many scholars in recent years. Additionally, with the introduction of the Non-Orthogonal Multiple Access (NOMA) technology, the NOMA-assisted HetNet cannot only improve the system capacity but also allow more users to utilize the same frequency band resource, which makes the NOMA-assisted HetNet a hot topic. However, traditional resource allocation schemes assume that base stations can exactly estimate direct link gains and cross-tier link gains, which is impractical for practical HetNets due to the impact of channel delays and random perturbation. To further improve energy utilization and system robustness, in this paper, we investigate a robust resource allocation problem to maximize the total Energy Efficiency (EE) of Small-Cell Users (SCUs) in NOMA-assisted HetNets under imperfect channel state information. By considering bounded channel uncertainties, the robust resource optimization problem is formulated as a mixed-integer and nonlinear programming problem under the constraints of the cross-tier interference power of macrocell users, the maximum transmit power of small base station, the Resource Block (RB) assignment, and the quality of service requirement of each SCU. The original problem is converted into an equivalent convex optimization problem by using Dinkelbach's method and the successive convex approximation method. A robust Dinkelbach-based iteration algorithm is designed by jointly optimizing the transmit power and the RB allocation. Simulation results verify that the proposed algorithm has better EE and robustness than the existing algorithms.     

Bandwidth allocation scheme for cyclic-service fieldbus networks

Field devices in factory automation and process control systems generate time-critical, periodic, and time-available data that share the bandwidth of one fieldbus network medium. This paper presents a bandwidth allocation scheme that is applicable to cyclic-service fieldbus networks. The bandwidth allocation scheme transmits time-critical data as soon as the server is available. Transmission of periodic data is scheduled such that the network-induced delay will not exceed the maximum limit allowed. The bandwidth allocation scheme restricts the packet length of time-available data to satisfy the delay requirements of time-critical and periodic data. The bandwidth allocation scheme not only satisfies the real-time transmission requirements of both time-critical and periodic data, but also fully utilizes the bandwidth resources of the fieldbus network. The validity of this bandwidth allocation scheme is examined through simulation     

Distributed fault-tolerant channel allocation for cellular networks

A channel allocation algorithm includes channel acquisition and channel selection algorithms. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a mobile switching center (MSC) to accomplish channel acquisition. Distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. We first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to nonfault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as nonuniform traffic distribution