Sciweavers

625 search results - page 55 / 125
» Semi-preemptive routing on trees
Sort
View
127
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
ASPDAC
2005
ACM
90views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Feasibility analysis of messages for on-chip networks using wormhole routing
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
Zhonghai Lu, Axel Jantsch, Ingo Sander
CIC
2004
118views Communications» more  CIC 2004»
15 years 1 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 7 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 4 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