A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches

IEICE Transactions on Information and Systems - Japan
doi 10.1093/ietisy/e91-d.8.2105
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

An Optimal Lower Bound for Buffer Management in Multi-Queue Switches

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

Nearly Optimal FIFO Buffer Management for Two Packet Classes

Computer Networks
Computer NetworksCommunications
2003English

Online Scheduling With a Buffer on Related Machines

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2008English

A Fast Multiport Memory Based on Single-Port Memory Cells

1991English

Shared Memory Transport for ALFA

EPJ Web of Conferences
AstronomyPhysics
2019English

Research on Shared-Port and Shared-Network HSR Network in Smart Substation

DEStech Transactions on Engineering and Technology Research
2017English

Buffer Coding for Asymmetric Multi-Level Memory

2007English

A Tight Bound for Exhaustive Key Search Attacks Against Message Authentication Codes

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy