FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000965103> ?p ?o ?g. }

• W2000965103 endingPage "40" @default.
• W2000965103 startingPage "39" @default.
• W2000965103 abstract "We consider in this paper two types of queueing systems which operate under a specific and fixed scheduling policy. The first system consists of a single server and several buffers in which arriving jobs are stored. We assume that arriving parts may require several stages of processing in which case each stage corresponds to a different buffer. The second system is a communication type queueing network given by a graph. The arriving jobs (packets) request a simple path along which they need to be processed. In both models the jobs arrive in a completely deterministic fashion: the interarrival times are fixed and known. All the processing times are also deterministic. A scheduling policy specifies a rule using which arriving parts are processed in the queueing system. A scheduling policy is defined to be stable if there is a finite uniform upper bound on the total number of parts in the system at all times. A necessary condition for stability of any work conserving policy is that the traffic intensity of the station (of each link in the graph in the communication model) is not bigger than one. Many results have demonstrated that this condition is not sufficient for stability. The results were obtained primarily in the context of stochastic networks ([24],[20],[5],[6],[10]), deterministic fluid networks ([6],[9],[7],[8],[2]), deterministic adversarial networks ([4],[1],[14],[12]). One of the earliest result in the area were obtained by Rybko and Stolyar [24] and Lu and Kumar [20]. They showed that a simple priority policy can lead to instability in some queueing networks. Bramson [5] and Seidman [25] showed that even FIFO policy can be unstable in stochastic networks. Instability of FIFO was later demonstrated in an adversarial queueing setting by Andrews et. al. [1]. Dai [6] established that stability of a fluid deterministic queueing network implies stability of a stochastic queueing network. A similar result was established by Gamarnik [12], which connects stability of fluid and adversarial queueing networks. A complete characterization of two-station fluid networks which are stable under any work conserving policy was established by Bertsimas, Gamarnik and Tsitsiklis [2] and Dai and Vande Vate [7]. Goel [14] constructed a complete characterization of adversarial queueing networks which are stable under the usual load condition. The result is extended by Gamarnik [13]. Motivated by a queueing network model stability of homogeneous random walks in a nonnegative orthant was considered in several papers: Malyshev [21], Menshikov [23], Fayolle [11], Ignatyuk and Malyshev [18], Malyshev [22]. Such random walks Q ( t ), t = 0, 1, 2,¡­ have Z + d as a state space ( Z + is the set of nonnegative integers). The transition vectors ¦¤ have deterministically bounded length in max norm and the transition probability p (¦«, ¦¤) along the direction ¦¤ depends only on the face ¦« that the random walk is currently on (the transition probabilities depend only on which coordinates of the current state are positive and which are zero). Such a random walk is defined to be stable if it is positive recurrent. We will also consider deterministic walks, for which p (¦«, ¦¤) is always zero or one (the transition deterministically depends on the face that the walk is currently on). A complete characterization of stable homogeneous random walks in Z + d for d ¡Ü 4 was obtained in Malyshev [21], Menshikov [23] and Ignatyuk and Malyshev [18], but no extension of this classification to higher dimensions has been obtained. Malyshev in [22] establishes a connection between homogeneous random walks and general dynamical systems on compact manifolds and shows that the difficulty of classifying stable random walks is of the same nature as the difficulty of understanding the dynamics of these dynamical systems. Specifically, the complicated dynamics precludes obtaining classification of stable random walks for d = 5. Thus despite many efforts the classification of stable random walks for general dimensions is not known. Likewise classification of stable policies in queueing systems is an open problem." @default.
• W2000965103 created "2016-06-24" @default.
• W2000965103 creator A5031648070 @default.
• W2000965103 date "2001-03-01" @default.
• W2000965103 modified "2023-09-27" @default.
• W2000965103 title "On deciding stability of constrained random walks and queueing systems" @default.
• W2000965103 cites W1520550339 @default.
• W2000965103 cites W1973403707 @default.
• W2000965103 cites W1978818423 @default.
• W2000965103 cites W2027596395 @default.
• W2000965103 cites W2037304582 @default.
• W2000965103 cites W2039052702 @default.
• W2000965103 cites W2050076818 @default.
• W2000965103 cites W2072767018 @default.
• W2000965103 cites W2092153172 @default.
• W2000965103 cites W2113592921 @default.
• W2000965103 cites W2125426300 @default.
• W2000965103 cites W2125478497 @default.
• W2000965103 cites W2134666018 @default.
• W2000965103 cites W2149637201 @default.
• W2000965103 cites W2155529449 @default.
• W2000965103 cites W2161843469 @default.
• W2000965103 cites W2163590987 @default.
• W2000965103 doi "https://doi.org/10.1145/544397.544412" @default.
• W2000965103 hasPublicationYear "2001" @default.
• W2000965103 type Work @default.
• W2000965103 sameAs 2000965103 @default.
• W2000965103 citedByCount "0" @default.
• W2000965103 crossrefType "journal-article" @default.
• W2000965103 hasAuthorship W2000965103A5031648070 @default.
• W2000965103 hasConcept C120314980 @default.
• W2000965103 hasConcept C126255220 @default.
• W2000965103 hasConcept C134306372 @default.
• W2000965103 hasConcept C158379750 @default.
• W2000965103 hasConcept C192126672 @default.
• W2000965103 hasConcept C206729178 @default.
• W2000965103 hasConcept C22684755 @default.
• W2000965103 hasConcept C2986422491 @default.
• W2000965103 hasConcept C31258907 @default.
• W2000965103 hasConcept C33891772 @default.
• W2000965103 hasConcept C33923547 @default.
• W2000965103 hasConcept C41008148 @default.
• W2000965103 hasConcept C77553402 @default.
• W2000965103 hasConceptScore W2000965103C120314980 @default.
• W2000965103 hasConceptScore W2000965103C126255220 @default.
• W2000965103 hasConceptScore W2000965103C134306372 @default.
• W2000965103 hasConceptScore W2000965103C158379750 @default.
• W2000965103 hasConceptScore W2000965103C192126672 @default.
• W2000965103 hasConceptScore W2000965103C206729178 @default.
• W2000965103 hasConceptScore W2000965103C22684755 @default.
• W2000965103 hasConceptScore W2000965103C2986422491 @default.
• W2000965103 hasConceptScore W2000965103C31258907 @default.
• W2000965103 hasConceptScore W2000965103C33891772 @default.
• W2000965103 hasConceptScore W2000965103C33923547 @default.
• W2000965103 hasConceptScore W2000965103C41008148 @default.
• W2000965103 hasConceptScore W2000965103C77553402 @default.
• W2000965103 hasIssue "4" @default.
• W2000965103 hasLocation W20009651031 @default.
• W2000965103 hasOpenAccess W2000965103 @default.
• W2000965103 hasPrimaryLocation W20009651031 @default.
• W2000965103 hasRelatedWork W1994444842 @default.
• W2000965103 hasRelatedWork W2000965103 @default.
• W2000965103 hasRelatedWork W2074737673 @default.
• W2000965103 hasRelatedWork W2092662548 @default.
• W2000965103 hasRelatedWork W2125153552 @default.
• W2000965103 hasRelatedWork W2487874215 @default.
• W2000965103 hasRelatedWork W2565427580 @default.
• W2000965103 hasRelatedWork W2793631336 @default.
• W2000965103 hasRelatedWork W3199469141 @default.
• W2000965103 hasRelatedWork W4240368433 @default.
• W2000965103 hasVolume "28" @default.
• W2000965103 isParatext "false" @default.
• W2000965103 isRetracted "false" @default.
• W2000965103 magId "2000965103" @default.
• W2000965103 workType "article" @default.