• Login
    View Item 
    •   IIMA Institutional Repository Home
    • Working Papers
    • Working Papers
    • View Item
    •   IIMA Institutional Repository Home
    • Working Papers
    • Working Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An efficient solution approach for combinatorial bandwidth packing problem with queuing delays

    Thumbnail
    View/Open
    WP_2014_12_05 (415.7Kb)
    Date
    2014
    Author
    Jayaswal, Sachin
    Vidyarthi, Navneet
    Das, Sagnik
    Metadata
    Show full item record
    Abstract
    The Combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as: given a set of request, each with its potential revenue and consisting of calls with their bandwidth requirements, deciding (i) a subset of the requests to accept/reject, and (ii) a route for each call in an accepted request, so as to maximize total revenue earned. However, telecommunication networks are generally characterized by variability in the call (bits) arrival rates and service times, resulting in delays in the network. In this paper, we present a non-linear integer programming model for CBPP accounting for such delays. By using simple transformation and piecewise outer-approximation, we linearize the model, and present an efficient cutting plane based approach to solve the resulting linear mixed integer program to optimality.
    URI
    http://hdl.handle.net/11718/17163
    Collections
    • Working Papers [2423]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of IIMA Institutional RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV