Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/design-of-modern-communication-networks/larsson/descriptif_3573618
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3573618

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Design of Modern Communication Networks Methods and Applications

Langue : Anglais

Auteur :

Couverture de l’ouvrage Design of Modern Communication Networks
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.
  1. Introduction
  2. Networks and Flows
  3. Advanced Flow Theory
  4. Topological Design
  5. Stochastic Processes and Queues
  6. Loss Networks
  7. General Packet Networks
  8. Flow-Controlled Packet Networks
  9. Effective Bandwidth
  10. Multi-Service Networks
  11. Multi-Service Network Analysis
  12. Survivable Networks

Telecommunications engineers, network researchers and designers, technical managers, CTOs, and operations managers.

Christofer Larsson is a consultant in network design and optimization. He received his master of science in Engineering Physics from the Royal Institute of Technology in Stockholm, Sweden, and has over two decades in telecommunications as network designer at Ericsson, software architect for consultancy firms and system tester for service providers.


  • 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.

Date de parution :

Ouvrage de 456 p.

19x23.3 cm

Disponible chez l'éditeur (délai d'approvisionnement : 14 jours).

101,54 €

Ajouter au panier

Thèmes de Design of Modern Communication Networks :

Mots-clés :

Acceptance region; Algorithms; Approximate multi-commodity flow; Approximations; BCMP networks; Basic bandwidth unit; Bellman-Ford; Branch exchange method; Chernoff bound; Circulant; Closed Jackson network; Convolution method; Cumulant generating function; Cut saturation method; Decomposition; Decoupling bandwidth; Dijkstra; Discrete-event simulation; Dynamic programming; Edge cuts; Effective bandwidth; Electrical networks; End-to-end delay; Estimation of blocking; Finite buffer; Fixed-point approximation; Flow deviation method; Floyd-Warshall; Ford-Fulkerson; Genetic algorithm; Goemans-Williamson; Gomory-Hu; Gomory-Hu algorithm; Hayward approximation; Heuristics; Kirchhoff matrix-tree theorem; Large deviations theory; Linear programming; Loss networks; Markov additive process; Markov process; Maximum flow; Mean value analysis; Minimum cost flow; Moe's principle; Moe's principle; Monte Carlo; Monte Carlo simulation; Multi-commodity flow; Multi-dimensional Erlang formula; Multiterminal flow; NP-complete; Network connectivity; Network design; Network programming; Network reliability; Network topology; On-off model; Open Jackson network; Optimization; Out-of-kilter algorithm; Overflow theory; Packet network; Point process; Poisson process; Policing; Primal-dual methods; Processor sharing; Queues; Randomization; Randomized algorithm; Reliability polynomial; Resource allocation; Reversible systems; Routing; Shaping; Spanners; Spanning trees; TCP; The Erlang formulas; The traveling salesman problem; Theta-graph; Traffic; Trunk reservation; Vertex cuts; Virtual channel; Wilkinson-Bretschnieder method; k-connectivity; shortest path