A set of spanning trees in a graph are called completely independent spanning trees (CISTs
for short) if the paths joining every pair of vertices and in any two trees have neither vertex …

The scale of data center networks (DCNs) has grown rapidly with the increasing popularity
of cloud computing, data explosion, and the dramatic drop in setup costs. Thus, inevitable …

An emerging datacenter network (DCN) with high scalability called HSDC is a server-centric
DCN that can help cloud computing in supporting many inherent cloud services. For …

In contemporary networking contexts, reliable, scalable, and efficient data transfer are
contingentthe performance and optimization of switched Ethernet services. The methods …

In this paper, we consider multicommodity flow problems, with unsplittable flows and
piecewise linear routing costs. We first focus on the case where the piecewise linear routing …

Let G=(V, E) be a directed and weighted graph with a vertex set V of size n and an edge set
E of size m such that each edge (u, v)∈ E has a real-valued weight w (u, c). An …

In today's digital age, the smooth operation of organizations heavily relies on the proper
functioning of the network infrastructure. Imagine a situation when a major change in the …

Given an initial set of planar nodes, the problem is to build a minimum spanning tree
connecting the maximum possible number of nodes by not exceeding the maximum edge …

Несмотря на интеллектуальность и эффективность современного сетевого
оборудования, широковещательный шторм остается актуальной проблемой сетевого …

The novel and robust technology has made great progress in the interaction and intelligence
of mangrove marine science popularization education, and the complex human factors and …