Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy

DOI10.1016/0020-0190(93)90032-5zbMATH Open0778.68018OpenAlexW2046879525MaRDI QIDQ689622FDOQ689622

Authors: Yi-Bing Lin 

Publication date: 15 November 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90032-5

Recommendations

• Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers
• Parallel simulation of statistical multiplexers
• Efficient parallel simulation of a sliding window protocol
• Parallel simulation of ATM switches using relaxation
• Massively time-parallel, approximate simulation of loss queueing systems

zbMATH Keywords

packet losspriority schedulingG/D/1/K queue systempacket-switched multiplexer

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers
• A time-division algorithm for parallel simulation

Cited In (5)

• Efficient parallel simulation of a sliding window protocol
• Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers
• Parallel simulation of transfer lines by time segmentation
• Parallel simulation of statistical multiplexers
• Title not available (Why is that?)

This page was built for publication: Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy

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