L. Kleinrock - Academia.edu (original) (raw)
Papers by L. Kleinrock
IEEE Communications Magazine, 1992
IEEE International Conference on Communications, 2003. ICC '03.
Sensor networks are distributed networks made up of small sensing devices equipped with processor... more Sensor networks are distributed networks made up of small sensing devices equipped with processors, memory, and short-range wireless communication. They differ from conventional computer networks in that they have severe energy constraints, redundant low-rate data, and a plethora of information flows. Many aspects of sensor networks, such as routing, preservation of battery power, adaptive selfconfiguration, etc., have already been studied in previous papers, e.g., [1, 2, 3]. However, to the best knowledge of the authors, the area of sensor network quality of service (QoS) remains largely open. This is a rich area because sensor deaths and sensor replenishments make it difficult to specify the optimum number of sensors (this being the service quality that we address in this paper) that should be sending information at any given time. In this paper we present an amalgamation of QoS feedback and sensor networks. We use the idea of allowing the base station to communicate QoS information to each of the sensors using a broadcast channel and we use the mathematical paradigm of the Gur Game to dynamically adjust to the optimum number of sensors. The result is a robust sensor network that allows the base station to dynamically adjust the resolution of the QoS it receives from the sensors, depending on varying circumstances.
IEEE Communications Magazine, 2000
In this article we identify some of the key problems one encounters when thinking about multi-acc... more In this article we identify some of the key problems one encounters when thinking about multi-access systems. We begin with a general discussion of nomadic computing and move on to issues of multi-access in a distributed environment. We then specialize to the case of wireless systems, and identify some of the key considerations and algorithms which must be addressed in that environment. Lastly, we identify some of the higher-level issues and principles one should properly keep in mind when investigating the design and behavior of these systems.
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
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)
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
Proceedings of ICC'97 - International Conference on Communications
Winter Simulation Conference Proceedings, 1995.
Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, 2010
Preface academia and from industry. Included in this will to favor interactions are social events... more Preface academia and from industry. Included in this will to favor interactions are social events at prestigious sites. We would like to thank the program chairs, organization staff, and the members of the program committees for their work. Thanks also go to IEEE Computer Society for their wonderful editorial service to this proceeding. We are grateful to all those who have contributed to the success of ICFCC 2010. We hope that all participants and other interested readers benefit scientifically from the proceedings and also find it stimulating in the process. Finally, we would like to wish you success in your technical presentations and social networking. We hope you have a unique, rewarding and enjoyable week at ICFCC 2010 in Wuhan, China during 21-24 May, 2010.
IEEE Transactions on Communications - TCOM, 1975
... 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 ...
Proceedings of the IEEE, 1991
We are in the midst of revolutionary improvements in data communications. The need for connectivi... more We are in the midst of revolutionary improvements in data communications. The need for connectivity has never been as great as it is today due to the rapid growth of desktop processing machines which must communicate among themselves as well as with centralized computing and database facilities. Alas, in the midst of this progress, we j n d ourselves burdened by the curse of incompatibility among vendor-specijic products, protocols, procedures, and interfaces. At the same time, the national and international bodies have been hard at work attempting to provide some stability by introducing standards for connectivity. The problem, of course, is one of timing; a premature standard stifles the development of mature technology, uhile a tardy standard is in danger of being rejected by U community that is locked into irreversible commitments to cumbersome ad hoc solutions. ISDN is an emerging standard which represents an international effort tu solve some of our connectivit). problems. If it rolls out in a timely fashion and addresses real needs to the end user community, it has a chance for success in the networking world. The carriers are committed to ISDN and have a clear motivation and potential for succeeding in its development. Narrowband ISDN is a hohum service for which some important applications have been identifed. but u.hich has not sparked a stampede of acceprance. On rhe other hand, broadband ISDN (BISDN) is a service that has identijed capabilities that are truly exciting and could very well dominate data networking in this decade. The .success of BISDN will depend strongly on the rollout ofproducts, the ubiquity of its presence, and the tarrijing of its services.
Operations Research, 1988
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.
IEEE Communications Magazine, 1992
IEEE International Conference on Communications, 2003. ICC '03.
Sensor networks are distributed networks made up of small sensing devices equipped with processor... more Sensor networks are distributed networks made up of small sensing devices equipped with processors, memory, and short-range wireless communication. They differ from conventional computer networks in that they have severe energy constraints, redundant low-rate data, and a plethora of information flows. Many aspects of sensor networks, such as routing, preservation of battery power, adaptive selfconfiguration, etc., have already been studied in previous papers, e.g., [1, 2, 3]. However, to the best knowledge of the authors, the area of sensor network quality of service (QoS) remains largely open. This is a rich area because sensor deaths and sensor replenishments make it difficult to specify the optimum number of sensors (this being the service quality that we address in this paper) that should be sending information at any given time. In this paper we present an amalgamation of QoS feedback and sensor networks. We use the idea of allowing the base station to communicate QoS information to each of the sensors using a broadcast channel and we use the mathematical paradigm of the Gur Game to dynamically adjust to the optimum number of sensors. The result is a robust sensor network that allows the base station to dynamically adjust the resolution of the QoS it receives from the sensors, depending on varying circumstances.
IEEE Communications Magazine, 2000
In this article we identify some of the key problems one encounters when thinking about multi-acc... more In this article we identify some of the key problems one encounters when thinking about multi-access systems. We begin with a general discussion of nomadic computing and move on to issues of multi-access in a distributed environment. We then specialize to the case of wireless systems, and identify some of the key considerations and algorithms which must be addressed in that environment. Lastly, we identify some of the higher-level issues and principles one should properly keep in mind when investigating the design and behavior of these systems.
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
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)
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
Proceedings of ICC'97 - International Conference on Communications
Winter Simulation Conference Proceedings, 1995.
Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, 2010
Preface academia and from industry. Included in this will to favor interactions are social events... more Preface academia and from industry. Included in this will to favor interactions are social events at prestigious sites. We would like to thank the program chairs, organization staff, and the members of the program committees for their work. Thanks also go to IEEE Computer Society for their wonderful editorial service to this proceeding. We are grateful to all those who have contributed to the success of ICFCC 2010. We hope that all participants and other interested readers benefit scientifically from the proceedings and also find it stimulating in the process. Finally, we would like to wish you success in your technical presentations and social networking. We hope you have a unique, rewarding and enjoyable week at ICFCC 2010 in Wuhan, China during 21-24 May, 2010.
IEEE Transactions on Communications - TCOM, 1975
... 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 ...
Proceedings of the IEEE, 1991
We are in the midst of revolutionary improvements in data communications. The need for connectivi... more We are in the midst of revolutionary improvements in data communications. The need for connectivity has never been as great as it is today due to the rapid growth of desktop processing machines which must communicate among themselves as well as with centralized computing and database facilities. Alas, in the midst of this progress, we j n d ourselves burdened by the curse of incompatibility among vendor-specijic products, protocols, procedures, and interfaces. At the same time, the national and international bodies have been hard at work attempting to provide some stability by introducing standards for connectivity. The problem, of course, is one of timing; a premature standard stifles the development of mature technology, uhile a tardy standard is in danger of being rejected by U community that is locked into irreversible commitments to cumbersome ad hoc solutions. ISDN is an emerging standard which represents an international effort tu solve some of our connectivit). problems. If it rolls out in a timely fashion and addresses real needs to the end user community, it has a chance for success in the networking world. The carriers are committed to ISDN and have a clear motivation and potential for succeeding in its development. Narrowband ISDN is a hohum service for which some important applications have been identifed. but u.hich has not sparked a stampede of acceprance. On rhe other hand, broadband ISDN (BISDN) is a service that has identijed capabilities that are truly exciting and could very well dominate data networking in this decade. The .success of BISDN will depend strongly on the rollout ofproducts, the ubiquity of its presence, and the tarrijing of its services.
Operations Research, 1988
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.