scientific article; zbMATH DE number 710624
From MaRDI portal
Publication:4319638
zbMath0825.68147MaRDI QIDQ4319638
Publication date: 11 January 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmdesigninterfacecomputer networkdata transmissionLANnetwork architectureopen systemstandardizationelectronic mailISDNpublic communications networks
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Computer system organization (68Mxx)
Related Items
A Logical Approach to Data-Aware Automated Sequence Generation ⋮ Refinement-oriented probability for CSP ⋮ Design alternatives for wireless local area networks ⋮ Nearly optimal bounds for distributed wireless scheduling in the SINR model ⋮ Performance analysis of a scheme for concurrency/synchronization using queueing network models ⋮ Explicit-State Model Checking ⋮ On the communication complexity of polling ⋮ Real time process algebra ⋮ Interpreting message flow graphs ⋮ Reliable broadcasts and communication models: tradeoffs and lower bounds ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ SYNTHESIS OF PIECEWISE-LINEAR CHAOTIC MAPS: INVARIANT DENSITIES, AUTOCORRELATIONS, AND SWITCHING ⋮ A single server queue with gated processor-sharing discipline ⋮ Self avoiding paths routing algorithm in scale-free networks ⋮ Combined capacity planning and concentrator location in computer communications networks ⋮ Verification of graph grammars using a logical approach ⋮ Techniques for pipelined broadcast on Ethernet switched clusters ⋮ Link scheduling in wireless sensor networks: distributed edge-coloring revisited ⋮ The influence of dependence on data network models ⋮ Deterministic broadcasting in ad hoc radio networks ⋮ Performance modeling and optimization of networks of bridged LANs ⋮ A unified set of proposals for control and design of high speed data networks ⋮ Synchronization in federation community networks ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ On single courier problem ⋮ Topological Design of Centralized Computer Networks ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ State Coverage Metrics for Specification-Based Testing with Büchi Automata ⋮ Continuous relaxation for discrete DC programming ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Performance modeling of heterogeneous data networks ⋮ A CCS-based investigation of deadlock in a multi-process electronic mail system ⋮ LiMoSense: live monitoring in dynamic sensor networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Two phases encryption and its applications ⋮ A new password authentication mechanism based on two phases encryption ⋮ Task assignment in distributed computing systems ⋮ Distribution of distinguishable objects to bins: generating all distributions ⋮ A Reliability and Performance Model For Static Data Flow Machines ⋮ Developing Topology Discovery in Event-B ⋮ Generating all distributions of objects to bins ⋮ Specification and analysis of a composition of protocols ⋮ Characterising Testing Preorders for Broadcasting Distributed Systems ⋮ UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS ⋮ Network modules help the identification of key transport routes, signaling pathways in cellular and other networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ THE CONTROL OF STARVATION ⋮ Performance analysis and functional verification of the stop-and-wait protocol in HOL ⋮ The paging drum queue: A uniform perspective and further results ⋮ Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem ⋮ Unnamed Item
