Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
Abstract—Today’s enterprises are confronted with a challenging environment that demands continuous transformations. Globalized markets, disruptive technological innovations, an...
Sabine Buckl, Christian M. Schweda, Florian Matthe...
Usually, for a particular business process different variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the proc...