Browsing by Subject "Telecommunication traffic"

Now showing 1 - 20 of 21

Open Access
AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing
(Springer, 2004) Alparslan O.; Akar, N.; Karasan, E.
With this paper, we propose a distributed online traffic engineering architecture for MPLS networks. In this architecture, a primary and secondary MPLS LSP are established from an ingress LSR to every other egress LSR. We propose to split the TCP traffic between the primary and secondary paths using a distributed mechanism based on ECN marking and AIMD-based rate control. Inspired by the random early detection mechanism for active queue management, we propose a random early reroute scheme to adaptively control the delay difference between the primary and secondary LSPS. Considering the adverse effect of packet reordering on TCP performance for packet-based load balancing schemes, we propose that the TCP splitting mechanism operates on a per-flow basis. Using flow-based models developed for Internet traffic and simulations, we show that flow-based distributed multi-path traffic engineering outperforms on a consistent basis the case of a single path in terms of per-flow goodputs. Due to the elimination of out-of-order packet arrivals, flow-based splitting also enhances TCP performance with respect to packet-based splitting especially for long TCP flows that are hit hard by packet reordering. We also compare and contrast two queuing architectures for differential treatment of data packets routed over primary and secondary LSPS in the MPLS data plane, namely first-in-first-out and strict priority queuing. We show through simulations that strict priority queuing is more effective and relatively more robust with respect to the changes in the traffic demand matrix than first-in-first-out queuing in the context of distributed multi-path routing.
Open Access
An approach to manage connectionless services in connection-oriented networks
(IEEE, 1996) Abdelatı, Muhammed; Arıkan, Erdal
In this work we propose a pricing scheme which serves as an instrument for managing connectionless services in connection-oriented communication networks. The scheme is able to allocate network bandwidth in a Pareto-optimal way that maximizes the total surplus. The key idea is to decompose the service provision procedure among three separate parties whose interactions are governed by a set of competitive pricing mechanisms.
Open Access
Available bit rate traffic engineering in MPLS networks with flow-based multipath routing
(Institute of Electronics Information and Communication Engineers, 2004) Akar, N.; Hökelek, İ.; Karasan, E.
In this paper, we propose a novel traffic engineering architecture for IP networks with MPLS backbones. In this architecture, two link-disjoint label switched paths, namely the primary and secondary paths, are established among every pair of IP routers located at the edges of an MPLS backbone network. As the main building block of this architecture, we propose that primary paths are given higher priority against the secondary paths in the MPLS data plane to cope with the so-called knock-on effect. Inspired by the ABR flow control mechanism in ATM networks, we propose to split traffic between a source-destination pair between the primary and secondary paths using explicit rate feedback from the network. Taking into consideration the performance deteriorating impact of packet reordering in packet-based load balancing schemes, we propose a traffic splitting mechanism that operates on a per-flow basis (i.e., flow-based multipath routing). We show via an extensive simulation study that using flow-based multipath traffic engineering with explicit rate feedback not only provides consistently better throughput than that of a single path but is also void of out-of-order packet delivery.
Open Access
Client-server synchronization and buffering for variable rate multimedia retrievals
(1996) Hui J.Y.; Karasan, E.; Li J.; Zhang, J.
We consider the use of large buffers and feedback as a mechanism to maintain loosely coupled synchronization between a multimedia server and a client. The multimedia stream is modeled as a fluid flow through rate controlled valves and buffers with multiple thresholds. These thresholds are used to control the rates upstream. The quality of service for the multimedia connection is characterized in terms of the jitter in the received media stream due to buffer underflow and overflow. This quality of service is used to exercise rate and admission control in the presence of congestion. The feedback mechanism is, implemented in GRAMS, an adaptive multimedia client-server system. Experimental statistics are gathered for the purpose of traffic engineering. We employ a fluid flow and first passage time analysis to understand the traffic process through the pipelines and the buffers and to estimate the amount of signaling required by the feedback mechanism.
Open Access
Design of translucent optical networks: Partitioning and restoration
(Kluwer, 2004) Karasan, E.; Arisoylu, M.
We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected. A greedy heuristic partitioning algorithm is proposed for planar network topologies. We use section restoration for translucent networks where failed connections are rerouted within the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that fiber costs with section restoration are close to those with path restoration for mesh topologies used in this study. It is also shown that the number of transponders with the translucent network architecture is substantially reduced compared to opaque networks.
Open Access
Dimensioning shared-per-node recirculating fiber delay line buffers in an optical packet switch
(Elsevier, 2013) Akar, N.; Gunalay, Y.
Optical buffering based on fiber delay lines (FDLs) has been proposed as a means for contention resolution in an optical packet switch. In this article, we propose a queuing model for feedback-type shared-per-node recirculating FDL optical buffers in asynchronous optical switching nodes. In this model, optical packets are allowed to recirculate over FDLs as long as the total number of recirculations is less than a pre-determined limit to meet signal loss requirements. Markov Modulated Poisson Process (MMPP)-based overflow traffic models and fixed-point iterations are employed to provide an approximate analysis procedure to obtain blocking probabilities as a function of various buffer parameters in the system when the packet arrival process at the optical switch is Poisson. The proposed algorithm is numerically efficient and accurate especially in a certain regime identified with relatively long and variably-sized FDLs, making it possible to dimension optical buffers in next-generation optical packet switching systems.
Open Access
Distributed construction and maintenance of bandwidth-efficient bluetooth scatternets
(IEEE, 2005-05) Tekkalmaz, Metin; Sözer, Hasan; Körpeoǧlu, İbrahim
Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet construction policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for scatternet construction problem, that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency provided by the proposed algorithm. © 2005 IEEE.
Open Access
An efficient virtual topology design and traffic engineering scheme for IP/WDM networks
(Springer, 2007) Şengezer, Namık; Karasan, Ezhan
We propose an online traffic engineering (TE) scheme for efficient routing of bandwidth guaranteed connections on a Multiprotocol label switching (MPLS)/wavelength division multiplexing (WDM) network with a traffic pattern varying with the time of day. We first consider the problem of designing the WDM virtual topology utilizing multi-hour statistical traffic pattern. After presenting an effective solution to this offline problem, we introduce a Dynamic tRaffic Engineering AlgorithM (DREAM) that makes use of the bandwidth update and rerouting of the label switched paths (LSPs). The performance of DREAM is compared with commonly used online TE schemes and it is shown to be superior in terms of blocked traffic ratio.
Open Access
Electrically-reconfigurable integrated photonic switches
(IEEE, 2004) Fidaner, O.; Demir, Hilmi Volkan; Sabnis V.A.; Harris Jr. J.S.; Miller, D.A.B.; Zheng J.-F.
We report remotely electrically reconfigurable photonic switches that intimately integrate waveguide electroabsorption modulators with surface-normal photodiodes, avoiding conventional electronics. These switches exhibit full C-band wavelength conversion at 5 Gb/s and are remotely reconfigurable within tens of nanoseconds.
Open Access
Exact calculation of blocking probabilities for bufferless optical burst switched links with partial wavelength conversion
(IEEE, 2004-10) Akar, Nail; Karasan, Ezhan
In this paper, we study the blocking probabilities in a wavelength division multiplexing-based asynchronous bufferless optical burst switch equipped with a bank of tuneable wavelength converters that is shared per output link. The size of this bank is generally chosen to be less than the number of wavelengths on the link because of the relatively high cost of wavelength converters using current technologies; this case is referred to as partial wavelength conversion in the literature. We present a probabilistic framework for exactly calculating the blocking probabilities. Burst durations are assumed to be exponentially distributed. Burst arrivals are first assumed to be Poisson and later generalized to the more general phase-type distribution. Unlike existing literature based on approximations and/or simulations, we formulate the problem as one of finding the steadystate solution of a continuous-time Markov chain with a block tridiagonal infinitesimal generator. We propose a numerically efficient and stable solution technique based on block tridiagonal LU factorizations. We show that blocking probabilities can exactly and efficiently be found even for very large systems and rare blocking probabilities. Based on the results of this solution technique, we also show how this analysis can be used for provisioning wavelength channels and converters. © 2004 IEEE.
Unknown
H∞-performance analysis of robust controllers designed for AQM
(IEEE, 2003) Yan, P.; Özbay, Hitay
It has been shown that the TCP connections through the congested routers with the Active Queue Management (AQM) can be modeled as a nonlinear feedback system. In this paper, we design H∞ robust controllers for AQM based on the linearized TCP model with time delays. For the linear system model exhibiting LPV nature, we investigate the H∞-performance with respect to the uncertainty bound of RTT (round trip time). The robust controllers and the corresponding analysis of H∞-performance are validated by simulations in different scenarios.
Open Access
Matrix-geometric solutions of M/G/1-type Markov chains: A unifying generalized state-space approach
(1998) Akar, N.; Oǧuz, N.C.; Sohraby, K.
In this paper, we present an algorithmic approach to find the stationary probability distribution of M/G/1-type Markov chains which arise frequently in performance analysis of computer and communication networ ks. The approach unifies finite- and infinite-level Markov chains of this type through a generalized state-space representation for the probability generating function of the stationary solution. When the underlying probability generating matrices are rational, the solution vector for level k, x k, is shown to be in the matrix-geometric form x k+1 = gF k H, k ≥ 0, for the infinite-level case, whereas it takes the modified form x k+1 = g 1F 1 kH 1 + g 2F 2 K-k-1 H 2, 0 ≤ k < K, for the finite-level case. The matrix parameters in the above two expressions can be obtained by decomposing the generalized system into forward and backward subsystems, or, equivalently, by finding bases for certain generalized invariant subspaces of a regular pencil λE - A. We note that the computation of such bases can efficiently be carried out using advanced numerical linear algebra techniques including matrix-sign function iterations with quadratic convergence rates or ordered generalized Schur decomposition. The simplicity of the matrix-geometric form of the solution allows one to obtain various performance measures of interest easily, e.g., overflow probabilities and the moments of the level distribution, which is a significant advantage over conventional recursive methods.
Open Access
Mesh topology design in overlay virtual private networks
(IET, 2002) Karasan, E.; Ekin-Karasan, O.; Akar, N.; Pinar, M. C.
The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search based heuristic is proposed.
Open Access
Model-free adaptive hysteresis for dynamic bandwidth reservation
(IEEE, 2007-10) Akar, Nail
Dynamic bandwidth reservation refers to the process of dynamically updating the bandwidth allocation to a connection between two network end points on the basis of actual aggregate traffic demand of the connection. We assume a scenario in which bandwidth updates for the connection should not be performed too frequently and the frequency of updates are thus limited to a so-called desired update rate. We propose an asynchronous model-free adaptive hysteresis algorithm for dynamic bandwidth reservations with such update frequency constraints. We validate the effectiveness of the proposed approach by comparing its bandwidth efficiency with that of a synchronous model-based dynamic bandwidth reservation mechanism from the existing literature.
Open Access
MPLS automatic bandwidth allocation via adaptive hysteresis
(Elsevier, 2010-11-29) Akar, N.; Toksöz, M. A.
MPLS automatic bandwidth allocation (or provisioning) refers to the process of dynamically updating the bandwidth allocation of a label switched path on the basis of actual aggregate traffic demand on this path. Since bandwidth updates require signaling, it is common to limit the rate of updates to reduce signaling costs. In this article, we propose a model-free asynchronous adaptive hysteresis algorithm for MPLS automatic bandwidth allocation under bandwidth update rate constraints. We validate the effectiveness of the proposed approach by comparing it against existing schemes in (i) voice and (ii) data traffic scenarios. The proposed method can also be used in more general GMPLS networks.
Open Access
Optical core networks research in the e-Photon-ONe+ project
(2009) Callegati F.; Cugini F.; Ghobril P.; Gunreben, S.; López V.; Martini, B.; Pavón-Mariño P.; Perényi, M.; Sengezer, N.; Staessens, D.; Szigeti J.; Tornatore, M.
This paper reports a summary of the joint research activities on Optical Core Networks within the e-Photon-ONe+ project. It provides a reasonable overview of the topics considered of interest by the European research community and supports the idea of building joint research activities that can leverage on the expertise of different research groups. © 2009 IEEE.
Open Access
Regenerator placement and traffic engineering with restoration in GMPLS networks
(Springer, 2003) Yetginer, E.; Karasan, E.
In this paper, we study regenerator placement and traffic engineering of restorable paths in generalized multiprotocol label switching (GMPLS) networks. Regenerators are necessary in optical networks in order to cope with transmission impairments. We study a network architecture where regenerators are placed only at selected nodes for decreasing cost of regeneration. We propose two heuristic algorithms for optimum placement of these regenerators. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, off-line computation of working and restoration paths is studied for traffic engineering with path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands resulting from traffic uncertainties that can be carried over the network. Proposed heuristic regenerator placement algorithms are also evaluated from a traffic engineering point of view.
Open Access
A reordering-free multipath traffic engineering architecture for DiffServ-MPLS networks
(IEEE, 2003-10) Akar, Nail; Hokelek, İbrahim; Atik, Muammer; Karasan, Ezhan
We propose a novel traffic engineering architecture for IP networks with multiprotocol label switching (MPLS) backbones. In this architecture, two (primary and secondary) label switched paths (LSPs) are established among every pair of IP routers located at the edge of an MPLS cloud. Traffic between a source-destination pair is then split between the primary and secondary LSPs using an ABR-like explicit-rate feedback gathered from the network. Taking into consideration the packet reordering effect of packet-based load balancing schemes, we propose a novel traffic splitting mechanism that operates on a per-flow basis. We show, using a variety of scenarios, that deploying flow-based multipath traffic engineering not only provides significantly and consistently better throughput than that of a single path, but is also void of any packet reordering. © 2003 IEEE.
Open Access
TELPACK: An Advanced teletraffic analysis package
(1998) Akar, N.; Oguz, N.C.; Sohraby, K.
Performance evaluation of computer and communication networks gives rise to teletraffic problems of potentially large dimensionality. We briefly summarize a unifying system theoretic approach to efficient solution of a diversity of such problems, and introduce TELPACK, a publicly available software that implements this approach.
Open Access
Traffic engineering in case of interconnected and integrated layers
(IEEE, 2008-09-10) Hegyi P.; Cinkler, T.; Şengezer, Namık; Karaşan, Ezhan