Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates ...

Internet eXchange Points (IXPs) have significantly transformed the structure and economics of the Internet by allowing many nearby networks to connect directly, avoiding the need for service providers. These large IXPs are so beneficial that they are not ...

By offloading partial of the aggregation computation from the logical central parameter servers to network devices like programmable switches, In-Network Aggregation (INA) is a general, effective, and widely used approach to reduce network load thus ...

With the increase in both the model size and dataset size of distributed training (DT) tasks, communication between the workers and parameter servers (PSs) in a cluster has become a bottleneck. In-network aggregation (INA) enabled by programmable switches ...

Topology design is vital to the high performance data center networks. Due to the limited scalability, many traditional server-centric data center networks are confronting the updating and upgrading hurdles. To address the issue, this paper proposes a ...

Satellite-terrestrial integrated networks (STNs) are considered a promising architecture for 6G networks due to their ability to provide ubiquitous, high-capacity coverage on a global scale by combining satellite and terrestrial network infrastructures. ...

Multipath TCP (MPTCP) is a burgeoning transport protocol which enables the server to transmit the traffic across multiple network interfaces in parallel. Classic MPTCPs have good friendliness and practicality such as relatively low overhead, but are hard ...

Multi-homing technologies are promising to support seamless handoff and non-interrupted transmissions. Scheduling packets across multiple paths, however, has the known issue of out-of-order (OFO) due to the heterogeneity of the paths, which is detrimental ...

Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for a long time and are very well understood, both in a centralized and distributed context, as long ...

The Internet Protocol (IP) is the most fundamental building block of the Internet. However, it provides no explicit notion of packet-level authenticity. Such a weakness allows malicious actors to spoof IP packet headers and launch a wide variety of ...

Traffic Matrix (TM), which records traffic volumes among network nodes, is important for network operation and management. Due to cost and operation issues, TMs cannot be directly measured and collected in real time. Therefore, many studies work on ...

The quantum network that allows users to communicate in a quantum way will be available in the foreseeable future. The network capable of distributing Bell state entangled pairs faces many challenges due to entanglement decoherence and limited network ...

With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure connectivity ...

Quantum networks have emerged as a future platform for quantum information exchange and applications, with promising capabilities far beyond traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. ...

The strategy of constructing a virtual backbone (VB) to perform routing tasks is considered a mature method for addressing the broadcast storm problem in wireless sensor networks (WSNs). A WSN can be regarded as a unit disk graph (UDG), and its VBs can be ...

In the global Internet, the paths between two autonomous systems (ASes), which are used for the exchange of traffic, are essential for understanding the behavior of the Internet routing system and they can help improve the performance of many applications ...

Oblivious routing distributes traffic from sources to destinations following predefined routes with rules independent of traffic demands. While finding optimal oblivious routing with a concave objective is intractable for general topologies, we show that ...

This paper presents a fast and robust centralized data center network (DCN) routing solution, called Primus. For fast routing calculation, Primus uses centralized controllers to collect/disseminate the network’s link-states (LS), and offload the ...

We investigate the problem of fast and secure packet routing in multi-hop Quantum Key Distribution (QKD) networks. We consider a practical trusted-node setup where a QKD protocol randomly generates symmetric private key pairs over each QKD-enabled link in ...

At a suitable level of abstraction, all that standard routing protocols do is iterate extension and election operations on path attributes. An extension operation composes the attribute of a path from those of a link and another path, while an election ...