Menth M.,University of Würzburg |
Lehrieder F.,University of Würzburg |
Briscoe B.,BT Research |
Eardley P.,BT Research |
And 9 more authors.
IEEE Communications Surveys and Tutorials | Year: 2010
Pre-congestion notification (PCN) provides feedback about load conditions in a network to its boundary nodes. The PCN working group of the IETF discusses the use of PCN to implement admission control (AC) and flow termination (FT) for prioritized realtime traffic in a DiffServ domain. Admission control (AC) is a well-known flow control function that blocks admission requests of new flows when they need to be carried over a link whose admitted PCN rate already exceeds an admissible rate. Flow termination (FT) is a new flow control function that terminates some already admitted flows when they are carried over a link whose admitted PCN rate exceeds a supportable rate. The latter condition can occur in spite of AC, e.g., when traffic is rerouted due to network failures. This survey gives an introduction to PCN and is a primer for this new technology. It presents and discusses the multitude of architectural design options in an early stage of the standardization process in a comprehensive and streamlined way before only a subset of them is standardized by the IETF. It brings PCN from the IETF to the research community and serves as historical record. © 2005 IEEE.
Arshad K.,University of Surrey |
Briggs K.,BT Research |
Moessner K.,University of Surrey
ACM International Conference Proceeding Series | Year: 2011
Spectrum sensing, in particular, detecting the presence of incumbent users in licensed spectrum, is one of the pivotal task for cognitive radios (CRs). In this paper, we provide solutions to the spectrum sensing problem by using statistical test theory, and thus derive novel spectrum sensing approaches. We apply the classical Kolmogorov-Smirnov (KS) test to the problem of spectrum sensing under the assumption that the noise probability distribution is known. In practice, the exact noise distribution is unknown, so a sensing method for Gaussian noise with unknown noise power is proposed. Next it is shown that the proposed sensing scheme is asymptotically robust and can be applied to non- Gaussian noise distributions. We compare the performance of sensing algorithms with the well-known Energy Detector (ED) and Anderson-Darling (AD) sensing proposed in recent literature. Our paper shows that proposed sensing methods outperform both ED and AD based sensing especially for the most important case when the received Signal to Noise Ratio (SNR) is low. © 2011 ACM.
Lesaint D.,BT Research |
Mehta D.,University College Cork |
O'Sullivan B.,University College Cork |
Quesada L.,University College Cork |
Wilson N.,University College Cork
Journal of Artificial Intelligence Research | Year: 2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to f find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem. © 2010 AI Access Foundation.
Khan B.,BT Research |
Goodman D.,University of Manchester |
Khan S.,Solarflare Communications |
Toms W.,University of Manchester |
And 3 more authors.
Journal of Supercomputing | Year: 2015
To harness the compute resource of many-core system with tens to hundreds of cores, applications have to expose parallelism to the hardware. Researchers are aggressively looking for program execution models that make it easier to expose parallelism and use the available resources. One common approach is to decompose a program into parallel ‘tasks’ and allow an underlying system layer to schedule these tasks to different threads. Software-only schedulers can implement various scheduling policies and algorithms that match the characteristics of different applications and programming models. Unfortunately with large-scale multi-core systems, software schedulers suffer significant overheads as they synchronize and communicate task information over deep cache hierarchies. To reduce these overheads, hardware-only schedulers like Carbon have been proposed to enable task queuing and scheduling to be done in hardware. This paper presents a hardware scheduling approach where the structure provided to programs by task-based programming models can be incorporated into the scheduler, making it aware of a task’s data requirements. This prior knowledge of a task’s data requirements allows for better task placement by the scheduler which result in a reduction in overall cache misses and memory traffic, improving the program’s performance and power utilization. Simulations of this technique for a range of synthetic benchmarks and components of real applications have shown a reduction in the number of cache misses by up to 72 and 95 % for the L1 and L2 caches, respectively, and up to 30 % improvement in overall execution time against FIFO scheduling. This results not only in faster execution and in less data transfer with reductions of up to 50 %, allowing for less load on the interconnect, but also in lower power consumption. © 2015, Springer Science+Business Media New York.
Kuhlewind M.,ETH Zurich |
Wagner D.P.,University of Stuttgart |
Espinosa J.M.R.,University of Stuttgart |
Briscoe B.,BT Research
2014 IEEE Globecom Workshops, GC Wkshps 2014 | Year: 2014
Data Center TCP (DCTCP) is an Explicit Congestion Notification (ECN)-based congestion control and Active Queue Management (AQM) scheme. It has provoked widespread interest because it keeps queuing delay and delay variance very low. There is no theoretical reason why Data Center TCP (DCTCP) cannot scale to the size of the Internet, resulting in greater absolute reductions in delay than achieved in data centres. However, no way has yet been found for DCTCP traffic to coexist with conventional TCP without being starved. This paper introduces a way to deploy DCTCP incrementally on the public Internet that could solve this coexistence problem. Using the widely deployed Weighted Random Early Detection (WRED) scheme, we configure a second AQM that is applied solely to ECN-capable packets. We focus solely on long-running flows, not because they are realistic, but as the critical gating test for whether starvation can occur. For the non-ECN traffic we use TCP New Reno; again not to seek realism, but to check for safety against the prevalent reference. We report the promising result that, not only does the proposed AQM always avoid starvation, but it can also achieve equal rates. We even derived how the sharing ratio between DCTCP and conventional TCP traffic depends on the various AQM parameters. The next step beyond this gating test will be to quantify the reduction in queuing delay and variance in dynamic scenarios. This will support the standardization process needed to define new ECN semantics for DCTCP deployment that the authors have started at the IETF. © 2014 IEEE.
Zahemszky A.,Ericsson AB |
Gajic B.,RWTH Aachen |
Esteve Rothenberg C.,University of Campinas |
Reason C.,BT Research |
And 4 more authors.
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST | Year: 2011
Testing and evaluating new architectural propositions is a challenge. Given the usual variety of technologies and scales involved in the necessary evaluation, a one-size-fits-all approach does hardly suffice. Instead, a collection of evaluation and experimentation methods must be chosen for a comprehensive testing of the proposed solutions. This paper outlines some of the approaches chosen for an architectural proposition that establishes a publish/ subscribe-based internetworking layer for the Future Internet. For that, we outline challenges we identified when turning to experimentation as a means of evaluation. We then present the variety of emulation as well as experimental test bed efforts that attempt to address these challenges. While this is not to be seen as a conclusive summary of experimental research in this space, it is an attempt to summarize our efforts as a work-of-progress for others working the architectural field. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2011.
Menth M.,University of Tübingen |
Briscoe B.,BT Research |
IEEE Communications Magazine | Year: 2012
Admission control is a well-known technique to explicitly admit or block new flows in order to keep a network's traffic load at a moderate level and to guarantee QoS for admitted flows. Flow termination is a new flow control function that terminates some admitted flows when the network capacity does not suffice, such as in the case of unexpected failures. Admission control and flow termination are useful to protect QoS for inelastic flows that require a minimum bit rate. Examples are real-time applications like voice and video. Precongestion notification (PCN) provides feedback about load conditions on the path to boundary nodes. They use this information to implement lightweight admission control and flow termination without per-flow state on interior nodes of a domain. These mechanisms are significantly simpler than explicit reservation schemes. In the context of DiffServ, IP, MPLS, and Ethernet networks, we explain the concept of PCN-based admission control and flow termination, present recent standards of the IETF, and discuss benefits and limitations. © 2012 IEEE.
Paverd A.J.,University of Oxford |
El-Moussa F.,BT Research |
Brown I.,University of Oxford
UbiComp 2014 - Adjunct Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing | Year: 2014
The Personal Network (PN) is a logical network of interconnected components used by an individual. It encompasses the home network, the Personal Area Network (PAN), and the Vehicular Area Network (VAN) and includes cloud-based services. Previous security analyses, including ITU-T Recommendation X.1111, have focussed on the individual physical networks rather than the PN itself. By consolidating and structuring previous work, we propose an updated and enhanced security analysis for the PN. In our characteristic-based approach we identify the primary characteristics of the PN and its components and use these to develop an abstract PN asset model. From this, we derive the main attacker objectives and a list of attack vectors through which these could be achieved. We propose a mapping between the attack vectors and the PN component characteristics that can be used to determine the specific attacks to which a particular component is vulnerable. In this paper, we present a summary of this analysis and discuss its usage. Copyright 2014 ACM.
Le M.,Bournemouth University |
Nauck D.,BT Research |
Gabrys B.,Bournemouth University
CEUR Workshop Proceedings | Year: 2013
Large service companies like telecommunication businesses run complex customer service processes in order to provide communication services to their customers. The flawless execution of these processes is essential since customer service is an important differentiator for these companies. They must also be able to predict if processes will complete successfully or run into exceptions in order to intervene at the right time, pre-empt problems and maintain customer service. Business process data is sequential in nature and can be very diverse. Thus, there is a need for an efficient sequential forecasting methodology that can cope with the diversity of the business data. In response to these requirements, in this paper we propose an approach which is a combination of KNN (K nearest neighbour) and sequence alignment for predicting process outcome. The proposed approach exploits temporal categorical features of the extracted data to predict the process outcomes using sequence alignment technique, and also addresses the diversity aspect of the data by considering subsets of similar process sequences, based on KNNs. We have shown, via a set of experiments, that our model offers better results when compared with original KNNs and random guess-based methods. We also introduce a rule based technique based on GOSPADE, which detects the repetitions of individual tasks and investigates the relationship between them and the process failure. The results are demonstrated in a comprehensive performance study on real business process data sets.
Burbridge T.,BT Research |
Soppera A.,BT Research
RFID 2010: International IEEE Conference on RFID | Year: 2010
The use of RFID tags allows many new approaches to the old problems of supply chain control and product anti-counterfeiting. Many of the schemes suggested to-date do not adequately meet the needs of the supply chain industry. Some require unjustifiable expense or performance and resilience issues, while others face deployment barriers where the party that deploys the technology is not the party the benefits. Many of the schemes, however, will ultimately fail because they inadequately address the issues of trust and business confidentiality. We present a supply chain control solution using the principle of proxy re-signatures to establish secure and verifiable supply chain paths. Critically our scheme does not require centralized run-time services and provides minimal visibility of supply chain operations to other parties. ©2010 IEEE.