Sciweavers

1545 search results - page 7 / 309
» On tree congestion of graphs
Sort
View
CORR
2010
Springer
57views Education» more  CORR 2010»
14 years 7 months ago
Balancing congestion for unsplittable routing on a bidirected ring
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 4 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 2 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
DAM
2011
14 years 4 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...