Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
Summary form only given, as follows. Most of us are nomads in that we travel from place to place ... more Summary form only given, as follows. Most of us are nomads in that we travel from place to place with a wild array of laptops, PDA's, cellular telephones, pagers, etc. We desire to have the same computing environment, services and system support in those locations as we have in our corporate offices. Indeed we desire "anywhere, anytime" connectivity. Unfortunately, as soon as we leave the comfort of our corporate environment and head out on the road, we lose all the basic capabilities we enjoy in that environment. Indeed, we often encounter the frustration of weak (or no) connectivity, tiny keyboards, lack of interoperability, loss of backup, foreign environments, and inadequate support in general. We discuss how our computing and communications technology has brought us to this point, some of the open issues that must be addressed as we seek to develop the system support necessary to provide a rich set of capabilities and services to these nomads in a transparent and convenient form, and where we see this is likely to evolve in the future. We also discuss some of the emerging solutions to the problems raised by this revolution in the use of information technology.
An algorithm (SYMB) for symbolic terminal reliability computation is presented. Belonging to the ... more An algorithm (SYMB) for symbolic terminal reliability computation is presented. Belonging to the class of path enumeration algorithms, SYMB is based on the application of a $-operation on the set of all simple paths. The derivation of the algorithm is examined, and two common criteria for the evaluation of symbolic reliability algorithms are given as the number of terms in
Page 1. 381 The Power Function as a Performance and Comparison Measure for ,4TR/I Switches * Chri... more Page 1. 381 The Power Function as a Performance and Comparison Measure for ,4TR/I Switches * Christos Iiolias and Leonard Iilrinrock Department, of Computer Science University of California at Los Angeles Los Angeles, CA 90095-1596 IJ.SA Abstract ...
Proceedings of ICC'97 - International Conference on Communications
Multistage interconnection networks (MINs) are very popular in ATM switching since they can achie... more Multistage interconnection networks (MINs) are very popular in ATM switching since they can achieve high-performance switching and are easy to implement and expand due to their modular design. In this paper we present and describe in detail a high-performance buffered-Banyan switch which encompasses multiple input-queueing as its buffering strategy. We call this switching architecture Dual-Banyan switch. Simulation results are given
... Measurement Principal Investigator Gerald Popek Managers Karen Hackett David Gallon Programme... more ... Measurement Principal Investigator Gerald Popek Managers Karen Hackett David Gallon Programmers Roger Noe Jerry Toman Alice Wang Technical Expert Roman Zajcew Time Line October 1994 Project start April 1995 Parallel program simulator operational October 1997 ...
In this paper, we analyze the behavior of random polling systems. The polling systems we consider... more In this paper, we analyze the behavior of random polling systems. The polling systems we consider consist of N stations, each equipped with an infinite buffer and a single server who serves them in some order. In contrast to previously studied polling systems, where the order of service used by the server is periodic (and usually cyclic), in the systems we consider the next station to be served after station i is determined by probabilistic means. More specifically, according to the model we consider in this paper, after serving station i, the server will poll (i.e., serve) station j (j = 1, 2, …, N) with probability pj. The main results of this paper are expressions for the expected response time in a random polling system operated under a variety of service disciplines. The results are compared to the response time in the equivalent cyclic polling systems. Also in this paper, we analyze the cycle time and the number of customers found in the system.
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
Summary form only given, as follows. Most of us are nomads in that we travel from place to place ... more Summary form only given, as follows. Most of us are nomads in that we travel from place to place with a wild array of laptops, PDA's, cellular telephones, pagers, etc. We desire to have the same computing environment, services and system support in those locations as we have in our corporate offices. Indeed we desire "anywhere, anytime" connectivity. Unfortunately, as soon as we leave the comfort of our corporate environment and head out on the road, we lose all the basic capabilities we enjoy in that environment. Indeed, we often encounter the frustration of weak (or no) connectivity, tiny keyboards, lack of interoperability, loss of backup, foreign environments, and inadequate support in general. We discuss how our computing and communications technology has brought us to this point, some of the open issues that must be addressed as we seek to develop the system support necessary to provide a rich set of capabilities and services to these nomads in a transparent and convenient form, and where we see this is likely to evolve in the future. We also discuss some of the emerging solutions to the problems raised by this revolution in the use of information technology.
An algorithm (SYMB) for symbolic terminal reliability computation is presented. Belonging to the ... more An algorithm (SYMB) for symbolic terminal reliability computation is presented. Belonging to the class of path enumeration algorithms, SYMB is based on the application of a $-operation on the set of all simple paths. The derivation of the algorithm is examined, and two common criteria for the evaluation of symbolic reliability algorithms are given as the number of terms in
Page 1. 381 The Power Function as a Performance and Comparison Measure for ,4TR/I Switches * Chri... more Page 1. 381 The Power Function as a Performance and Comparison Measure for ,4TR/I Switches * Christos Iiolias and Leonard Iilrinrock Department, of Computer Science University of California at Los Angeles Los Angeles, CA 90095-1596 IJ.SA Abstract ...
Proceedings of ICC'97 - International Conference on Communications
Multistage interconnection networks (MINs) are very popular in ATM switching since they can achie... more Multistage interconnection networks (MINs) are very popular in ATM switching since they can achieve high-performance switching and are easy to implement and expand due to their modular design. In this paper we present and describe in detail a high-performance buffered-Banyan switch which encompasses multiple input-queueing as its buffering strategy. We call this switching architecture Dual-Banyan switch. Simulation results are given
... Measurement Principal Investigator Gerald Popek Managers Karen Hackett David Gallon Programme... more ... Measurement Principal Investigator Gerald Popek Managers Karen Hackett David Gallon Programmers Roger Noe Jerry Toman Alice Wang Technical Expert Roman Zajcew Time Line October 1994 Project start April 1995 Parallel program simulator operational October 1997 ...
In this paper, we analyze the behavior of random polling systems. The polling systems we consider... more In this paper, we analyze the behavior of random polling systems. The polling systems we consider consist of N stations, each equipped with an infinite buffer and a single server who serves them in some order. In contrast to previously studied polling systems, where the order of service used by the server is periodic (and usually cyclic), in the systems we consider the next station to be served after station i is determined by probabilistic means. More specifically, according to the model we consider in this paper, after serving station i, the server will poll (i.e., serve) station j (j = 1, 2, …, N) with probability pj. The main results of this paper are expressions for the expected response time in a random polling system operated under a variety of service disciplines. The results are compared to the response time in the equivalent cyclic polling systems. Also in this paper, we analyze the cycle time and the number of customers found in the system.
Uploads
Papers by L. Kleinrock