Search

This work was partially funded by the Government of Thailand through a PhD scholarship for Dr Phoomikiattisak. As the use of mobile devices and methods of wireless connectivity continue to increase, seamless mobility becomes more desirable and important. The current IETF Mobile IP standard relies on additional network entities for mobility management, can have poor performance, and has seen little deployment in real networks. We present a host-based mobility solution with a true end-to-end architecture using the Identifier-Locator Network Protocol (ILNP). We show how the TCP code in the Linux kernel can be extended allowing legacy TCP applications that use the standard C sockets API to operate over ILNP without requiring changes or recompilation. Our direct testbed performance comparison shows that ILNP provides better host mobility support than Mobile IPv6 in terms of session continuity, packet loss, and handoff delay for TCP. Publisher PDF

We provide an empirical evaluation of an IEEE 802.11ac Wireless Local Area Network (WLAN) cell with Multiple User Multiple Input Multiple Output (MU-MIMO) technology. We conducted our experiments on a testbed comprising consumer equipment under different office scenarios using 40MHz and 80MHz channels. This is the first performance study of MU-MIMO with 802.11ac in an operational scenario using a commercial access point. We find that, for clients that do not support MU-MIMO, operating in a cell that has MU-MIMO enabled may result in reduced performance.

D. Phoomikiattisak was funded by the Thai Government. B. Simpson was funded by Cisco Systems under a University Research Programme (URP) grant award. We discuss a key engineering challenge in implementing the Identifier- Locator Network Protocol (ILNP), as described in IRTF Experimental RFCs 6740-6748: enabling legacy applications that use the C sockets API. We have built the first two OS kernel implementations of ILNPv6 (ILNP as a superset of IPv6), in both the Linux OS kernel and the FreeBSD OS kernel. Our evaluation is in comparison with IPv6, in the context of a topical and challenging scenario: host mobility implemented as a purely end-to-end function. Our experiments show that ILNPv6 has excellent potential for deployment using existing IPv6 infrastructure, whilst offering the new properties and functionality of ILNP. Postprint

Seamless host mobility is vital to future network mobility, and has been an active research area for a long time. Much research focuses on the performance of the data plane. In this paper, we present comprehensive analyses on the control (signalling) plane in the IETF Mobile IPv6, and compare it with the IRTF Identifier-Locator Network Protocol (ILNP). The control plane behaviour is important in order to assess the robustness and scalability of the mobility protocol. ILNP has a different mobility model from Mobile IPv6: it isa host-based, end-to-end architecture and does not require additional network-layer entities. Hence, the control signals are exchanged only between the end systems. We provide model-based analyses for handoff signalling, and show that ILNP is more efficient than MIPv6 in terms of robustness and scalability. The analytical models we present could also be adapted for other mobility solutions, for comparative assessment. Postprint

Although there have been a number of performance studies of proactive mobile ad hoc network (MANET) routing protocols, little attention has been paid to the impacts of topology update strategies on routing performance. This paper presents an analysis of several topology update strategies for a proactive MANET routing protocol. The goal of this paper is to better understand how topology update strategies can contribute to topology maintenance in proactive MANETs and thus impact the overall performance, based on simulations involving optimised link state routing (OLSR), a popular MANET protocol. Our contribution includes (1) a quantitative analysis of the impacts of proactive update intervals on the routing performance of OLSR; (2) evaluating the performance of reactive topology updates and proactive updates for OLSR.

In mature wireless LAN (WLAN) deployments, we show that introducing 802.11ac could have little benefit compared to existing 802.11n deployments. Using a testbed with common characteristics for a WLAN deployment, we compare throughput for 802.11ac and 802.11n (in both 5GHz and 2.4GHz bands). We find that 802.11ac has lower throughput than for 802.11n for our testbed configuration. We also provide an evaluation of energy usage for 802.11ac and 802.11n.

