On the Scalability-Performance Tradeoffs in MPLS and IP Routing

MPLS (Multi-Protocol Label Switching) has recently emerged to facilitate the engineering of network traffic. This can be achieved by directing packet flows over paths that satisfy multiple requirements. MPLS has been regarded as an enhancement to traditional IP routing, which has the following problems: (1) all packets with the same IP destination address have to follow the same path through the network; and (2) paths have often been computed based on static and single link metrics. These problems may cause traffic concentration, and thus degradation in quality of service. In this paper, we investigate by simulations a range of routing solutions and examine the tradeoff between scalability and performance. At one extreme, IP packet routing using dynamic link metrics provides a stateless solution but may lead to routing oscillations. At the other extreme, we consider a recently proposed Profile-based Routing (PBR), which uses knowledge of potential ingress-egress pairs as well as the traffic profile among them. Minimum Interference Routing (MIRA) is another recently proposed MPLS-based scheme, which only exploits knowledge of potential ingress-egress pairs but not their traffic profile. MIRA and the more conventional widest-shortest path (WSP) routing represent alternative MPLS-based approaches on the spectrum of routing solutions. We compare these solutions in terms of utility, bandwidth acceptance ratio as well as their scalability (routing state and computational overhead) and load balancing capability. While the simplest of the per-flow algorithms we consider, the performance of WSP is close to dynamic per-packet routing, without the potential instabilities of dynamic routing.

Sampling Biases in IP Topology Measurements

Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of the Internet is a scale-free graph, or more generally a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. In this paper we argue that the evidence to date for this conclusion is at best insufficient. We show that graphs appearing to have power-law degree distributions can arise surprisingly easily, when sampling graphs whose true degree distribution is not at all like a power-law. For example, given a classical Erdös-Rényi sparse, random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can easily appear to show a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to distinguish measurements taken from the Erdös-Rényi graphs from those taken from power-law random graphs. When we apply this distinction to a number of well-known datasets, we find that the evidence for sampling bias in these datasets is strong.

Efficient building management with IP-based wireless sensor network

Existing Building/Energy Management Systems (BMS/EMS) fail to convey holistic performance to the building manager. A 20% reduction in energy consumption can be achieved by efficiently operated buildings compared with current practice. However, in the majority of buildings, occupant comfort and energy consumption analysis is primarily restricted by available sensor and meter data. Installation of a continuous monitoring process can significantly improve the building systems’ performance. We present WSN-BMDS, an IP-based wireless sensor network building monitoring and diagnostic system. The main focus of WSN-BMDS is to obtain much higher degree of information about the building operation then current BMSs are able to provide. Our system integrates a heterogeneous set of wireless sensor nodes with IEEE 802.11 backbone routers and the Global Sensor Network (GSN) web server. Sensing data is stored in a database at the back office via UDP protocol and can be access over the Internet using GSN. Through this demonstration, we show that WSN-BMDS provides accurate measurements of air-temperature, air-humidity, light, and energy consumption for particular rooms in our target building. Our interactive graphical user interface provides a user-friendly environment showing live network topology, monitor network statistics, and run-time management actions on the network. We also demonstrate actuation by changing the artificial light level in one of the rooms.

Carbachol triggers RyR-dependent Ca(2+) release via activation of IP(3) receptors in isolated rat gastric myocytes.

Possible interactions between different intracellular Ca(2+) release channels were studied in isolated rat gastric myocytes using agonist-evoked Ca(2+) signals. Spontaneous, local Ca(2+) transients were observed in fluo-4-loaded cells with linescan confocal imaging. These were blocked by ryanodine (100 microM) but not by the inositol 1,4,5-trisphosphate receptor (IP(3)R) blocker, 2-aminoethoxydiphenyl borate (100 microM), identifying them as Ca(2+) sparks. Caffeine (10 mM) and carbachol (10 microM) initiated Ca(2+) release at sites which co-localized with each other and with any Ca(2+) spark sites. In fura-2-loaded cells extracellular 2-aminoethoxydiphenyl borate and intracellular heparin (5 mg ml(-1)) both inhibited the global cytoplasmic [Ca(2+)] transient evoked by carbachol, confirming that it was IP(3)R-dependent. 2-Aminoethoxydiphenyl borate and heparin also increased the response to caffeine. This probably reflected an increased Ca(2+) store content since 2-aminoethoxydiphenyl borate more than doubled the amplitude of transients evoked by ionomycin. Ryanodine completely abolished carbachol and caffeine responses but only reduced ionomycin transients by 30 %, suggesting that blockade of carbachol transients by ryanodine was not simply due to store depletion. Double labelling of IP(3)Rs and RyRs demonstrated extensive overlap in their distribution. These results suggest that carbachol stimulates Ca(2+) release through co-operation between IP(3)Rs and RyRs, and implicate IP(3)Rs in the regulation of Ca(2+) store content.

