عنوان

Path problems in networks /

شابک

1598299247

شابک

9781598299243

شابک اشتباه

1598299239

شابک اشتباه

9781598299236

شماره

b700250

عنوان اصلي

Path problems in networks /

نام عام مواد

[Book]

نام نخستين پديدآور

John S. Baras, George Theodorakopoulos.

محل نشرو پخش و غیره

[San Rafael, Calif.] :

نام ناشر، پخش کننده و غيره

Morgan & Claypool,

تاریخ نشرو بخش و غیره

©2010.

نام خاص و کميت اثر

1 online resource (xii, 65 pages) :

ساير جزييات

illustrations

عنوان فروست

Synthesis lectures on communication networks,

مشخصه جلد

#3

شاپا ي ISSN فروست

1935-4193 ;

متن يادداشت

Includes bibliographical references.

متن يادداشت

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

متن يادداشت

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.

منبع سفارش / آدرس اشتراک

Safari Books Online

شماره انبار

CL0500000322

شماره استاندارد بين المللي کتاب و موسيقي

9781598299236

موضوع مستند نشده

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)

موضوع مستند نشده

COM-- 020000

موضوع مستند نشده

COM-- 043060

شماره

ويراست

شماره رده

مستند نام اشخاص تاييد نشده

Baras, John S.

مستند نام اشخاص تاييد نشده

Theodorakopoulos, George.

تاريخ عمليات

20201207160203.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y