@inproceedings{brampton2005sdh,
       booktitle = {ACM Conference on Emerging Network Experiments and Technology (CoNEXT) (Student Workshop Session)},
           month = {October},
           title = {Stealth Distributed Hash Table: Unleashing the Real Potential of Peer-to-Peer},
          author = {Andrew Brampton and Andrew MacQuire and Idris Rai and Nicholas J. P. Race and Laurent Mathy},
            year = {2005},
             url = {http://eprints.comp.lancs.ac.uk/1199/}
}

@inproceedings{macquire2006pas,
       booktitle = {3rd International Workshop on Mobile Peer-to-Peer Computing (MP2P)},
           month = {March},
           title = {Performance Analysis of Stealth DHT with Mobile Nodes},
          author = {Andrew MacQuire and Andrew Brampton and Idris Rai and Laurent Mathy},
            year = {2006},
           pages = {184--189},
             url = {http://eprints.comp.lancs.ac.uk/1248/},
        abstract = {The advances in wireless networking and the consequent
emergence of new applications that wireless networks increasingly
support inevitably leads to low capability mobile
nodes connecting to peer-to-peer networks. However, the
characteristics of mobile nodes and limitations of access
point coverage often cause mobile nodes to lose connectivity,
which can cause many mobile nodes to simultaneously
rejoin the network. Continuous departures and joins due
to the mobility of nodes leads to mobility churn, which can
often degrade the performance of the underlying peer-topeer
network significantly. In this paper, we use simulations
to demonstrate that the Stealth Distributed Hash Table
(Stealth DHT) algorithm is ideally suited for networks
with mobile nodes. By avoiding storing state in unreliable
nodes, a Stealth DHT prevents mobile nodes from being
used by other nodes to provide services. Consequently,
Stealth DHTs eliminate the mobility churn effect and significantly
reduce the amount of overhead as compared to a
generic DHT. This paper demonstrates this using simulation
results that compare the performance of Stealth DHTs
to a generic DHT, Pastry.}
}

@inproceedings{macquire2006asd,
       booktitle = {32nd Euromicro Conference on Software Engineering and Advanced Applications},
           month = {August},
           title = {Authentication in Stealth Distributed Hash Tables},
          author = {Andrew MacQuire and Andrew Brampton and Idris Rai and Nicholas J. P. Race and Laurent Mathy},
            year = {2006},
             url = {http://eprints.comp.lancs.ac.uk/1297/},
        abstract = {Most existing DHT algorithms assume that all nodes
have equal capabilities. This assumption has previously
been shown to be untrue in real deployments, where the
heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that
nodes on the same overlay may also differ in terms of their
trustworthiness. However, implementing and enforcing security policies in a network where all nodes are treated
equally is a non-trivial task. We therefore extend our previous work on Stealth DHTs to consider the differentiation of nodes based on their trustworthiness rather than their capabilities alone.}
}

@inproceedings{brampton2006sdh,
       booktitle = {2nd Conference on Future Networking Technologies (CoNEXT)},
           month = {December},
           title = {Stealth Distributed Hash Table: A Robust and Flexible Super-Peered DHT},
          author = {Andrew Brampton and Andrew MacQuire and Idris Rai and Nicholas J. P. Race and Laurent Mathy},
            year = {2006},
             url = {http://eprints.comp.lancs.ac.uk/830/},
        abstract = {Most Distributed Hash Tables (DHTs) simply consider interconnecting
homogeneous nodes on the same overlay. However,
realistically nodes on a network are heterogeneous
in terms of their capabilities. Because of this, traditional
DHTs have been shown to exhibit poor performance in a
real-world environment. Additionally, we believe that it is
this approach that contributes to a limited exploitation of
peer-to-peer technologies. Previous work on super-peers in
DHTs was proposed to address these performance issues,
however the strategy used is often based on locally clustering peers around individual super-peers. This method of superpeering, however, compromises fundamental features such as load-balancing, resilience and routing efficiency, which traditional DHTs originally promised to offer. We propose a Stealth DHT which addresses the deficiencies
of previous super-peer approaches by using the DHT algorithm itself to select the most appropriate super-peer for each message sent by peers. Through simulations and measurements, we show the fitness for purpose of our proposal.}
}

@inproceedings{rai2007pmp,
       booktitle = {4th International Workshop on Peer-to-Peer Systems (HOTP2P)},
           month = {March},
           title = {Performance Modelling of Peer-to-Peer Routing},
          author = {Idris Rai and Andrew Brampton and Andrew MacQuire and Laurent Mathy},
            year = {2007},
             url = {http://eprints.comp.lancs.ac.uk/1344/},
        abstract = {We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well as a Stealth DHT adaptation of Pastry to compute their exact expressions for average number of lookup hops. We show that our analytical models match with the protocols? simulation results almost perfectly, making them ideal for rapid evaluation.}
}

@inproceedings{brampton2007cui,
       booktitle = {International workshop on Network and Operating Systems Support for Digital Audio \& Video (NOSSDAV)},
           title = {Characterising User Interactivity for Sports Video-on-Demand},
          author = {Andrew Brampton and Andrew MacQuire and Idris Rai and Nicholas J. P. Race and Laurent Mathy and Michael Fry},
             url = {http://eprints.comp.lancs.ac.uk/1464/},
            year = {2007},
           month = {June},
        abstract = {This paper presents a detailed characterisation of user behaviour for a series of interactive sport videos from the 2006 FIFA World Cup. In addition to generic VCR-like features, our custom-built Video-on-Demand architecture enabled us to provide advanced interactivity features such as bookmarking.
We illustrate how such functionality may have a dramatic impact on how users consume content. A detailed discussion is also provided on how content distributors may turn this knowledge to their advantage, and thus increase the efficiency of their delivery networks.}
}

@article{macquire2008asd,
           title = {Authentication in stealth distributed hash tables},
         journal = {Journal of Systems Architecture},
          volume = {54},
          number = {6},
           pages = {607 - 618},
            year = {2008},
            note = {Selection of best papers from the 32nd EUROMICRO Conference on [`]Software Engineering and Advanced Applications' (SEAA 2006)},
            issn = {1383-7621},
             doi = {DOI: 10.1016/j.sysarc.2008.01.004},
             url = {http://www.sciencedirect.com/science/article/B6V1F-4RRFNJ5-2/2/52b536d2a682f07d8f6ae7b74f474390},
          author = {Andrew MacQuire and Andrew Brampton and Idris A. Rai and Nicholas J.P. Race and Laurent Mathy},
        keywords = {Distributed hash table},
        keywords = {Peer-to-peer},
        keywords = {Security},
        keywords = {Public key infrastructure},
        keywords = {Stealth DHT}
}

@article{brampton2008cew,
           title = {Characterising and Exploiting Workloads of Highly Interactive Video-on-Demand},
          author = {Andrew Brampton and Andrew MacQuire and Michael Fry and Idris Rai and Nicholas J. P. Race and Laurent Mathy},
       publisher = {Springer-Verlag},
            year = {2008},
         journal = {Multimedia Systems Journal},
             url = {http://eprints.comp.lancs.ac.uk/1465/},
        abstract = {This paper presents a detailed characterisation of user behaviour for a series of interactive video experiments over a 12 month period, in which we served popular sporting and musical content. In addition to generic VCR-like features, our custom-built Video-on-Demand application provides advanced interactivity features such as bookmarking. The dramatic impact of such functionality on how users consume content is studied and analysed. We discuss in detail how
this user behaviour can be exploited by content distributors to improve user experience. Specifically, we study how simple dynamic bookmark placement and interactivity-aware content pre-fetching and replication can reduce the impact of highly interactive media on CDN performance.}
}

@inproceedings{macquire2008acf,
       booktitle = {International workshop on Future Multimedia Networking (FMN)},
           title = {A Case for Hybrid Content Distribution for Interactive Video-on-Demand},
          author = {Andrew MacQuire and Andrew Brampton and Michael Fry and Nicholas Race and Laurent Mathy},
            year = {2008},
           month = {September},
}

@inproceedings{faulkner2009epn,
       booktitle = {International Conference on Advanced Information Networking and Applications (AINA)},
           title = {Evaluating the Performance of Network Protocol Processing on Multi-core Systems},
          author = {Matthew Faulkner and Andrew Brampton and Stephen Pink},
            year = {2009},
           month = {May},
}

@inproceedings{jakeman2009fna,
       booktitle = {FutureNet II - Second international workshop on the network of the future in conjunction with IEEE Globecom},
           title = {Facilitating Network Auto Configuration In Next Generation Internet Protocols},
          author = {Matthew Jakeman and Andrew Brampton and Stephen Pink},
            year = {2009},
           month = {December},
}

@phdthesis{brampton2008thesis,
          author = {Andrew Brampton},
           title = {The Impact of Highly Interactive Workloads on Video-on-Demand Systems},
          school = {Lancaster University, UK},
            year = {2008},
}