Abstract
Flow aggregation is capable of reducing the burden on core routing and provide the scalability of network. Among the state-of-the-art methods of QoS (Quality of Service) mapping, the existing schemes lack effective means to guarantee the QoS of Internet flows in variable network environment. To tackle this problem, in this paper, we design a dynamic flow aggregation method that uses an enhanced rough ${k}$ -means algorithm (ERKM) to properly aggregate network flows and perform flexible QoS mapping across different networks. More importantly, it is able to adjust the allocation of flows according to the degree of membership in ever-changing Internet environment, and control the distance threshold parameter th to make the algorithm more flexible. The experimental results suggest that the proposed method outperforms other methods in terms of QoS support in the high-load and ever-changing networks. Moreover, it is validated that the proposed method can ensure the consistency and flexibility of QoS class mapping.
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 callMore From: IEEE Transactions on Network and Service Management
Disclaimer: 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.
