Browsing by Author "Akar, Nail"

Now showing 1 - 20 of 43

Open Access
Analysis of an Adaptive Modulation and Coding scheme with HARQ for TCP traffic
(IEEE, 2015-04) Öztürk, Onur; Akar, Nail
In this paper, we analyze the aggregate TCP throughput performance of a wireless link utilizing Active Queue Management (AQM) and an Adaptive Modulation and Coding (AMC) scheme with Hybrid ARQ (HARQ) based on the probability of failure in the first transmission attempt. We assume packets arriving out-of-order at the wireless receiver due to random retransmissions are resequenced before being released to the network. For this reason, an approximate model for the delay experienced at the resequencing buffer is also presented. In the light of the results obtained from the presented analysis, we propose a threshold for the aforementioned probability of failure making the investigated AMC scheme work at an overall performance close to that of the optimum policy. © 2015 IEEE.
Open Access
Analysis of continuous feedback Markov fluid queues and its applications to modeling Optical Burst Switching
(IEEE, 2013) Yazıcı, Mehmet Akif; Akar, Nail
Optical Burst Switching (OBS) has been proposed as a candidate technology for the next-generation Internet. In OBS, packets are assembled into a burst, and a burst control packet is sent in advance to inform and reserve resources at the optical nodes in the path of the burst. In this study, we analyze the horizon-based reservation scheme in OBS using Markov fluid queues. First, we provide a solution to continuous feedback Markov fluid queues, then we model the horizon-based reservation scheme as a continuous feedback Markov fluid queue and numerically study it. We provide numerical examples to validate our model and its solution technique as well as to obtain some insight on the horizon-based reservation mechanism. © 2013 IEEE.
Open Access
Analytical model of asynchronous shared-per-wavelength multi-fiber optical switch
(IEEE, 2011) Akar, Nail; Raffaelli, C.; Savi, M.
In this paper, a buffer-less shared-per-wavelength optical switch is equipped with multi-fiber interfaces and operated in asynchronous context. An analytical model to evaluate loss performance is proposed using an approximate Markov-chain based approach and the model is validated by simulations. The model is demonstrated to be quite accurate in spite of the difficulty in capturing correlation effects especially for small switch sizes. The model is also applied to calculate the number of optical components needed to design the optical switch according to packet loss requirements. The impact of the adoption of multiple fiber interfaces is outlined in terms of the remarkable saving in the number of wavelength converters employed, while increasing at the same time the number of optical gates needed by the space switching subsystem. The numerical results produced are a valuable basis to optimize overall switch cost. © 2011 IEEE.
Open Access
Bant genişliği kısıtı altında videonun en iyi iletimi
(IEEE, 2006-04) Gürses, E.; Akar, G. B.; Akar, Nail
In this paper, we propose an optimal video streaming framework using retransmissions based on the theory of Markov Decision Processes (MDP). Using MDPs, we calculate average reward optimal policies so as to maximize the on time delivery probability of video frames in the transmission window while conforming to network-imposed available bandwidth constraints. The effectiveness of the proposed approach is validated by comparing the results with theoretically obtained rate-distortion curves corresponding to the optimal policies by using the distortion model in [2] © 2006 IEEE.
Open Access
BISDN (Broadband integrated services digital network)
(John Wiley & Sons, 2003) Ayanoğlu, E.; Akar, Nail; Proakis, J. G.
The subject of B‐ISDN came into being in the late 1980s, together with the concept of Asynchronous Transfer Mode (ATM). ATM is closely tied to high‐speed packet switching by means of specialized switches implemented in hardware. Due to its high speed and packet structure, ATM technology was considered attractive to unify voice, data, and video services. A unification of these services over the telephone infrastructure was attempted earlier by a standards offering known as Integrated Services Digital Network (ISDN). Consequently, this new service unification was termed Broadband ISDN (B‐ISDN). Although due to its origins, B‐ISDN is sometimes closely tied to ATM technology, the term independently represents the vision of packet‐based high‐speed integration of voice, data, and video services. It is important that in this process, guarantees to satisfy different Quality‐of‐Service (QoS) needs (in terms of delay, loss, etc) required by voice, data, and video services are provided. In this vision, what is important is the unification, or integration of services; and the underlying technology is of secondary importance. As of the early 2000s, the technology to be employed in realizing this vision seems to have shifted from its origins of ATM. In this article, our emphasis is on B‐ISDN as a service integration vision. Nevertheless, we will describe its original emphasis as the service offering of ATM as well as the path the industry seems to be taking in implementing this vision.
Open Access
Capacity analysis of a PMR system with DAB downlink
(IEEE, 2003) Şengül, Ersin; Can, B.; Akar, Nail; İder, Yusuf Ziya; Köymen, Hayrettin
Several trunked private mobile radio (PMR) systems have been designed over the last decade, most of which have symmetric downlink and uplink channel capacities. These systems may not be spectrally efficient in case of group or broadcast-based voice and data calls, a common feature of PMR systems. We propose a new asymmetric PMR system comprising a wideband OFDM-based downlink and a narrowband uplink, which not only achieves a better spectral efficiency but also can support high bit rate multimedia applications. The system is shown to have high trunking efficiency since all users are assumed to use the pool of channels available in the wideband downlink. In this paper, we study the performance and capacity of a private mobile radio system using a digital audio broadcasting (DAB) downlink. In particular, we study the efficiency of such a system for voice calls using voice activity detection and statistical multiplexing. Moreover, we show that, the efficiency of the system can significantly increase, if the incoming calls, which can not find an available channel, are allowed to wait a certain amount of time before occupying a channel.
Open Access
Çok-akışlı eşler arası isteğe bağlı video sistemlerinin Markov zinciri tabanlı güvenilirlik modellemesi
(IEEE, 2008-04) Yazıcı, Mehmet Akif; Öztoprak, K.; Akar, Nail; Akar, G. B.
Çok-akışlı eşler-arası video, gelecek nesil isteğe bağlı video sistemleri için kullanılmaya aday teknolojilerdendir. Çok-akışlı video sistemlerinin sorunlarından birisi, eş dalgalanması adı verilen, eşlerin ağla olan bağlantılarının kopup düzelmesi durumudur. Eş dalgalanmasının bütün eşler-arası sistemlerde olumsuz etkileri olduğu bilinmektedir. Bu etkinin hafifletilmesi için çeşitli hata kontrollü alt-akış kodlama teknikleri önerilmiştir. Bu makalede, eş dalgalanması ve hata kontrolünün rolünü incelemek amacıyla sürekli zamanlı Markov zinciri tabanlı bir rassal model önerilmektedir. Bu model kullanılarak, hata kontrolünün rolü, gelecek nesil çok-akışlı eşler-arası isteğe bağlı video sistemlerinin tasarımında kullanılmak üzere nicel olarak ortaya konmaktadır.
Open Access
Differentiated ABR: a new architecture for flow control and service differentiation in optical burst switched networks
(IEEE, 2005) Akar, Nail; Boyraz, Hakan
In this paper, we study a new control plane protocol, called Differentiated ABR (D-ABR), for flow control and service differentiation in optical burst switched networks. Using D-ABR, we show using simulations that the optical network can be designed to work at any desired burst blocking probability by the flow control service of the proposed architecture. This architecture requires certain modifications to the existing control plane mechanisms as well as incorporation of certain scheduling mechanisms at the ingress nodes; however we do not make any specific assumptions on the data plane for the optical core nodes. Moreover, with this protocol, it is possible to almost perfectly isolate high priority and low priority traffic throughout the optical network as in the strict priority-based service differentiation in electronically switched networks.
Open Access
Discrete-time queueing model of age of information with multiple information sources
(IEEE, 2021-01-22) Akar, Nail; Doğan, Ozancan
Information freshness in IoT-based status update systems has recently been studied through the Age of Information (AoI) and Peak AoI (PAoI) performance metrics. In this article, we study a discrete-time server arising in multisource IoT systems, which accepts incoming information packets from multiple information sources so as to be forwarded to a remote monitor for status update purposes. Under the assumption of Bernoulli information packet arrivals and a common general discrete phase-type service time distribution across all the sources, we numerically obtain the exact per-source distributions of AoI and PAoI in matrix-geometric form for three different queueing disciplines: 1) nonpreemptive bufferless; 2) preemptive bufferless; and 3) nonpreemptive single buffer with replacement. The proposed numerical algorithm employs the theory of discrete-time Markov chains of quasi-birth-death type and is matrix analytical. Numerical examples are provided to validate the accuracy and effectiveness of the proposed queueing model. We also present a numerical example on the optimum choice of the Bernoulli parameters in a practical IoT system with two sources with diverse AoI requirements.
Open Access
Disk scheduling with shortest cumulative access time first algorithms
(TÜBITAK, 2017) Akar, Nail; Tunç, Ç.; Gaertner, M.; Erden, F.
A new class of scheduling algorithms is proposed for disk drive scheduling. As opposed to choosing the request with the shortest access time in conventional shortest access time first (SATF) algorithms, we choose an ordered sequence of pending I/O requests at the scheduling instant with the shortest cumulative access time. Additionally, we introduce flexibility for forthcoming requests to alter the chosen sequence. Simulation results are provided to validate the effectiveness of the proposed disk scheduler. Throughput gains of 3% and above are shown to be attainable, although this occurs at the expense of increased computational complexity.
Open Access
A distributed solution for air-time fairness in multi-rate WLANs
(IEEE, 2013) Yazıcı, Mehmet Akif; Akar, Nail
WLANs employing IEEE802.11 standards suffer from a performance anomaly that drags down the fast nodes in the WLAN due to the slow nodes. Air time fairness has been proposed to battle this anomaly. We propose a novel distributed method to achieve air time fairness in this study. © 2013 IEEE.
Open Access
Distribution of age of information in status update systems with heterogeneous information sources: an absorbing markov chain-based approach
(Institute of Electrical and Electronics Engineers, 2023-05-31) Akar, Nail; Gamgam, Ege Orkun
In this letter, we obtain the exact distributions of the Age of Information (AoI) and Peak AoI (PAoI) in a non-preemptive multi-source status update system for (i) Generate-At-Will (GAW) servers with probabilistic transmissions (ii) Random Arrival with Single Buffer (RA-SB) servers employing probabilistic buffer management, using absorbing Continuous-Time Markov Chains (CTMC). For both servers, the information sources are allowed to have different relative urgencies, phase-type service time distributions, and transmission error probabilities, for the sake of generality. Numerical examples are presented to validate the proposed analytical model.
Open Access
Dynamic capacity management for voice over packet networks
(2003-06-07) Akar, Nail; Şahin, Cem
In this paper, dynamic capacity management refers to the process of dynamically changing the capacity allocation (reservation) of a pseudo-wire established between two network end points. This process is based on certain criteria including instantaneous traffic load for the pseudo-wire, network utilization, time of day, or day of week. Frequent adjustment of the capacity yields a scalability issue in the form of a significant amount of message processing in the network elements involved in the capacity update process. On the other hand, if the capacity is adjusted once and for the worst possible traffic conditions, a significant amount of bandwidth may be wasted depending on the actual traffic load. There is then a need for dynamic capacity management that takes into account the tradeoff between scalability and bandwidth efficiency. This problem is motivated by voice over packet networks in which end-to-end reservation requests are initiated by PSTN voice calls and these reservations are aggregated into one signal reservation in the core packet network for scalability. In this paper, we introduce a Markov decision framework for an optimal reservation aggregation scheme for voice over packet networks. Moreover, for problems with large sizes, we provide a suboptimal scheme using reinforcement learning. We show a significant improvement in bandwidth efficiency in voice over packet networks using aggregate reservations. © 2003 IEEE.
Open Access
Efficient transport of time-varying IP traffic in flexi-grid optical networks
(IEEE, 2014) Tunc, Çağlar; Akar, Nail
Frequency slot width selection in flexi-grid optical networks refers to the process of online update of the slot width of the channel, according to time-varying traffic demands. Since slot width updates are associated with signaling costs, it is common to limit the rate of updates. In this article, we propose a model-free hysteresis-based slot width selection algorithm for flexi-grid optical networks. © 2014 IEEE.
Open Access
Energy management for age of information control in solar-powered IoT end devices
(Springer, 2021-07) Aydin, A. K.; Akar, Nail
In this paper, we propose several harvesting-aware energy management policies for solar-powered wireless IoT end devices that asynchronously send status updates for their surrounding environments to a network gateway device. For such devices, we aim at minimizing the average age of information (AoI) metric which has recently been investigated extensively for status update systems. The proposed energy management policies are obtained using discrete-time Markov chain-based modeling of the stochastic intra-day variations of the solar energy harvesting process in conjunction with the average reward Markov decision process formulation. With this approach, energy management policies are constructed by using the time of day and month of year information in addition to the instantaneous values of the age of information and the battery level. The effectiveness of the proposed energy management policies in terms of their capability to reduce the average AoI as well as improving upon the tail of the AoI distribution, is validated with empirical data for a wide range of system parameters.
Open Access
Exact analytical model of age of information in multi-source status update systems with per-source queueing
(IEEE, 2022-05-27) Gamgam, Ege Orkun; Akar, Nail
We study a multisource status update system with Poisson information packet arrivals and exponentially distributed service times. The server is equipped with a waiting room holding the freshest packet from each source referred to as single buffer per-source queueing (SBPSQ). The sources are assumed to be equally important, i.e., (nonweighted) average Age of Information (AoI) or average age violation probability are used as the information freshness metrics to optimize for, and subsequently, two symmetric SBPSQ-based scheduling policies are studied in this article, namely, first source first serve (FSFS) and the earliest served first serve (ESFS) policies. By employing the theory of Markov fluid queues (MFQs), an analytical model is proposed to obtain the exact distribution of the AoI for each source when the FSFS and ESFS policies are employed at the server. Additionally, a benchmark scheduling-free scheme named single buffer with replacement (SBR), which uses a single buffer to hold the freshest packet across all sources, is also studied with a similar but less complex analytical model. We comparatively study the performance of the three policies through numerical examples in terms of the average AoI and the age violation probability averaged across all sources, in a scenario of sources possessing different traffic intensities but sharing a common service time.
Open Access
Exact and approximate decoupling and noninteracting control problems
(1989) Akar, Nail
In this thesis, we consider “exact” and “approximate” versions of the disturbance decoupling problem and the noninteracting control problem for linear, time-invariant systems. In the exact versions of these problems, we obtain necessary and sufficient conditions for the existence of an internally stabilizing dynamic output feedback controller such that prespecified interactions between certain sets of inputs and certain sets of outputs are annihilated in the closed-loop system. In the approximate version of these problems we require these interactions to be quenched in the ‘Hoo sense, up to any degree of accuracy. The solvability of the noninteracting control problems are shown to be equivalent to the existence of a common solution to two linear matrix equations over a principal ideal domain. A common solution to these equations exists if and only if the equations each have a solution and a bilateral matrix equation is solvable. This yields a system theoretical interpretation for the solvability of the original noninteracting control problem.
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.
Open Access
Finding the exact distribution of (peak) age of information for queues of PH/PH/1/1 and M/PH/1/2 type
(IEEE, 2020) Akar, Nail; Doğan, Ozancan; Atay, Eray Ünsal
Bufferless and single-buffer queueing systems have recently been shown to be effective in coping with escalated Age of Information (AoI) figures arising in single-source status update systems with large buffers and FCFS scheduling. In this paper, for the single-source scenario, we propose a numerical algorithm for obtaining the exact distributions of both the AoI and the peak AoI (PAoI) in (i) the bufferless PH/PH/1/1/P(p) queue with probabilistic preemption with preemption probability p, 0 ≤ p ≤ 1, and (ii) the single buffer M/P H/1/2/R(r) queue with probabilistic replacement of the packet in the queue by the new arrival with replacement probability r, 0 ≤ r ≤ 1. The proposed exact models are based on the well-established theory of Markov Fluid Queues (MFQ) and the numerical algorithms are matrix-analytical and they rely on numerically stable and efficient vector-matrix operations. Moreover, the obtained exact distributions are in matrix exponential form, making it amenable to calculate the tail probabilities and the associated moments straightforwardly. Firstly, we validate the accuracy of the proposed method with simulations, and for sume sub-cases, with existing closed-form results. We then comparatively study the AoI performance of the queueing systems of interest under varying traffic parameters.
Open Access
Impact of scalability in video transmission in promotion-capable differentiated services networks
(IEEE, 2002-09) Gürses, E.; Akar, G. B.; Akar, Nail
Transmission of high quality video over the Internet faces many challenges including unpredictable packet loss characteristics of the current Internet and the heterogeneity of receivers in terms of their bandwidth and processing capabilities. To address these challanges, we propose an architecture in this paper that is based on the temporally scalable and error resilient video coding mode of the H.263+ codec. In this architecture, the video frames will be transported over a new generation IP network that supports differentiated services (Diffserv). We also propose a novel Two Rate Three Color Promotion-Capable Marker (trTCPCM) to be used at the edge of the diffserv network. Our simulation study demonstrates that an average of 30 dB can be achieved in case of highly congested links.