Sciweavers

830 search results - page 80 / 166
» Route kernels for trees
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
15 years 5 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
INFOCOM
2008
IEEE
15 years 10 months ago
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
Rik Sarkar, Xianjin Zhu, Jie Gao, Leonidas J. Guib...
ICCCN
2007
IEEE
15 years 8 months ago
Scalable Peer-to-Peer File Sharing with Efficient Complex Query Support
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
Yan Li, Jyoti Ahuja, Li Lao, Jun-Hong Cui
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 5 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
MMNS
2004
167views Multimedia» more  MMNS 2004»
15 years 5 months ago
Bandwidth Constrained IP Multicast Traffic Engineering Without MPLS Overlay
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
Ning Wang, George Pavlou