In recent years the significance of Gaussian processes to communication networks has grown considerably. The inherent flexibility of the Gaussian traffic model enables the analysis, in a single mathematical framework, of systems with both long-range and short-range dependent input streams. Large Deviations for Gaussian Queues demonstrates how the Gaussian traffic model arises naturally, and how the analysis of the corresponding queuing model can be performed. The text provides a general introduction to Gaussian queues, and surveys recent research into the modelling of communications networks. Coverage includes: Discussion of the theoretical concepts and practical aspects related to Gaussian traffic models. Analysis of recent research asymptotic results for Gaussian queues, both in the large-buffer and many-sources regime. An emphasis on rare-event analysis, relying on a variety of asymptotic techniques. Examination of single-node FIFO queuing systems, as well as queues operating under more complex scheduling disciplines, and queuing networks. A set of illustrative examples that directly relate to important practical problems in communication networking. A large collection of instructive exercises and accompanying solutions. Large Deviations for Gaussian Queues assumes minimal prior knowledge. It is ideally suited for postgraduate students in applied probability, operations research, computer science and electrical engineering. The book’s self-contained style makes it perfect for practitioners in the communications networking industry and for researchers in related areas.

This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner. The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow sub networks to be aggregated into single nodes to reduce computational burden. Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the process generators, and comparison results and explicit error bounds based on an underlying Markov reward structure leading to ordering of expectations of performance measures. Part 3 presents diffusion and fluid results. It specifically looks at the fluid regime and the diffusion regime. Both of these are illustrated through fluid limits for the analysis of system stability, diffusion approximations for multi-server systems, and a system fed by Gaussian traffic. Part 4 illustrates computational and approximate results through the classical MVA (mean value analysis) and QNA (queueing network analyzer) for computing mean and variance of performance measures such as queue lengths and sojourn times; numerical approximation of response time distributions; and approximate decomposition results for large open queueing networks. spanPart 5 enlightens selected applications as spanloss networks originating from circuit switched telecommunications applications, capacity sharing originating from packet switching in data networks, and a hospital application that is of growing present day interest. spanThe book shows that spanthe intertwined progress of theory and practicespan will remain to be most intriguing and will continue to be the basis of further developments in queueing networks.

During recent years a great deal of progress has been made in performance modelling and evaluation of the Internet, towards the convergence of multi-service networks of diverging technologies, supported by internetworking and the evolution of diverse access and switching technologies. The 44 chapters presented in this handbook are revised invited works drawn from PhD courses held at recent HETNETs International Working Conferences on Performance Modelling and Evaluation of Heterogeneous Networks. They constitute essential introductory material preparing the reader for further research and development in the field of performance modelling, analysis and engineering of heterogeneous networks and of next and future generation Internets. The handbook aims to unify relevant material already known but dispersed in the literature, introduce the readers to unfamiliar and unexposed research areas and, generally, illustrate the diversity of research found in the high growth field of convergent heterogeneous networks and the Internet. The chapters have been broadly classified into 12 parts covering the following topics: Measurement Techniques; Traffic Modelling and Engineering; Queueing Systems and Networks; Analytic Methodologies; Simulation Techniques; Performance Evaluation Studies; Mobile, Wireless and Ad Hoc Networks, Optical Networks; QoS Metrics and Algorithms; All IP Convergence and Networking; Network Management and Services; and Overlay Networks.

This insightful Guide is meant to serve any and all interested in pursuing a career in mathematics education and research. The author’s goal and the book’s theme is to help students and others make a smooth transition to teachers and researchers of mathematics. Part I presents helpful techniques on teaching and conducting research. This innovative book also offers strategies on how to observe from and develop research methods, carry out research, and begin writing research papers. It includes an introduction to LaTeX, the most widely used mathematics typesetting and rendering computer program. Part II introduces some modern research in mathematics in various industries. The aim in is to expose the reader to modern applications and help him/her become acquainted with research papers and how to read and understand them. Authored by a young teacher and researcher, also beginning her career, this book is written by and for young mathematicians. Most graduate students as she experienced, are not given a proper transitory introduction to research and are not taught the "how" in teaching, attending conferences and collaborating. The book is based on the author’s own observations and on techniques she has found effective. Mathematics graduate students and those in related fields will find assistance to help them reflect on and advance their career pursuits. Advisors and mentors might also find useful suggestions here.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, these cover only a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This book constitutes the refereed proceedings of the Third Euro-NF International Conference, NET-COOP 2009 held in Eindhoven, The Netherlands, in November 2009. The 18 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on performance analysis methods, wireless, queueing analysis, battery control, distributed control, and cooperation and competition.

The recent trend towards the interoperability of traditionally separate networks, such as terrestrial, wireless/cellular, and satellite, for the support of multimedia applications poses new and significantly challenging problems to network design. This book reports on the state-of-the-art work developed during the four years of operation of the COST 279 Action, Analysis and Design of Advanced Multiservice Networks supporting Mobility, Multimedia, and Internetworking, by its participating researchers, originating from over 40 research institutions from the academic, industrial, and telecom operator worlds. The work includes both fundamental, methodological, and applied aspects of network performance evaluation and design. Analysis and Design of Advanced Multiservice Networks Supporting Mobility, Multimedia, and Internetworking contains a detailed account of the work developed, supported on an extensive bibliography of material published in the peer-reviewed literature. It contains the following six chapters: IP-Based NetworksQueueing Models Traffic Measurement, Characterization, and ModelingWireless NetworksOptical NetworksPeer-to-Peer Services Analysis and Design of Advanced Multiservice Networks Supporting Mobility, Multimedia, and Internetworking will appeal to both practitioners of network design, and to researchers aiming to map future directions in networking research.

This book constitutes the refereed proceedings of the 17th International Conference on Distributed Computer and Communication Networks, DCCN 2013, held in Moscow, Russia, in October 2013. The 22 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers cover the following subjects: computer and communication networks architecture optimization; control in computer and communication networks; performance and QoS evaluation in wireless networks; modeling and simulation of network protocols; queueing theory; wireless IEEE 802.11, IEEE 802.15, IEEE 802.16 and UMTS (LTE) net-works; RFID technology and its application in intellectual transportation networks; protocols design (MAC, Routing) for centimeter and millimeter wave mesh networks; internet and web applications and services; application integration in distributed information systems.

Big Queues aims to give a simple and elegant account of how large deviations theory can be applied to queueing problems. Large deviations theory is a collection of powerful results and general techniques for studying rare events, and has been applied to queueing problems in a variety of ways. The strengths of large deviations theory are these: it is powerful enough that one can answer many questions which are hard to answer otherwise, and it is general enough that one can draw broad conclusions without relying on special case calculations.