By Topic

Computers and Communications, 1993., Twelfth Annual International Phoenix Conference on

Date 23-26 March 1993

Filter Results

Displaying Results 1 - 25 of 87
  • Proceedings of Phoenix Conference on Computers and Communications

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • Executable test sequences with operational coverage for LOTOS specifications

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

    LOTOS the language for temporal ordering specifications is a formal language standardization by ISO for specifying distributed systems. The authors present a new approach to selectively generating executable test sequences which cover designated operations of a LOTOS specification. An operational coverage criterion is proposed, in which each operation is covered by a mandatory set of action sequen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnostic tests for communicating finite state machines

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

    The authors propose a diagnostic algorithm for the case where a protocol specification is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the protocol implementation once the fault has been detected. It generates, if necessary, additional diagnostic tests, which depend on the observed symptoms and which permit the location of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast distributed network restoration algorithm

    Publication Year: 1993, Page(s):261 - 267
    Cited by:  Papers (24)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    The authors present a fast distributed network restoration algorithm for restoring disrupted traffic in a digital cross-connect system (DCS) based fiber network due to fiber span cut. The proposed algorithm is based on a two-prong approach where both disrupted ends simultaneously send out restore messages as opposed to the conventional approaches where one end is selected as the sender and only th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault tolerant (√N) algorithm for distributed mutual exclusion

    Publication Year: 1993, Page(s):175 - 180
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    A low-cost and highly tolerant protocol for distributed mutual exclusion is presented. This protocol logically organizes nodes as a √N×√N grid. The smallest quorum size of the protocol is O(√N). The system model is given. The definition of a quorum is provided. The proof of correctness of the protocol is given. The authors present an algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast link assignment algorithm for satellite communication networks

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

    In satellite communication networks using laser transceivers, each satellite has a limited number of transceivers with a very narrow field of view. The authors consider the problem of deciding which logical connections should be formed among satellites out of all the possible connections that can be made depending on the line-of-sight (LOS) visibility of satellites. These logical connections can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnection structures for highly parallel systems

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

    The interconnection network design space and directions of its potential evolution are discussed. Communications within highly-parallel systems can be classified in two categories: input/output (I/O)-related communications which involve the transfer of large blocks of data and take place across the memory hierarchy of the system; and communications which typically involve the transfer of small uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On conditions for nonblocking multi-log2N multiconnection networks

    Publication Year: 1993, Page(s):268 - 274
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The multi-log2N network is an abstract parallel switch architecture by vertically stacking multiple copies of a log2N network with log2N stages. The authors present the conditions for rearrangeable nonblocking and strictly nonblocking multi-log2N multiconnection networks. Two connection-assignment algorithms for the no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliability enhancement approach for computer networks and distributed applications

    Publication Year: 1993, Page(s):181 - 187
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The authors address an important problem in reliability improvement of existing distributed systems. The reliability of a distributed system depends not only on the reliabilities of its communication links and computing elements, but also on the distribution of its resources which consists of programs and data files. A genetic algorithm based reliability improvement approach is discussed for distr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of adaptive packet-routing algorithms for tori

    Publication Year: 1993, Page(s):120 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Recently several adaptive and partially adaptive routing algorithms have been proposed for worm-hole routing of messages in multicomputers based on k-ary n-cube networks. The authors compare the performances of these algorithms in the context of store-and-forward routing. The algorithms considered are the nonadaptive (e-cube), partially-adaptive, and fully-adaptive routi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of uplink multiple access protocols in meshed VSAT satellite networks

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

    The authors give a brief description of the meshed very small aperture terminal (VSAT) satellite network under investigation by the NASA Lewis Research Center and a detailed performance model of the uplink protocol access techniques. The satellite has eight uplink beams with one or two dedicated 64 Kb/s access request channels per beam. The request channel is a multiple access packet transmission ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph-based signal flow direction assignment method for CMOS circuits

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

    Signal flow direction (SFD) assignment for CMOS transistors plays an important role in many VLSI CAD tools. The authors present a new graph-based SFD assignment method. It has a linear time performance for circuits that can be parallel-serial reduced. For circuits which are not completely reduced, their sizes are usually very small and an exhaustive search algorithm can assign SFDs quickly. SFD as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queued transaction processing within the UNIX operating system environment

    Publication Year: 1993, Page(s):441 - 446
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The authors discuss queued transaction processing as it relates to the UNIX operating system environment. They briefly discuss the essence of the queued transaction processing model and how it relates to distributed computing models. Requirements and methods for introducing true queued transaction processing within the UNIX system environment are considered. The conclusion is that extending the UN... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Execution dependencies and their resolution in fine grain parallel machines

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

    Execution dependence between sequential instructions is one of the factors that limits the level of parallelism which can be exploited by fine grain parallel machines. Several architectural, compiler and machine organization techniques that have been used to alleviate this restriction are examined. They are compared against a relatively new mechanism that simply eliminates the execution dependency... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of flow control methods in high-speed networks

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

    The authors apply fluid modeling techniques to the analysis of data flow on high-speed networks. The network is modeled as a single-hop high-speed virtual channel (VC). The VC shares server assets with cross-traffic, thereby diminishing the server assets available to the VC. Transmission line delay is inserted in the feedback loop to control the VC source rate. Cross-traffic is modeled as a twice ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State nets: an expressively efficient behavioral model

    Publication Year: 1993, Page(s):571 - 577
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The authors investigate the modeling power of a newly proposed behavioural model, called state nets. They introduce state nets as a new and promising object-oriented behavioral model; show how Peterson's notion of modeling power can be used to make comparisons between behavioral models; and prove that basic state nets have more modeling power than extended Petri nets View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image coding for telecommunications

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

    The application of transform and wavelet coding to encode monochrome images is investigated. The proposed image coders are based on entropy-constrained trellis coded quantization. Excellent peak-signal-to-noise ratios were obtained for encoding the monochrome version of the 512×512 Lenna image. Comparisons with other results from the literature reveal that the proposed image coders are quite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for partitioning long local computer networks

    Publication Year: 1993, Page(s):275 - 281
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The authors present a new methodology for partitioning long local computer networks. The proposed technique relies on dividing the long network into subnets that are interconnected using a multistage delta interconnection network and an interface device. The performance of the proposed partitioning method is studied using simulation modeling. It is found that the throughput of the proposed partiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing on reconfigurable buses

    Publication Year: 1993, Page(s):30 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The authors demonstrate novel uses for buses in a multiprocessor reconfigurable architecture both as topological descriptors and as powerful computational devices. This paradigm results in fast algorithms to solve a number of problems in computer arithmetic, image processing, and computer vision. An O(1) time algorithm is proposed to compute the sum and difference of two N-bit numbers usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaches to secure delegation in distributed systems

    Publication Year: 1993, Page(s):188 - 194
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The authors present two delegation schemes and a revocation scheme for distributed systems based on adaptation and extensions of the recent Csig cryptosystem of Zheng and Seberry (1992). The first delegation scheme is general in the sense that the originator of the delegation only specifies one delegate. The originator has no control over who finally executes the delegated task... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and fault-tolerant checkpointing procedures for distributed systems

    Publication Year: 1993, Page(s):161 - 167
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Problems related to distributed systems fault-tolerance are tackled by providing efficient and fault-tolerant algorithm procedures for checkpointing and rollback recovery for such systems. The authors propose checkpointing algorithms which can be initiated by any process in the system or upon failure of one or more component processes as part of a backward recovery procedure. The algorithm return ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A technique for combining equalization with generalized differential detection

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

    A generalized differential coherent detection technique combined with equalization for data transmission over intersymbol interference (ISI) channels is considered when carrier phase tracking is difficult. In the absence of ISI, the SNR performance of this generalized differential coherent structure is very close to the coherent detection bound. The authors present the integration of this generali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network traffic workload classification methods for workstation GUI applications

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

    The authors attempt to provide a set of benchmarks for GUI (graphical user interface) applications developed under the X Window System, by proposing a method of classifying the GUI characteristics into classes based on a measure of graphical complexity. They conducted data gathering experiments on sample X applications from each GUI class measuring resource usage. The data were compiled, and the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible system interface ASIC for FDDI adapter

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

    The author presents a flexible system interface (FlexSi) application specific IC (ASIC) architecture to address the system bus bandwidth utilization and bus latency issues in fiber distributed data interface (FDDI) adapter design. The proposed ASIC is intended to be used in conjunction with National's FDDE chip set BSI-2 or MACSI. A learning model in the ASIC architecture understands the parameter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a demand assignment packet switch for terrestrial and satellite networks

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

    The authors consider a packet switch with demand time-slot assignment capability, to be used in terrestrial or satellite networks. The proposed approach attempts to optimize switch performance by scheduling a maximum number of packets within frames of fixed length, while unscheduled packets remain in buffers to be scheduled in subsequent frames. Delay analysis has been carried out under the assump... View full abstract»

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