== Abstract ==

​

   Recent advances in traffic engineering offer a series of techniques to address the network problems due to the explosive growth of Internet traffic. In traffic engineering, dynamic path planning is essential for prevalent applications, e.g., load balancing, traffic monitoring and firewall. Application-specific methods can indeed improve the network performance but can hardly be extended to general scenarios. Meanwhile, massive data generated in the current Internet has not been fully exploited, which may convey much valuable knowledge and information to facilitate traffic engineering. In this paper, we propose a learning-based network path planning method under forwarding constraints for finer-grained and effective traffic engineering. We form the path planning problem as the problem of inferring a sequence of nodes in a network path and adapt a sequence-to-sequence model to learn implicit forwarding paths based on empirical network traffic data. To boost the model performance, attention mechanism and beam search are adapted to capture the essential sequential features of the nodes in a path and guarantee the path connectivity. To validate the effectiveness of the derived model, we implement it in Mininet emulator environment and leverage the traffic data generated by both a real-world GEANT network topology and a grid network topology to train and evaluate the model. Experiment results exhibit a high testing accuracy and imply the superiority of our proposal.

​

​

== Original document ==

​

The different versions of the original document can be found in:

​

* [https://doi.org/10.1016/j.future.2018.09.043 https://doi.org/10.1016/j.future.2018.09.043] under the license cc-by

​

* [https://api.elsevier.com/content/article/PII:S0167739X18313244?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S0167739X18313244?httpAccept=text/xml],

: [https://api.elsevier.com/content/article/PII:S0167739X18313244?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S0167739X18313244?httpAccept=text/plain],

: [http://dx.doi.org/10.1016/j.future.2018.09.043 http://dx.doi.org/10.1016/j.future.2018.09.043] under the license https://www.elsevier.com/tdm/userlicense/1.0/

​

* [https://www.sciencedirect.com/science/article/pii/S0167739X18313244 https://www.sciencedirect.com/science/article/pii/S0167739X18313244],

: [https://dblp.uni-trier.de/db/journals/fgcs/fgcs92.html#ZuoWMC19 https://dblp.uni-trier.de/db/journals/fgcs/fgcs92.html#ZuoWMC19],

: [https://doi.org/10.1016/j.future.2018.09.043 https://doi.org/10.1016/j.future.2018.09.043],

: [https://ore.exeter.ac.uk/repository/handle/10871/34050 https://ore.exeter.ac.uk/repository/handle/10871/34050],

: [https://academic.microsoft.com/#/detail/2893647509 https://academic.microsoft.com/#/detail/2893647509]

​

* [ ]

​