On the public citation graph
Communication Nets: Stochastic Message Flow and Delay
0 signed · 559 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.5052996openalex-extracted
Asip Tandem Queues with Lévy Input and Consumption
inferred← citeshttps://doi.org/10.1002/1520-6750(199202)39:1<41::aid-nav3220390104>3.0.co;2-kopenalex-snapshot
Distribution of the workload in multiclass queueing systems with server vacations
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0186openalex-snapshot
Conservation Laws and Related Applications
inferred← citeshttps://doi.org/10.1002/9781118562819.ch9openalex-snapshot
Flow Models and Optimization for Network Coding
inferred← citeshttps://doi.org/10.1002/9781119779391.ch8openalex-snapshot
The Transformation of Defense Innovation Systems
inferred← citeshttps://doi.org/10.1002/asi.4630230403openalex-snapshot
Information networks: Definitions and message transfer models
inferred← citeshttps://doi.org/10.1002/dac.5439openalex-snapshot
L‐RUBI: An efficient load‐based resource utilization algorithm for bi‐partite scatternet in wireless personal area networks
inferred← citeshttps://doi.org/10.1002/dac.881openalex-snapshot
On the application of forking nodes to product‐form queueing networks
inferred← citeshttps://doi.org/10.1002/ecja.4400660111openalex-snapshot
Usage characteristics of detour routes in store‐and‐forward switching networks
inferred← citeshttps://doi.org/10.1002/ecja.4410720110openalex-snapshot
Packet‐switched network design with constraints on the circuit discreteness
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1987.tb00213.xopenalex-snapshot
Performance Analysis and Application of a Two-Priority Packet Queue
inferred← citeshttps://doi.org/10.1002/nav.21617openalex-snapshot
Optimal service‐capacity allocation in a loss system
inferred← citeshttps://doi.org/10.1002/nav.3800210108openalex-snapshot
Experiments in communication networks
inferred← citeshttps://doi.org/10.1002/nav.3800230209openalex-snapshot
Multichannel queueing systems with heterogeneous classes of arrivals
inferred← citeshttps://doi.org/10.1002/net.1975.5.3.205openalex-snapshot
Multiterminal Path Flows for Packet‐Switching Communication Networks
inferred← citeshttps://doi.org/10.1002/net.21877openalex-snapshot
An optimization approach for congestion control in network routing with quality of service requirements
inferred← citeshttps://doi.org/10.1002/net.3230020205openalex-snapshot
Computer communication network design: Experience with theory and practice
inferred← citeshttps://doi.org/10.1002/net.3230030202openalex-snapshot
The flow deviation method: An approach to store‐and‐forward communication network design
inferred← citeshttps://doi.org/10.1002/net.3230030203openalex-snapshot
KWIC Index for Computer Networks
inferred← citeshttps://doi.org/10.1002/net.3230100305openalex-snapshot
Optimal clustering structures for hierarchical topological design of large computer networks
inferred← citeshttps://doi.org/10.1006/iilr.1997.0042openalex-snapshot
The Evolution of the Internet as a Global Information System
inferred← citeshttps://doi.org/10.1007/1-4020-5509-9openalex-snapshot
Real-Time Applications with Stochastic Task Execution Times: Analysis and Optimisation
inferred← citeshttps://doi.org/10.1007/11759355_23openalex-snapshot
Multiservice IP Network QoS Parameters Estimation in Presence of Self-similar Traffic
inferred← citeshttps://doi.org/10.1007/3-540-45245-1_7openalex-snapshot
A Stochastic Framework for Co-synthesis of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-47906-6_33openalex-snapshot
Capacity Assignment in Bluetooth Scatternets — Analysis and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-64574-8_391openalex-snapshot
A fast and efficient solution to the Capacity Assignment problem using discretized learning automata
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_2openalex-snapshot
Nonlinear Programming in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-1-4613-1861-3_5openalex-snapshot
Application of the General Linear Model (GLM) and Operations Research (OR) Models to the Optimization of Field Exploration and Development Planning
inferred← citeshttps://doi.org/10.1007/978-1-4615-4060-1_4openalex-snapshot
Extremal Vector Pairs and Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4615-5087-7_6openalex-snapshot
The Common Structure of Packet - and Circuit-Switched Network Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4615-9056-9_3openalex-snapshot
Modeling and Design of Distributed Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4899-3536-6_9openalex-snapshot
The Sociological and Economic Approaches to Labor Market Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-61014-1_1openalex-snapshot
Introduction to Internet Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-77278-8_3openalex-snapshot
Performance Analysis for SGINs
inferred← citeshttps://doi.org/10.1007/978-3-0348-5936-3_11openalex-snapshot
Problems in Computer Network Optimalization
inferred← citeshttps://doi.org/10.1007/978-3-319-19830-9_22openalex-snapshot
Estimation of the Mean Message Delay for Transport Coding
inferred← citeshttps://doi.org/10.1007/978-3-540-48765-4_66openalex-snapshot
On Solving the Capacity Assignment Problem Using Continuous Learning Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-75276-9_8openalex-snapshot
Content, Communication and Tools
inferred← citeshttps://doi.org/10.1007/978-3-540-85863-8_72openalex-snapshot
Modeling the Nonlinear Nature of Response Time in the Vertical Fragmentation Design of Distributed Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot
Optimization of OSPF Routing in IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15390-7_18openalex-snapshot
Vertical Fragmentation Design of Distributed Databases Considering the Nonlinear Nature of Roundtrip Response Time
inferred← citeshttps://doi.org/10.1007/978-3-642-76484-4_12openalex-snapshot
Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly
inferred← citeshttps://doi.org/10.1007/978-3-642-78495-8_2openalex-snapshot
Performance Modeling of ATM-Based Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-86726-2_10openalex-snapshot
Throughput analysis of a flow-controlled communication network with buffer space limitations
inferred← citeshttps://doi.org/10.1007/978-3-642-86726-2_12openalex-snapshot
Distributed Asynchronous Optimal Routing in Data Networks
inferred← citeshttps://doi.org/10.1007/978-94-009-9062-3_48openalex-snapshot
Congestion Control Techniques for Packet Networks
inferred← citeshttps://doi.org/10.1007/978-94-011-7577-7_1openalex-snapshot
Stochastic Problems of Multiple Communication
inferred← citeshttps://doi.org/10.1007/978-94-011-7577-7_47openalex-snapshot
Statistical Modelling and Analysis for Adaptive Routing in Computer Networks
inferred← citeshttps://doi.org/10.1007/978-94-011-7580-7_3openalex-snapshot
Basic Analytical Techniques and Routing Procedures
inferred← citeshttps://doi.org/10.1007/978-94-011-7580-7_4openalex-snapshot
Performance Models and Measurements of the ARPA Computer Network
inferred← citeshttps://doi.org/10.1007/978-981-99-8972-0_2openalex-snapshot
The Socio-technical Development of Digital Maps
inferred← citeshttps://doi.org/10.1007/bf00998325openalex-snapshot
G/M/1 queue study of buffer behavior in the decoding system of computer communication
inferred← citeshttps://doi.org/10.1007/bf01055703openalex-snapshot
A mean-field limit for a class of queueing networks
inferred← citeshttps://doi.org/10.1007/bf01149192openalex-snapshot
Workloads and waiting times in single-server systems with multiple customer classes
inferred← citeshttps://doi.org/10.1007/bf01150051openalex-snapshot
A bibliography of books and survey papers on queueing systems: Theory and applications
inferred← citeshttps://doi.org/10.1007/bf01154545openalex-snapshot
Two queues with alternating service and server breakdown
inferred← citeshttps://doi.org/10.1007/bf01158637openalex-snapshot
A review of open queueing network models of manufacturing systems
inferred← citeshttps://doi.org/10.1007/bf01192718openalex-snapshot
Local mean-field Markov processes: An application to message-switching networks
inferred← citeshttps://doi.org/10.1007/bf01193934openalex-snapshot
The cycle time distribution in a cycle of Bernoulli servers in discrete time
inferred← citeshttps://doi.org/10.1007/bf01262049openalex-snapshot
Data-delay evaluation in integrated wireless networks based on local product-form solutions for voice occupancy
inferred← citeshttps://doi.org/10.1007/bf01721100openalex-snapshot
Routing Algorithmen in Datennetzen — eine vergleichende Simulationsstudie
inferred← citeshttps://doi.org/10.1007/bf01783514openalex-snapshot
Configuring wide area computer networks
inferred← citeshttps://doi.org/10.1007/bf02094331openalex-snapshot
A system for priority routing and capacity assignment in packet switched networks
inferred← citeshttps://doi.org/10.1007/bf02094334openalex-snapshot
Optimal design of LAN-WAN internetworks: An approach using simulated annealing
inferred← citeshttps://doi.org/10.1007/bf02110041openalex-snapshot
Proximal decomposition for multicommodity flow problems with convex costs
inferred← citeshttps://doi.org/10.1007/bf02114303openalex-snapshot
Multi-hour design of computer backbone networks
inferred← citeshttps://doi.org/10.1007/bf03179682openalex-snapshot
L’indiscernabilité locale dans les réseaux de files d’attente à multiliaisons ou multiserveurs
inferred← citeshttps://doi.org/10.1007/bfb0005195openalex-snapshot
Two identical communication channels in series with a finite intermediate buffer and overflow
inferred← citeshttps://doi.org/10.1007/bfb0008288openalex-snapshot
Adaptive routing in radio communication networks
inferred← citeshttps://doi.org/10.1007/bfb0113287openalex-snapshot
A dual method for optimal routing in packet-switched networks
inferred← citeshttps://doi.org/10.1007/s00291-022-00668-xopenalex-snapshot
Design of multi-service systems with facilities functioning as open Jackson queueing networks: application to online shopping stores
inferred← citeshttps://doi.org/10.1007/s10107-007-0151-3openalex-snapshot
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
inferred← citeshttps://doi.org/10.1007/s10107-014-0772-2openalex-snapshot
Primal convergence from dual subgradient methods for convex optimization
inferred← citeshttps://doi.org/10.1007/s10479-013-1418-0openalex-snapshot
Optimal workload allocation in closed queueing networks with state dependent queues
inferred← citeshttps://doi.org/10.1007/s10586-021-03343-yopenalex-snapshot
Modeling and analysis of distributed schedulers in data center cluster networks
inferred← citeshttps://doi.org/10.1007/s10955-008-9658-0openalex-snapshot
Spontaneous Resonances and the Coherent States of the Queuing Networks
inferred← citeshttps://doi.org/10.1007/s11122-005-0027-1openalex-snapshot
Poisson Hypothesis: Combinatorial Aspect
inferred← citeshttps://doi.org/10.1007/s11134-012-9336-4openalex-snapshot
Cost sharing of cooperating queues in a Jackson network
inferred← citeshttps://doi.org/10.1007/s11134-015-9462-xopenalex-snapshot
Stabilizing performance in a single-server queue with time-varying arrival rate
inferred← citeshttps://doi.org/10.1007/s11235-005-1690-7openalex-snapshot
Loss Probability for a Finite Buffer Multiplexer with the M/G/∞ Input Process
inferred← citeshttps://doi.org/10.1007/s11276-006-6537-yopenalex-snapshot
Analysis of bandwidth allocation algorithms for wireless personal area networks
inferred← citeshttps://doi.org/10.1007/s11590-015-0963-7openalex-snapshot
Locating facilities in a competitive environment
inferred← citeshttps://doi.org/10.1007/s11704-013-3095-1openalex-snapshot
On applying stochastic network calculus
inferred← citeshttps://doi.org/10.1007/s12351-015-0205-xopenalex-snapshot
Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method
inferred← citeshttps://doi.org/10.1016/0016-0032(69)90028-3openalex-snapshot
Analysis and design of communication networks with memory
inferred← citeshttps://doi.org/10.1016/0026-2714(81)90547-3openalex-snapshot
Computer-communication network reliability: Trends and issues
inferred← citeshttps://doi.org/10.1016/0026-2714(90)90284-topenalex-snapshot
Computer communication networks—A study in the Indian context
inferred← citeshttps://doi.org/10.1016/0026-2714(94)90072-8openalex-snapshot
Delay related reliability: A new performance index for computer communication network dynamics
inferred← citeshttps://doi.org/10.1016/0041-1647(73)90014-2openalex-snapshot
Design of air transportation networks
inferred← citeshttps://doi.org/10.1016/0140-3664(78)90164-0openalex-snapshot
Flow control in message-switched communications networks
inferred← citeshttps://doi.org/10.1016/0140-3664(81)90014-1openalex-snapshot
Performance considerations for integrated voice and data networks
inferred← citeshttps://doi.org/10.1016/0166-5316(82)90009-8openalex-snapshot
Queueing network models of packet switching networks part 2: Networks with population size constraints
inferred← citeshttps://doi.org/10.1016/0166-5316(82)90017-7openalex-snapshot
Queuing network models of packet switching networks part 1: Open networks
inferred← citeshttps://doi.org/10.1016/0166-5316(86)90016-7openalex-snapshot
Performance analysis of a virtual circuit protocol with local control
inferred← citeshttps://doi.org/10.1016/0166-5316(89)90017-5openalex-snapshot
A conservation law based approximate analysis for a class of simultaneous resource possession problems
inferred← citeshttps://doi.org/10.1016/0166-5316(90)90026-fopenalex-snapshot
Performance analysis of transport protocols over congestive channels
inferred← citeshttps://doi.org/10.1016/0166-5316(93)90031-oopenalex-snapshot
Efficient visit orders for polling systems
inferred← citeshttps://doi.org/10.1016/0166-5316(94)00045-lopenalex-snapshot
A bridge between preemptive and non-preemptive queueing models
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90040-0openalex-snapshot
Capacity allocation in generalized Jackson networks
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90128-topenalex-snapshot
A parallel optimal routing algorithm
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90017-5openalex-snapshot
A new bus contention scheme in S/NET with dynamic priority
inferred← citeshttps://doi.org/10.1016/0169-7552(85)90001-7openalex-snapshot
On the selection of primary paths for a communication network
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90086-jopenalex-snapshot
The delay analysis in a noisy general cut-through switching network
inferred← citeshttps://doi.org/10.1016/0305-0483(87)90030-2openalex-snapshot
A network queueing model for data communication systems
inferred← citeshttps://doi.org/10.1016/0305-0483(91)90017-nopenalex-snapshot
Is queueing theory dead?
inferred← citeshttps://doi.org/10.1016/0305-0548(96)00017-2openalex-snapshot
Resource allocation and capacity assignment in distributed systems
inferred← citeshttps://doi.org/10.1016/0307-904x(86)90094-6openalex-snapshot
On the capacity assignment problem in packet-switching computer networks
inferred← citeshttps://doi.org/10.1016/0360-8352(87)90090-8openalex-snapshot
Effects of message segmentation in tandem-node computer networks
inferred← citeshttps://doi.org/10.1016/0376-5075(77)90002-2openalex-snapshot
Hierarchical routing for large networks Performance evaluation and optimization
inferred← citeshttps://doi.org/10.1016/0376-5075(78)90026-0openalex-snapshot
Optimization of mixed-media communication networks
inferred← citeshttps://doi.org/10.1016/0376-5075(78)90037-5openalex-snapshot
Trade-offs of secure processing in centralized versus distributed networks
inferred← citeshttps://doi.org/10.1016/0376-5075(78)90038-7openalex-snapshot
Distribution of end-to-end delay in message-switched networks
inferred← citeshttps://doi.org/10.1016/0376-5075(79)90004-7openalex-snapshot
Stochastic performance evaluation of hierarchical routing for large networks
inferred← citeshttps://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferred← citeshttps://doi.org/10.1016/0376-5075(80)90004-5openalex-snapshot
Analysis and design issues addressed at ICCC '78
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90204-mopenalex-snapshot
Topological design of computer communication networks — The overall design problem
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/b978-0-08-031132-6.50006-4openalex-snapshot
SOME INVESTIGATIONS ON COMMUNICATION SWITCHING TECHNIQUES IN COMPUTER NETWORKS
inferred← citeshttps://doi.org/10.1016/b978-0-12-012722-1.50013-0openalex-snapshot
Learning Automata in Distributed Control Systems
inferred← citeshttps://doi.org/10.1016/b978-012395173-1/50002-5openalex-snapshot
Growth of the Internet
inferred← citeshttps://doi.org/10.1016/b978-155558207-4/50004-5openalex-snapshot
Network design and modeling
inferred← citeshttps://doi.org/10.1016/j.adhoc.2018.05.015openalex-snapshot
Internet congestion control using the power metric: Keep the pipe just full, but no fuller
inferred← citeshttps://doi.org/10.1016/j.apm.2012.03.027openalex-snapshot
Design of computer network topologies: A Vroom Inspired Psychoclonal Algorithm
inferred← citeshttps://doi.org/10.1016/j.cam.2013.09.057openalex-snapshot
Minimizing roundtrip response time in distributed databases with vertical fragmentation
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.06.013openalex-snapshot
Analysis and control of correlated web server queues
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.12.013openalex-snapshot
Robust network planning in nonuniform traffic scenarios
inferred← citeshttps://doi.org/10.1016/j.comcom.2020.12.018openalex-snapshot
Boosting performance for software defined networks from traffic engineering perspective
inferred← citeshttps://doi.org/10.1016/j.comcom.2024.107985openalex-snapshot
Safe load balancing in software-defined-networking
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.04.002openalex-snapshot
Information-centric networking: The evolution from circuits to packets to content
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.04.003openalex-snapshot
Professor Leonard Kleinrock – Tribute Volume
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.04.006openalex-snapshot
Reprint of “Virtual cut-through: A new computer communication switching technique”
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.03.013openalex-snapshot
PRIME: A partial path establishment based handover management technique for QoS support in WiMAX based wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.cor.2004.04.004openalex-snapshot
A tabu search algorithm for the routing and capacity assignment problem in computer networks
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.021openalex-snapshot
Leveraging duality for the gamma-robust segment routing traffic engineering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.04.016openalex-snapshot
Rerouting tunnels for MPLS network resource optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.08.014openalex-snapshot
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.01.051openalex-snapshot
Models for the piecewise linear unsplittable multicommodity flow problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.04.011openalex-snapshot
Multi-period hub network design from a dual perspective: An integrated approach considering congestion, demand uncertainty, and service quality optimization
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.09.026openalex-snapshot
Single allocation hub location problem under congestion: Network owner and user perspectives
inferred← citeshttps://doi.org/10.1016/j.future.2025.107824openalex-snapshot
Dimensioning network slices for power minimization under reliability constraints
inferred← citeshttps://doi.org/10.1016/j.jnca.2009.03.009openalex-snapshot
Impact of bounded delay on throughput in multi-hop networks
inferred← citeshttps://doi.org/10.1016/j.orl.2011.06.015openalex-snapshot
A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion
inferred← citeshttps://doi.org/10.1016/j.peva.2010.08.010openalex-snapshot
Analysis of scheduling policies under correlated job sizes
inferred← citeshttps://doi.org/10.1016/j.peva.2023.102380openalex-snapshot
ASIP tandem queues with consumption
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.018openalex-snapshot
True-concurrency probabilistic models: Markov nets and a law of large numbers
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102069openalex-snapshot
Hub-and-spoke network design under congestion: A learning based metaheuristic
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104285openalex-snapshot
Single allocation hub location problems with congestion: Mixed-integer second-order cone programming and Benders decomposition
inferred← citeshttps://doi.org/10.1016/s0140-3664(00)00224-3openalex-snapshot
A neural network method for minimum delay routing in packet-switched networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(97)00039-xopenalex-snapshot
Fault-tolerant design of packet switched network with unreliable links
inferred← citeshttps://doi.org/10.1016/s0140-3664(97)00104-7openalex-snapshot
Queuing analysis of a non-pre-emptive MMPP/D/1 priority system
inferred← citeshttps://doi.org/10.1016/s0140-3664(97)00111-4openalex-snapshot
Combined channel allocation and routing algorithms in packet switched networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00175-3openalex-snapshot
A system for the design of packet-switched communication networks with economic tradeoffs
inferred← citeshttps://doi.org/10.1016/s0141-9331(99)00033-2openalex-snapshot
A multilevel modeling and analysis of network-centric systems
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00041-9openalex-snapshot
The forwarding diameter of graphs
inferred← citeshttps://doi.org/10.1016/s0166-5316(01)00058-xopenalex-snapshot
Modeling of interconnection subsystems for massively parallel computers
inferred← citeshttps://doi.org/10.1016/s0166-5316(96)00058-2openalex-snapshot
Some results for steady-state and sojourn time distributions in open and closed linear networks of Bernoulli servers with state-dependent service and arrival rates
inferred← citeshttps://doi.org/10.1016/s0169-7552(09)80005-6openalex-snapshot
Performance analysis of prioritized state-dependent buffer-management schemes in ATM networks
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00117-7openalex-snapshot
Fast time-dependent evaluation of multi-service networks
inferred← citeshttps://doi.org/10.1016/s0278-6125(99)80033-8openalex-snapshot
Queueing theory in manufacturing: A survey
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00151-3openalex-snapshot
Managing variances in manufacturing system design
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00401-3openalex-snapshot
Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00162-3openalex-snapshot
Routing and capacity assignment in backbone communication networks under time varying traffic conditions
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80110-0openalex-snapshot
Chapter 6 Network equilibrium models and algorithms
inferred← citeshttps://doi.org/10.1016/s0969-6016(98)00007-0openalex-snapshot
Design of Interconnection of Local Area Networks
inferred← citeshttps://doi.org/10.1016/s1319-1578(97)80006-7openalex-snapshot
Improving Fairness in Packetized Computer Data Networks
inferred← citeshttps://doi.org/10.1016/s1388-3437(97)80058-3openalex-snapshot
An analytical model for wormhole routing with finite size input buffers
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)41796-4openalex-snapshot
An Algorithm for Optimal Routing
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)66103-2openalex-snapshot
Multivariable Control of Data Networks *
inferred← citeshttps://doi.org/10.1017/jpr.2021.31openalex-snapshot
Replica-mean-field limits of fragmentation-interaction-aggregation processes
inferred← citeshttps://doi.org/10.1017/s0001867800032845openalex-snapshot
On a tandem queueing model with identical service times at both counters, I
inferred← citeshttps://doi.org/10.1017/s0001867800032857openalex-snapshot
On a tandem queueing model with identical service times at both counters, II
inferred← citeshttps://doi.org/10.1017/s0269964800004514openalex-snapshot
Convergence of Departures in Tandem Networks of·/GI/ ∞ Queues
inferred← citeshttps://doi.org/10.1023/a:1008214527268openalex-snapshot
Using Augmented Infinitesimal Perturbation Analysis for Capacity Planning in Intree ATM Networks
inferred← citeshttps://doi.org/10.1023/a:1008782926733openalex-snapshot
A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization
inferred← citeshttps://doi.org/10.1023/a:1011040100856openalex-snapshot
Queueing Models with Multiple Waiting Lines
inferred← citeshttps://doi.org/10.1023/a:1011280023547openalex-snapshot
Capacity and flow assignment of data networks by generalized Benders decomposition
inferred← citeshttps://doi.org/10.1023/a:1019174417470openalex-snapshot
The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case
inferred← citeshttps://doi.org/10.1023/a:1021832618060openalex-snapshot
The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees
inferred← citeshttps://doi.org/10.1023/a:1027321806934openalex-snapshot
Capacity Assignment in Bluetooth Scatternets – Optimal and Heuristic Algorithms
inferred← citeshttps://doi.org/10.1049/el:19901219openalex-snapshot
Error control strategies for cut-through switching network
inferred← citeshttps://doi.org/10.1049/iet-net.2012.0141openalex-snapshot
Adaptive quality of service aware multi‐mobility anchor point registration in hierarchical mobile IPv6 wireless access networks
inferred← citeshttps://doi.org/10.1049/ip-i-2.1993.0042openalex-snapshot
Performance analysis of a dynamic priority scheduling method in ATM networks
showing the first 200 of 559 · page through all 559
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.