Analysis and design of communication networks with memory

DOI10.1016/0016-0032(69)90028-3zbMath0206.21202OpenAlexW2103558598MaRDI QIDQ2542689

S. Louis Hakimi

Publication date: 1969

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(69)90028-3

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Information theory (general) (94A15)

Related Items (1)

TASK ASSIGNMENT IN DISTRIBUTED PROCESS CONTROL COMPUTER SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient flows in networks
• Maximal Flow Through a Network
• The Decomposition Algorithm for Linear Programs
• Extreme varieties, concave functions, and the fixed charge problem
• A delay dependent queue discipline

This page was built for publication: Analysis and design of communication networks with memory