Sciweavers

533 search results - page 78 / 107
» Stability of a Multicast Tree
Sort
View
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 10 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 10 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 3 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
ICN
2001
Springer
14 years 1 months ago
Performance Evaluation of PIM-SM Recovery
Abstract. A PIM-SM-built multicast tree must be restructured/recovered when the underlying unicast routing tables change. In this article we describe the PIM-SM recovery mechanisms...
Tarik Cicic, Stein Gjessing, Øivind Kure