How do we remember the past in randomised strategies?

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies

Copyright Notice

IAB Thoughts on Encodings for Internationalized Domain Names This document explores issues with Internationalized Domain Names (IDNs) that result from the use of various encoding schemes such as UTF-8 and the ASCII-Compatible Encoding produced by the Punycode algorithm. It focuses on the importance of agreeing on a single encoding and how complicated the state of affairs ends up being as a result of using different encodings today. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This document is a product of the Internet Architecture Board (IAB) and represents information that the IAB has deemed valuable to provide for permanent record. Documents approved for publication by the IAB are not a candidate for any level of Internet Standard; see Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained a

A DHCP-based IP address autoconfiguration for MANETs

Mobile Ad hoc Networks (MANETs) are expected to become more and more important in the upcoming years, playing a significant role in 4G networks. In order to enable the deployment of IP services in such networks, IP address autoconfiguration mechanisms are required. Although the ad hoc topic has been a very intense research area, with a plethora of published papers about routing, there is a lack of proposals of address autoconfiguration with enough support from the technical community. This paper presents a mechanism suited for MANETs connected to the Internet, reusing existing and widely deployed address autoconfiguration protocols, such as DHCPv6 and Router Advertisements

Introducing IPv6 Tokenised Interface Identifiers into the Linux Kernel

IPv6 Stateless Address Autoconfiguration (SLAAC) enables network administrators to deploy devices in a network and have those devices automatically generate global addresses without any administrative intervention, and without the need for any stateful configuration service such as DHCPv6. However, certain services --- such as HTTP, SMTP and IMAP --- may better benefit from having "well known" identifiers that do not depend on the physical hardware address of the server's network interface card. Tokenised addresses offer facility for administrators to specify the bottom 64 bits of an IPv6 address for a node whilst allowing the top 64 bits (the network prefix) to be automatically configured from router advertisements. This report documents the approach taken and experience gained from introducing tokenised interface identifiers into the Linux 2.6.11 kernel, as shipped with Redhat Fedora Core 4. This proof of concept work demonstrates the relative ease of introducing this useful utility for network node deployment, and further motivates wider deployment of the semi-automatic configuration approach

Avoiding DAD for Improving Real-Time Communication in MIPv6 Environments

Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems, IDMS/PROMS 2002 Coimbra, Portugal, November 26–29, 2002 ProceedingsCurrent specification of address configuration mandates the execution of the Duplicate Address Detection (DAD) mechanism to prevent address duplication. However, a proper support for real time multimedia applications in mobile IPv6 nodes is undermined by the disruption imposed by DAD. In order to overcome this limitation, the usage of randomly generated IPv6 Interface Identifiers without previously performing DAD is proposed, based on the statistic uniqueness of the addresses generated through this method. The address duplication risk is quantified through the calculation of the probability of an Interface Identifier collision among the nodes sharing a link. The calculated probability is deemed to be negligible compared to other causes of communication failure, such as network outages.This research was supported by the LONG (Laboratories Over Next Generation Networks) project IST-1999-20393 and Moby Dick (Mobility and Differentiated Services in a Future IP Network) project IST-2000-25394

Scalable Support for Globally Moving Networks

This paper proposes a scalable solution for the support for globally moving networks. It is basically oriented to airborne mobile networks built in commercial aircrafts in order to provide Internet access to the passengers. As opposed to currently used solutions, the proposed solution has no impact in the global routing tables while it provides optimized paths between the mobile network and the rest of the Internet The proposed solution is an extension to the IETF standard network mobility support protocol and relies on the communication through multiple geographically distributed Home Agents in order to avoid panoramic routing imposed by single anchor points as in the case of a single Home Agent. The proposed solution includes a mechanism to select the best Home Agent to route new communications through.This project has been supported by Optinet project TIC-2003-09042-C03-01 and IMPROVISA project.Publicad

A Pull Model IPv6 Duplicate Address Detection

Abstract-In IPv6 network, before configuring any address, a node must perform Duplicate Address Detection (DAD) to ensure the address is unique on link. However, original DAD is unreliable and vulnerable. In this article, a pull model DAD is designed, which achieves improvements both in reliability and security through changing the solicitation model. Comparing with SEcure Neighbor Discovery (SEND), this proposal has advantage in lightweight overhead and flexibility of address generation. Through evaluation, it is found to be feasible and cost effective

An SDN-Based Authentication Mechanism for Securing Neighbor Discovery Protocol in IPv6

The Neighbor Discovery Protocol (NDP) is one of the main protocols in the Internet Protocol version 6 (IPv6) suite, and it provides many basic functions for the normal operation of IPv6 in a local area network (LAN), such as address autoconfiguration and address resolution. However, it has many vulnerabilities that can be used by malicious nodes to launch attacks, because the NDP messages are easily spoofed without protection. Surrounding this problem, many solutions have been proposed for securing NDP, but these solutions either proposed new protocols that need to be supported by all nodes or built mechanisms that require the cooperation of all nodes, which is inevitable in the traditional distributed networks. Nevertheless, Software-Defined Networking (SDN) provides a new perspective to think about protecting NDP. In this paper, we proposed an SDN-based authentication mechanism to verify the identity of NDP packets transmitted in a LAN. Using the centralized control and programmability of SDN, it can effectively prevent the spoofing attacks and other derived attacks based on spoofing. In addition, this mechanism needs no additional protocol supporting or configuration at hosts and routers and does not introduce any dedicated devices

Temporal and Spatial Classification of Active IPv6 Addresses

There is striking volume of World-Wide Web activity on IPv6 today. In early 2015, one large Content Distribution Network handles 50 billion IPv6 requests per day from hundreds of millions of IPv6 client addresses; billions of unique client addresses are observed per month. Address counts, however, obscure the number of hosts with IPv6 connectivity to the global Internet. There are numerous address assignment and subnetting options in use; privacy addresses and dynamic subnet pools significantly inflate the number of active IPv6 addresses. As the IPv6 address space is vast, it is infeasible to comprehensively probe every possible unicast IPv6 address. Thus, to survey the characteristics of IPv6 addressing, we perform a year-long passive measurement study, analyzing the IPv6 addresses gleaned from activity logs for all clients accessing a global CDN. The goal of our work is to develop flexible classification and measurement methods for IPv6, motivated by the fact that its addresses are not merely more numerous; they are different in kind. We introduce the notion of classifying addresses and prefixes in two ways: (1) temporally, according to their instances of activity to discern which addresses can be considered stable; (2) spatially, according to the density or sparsity of aggregates in which active addresses reside. We present measurement and classification results numerically and visually that: provide details on IPv6 address use and structure in global operation across the past year; establish the efficacy of our classification methods; and demonstrate that such classification can clarify dimensions of the Internet that otherwise appear quite blurred by current IPv6 addressing practices

Mobile IP: state of the art report

Due to roaming, a mobile device may change its network attachment each time it moves to a new link. This might cause a disruption for the Internet data packets that have to reach the mobile node. Mobile IP is a protocol, developed by the Mobile IP Internet Engineering Task Force (IETF) working group, that is able to inform the network about this change in network attachment such that the Internet data packets will be delivered in a seamless way to the new point of attachment. This document presents current developments and research activities in the Mobile IP area