Mesh networking has recently received considerable attention, largely as a mechanism for providing enhanced connectivity without the need to install additional expensive infrastructure. It relies on the fact that underutilised local area connectivity can be used to connect constrained devices to those that possess wide-area uplink capabilities. However, at present, proposals for uplink bandwidth sharing are limited by the use of a traditional view of routing in which multiple end-user devices are associated with each individual uplink in such a way that all their off-network traffic is routed through that particular gateway. While this has the merit of simplicity, it is possible for a subset of gateways to be overloaded while others remain underutilised. We propose a new type of local mesh network, called the Coalition Peering Domain, the goal of which is to maximise Internet connectivity dynamically, smoothing out the usage of uplink capacity, albeit at the cost of slightly more complex control and management. Within this paper, we describe three main routing and addressing issues and then propose novel mechanisms that partially address those issues.

Date of Acceptance: 14/07/2014 We present the first results of an implementation of IP-layer soft handoff, based on the Identifier Locator Network Protocol (ILNP). In our testbed experiments, we show minimal gratuitous packet loss in vertical handoff scenarios (WiFi-3G). Unlike the IETF Mobile IP proposals, the ILNP uses a purely end-to-end architecture, and does not require proxies, middleboxes or tunnelling to support mobility. Our testbed is based on an in-kernel implementation using a modified Linux IP stack. Postprint

Network congestion is a fundamental problem facing Internet users today. A network where users are selfish, and thus reluctant to defer to other users, may result in the famous "tragedy of the commons", where, in the absence of controls, a shared resource is overconsumed by individuals who consider only their personal costs and not the cost to society as a whole. In terms of the Internet, the "tragedy" could be viewed as congestive collapse, resulting from overconsumption of the shared network resource. It is important to distinguish congestion pricing from other forms of network pricing. Charging network users for the congestion they cause can lead to more efficient network utilization by forcing them to take social costs into account. In a congestion-pricing framework, the congestion charge would replace usage and QoS charges. Users would pay their ISPs a subscription charge to cover fixed costs and a congestion charge only when appropriate. This pricing scheme is feasible because, in the absence of congestion, the marginal cost of a network link is practically zero. Congestion pricing can also benefit network operators. By indicating the level of congestion and the user tolerance of it in their networks, congestion pricing can inform operators about when to re-provision and increase network capacity.

IP-based networks were never designed for real time traffic, yet QoS support in such networks is needed to accommodate both global use and the more demanding applications now emerging. Changes in packet handling, in particular, will help provide QoS support in IP networks. The article focuses on the issues and principles concerning router modification for IP packet handling.

We present an empirical evaluation of network-layer soft handoff for IP mobility. Such functionality is not currently available for Mobile IP. Our new approach, based on the Identifier Locator Network Protocol (ILNP), requires no additional network entities, such as proxies, and it does not require modification of any routing protocols. Only the communicating hosts need to have their end-system protocol stacks updated so it is incrementally deployable. In our performance evaluation, we find that soft handoff minimises packet loss, with the observed packet loss during handoff being no worse than the natural loss of the end-to-end path.

Widespread use of wireless LAN (WLAN) may soon cause an over-crowding problem in use of the ISM spectrum. One way in which this manifests itself is the low Received Signal Strength Indication (RSSI) at the WLAN stations, impacting performance. Meanwhile, the IEEE 802.11 standard is being evolved and extended, for example with new coding schemes and the 802.11n standard, which makes use of 5GHz and 2.4GHz. An application's performance requirements may dictate the choice of technology determined by RSSI levels. We report on measurements of the upper and lower bounds of performance with good and poor RSSI in 802.11g and 802.11n. We find that in operation under poor (low) RSSI, performance is indeed impacted. In some cases the impact is such that there may be little benefit in using the newer 802.11n over 802.11g.

We demonstrate that in a future converged network scenario, it may be beneficial to allow selection of 802.11 variant based on application requirements. We analyse traces from the campus network from the University of Twente, comprising ~5000 users. We have evaluated a performance envelope derived from testbed experiments for individual IEEE 802.11 variants and compare these with the traffic patterns from the campus network. From our comparison, we find that specific IEEE 802.11 variants (e.g. 802.11g or 802.11n) may be better suited to specific applications, such as video streaming, rather than using a single WLAN standard for all traffic.

