In-network caching necessitates the transformation of centralised operations of traditional, overlay caching techniques to a decentralised and uncoordinated environment. Given that caching capacity in routers is relatively small in comparison to the amount of forwarded content, a key aspect is balanced distribution of content among the available caches. In this paper, we are concerned with decentralised, real-time distribution of content in router caches. Our goal is to reduce caching redundancy and in turn, make more efficient utilisation of available cache resources along a delivery path.Our in-network caching scheme, called ProbCache, approximates the caching capability of a path and caches contents probabilistically in order to: i) leave caching space for other flows sharing (part of) the same path, and ii) fairly multiplex contents of different flows among caches of a shared path.We compare our algorithm against universal caching and against schemes proposed in the past for Web-Caching architectures, such as Leave Copy Down (LCD). Our results show reduction of up to 20% in server hits, and up to 10% in the number of hops required to hit cached contents, but, most importantly, reduction of cache-evictions by an order of magnitude in comparison to universal caching.

Abstract. Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received widespread research interest. In one of the key relevant proposals known as Networking Named Content (NNC), the premise is that leveraging in-network caching to store content in every node it traverses along the delivery path can enhance content delivery. We question such indiscriminate universal caching strategy and investigate whether caching less can actually achieve more. Specifically, we investigate if caching only in a subset of node(s) along the content delivery path can achieve better performance in terms of cache and server hit rates. In this paper, we first study the behavior of NNC's ubiquitous caching and observe that even naïve random caching at one intermediate node within the delivery path can achieve similar and, under certain conditions, even better caching gain. We propose a centrality-based caching algorithm by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy. Our results suggest that our solution can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.Keywords: Information-centric networking, caching, betweenness centrality. IntroductionInformation-centric networking (ICN) has recently attracted significant attention, with various research initiatives (e.g.,[4] and COMET [5]) targetting this emerging research area. The main reasoning for advocating the departure from the current host-to-host communications paradigm to an information/content-centric one is that the Internet is currently mostly used for content access and delivery, with a high volume of digital content (e.g., 3D/HD movies, photos etc.) delivered to users who are only interested in the actual content rather than the source location. As such, we no longer need a natively supported content distribution framework. While the Internet was designed for and still focuses on host-to-host communication, ICN shifts the emphasis to content objects that can be cached and accessed from anywhere within the network rather than from the end hosts only. In ICN, content names are decoupled from host addresses, effectively separating the role of identifier and locator in distinct contrast to current IP addresses which are serving both purposes. Naming content directly enables the exploitation of in-network caching in order to improve delivery of popular content. Each content object can now be uniquely identified and authenticated without being associated to a specific host. This enables application-independent caching of content pieces that can be re-used by other end users requesting the same content. In fact, one of the salient ICN features is in-network caching, with potentially every network element (i.e., router) caching all content fragments 1 that traverse it; in this context, if a matching request is recei...

Traffic engineering is an important mechanism for Internet network providers seeking to optimize network performance and traffic delivery. Routing optimization plays a key role in traffic engineering, finding efficient routes so as to achieve the desired network performance. In this survey we review Internet traffic engineering from the perspective of routing optimization. A taxonomy of routing algorithms in the literature is provided, dating from the advent of the TE concept in the late 1990s. We classify the algorithms into multiple dimensions: unicast/multicast, intra-/interdomain, IP-/MPLS-based and offline/online TE schemes. In addition, we investigate some important traffic engineering issues, including robustness, TE interactions, and interoperability with overlay selfish routing. In addition to a review of existing solutions, we also point out some challenges in TE operation and important issues that are worthy of investigation in future research activities.

Total knee arthroplasty (TKA) and total hip arthroplasty (THA) are recognised and proven interventions for patients with advanced arthritis. Studies to date have demonstrated a steady increase in the requirement for primary and revision procedures. Projected estimates made for the United States show that by 2030 the demand for primary TKA will grow by 673% and for revision TKA by 601% from the level in 2005. For THA the projected estimates are 174% and 137% for primary and revision surgery, respectively. The purpose of this study was to see if those predictions were similar for England and Wales using data from the National Joint Registry and the Office of National Statistics. Analysis of data for England and Wales suggest that by 2030, the volume of primary and revision TKAs will have increased by 117% and 332%, respectively between 2012 and 2030. The data for the United States translates to a 306% cumulative rate of increase between 2012 and 2030 for revision surgery, which is similar to our predictions for England and Wales. The predictions from the United States for primary TKA were similar to our upper limit projections. For THA, we predicted an increase of 134% and 31% for primary and revision hip surgery, respectively. Our model has limitations, however, it highlights the economic burden of arthroplasty in the future in England and Wales as a real and unaddressed problem. This will have significant implications for the provision of health care and the management of orthopaedic services in the future.

Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. It is this caching feature of CCNs that we model and evaluate in this paper. Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.