منابع مشابه
Stochastic Bounds for Fast Jackson Networks
We consider a Jackson-type network, each of whose nodes contains N identical channels with a single server. Upon arriving at a node, a task selects m of the channels at random, and enters the one with the shortest queue. We provide stochastic bounds for the distribution of the state of the network in terms of the behaviour of independent nodes of the same type. The bounds are asymptotically tig...
متن کاملJackson : Social and Economic Networks
Matthew O. Jackson: Social and Economic Networks is published by Princeton University Press and copyrighted, © 2008, by Princeton University Press. All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for read...
متن کاملImportance sampling for Jackson networks
Rare event simulation in the context of queueing networks has been an active area of research for more than two decades. A commonly used technique to increase the efficiency of Monte Carlo simulation is importance sampling. However, there are few rigorous results on the design of efficient or asymptotically optimal importance sampling schemes for queueing networks. Using a recently developed ga...
متن کاملJackson Networks with Unlimited Supply of Work
We consider a Jackson network in which some of the nodes have an infinite supply of work: when all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience a traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability,...
متن کاملJackson Networks with Unlimited Supply of Work
We consider a Jackson network in which some of the nodes have an infinite supply of work: When all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1999
ISSN: 1050-5164
DOI: 10.1214/aoap/1029962816