Optimisation of IrDA IrLAP link access protocol

The widespread installation of millions of Infrared Data Association (IrDA) infrared (IR) ports in mobile devices for wireless communication applications necessitates for throughput performance optimization of the IR links at the IrDA link access protocol (IrLAP) link layer. For IrDA connectivity, link-layer throughput optimization is important for any line bit-error rate (BER). The paper provides a mathematical model with which we derive a simple equation linking IrLAP throughput with physical and link-layer parameters. Simple equations for optimum values of window size and frame length for maximum link-layer throughput as a function of BER are derived. A study of the importance of parameters such as link minimum turnaround time and -timer time out period is presented. Finally, a protocol improvement that utilizes special supervisory frames (frames) to pass transmission control is proposed to deal with delays introduced by -timer expiration. Results indicate that employing the special frame highly improves throughput performance when optimum window and frame-size values are implemented

Mode dispersion and delay characteristics of optical waveguides using equivalent TL circuits

A new analysis leading to an exact and efficient algorithm is presented for calculating directly and without numerical differentiation the mode dispersion characteristics of cylindrical dielectric waveguides of arbitrary refractive-index profile. The new algorithm is based on the equivalent transmission-line (T-L) technique. From Maxwell's equations, we derive an equivalent T-L circuit for a cylindrical dielectric waveguide. Based on the TL-circuit model we derive exact analytic formulas for a recursive algorithm which allows direct calculation of mode delay and dispersion. We demonstrate this technique by calculating the fundamental mode dispersion for step, triangular, and linear chirp optical fiber refractive index profiles. The accuracy of the numerical results is also examined. The proposed algorithm computes dispersion directly from the propagation constant without the need for curve fitting and subsequent successive numerical differentiation. It is exact, rapidly convergent, and it results in savings for both storage memory and computing time

A probabilistic threshold-based bandwidth sharing policy for wireless multirate loss networks

We propose a probabilistic bandwidth sharing policy, based on the threshold (TH) policy, for a single cell of fixed capacity in a homogeneous wireless cellular network. The cell accommodates random input-traffic originated from K service-classes. We distinguish call requests to new and handover, and therefore, the cell supports 2K types of arrivals. If the number of in-service calls (new or handover) of a service-class exceeds a threshold (different for new and handover calls of a service-class), a new or handover arriving call of the same service-class is not always blocked, as it happens in the TH policy, but it is accepted in the system with a predefined state-dependent probability. The cell is analyzed as a multirate loss system, via a reversible continuous-time Markov chain, which leads to a product form solution (PFS) for the steady state distribution. Thanks to the PFS, the calculation of performance measures is accurate, but complex. To reduce the computational complexity, we determine performance measures via a convolution algorithm

Alien Registration- Boucouvalas, Politimi (Saco, York County)

https://digitalmaine.com/alien_docs/4150/thumbnail.jp

Alien Registration- Boucouvalas, Steven (Saco, York County)

https://digitalmaine.com/alien_docs/4151/thumbnail.jp

An Erlang multirate loss model supporting elastic traffic under the threshold policy

In this paper, we propose a multirate teletraffic loss model of a single link with certain bandwidth capacity that accommodates Poisson arriving calls, which can tolerate bandwidth compression (elastic traffic), under the threshold policy. When compression occurs, the service time of new and in-service calls increases. The threshold policy provides different QoS among service-classes by limiting the number of calls of a service-class up to a pre-defined threshold, which can be different for each service-class. Due to the bandwidth compression mechanism, the steady state probabilities in the proposed model do not have a product form solution. However, we approximate the model by a reversible Markov chain, and prove recursive formulas for the calculation of call blocking probabilities and link utilization. The accuracy of the proposed formulas is verified through simulation and found to be very satisfactory

Learning Throughout Life: The Information-Knowledge-Wisdom Framework

The challenge becomes one of transforming an information-rich society into a learning society. . .the question, then, of what are Iegitimate pathways to knowledge is an important one to higher education pursuits

State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus, a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation. Comparison against other models reveals the necessity of the new models and policies