Data Networks

  title={Data Networks},
  author={Dimitri P. Bertsekas and Robert G. Gallager},
An introduction to distributed algorithms
A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.
Analogy between data networks and electric networks
It is shown that two fundamental laws, Ohm's law in electric circuits and Little's theorem for queueing systems, are highly analogous. For both single nodes and networks, there is a striking
Introduction to Computer Networking
This book gives a broad look at both fundamental networking technology and new areas that support it and use it. It is a concise introduction to the most prominent, recent technological topics in
Applications of Markov Decision Processes in Communication Networks
This chapter presents in this chapter a survey on applications of MDPs to communication networks and the theoretical tools that have been developed to model and to solve the resulting control problems.
Dynamic Routing in the ATM-Networks: Problems and Solutions
Design and realization of the optimal routing algorithms in the modern ATM-based computer networks were considered. Classified mathematical methods of dynamic routing in the {ATM} networks were
Regional Computer Networks: Research Aspects, Solutions
  • Ion Bolun
  • Computer Science
    Comput. Sci. J. Moldova
  • 1999
Here are described the problems and are proposed models and algorithms for the macrosynthesis and for an ecient resource utilization of the computer nodes, of the data trunks, of some network
Performance monitoring in communication networks
Performance monitoring in communication networks, which isthe main topic of this thesis, is an essential part ofperformance and network management. The applications cover anumber of different areas
Radio Networks with Reliable Communication
Direct colored-edge multigraphs are used to model the radio networks and study reliable and private message transmissions in radio networks.
Insensitive Traffic Models for Communication Networks
  • T. Bonald
  • Computer Science
    Discret. Event Dyn. Syst.
  • 2007
We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the
Scheduling network traffic
The potential of packet scheduling as a means to control traffic and improve performance for both wired and wireless links is discussed and practical conclusions about the expected gains and limits of scheduling are drawn.


Fairness Framework and Mechanisms for IEEE 802.11 Based Ad Hoc Networks
  • Oct. 2003. Center for Information Technology Research in the Interest of Society (CITRIS) Founding Corporate Members (FCM) day poster