802.11 WLAN is a popular choice for wireless access on a range of ICT devices. A growing concern is the increased energy usage of ICT, for reasons of cost and environmental protection. The Power Save Mode (PSM) in 802.11 deactivates the wireless network interface during periods of inactivity. However, applications increasingly use push models, and so devices may be active much of the time. We have investigated the effectiveness of PSM, and considered its impact on performance when a device is active. Rather than concentrate on the NIC, we have taken a system-wide approach, to gauge the impact of the PSM from an application perspective. We experimentally evaluated performance at the packet level and system-wide power usage under various offered loads, controlled by packet size and data rate, on our 802.11n test bed. We have measured the system-wide power consumption corresponding to the individual traffic profiles and have derived application-specific effective energy-usage. We have found that in our scenarios, no significant benefit can be gained from using PSM. Informationstechnologie und Informationsmanagement

We present an experimental evaluation of energy usage and performance in a wireless LAN cell based on a test bed using the 5 GHz ISM band for 802.11a and 802.11n. We have taken an application-level approach, by varying the packet size and transmission rate at the protocol level and evaluating energy usage across a range of application transmission rates using both large and small packet sizes. We have observed that both the application's transmission rate and the packet size have an impact on energy efficiency for transmission in our test bed. We also included in our experiments evaluation of the energy efficiency of emulations of YouTube and Skype flows, and a comparison with Ethernet transmissions. Informationstechnologie und Informationsmanagement

Wireless mobile devices are becoming increasingly prevalent in society. As a result, aggregation of network connectivity through the use of mobile networks is becoming increasingly relevant to service providers as well as for mobile users. The current approach being pursued within the IETF Mobile Extensions for IPv6 (MEXT) WG, is based on the Network Mobility (NEMO) architecture. NEMO uses IP-in-IP tunnelling for providing mobile network capability on an existing IPv6 network. This approach can result in non-optimal routing between source and destination nodes. Other proposals such as OptiNets extend NEMO and try to address issues such as sub-optimal routing. There are alternative approaches also being proposed, such as the Identifier Locator Network Protocol (ILNPv6), which is based on the use of naming, to enable a flexible and integrated mobile network capability based on IPv6.We have conducted a comparative analysis of the cost of providing optimal routing, in terms of packet and bandwidth overhead, based on an emulation, using data from the London Circle Line metropolitan railway as a scenario. Our analysis shows that these different approaches to mobility offer significantly different performance trade-offs in routing for mobile networks, depending on the constraints of the network scenario.

New transport protocols continue to appear as alternatives to the Transmission Control Protocol (TCP). Many of these are designed to address TCP’s inefficiency in operating over paths with a high bandwidth-delay product (BDP). To test these new protocols, especially comparatively, and to understand their interactions, extensions to the ns2 simulator allow real code from the linux kernel to be used within the ns2 simulations. However, how does the performance of such configurations compare to test-bed experiments of the same configuration? Although, anecdotally, there are often comments within the research community about such issues, there are no studies that quantify the differences for a specific protocol suite. Using a simple testbed, we assess four different transport protocols in a comparative study to examine how well ns2 matches reality. Our tests are all conducted at 100Mb/s over a wide range of delay and router buffer conditions: end-to-end delays from 25ms to 400ms, with end-to-end path buffering of 20% to 100% of the BDP. We find that in our simple configuration, there are significant differences in performance between ns2 and the testbed.

Interest continues to grow in alternative transport protocols to the Transmission Control Protocol (TCP). These alternatives include protocols designed to give greater efficiency in high-speed, high-delay environments (so-called high-speed TCP variants), and protocols that provide congestion control without reliability. For the former category, along with the deployed base of ‘vanilla’ TCP – TCP NewReno – the TCP variants BIC and CUBIC are widely used within Linux: for the latter category, the Datagram Congestion Control Protocol (DCCP) is currently on the IETF Standards Track. It is clear that future traffic patterns will consist of a mix of flows from these protocols (and others). So, it is important for users and network operators to be aware of the impact that these protocols may have on users. We show the measurement of fairness in throughput performance of DCCP Congestion Control ID 2 (CCID2) relative to TCP NewReno, and variants Binary Increase Congestion control (BIC), CUBIC and Compound, all in “out-of-the box” configurations. We use a testbed and endto- end measurements to assess overall throughput, and also to assess fairness – how well these protocols might respond to each other when operating over the same end-to-end network path. We find that, in our testbed, DCCP CCID2 shows good fairness with NewReno, while BIC, CUBIC and Compound show unfairness above round-trip times of 25ms.

