223 search results - page 5 / 45 » Transient Model for Jackson Networks and Its Approximation |
IOR
2008
13 years 7 months ago
2008
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
ICPADS
2002
IEEE
14 years 15 days ago
2002
IEEE
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
JCP
2006
13 years 7 months ago
2006
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
PE
2002
Springer
13 years 7 months ago
2002
Springer
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...