• Login
    View Item 
    •   Home
    • Faculty/ Researcher Works
    • Faculty/ Researcher Works
    • View Item
    •   Home
    • Faculty/ Researcher Works
    • Faculty/ Researcher Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of TUScholarShareCommunitiesDateAuthorsTitlesSubjectsGenresThis CollectionDateAuthorsTitlesSubjectsGenres

    My Account

    LoginRegister

    Help

    AboutPeoplePoliciesHelp for DepositorsData DepositFAQs

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Multi-resource energy-efficient routing in cloud data centers with network-As-A-service

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1501.05086v2.pdf
    Size:
    939.4Kb
    Format:
    PDF
    Download
    Genre
    Conference Proceeding
    Date
    2016-02-11
    Author
    Wang, L
    Anta, AF
    Zhang, F
    Wu, J
    Liu, Z
    Subject
    cs.NI
    cs.NI
    Permanent link to this record
    http://hdl.handle.net/20.500.12613/5738
    
    Metadata
    Show full item record
    DOI
    10.1109/ISCC.2015.7405595
    Abstract
    © 2015 IEEE. With the rapid development of software defined networking and network function virtualization, researchers have proposed a new cloud networking model called Network-As-A-Service (NaaS) which enables both in-network packet processing and application-specific network control. In this paper, we revisit the problem of achieving network energy efficiency in data centers and identify some new optimization challenges under the NaaS model. Particularly, we extend the energy-efficient routing optimization from single-resource to multi-resource settings. We characterize the problem through a detailed model and provide a formal problem definition. Due to the high complexity of direct solutions, we propose a greedy routing scheme to approximate the optimum, where flows are selected progressively to exhaust residual capacities of active nodes, and routing paths are assigned based on the distributions of both node residual capacities and flow demands. By leveraging the structural regularity of data center networks, we also provide a fast topology-Aware heuristic method based on hierarchically solving a series of vector bin packing instances. Extensive simulations show that the proposed routing scheme can achieve significant gain on energy savings and the topology-Aware heuristic can produce comparably good results while reducing the computation time to a large extent.
    Citation to related work
    IEEE
    Has part
    Proceedings - IEEE Symposium on Computers and Communications
    ADA compliance
    For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
    ae974a485f413a2113503eed53cd6c53
    http://dx.doi.org/10.34944/dspace/5720
    Scopus Count
    Collections
    Faculty/ Researcher Works

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Temple University Libraries | 1900 N. 13th Street | Philadelphia, PA 19122
    (215) 204-8212 | scholarshare@temple.edu
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.