In Mobile Ad hoc Networks (MANETs), timers have been used widely to maintain routing (state) information. The use of fixed-interval timers is simple to implement but, in practise, may be difficult to configure in dynamic operational environments, and so may give reduced performance in the presence of frequent topology changes. This paper proposes a self-tuning timer approach within a simple control system for MANET routing protocols with the aim of allowing dynamic, autonomic, re-calibration of routing update frequencies. A novel dynamic timer algorithm is presented to automatically tune routing performance by adapting timer intervals to network conditions. Our simulation results have shown that, compared to the default fixed timer approach, the proposed algorithm could effectively improve routing throughput without manual configuration.

Site multi-homing is an important capability in modern military networks. Resilience of a site is greatly enhanced when it has multiple upstream connections to the Global Information Grid, including the global Internet. Similarly, the ability to provide traffic engineering for a site can be important in reducing delays and packet loss over low-bandwidth and/or high-delay uplinks. Current approaches to site multi-homing and site traffic engineering (a) require assistance from a trusted network service provider; (b) inject significant additional routing information into the global Internet routing system. This approach reduces flexibility, does not scale and is a widespread concern today. The proposed Identifier-Locator Network Protocol (ILNP) offers backward compatible extensions for IPv6 to enable a site to (a) use multiple routing prefixes concurrently, without needing to advertise these more-specific site prefixes upstream to the site's service providers; (b) enables edge-site controlled traffic engineering and localised addressing, without breaking end-to-end connectivity. This feature combination provides both multi-homing and traffic engineering capabilities without any adverse impact on the routing system and does not require anything more than unicast routing capability in the provider network. ILNP enables concurrent multi-path transmission for a flow, without requiring multicast routing, to increase flow resilience to path interruptions. This technique has a secondary security benefit of reducing the risk of an adversary successfully blocking an ILNP flow via a Denial-of-Service attack on any single path or single link.

We propose a cross-layer routing protocol for a Code Division Multiple Access (CDMA) Multihop Cellular Network (MCN). In designing the routing protocol for MCN, multiple constraints are imposed on intermediate relay node selection and end-to-end path selection. The constraints on relay nodes include willingness for cooperation, sufficient neighbourhood connectivity and the level of interference offered on the path. Path constraints include end-to-end throughput and end-to-end delay. A facile incentive mechanism is presented to motivate the cooperation between nodes in call forwarding. In addition, we present a route resilience scheme in the event of dynamic call dropping. In particular, a fast neighbour detection scheme for route resilience is proposed. Instead of using periodic HELLO messages as in traditional ad-hoc routing, the proposed neighbour detection scheme adopts an explicit handshake mechanism to reduce neighbour detection latency. We conclude the paper by demonstrating the superior performance of the proposed routing protocol compared with the other well known routing algorithms.

Keeping router buffering low helps minimise delay (as well as keeping router costs low), whilst increasing buffering minimises loss. This is a trade-off for which there is no single `correct' solution. In order to maintain effective throughput for TCP, whilst minimising router buffer requirements, current results suggest that different amounts of buffering are needed depending on the position in the network (e.g., edge or core), and on the relative capacity of ingress and egress links to a router. However, today we have several different variants of TCP in use, and each is designed to have different behaviour especially on paths with high bandwidth-delay product (BDP) values. We use a testbed to investigate the effects of different amounts of `on-path' buffering (OPB) on the performance of four TCP variants - TCP NewReno, BIC, CUBIC, and Compound TCP - over various end-to-end round-trip-times (RTTs). Specifically, we consider how the variants respond when competing for bandwidth on a bottleneck link. We find that overall performance depends on both the RTT and the OPB provision, and that the observed behaviour is not consistent across the range of RTT and OPB values.

