Relevant bibliographies by topics / Resequencing buffer

Journal articles
Dissertations / Theses
Book chapters

Academic literature on the topic 'Resequencing buffer'

Author: Grafiati

Published: 10 March 2023

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Resequencing buffer.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Resequencing buffer"

Pechinkin, Alexander, and Rostislav Razumchik. "Estimation of Network Disordering Effects by In-depth Analysis of the Resequencing Buffer Contents in Steady-state." Journal of Telecommunications and Information Technology, no. 1 (March 30, 2016): 53–60. http://dx.doi.org/10.26636/jtit.2016.1.705.

Full text

Abstract:

The paper is devoted to the analytic analysis of resequencing issue, which is common in packet networks, using queueing-theoretic approach. The authors propose the mathematical model, which describes the simplest setting of packet resequencing, but which allows one to make the first step in the in-depth-analysis of the queues dynamics in the resequencing buffer. Specifically consideration is given to N-server queueing system (N > 3) with single infinite capacity buffer and resequencing, which may serve as a model of packet reordering in packet networks. Customers arrive at the system accord

APA, Harvard, Vancouver, ISO, and other styles

Farber, Gerrit, Said Salhi, and Anna M. Coves Moreno. "SEQUENCING IN A NON-PERMUTATION FLOWSHOP WITH CONSTRAINED BUFFERS: APPLICABILITY OF GENETIC ALGORITH VERSUS CONSTRAINT LOGIC PROGRAMMING." Dirección y Organización, no. 35 (June 1, 2008): 69–78. http://dx.doi.org/10.37610/dyo.v0i35.58.

Full text

Abstract:

Mixed model production lines consider more than one model being processed on the same production line in an arbitrary sequence. Nevertheless, the majority of publications in this area are limited to solutions which determine the job sequence before the jobs enter the line and maintains it without interchanging jobs until the end of the production line, which is known as permutation flowshop. This paper considers a nonpermutation flowshop. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the numb

APA, Harvard, Vancouver, ISO, and other styles

CHAKRAVARTHY, SRINIVAS R., and STEFANKA CHUKOVA. "A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS." Asia-Pacific Journal of Operational Research 22, no. 03 (2005): 409–43. http://dx.doi.org/10.1142/s0217595905000613.

Full text

Abstract:

In this paper, we consider a two-server finite capacity queuing model in which messages should leave the system in the order in which they entered the system. Messages arrive according to a Markovian arrival process (MAP) and any message finding the buffer full is considered lost. Out-of-sequence messages are stored in a (finite) buffer and may lead to blocking when a processed message cannot be placed in the buffer. The steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. The departure process is characterized and two interesting optimizatio

APA, Harvard, Vancouver, ISO, and other styles

Rosberg, Z., and N. Shacham. "Resequencing delay and buffer occupancy under the selective-repeat ARQ." IEEE Transactions on Information Theory 35, no. 1 (1989): 166–73. http://dx.doi.org/10.1109/18.42186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Bae, Yun Han, Bara Kim, Bong Dae Choi, and Jeongsim Kim. "Tail asymptotic behaviour of resequencing buffer content for selective repeat ARQ." Operations Research Letters 39, no. 4 (2011): 272–77. http://dx.doi.org/10.1016/j.orl.2011.04.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Xu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling." Advances in Applied Probability 24, no. 4 (1992): 915–33. http://dx.doi.org/10.2307/1427719.

Full text

Abstract:

In flexible assembly systems, it is often necessary to coordinate jobs and materials so that specific jobs are matched with specific materials. This requires that jobs depart from upstream parallel workstations in some predetermined order. One way to satisfy this requirement is to temporarily hold the serviced jobs getting out of order at a resequencing buffer and to release them to downstream workstations as soon as all their predecessors are serviced. In this paper we consider the problem of scheduling a fixed number of non-preemptive jobs on two IHR non-identical processors with the reseque

APA, Harvard, Vancouver, ISO, and other styles

Xu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling." Advances in Applied Probability 24, no. 04 (1992): 915–33. http://dx.doi.org/10.1017/s0001867800025015.

Full text

Abstract:

APA, Harvard, Vancouver, ISO, and other styles

Shacham, N., and D. Towsley. "Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers." IEEE Transactions on Communications 39, no. 6 (1991): 928–37. http://dx.doi.org/10.1109/26.87182.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chakravarthy, S., S. Chukova, and B. Dimitrov. "Analysis of MAP/M/2/K queueing model with infinite resequencing buffer." Performance Evaluation 31, no. 3-4 (1998): 211–28. http://dx.doi.org/10.1016/s0166-5316(96)00067-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Takine, Tetsuya, Jing-Fei ren, and Toshiharu Hasegawa. "Analysis of the resequencing buffer in a homogeneous M/M/2 queue." Performance Evaluation 19, no. 4 (1994): 353–66. http://dx.doi.org/10.1016/0166-5316(94)90047-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Resequencing buffer"

Caraccio, Ilaria. "Performance analysis of queueing systems with resequencing." Doctoral thesis, Universita degli studi di Salerno, 2016. http://hdl.handle.net/10556/2192.

Full text

Abstract:

2014 - 2015<br>The service sector lies at the heart of industrialized nations and continues to serve as a major contributor to the world economy. Over the years, the service industry has given rise to an enor- mous amount of technological, scienti c, and managerial chal- lenges. Among all challenges, operational service quality, service efficiency, and the tradeoffs between the two have always been at the center of service managers' attention and are likely to be so more in the future. Queueing theory attempts to address these challenges from a mathematical perspective. Every service s

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Resequencing buffer"

Razumchik, Rostislav, and Miklós Telek. "Delay Analysis of Resequencing Buffer in Markov Environment with HOQ-FIFO-LIFO Policy." In Computer Performance Engineering. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66583-2_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Färber, Gerrit, Said Salhi, and Anna M. Coves Moreno. "Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers." In Large-Scale Scientific Computing. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78827-0_61.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!