Conference Paper (PDF Available)

Rerouting Technique for Faster Restoration of Preempted Calls

Edith Cowan Univ., Perth
DOI: 10.1109/ICIS.2007.156 Conference: Computer and Information Science, 2007. ICIS 2007. 6th IEEE/ACIS International Conference on
Source: OAI


In a communication network where resources are shared between instantaneous request (IR) and book-ahead (BA) connections, activation of future BA connections causes preemption of many on-going IR connections upon resource scarcity. A solution to this problem is to reroute the preempted calls via alternative feasible paths, which often does not ensure acceptably low disruption of service. In this paper, a new rerouting strategy is proposed that uses the destination node to initiate the rerouting and thereby reduces the rerouting time, which ultimately improves the service disruption time. Simulations on a widely used network topology suggest that the proposed rerouting scheme achieves more successful rerouting rate with lower service disruption time, while not compromising other network performance metrics like utilization and call blocking rate.

Full-text (PDF)

Available from: Iftekhar Ahmad
  • Source
    • "These solutions include graph-based heuristic strategies as well as optimization formulations. Moreover, some researchers have even looked at broader topics such as re-routing AR requests for survivability purpose [10],[11]. "
    [Show abstract] [Hide abstract] ABSTRACT: Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm design and have not addressed related implementation concerns in distributed settings. As a result, most schemes imply the use of a centralized controller, posing many scalability and reliability challenges. In order to address these concerns, this paper proposes a distributed routing solution for advance reservation. Namely, new link-state data structures are defined to summarize timeline-bandwidth state without the "time-slot" constraint along with novel routing update triggering policies for timely state dissemination. A refined distributed path- computation scheme is then developed to use this propagated state. The proposed solution is analyzed using discrete event simulation.
    Preview · Conference Paper · Dec 2010
  • Source
    • "The work in [4] also presents a QoScapable rerouting scheme which tries to minimize the number of perturbed AR requests. Finally [5] proposes destinationinitiated rerouting in an effort to reduce rerouting times, and this translates into lower service disruption time. "
    [Show abstract] [Hide abstract] ABSTRACT: This paper studies rerouting in advance reservation networks. Namely, a novel load-balancing scheme is proposed to reroute admitted inactive reservations in order to lower blocking probability and improve future bandwidth utilization. Detailed algorithms are outlined in the form of pseudo-code, followed by analyses of related time and space complexities. Simulation results are then presented to compare the performance of the proposed solution versus existing advance reservation schemes.
    Full-text · Article · Jul 2010 · IEEE Communications Letters
  • [Show abstract] [Hide abstract] ABSTRACT: In this paper, a system of systems (SoS) framework for the reliability analysis of telecommunication networks is proposed. In this framework, two hazard analysis techniques, hazard and operability analysis and fault tree analysis, are combined in a hybrid scheme. This is further enhanced using the Bayesian network model along with sensitivity analysis in order to answer complex probability queries and to estimate the impact of residual mishap risks, unknown events, or events that cannot easily be modeled. The SoS emergent behavior is further revealed using exploratory modeling. The proposed SoS framework is applied in the case of a fiber-to-the-curb VDSL telecommunication network.
    No preview · Article · Jan 2012 · IEEE Systems Journal
Show more