Statistical delay budget partitioning algorithm

Najah Abu Ali, Saeed Gazor, Hussein Mouftah

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)


    Mapping the end to end QoS requirements into link QoS requirements is an important step for resource allocation of connection oriented services. The problem of the QoS partitioning has been addressed in literature and proved to be NP complete. Different algorithms are proposed to solve the problem of single end-to-end QoS metric. However, these algorithms are near optimal or heuristic algorithms and solve the QoS partitioning problem for single QoS metric. In this paper, we propose a novel optimal partitioning algorithm which is capable of partitioning the end to end QoS requirement for multiple QoS metrics, additive and multiplicative, simultaneously. Extensive simulation verified the effectiveness of the algorithm compared to two QoS partitioning algorithms. The results show that the proposed algorithm outperforms the other two algorithms for loose and stringent QoS requirements and over different path lengths.

    Original languageEnglish
    Title of host publication2006 IEEE International Conference on Communications, ICC 2006
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Number of pages6
    ISBN (Print)1424403553, 9781424403554
    Publication statusPublished - 2006
    Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
    Duration: Jul 11 2006Jul 15 2006

    Publication series

    NameIEEE International Conference on Communications
    ISSN (Print)0536-1486


    Other2006 IEEE International Conference on Communications, ICC 2006

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering


    Dive into the research topics of 'Statistical delay budget partitioning algorithm'. Together they form a unique fingerprint.

    Cite this