Loading [MathJax]/extensions/MathMenu.js
Dedong Hu - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Dedong Hu

Publications
2
Citations
10
Publications by Year
20202020
Co-Authors:
Image of author Dedong Hu

Dedong Hu

Affiliation

Beijing University of Posts and Telecommunications, Beijing, China

Publication Topics

Biography

Dedong Hu received the B.S. degree from the Beijing University of Posts and Telecommunications (BUPT), in 2017, where he is currently pursuing the master’s degree in computer science technology. He has developed several software packages in Java. His research interests are in computer networks and new data mining.(Based on document published on 25 March 2020).
Publications
2
Citations
10
Publications by Year
20202020
Co-Authors:
Author's Published Works

Showing 1-2 of 2 results

  • Sort

Filter Results

Show

Sort By

Results

An Efficient and Fast Embedding Algorithm for the Virtual Networks

Dedong Hu;Zhen Yang

IEEE Access
Year: 2020 | Volume: 8 | Journal Article |
Cited by: Papers (3)
Virtual network mapping is a hot issue over the past decade, which aims to map virtual networks to the underlying network as required. This procedure is a NP-hard question, therefore many previous algorithms just impose some constraints or use simple heuristic method to get the relative optimal result. Traditional researches almost focus on two independent stages: node embedding and link mapping. ...Show More

An Efficient and Fast Embedding Algorithm for the Virtual Networks

Dedong Hu;Zhen Yang

Year: 2020 | Volume: 8 | Journal Article |

Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem

Caixia Kou;Dedong Hu;Jianhua Yuan;Wenbao Ai

IEEE/ACM Transactions on Networking
Year: 2020 | Volume: 28, Issue: 1 | Journal Article |
Cited by: Papers (7)
We propose two new algorithms called BiLAD and ExactBiLAD for the well-known Single-Constrained Shortest Path (SCSP) problem. It is a fundamental problem in quality-of-service (QoS) routing, where one seeks a source-destination path with the least cost satisfying a delay QoS constraint in a network. As pointed out by Jüttner et al., there is no widely accepted algorithm with polynomial time to the...Show More

Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem

Caixia Kou;Dedong Hu;Jianhua Yuan;Wenbao Ai

Year: 2020 | Volume: 28, Issue: 1 | Journal Article |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.