scientific article

Dimitri P. Bertsekas, Robert G. Gallager

Publication date: 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

queueing theory protocols data networks multiaccess communication routing methods

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items (only showing first 100 items - show all)

Heavy traffic limits for some queueing networks ⋮ Imitation dynamics with payoff shocks ⋮ Stability of constant retrial rate systems with NBU input ⋮ Which is the fairest allocation in the max-min fairness-based coalitional game? ⋮ Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis ⋮ Fairness in academic course timetabling ⋮ Simultaneous routing and flow rate optimization in energy-aware computer networks ⋮ Broadcasting in unstructured peer-to-peer overlay networks ⋮ Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network ⋮ Minimizing the stretch when scheduling flows of divisible requests ⋮ Fair imposition ⋮ Optimal cost sharing for capacitated facility location games ⋮ SRPT applied to bandwidth-sharing networks ⋮ Network lifetime-aware data collection in underwater sensor networks for delay-tolerant applications ⋮ Max-min fairness in multi-commodity flows ⋮ Optimal co-designs of communication and control in bandwidth-constrained cyber-physical systems ⋮ An \(H_{\infty}\) approach to the controller design of AQM routers supporting TCP flows ⋮ Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks ⋮ The proximal Chebychev center cutting plane algorithm for convex additive functions ⋮ Analysis of an \(M/\{D_{n}\}/1\) retrial queue ⋮ Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization ⋮ Maximum flow under proportional delay constraint ⋮ Fluid limits to analyze long-term flow rates of a stochastic network with ingress discarding ⋮ Marginal queue length approximations for a two-layered network with correlated queues ⋮ Sequential resource allocation with constraints: two-customer case ⋮ Controlled mobility in stochastic and dynamic wireless networks ⋮ On the enrouting protocol problem under uncertainty ⋮ Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks ⋮ A stability conjecture on bandwidth sharing networks ⋮ A loop-free shortest-path routing algorithm for dynamic networks ⋮ Proportional and maxmin fairness for the sensor location problem with chance constraints ⋮ An approximation to max min fairness in multi commodity networks ⋮ The implementation of dynamic rate allocation in sensor networks ⋮ Netscan: a procedure for generating reaction networks by size ⋮ One-channel networked data fusion with communication constraint ⋮ Fair online load balancing ⋮ Nash equilibrium based fairness ⋮ Queuing system with state-dependent controlled batch arrivals and server under maintenance ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ A novel server-side proxy caching strategy for large-scale multimedia applications ⋮ Tail asymptotic behaviour of resequencing buffer content for selective repeat ARQ ⋮ End-to-end maxmin fairness in multihop wireless networks: theory and protocol ⋮ Engineering a new algorithm for distributed shortest paths on dynamic networks ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Sparsity-promoting optimal control of cyber-physical systems over shared communication networks ⋮ Fair-by-design matching ⋮ On the characterization of aloha in underwater wireless networks ⋮ Mixed-integer nonlinear programs featuring ``on/off constraints ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ To be fair or efficient or a bit of both ⋮ Optimal admission control for tandem loss systems with two stations ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Linear loss networks ⋮ Lexicographic maximin optimisation for fair bandwidth allocation in computer networks ⋮ Decentralized algorithm for centralized variational inequalities in network resource allocation ⋮ Distributed bandwidth allocation based on alternating evolution algorithm ⋮ SCDN: stable content distribution network based on demands ⋮ Energy-efficient cooperative data aggregation for wireless sensor networks ⋮ On Kelly networks with shuffling ⋮ Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts ⋮ Modeling max-min fair bandwidth allocation in BitTorrent communities ⋮ Stability analysis of \(\mathrm{GI}/\mathrm{GI}/c/K\) retrial queue with constant retrial rate ⋮ Distance vector-based advance reservation with delay performance guarantees ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ A scaling analysis of a star network with logarithmic weights ⋮ On a bi-dimensional dynamic alternative routing method ⋮ The role of stochastic programming in communication network design ⋮ Dynamic tree algorithms ⋮ Partially dynamic efficient algorithms for distributed shortest paths ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Choosing the capacity of arcs with constraint on flow delay time ⋮ Controllable Markov jump processes. II: Monitoring and optimization of TCP connections ⋮ Binary search with delayed and missing answers ⋮ A retrial system with two input streams and two orbit queues ⋮ Extended monotropic programming and duality ⋮ Instability of sharing systems in the presence of retransmissions ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ On solving two-stage distributionally robust disjunctive programs with a general ambiguity set ⋮ Conflict-resolving tree algorithm stable to incomplete interference damping ⋮ Admission control strategies for tandem Markovian loss systems ⋮ A multi-tree routing scheme using acyclic orientations ⋮ An asymptotic approximation for TCP CUBIC ⋮ Stabilizing time-adaptive protocols ⋮ Scheduling in synchronous networks and the greedy algorithm ⋮ Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy ⋮ Contention resolution, matrix scaling and fair allocation ⋮ Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ A fairness relation based on the asymmetric Choquet integral and its application in network resource allocation problems ⋮ Performance analysis and optimization of web proxy servers and mirror sites ⋮ Perfect codes in the discrete simplex ⋮ Voronoi-like nondeterministic partition of a lattice by collectives of finite automata ⋮ Computation for latent variable model estimation: a unified stochastic proximal framework ⋮ Local edge minimality of SRPT networks with shared resources ⋮ An improved branch and bound algorithm for mixed integer nonlinear programs ⋮ Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization ⋮ Optimization of an internationally distributed air-ground airline telecommunication system ⋮ Optimization models for ATM network planning

This page was built for publication: