Optimal packet sizes in virtual circuit computer networks

DOI10.1016/0169-7552(92)90086-6zbMATH Open0762.68010OpenAlexW1972677090MaRDI QIDQ4017613FDOQ4017613

Authors: Claude Évéquoz, C. Tropper 

Publication date: 16 January 1993

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(92)90086-6

Recommendations

• scientific article; zbMATH DE number 1384402
• Optimal packet fragmentation and routing in computer networks
• On the capacity assignment problem in packet-switching computer networks
• scientific article; zbMATH DE number 3922330
• An optimal probabilistic routing policy for a large packet–switched network

zbMATH Keywords

heuristicssimulationvirtual circuitsmessage delayoptimal packet size

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (3)

• Title not available (Why is that?)
• The best and worst packet transmission policies
• Title not available (Why is that?)

This page was built for publication: Optimal packet sizes in virtual circuit computer networks

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