Skip to main content
Log in

Network layered priority mapping theory

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In the early days of the Internet layered design, the information between layers did not exchange in large amount frequently. With the rapid growth of the Internet, the emergence of many technologies such as service data partition, multi-connection and multi-path has made it possible to frequently exchange complex information between layers. With regard to these changes, this paper introduces “network layered priority mapping (NLPM)” for future Internet development. The NLPM aims to maximize the satisfaction of the Internet users. The NLPM is designed to differentiate priority of the information on different layers and integrate the information using priority mapping. With NLPM, network services can be delivered more efficiently; network utilization such as the utilization of connection, path and channel can also be improved. Model analysis, NS simulation and prototype implementation have proved the efficiency of NLPM.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Sivakumar H, Bailey S, Grossman R L. PSockets: The case for application-level network striping for data intensive applications using high speed wide area networks. In: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) 2000. Article No. 37. Dallas: IEEE Computer Society, 2000

    Google Scholar 

  2. Balakrishnan H, Rahul H, Seshan S. An integrated congestion management architecture for internet hosts. Proc ACM Sigcomm, 1999, 29: 175–187

    Article  Google Scholar 

  3. Baru C, Moore R, Rajasekar A, et al. The SDSC storage resource broker. In: Proceedings of the 1998 Conference of the Centre for Advanced Studies on Collaborative Research. Toronto: IBM press, 1998. 5

    Google Scholar 

  4. Floyd S. Congestion Control Principles. RFC 2914, The Internet Engineering Task Force (IETE), 2000

  5. Lee J, Gunter D, Tierney B. Applied techniques for high bandwidth data transfers across wide area networks. In: Proceedings of International Conference on Computing in High Energy and Nuclear Physics. Beijing: Science Press, 2001

    Google Scholar 

  6. Hacker T, Athey B. The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium. Florida: IEEE Computer Society, 2002. 314

    Google Scholar 

  7. Hsieh H Y, Sivakumar R. A transport layer approach for achieving aggregate bandwidths on multihomed mobile hosts. In: Proceedings of the 8th Annual International Conference on Mobile Computing and Networking. Atlanta: ACM, 2002. 83–94

    Chapter  Google Scholar 

  8. Zhang M, Lai J, Krishnamurthy A, et al. A transport layer approach for improving end-to-end performance and robustness using redundant paths. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference. Boston: USENIX Association, 2004. 8

    Google Scholar 

  9. Iyengar J R, Amer P, Stewart R. Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths. IEEE/ACM TON, 2006, 14: 951–964

    Article  Google Scholar 

  10. Wu J P, Ren G, Li X. Building a next generation Internet with source address validation architecture. Sci China Ser F-Inf Sci, 2008, 51: 1681–1691

    Article  Google Scholar 

  11. Zhang H K, Su W. Fundamental Research on the architecture of new network-universal network and pPervasive services (in Chinese). Acta Electron Sin, 2007, 35: 593–598

    Google Scholar 

  12. Shenker S. Fundamental design issues for the future Internet. IEEE J Select Areas Commun, 1995, 13: 1176–1188

    Article  Google Scholar 

  13. Yang D. Pervasive Service Network basic Research with Resource-Oriented (in Chinese). Doctoral Thesis. Beijing: Beijing Jiaotong University. 2009

    Google Scholar 

  14. Osogami T, Wierman A, Harchol B M, et al. A recursive analysis technique for multi-dimensionally infinite Markov chains. ACM Sigmetr Per, 2004, 32: 3–5

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, D., Zhang, H., Song, F. et al. Network layered priority mapping theory. Sci. China Inf. Sci. 53, 1713–1726 (2010). https://doi.org/10.1007/s11432-010-4047-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4047-0

Keywords

Navigation