Sciweavers

69 search results - page 10 / 14
» Unicast and Multicast QoS Routing with Multiple Constraints
Sort
View
WOWMOM
2006
ACM
118views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Evaluating Different One to Many Packet Delivery Schemes for UMTS
It is known that multicasting is an efficient method of supporting group communication as it allows the transmission of packets to multiple destinations using fewer network resour...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 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
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ICASSP
2011
IEEE
12 years 11 months ago
Distributed beamforming for multiuser peer-to-peer and multi-group multicasting relay networks
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
Nils Bornhorst, Marius Pesavento, Alex B. Gershman