mPERSONA: Personalized Portals for the Wireless User: An Agent Approach

The needs of the wireless and mobile user regarding information access and services are quite different than those of the desktop user. This need is not about browsing the Web but about receiving personalized services that are highly sensitive to the immediate environment and requirements of the user. Personalization appears to be the most appropriate solution to this need. It comes into aid by creating personalized portals that are specific for the wireless user, which (a) are focus on the local content and (b) directly tones down factors that break up the functionally of the Internet/wireless services when viewed through wireless devices; factors like the click count, user response time (the choice factor) and the size of the wireless network traffic. In this paper we present a flexible personalization system for the wireless user that takes into consideration user mobility, the local environment and the user and device profile. The system utilizes the various characteristics of mobile agents to support flexibility, scalability, modularity and user mobility. We present metrics appropriate to the wireless environment, and an initial performance evaluation indicating improvement ranging from 33% up to, for certain metrics, 60%.     

Cell multiplexing in ATM networks

Formulates, analyzes, and compares several connection multiplexing algorithms for a multiplexer residing in the equivalent terminal of the asynchronous transfer mode (ATM) layer at the user premise. The primary goal is to find an algorithm that efficiently combats the cell delay variation (CDV) introduced by the multiplexer. Several performance criteria are examined, one of which is unique to ATM networks. This one is the proportion of arriving cells that do not conform to the traffic contract of the connection. The conformance is being tracked by a generic cell rate algorithm (GCRA) recommended (but not mandatory) by CCITT. Other criteria are the classical buffer requirements and the cell delay. Service fairness among connections is also evaluated with respect to each performance criterion. The impact of the following five multiplexing policies on the performance criteria are evaluated for constant bit rate (CBR) traffic sources. The policies are first in, first out (FIFO), round robin (RR), least time to reach bound (LTRB), most behind expected arrival (MBEA), and golden ratio (GR). Extensive numerical examples reveal that there is no single policy that is best across all criteria. With respect to cell conformance, most behind expected arrival (MBEA) emerges as the preferred one. FIFO is best with respect to cell delay, except for high utilizations where RR dominates. The LTRB is marginally better than all other policies with respect to buffer requirements     

DESIGN AND EVALUATION OF GCRA SHAPER AND ENFORCER ARCHITECTURE IN ATM NETWORKS

The leaky bucket scheme has been widely treated as a traffic control mechanism. The corresponding multi-connection shaper, which intends to make the passing traffic comply with the declared parameters in the enforcer, has also been implemented. However, we must point out that the regulated cells may be invalid at the corresponding enforcer, even if the CDV between the shaper and enforcer is neglected. In order to cope with this problem, two enforcing methods, say ALP_LB and GCRA, are tried and evaluated. We modify the GCRA algorithm, which was suggested by ITU-T recommendation I.371 and even extended by ATM Forum ’93, to be suitable for shaping. The shaper and enforcer architecture which is suitable for both ALP_LB and GCRA methods is proposed. Simulation results verify the shaping and UPC functions of GCRA. They also reveal that the GCRA shaper would not introduce long delay and queue length. The proposed shaper architecture does have some merits compared with others. Such a shaper is also suitable for regulating traffic for NPC (network parameter control) at the NNI (network node interface).     

Performance evaluation of optimum combining and maximal ratio combining in the presence of co‐channel interference and channel correlation for wireless communication systems

Antenna diversity is an important technique to combat fading and reduce cochannel interference (CCI). In this paper, we present an analytical approach to derive bit error rate (BER) for Optimum Combining (OC) and Maximal Ratio Combining (MRC) in the presence of CCI. The paper has two parts. In the first part, the analysis of BER for OC with two cochannel interferers and MRC with an arbitrary number of interferers is presented for Marray antenna systems under the assumption that the channels of users are independent of each other. In the second part, the analysis of BER for OC and MRC in the presence of one dominant cochannel interferer is presented for dual antenna systems by assuming that the channels of the desired user or cochannel interferer are correlated. For DPSK signal, an exact BER expression is derived. The work presented here also yields an upper bound for BPSK or QAM signal based on the results of Foschini and Salz (1983).     

The significance of finite buffer edge effects in histogram measurements of queues

