On the public citation graph

Flow Control and Routing Algorithms for Data Networks

0 signed · 60 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-35579-5_37openalex-snapshot
Convergence of Asynchronous Optimization Flow Control
inferred← citeshttps://doi.org/10.1007/978-1-4612-4904-7_13openalex-snapshot
The Routing Problem in Computer Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-3450-1_11openalex-snapshot
A Queueing-Network Model for Half-Duplex Routing in Data Communication Networks
inferred← citeshttps://doi.org/10.1007/978-1-4684-4841-2_12openalex-snapshot
Routing-Flow Allocation
inferred← citeshttps://doi.org/10.1007/978-1-4757-1895-9_14openalex-snapshot
Learning Automata Models for Adaptive Flow Control in Packet-Switching Networks
inferred← citeshttps://doi.org/10.1007/bfb0008288openalex-snapshot
Adaptive routing in radio communication networks
inferred← citeshttps://doi.org/10.1007/bfb0042799openalex-snapshot
Optimal tradeoff among delay, throughput and fairness in flow controlled networks
inferred← citeshttps://doi.org/10.1007/bfb0044418openalex-snapshot
Optimal routing and flow control methods for communication networks
inferred← citeshttps://doi.org/10.1007/s11036-006-7793-xopenalex-snapshot
A Macro Model of Frequently Changing Mobile Networks to Perform Flow and Access Control
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90194-0openalex-snapshot
Application of Lagrangian relaxation to computer network control
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.07.014openalex-snapshot
Improving performance of backpressured packet networks by integrating with an end-to-end congestion control algorithm
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.04.001openalex-snapshot
Flow Deviation: 40years of incremental flows for packets, waves, cars and tunnels
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.02.001openalex-snapshot
Optimal On Demand Delay-constrained Fair Distribution for self-coexistence WRAN
inferred← citeshttps://doi.org/10.1016/j.osn.2014.10.001openalex-snapshot
Multi-objective routing and wavelength converter allocation under uncertain traffic
inferred← citeshttps://doi.org/10.1023/a:1019155231293openalex-snapshot
Optimization flow control with Newton‐like algorithm
inferred← citeshttps://doi.org/10.1080/15326349108807181openalex-snapshot
Optimal resource allocation for markovian queueing networks: the complete information case
inferred← citeshttps://doi.org/10.1109/26.141437openalex-snapshot
Fair integration of routing and flow control in communication networks
inferred← citeshttps://doi.org/10.1109/26.24598openalex-snapshot
Fairness in window flow controlled computer networks
inferred← citeshttps://doi.org/10.1109/26.2816openalex-snapshot
Routing with packet duplication and elimination in computer networks
inferred← citeshttps://doi.org/10.1109/49.103550openalex-snapshot
Round-robin scheduling for max-min fairness in data networks
inferred← citeshttps://doi.org/10.1109/49.103553openalex-snapshot
A framing strategy for congestion management
inferred← citeshttps://doi.org/10.1109/5.52205openalex-snapshot
Routing and flow control in high-speed wide-area networks
inferred← citeshttps://doi.org/10.1109/90.811451openalex-snapshot
Optimization flow control. I. Basic algorithm and convergence
inferred← citeshttps://doi.org/10.1109/cdc.1982.268408openalex-snapshot
Projected Newton methods and optimization of multicommodity flows
inferred← citeshttps://doi.org/10.1109/eurcon.2009.5167890openalex-snapshot
Resource allocation in multiservice networks using fairness index
inferred← citeshttps://doi.org/10.1109/glocom.1990.116533openalex-snapshot
Three algorithms for routing and flow control in virtual circuit networks
inferred← citeshttps://doi.org/10.1109/glocom.1999.829974openalex-snapshot
Optimization flow control with Newton-like algorithm
inferred← citeshttps://doi.org/10.1109/icbn.2005.1589636openalex-snapshot
A macro model of frequently changing mobile networks to perform flow and access control
inferred← citeshttps://doi.org/10.1109/icc.1998.683074openalex-snapshot
An optimization approach to ABR control
inferred← citeshttps://doi.org/10.1109/icdcs.2007.101openalex-snapshot
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility
inferred← citeshttps://doi.org/10.1109/icn.2008.50openalex-snapshot
Applying a Macro Model of Ad Hoc Networks to Access Control
inferred← citeshttps://doi.org/10.1109/icnp.1998.723734openalex-snapshot
A class of end-to-end congestion control algorithms for the Internet
inferred← citeshttps://doi.org/10.1109/icnp.2006.320215openalex-snapshot
A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas
inferred← citeshttps://doi.org/10.1109/icnp.2009.5339668openalex-snapshot
A Unified theory of scheduling, routing, and flow control in wireless networks
inferred← citeshttps://doi.org/10.1109/icumt.2009.5345465openalex-snapshot
Evaluating the performance of multi-path routing and congestion control in presence of network resource management
inferred← citeshttps://doi.org/10.1109/icumt.2009.5345516openalex-snapshot
Towards real implementations of dynamic robust routing exploiting path diversity
inferred← citeshttps://doi.org/10.1109/infcom.2000.832540openalex-snapshot
An enhanced random early marking algorithm for Internet flow control
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209226openalex-snapshot
Can shortest-path routing and TCP maximize utility
inferred← citeshttps://doi.org/10.1109/infcom.2007.56openalex-snapshot
Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions
inferred← citeshttps://doi.org/10.1109/lcn.1992.228116openalex-snapshot
Sensitivity of the objective functions for joint flow control and optimal routing in computer networks
inferred← citeshttps://doi.org/10.1109/opnarc.2002.1019236openalex-snapshot
Global flow control for wide area overlay networks: a cost-benefit approach
inferred← citeshttps://doi.org/10.1109/pccc.1988.10061openalex-snapshot
Application of AI techniques to adaptive routing in wide-area networks
inferred← citeshttps://doi.org/10.1109/proc.1983.12802openalex-snapshot
A hierarchical scheme for multiobjective adaptive routing in large communication networks
inferred← citeshttps://doi.org/10.1109/tac.1983.1103183openalex-snapshot
Projected Newton methods and optimization of multicommodity flows
inferred← citeshttps://doi.org/10.1109/tac.1987.1104442openalex-snapshot
Combined routing and flow control in computer communication networks: A two-level adaptive scheme
inferred← citeshttps://doi.org/10.1109/tac.2018.2823270openalex-snapshot
A Surrogate Optimization-Based Mechanism for Resource Allocation and Routing in Networks With Strategic Agents
inferred← citeshttps://doi.org/10.1109/tc.1984.1676407openalex-snapshot
Performance Evaluation of the Computer Network Dynamic Congestion Table Algorthm
inferred← citeshttps://doi.org/10.1109/tcom.1984.1096159openalex-snapshot
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
inferred← citeshttps://doi.org/10.1109/tcom.1986.1096526openalex-snapshot
Interactions Between Routing and Flow Control Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2003.820434openalex-snapshot
Prevention of deadlocks and livelocks in lossless backpressured packet networks
inferred← citeshttps://doi.org/10.1109/tnet.2005.850219openalex-snapshot
Cross-layer optimization in TCP/IP networks
inferred← citeshttps://doi.org/10.1109/tnet.2005.857121openalex-snapshot
A cost-benefit flow control for reliable multicast and unicast in overlay networks
inferred← citeshttps://doi.org/10.1137/0322061openalex-snapshot
Two-Metric Projection Methods for Constrained Optimization
inferred← citeshttps://doi.org/10.1145/1558590.1558592openalex-snapshot
Distributed utility-based rate adaptation protocols for prioritized, quasi-elastic flows
inferred← citeshttps://doi.org/10.21236/ada097623openalex-snapshot
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
inferred← citeshttps://doi.org/10.22214/ijraset.2018.3482openalex-snapshot
Resource Allocation in Cellular Network with Device to Device Communication
inferred← citeshttps://doi.org/10.23919/acc.1983.4788204openalex-snapshot
Hierarchical Schemes for Adaptive Routing and Flow Control in Large Computer Networks
inferred← citeshttps://doi.org/10.3390/en15207634openalex-snapshot
Decomposition Methods for the Network Optimization Problem of Simultaneous Routing and Bandwidth Allocation Based on Lagrangian Relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.1507.00702openalex-snapshot
Centralized and Distributed Newton Methods for Network Optimization and Extensions
inferred← citeshttps://doi.org/10.7907/4dq0-ga49.openalex-snapshot
A theoretical study of internet congestion control: equilibrium and dynamics
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.