A timer-based scheme is proposed to manage information within terminal and service profiles for both incall registration/deregistration of UPT users and incall registration resets of terminal owners. In the timer-based scheme, information related to incall registration for a UPT user in a terminal profile is deleted due to a timer expiration without accessing the terminal profile. The performance of the timer-based scheme is compared with the previously proposed request-based scheme in terms of; 1) total cost and, 2) the number of terminal profile accesses per unit time for a terminal. Even though provision of the timer-based scheme requires the modification of incoming call delivery procedure, the timer-based scheme can reduce both the total cost and the number of terminal profile accesses compared to the previously proposed request-based scheme.

We propose and evaluate a single-bit adaptive step-size closed-loop power control (AS-CLPC) scheme which is adaptable to a dynamically changing radio channel. We also investigate the effect of the mobile terminal (MT) velocity on system performance when the proposed AS-CLPC scheme is employed. The proper power control constant of the AS-CLPC scheme is obtained by solving a polynomial equation. Compared with the IS-95 single-bit fixed step-size CLPC scheme, the proposed single-bit AS-CLPC scheme can reduce link margin (LM) by about 3 dB when the outage probability is below 0. 03 and a single fading path reception in the base station is assumed. System performance such as link availability and throughput can be improved by utilizing this proposed CLPC scheme in the outdoor radio propagation channel where time-selective fading occurs.

In order to find paths guaranteed by Quality of Service (QoS), the link state database (LSDB), containing QoS constraint information, and residing in routers, needs to be well managed. However, there is a trade-off between the exact reflection of the current link status and the update cost to calculate and maintain this data. In order to perfectly reflect the current link state, each router immediately notifies its neighbors whenever link state information changes. However, this may degrade the performance of the router. On the other hand, if current link state information is not updated routinely, route setup requests may be rejected because of the discrepancy between the current link state information and the previously updated link state information in the LSDB. Therefore, we need link state update (LSU) algorithms making it possible to appropriately update the LSDB. In addition, to facilitate implementation, they also should have low-complexity and must be adaptive under the variation of network conditions. In this paper, we propose an enhanced simple-adaptive (ESA) LSU algorithm, to reduce the generation of LSU messages while maintaining simplicity and adaptivity. The performance of this algorithm is compared with five existing algorithms by rigorous simulations. The comparision shows that the ESU algorithm can adapt to changes in network conditions and its performance is superior to existing LSU algorithms.

In this letter, we propose a video traffic model based on a class of stochastic processes, which we call truncated GeoY/G/∞ input processes. Group of picture (GOP) size traces are modeled by truncated GeoY/G/∞ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. With full-length MPEG-4 video traces in QCIF, we run simulations to show that our proposed model estimates packet loss ratios at various traffic loads more accurately than existing modeling methods.

In universal personal telecommunication (UPT) environments, UPT networks retain information related to incall/outcall registration in UPT user service profiles in order to provide incoming UPT calls for UPT users in any location who have registered at a terminal. As UPT networks support incall registration, terminal users can be different from terminal owners, and several UPT users can register for incoming calls on a single terminal. Therefore, appropriate third-party protection procedures are needed to protect the rights of terminal owners. A terminal profile database can be used to store information regarding terminal states and incall UPT users registered on a terminal in order to enable third-party protection procedures. In order to manage information within both the terminal profile and the service profile, we propose a request-based scheme for incall registration/deregistration of UPT users and incall registration resets of terminal owners. We evaluate the performance of the scheme in terms of; 1) total cost and, 2) the number of terminal profile accesses per unit time for a terminal.

The Ethernet passive optical network (EPON), which is one of the PON technologies for realizing FTTx (Fiber-To-The-Curb/Home/Office), is a low-cost and high-speed solution to the bottleneck problem that occurs between a backbone network and end users. The EPON is compatible with existing customer devices that are equipped with an Ethernet card. To effectively control frame transmission from optical network units (ONUs) to an optical line termination (OLT), the EPON can use a multi-point control protocol (MPCP) with control functions in addition to the media access control (MAC) protocol function. In this paper, we propose a two-phase cycle dynamic bandwidth allocation (TCDBA) algorithm to increase the channel utilization on the uplink by allowing frame transmissions during computation periods, and combine the TCDBA algorithm with the queue management schemes performed within each ONU, in order to effectively support differentiated services. Additionally, we perform simulations to validate the effectiveness of the proposed algorithm. The results show that the proposed TCDBA algorithm improves the maximum throughput, average transmission delay, and average volume of frames discarded, compared with the existing algorithms. Furthermore, the proposed TCDBA algorithm is able to support differentiated quality of services (QoS).

The most important function of a router is to perform IP lookup that determines the output ports of incoming IP packets by their destination addresses. Hence, IP lookup is one of the main issues in implementing high-speed routers. The IP lookup algorithm implemented in IQ2200 Chipset with two-level table architecture can efficiently use memory. However, it wastes processor resource for full re-construction of the forwarding tables whenever every route insertion/deletion is requested. In order to improve the utilization of processor resource, we propose an IP lookup algorithm with three-level table architecture for high-speed routers. We evaluate the performance of the proposed algorithm in terms of the memory size required for storing lookup information and the number of memory access in constructing forwarding tables. Being compared with the IQ2200 scheme, the proposed scheme can reduce the number of memory access up to 99% even though it needs about 16% more memory.

In this paper, we consider a network of N identical IEEE 802.11 DCF (Distributed Coordination Function) terminals with RTS/CTS mechanism, each of which is assumed to be saturated. For performance analysis, we propose a simple and efficient mathematical model to derive the statistical characteristics of the network such as the inter-transmission time of packets in the network and the service time (the inter-transmission time of successful packet transmissions) of the network. Numerical results and simulations are provided to validate the accuracy of our model and to study the performance of the IEEE 802.11 DCF network.

The underlaying architecture of Device-to-device (D2D) communication supports direct communication between users by reusing the radio resources of the LTE-A system. Despite the co-channel interference between the conventional cellular user equipment (CUE) and the D2D communication user equipment (DUE), LTE-A system can improve the combined data rate of CUEs and DUEs through effective transmit power control and resource allocation schemes. In this paper, we propose a novel mechanism, which combines the resource allocation scheme with the transmit power control scheme to maximize the overall data rate (defined as the sum-rate in the paper). We perform system-level simulations to determine the effectiveness of the proposed mechanism in terms of increasing the sum-rate. The simulation result shows that the proposed mechanism can improve the sum-rate in an underlaying LTE-A system that supports D2D communication.

In this letter, we propose an enhanced gentle distributed coordination function (GDCF), which is a simple and effective collision resolution mechanism, to improve the performance of IEEE 802.11 DCF. We compare performance of the enhanced GDCF with that of the legacy DCF and the conventional GDCF via analysis and simulations. The enhanced GDCF introduces a new counter to check the number of consecutively successful transmissions, and the maximum permitted values of the counter differ for different backoff stages. The proposed GDCF is shown to have performance superior to that of the conventional GDCF for various combinations of contending stations and frame length.

In the contention access period (CAP) of IEEE 802.15.4 beacon-enabled mode, collision probability increases, and network performance decreases as the number of contending devices increases. In this paper, we propose an enhanced contention access mechanism (ECAM) to reduce the collision probability in low rate -- wireless personal area networks (LR-WPANs). In ECAM, since the duration of each CAP is divided into multiple sub-CAPs, the number of devices contending for frame transmissions in each sub-CAP can be reduced by approximately one over the number of sub-CAPs. Further, this lowers the probability of collision due to two or more simultaneous frame transmissions. In addition, since ECAM shortens the channel access duration of devices, devices with ECAM have lower power consumption. To compare the performance of ECAM with that of the IEEE 802.15.4 standard, we carry out extensive simulations. The results show that ECAM yields better performance than the IEEE 802.15.4 standard, especially for dense networks with a heavy traffic load.

The blocking probabilities of n64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme to limit the number of time slots to be searched for lower rate calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities of multi-slot calls, the increased traffic handling capacity and the reduced CPU processing load, compared with those of the conventional methods.

This paper is concerned with radio resource allocation in multiple-chip-rate (MCR) DS/CDMA systems accommodating multimedia services with different information rates and quality requirements. Considering both power spectral density (PSD) over a radio frequency (RF) band and the effect of RF input filtering on the receiver in MCR-DS/CDMA systems, criteria for capacity estimation are presented and the characteristics of co-channel interference between subsystems are investigated. System performance in MCR-DS/CDMA systems is strongly affected by radio resource assignment. A minimum power-increment-based resource assignment scheme for an efficient resource assignment scheme is proposed herein. The performance of this scheme is compared with that of a random-based resource assignment scheme in terms of blocking probability and normalized throughput. The minimum power-increment-based resource assignment scheme yields a better performance than the random-based resource assignment scheme for multimedia services.