Sciweavers

2299 search results - page 147 / 460
» A Class of Hypercube-Like Networks
Sort
View
GLOBECOM
2006
IEEE
14 years 4 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Kevin Ross, Nicholas Bambos
ISMIS
2003
Springer
14 years 3 months ago
Logic for Multi-path Message Forwarding Networks for Mobile Agents
We discuss how mobile agents, moving in the Internet from node to node, can communicate with each other by forwarding messages in a robust way. As a solution, we present the genera...
Masahito Kurihara, Masanobu Numazawa
ICDCS
1998
IEEE
14 years 2 months ago
System Support for Partition-Aware Network Applications
Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts. In this paper we consider partition a...
Özalp Babaoglu, Renzo Davoli, Alberto Montres...
AAAI
2004
13 years 11 months ago
Tractable Tree Convex Constraint Networks
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
Yuanlin Zhang, Eugene C. Freuder
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 10 months ago
Parity Forwarding for Multiple-Relay Networks
—This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwa...
Peyman Razaghi, Wei Yu