Implications of query caching for JXTA peers

This dissertation studies the caching of queries and how to cache in an efficient way, so that retrieving previously accessed data does not need any intermediary nodes between the data-source peer and the querying peer in super-peer P2P network. A precise algorithm was devised that demonstrated how queries can be deconstructed to provide greater flexibility for reusing their constituent elements. It showed how subsequent queries can make use of more than one previous query and any part of those queries to reconstruct direct data communication with one or more source peers that have supplied data previously. In effect, a new query can search and exploit the entire cached list of queries to construct the list of the data locations it requires that might match any locations previously accessed. The new method increases the likelihood of repeat queries being able to reuse earlier queries and provides a viable way of by-passing shared data indexes in structured networks. It could also increase the efficiency of unstructured networks by reducing traffic and the propensity for network flooding. In addition, performance evaluation for predicting query routing performance by using a UML sequence diagram is introduced. This new method of performance evaluation provides designers with information about when it is most beneficial to use caching and how the peer connections can optimize its exploitation.

Radio range adjustment for energy efficient wireless sensor networks

In wireless ad hoc sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. Topology management schemes such as GAF put the redundant nodes for routing to sleep in order to save the energy. The radio range will affect the number of neighbouring nodes, which collaborate to forward data to a base station or sink. In this paper we study a simple linear network and deduce the relationship between optimal radio range and traffic. We find that half of the power can be saved if the radio range is adjusted appropriately compared with the best case where equal radio ranges are used.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Ensuring efficiency and robustness in MANET

This paper introduces a joint load balancing and hotspot mitigation protocol for mobile ad-hoc network (MANET) termed by us as 'load_energy balance + hotspot mitigation protocol (LEB+HM)'. We argue that although ad-hoc wireless networks have limited network resources - bandwidth and power, prone to frequent link/node failures and have high security risk; existing ad hoc routing protocols do not put emphasis on maintaining robust link/node, efficient use of network resources and on maintaining the security of the network. Typical route selection metrics used by existing ad hoc routing protocols are shortest hop, shortest delay, and loop avoidance. These routing philosophy have the tendency to cause traffic concentration on certain regions or nodes, leading to heavy contention, congestion and resource exhaustion which in turn may result in increased end-to-end delay, packet loss and faster battery power depletion, degrading the overall performance of the network. Also in most existing on-demand ad hoc routing protocols intermediate nodes are allowed to send route reply RREP to source in response to a route request RREQ. In such situation a malicious node can send a false optimal route to the source so that data packets sent will be directed to or through it, and tamper with them as wish. It is therefore desirable to adopt routing schemes which can dynamically disperse traffic load, able to detect and remove any possible bottlenecks and provide some form of security to the network. In this paper we propose a combine adaptive load_energy balancing and hotspot mitigation scheme that aims at evenly distributing network traffic load and energy, mitigate against any possible occurrence of hotspot and provide some form of security to the network. This combine approach is expected to yield high reliability, availability and robustness, that best suits any dynamic and scalable ad hoc network environment. Dynamic source routing (DSR) was use as our underlying protocol for the implementation of our algorithm. Simulation comparison of our protocol to that of original DSR shows that our protocol has reduced node/link failure, even distribution of battery energy, and better network service efficiency.

Subjective quality evaluation for voice communication over MANET

Due to the dynamic and mutihop nature of the Mobile Ad-hoc Network (MANET), voice communication over MANET may encounter many challenges. We set up a subjective quality evaluation model using ITU-T E-model with extension. And through simulation in NS-2, we evaluate how the following factors impact voice quality in MANET: the number of hops, the number of route breakages, the number of communication pairs and the background traffic. Using AODV as the underlying routing protocol, and with the MAC layer changed from 802.11 DCF to 802.11e EDCF, we observe that 802.11e is more suitable for implementating voice communication over MANET. © 2005 IEEE.

Physics-inspired methods for networking and communications

Advances in statistical physics relating to our understanding of large-scale complex systems have recently been successfully applied in the context of communication networks. Statistical mechanics methods can be used to decompose global system behavior into simple local interactions. Thus, large-scale problems can be solved or approximated in a distributed manner with iterative lightweight local messaging. This survey discusses how statistical physics methodology can provide efficient solutions to hard network problems that are intractable by classical methods. We highlight three typical examples in the realm of networking and communications. In each case we show how a fundamental idea of statistical physics helps solve the problem in an efficient manner. In particular, we discuss how to perform multicast scheduling with message passing methods, how to improve coding using the crystallization process, and how to compute optimal routing by representing routes as interacting polymers.

First experimental demonstration of terabit interferometric drop, add and extract multiplexer

We present the first experimental implementation of an all-optical ROADM scheme for routing of individual channels within an all-optical OFDM superchannel. The interferometric technique demonstrated enables a fully flexible node, implementing the extraction, drop and addition of individual sub-channel.

Experimental implementation of an all-optical interferometric drop, add, and extract multiplexer for superchannels

We present the experimental implementation of an all-optical ROADM scheme for routing of an individual subchannel within an all-optical OFDM superchannel. The different functions required of optical node were demonstrated using interferometric technique with the extraction, drop, and addition of individual subchannel in a ten subchannels optically aggregated signal. The scheme we reported enables a fully flexible node compatible with future terabit per second superchannel transmission.

Enabling transparent technologies for the development of highly granular flexible optical cross-connects

Flexible optical networking is identified today as the solution that offers smooth system upgradability towards Tb/s capacities and optimized use of network resources. However, in order to fully exploit the potentials of flexible spectrum allocation and networking, the development of a flexible switching node is required capable to adaptively add, drop and switch tributaries with variable bandwidth characteristics from/to ultra-high capacity wavelength channels at the lowest switching granularity. This paper presents the main concept and technology solutions envisioned by the EU funded project FOX-C, which targets the design, development and evaluation of the first functional system prototype of flexible add-drop and switching cross-connects. The key developments enable ultra-fine switching granularity at the optical subcarrier level, providing end-to-end routing of any tributary channel with flexible bandwidth down to 10Gb/s (or even lower) carried over wavelength superchannels, each with an aggregated capacity beyond 1Tb/s. © 2014 IEEE.

Cost-reduction using non-uniform traffic in optical networks

Next-generation networks are likely to be non-uniform in all their aspects, including number of lightpaths carried per link, number of wavelengths per link, number of fibres per link, asymmetry of the links, and traffic flows. Routing and wavelength allocation models generally assume that the optical network is uniform and that the number of wavelengths per link is a constant. In practice however, some nodes and links carry heavy traffic and additional wavelengths are needed in those links. We study a wavelength-routed optical network based on the UK JANET topology where traffic demands between nodes are assumed to be non-uniform. We investigate how network capacity can be increased by locating congested links and suggesting cost-effective upgrades. Different traffic demands patterns, hop distances, number of wavelengths per link, and routing algorithms are considered. Numerical results show that a 95% increase in network capacity is possible by overlaying fibre on just 5% of existing links. We conclude that non-uniform traffic allocation can be beneficial to localize traffic in nodes and links deep in the network core and provisioning of additional resources there can efficiently and cost-effectively increase network capacity. © 2013 IEEE.

A new VRPPD model and a hybrid heuristic solution approach for e-tailing

We analyze a business model for e-supermarkets to enable multi-product sourcing capacity through co-opetition (collaborative competition). The logistics aspect of our approach is to design and execute a network system where “premium” goods are acquired from vendors at multiple locations in the supply network and delivered to customers. Our specific goals are to: (i) investigate the role of premium product offerings in creating critical mass and profit; (ii) develop a model for the multiple-pickup single-delivery vehicle routing problem in the presence of multiple vendors; and (iii) propose a hybrid solution approach. To solve the problem introduced in this paper, we develop a hybrid metaheuristic approach that uses a Genetic Algorithm for vendor selection and allocation, and a modified savings algorithm for the capacitated VRP with multiple pickup, single delivery and time windows (CVRPMPDTW). The proposed Genetic Algorithm guides the search for optimal vendor pickup location decisions, and for each generated solution in the genetic population, a corresponding CVRPMPDTW is solved using the savings algorithm. We validate our solution approach against published VRPTW solutions and also test our algorithm with Solomon instances modified for CVRPMPDTW.

Green's function for paraxial equation

The theory and experimental applications of optical Airy beams are in active development recently. The Airy beams are characterised by very special properties: they are non-diffractive and propagate along parabolic trajectories. Among the striking applications of the optical Airy beams are optical micro-manipulation implemented as the transport of small particles along the parabolic trajectory, Airy-Bessel linear light bullets, electron acceleration by the Airy beams, plasmonic energy routing. The detailed analysis of the mathematical aspects as well as physical interpretation of the electromagnetic Airy beams was done by considering the wave as a function of spatial coordinates only, related by the parabolic dependence between the transverse and the longitudinal coordinates. Their time dependence is assumed to be harmonic. Only a few papers consider a more general temporal dependence where such a relationship exists between the temporal and the spatial variables. This relationship is derived mostly by applying the Fourier transform to the expressions obtained for the harmonic time dependence or by a Fourier synthesis using the specific modulated spectrum near some central frequency. Spatial-temporal Airy pulses in the form of contour integrals is analysed near the caustic and the numerical solution of the nonlinear paraxial equation in time domain shows soliton shedding from the Airy pulse in Kerr medium. In this paper the explicitly time dependent solutions of the electromagnetic problem in the form of time-spatial pulses are derived in paraxial approximation through the Green's function for the paraxial equation. It is shown that a Gaussian and an Airy pulse can be obtained by applying the Green's function to a proper source current. We emphasize that the processes in time domain are directional, which leads to unexpected conclusions especially for the paraxial approximation.

Experimental demonstration of an all-optical interferometric drop, add, and extract multiplexer for OFDM super-channel

The experimental implementation of an all-optical node able of routing a channel contained in an all-optical OFDM super-channel is presented. The extract function is performed through channel selection, reshaping and interferometric suppression.

Quality of transmission estimation in WDM and elastic optical networks accounting for space-spectrum dependencies

We develop a framework for estimating the quality of transmission (QoT) of a new lightpath before it is established, as well as for calculating the expected degradation it will cause to existing lightpaths. The framework correlates the QoT metrics of established lightpaths, which are readily available from coherent optical receivers that can be extended to serve as optical performance monitors. Past similar studies used only space (routing) information and thus neglected spectrum, while they focused on oldgeneration noncoherent networks. The proposed framework accounts for correlation in both the space and spectrum domains and can be applied to both fixed-grid wavelength division multiplexing (WDM) and elastic optical networks. It is based on a graph transformation that exposes and models the interference between spectrum-neighboring channels. Our results indicate that our QoT estimates are very close to the actual performance data, that is, to having perfect knowledge of the physical layer. The proposed estimation framework is shown to provide up to 4 × 10-2 lower pre-forward error correction bit error ratio (BER) compared to theworst-case interference scenario,which overestimates the BER. The higher accuracy can be harvested when lightpaths are provisioned with low margins; our results showed up to 47% reduction in required regenerators, a substantial savings in equipment cost.