An Identifier/Locator addressing scheme can enable a new approach to mobile hosts and mobile networks. Identifier and Locator information is stored in Domain Name System (DNS) Resource Records. In our on-going work using the Identifier-Locator Network Protocol (ILNP), the DNS would be updated with new Locator values as hosts and/or networks move; new sessions would obtain the correct Locator(s) for a mobile host and/or mobile network from the DNS, in much the same way as currently happens for IP address resolution. However, this use of the DNS is not currently required for IP mobility. We examine the potential impact on DNS from using a naming approach to mobility.

There is a growing interest in the use of variants of the Transmission Control Protocol (TCP) in high-speed networks. ns-2 has implementations of many of these high-speed TCP variants, as does Linux. ns-2, through an extension, permits the incorporation of Linux TCP code within ns-2 simulations. As these TCP variants become more widely used, users are concerned about how these different variants of TCP might interact in a real network environment -- how fair are these protocol variants to each other (in their use of the available capacity) when sharing the same network. Typically, the answer to this question might be sought through simulation and/or by use of an experimental testbed. So, we compare with TCP NewReno the fairness of the congestion control algorithms for 5 high-speed TCP variants -- BIC, Cubic, Scalable, High-Speed and Hamilton -- on both ns-2 and on an experimental testbed running Linux. In both cases, we use the same TCP code from Linux. We observe some differences between the behaviour of these TCP variants when comparing the testbed results to the results from ns-2, but also note that there is generally good agreement.

In mobile ad hoc networks (MANETs), timers have been widely used to maintain routing (state) information. The use of fixed-interval timers is simple to implement but, in practise, may be difficult to configure in dynamic operational environments, and so may give reduced performance in the presence of frequent topology changes. This paper proposes a self-tuning timer approach within a simple control system for MANET routing protocols with the aim of allowing dynamic, autonomic, re-calibration of routing update frequencies. A novel dynamic timer algorithm is presented to automatically tune routing performance by adapting timer intervals to network conditions. Our simulation results have shown that, compared to the default fixed timer approach, the proposed algorithm could effectively improve routing throughput without manual configuration.

This paper investigates the route dynamics of shortest-path first (SPF) routing in mobile ad hoc networks (MANETs). In particular, we find, from a statistical analysis of route duration and route change interval, that route dynamics may require complex modelling. Our analysis considers various mobility models, node velocities and node densities of the MANET network. Our findings show that, in a MANET with moderate or high rate of mobility, the route duration could be approximated by an exponential distribution with approximate parameters, while the route duration of specific lengths could not. Our findings suggest that minimum hop-count routing in MANETs may be inappropriate and that further investigation is required in order to develop models that let us understand MANET route dynamics.

We present experimental results evaluating fairness of several proposals to change the TCP congestion control algorithm, in support of operation on high bandwidth-delay- product (BDP) network paths. We examine and compare the fairness of New Reno TCP BIC, cubic, hamilton-TCP, highspeed-TCP and Scalable-TCP. We focus on four different views of fairness: TCP-friendliness RTT-fairness, intra- and inter-protocol fairness.

Rapid and unpredictable topology changes and resource constraints make delivering packets in a MANET (mobile ad hoc network) a challenging task. Routing information has to be updated to reflect the topology changes and maintain the correctness of route selection. On the other hand, the dissemination of control messages has to be optimised for efficient resource usage and to alleviate channel contention problems. To solve this problem, this dissertation focuses on how to automatically tune routing performance for MANETs in terms of packet delivery ratio and control overhead. The impacts of soft state signalling, especially the refresh intervals, are studied under various scenarios. A variety of topology advertisement strategies are presented. Two self-tuning neighbour detection schemes are proposed, the dynamic timer algorithm and the fast neighbour handshake algorithm, in order to enhance routing performance.

