Sciweavers

2422 search results - page 453 / 485
» Composition of Services with Constraints
Sort
View
TCOM
2008
74views more  TCOM 2008»
13 years 10 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
TON
2008
95views more  TON 2008»
13 years 10 months ago
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for...
Stephen L. Spitler, Daniel C. Lee
TPDS
2008
72views more  TPDS 2008»
13 years 10 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
AAMAS
2004
Springer
13 years 10 months ago
MARP: A Multi-Agent Routing Protocol for Mobile Wireless Ad Hoc Networks
ACT Supporting mobility in a multi hop wireless environment like the MANET still remains a point of research, especially in the context of time-constrained applications. The incapa...
Romit Roy Choudhury, Krishna Paul, Somprakash Band...
AAMAS
2002
Springer
13 years 10 months ago
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and eff...
Katia P. Sycara, Seth Widoff, Matthias Klusch, Jia...