This book constitutes the proceedings of the 17th International Conference on Information Technologies and Mathematical Modelling, ITMM 2018, named after A.F. Terpugov, and the 12th Workshop on Retrial Queues and Related Topics, held in Tomsk, Russia, in September 2018. The 30 papers presented in this volume were carefully reviewed and selected from 84 submissions. The conference covers various aspects of information technologies, focusing on queueing theory, stochastic processes, Markov processes, renewal theory, network performance equation and network protocols.

This book constitutes the refereed proceedings of the 13th International Scientific Conference on Information Technologies and Mathematical Modeling, named after A.F. Terpugov, ITMM 2014, Anzhero-Sudzhensk, Russia, held in Anzhero-Sudzhensk, Russia, in November 2014. The 50 full papers included in this volume were carefully reviewed and selected from 254 submissions. The papers focus on probabilistic methods and models, queueing theory, telecommunication systems, and software engineering.

A fast-growing area in the communications industry is the internetworking of an ever-increasing proliferation of computers, particularly via local area networks (LANs). The LAN is a resource-sharing data communications network being used by many offices to interchange information such as electronic mail, word processing, and files among computers and other devices. This unique book shows the user how to establish the performance characteristics of a LAN before putting it to use in a particular type of situation. Simulation of Local Area Networks consists of eight chapters, each with its own extensive list of references. The first chapter provides a brief review of local area networks, and the second chapter gives the analytical models of popular LANs-token-passing bus and ring networks, CSMA/CD LANs, and star networks. Chapter 3 covers general principles of simulation, and Chapter 4 discusses fundamental concepts in probability and statistics relating to simulation modeling. Materials in Chapters 3 and 4 are specifically applied in developing simulation models on token-passing LANs, CSMA/CD LANs, and star LANs in Chapters 5 through 7. The computer code in Chapters 5, 6, and 7 is divided into segments, and a detailed explanation of each segment is provided. The last chapter reviews special-purpose languages such as GPSS, SIMSCRIPT, GASP, SIMULA, SLAM, and RESQ. Helpful criteria for language selection are included. The entire code is put together in the appendixes. This book has two major advantages over existing texts. First, it uses C, a well-developed general-purpose language that is familiar to most analysts. Second, the text specifically applies the simulation principles to local area networks. No other book available shows the systems analyst how to evaluate the performance of existing or proposed systems under different kinds of conditions.

Design of Modern Communication Networks focuses on methods and algorithms related to the design of communication networks, using optimization, graph theory, probability theory and simulation techniques. The book discusses the nature and complexity of the network design process, then introduces theoretical concepts, problems and solutions. It demonstrates the design of network topology and traditional loss networks, followed by uncontrolled packet networks, flow-controlled networks, and multiservice networks. Access network design is reviewed, and the book concludes by considering the design of survivable (reliable) networks and various reliability concepts. - A toolbox of algorithms: The book provides practical advice on implementing algorithms, including the programming aspects of combinatorial algorithms. - Extensive solved problems and illustrations: Wherever possible, different solution methods are applied to the same examples to compare performance and verify precision and applicability. - Technology-independent: Solutions are applicable to a wide range of network design problems without relying on particular technologies.

Data networking now plays a major role in everyday life and new applications continue to appear at a blinding pace. Yet we still do not have a sound foundation for designing, evaluating and managing these networks. This book covers topics at the intersection of algorithms and networking. It builds a complete picture of the current state of research on Next Generation Networks and the challenges for the years ahead. Particular focus is given to evolving research initiatives and the architecture they propose and implications for networking. Topics: Network design and provisioning, hardware issues, layer-3 algorithms and MPLS, BGP and Inter AS routing, packet processing for routing, security and network management, load balancing, oblivious routing and stochastic algorithms, network coding for multicast, overlay routing for P2P networking and content delivery. This timely volume will be of interest to a broad readership from graduate students to researchers looking to survey recent research its open questions.

This volume contains papers based on invited talks given at the 2005 IMA Summer Workshop on Wireless Communications, held at the Institute for Mathematics and Its Applications, University of Minnesota, June 22 - July 1, 2005. It presents some of the highlights of the workshop, and collects papers covering a broad spectrum of important and pressing issues in wireless communications.

This book is a collection of selected proceedings from the EUNICE Summer School which took place in Colmenarejo in July of 2005. The book explores the theme of Networked Applications in depth. It covers topics of advanced engineering such as ubiquitous computing, full mobility and real-time multimedia, into real services, applications, protocols and networks.

Queueing network models have been widely applied as a powerful tool for modelling, performance evaluation, and prediction of discrete flow systems, such as computer systems, communication networks, production lines, and manufacturing systems. Queueing network models with finite capacity queues and blocking have been introduced and applied as even more realistic models of systems with finite capacity resources and with population constraints. In recent years, research in this field has grown rapidly. Analysis of Queueing Networks with Blocking introduces queueing network models with finite capacity and various types of blocking mechanisms. It gives a comprehensive definition of the analytical model underlying these blocking queueing networks. It surveys exact and approximate analytical solution methods and algorithms and their relevant properties. It also presents various application examples of queueing networks to model computer systems and communication networks. This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.