Sciweavers

11 search results - page 2 / 3
» On Efficiency Group Multicasting Algorithm with Multiple Min...
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 1 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
CIC
2004
118views Communications» more  CIC 2004»
13 years 8 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
GLOBECOM
2007
IEEE
13 years 11 months ago
mQMA: Multi-Constrained QoS Multicast Aggregation
Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studie...
Naouel Ben Ali, Joanna Moulierac, Abdelfattah Belg...
JNW
2008
117views more  JNW 2008»
13 years 7 months ago
An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...
E. Baburaj, V. Vasudevan
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang