Author
Listed:
- Li Wang
- Dinesh Kumar Saini
Abstract
The rise of big data has brought severe challenges to data storage, which also means that computing resources and storage resources have become centralized. In the past, business data could end up after being processed locally or at the secondary node. Now, all data must be uploaded to each data center for unified processing. Data collection also requires users to access data center services and then send them back, which undoubtedly increases the pressure on the backbone network. This also means that the annual private line cost of the enterprise will increase with the growth of network traffic. Large enterprises often use multiple lines between network nodes to improve link utilization and network reliability. However, in most cases, the line utilization of the backup line is usually low, because the traditional routing algorithm forwards according to the optimal path. Load sharing or traffic scheduling is achieved by adjusting interface cost values ​​or BGP parameters. In large networks, it often affects the entire body. Each adjustment requires detailed planning and validation. At the same time, due to the diversity of applications, different applications have different business characteristics. If the network can distinguish different applications, sense network conditions, and adjust the QoS and traffic paths of applications as needed, the link utilization of leased lines and the network quality of applications will be significantly improved. SDN separates the control plane from the data plane and intelligently controls the network forwarding policy through the global controller, which improves the flexibility and security of the network. Based on the traditional large-scale enterprise WAN architecture, this paper proposes a complete traffic scheduling solution based on SDN to achieve secure, controllable, and flexible scheduling of enterprise WAN network resources.
Suggested Citation
Li Wang & Dinesh Kumar Saini, 2022.
"A Traffic Scheduling Method Based on SDN,"
Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-7, April.
Handle:
RePEc:hin:jnlmpe:1819202
DOI: 10.1155/2022/1819202
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:1819202. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.