59 research outputs found
Revisiting Resource Pooling: The Case for In-Network Resource Sharing.
We question the widely adopted view of in-network caches acting as temporary storage for the most popular content in Information-Centric Networks (ICN). Instead, we propose that in-network storage is used as a place of temporary custody for incoming content in a store and forward manner. Given this functionality of in-network storage, senders push content into the network in an open-loop manner to take advantage of underutilised links. When content hits the bottleneck link it gets re-routed through alternative uncongested paths. If alternative paths do not exist, incoming content is temporarily stored in in-network caches, while the system enters a closed-loop, back-pressure mode of operation to avoid congestive collapse.
Our proposal follows in spirit the resource pooling principle, which, however, is restricted to end-to-end resources and paths. We extend this principle to also take advantage of in-network resources, in terms of multiplicity of available sub-paths (as compared to multihomed users only) and in-network cache space. We call the proposed principle In-Network Resource Pooling Principle (INRPP). Using the INRPP, congestion, or increased contention over a link, is dealt with locally in a hop-by-hop manner, instead of end-to-end. INRPP utilises resources throughout the network more efficiently and opens up new directions for research in the multipath routing and congestion control areas
Cooperative resource pooling in multihomed mobile networks
The ubiquity of multihoming amongst mobile devices presents a unique opportunity for users to co-operate, sharing their available Internet connectivity, forming multihomed mobile networks on demand. This model provides users with vast potential to increase the quality of service they receive. Despite this, such mobile networks are typically underutilized and overly restrictive, as additional Internet connectivity options are predominantly ignored and selected gateways are both immutable and incapable of meeting the demand of the mobile network. This presents a number of research challenges, as users look to maximize their quality of experience, while balancing both the financial cost and power consumption associated with utilizing a diverse set of heterogeneous Internet connectivity options. In this thesis we present a novel architecture for mobile networks, the contribution of which is threefold. Firstly, we ensure the available Internet connectivity is appropriately advertised, building a routing overlay which allows mobile devices to access any available network resource. Secondly, we leverage the benefits of multipath communications, providing the mobile device with increased throughput, additional resilience and seamless mobility. Finally, we provide a multihomed framework, enabling policy driven network resource management and path selection on a per application basis. Policy driven resource management provides a rich and descriptive approach, allowing the context of the network and the device to be taken into account when making routing decisions at the edge of the Internet. The aim of this framework, is to provide an efficient and flexible approach to the allocation of applications to the optimal network resource, no matter where it resides in a mobile network. Furthermore, we investigate the benefits of path selection, facilitating the policy framework to choose the optimal network resource for specific applications. Through our evaluation, we prove that our approach to advertising Internet connectivity in a mobile network is both efficient and capable of increasing the utilization of the available network capacity. We then demonstrate that our policy driven approach to resource management and path selection can further improve the userâs quality of experience, by tailoring network resource usage to meet their specific needs
Network-based IP flow mobility support in 3GPPs evolved packet core
Includes bibliographical references.Mobile data traffic in cellular networks has increased tremendously in the last few years. Due to the costs associated with licensed spectrum, Mobile Network Operators (MNOs) are battling to manage these increased traffic growths. Offloading mobile data traffic to alternative low cost access networks like Wi-Fi has been proposed as a candidate solution to enable MNOs to alleviate congestion from the cellular networks. This dissertation investigates an offloading technique called IP flow mobility within the 3rd Generation Partnership Project (3GPP) all-IP mobile core network, the Evolved Packet Core (EPC). IP flow mobility would enable offloading a subset of the mobile userâs traffic to an alternative access network while allowing the rest of the end-userâs traffic to be kept in the cellular access; this way, traffic with stringent quality of service requirements like Voice over Internet Protocol (VoIP) would not experience service disruption or interruption when offloaded. This technique is different from previous offloading techniques where all the end-userâs traffic is offloaded. IP flow mobility functionality can be realised with either host- or network-based mobility protocols. The recommended IP flow mobility standard of 3GPP is based on the host-based mobility solution, Dual-Stack Mobile IPv6. However, host-based mobility solutions have drawbacks like long handover latencies and produce signaling overhead in the radio access networks, which could be less appealing to MNOs. Network-based mobility solutions, compared to the host-based mobility solutions, have reduced handover latencies with no signaling overhead occurring in the radio access network. Proxy Mobile IPv6 is a networkbased mobility protocol adapted by 3GPP for mobility in the EPC. However, the standardisation of the Proxy Mobile IPv6-based IP flow mobility functionality is still ongoing within 3GPP. A review of related literature and standardisation efforts reveals shortcomings with the Proxy Mobile IPv6 mobility protocol in supporting IP flow mobility. Proxy Mobile IPv6 does not have a mechanism that would ensure session continuity during IP flow handoffs or a mechanism enabling controlling of the forwarding path of a particular IP flow i.e., specifying the access network for the IP flow. The latter mechanism is referred to as IP flow information management and flow-based routing. These mechanisms represent the basis for enabling the IP flow mobility functionality. To address the shortcomings of Proxy Mobile IPv6, this dissertation proposes vi enhancements to the protocol procedures to enable the two mechanisms for IP flow mobility functionality. The proposed enhancements for the session continuity mechanism draw on work in related literature and the proposed enhancements for the IP flow information management and flow-based routing mechanism are based on the concepts used in the Dual- Stack Mobile IPv6 IP flow mobility functionality. Together the two mechanisms allow the end-user to issue requests on what access network a particular IP flow should be routed, and ensure that the IP flows are moved to the particular access network without session discontinuity
Recommended from our members
Design of interface selection protocols for multi-homed wireless networks
This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University on 10 December 2010.The IEEE 802.11/802.16 standards conformant wireless communication stations have multi-homing transmission capability. To achieve greater communication efficiency, multi-homing capable stations use handover mechanism to select appropriate transmission channel according to variations in the channel quality. This thesis presents three internal-linked handover schemes, (1) Interface Selection Protocol (ISP), belonging to Wireless Local Area Network (WLAN)- Worldwide Interoperability for Microwave Access (WiMAX) environment (2) Fast Channel Scanning (FCS) and (3) Traffic Manager (TM), (2) and (3) belonging to WiMAX Environment. The proposed schemes in this thesis use a novel mechanism of providing a reliable communication route. This solution is based on a cross-layer communication framework, where the interface selection module uses various network related parameters from Medium Access Control (MAC) sub-layer/Physical Layer (PHY) across the protocol suite for decision making at the Network layer. The proposed solutions are highly responsive when compared with existing multi-homed schemes; responsiveness is one of the key factors in the design of such protocols. Selected route under these schemes is based on the most up to date link-layer information. Therefore, such a route is not only reliable in terms of route optimization but it also fulfils the application demands in terms of throughput and delay. Design of ISP protocol use probing frames during the route discovery process. The 802.11 mandates the use of different rates for data transmission frames. The ISP-metric can be incorporated into various routing aspects and its applicability is determined by the possibility of provision of MAC dependent parameters that are used to determine the best path metric values. In many cases, higher device density, interference and mobility cause variable medium access delays. It causes creation of âunreachable zonesâ, where destination is marked as unreachable. However, by use of the best path metric, the destination has been made reachable, anytime and anywhere, because of the intelligent use of the probing frames and interface selection algorithm implemented. The IEEE 802.16e introduces several MAC level queues for different access categories, maintaining service requirement within these queues; which imply that frames from a higher priority queue, i.e. video frames, are serviced more frequently than those belonging to lower priority queues. Such an enhancement at the MAC sub-layer introduces uneven queuing delays. Conventional routing protocols are unaware of such MAC specific constraints and as a result, these factors are not considered which result in channel performance degradation. To meet such challenges, the thesis presents FCS and TM schemes for WiMAX. For FCS, Its solution is to improve the mobile WiMAX handover and address the scanning latency. Since minimum scanning time is the most important issue in the handover process. This handover scheme aims to utilize the channel efficiently and apply such a procedure to reduce the time it takes to scan the neighboring access stations. TM uses MAC and physical layer (PHY) specific information in the interface metric and maintains a separate path to destination by applying an alternative interface operation. Simulation tests and comparisons with existing multi-homed protocols and handover schemes demonstrate the effectiveness of incorporating the medium dependent parameters. Moreover, show that suggested schemes, have shown better performance in terms of end-to-end delay and throughput, with efficiency up to 40% in specific test scenarios
Wide area network autoscaling for cloud applications
Modern cloud orchestrators like Kubernetes provide a versatile and robust way to host applications at scale. One of their key features is autoscaling, that automatically adjusts cloud resources (compute, memory, storage) in order to dynamically adapt to the demands of the application. However, the scope of cloud autoscaling is limited to the datacenter hosting the cloud and it doesn't apply uniformly to the allocation of network resources. In I/O-constrained or data-in-motion use cases this can lead to severe performance degradation for the application. For example, when the load on a cloud service increases and the Wide Area Network (WAN) connecting the datacenter to the Internet becomes saturated, the application experiences an increase in delay and loss. In many cases this is dealt by overprovisioning network capacity, which introduces significant additional costs and inefficiencies. On the other hand, thanks to the concept of "Network as Code", the WAN today exposes a programmable set ofAPIs that can be used to dynamically allocate and deallocate capacity on-demand. In this paper we propose extending the concept of cloud autoscaling into the network to address this limitation. This way, applications running in the cloud can communicate their networking requirements, like bandwidth or traffic profile, to an SDN controller or Network as a Service (NaaS) platform. Moreover, we aim to define the concepts of vertical and horizontal autoscaling applied to networking. We present a prototype that automatically allocates bandwidth in the underlay of an SD-WAN, according to the requirements of the applications hosted in Kubernetes. Finally, we discuss open research challenges
Energy-efficient and lifetime aware routing in WSNs
Network lifetime is an important performance metric in Wireless Sensor Networks (WSNs). Transmission Power Control (TPC) is a well-established method to minimise energy consumption in transmission in order to extend node lifetime and, consequently, lead to solutions that help extend network lifetime. The accurate lifetime estimation of sensor nodes is useful for routing to make more energy-efficient decisions and prolong lifetime. This research proposes an Energy-Efficient TPC (EETPC) mechanism using the measured Received Signal Strength (RSS) to calculate the ideal transmission power. This includes the investigation of the impact factors on RSS, such as distance, height above ground, multipath environment, the capability of node, noise and interference, and temperature. Furthermore, a Dynamic Node Lifetime Estimation (DNLE) technique for WSNs is also presented, including the impact factors on node lifetime, such as battery type, model, brand, self-discharge, discharge rate, age, charge cycles, and temperature. In addition, an Energy-Efficient and Lifetime Aware Routing (EELAR) algorithm is designed and developed for prolonging network lifetime in multihop WSNs. The proposed routing algorithm includes transmission power and lifetime metrics for path selection in addition to the Expected Transmission Count (ETX) metric.
Both simulation and real hardware testbed experiments are used to verify the effectiveness of the proposed schemes. The simulation experiments run on the AVRORA simulator for two hardware platforms: Mica2 and MicaZ. The testbed experiments run on two real hardware platforms: the N740 NanoSensor and Mica2. The corresponding implementations are on two operating systems: Contiki and TinyOS. The proposed TPC mechanism covers those investigated factors and gives an overall performance better than the existing techniques, i.e. it gives lower packet loss and power consumption rates, while delays do not significantly increase. It can be applied for single-hop with multihoming and multihop networks. Using the DNLE technique, node lifetime can be predicted more accurately, which can be applied for both static and dynamic loads. EELAR gives the best performance on packet loss rate, average node lifetime and network lifetime compared to the other algorithms and no significant difference is found between each algorithm with the packet delay
Incentive-driven QoS in peer-to-peer overlays
A well known problem in peer-to-peer overlays is that no single entity has control over the software,
hardware and configuration of peers. Thus, each peer can selfishly adapt its behaviour to maximise its
benefit from the overlay. This thesis is concerned with the modelling and design of incentive mechanisms
for QoS-overlays: resource allocation protocols that provide strategic peers with participation incentives,
while at the same time optimising the performance of the peer-to-peer distribution overlay.
The contributions of this thesis are as follows. First, we present PledgeRoute, a novel contribution
accounting system that can be used, along with a set of reciprocity policies, as an incentive mechanism
to encourage peers to contribute resources even when users are not actively consuming overlay services.
This mechanism uses a decentralised credit network, is resilient to sybil attacks, and allows peers to
achieve time and space deferred contribution reciprocity. Then, we present a novel, QoS-aware resource
allocation model based on Vickrey auctions that uses PledgeRoute as a substrate. It acts as an incentive
mechanism by providing efficient overlay construction, while at the same time allocating increasing
service quality to those peers that contribute more to the network. The model is then applied to lagsensitive
chunk swarming, and some of its properties are explored for different peer delay distributions.
When considering QoS overlays deployed over the best-effort Internet, the quality received by a
client cannot be adjudicated completely to either its serving peer or the intervening network between
them. By drawing parallels between this situation and well-known hidden action situations in microeconomics,
we propose a novel scheme to ensure adherence to advertised QoS levels. We then apply
it to delay-sensitive chunk distribution overlays and present the optimal contract payments required,
along with a method for QoS contract enforcement through reciprocative strategies. We also present a
probabilistic model for application-layer delay as a function of the prevailing network conditions.
Finally, we address the incentives of managed overlays, and the prediction of their behaviour. We
propose two novel models of multihoming managed overlay incentives in which overlays can freely
allocate their traffic flows between different ISPs. One is obtained by optimising an overlay utility
function with desired properties, while the other is designed for data-driven least-squares fitting of the
cross elasticity of demand. This last model is then used to solve for ISP profit maximisation
- âŚ