By Topic

Network Protocols, 1993. Proceedings., 1993 International Conference on

Date 19-22 Oct. 1993

Filter Results

Displaying Results 1 - 25 of 43
  • 1993 International Conference on Network Protocols

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • On Petri nets and self-stabilization of communication protocols

    Publication Year: 1993, Page(s):166 - 174
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    With Petri nets as the concurrent model, the issue of self-stabilizing communication protocols is discussed. It is argued that self-stabilizing extensions of communication protocols should not interfere with their normal operations by giving a new definition of self-stabilizing extension and a ring net that meets the new definition. It is also argued that communication protocols are usually delay ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and congestion control in ATM networks

    Publication Year: 1993, Page(s):344 - 349
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    A new routing and, performed by the leaky bucket regulators, congestion control strategy in ATM networks is proposed. The “potential” source provides the network with its characteristics and required quality of service. Based on this information, the network makes the admission and routing decisions and selects parameters of the leaky bucket “regulators” reinforcing the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A congestion notification technique for SMDS networks

    Publication Year: 1993, Page(s):178 - 185
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The proposed congestion notification strategy for SMDS networks presented in this paper is based on explicit notification, which uses control messages to inform other network elements of congestion. Network elements respond to explicit notifications by matching the traffic entering the network to the network loading. For an effective congestion management strategy, the notifications should carry s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel neural network traffic descriptor for ATM networks

    Publication Year: 1993, Page(s):350 - 357
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Accurate characterization of the multimedia traffic is essential, in asynchronous transfer mode (ATM) broadband networks, in order to develop a robust set of traffic descriptors. Such a set is required, by the usage parameter control (UPC) algorithm, for traffic enforcement (policing). The authors present a novel approach to characterize and model the multimedia traffic using neural networks (NNs)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive rate-based congestion control versus TCP-SS: a performance comparison

    Publication Year: 1993, Page(s):186 - 197
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Recent simulation studies of TCP congestion control Slow-Start clearly show problems of oscillatory behavior in packet delay, congestion windows and throughput. Furthermore, it also suffers from rapid fluctuations in queue length, periodic packet losses, and underutilization of the transmission line in a large pipeline size and/or two-way traffic environments. These studies also exhibit three fair... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An architecture for virtual circuit/QoS routing

    Publication Year: 1993, Page(s):80 - 87
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    With the emergence of multimedia applications, networks have to provide more and more bandwidth and should guarantee the quality of the communication between users. To address these issues, high speed architectures based on a virtual circuit model such as ATM have been designed and successfully implemented. The current trends in telecommunication deployment indicate that very large Internets based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for interoperability testing of network protocols

    Publication Year: 1993, Page(s):376 - 383
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The authors extend the testing theory based on formal specifications by formalizing testing for interoperability with a new relation, intop. Intuitively, P intop Q if, for every event offered by either P or Q, the concurrent execution of P and Q will be able to proceed with the traces in S, where S is their (common) specification. This theory is applicable to formal description methods that allow ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on communicating machines with identical symmetrical and dual processes using rewriting systems

    Publication Year: 1993, Page(s):150 - 157
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This paper states the following result. Replacing a pair of actions (rev x; send y) with another pair of actions (send y; rev x) in a machine M cannot introduce deadlocks or unspecified receptions when this machine communicates with another machine N. This result is utilized in identifying for any given machine M a large family of machines (N1, N2, ...) such that the communication between M and an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Estelle interpreter for incremental protocol verification

    Publication Year: 1993, Page(s):326 - 333
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Formal description techniques (FDTs) provide formal and abstract ways to specify what protocols have to do and what the features of the protocols need. Protocol verification is a process for detecting logical errors, such as deadlock, unspecified receptions, and channel overflow errors, in communication protocols. Estelle is a FDT defined by the International Organization for Standardization (ISO)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to evaluating the performance of communication protocols based on formal specifications

    Publication Year: 1993, Page(s):358 - 366
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    This paper proposes an approach to modeling and evaluating the performance of communication protocols based on formal specifications. A combined extended finite state machine (EFSM) and queueing network model is presented which is more sophisticated than either technique alone. Furthermore, the model avoids the state space explosion problem which may arise by the use of reachability analysis on an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optical network interface unit for multichannel ring networks

    Publication Year: 1993, Page(s):308 - 315
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The authors present an all-optical hypercube-based multichannel network, implemented on a ring topology, using wavelength division multiplexed channels. For a network of size N, only log2N distinct channels are required. They design an optical network interface unit (ONIU), which employs free-space optics to perform routing and switching functions. The design eliminates the electronic b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing SCI's fairness protocol for increased throughput

    Publication Year: 1993, Page(s):292 - 299
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The scalable coherent interface (SCI) is a newly established IEEE standard which provides bus-like services to a network of nodes connected by very fast, unidirectional links. SCI provides an efficient flow control protocol that fairly allocates bandwidth to all nodes on the network. When global fairness is not required, it is desirable to relax its enforcement, in exchange for increased network u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A CLNP-based protocol for mobile end systems within an area

    Publication Year: 1993, Page(s):64 - 71
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A protocol for supporting mobile end systems (ESs) that move within an area in a connectionless-mode network protocol (CLNP) environment is proposed. Traffic caused by control protocol data units under frequent ES migration can be reduced by separating the roles of intermediate systems (ISs) into two roles: (1) generating and propagating the information of the default location of an ES, and (2) co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulo-N incarnation numbers for cache-based transport protocols

    Publication Year: 1993, Page(s):46 - 54
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    To provide reliable connection management, a transport protocol uses 3-way handshakes in which user incarnations are identified by bounded incarnation numbers from some modulo-N space. Recently, several caching schemes have been proposed to reduce the 3-way handshake to a 2-way handshake. The authors define a class of caching protocols and determine the minimum value of N needed as a function of r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A highly parallelized architecture for a DQDB node

    Publication Year: 1993, Page(s):27 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    This paper proposes a highly parallelized architecture for a distributed queue dual bus (DQDB) MAC layer protocol processor, that is expected to improve the speed of execution of the protocol significantly to match the gigabit per second transmission rates. The architecture is based on pipelines of service blocks operating in parallel. Also the receive and transmit functions are separated and para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and configurable protocols: experiences with a prototype and an architectural framework

    Publication Year: 1993, Page(s):6 - 13
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The authors consider the use of parallelism and configurability to increase throughput and reduce protocol processing latencies. They obtain experimental results on parallel protocol performance using a prototype implemented on a shared memory multiprocessor. The results demonstrate the utility of parallel protocol processing, and they indicate the further research necessary for constructing viabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow theory: Verification of rate-reservation protocols

    Publication Year: 1993, Page(s):198 - 205
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The authors develop a simple theory of flows and show how to use this theory in verifying rate-reservation protocols in computing networks. The theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows, smooth and uniform, and four types of flow operators, limiters, compactors, expanders, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Galileo: A tool for simulation and analysis of real-time networks

    Publication Year: 1993, Page(s):264 - 271
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Galileo is a flexible tool for simulation of heterogeneous real-time communication networks and for development and validation of network protocols. Galileo provides several unique features that make it particularly suitable for the simulation and analysis of networks that provide quality-of-service guarantees. First, its object-oriented programming environment provides the means for a modular, hi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating maximal fault coverage conformance test sequences of reduced length for communication protocols

    Publication Year: 1993, Page(s):217 - 224
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    This paper focuses on a technique to reduce the length of maximal fault coverage test sequences for communication protocols by removing redundant test segments. This approach conceptually begins with all the test segments needed for the generation of maximal fault coverage test sequences, analyzes the structure of the specified finite state machine for the protocol, and shows that certain segments... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond layering: modularity considerations for protocol architectures

    Publication Year: 1993, Page(s):90 - 97
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    This paper considers ways to achieve modularity in protocol architectures without layering. Modularity promotes interoperability by making it easier to port protocol implementations; layering, on the other hand, has been identified as a performance impediment because it enforces sequential processing of messages. Focusing on end-to-end protocols, the authors propose mechanisms (metaheaders and gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language-based analysis of communicating finite state machines

    Publication Year: 1993, Page(s):384 - 393
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The authors present an efficient method for extracting a behavior description of a process (communicating finite state machine), as constrained by a given protocol. In the case where the constrained behavior corresponds to the unconstrained behavior depicted by the process specification, the process is said to be effective. The authors call the derived behavior description a process event graph (P... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability issues in reduced reachability analysis

    Publication Year: 1993, Page(s):158 - 165
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Reachability analysis, which is the most used technique in protocol validation, is based on the construction of a graph called the reachability graph. However this technique has two serious drawbacks: the undecidability of the finiteness of the reachability graph and the state explosion when it is finite. To cope with the latter problem, reduction techniques are required. After a brief presentatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying Estelle specifications: numerical Petri nets approach

    Publication Year: 1993, Page(s):334 - 341
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The techniques for verifying protocols specified in Estelle have so far focused on translating the specifications into another form, such as finite state machines or Petri nets, for which tools of verification have already been implemented. All the Estelle verification tools impose some restrictions on the specifications to be verified: the techniques use a subset of Estelle or restrict the comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From formal specification to implementation: experience with protocol tools

    Publication Year: 1993, Page(s):280 - 288
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The authors describe efforts to develop the Q.931 protocol software for the 5ESS Central Office Switch. Q.931 is a layer-3 message-based, user/network interface protocol for the integrated services digital network (ISDN). The approach uses a single formal specification written in the Augmented Protocol Specification Language to model the 1.931 protocol as a set of communicating extended finite sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.