On a buffer problem for packetized voice with an N-periodic strongly interchangeable input process

DOI10.2307/3214497zbMATH Open0731.60091OpenAlexW4238648970MaRDI QIDQ3357242

Teunis J. Ott, J. George Shanthikumar

Publication date: 1991

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214497

zbMATH Keywords

packet delaysslotted communication channelstrongly interchangeable input process

Mathematics Subject Classification ID

Self-similar stochastic processes (60G18) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

Structural properties and stochastic bounds for a buffer problem in packetized voice transmission

Recommendations

• Title not available (Why is that?) 👍 👎
• Tandem behavior of a telecommunication system with finite buffers and repeated calls 👍 👎
• On buffers with periodical input traffic 👍 👎
• Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers 👍 👎
• Structural properties and stochastic bounds for a buffer problem in packetized voice transmission 👍 👎
• Tight bounds for the tail of the packet waiting time distribution in buffered networks 👍 👎
• Buffer contents and delay for statistical multiplexers with fixed-length packet-train arrivals 👍 👎
• Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers 👍 👎

This page was built for publication: On a buffer problem for packetized voice with an N-periodic strongly interchangeable input process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3357242)