The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics about the traffic which is traversing the router. Sampling is commonly applied on routers in order to limit the load incurred by the collection of information that the router has to undertake when evaluating flow information for monitoring purposes. The sampling process in nearly all cases is a deterministic process of choosing 1 in every N packets on a per-interface basis, and then forming the flow statistics based on the collected sampled statistics. Even though this sampling may not be significant for some statistics, such as packet rate, others can be severely distorted. However, it is important to consider the sampling techniques and their relative accuracy when applied to different traffic patterns. In this paper, we assess the performance of the sampling process as used in NetFlow in detail, and we discuss some techniques for the compensation of loss of monitoring detail.

We describe a method for enabling dependable forwarding of messages in untrusted networks. Nodes perform only relatively lightweight operations per message, and only the originator and destination need to trust each other. Whereas existing protocols for dependable communication rely on establishing a verifiable identity for every node, our protocol can operate in networks with unknown or varying membership and with no limits on the creation of new identities. Our protocol supports the maintenance of unlinkability: relays cannot tell whether a given originator and destination are communicating. The destination of each message generates an unforgeable acknowledgement (U-ACK) that allows relays and the originator to verify that the message was delivered unmodified to the destination, but relays do not need to share keys with the originator or destination, or to know their identities. Similarly, the endpoints do not need to know the identities of the relays. U-ACKs can be seen as a building block for dependable communication systems; they enable nodes to measure the level of service provided by their neighbours and optionally to adjust the level of service they provide in return, creating an incentive for nodes to forward messages. Our work is ongoing.

In wireless mission-critical systems, systems may be resource-constrained including limited bandwidth, so minimising protocol overhead, whilst maintaining performance, is important. Proactive MANET routing protocols tend to provide smaller route discovery latency than on-demand protocols because they maintain route information to all the nodes in the network at all time. However, such protocols may impose excessive soft-state routing control overhead which is generated by disseminating periodic update messages. In order to mitigate the side effects of the soft-state control over-heads, we propose two adaptive proactive routing algorithms, namely DT_MIAD and DT_ODPU. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We show through simulations that the proposed adaptive routing algorithms can outperform a traditional proactive routing protocol (OLSR).

This paper presents a fast neighbour detection scheme for a proactive MANET routing protocol. Instead of using periodic HELLO messages, the proposed scheme adopts explicit handshake mechanism to reduce the latency in neighbour detection. In particular, two route handshake options are presented, namely the Broadcast based handshake (BHS) algorithm and Unicast based handshake (UHS) algorithm. Our simulation results show that the proposed scheme improves routing performance, especially in networks with moderate or high mobility. In low-density networks, the unicast option improves the routing throughput significantly without introducing extra control overhead.

This paper presents the design of a scalable decentralized signaling underlay infrastructure, which features a DHT based management information storage and query-based state lookup mechanism. The signaling underlay is aimed to apply a decentralized "peer-to-peer" style searching and discovering engine into the management and control plane of the overlay network, including grid networks and p2p applications, to facilitate deployment of QoS service.

A major aspect of Open Systems’ network management is the inter-working between distinct Management architectures. This paper details the development of a generic object oriented application level gateway that achieves seamless coexistence between OSI and SNMPv1 management systems. The work builds upon the Network Management Forum’s `ISO/CCITT and Internet Management Coexistence’ activities. The power of the OSI Systems Management Functions is made available for the management of SNMPvl based resources, bringing fully event driven management to the SNMP domain.

The OSIMIS (OSI Management Information Service) platform provides the foundation for the quick, efficient and easy construction of complex management systems. It is an object-oriented development environment in C++ [Strou] based on the OSI Management Model [X701] that hides the underlying protocol complexity (CMIS/P) and harnesses the power and expressiveness of the associated information model [X722] through simple to use Application Program Interfaces (APIs). OSIMIS combines the thoroughness of the OSI models and protocols with advanced distributed systems concepts pioneered by ODP to provide a highly dynamic distributed information store. It also combines seamlessly the OSI management power with the large installed base of Internet SNMP [SNMP] capable network elements. OSIMIS supports particularly well a hierarchical management organisation through hybrid manager-agent applications and may embrace a number of diverse technologies through proxy systems. This paper explains the OSIMIS components, architecture, philosophy and direction.