— In this paper, we propose a Probabilistic Preemptive (PP) scheme for service differentiation in Optical Burst Switching (OBS) networks. By changing the preemptive probability, an OBS node can adjust the ratio of burst blocking probability between different traffic classes, while the overall blocking probability is not affected.

In this paper a new path computation algorithm in Traffic Engineering in MPLS networks for reducing blocking probability of requests is proposed which is an improvement of TEDB algorithm. The TE-DB is one of best path computation algorithm which is proposed in literatures. The Algorithm deploys multiple path routing and distributes the load more balanced n network. In addition, it reduces the b...

Optical burst switching (OBS) is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. However, OBS networks suffer from a relatively high blocking probability, a primary metric of interest, because of contention. In this p...

Flows traversing a buffer-limited network can suffer rapid throughput deterioration with increasing path length. This paper introduces a distributed transmission scheduling scheme that supports strong bandwidth guarantees for flows routed over a large number of hops, without compromising network utilization. The scheme is defined within a reservation-based transmission control framework. Throug...

In wireless networks, terminating handoff calls is generally more objectionable than blocking new calls. The Guard Channel Scheme (GCS) and Handoff Queueing Scheme (HQS) are the popular and practical strategies to prioritize handoff calls. A key issue when giving handoff calls the higher priority is how to achieve a tradeoff among the handoff call blocking probability, new call blocking probabi...