Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks

In this paper, we propose and investigate the characteristics of a fair queueing with service envelopes (FQSE) algorithm-a hierarchical fair-share scheduling algorithm for access networks based on a remote scheduling system such as Ethernet passive optical networks (EPON) or cable TV network. FQSE is designed to overcome the limiting factors of a typical remote scheduling system such as large control-plane delay, limited control-plane bandwidth, and significant queue switch-over overhead. The algorithm is based on a concept of service envelope-a function representing the fair allocation of resources based on a global network condition called satisfiability parameter (SP). We define properties of cousin-fairness and sibling-fairness and show the FQSE to be cousin-fair. FQSE is unique in that it is the only hierarchical algorithm that is simultaneously cousin-fair. Furthermore, we show the necessary techniques to adapt FQSE to variable-sized packet-based networks. We analyze FQSE performance in EPON serving 1024 independent queues and demonstrate FQSE's ability to provide guaranteed bandwidth to each queue and to share the excess bandwidth fairly.     

Novel Low-Overhead Operand Isolation Techniques for Low-Power Datapath Synthesis

Power consumption in datapath modules due to redundant switching is an important design concern for high-performance applications. Operand isolation schemes that reduce this redundant switching incur considerable overhead in terms of delay, power, and area. This paper presents novel operand isolation techniques based on supply gating that reduce overheads associated with isolating circuitry. The proposed schemes also target leakage minimization and additional operand isolation at the internal logic of datapath to further reduce power consumption. We integrate the proposed techniques and power/delay models to develop a synthesis flow for low-power datapath synthesis. Simulation results show that the proposed operand isolation techniques achieve at least 40% reduction in power consumption compared to original circuit with minimal area overhead (5%) and delay penalty (0.15%)     

Discriminant Analysis Based Prognostics of Avionic Systems

In this paper, a novel discriminant analysis based predictive model for preventing false alarms leading to unnecessary replacement of an avionic system component is presented. The model is validated by prediction of false alarms (also known as false positives, type I, or alpha errors) in the left generator shaft of a Sikorsky helicopter UH-60, using the Goodrich health and usage management system (HUMS). The paper presents one of the first approaches based on applying discriminant analysis for prognostics of avionic systems, specifically in the context of identifying false positives within the next 1 or 2 h. In practice, predictions for the next 2 h are sufficient as typical helicopter flight schedules and durations are such that up to 2 h advance notice is most useful. This is an important contribution because drive train components of helicopters are normally very robust with very rare failures; therefore, the cost of unnecessary preventive maintenance based on false alarms is very high.     

ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

With the exponential growth of end users and web data, the internet is undergoing the change of paradigm from a user-centric model to a content-centric one, popularly known as information-centric networks (ICN). Current ICN research evolves around three key-issues namely (i) content request searching, (ii) content routing, and (iii) in-network caching scheme to deliver the requested content to the end user. This would improve the user experience to obtain requested content because it lowers the download delay and provides higher throughput. Existing researches have mainly focused on on-path congestion or expected delivery time of a content to determine the optimized path towards custodian. However, it ignores the cumulative effect of the link-state parameters and the state of the cache, and consequently it leads to degrade the delay performance. In order to overcome this shortfall, we consider both the congestion of a link and the state of on-path caches to determine the best possible routes. We introduce a generic term entropy to quantify the effects of link congestion and state of on-path caches. Thereafter, we develop a novel entropy dependent algorithm namely ENROUTE for searching of content request triggered by any user, routing of this content, and caching for the delivery this requested content to the user. The entropy value of an intra-domain node indicates how many popular contents are already cached in the node, which, in turn, signifies the degree of enrichment of that node with the popular contents. On the other hand, the entropy for a link indicates how much the link is congested with the traversal of contents. In order to have reduced delay, we enhance the entropy of caches in nodes, and also use path with low entropy for downloading contents. We evaluate the performance of our proposed ENROUTE algorithm against state-of-the-art schemes for various network parameters and observe an improvement of 29–52% in delay, 12–39% in hit rate, and 4–39% in throughput.

     

BIST/Digital-Compatible Testing of RF Devices Using Distortion Model Fitting

Testing of Radio Frequency (RF) circuits for nonlinearity specifications generally requires the use of multiple test measurements thereby contributing to increased test cost. Prior RF test methods have suffered from significant test calibration effort (training for supervised learners) when using compact tests or from increased test time due to direct specification measurement. On the other hand, due to aggressive technology scaling, there are plenty of digital transistors available that can be used to simplify testing of Analog/Mixed-Signal (AMS) and RF devices. In this paper, an RF test methodology is developed that: (a) allows RF devices to be tested for several distortion specifications using distortion model fitting algorithms in test time comparable to what can be achieved using supervised learning techniques while retaining the accuracy of direct specification measurement, (b) allows multiple RF specifications to be determined concurrently from a single data acquisition and (c) allows digital-compatible testing/BIST to be performed using digital testers or on-chip built in self-test (BIST) circuitry. With regard to (a), a key benefit is that no training of supervised learning algorithm is necessary. The proposed method based on distortion model fitting is shown to give excellent results across common RF performance metrics while providing ~10× improvements in test time compared to previous methods.     

DEICA: A differential evolution-based improved clustering algorithm for IoT-based heterogeneous wireless sensor networks

With the evolution of technology, many modern applications like habitat monitoring, environmental monitoring, disaster prediction and management, and telehealth care have been proposed on wireless sensor networks (WSNs) with Internet of Things (IoT) integration. However, the performance of these networks is restricted because of the various constraints imposed due to the participating sensor nodes, such as nonreplaceable limited power units, constrained computation, and limited storage. Power limitation is the most severe among these restrictions. Hence, the researchers have sought schemes enabling energy-efficient network operations as the most crucial issue. A metaheuristic clustering scheme is proposed here to address this problem, which employs the differential evolution (DE) technique as a tool. The proposed scheme achieves improved network performance via the formulation of load-balanced clusters, resulting in a more scalable and adaptable network. The proposed scheme considers multiple parameters such as nodes' energy level, degree, proximity, and population for suitable network partitioning. Through various simulation results and experimentation, it establishes its efficacy over state-of-the-art schemes in respect of load-balanced cluster formation, improved network lifetime, network resource utilization, and network throughput. The proposed scheme ensures up to 57.69%, 33.16%, and 57.74% gains in network lifetime, energy utilization, and data packet delivery under varying network configurations. Besides providing the quantitative analysis, a detailed statistical analysis has also been performed that describes the acceptability of the proposed scheme under different network configurations.     

SIP-based vertical handoff between WWANs and WLANs

Future-generation wireless networks have been envisioned as the integration of various wireless access networks, including both wireless wide area networks and wireless local area networks. In such a heterogeneous network environment, seamless mobility support is the basis of providing uninterrupted wireless services to mobile users roaming between various wireless access networks. Because of transparency to lower-layer characteristics, ease of deployment, and greater scalability, the application-layer-based session initiation protocol has been considered the right candidate for handling mobility in heterogeneous wireless networks. However, SIP entails application-layer transport and processing of messages, which may introduce considerable delay. As a case study of the performance of mobility management protocols in the heterogeneous wireless networks, we analyze the delay associated with vertical handoff using SIP in the WLAN-UMTS internetwork. Analytical results show that WLAN-to-UMTS handoff incurs unacceptable delay for supporting real-time multimedia services, and is mainly due to transmission of SIP signaling messages over erroneous and bandwidth-limited wireless links. On the other hand, UMTS-to-WLAN handoff experiences much less delay, mainly contributed by the processing delay of signaling messages at the WLAN gateways and servers. While the former case requires the deployment of soft handoff techniques to reduce the delay, faster servers and more efficient host configuration mechanisms can do the job in the latter case.     

Priority-based content processing with Q-routing in information-centric networking (ICN)

With exponential increase in the number of users and available data, service providers are facing hard times to satisfy and improve end user experience. Researchers have come up with the idea of exploiting increasing number of routers in a network, and it leads to the development of information-centric networking (ICN). Efficient usage of the in-network caches and content forwarding methodology are the key issues in an ICN architecture. ICN reduces average hop count and correspondingly average content download delay because the intra-domain routers in ICN have storage capacity and they can act as temporary content provider. In this paper, we address the content management issue in a cache with finite storage capability and propose an efficient content management policy that changes a router to a self-sustained cache. We propose a novel methodology to process content packets in the buffer of a cache and correspondingly reduce the propagation delay through a cache. We simulate our proposed algorithm over real-life network environment and evaluate the performance of different user experience metrics, e.g. average latency, throughput, goodput, and link load. Simulation results suggest that our proposed model outperforms the existing state-of-the-art on-path caching strategies.     

Active filter system implementation

Adjustable speed AC drives with low input current THD are becoming increasingly important in industry. This article has detailed the implementation of a parallel active filter, which is integrated within a 450 kW adjustable speed drive to provide an overall system which conforms to IEEE 519, and which provides significant benefits on a system level. The design of the active filter is seen to be driven by overall system specifications which include input current THD, efficiency, displacement power factor, a high level of integration with the load converter, and cost targets. Active filter operation and control has been analyzed at a detailed level, and fundamental issues relating to current regulator topology and operation, limits on compensation capability, DC bus control, switching frequency ripple suppression, etc., have all been addressed, and have all been shown to be very important in terms of helping the system meet its performance objectives. The overall drive system including the active filter, meets IEEE 519 by reducing the supply current THD from 26.8% without the active filter to 4.1% with the active filter operating. This is achieved in presence of supply voltage THD of 2.3% and filter terminal voltage V _f unbalance of 1.3% and, includes an ASD load induced subharmonic component at 33 Hz. Further, individual harmonic limits are met up to the 35th harmonic     

Some principles for designing a wide-area WDM optical network

We explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage. This optical network exploits wavelength multiplexers and optical switches in routing nodes, so that an arbitrary virtual topology may be embedded on a given physical fiber network. The virtual topology, which is used as a packet-switched network and which consists of a set of all-optical “lightpaths”, is set up to exploit the relative strengths of both optics and electronics-viz. packets of information are carried by the virtual topology “as far as possible” in the optical domain, but packet forwarding from lightpath to lightpath is performed via electronic switching, whenever required. We formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the network-wide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands). Since simpler versions of this problem have been shown to be NP-hard, we resort to heuristic approaches. Specifically, we employ an iterative approach which combines “simulated annealing” (to search for a good virtual topology) and “flow deviation” (to optimally route the traffic-and possibly bifurcate its components-on the virtual topology). We do not consider the number of available wavelengths to be a constraint, i.e., we ignore the routing of lightpaths and wavelength assignment for these lightpaths. We illustrate our approaches by employing experimental traffic statistics collected from NSFNET