University of Taipei:Item 987654321/15991
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 3324/17070 (19%)
Visitors : 1482674      Online Users : 494
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/15991


    Title: Cost optimization of a path protection system with partial bandwidth using Petri nets
    Authors: Shen, Victor R. L.;Shen, Rong-Kuan;Yang, Cheng-Ying;楊政穎;Gibran
    Contributors: 臺北市立大學資訊科學系
    Keywords: Network management;Petri net;Path protection;Cost optimization;Bandwidth
    Date: 2016-10
    Issue Date: 2017-07-31 13:35:19 (UTC+8)
    Abstract: As people become more and more connected to each other through Internet services, the needs to ensure reliability in Internet connection become unavoidable. To serve data traffic with varying degree of importance when maintaining the lowest operational expense is one of challenges faced by network engineers. Critical data traffic must be protected from termination caused by unwanted failures that could happen along the data path, but at the same time, the operational expense spent on the path protection must be kept as minimal as possible. It ensures that the Internet provider can still gain reasonable profits from its services. In this study, the operational expense of the path protection system with partial bandwidth based on the toggling dual cost (TDC) algorithm aims to be optimized. The algorithm is modeled by a Petri net, a powerful tool for modeling asynchronous and concurrent systems. The model is analyzed based on the Petri net properties, namely, boundedness and liveness. Based on boundedness and liveness, the proposed model can have no overflow or deadlock problem in its implementation. The network engineers can optimize the TDC algorithm to maximum efficiency, in order to gain reasonable profits without sacrificing the network reliability.
    Relation: Wireless Personal Communications,Vol. 90,P.1239-1259
    Appears in Collections:[Department of Computer Science] Periodical Articles

    Files in This Item:

    There are no files associated with this item.



    All items in uTaipei are protected by copyright, with all rights reserved.


    如有問題歡迎與系統管理員聯繫
    02-23113040轉2132
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback