Sciweavers

35 search results - page 6 / 7
» Cost Bounds of Multicast Light-Trees in WDM Networks
Sort
View
INFOCOM
1997
IEEE
13 years 10 months ago
Performance Analysis of Multicast Flow Control Algorithms over Combined Wired/Wireless Networks
Abstract—A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the rec...
Huayan Amy Wang, Mischa Schwartz
INFOCOM
2003
IEEE
13 years 11 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
OPODIS
2008
13 years 7 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone
JSAC
2006
157views more  JSAC 2006»
13 years 5 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 7 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