In GMPLS-based networks, data is forwarded in manner of label switching on Label Switching Router (LSR). Ingress LSR must classify different IP flows into a set of Forwarding Equivalence Classes (FECs), which is a typical flow classification process. Ingress LSR will be the bottleneck of GMPLS-based networks if it could not provision fast flow classification. In this paper, we propose a novel fast flow classification scheme, coined Hierarchical Dividing Tree Scheme (HDTS), to improve the switching performance of ingress LSR in GMPLS-based networks. Four important advantages can be achieved by the proposed HDTS. First, the preprocess time in HDTS is reasonable. Second, fast FEC update is supported. Third, memory cost of HDTS is very low. Most important, the key factor that affects flow classification speed is not the number of FECs, but the depth of the search trees in HDTS. Theoretical analyses and simulations are conducted to evaluate performance of the proposed HDTS. Based on the analytical and experimental results, we can conclude that our HDTS improves the switching performance of ingress LSR greatly and is very practical for GMPLS-based networks due to its low cost.
Provisioning Protection and Restoration (P&R) capability is a necessity in Generalized Multi-Protocol Label Switching (GMPLS) networks. Label Switched Path (LSP) segment-based recovery is an important P&R type. In this paper, three novel overlapped LSP segment selection schemes are proposed. The near-optimal set of overlapped LSP segments can be obtained by the proposed schemes, which have polynomial time complexity. Differences among the proposed schemes are discussed and compared. Performance comparisons between LSP segment recovery with the proposed schemes and end-to-end LSP recovery are conducted. The results show that the proposed schemes perform very well in LSP segment recovery. With the proposed schemes, the complexity of LSP segment recovery design is decreased considerably. Moreover, the proposed schemes provide flexible choices for GMPLS-based P&R techniques in terms of different failure recovery time and resource utilization constraints.
Several recovery mechanisms are provided in Generalized Multi-Protocol Label Switching (GMPLS) networks to improve the network survivability. Future wired backbone networks will definitely be GMPLS-based, and GMPLS networks must provide an efficient recovery scheme to provision mobility-aware capabilities in wireless IP networks. The purpose of this paper is to propose a GMPLS-based recovery scheme for fast handoff in wireless IP networks. The
proposed scheme can establish new label switched path (LSP) rapidly by utilizing the backup resources when mobile node (MN) handoffs in wireless networks. Therefore, low handoff latency can be achieved. And, the resource utilization in GMPLS networks can be improved.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.