On the public citation graph
Linear-complexity algorithms for QoS support in input-queued switches with no speedup
0 signed · 80 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1049/el:19970837openalex-snapshot
Performance of an input-queued ATM switchwith even/odd switching planes
inferredcites →https://doi.org/10.1049/el:19981275openalex-snapshot
Provisioning QoS features for input-queued ATM switches
inferredcites →https://doi.org/10.1049/ip-com:19981660openalex-snapshot
Throughput analysis of input-buffered ATM switch
inferredcites →https://doi.org/10.1080/00029890.1962.11989827openalex-snapshot
College Admissions and the Stability of Marriage
inferredcites →https://doi.org/10.1109/18.61109openalex-snapshot
A calculus for network delay. I. Network elements in isolation
inferredcites →https://doi.org/10.1109/4234.703908openalex-snapshot
Tandem-crosspoint ATM switch with input and output buffers
inferredcites →https://doi.org/10.1109/49.12886openalex-snapshot
Queueing in high-performance packet switching
inferredcites →https://doi.org/10.1109/49.76643openalex-snapshot
Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switch
inferredcites →https://doi.org/10.1109/49.772430openalex-snapshot
Matching output queueing with a combined input/output-queued switch
inferredcites →https://doi.org/10.1109/5.469298openalex-snapshot
Service disciplines for guaranteed performance service in packet-switching networks
inferredcites →https://doi.org/10.1109/50.736593openalex-snapshot
A cell switching WDM broadcast LAN with bandwidth guarantee and fair access
inferredcites →https://doi.org/10.1109/9.182479openalex-snapshot
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
inferredcites →https://doi.org/10.1109/90.502236openalex-snapshot
Efficient fair queuing using deficit round-robin
inferredcites →https://doi.org/10.1109/90.532860openalex-snapshot
Efficient network QoS provisioning based on per node traffic shaping
inferredcites →https://doi.org/10.1109/icc.1989.49731openalex-snapshot
Effect of speedup in nonblocking packet switch
inferredcites →https://doi.org/10.1109/icc.1990.117177openalex-snapshot
Performance of packet switches with input and output queueing
inferredcites →https://doi.org/10.1109/icnp.1998.723720openalex-snapshot
Linear complexity algorithms for bandwidth reservations and delay guarantees in input-queued switches with no speedup
inferredcites →https://doi.org/10.1109/infcom.1991.147573openalex-snapshot
Analysis of a packet switch with input and output buffers and speed constraints
inferredcites →https://doi.org/10.1109/infcom.1992.263509openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks-the single node case
inferredcites →https://doi.org/10.1109/infcom.1996.497906openalex-snapshot
Achieving 100% throughput in an input-queued switch
inferredcites →https://doi.org/10.1109/infcom.1998.665071openalex-snapshot
Linear complexity algorithms for maximum throughput in radio networks and input queued switches
inferredcites →https://doi.org/10.1109/infcom.1998.665102openalex-snapshot
A practical scheduling algorithm to achieve 100% throughput in input-queued switches
inferredcites →https://doi.org/10.1109/isit.1998.708760openalex-snapshot
On the speedup required for combined input and output queued switching
inferredcites →https://doi.org/10.1109/iwqos.1998.675242openalex-snapshot
Exact emulation of an output queueing switch by a combined input output queueing switch
inferredcites →https://doi.org/10.1109/iwqos.1998.675243openalex-snapshot
On the speedup required for work-conserving crossbar switches
inferredcites →https://doi.org/10.1109/iwqos.1998.675244openalex-snapshot
Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup
inferredcites →https://doi.org/10.1109/mcom.1986.1092946openalex-snapshot
New directions in communications (or which way to the information age?)
inferredcites →https://doi.org/10.1109/mcom.1997.642833openalex-snapshot
Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset
inferredcites →https://doi.org/10.1109/tcom.1987.1096719openalex-snapshot
Input Versus Output Queueing on a Space-Division Packet Switch
inferredcites →https://doi.org/10.1145/161541.161736openalex-snapshot
High-speed switch scheduling for local-area networks
inferredcites →https://doi.org/10.1145/99508.99525openalex-snapshot
Virtual clock: a new traffic control algorithm for packet switching networks
inferredcites →https://doi.org/10.1145/99517.99525openalex-snapshot
Virtual clock: a new traffic control algorithm for packet switching networks
inferredcites →https://doi.org/10.2307/2312726openalex-snapshot
College Admissions and the Stability of Marriage
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.48550/arxiv.cs/9810006openalex-snapshot
The Tiny Tera: A Packet Switch Core
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11534310_44openalex-snapshot
Fair and Smooth Scheduling for Virtual Output Queuing Switches Achieving 100% Throughput
inferred← citeshttps://doi.org/10.1007/978-3-540-45235-5_1openalex-snapshot
Providing Delay Guarantee in Input Queued Switches: A Comparative Analysis of Scheduling Algorithms
inferred← citeshttps://doi.org/10.1007/s11235-006-9024-yopenalex-snapshot
Degree-sequenced matching algorithms for input-queued switches
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.12.008openalex-snapshot
Fast and noniterative scheduling in input-queued switches: Supporting QoS
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.013openalex-snapshot
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
inferred← citeshttps://doi.org/10.1049/el:20010792openalex-snapshot
Fairness criterion for allocating resources ininput queued switches
inferred← citeshttps://doi.org/10.1109/26.905898openalex-snapshot
Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
inferred← citeshttps://doi.org/10.1109/35.888259openalex-snapshot
On the provision of quality-of-service guarantees for input queued switches
inferred← citeshttps://doi.org/10.1109/49.887922openalex-snapshot
Supporting bursty traffic with bandwidth guarantee in WDM distribution networks
inferred← citeshttps://doi.org/10.1109/49.963799openalex-snapshot
Supporting rate guarantee and fair access for bursty data traffic in W-CDMA
inferred← citeshttps://doi.org/10.1109/50.736593openalex-snapshot
A cell switching WDM broadcast LAN with bandwidth guarantee and fair access
inferred← citeshttps://doi.org/10.1109/ftdcs.2003.1204336openalex-snapshot
Queue management for QoS provision build on network processor
inferred← citeshttps://doi.org/10.1109/glocom.2001.965086openalex-snapshot
Two scheduling algorithms for input-queued switches guaranteeing voice QoS
inferred← citeshttps://doi.org/10.1109/glocom.2003.1258968openalex-snapshot
Design and implementation of an acyclic stable matching scheduler
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378053openalex-snapshot
Hierarchical scheduling for DiffServ classes
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378145openalex-snapshot
Distributed load adaptive scheduling for high speed input queued switch
inferred← citeshttps://doi.org/10.1109/hpsr.2001.923625openalex-snapshot
QLP: a joint buffer management and scheduling scheme for input queued switches
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709745openalex-snapshot
A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition
inferred← citeshttps://doi.org/10.1109/icc.2001.937187openalex-snapshot
A high-throughput scheduling algorithm for a buffered crossbar switch fabric
inferred← citeshttps://doi.org/10.1109/icc.2002.997025openalex-snapshot
An adaptive scheduler to provide QoS guarantees in an input-buffered switch
inferred← citeshttps://doi.org/10.1109/icccas.2002.1180706openalex-snapshot
Performance evaluation of a parallel-poll virtual output queued switch with two priority levels
inferred← citeshttps://doi.org/10.1109/icccas.2006.284999openalex-snapshot
Multiple Priorities in a Virtual-Priority-Output Queueing Buffered Crossbar
inferred← citeshttps://doi.org/10.1109/icccn.2003.1284188openalex-snapshot
Scheduling with dynamic bandwidth allocation for DiffServ classes
inferred← citeshttps://doi.org/10.1109/icccn.2005.1523911openalex-snapshot
A new low-delay matching algorithm for input-queued switches
inferred← citeshttps://doi.org/10.1109/icccn.2013.6614107openalex-snapshot
An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems
inferred← citeshttps://doi.org/10.1109/icnp.1998.723720openalex-snapshot
Linear complexity algorithms for bandwidth reservations and delay guarantees in input-queued switches with no speedup
inferred← citeshttps://doi.org/10.1109/icnp.1999.801947openalex-snapshot
A distributed scheduling algorithm for quality of service support in multiaccess networks
inferred← citeshttps://doi.org/10.1109/infcom.2000.832559openalex-snapshot
On the stability of input-buffer cell switches with speed-up
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019413openalex-snapshot
On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354605openalex-snapshot
Rate quantization and service quality over single crossbar switches
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354642openalex-snapshot
Rate guarantees and overload protection in input-queued switches
inferred← citeshttps://doi.org/10.1109/isit.2004.1365150openalex-snapshot
An analysis of blocking switches using error control codes
inferred← citeshttps://doi.org/10.1109/milcom.2001.986099openalex-snapshot
A novel fairness criterion for input queued switches
inferred← citeshttps://doi.org/10.1109/tc.2008.222openalex-snapshot
Frame-Based Packet-Mode Scheduling for Input-Queued Switches
inferred← citeshttps://doi.org/10.1109/tit.2004.842562openalex-snapshot
On the Stability of Isolated and Interconnected Input-Queueing Switches Under Multiclass Traffic
inferred← citeshttps://doi.org/10.1109/tit.2007.901191openalex-snapshot
An Analysis of Blocking Switches Using Error Control Codes
inferred← citeshttps://doi.org/10.1109/tnet.2006.886320openalex-snapshot
Approximating Fluid Schedules in Crossbar Packet-Switches and Banyan Networks
inferred← citeshttps://doi.org/10.1109/tnet.2006.890097openalex-snapshot
An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches
inferred← citeshttps://doi.org/10.1109/tpds.2007.70746openalex-snapshot
Max-Min Fair Scheduling in Input-Queued Switches
inferred← citeshttps://doi.org/10.12681/eadd/26898openalex-snapshot
VLSI micro-architectures for high-radix crossbars
inferred← citeshttps://doi.org/10.1360/jos182605openalex-snapshot
Timeslot-Reservation Based Weighted Fair Scheduling
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010openalex-snapshot
On the Complexity of Optimal Scheduling Multi-Rate Nested Periodic Traffic in an Input-Queued Switch
inferred← citeshttps://doi.org/10.3929/ethz-a-004521701openalex-snapshot
Scalable flow control for interconnection networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.