The empirically oberved fractal or self-similar nature of packet traffic implies heavy tailed queue processes for such traffic. However, based on our simulation analysis using real network data as well as standard models, we have found that the actual losses sustained are remarkably lower than those suggested by the heavy tail distribution. This can be explained by an effect observed in the tail of the histogram of a finite buffer queue process, which we call tail-raising, which contains information pertinent to performance estimation. This effect is also responsible for a significant reduction in packet losses for finite buffer systems, than would be otherwise predicted by the buffer overflow probability for heavy-tailed queues. We define a new parameter X _B on the histogram of a queue process for a finite buffer system, to calculate the tail of the queue process based on the information available in the histogram on the finite buffer. We propose an estimator that approximates X _B , namely, X _min, which is measurable because of the tail-raising effect and has a robust measurement method. The proposed estimator shows promise as a good predictor for performance metrics of queueing systems. We propose an innovative packet loss ratio estimation technique which uses histogram measurements combined with a virtual buffer scheme to find and extrapolate the objective packet loss rate using a binning strategy for histogram measurement, namely, Symmetric Logarithmic Binning (SLB).     

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through proper selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.     

A hybrid analysis/simulation for ATM performance with application to quality-of-service of CBR traffic

A discrete time queueing model for the performance of an ATM system is analyzed using matrix analytic methods. Time is segmented into slots with each slot equal to the transmission time of one ATM cell. The ATM system is modeled as a single server queue with Markovian arrivals and service time equal to one slot. The arrival process includes as a special case the superposition of on-off sources, possibly heterogeneous. The queueing model is of the M/G/1 type. By exploiting the structure of the M/G/1 type Markov chain, the complexity of the solution to the problem is reduced to only the inversion of a 2×2 matrix irrespective of the size of the Markov chain. This simplification allows us to investigate Constant Bit Rate (CBR) traffic performance (or quality-of-service) issues through a hybrid analysis/simulation approach. Specifically, we analyze the impact of on-off background traffic on the probability of consecutive cell losses, cell delay variation, and traffic shaper or playback buffer underflow and overflow probabilities of CBR traffic sources.     

Bandwidth allocation and connection admission control in ATMnetworks

Asynchronous transfer mode (ATM) is the transmission format for almost all future communication networks, including broadband integrated services digital networks (B-ISDN). The key feature of ATM is its high flexibility in bandwidth allocation. Instead of reserving capacity for each connection, the bandwidth is allocated on demand. As a consequence, packets (called cells in ATM terminology) might be lost. To guarantee a given quality of service (QoS), some kind of control is needed to decide whether to accept or to reject an incoming connection. A connection is accepted only if the network has sufficient resources to achieve the QoS required by the user without affecting the QoS of the existing connections. In ATM networks, connection admission control (CAC) is responsible for this decision. It is a very complex function because the traffic may vary greatly and have poorly known characteristics. This paper describes CAC procedures proposed in the literature and discusses issues related to bandwidth allocation in ATM networks. It shows that CAC and statistical multiplexing are only needed for certain connections     

ATM网络中CBR业务排队性能分析

分析了ATM网络中CBR业务排队性能,给出了一种简单的计算信元丢失率和信元平均时延的表达式.分析结果表明,一方面在较小的缓冲区容量下,即使CBR业务被分配的带宽大于等于其峰值速率,也还存在着较大的信元丢失;另一方面,当复用的CBR业务源数目很大时,只需要分配相对较小的缓冲区容量就可以满足十分低的信元丢失率要求.该结果对于ATM设备中相应的缓冲区设计、带宽分配以及连接允许控制机制的研究具有重要的意义.     

Features of a Scan and Clock Resource chip for providing access to board-level test functions

The architecture and some of the specific features of a Scan and Clock Resource (SCR) chip are described. This chip is currently being used in a high-end workstation product to provide access to the testability features of the individual chips and/or printed circuit boards. Using a board-level controller to gain access to the testability features of system components and interfacing the controller to a diagnostics processor (or external tester) is emerging as a common strategy for designing testable digital systems. Based upon experience gained from such an application, controller features that are deemed useful are discussed.This paper is an enhanced version of the author's earlier paper titled Towards a Standard Approach for Controlling Board-Level Test Functions, presented at the IEEE International Test Conference, ITC'90, Washington D.C., September 1990.     

A pattern classification proposal for object‐oriented audio coding in MPEG‐4

The future MPEG4 standard will adopt an objectoriented encoding strategy whereby an audio source is encoded at a very low bitrate by adapting a suitable coding scheme to the local characteristics of the signal. One of the most delicate issues in this approach is that the overall performance of the audio encoder greatly depends on the accuracy with which the input signal is classified. This paper shows that the difficult problem of audio classification for objectoriented coding can be effectively solved by selecting a salient set of acoustic parameters and adopting a fuzzy model for each audio object, obtained by a soft computinghybrid learning tool. The audio classifier proposed operates at two levels: recognition of the class to which the input signal belongs (talkspurt, music, noise, signaling tones) and then recognition of the subclass to which it belongs. The results obtained show that fuzzy logic is a valid alternative to the matching techniques of a traditional pattern recognition approach.     

A hybrid handover protocol for local area wireless ATM networks

While handovers of voice calls in a wide area mobile environment are well understood, handovers of multi-media traffic in a local area mobile environment is still in its early stage of investigation. Unlike the public wireless networks, handovers for multi-media Wireless LANs (WLANs) have special requirements. In this paper, the problems and challenges faced in a multi-media WLAN environment are outlined and a multi-tier wireless cell clustering architecture is introduced. Design issues for multi-media handovers are specified and a fast, continuous and efficient hybrid handover protocol is proposed. The protocol is scalable and supports source and destination mobile handovers in a mutually exclusive manner. Crossover switch (CX) discovery is also introduced to support fast inter-cluster handovers with consideration given to Mobile Quality of Service (M-QoS). The resulting wireless ATM LAN exhibits a distributed mobile location management, call admission control and handover management architecture. A prototype of the proposed handover protocol is implemented into a Cambridge Fairisle ATM switch and the results of handovers for a single Mobile Host (MH) with a single on-going connection are evaluated. It was found that implementing transport mobility for a wireless ATM environment is not practical as the cell re-routing function changes the traffic characteristics and is not scalable to increasing cell rate and to the number of mobile connections. The data-link layer mobility implementation however, is found to work well. The protocol provides symmetric data disruption to traffic flows in both directions and up to seventy-five intra-cluster handovers can be supported in a second. Throughout the experiment, cells arrive in sequence with no cell loss observed during the handover, up to the capacity limit of the ATM switch. Finally, zig-zag handovers and handovers for a single MH with multiple on-going unicast connections are performed in order to evaluate the robustness and performance of the protocol under different MHs' migration and communication environment.Parts of this paper appeared in the ACM First International Conference on Mobile Computing and Networking (MOBICOM'95), Berkeley, California, November 1995 as The Design & Implementation of A Hybrid Handover Protocol For Multi-Media Wireless LANs.C-K Toh is supported by a King's College Cambridge External Research Studentship and a Cambridge Commonwealth Trust Scholarship.     

Mobile ATM buffer capacity analysis

This paper extends a stochastic theory for buffer fill distribution for multiple on and off sources to a mobile environment. Queue fill distribution is described by a set of differential equations assuming sources alternate asynchronously between exponentially distributed periods in on and off states. This paper includes the probabilities that mobile sources have links to a given queue. The sources represent mobile user nodes, and the queue represents the capacity of a switch. This paper presents a method of analysis which uses mobile parameters such as speed, call rates per unit area, cell area, and call duration and determines queue fill distribution at the ATM cell level. The analytic results are compared with simulation results.This paper is partially funded by ARPA contract number J-FBI-94-223.The Mathematica code for this paper can be found on http://www.tisl.ukans.edu/sbush.     

A Robust Analytical Model of Mobile IP Handoff with Multiple Traffic Profiles

Mobile IP has been developed to provide the continuous information network access to mobile users. The performance of Mobile IP mobility management scheme is dependent on traffic characteristics and user mobility. Consequently, it is important to assess this performance in-depth through these factors. This paper introduces a novel analytical model of handoff management in mobile IP networks. The proposed model focuses on the effect the traffic types and their frame error rates on the handoff latency. It is derived based on general distribution of both successful transmission attempts and the residence time to be applicable in all cases of traffic characteristics and user mobility. The impact of the behavior of wireless connection, cell residence time, probability distribution of transmission time and the handoff time is investigated. Numerical results are obtained and presented for both TCP and UDP traffics. As expected, the reliability of TCP leads to higher handoff latency than UDP traffic. It is shown that, higher values of FER increase the probability of erroneous packet transfer across the link layer. A short retransmission time leads to end the connection most likely in the existing FA; however a long retransmission time leads to a large delivery time. The proposed model is robust in the sense that it covers the impact of all the effective parameters and can be easily extended to any distribution.     

Integrated Routing Algorithms for Provisioning “Sub-Wavelength” Connections in IP-Over-WDM Networks

This work focuses on developing and implementing comprehensive unified constraint-based routing algorithms within the generalized multi-protocol label switching framework (GMPLS) to provision sub-wavelength circuits (low-rate traffic streams). Constraint-based routing is further augmented in this work by dynamically routing both an active and another alternate link/node-disjoint backup path at the same time in order to provision a given connection request. This new integrated approach combines both IP routing and optical resource allocation to setup end-to-end connections.     

