Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 49 (1994), S. 101-110 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We study a discrete-time, multi-server, finite capacity queue with a burst arrival. Once the first job of a burst arrives at the queue, the successive jobs will arrive every time slot until the last job of the burst arrives. The number of jobs and the inter-arrival time of bursts are assumed to be generally distributed, and the service time is assumed to be equal to one slot. We propose an efficient numerical method to exactly obtain the job loss probability, the waiting time distribution and the mean queue length using an embedded Markov chain at the arrival instants of bursts.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 18 (1994), S. 167-182 
    ISSN: 1572-9443
    Keywords: Discrete-time queue ; burst arrival ; shared buffer ; ATM switch ; Markov chain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We study a discrete-time, classified multi-server queue with a shared buffer. There arem servers and each server belongs to one ofk classes (m≥k), so thatk kinds of jobs can be served in the system. We characterize a bursty arrival process using bursts which consist of the same kind of jobs. Once the first job of a burst arrives at the queue, the successive jobs will arrive on every time slot until the last job of the burst arrives. The numbers of jobs of a burst and the inter-arrival times of bursts are assumed to be i.i.d., respectively, and the service time is assumed to be equal to one slot. We propose an efficient numerical method to exactly obtain the job loss probability, the waiting time distribution and the mean queue length. We apply this model to the ATM switch with a shared buffer and obtain the performance measures. Numerical results show the advantage of the ATM switch with a shared buffer compared to the one with output buffers.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 48 (1994), S. 313-332 
    ISSN: 1572-9338
    Keywords: Optimization ; heuristics ; open queueing networks ; blocking
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Two algorithms are developed to allocateM buffers toN service stations connected arbitrarily in a feed-forward manner. All service times and the interarrival times are assumed to be exponentially distributed. Both methodologies are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Graefe's archive for clinical and experimental ophthalmology 196 (1975), S. 239-246 
    ISSN: 1435-702X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Description / Table of Contents: Zusammenfassung Mit Hilfe von Meerrettich-Peroxidase wurden elektronenmikroskopische Tracer-Studien an der Blutsehnerven- und Liquorsehnervenbarriere unternommen. Nach intravenöser Injektion von Peroxidase füllte diese das Lumen der Capillaren des laminaren, prälaminären und Orbitalen Anteiles des Nervus opticus aus, ohne daß eine Penetration der Capillarwände zu beobachten war. Die Verhinderung einer Tracerdiffusion durch die Capillarwand wurde den “tight junctions” zwischen den Endothelzellen zugeschrieben. Auch bei den Capillaren der Pia und Dura fand sich keine Penetration von Peroxidase. Es wurden jedoch mit Peroxidase gefüllte pinocytotische Vesikel im Endothel beobachtet. Während eine laterale Diffusion von Peroxidase von der umgebenden Chorioidea in den Sehnerven festgestellt wurde, wurde eine Diffusion des Tracers vom prälaminären Anteil des Sehnerven in das umgebende Retinagewebe durch das Kuhnt'sche Zwischengewebe blockiert. “Tight junctions”, die eine Diffusion von Peroxidase verhinderten, fanden sich zwischen den Gliederzellen des Kuhnt'schen Gewehes, so daß dieses Gewebe als Barriere zwischen dem prälaminären Anteil des Sehnerven und der juxtapapillären Netzhaut wirkte. Peroxidase, die in einen Seitenventrikel des Gehirns appliziert wurde, erschien in dem den Sehnerven umgebenden Subarachnoidalraum und diffundierte ungehindert in den Sehnerven. Die Pia Mater des Sehnerven hatte somit keine Barrierenfunktion. Peroxidase konnte entlang den Intercellularspalten zwischen Gliazellen und Sehnervenfasern verfolgt werden. Die Basalmembran der Capillaren des Sehnerven war angefüllt mit Peroxidase. Eine Diffusion in das Capillarlumen wurde jedoch durch die “tight junctions” zwischen den Endothelzellen verhindert.
    Notes: Summary Utilizing horseradish peroxidase as a tracer, electron microscopic studies were done on the blood-optic nerve and fluid-optic nerve barrier to the peroxidase diffusion. Following intravenous injection the peroxidase was observed to fill the lumen of the capillaries of the laminar, prelaminar and orbital portions of the optic nerve but there was no penetratation of the capillary walls. The obstruction of the tracer diffusion out of capillary walls was attributed to the tight junctions between the endothelial cells. Peroxidase penetration was also absent in the capillaries of the pia and dura mater, however, was observed in pinocytotic vesicles of the endothelial cells. Lateral diffusion from the surrounding choroid into the optic nerve was detected but diffusion from the prelaminar optic nerve into the juxta-optic nerve retina was prevented by the Kuhnt intermediary tissue. Tight junctions which prevented peroxidase diffusion were found between the glial cells of the Kuhnt tissue, and this tissue was the barrier between the prelaminar optic nerve and the juxta-optic nerve retina. Peroxidase which was given into the lateral ventricle of the brain appeared in the subarachnoidal space around the optic nerve and penetrated freely into the optic nerve. The pial surface of the optic nerve possess no barrier activity. Peroxidase could be traced along the intercellular space between glial cells and optic nerve fibers. The basal lamina of the optic nerve capillaries was filled with peroxidase but diffusion into the capillary lumen was obstructured by the tight junctions between the endothelial cells.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    IIE transactions 30 (1998), S. 883-892 
    ISSN: 1573-9724
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this study, we are concerned with finding the minimum-total-buffer allocation for a desired throughput in production lines with phase-type processing times. We have implemented a dynamic programming algorithm that uses a decomposition method to approximate the system throughput at every stage. We provide numerical examples to show the buffer allocation and compare the corresponding simulated throughput and its bounds with the desired throughput.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...