During the last ten years an extensive effort has been made to devise models and analytical techniques for the restricted buffer sharing schemes.In this paper,we overcome the difficulty of analyzing the sharing scheme with maximum limits in the light of inclusion-exclusion principle in comblnatorics,and thereby derive more explicitly the closed-form expressions for the most general restricted sharing scheme,i.e.,the sharing scheme with both minimum and maximum limits.The expressions for other sharing schemes can be easily as special cases deduced from this general case.Finally,from numerical evaluations,we clarify some assumptions and conjectures impossible to be confirmed before.
展开▼