Optical-LSP Establishment and a QoS Maintenance Scheme Based on Differentiated Optical QoS Classes in OVPNs

A virtual private network (VPN) over Internet has the benefit of being cost-effective and flexible. However, it has difficulties providing sufficient QoS and adequate transmission capacity for high bandwidth services. Given the increasing demand for high bandwidth Internet and the demand for QoS assurances in a VPN over Internet, IP/generalized multi-protocol label switching (GMPLS) based on a control plane combined with a high-bandwidth, dense-wavelength division multiplexing (DWDM) optical network is seen as a very favorable approach for realizing the future optical VPN (OVPN) over IP/GMPLS over DWDM. Within this architecture, providing QoS guaranteed multimedia services with a differentiated QoS guaranteed protocol framework with QoS recovery is one of the key issues to implement. Therefore, we suggest in this paper optical-label switched path (O-LSP) establishment and its QoS maintenance scheme based on differentiated optical QoS-service (DOQoS) classes. They are the key components for this DOQoS framework in assuring end-to-end QoS in an OVPN over IP/GMPLS over DWDM architecture.     

Modeling and accomplishing the BEREC network neutrality policy

Network neutrality (NN) is a principle of equal treatment of data in network infrastructures with fairness and universality being the primary outcomes of the NN management practice. For networks, the accomplishment of NN management practice is essential to deal with heterogeneous user requirements and the ever-increasing data traffic. Current tools and methods address the NN problem by detecting network neutrality violations and detecting traffic differentiation. This paper proposes the NN-PCM (Network Neutrality Policy Conformance Module) that deploys the BEREC network neutrality policy using a bandwidth allocation model (BAM). The NN-PCM new approach allocates bandwidth to network users and accomplishes the BEREC NN policy concomitantly. Network neutrality is achieved by grouping users with similar traffic requirements in classes and leveraging the bandwidth allocation model's characteristics. The conceptual analysis and simulation results indicate that NN-PCM allocates bandwidth to users and accomplishes BEREC network neutrality conformance by design with transparent, nondiscriminatory, exceptional, and proportional management practices.     

Improved Approaches for Cost-Effective Traffic Grooming in WDM Ring Networks: Uniform-Traffic Case*

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of two new traffic-grooming approaches for WDM ring networks, called single-hop and multihop. Our single-hop implementation uses the simulated-annealing heuristic. After placing all the traffic on virtual circles, we group the circles in order to reduce the number of ADMs in the network. Our multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix; then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the hub node which has an ADM for each wavelength. The hub node, therefore, can bridge traffic between all of the wavelengths. Each algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach based on simulated annealing for a small grooming ratio, but for a large grooming ratio and node number, we advocate the use of the multihop approach.     

Performance comparison of battery power consumption in wireless multiple access protocols

Energy efficiency is an important issue in mobile wireless networks since the battery life of mobile terminals is limited. Conservation of battery power has been addressed using many techniques such as variable speed CPUs, flash memory, disk spindowns, and so on. We believe that energy conservation should be an important factor in the design of networking protocols for mobile wireless networks. In particular, this paper addresses energy efficiency in medium access control (MAC) protocols for wireless networks. The paper develops a framework to study the energy consumption of a MAC protocol from the transceiver usage perspective. This framework is then applied to compare the performance of a set of protocols that includes IEEE 802.11, ECMAC, PRMA, MDRTDMA, and DQRUMA*. The performance metrics considered are transmitter and receiver usage times for packet transmission and reception. The time estimates are then combined with power ratings for a Proxim RangeLAN2 radio card to obtain an estimate of the energy consumed for MAC related activities. The analysis here shows that protocols that aim to reduce the number of contentions perform better from an energy consumption perspective. The receiver usage time, however, tends to be higher for protocols that require the mobile to sense the medium before attempting transmission. The paper also provides a set of principles that could be applied when designing access protocols for wireless networks.*ECMAC: energyconserving MAC. PRMA: packet reservation multiple access. MDRTDMA: multiservices dynamic reservation TDMA. DQRUMA: distributedqueuing request update multiple access.     

N-order direct form digital filters with integer arithmetic

For direct form digital filters with integer arithmetic, a characterization of the initial condition vector and state vectorX(), for a fixed, > 1, is established without the intermediate state vectors. This is used to determine initial conditions for stability and initial conditions for convergence to a limit cycle. Also, several properties of limit cycles are proven.