Mathematical Aspects of Network Routing Optimization
Mathematical Aspects of Network Routing Optimization
复制标题
DOI:
10.1007/978-1-4614-0311-1
复制
发表时间:
2011-08
期刊:
影响因子:
--
通讯作者:
中科院分区:
文献类型:
--
作者:
We live in an increasingly connected world. Even before the appearance of the now ubiquitous broadband links and wireless systems, networks have been used to connect people in whole new ways. The technology currently available resulted in the creation of large scale, computational networked systems, such as the Internet. However, despite the impressive array of technologies developed for networking, efficient algorithms are more necessary then ever to solve some of the problems emerging in the area.Algorithmic methods are necessary to provide logical connectivity among nodes of the network. Independent of topological and physical connections used, the goal of any communications system is to provide connectivity between its participants. In this context, general strategies such as packet routing have been devised to provide the necessary logical interconnection between nodes. Routing algorithms create the illusion of a direct physical connection between networked nodes. The link is maintained despite the different media and equipment used to establish the real networking connection. It is this kind of logical connection that allows participants in a network to cooperate properly. Therefore, routing algorithms provide the basic means of communication among users of a networking system.