2016 16th International Symposium on Communications and Information Technologies (ISCIT) 2016
DOI: 10.1109/iscit.2016.7751618
|View full text |Cite
|
Sign up to set email alerts
|

A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding

Abstract: A note on versions:The version presented here may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the repository url above for details on accessing the published version and note that access may require a subscription. Abstract-this paper studies and models the multicast routing problem with network coding in dynamic network environment, where computational and bandwidth resources are to be jointly opt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…Markowski [32] considers spectrum and modulation setup for dynamic multicast in optical networks. Xing et al [33] explore dynamic multicast with network coding to minimize the coding cost. However, the dynamic group membership in IETF IGMP has not been considered in any SDN theoretical research for multicast traffic engineering.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Markowski [32] considers spectrum and modulation setup for dynamic multicast in optical networks. Xing et al [33] explore dynamic multicast with network coding to minimize the coding cost. However, the dynamic group membership in IETF IGMP has not been considered in any SDN theoretical research for multicast traffic engineering.…”
Section: Related Workmentioning
confidence: 99%
“…ST generates the smallest tree cost, which is much smaller than SPT. The tree cost of OBSTA is very close to ST, but the total rerouting costs of OBSTA are only 8.8% xi There are some single-tree static and dynamic multicast routing algorithms [12], [26], [31]- [33] with different purposes (such as QoS), but they are not included in this study because ST outperforms those approaches in terms of the bandwidth consumption, and the rerouting cost is not minimized in those approaches.…”
Section: A Simulation Setupmentioning
confidence: 99%
See 1 more Smart Citation