Protocols and Algorithms for Large-scale Multi-Substrate Networks

点击翻译按钮获取中文摘要

The ever increasing number of networked devices and the emerging ability of devices to simultaneously connect to multiple communication networks lays the foundation for a new networking architecture. The interconnection of diverse specialized networks for machine-to-machine communications, content-aware networking, and cyber-physical systems creates a collection of heterogeneous networks. In a traditional Internet-centric architecture, all networks connect to the Internet, but not to each other. However, in an environment where many networks are mobile and have only intermittent connectivity, the assumption of permanent connectivity to the Internet is limiting. This creates the need for an alternative network design, where the Internet is connected to some but not all networks. We propose a research agenda on protocols and algorithms for very large collections of heterogeneous networks, referred to as substrate networks, where devices have attachments to multiple substrate networks. We seek to support a virtually unlimited number of substrate networks of arbitrary sizes, with dynamic changes to substrate connectivity due to mobility or failures. We propose to address key problems that can realize this vision. We will investigate methods for routing in large internetworks, where consistent global routing tables are not viable due to network dynamics and mobility. We will develop algorithms that enable devices with multiple network interfaces to select one or more substrate networks for data transmission, while satisfying stability criteria. The research methods include algorithm design, protocol design and validation, large scale simulations, analytical performance evaluation, and protocol implementation. A separate thrust, but an integral part of our research agenda, is the development of analytical methods to evaluate the delay and throughput performance of multi-substrate networks. Building on our prior research on the stochastic network calculus, we will work towards the creation of a foundational theory to reason about bandwidth availability and delays in networks with statistical multiplexing. We will address long-standing open problems in the stochastic min-plus system theory for networks. In particular, we propose to develop analytical methods for the evaluation of random systems with feedback within the systems theory of the network calculus. We also seek to find improved lower bounds for performance metrics derived with the stochastic network calculus.