Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The rapid growth of real-time and multimedia traffic over IP networks makes not only QoS guarantees but also network survivability more critical.  proposes an efficient algorithm which supports end-to-end path-based connection restoration in MPLS networks.  review previous related work. This includes SPR (Shortest Path Restoration), PIR (Partial Information Restoration) and CIR (Complete Information Restoration). The objective of backup path selection algorithms is to minimize the total network bandwidth consumed due to backup paths. Backup path bandwidth usage can be reduced by sharing backup paths among disjoint service paths. In CIR, since a path selection algorithm uses per-LSP information, backup path sharing can be optimized. Hover, the large amount of information, which each node advertises and maintains, makes it impractical. In the case of PIR, some sharing of backup paths is possible while using the aggregated service bandwidth and backup bandwidth used on each link.  think it is reasonable to increase backup path sharing using aggregated information as with PIR.   propose an efficient backup path selection algorithm to outperform PIR while using aggregated information. Simulation results show that our algorithm uses less total backup bandwidth compared to PIR.
['Wook Jeong', 'Geunhyung Kim', 'Cheeha Kim']
I am writing a research paper on a idea An efficient backup path selection algorithm in MPLS networks
[{"from": "human", "value": "I am writing a research paper on a idea An efficient backup path selection algorithm in MPLS networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The rapid growth of real-time and multimedia traffic over IP networks makes not only QoS guarantees but also network survivability more critical.  proposes an efficient algorithm which supports end-to-end path-based connection restoration in MPLS networks.  review previous related work. This includes SPR (Shortest Path Restoration), PIR (Partial Information Restoration) and CIR (Complete Information Restoration). The objective of backup path selection algorithms is to minimize the total network bandwidth consumed due to backup paths. Backup path bandwidth usage can be reduced by sharing backup paths among disjoint service paths. In CIR, since a path selection algorithm uses per-LSP information, backup path sharing can be optimized. Hover, the large amount of information, which each node advertises and maintains, makes it impractical. In the case of PIR, some sharing of backup paths is possible while using the aggregated service bandwidth and backup bandwidth used on each link.  think it is reasonable to increase backup path sharing using aggregated information as with PIR.   propose an efficient backup path selection algorithm to outperform PIR while using aggregated information. Simulation results show that our algorithm uses less total backup bandwidth compared to PIR."}]