Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward

Lin, Pen-Min; Leon, B.; Stewart, Carl F

doi:10.1109/tcom.1978.1094162

Cited by 66 publications

(14 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 is used to clarify our notation. See [11], [20], [30] for discussions on augmented route trees. For this augmented route tree, we have…”

Section: A Deflection Routing Policy For Obsmentioning

confidence: 99%

“…To realize this extension, we would use the recursive approach outlined in [11], [30], [38] to compute the probability that a blocking or completion route of an augmented route tree is used given that the load offered to each link is known. This approach relies on a recursion that is commonly used in the field of system's reliability analysis.…”

Section: Step Three: End-to-end Blocking Probabilitiesmentioning

confidence: 99%

See 1 more Smart Citation

Stabilizing deflection routing in optical burst switched networks

Zalesky

Rosberg

et al. 2007

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-This paper studies the blocking performance of optical burst switching (OBS) networks using a sequential office control (SOC) state-independent deflection routing policy. We show that unprotected deflection routing may destabilize OBS resulting in higher blocking probabilities than if bursts were not deflected but simply blocked. This study was motivated by the well-known destabilizing effect that alternative routing has on circuit switching in classical telephony networks. We propose two forms of protection to guard against destabilization: 1) wavelength reservation, which is analogous to trunk reservation in circuit switching; and, 2) preemptive priority, which is a new form of protection where bursts that have not been deflected are given preemptive priority over bursts that have been deflected. Our main contribution is a one-moment reduced-load approximation to evaluate the blocking performance of OBS networks using deflection routing protected by either wavelength reservation or preemptive priority. Our reduced-load approximation relies on the usual assumptions of link independence and Poisson distributed link arrivals. We quantify the error admitted in making these two assumptions via simulation. Using our reducedload approximation, we evaluate the blocking performance of protected and unprotected deflection routing in several randomly generated networks. The chief conclusion of our study is that deflection routing in OBS should be given some form of protection to avoid destabilization resulting from upward load variations, and in terms of blocking performance, preemptive priority is the best form of protection for OBS. We use simulation to verify that our conclusions remain valid for a realistic traffic scenario.

show abstract

“…4 is used to clarify our notation. See [11], [20], [30] for discussions on augmented route trees. For this augmented route tree, we have…”

Section: A Deflection Routing Policy For Obsmentioning

confidence: 99%

Section: Step Three: End-to-end Blocking Probabilitiesmentioning

confidence: 99%

Stabilizing deflection routing in optical burst switched networks

Zalesky

Rosberg

et al. 2007

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…The difficulty of validating the numerical results obtained with the hybrid simulator stems from the fact that the studied ATM/ AAL2 technology is currently being standardized, and prototype systems are under construction. In order to validate the network level part of the simulator we have considered a number of cases detailed in (Lin 1978) and (Magi 1996). In (Magi 1996) a model for multirate circuit switched loss networks with non-zero call processing time is developed, which allowed us to compare simulation and analytical/approximative results in non-trivial cases.…”

Section: Validationmentioning

confidence: 99%

An Efficient Simulation Environment for 3rd Generation Cellular Networks

Valko¹,

Rácz²,

Fodor³

et al. 2000

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Together with measurements and analytical methods, the simulation-based evaluation of cellular systems will be increasingly important as the deployment of new mobile applications imposes new requirements both on the radio interface and on the fixed network infrastructure. Efficient allocation of the network's resources must be based on reliable and flexible performance evaluation techniques. In this paper we describe a simulation environment optimized for the performance analysis of wide band cellular networks. To handle the complexity of the system without losing low-level details due to a highlevel abstraction, a hierarchical simulation structure is developed which is also largely based on the integration of analytical evaluations' results into the simulation. The resulting structure can surprisingly efficiently (both in terms of simulation run time and in terms of modeling flexibility and speed) simulate large and complex systems while the level of abstraction can be freely selected in a wide range by the user. For instance, in case studies we find that simulation times of ATM based cellular networks can be an order of a magnitude less than using most of the readily available simulators. Though the simulation environment described here is specific to ATM/ AAL2 based mobile networks, the proposed concept is more widely applicable to accelerate simulations.

show abstract

“…In recent years, there has been considerable research in the area of analysis of state-dependent routing policies through the solution of fixed point equations [1,3,[6][7][8][9][10][11]13,15,16]. Independently of the work reported here, Chung, Kashper, and Ross [5] have developed, implemented, and tested serial algorithms for solving the fixed point equations for networks with state-dependent routing.…”

Section: Introductionmentioning

confidence: 99%

Fast parallel solution of fixed point equations for the performance evaluation of circuit-switched networks

Greenberg

Odlyzko

Rexford

et al. 1994

Performance Evaluation

View full text Add to dashboard Cite

Massively parallel algorithms are presented for solving systems of fixed point equations, modeling state-dependent routing in large asymmetric circuit-switched networks. Our focus is on the Aggregated Least Busy Alternative (ALBA) routing policy of Mitra, Gibbens and Huang. On a 16384 processor MasPar parallel computer, about a minute is required to compute estimates of the call blocking probabilities for every node-pair, for realistic networks of over 100 nodes. A few hours are required on a high speed workstation.

show abstract

Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward

Cited by 66 publications

References 17 publications

Stabilizing deflection routing in optical burst switched networks

Stabilizing deflection routing in optical burst switched networks

An Efficient Simulation Environment for 3rd Generation Cellular Networks

Fast parallel solution of fixed point equations for the performance evaluation of circuit-switched networks

Contact Info

Product

Resources

About