Abstract
SummaryWe demonstrate a new approach to assuring fairness in flow‐aware networking. Standard routine in flow‐aware networking guarantees that each flow receives the same amount of resources. This property can be exploited by dividing a single transmission into a number of flows. We propose and evaluate the per‐user fair packet scheduling mechanism, which ensures fairness among users (not flows). We also compare the new mechanism with the one already known from the literature, which is based on altering the admission control routine. Evaluation shows that the new concept of fairness provides better performance and fair resource distribution regardless of the behavior of users.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
