• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Path problems in networks /

پدید آورنده
John S. Baras, George Theodorakopoulos.

موضوع
Computer networks-- Mathematical models.,Graph theory.,Semirings (Mathematics),Computer networks-- Mathematical models.,COMPUTERS-- Data Transmission Systems-- General.,COMPUTERS-- Networking-- Vendor Specific.,Graph theory.,Semirings (Mathematics)

رده
TK5105
.
5

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
1598299247
(Number (ISBN
9781598299243
Erroneous ISBN
1598299239
Erroneous ISBN
9781598299236

NATIONAL BIBLIOGRAPHY NUMBER

Number
b700250

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Path problems in networks /
General Material Designation
[Book]
First Statement of Responsibility
John S. Baras, George Theodorakopoulos.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
[San Rafael, Calif.] :
Name of Publisher, Distributor, etc.
Morgan & Claypool,
Date of Publication, Distribution, etc.
©2010.

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
1 online resource (xii, 65 pages) :
Other Physical Details
illustrations

SERIES

Series Title
Synthesis lectures on communication networks,
Volume Designation
#3
ISSN of Series
1935-4193 ;

INTERNAL BIBLIOGRAPHIES/INDEXES NOTE

Text of Note
Includes bibliographical references.

CONTENTS NOTE

Text of Note
1. Classical shortest path -- Definitions and problem description -- Computation of shortest paths -- Distributed computation of shortest paths -- 2. The algebraic path problem -- Semirings and the algebraic path problem -- Creating new semirings -- 3. Properties and computation of solutions -- Alternative viewpoints: paths and matrices -- Edge sensitivities -- Centralized computation of A* -- Decentralized computation of A* -- 4. Applications -- Path enumeration -- Expectation semirings -- Minimum weight spanning tree -- Longest path -- Quality of service (QoS) routing -- BGP routing -- Shortest path with time-inhomogeneous edges -- Network reliability -- Shortest paths with gains/losses on the edges -- Trust-reputation -- Social networks -- Traffic assignment -- Applications of sensitivity analysis -- 5. Related areas -- Non-semiring path problems -- Semiring non-path problems -- 6. List of semirings and applications -- Authors' biographies.
0

SUMMARY OR ABSTRACT

Text of Note
The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social networks. These applications show what kind of problems can be modeled as algebraic path problems; they also serve as examples on how to go about modeling new problems. This monograph will be useful to network researchers, engineers, and graduate students. It can be used either as an introduction to the topic, or as a quick reference to the theoretical facts, algorithms, and application examples. The theoretical background assumed for the reader is that of a graduate or advanced undergraduate student in computer science or engineering. Some familiarity with algebra and algorithms is helpful, but not necessary. Algebra, in particular, is used as a convenient and concise language to describe problems that are essentially combinatorial.

ACQUISITION INFORMATION NOTE

Source for Acquisition/Subscription Address
Safari Books Online
Stock Number
CL0500000322

OTHER EDITION IN ANOTHER MEDIUM

International Standard Book Number
9781598299236

TOPICAL NAME USED AS SUBJECT

Computer networks-- Mathematical models.
Graph theory.
Semirings (Mathematics)
Computer networks-- Mathematical models.
COMPUTERS-- Data Transmission Systems-- General.
COMPUTERS-- Networking-- Vendor Specific.
Graph theory.
Semirings (Mathematics)

(SUBJECT CATEGORY (Provisional

COM-- 020000
COM-- 043060

DEWEY DECIMAL CLASSIFICATION

Number
004
.
6
Edition
22

LIBRARY OF CONGRESS CLASSIFICATION

Class number
TK5105
.
5

PERSONAL NAME - PRIMARY RESPONSIBILITY

Baras, John S.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Theodorakopoulos, George.

ORIGINATING SOURCE

Date of Transaction
20201207160203.0
Cataloguing Rules (Descriptive Conventions))
pn

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival