scientific article
From MaRDI portal
Publication:3996925
zbMath0702.68017MaRDI QIDQ3996925
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (16)
A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events ⋮ On the steady-state queue size distribution of the discrete-time \(\text{Geo}/G/1\) queue with repeated customers ⋮ On the applicability of the number of collisions in \(p\)-persistent CSMA/CD protocols ⋮ ALOHA networks: a game-theoretic approach ⋮ Communication parameter design for networked control systems with the slotted ALOHA access protocol ⋮ On time-triggered and event-based control of integrator systems over a shared communication system ⋮ Performance analysis of CSMA and BTMA protocols in multihop networks. I: Single channel case ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ A class of algorithms for collision resolution with multiplicity estimation ⋮ Performance analysis of a block-structured discrete-time retrial queue with state-dependent arrivals ⋮ Simulation Modeling and Performance Evaluation of Multiple Access Protocols ⋮ Dependence between path-length and size in random digital trees ⋮ An integrated DBP for streams with (m, k)-firm real-time guarantee ⋮ Bayesian estimation in dynamic framed slotted ALOHA algorithm for RFID system ⋮ Conflict-resolving tree algorithm stable to incomplete interference damping ⋮ On queueing delays of dispersed messages
This page was built for publication:
