Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/76067
|
| Title: | Mathematical models of QoS management for communication networks |
| Authors: | Wang, Chia-Hung;Luh, Hsing Paul
王嘉宏;陸行 |
| Contributors: | 應數系 |
| Date: | 2011-02 |
| Issue Date: | 2015-06-22 16:24:06 (UTC+8) |
| Abstract: | Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the recent past, there have been many technological developments such as digitization of information, optical networks, Internet, and wireless networks. These developments have led to a series of new optimization problems. In communication networks, a number of requirements can be identified. For instance, the network operator requires a good earning capacity, and the network users require reliable communication. The degree to which these and other requirements are fulfilled, can in many cases be deduced from how the network resources are distributed. In contrast to the Public Switched Telephony Network (PSTN), services offered in a data communication network vary significantly in terms of the required bandwidth. This adds a new challenging dimension into design of the networks, since inevitably, questions of fair medium sharing, quality guarantees, delays, etc. become crucial. Different methods of obtaining fair resource sharing are derived and investigated, for example, Max-Min Fairness, Proportional Fairness, etc. We focus on fairness on backbone networks possessing certain desired fairness properties. © 2010 by Nova Science Publishers, Inc. All rights reserved. |
| Relation: | Mathematics and Mathematical Logic: New Research, 179-202 |
| Data Type: | book/chapter |
| Appears in Collections: | [應用數學系] 專書/專書篇章
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| index.html | | 0Kb | HTML2 | 1057 | View/Open | | index.html | | 0Kb | HTML2 | 1434 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
