阿根廷vs墨西哥竞猜
 library logo
    • login
    view item 
    •   knowledge commons home
    • electronic theses and dissertations
    • electronic theses and dissertations from 2009
    • view item
    •   knowledge commons home
    • electronic theses and dissertations
    • electronic theses and dissertations from 2009
    • view item
    javascript is disabled for your browser. some features of this site may not work without it.
    quick search

    browse

    all of knowledge commonscommunities & collectionsby issue dateauthorstitlessubjectsdisciplineadvisorcommittee memberthis collectionby issue dateauthorstitlessubjectsdisciplineadvisorcommittee member

    my account

    login

    power efficient survivable routing with p-cycles

    thumbnail
    view/open
    fedickk2011m-1b.pdf (2.766mb)
    date
    2011
    author
    fedick, kristoffer
    metadata
    show full item record
    abstract
    power awareness in networking has been a vital area of research in wireless networks but, until recently, has been largely ignored in wired networks. in wireless applications, the amount of power utilized by transmission is of vital importance since it will limit factors such as battery life and transmission range. in wired networks, the power issues of wireless networks do not arise since the wired networks receive their power from the power grid. however, the problem of operational costs and the environmental impact of wired networks have become increasingly important issues in recent years. this thesis proposes a power efficient routing scheme to address the environmental and operational cost issues. the operational costs of a wired network can be reduced by reducing the amount of power the network utilizes. the proposed power efficient routing scheme utilizes a demand prediction algorithm to determine a set of expected future traffic. the set of expected traffic is then assigned paths in the network using an energy efficient routing algorithm. the paths that are assigned to the predicted traffic are used to assign paths to the real traffic as it enters the network. by continuously updating the set of expected traffic, and the paths that are assigned to the expected traffic, the energy efficient routing algorithm can maintain an energy efficient routing solution over time, and thus, power efficiency is achieved.
    uri
    http://knowledgecommons.lakeheadu.ca/handle/2453/304
    collections
    • electronic theses and dissertations from 2009 [1612]

    阿根廷vs墨西哥竞猜 library
    contact us | send feedback

     

     


    阿根廷vs墨西哥竞猜 library
    contact us | send feedback