Skip to main content
Log in

The inner-system labeling algorithm and its fairness analysis

  • Papers
  • Published:
Journal of Electronics (China)

Abstract

On the basis of inner-system labeling signaling used in the integrated access system, a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand, and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integrated-services would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.

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. K. Dolzer, W. Payer, et al., A simulation study on traffic aggregation in multi-service networks. Proceedings of the IEEE Conference on High Performance Switching and Routing, Heidelberg, 2000, 157–165.

  2. K. Ramakrishnan, G. Hjalmtysson, J. Van der Merwe, The role of signaling in quality of service enabled networks, IEEE Communications Magazine, 37(1999)6, 124–132.

    Article  Google Scholar 

  3. P. Goyal, H. M. Vin, Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks, IEEE/ACM Trans. on Networking, 5(1997)5, 690–703.

    Article  Google Scholar 

  4. D. Stiliadis, A. Varma, Efficient fair queuing algorithm for packet-switched networks, IEEE/ACM Trans. on Networking, 6(1998)2, 175–185.

    Article  Google Scholar 

  5. I. Stoica, et al., A hierarchical fair service curve algorithm for link-sharing, real-time and priority services, IEEE/ACM Trans. on Networking, 8(2000)2, 185–199.

    Article  Google Scholar 

  6. I. Stoica, H. Zhang, Providing guaranteed services without per flow management. In Proceedings of SIGCOMM, 1999, 81–94.

  7. I. Stoica, S. Shenker, H. Zhang, Core-stateless fair queuing: Achieving approximately fair bandwidth allocations in high speed networks, in Proc. of ACM SIGCOMM’98, Vancouver, Canada, September 1998, 118–130.

  8. K. Nichols, et al., Definition of the differentiated service field (DS field) in the Ipv4 and Ipv6 headers, IETF RFC2474.

  9. S. BLAKE, et al., Architecture for differentiated services, IETF RFC2475.

  10. Han Guodong, Hang Dequan, Wu Jiangxing, I/O scheduling scheme for integrated-service access system based on the ILP, Journal of China Institute of Communications, 24(2003)6, 99–105, (in Chinese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communication author: Han Guodong, born in 1964, male, Ph.D., associate professor. P.O.Box 1001, NDSC, Zhengzhou 450002, China.

About this article

Cite this article

Han, G., Li, Y. & Wu, J. The inner-system labeling algorithm and its fairness analysis. J. of Electron.(China) 22, 612–618 (2005). https://doi.org/10.1007/BF02687842

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02687842

Key words

Navigation