Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On adaptive allocation of the buffer memory of a packet switching node

From MaRDI portal
Publication:1290693
Jump to:navigation, search

zbMATH Open0921.68105MaRDI QIDQ1290693FDOQ1290693


Authors: K. Appert Edit this on Wikidata


Publication date: 3 June 1999

Published in: Automation and Remote Control (Search for Journal in Brave)





Recommendations

  • Optimum Scheduling and Memory Management in Input Queued Switches With Finite Buffer Space
  • Analyzing sharing strategies for finite buffer memory in a router among outgoing channels
  • The optimal buffer allocation problem
  • An optimal service policy for buffer systems
  • Buffer allocation in general single-server queueing networks


zbMATH Keywords

node buffer memory


Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)



Cited In (5)

  • An accurate and practical buffer allocation model for the buffer cache based on marginal gains.
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Performance Modeling for Communication Networks at a Switching Node
  • Title not available (Why is that?)





This page was built for publication: On adaptive allocation of the buffer memory of a packet switching node

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1290693&oldid=13396799"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 10:41. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki