Skip to main content
SpringerLink
Log in

Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted \(l_1\) Norm

  • Conference paper
  • First Online:
Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom 2016)

Included in the following conference series:

  • 783 Accesses

Abstract

Quality of Service (QoS) Routing problem has been attracting considerable attention thanks to the rapid development of the high-speed communication network, image processing and computer science. In the past decades, many Quality of Service Routing algorithms were presented based on the QoS requirements and the resource constraints.

The idea of the inverse optimization problem is to modify the given or estimated parameters such that the given feasible solution became an optimal solution. The modification costs are measured by different norms, such as \(l_1\) norm, \(l_2\) norm, \(l_\infty \) norm, Hamming distance and so on.

In this paper, we consider the inverse multicast quality of service routing problems under the weighted \(l_1\) norm. We present combinatorial algorithms which can be finished in strongly polynomial time.

This research is supported by the National Natural Science Foundation of China (Grant No. 11001232, 61301098), Fujian Provincial Natural Science Foundation of China (Grant No. 2012J01021) and Fundamental Research Funds for the Central Universities (Grant No. 20720160035, 20720150002).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja, R.K., Orlin, J.B.: Combinatorial algorithms for inverse network flow problems. Networks 40, 181–187 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berman, O., Ingco, D.I., Odoni, A.: Improving the location of minimax facilities through network modification. Networks 24, 31–41 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Math. Program. 53, 45–61 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, S.G., Nahrsted, K.: An overview of quality of serice routing for next-generation high-speed networks: problems and solutions. IEEE Netw., Special Issue Transm. Distrib. Digit. Video 12(6), 64–79 (1998)

    Google Scholar 

  5. Güler, C., Hamacher, H.W.: Capacity inverse minimum cost flow problem. J. Comb. Optim. 19, 43–59 (2010)

    Google Scholar 

  6. Heuberger, C.: Inverse optimization: a survey on problems, methods, and results. J. Comb. Optim. 8, 329–361 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liu, L.C., Yao, E.Y.: A weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia. Pac. J. Oper. Res. 24, 725–736 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Orlin, J.B.: Max flows in \(O(nm)\) time, or better. In: Proceedings of STOC 2013, pp. 765–774 (2013)

    Google Scholar 

  9. Tayyebi, J., Aman, M.: Note on “Inverse minimum cost flow problems under the weighted Hamming distance”. Eur. J. Oper. Res. 234, 916–920 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, C., Zhang, J.Z., Ma, Z.F.: Inverse maximum flow and minimum cut problems. Optimization 40, 147–170 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhang, J.Z., Cai, M.C.: Inverse problem of minimum cuts. Math. Method. Oper. Res. 47, 51–58 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zhang, J.Z., Liu, Z.H., Ma, Z.F.: Some reverse location problems. Eur. J. Oper. Res. 124, 77–88 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhang, J.Z., Ma, Z.F., Yang, C.: A column generation method for inverse shortest path problems. ZOR-Math. Method. Oper. Res. 41, 347–358 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhang, B.W., Zhang, J.Z., He, Y.: The center location improvement problem under the Hamming distance. J. Comb. Optim. 9, 187–198 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhang, B.W., Zhang, J.Z., Qi, L.Q.: The shortest path improvement problems under Hamming distance. J. Comb. Optim. 12, 351–361 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Xiamen University, Xiamen, 361005, People’s Republic of China

    Longcheng Liu, Yu’an Chen & Wenhao Zheng

  2. School of Information Science and Engineering, Xiamen University, Xiamen, 361005, People’s Republic of China

    Deqing Wang

Authors
  1. Longcheng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu’an Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenhao Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Deqing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Longcheng Liu .

Editor information

Editors and Affiliations

  1. Hong Kong Polytechnic University, Kowloon, Hong Kong

    Song Guo

  2. Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, China

    Guiyi Wei

  3. School of Information Technology, Deakin University, Burwood, Victoria, Australia

    Yang Xiang

  4. Faculty of Business and Information, University of Ontario Institute of Technology, Oshawa, Ontario, Canada

    Xiaodong Lin

  5. IUT, University of Haute Alsace, Colmar, France

    Pascal Lorenz

Rights and permissions

Reprints and permissions

Copyright information

© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Liu, L., Chen, Y., Zheng, W., Wang, D. (2017). Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted \(l_1\) Norm. In: Guo, S., Wei, G., Xiang, Y., Lin, X., Lorenz, P. (eds) Testbeds and Research Infrastructures for the Development of Networks and Communities. TridentCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 177. Springer, Cham. https://doi.org/10.1007/978-3-319-49580-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49580-4_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49579-8

  • Online ISBN: 978-3-319-49580-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation