Path Problems in Networks

J. Baras, George Theodorakopoulos
{"title":"Path Problems in Networks","authors":"J. Baras, George Theodorakopoulos","doi":"10.2200/S00245ED1V01Y201001CNT003","DOIUrl":null,"url":null,"abstract":"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. Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications","PeriodicalId":381829,"journal":{"name":"Synthesis Lectures on Communication Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Synthesis Lectures on Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2200/S00245ED1V01Y201001CNT003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

Abstract

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. Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications
网络中的路径问题
代数路径问题是图中最短路径问题的推广。这个抽象问题的各种实例已经出现在文献中,类似的解决方案已经被独立地发现和重新发现。一个问题的反复出现是其相关性的证据。本书旨在帮助当前和未来的研究人员将这个强大的工具添加到他们的武器库中,以便他们可以轻松地在自己的工作中识别和使用它。网络中的路径问题在概念上可以分为两部分:代数路径问题背后的广泛理论的精馏,以及广泛应用的阐述。首先,提出了最短路径问题,确定了一些术语和概念:解的存在唯一性、对参数变化的鲁棒性、集中式和分布式计算算法。然后,将这些概念推广到半环的代数环境中。提供了创建新半环的方法,这些方法对建模新问题很有用。本书的大部分内容都致力于代数路径问题的众多应用,从移动网络路由到BGP路由再到社交网络。这些应用表明了什么样的问题可以被建模为代数路径问题;它们也可以作为如何对新问题建模的例子。这本专著将是有用的网络研究人员,工程师和研究生。它既可以作为主题的介绍,也可以作为理论事实、算法和应用程序示例的快速参考。假设读者的理论背景是计算机科学或工程专业的研究生或高级本科生。熟悉代数和算法是有帮助的,但不是必需的。特别是代数,它被用作一种方便而简洁的语言来描述本质上是组合的问题。目录:经典最短路径/代数路径问题/解的性质与计算/应用/相关领域/半环及其应用列表
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信