Role of IP(3) in modulation of spontaneous activity in pacemaker cells of rabbit urethra.

Isolated interstitial ("pacemaker") cells from rabbit urethra were examined using the perforated-patch technique. Under voltage clamp at -60 mV, these cells fired large spontaneous transient inward currents (STICs), averaging -860 pA and >1 s in duration, which could account for urethral pacemaker activity. Spontaneous transient outward currents (STOCs) were also observed and fell into two categories, "fast" (1 s in duration). The latter were coupled to STICs, suggesting that they shared the same mechanism, while the former occurred independently at faster rates. All of these currents were abolished by cyclopiazonic acid, caffeine, or ryanodine, suggesting that they were activated by Ca(2+) release. When D-myo-inositol 1,4,5-trisphosphate (IP(3))-sensitive stores were blocked with 2-aminoethoxydiphenyl borate, the STICs and slow STOCs were abolished, but the fast STOCs remained. In contrast, the fast STOCs were more nifedipine sensitive than the STICs or the slow STOCs. These results suggest that while fast STOCs are mediated by a mechanism similar to STOCs in smooth muscle, STICs and slow STOCs are driven by IP(3). These results support the hypothesis that pacemaker activity in the urethra is driven by the IP(3)-sensitive store. PMID: 11287348 [PubMed - indexed for MEDLINE]

Sheriffs and outlaws: in pursuit of effective enforcement

Compliance has emerged as a key component of regulatory control, but has been subject to limited research. This paper examines compliance in relation to planning control in the jurisdiction of Northern Ireland. It draws upon a review of practice and procedure used to deal with planning enforcement cases and interviews conducted with professional planners. Many of the options considered emerge from the Review of Planning Enforcement System in England published by the Office of the Deputy Prime Minister (2002). The findings are incorporated with theoretical perspectives of regulatory compliance and provide a platform for more effective control of development.

Reuseable Silicon IP Cores for Discrete Wavelet Transform Applications

Architectures and methods for the rapid design of silicon cores for implementing discrete wavelet transforms over a wide range of specifications are described. These architectures are efficient, modular, scalable, and cover orthonormal and biorthogonal wavelet transform families. They offer efficient hardware utilization by exploiting a number of core wavelet filter properties and allow the creation of silicon designs that are highly parameterized, including in terms of wavelet type and wordlengths. Control circuitry is embedded within these systems allowing them to be cascaded for any desired level of decomposition without any interface glue logic. The time to produce chip designs for a specific wavelet application is typically less than a day and these are comparable in area and performance to handcrafted designs. They are also portable across a wide range of silicon foundries and suitable for field programmable gate array and programmable logic data implementation. The approach described has also been extended to wavelet packet transforms.

Platform-Independent IP Transmission over Wireless Networks: The WINE Approach

First demonstration of a working dynamically configurable architecture for wireless IP networks. The programmable architecture was as result of a European collaboration between Industry and University and was applied to a range of IP wireless networks. The work laid the foundations for subsequent research initiatives (including the UK) into programmable wireless networks as well as influencing future wireless standards (e.g. ITU-T).EU project WINE (Wireless Internet NEtworking), -1999-10028.

WFI Optimised PWGPS for Wireless IP Networks

The paper describes the design and analysis of a packet scheduler intended to operate over wireless channels with spatially selective error bursts. A particularly innovative aspect in the design is the optimization of the scheduler algorithm to minimize the worst-case fairness index (WFI) for real-time IP traffic.

Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.