On the public citation graph
Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions
0 signed · 51 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.1007/978-0-8176-8216-3openalex-snapshot
The Mathematics of Internet Congestion Control
inferredcites →https://doi.org/10.1016/s1388-3437(01)80171-2openalex-snapshot
Optimization based rate control for multipath sessions
inferredcites →https://doi.org/10.1038/sj.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1057/palgrave.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1109/90.811451openalex-snapshot
Optimization flow control. I. Basic algorithm and convergence
inferredcites →https://doi.org/10.1109/90.879343openalex-snapshot
Fair end-to-end window-based congestion control
inferredcites →https://doi.org/10.1109/cdc.2001.981185openalex-snapshot
Congestion control for fair resource allocation in networks with multicast flows
inferredcites →https://doi.org/10.1109/cdc.2004.1428758openalex-snapshot
Combined control of routing and flow: a multipath routing approach
inferredcites →https://doi.org/10.1109/ciss.2006.286488openalex-snapshot
Congestion control with adaptive multipath routing based on optimization
inferredcites →https://doi.org/10.1109/icc.2006.254883openalex-snapshot
TCP/IP Interaction Based on Congestion Price: Stability and Optimality
inferredcites →https://doi.org/10.1109/infcom.1993.253311openalex-snapshot
Stability of a class of dynamic routing protocols (IGRP)
inferredcites →https://doi.org/10.1109/infcom.2001.916694openalex-snapshot
Optimization based rate control for multirate multicast sessions
inferredcites →https://doi.org/10.1109/tac.1982.1102884openalex-snapshot
Dynamic behavior of shortest path routing algorithms for communication networks
inferredcites →https://doi.org/10.1109/tac.2004.841398openalex-snapshot
The Mathematics of Internet Congestion Control
inferredcites →https://doi.org/10.1109/tac.2006.875032openalex-snapshot
Utility Maximization for Communication Networks With Multipath Routing
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1109/tcom.1984.1096159openalex-snapshot
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
inferredcites →https://doi.org/10.1109/tnet.2002.1012364openalex-snapshot
Bandwidth sharing: objectives and algorithms
inferredcites →https://doi.org/10.1109/tnet.2003.815297openalex-snapshot
A duality model of TCP and queue management algorithms
inferredcites →https://doi.org/10.1109/tnet.2003.818183openalex-snapshot
End-to-end congestion control schemes: utility functions, random losses and ecn marks
inferredcites →https://doi.org/10.1109/tnet.2004.826293openalex-snapshot
Congestion Control for Fair Resource Allocation in Networks With Multicast Flows
inferredcites →https://doi.org/10.1109/tnet.2005.850219openalex-snapshot
Cross-layer optimization in TCP/IP networks
inferredcites →https://doi.org/10.1145/1064413.1064415openalex-snapshot
Stability of end-to-end algorithms for joint routing and rate control
inferredcites →https://doi.org/10.21236/ada088767openalex-snapshot
Flow Control and Routing Algorithms for Data Networks
inferredcites →https://doi.org/10.7907/262z-0j78openalex-snapshot
Optimization and Stability of TCP/IP with Delay-Sensitive Utility Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11235-011-9450-3openalex-snapshot
Recovering a game model from an optimal channel access scheme for WLANs
inferred← citeshttps://doi.org/10.1007/s12083-017-0594-0openalex-snapshot
Adaptive Flow Rate Control for Network Utility Maximization Subject to QoS Constraints in Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.07.001openalex-snapshot
Congestion control and its stability in networks with delay sensitive traffic
inferred← citeshttps://doi.org/10.1109/acc.2008.4586779openalex-snapshot
Stability of congestion control schemes with delay sensitive traffic
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402975openalex-snapshot
Utility-optimal dynamic rate allocation under average end-to-end delay requirements
inferred← citeshttps://doi.org/10.1109/glocom.2007.520openalex-snapshot
Congestion Control in Networks with Delay Sensitive Traffic
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425408openalex-snapshot
How Bad is Single-Path Routing
inferred← citeshttps://doi.org/10.1109/icc.2016.7511464openalex-snapshot
Optimal proactive cache management in mobile networks
inferred← citeshttps://doi.org/10.1109/icccn.2013.6614116openalex-snapshot
Congestion Control with QoS and Delays Utility Function
inferred← citeshttps://doi.org/10.1109/icisa.2014.6847370openalex-snapshot
Bandwidth Provisioning with QoS User Utility Function in NUM
inferred← citeshttps://doi.org/10.1109/infcom.2007.68openalex-snapshot
Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links
inferred← citeshttps://doi.org/10.1109/jproc.2006.887322openalex-snapshot
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
inferred← citeshttps://doi.org/10.1109/roedunet64292.2024.10722254openalex-snapshot
Reverse Engineering Approach to Validate the Implementation of Network Protocols in Operating Systems
inferred← citeshttps://doi.org/10.1109/tcns.2017.2677202openalex-snapshot
Multiperiod Network Rate Allocation With End-to-End Delay Constraints
inferred← citeshttps://doi.org/10.1109/tcomm.2009.05.070198openalex-snapshot
Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links
inferred← citeshttps://doi.org/10.1109/tmlcn.2025.3598739openalex-snapshot
Reverse Engineering Segment Routing Policies and Link Costs With Inverse Reinforcement Learning and EM
inferred← citeshttps://doi.org/10.1109/tnet.2008.2008419openalex-snapshot
Distributed Iterative Optimal Resource Allocation With Concurrent Updates of Routing and Flow Control Variables
inferred← citeshttps://doi.org/10.1109/tnet.2011.2150761openalex-snapshot
Cost of Not Splitting in Routing: Characterization and Estimation
inferred← citeshttps://doi.org/10.12785/ijcnt/010304openalex-snapshot
Resource Allocation with Delay QoS
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.12openalex-snapshot
CAQE: A Contract Driven Approach to Processing Concurrent Decision Support Queries
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.