Evolutionary learning methods have been applied to a variety of different problems. In this paper, a new algorithm for active queue management based on an evolutionary learning model is proposed. This novel algorithm generates packet marks for the purpose of improving robustness and responsiveness of congestion control in the Internet routers, while maintaining a reasonable degree of queueing performance such as utilization, delay, and packet drops due to buffer overflow. Simulation results demonstrate the effectiveness of the proposed algorithm and compare the performance of various algorithms.

The characteristics of 155 Mbps optical propagation through atmosphere at the wavelengths of 0.78 and 1.55 m over a 72 m range were measured. Two propagation characteristics were compared to examine the wavelength dependence on the rain rate and the aperture size of a receiver. An enhanced intensity exceeding the signal level measured in the absence of rain was observed at both wavelengths during 7.2 mm/h rain. The resultant bit error rate is shown to be dominated mainly by the rain-induced scintillation rather than the attenuation.

An improved movement-based registration scheme reduces location update cost on conventional movement-based location update scheme but increases uncertainty of the position of a mobile terminal (MT). The effect of this uncertainty of the MT position on the paging cost of the improved movement-based registration scheme is analyzed. We show that the paging cost of the improved movement-based registration scheme in [2] is underestimated, especially for large values of movement threshold. The result shows that the underestimation cannot be ignored.

A large part of our daily lives is spent surrounded by buildings and other structures. In this paper, we used an infinitelength, multilayered cylindrical model to rigorously analyze the microwave specific absorption rate (SAR) of a human standing near a 90corner wall. At frequencies above 1 GHz, the interactions between the microwaves, the human body (including layer resonance), and the corner cause complex changes in the average SAR. We have shown numerically that the SAR with a corner present is up to four times larger than when there is no corner, and that the average SAR of TE waves at frequencies below 1 GHz is up to 10 times greater than when there is no corner.

In this paper, a new narrowband beamformer with derivative constraint is developed for wideband and coherent jammers suppression. The so-called IQML algorithm with linear constraint, which is used to estimate the unknown directions of the jammers in signal-free environment, is shown to be an inappropriate constraint estimator. In this paper, a new IQML algorithm with a norm constraint is considered, which is a consistent estimator and can be used to achieve desired performance. It can be also employed in the CDMA system for MAI suppression. We show that it outperforms the approach with the linear constraint used in the narrowband beamformer, in terms of directional pattern, output SINR and nulling capability for wideband and coherent jammers suppression.

This paper describes an analytical method to estimate the amount of interference in multibeam non-geostationary satellite systems. The performance of CDMA is compared with that of FDMA (or TDMA) by employing the maximum acceptable number of users per cell in uplink as a measure. Numerical examples shows that the maximum acceptable number of users in FDMA (or TDMA) systems varies according to the altitude of the satellites, while the performance is insensitive to the altitude in CDMA systems. Then, it is found that the superior multiple access scheme depends on the altitude of the satellite.

In wireless access system, we need to use a limited frequency and electric power efficiently. And so we propose the fixed wireless access network using 5 GHz frequency which band has a good propagation performance in line of sight (LOS). In the proposed network, the several multi-level modulation methods are combined and identical frequency is reused by considering on the antenna directivity. As constructing this network, we can efficiently use frequency in 5 GHz band and enlarge system capacity. In this paper, it is assumed that user terminals are distributed nonuniformly over the service area. We analyze accommodation number of user terminals and the optimum combination of modulation methods. Numerical results show that most effective method is the combination of 16QAM and 256QAM, which can accommodate up to about 1.4 times as many users as only QPSK modulation method.

In DS-CDMA mobile radio communications systems, transmit power control (TPC) is indispensable to regulate the variations in the received signal power produced by multipath fading. However, a practical TPC raises and lowers the mobile transmit power only at discrete time instants (the TPC rate is on the order of 1-2 kHz) and by a finite step size of the order of 1 dB. Therefore, TPC cannot completely compensate the received signal power variations and hence, the transmission performance degrades in a fast fading channel. The objective of this paper is to understand how TPC acts in a fast fading channel with antenna diversity reception and, based on this understanding, to model the TPC operation.

The potential role of a network in improving end-to-end TCP control is considered. Communications in the high-speed network age are revealing the limitations of end-to-end TCP control. Especially, fairness among TCP connections is one such example. Solving these problems requires not only end-to-end control but also active network control. A brief overview of related work is given, followed by the proposal of a method for adjusting the Ack interval based on network information. The principle of our algorithm is based on the relationship between TCP transmission rate at TCP sources and Ack packets intervals from the bottleneck router. Our algorithm implicitly controls transmission rate of TCP sources. Special focus is given to a scenario in which a networks has a bottleneck at a router. Simulation based on the proposed interworking algorithm, called AckAdjust, showed a good end-to-end TCP performance as to fairness between multiple TCP connections in various cases.

In the Internet, flow analysis and network monitoring have been studied by various methods. Some methods try to make TCP (Transport Control Protocol) traces more readable by showing them graphically. Others such as MRTG, NetScope, and NetFlow read the traffic counters of the routers and record the data for traffic engineering. Even if all of the above methods are useful, they are made only to perform a single task. This paper describes an improved TCP Protocol Machine, a multipurpose tool that can be used for flow analysis, intrusion detection and link congestion monitoring. It is developed based on a finite state machine (automaton). The machine separates the flows into two main groups. If a flow can be mapped to a set of input symbols of the automaton, it is valid, otherwise it is invalid. It can be observed that intruders' attacks are easily detected by the use of the protocol machine. Also link congestion can be monitored, by measuring the percentage of valid flows to the total number of flows. We demonstrate the capability of this tool through measurement and working examples.

To support video streaming over the current Internet, a media server usually needs to perform adaptive streaming in combination with congestion control. While existing streaming schemes are mainly designed for particular congestion algorithms and rate shaping techniques, this paper proposes a general buffer-driven adaptive streaming scheme based on control theory. Our scheme can be applied in combination with different congestion control algorithms and different rate shaping (and source coding) techniques. It is also amenable to analysis and easy to implement. Analytical and simulation results show that the proposed scheme gives satisfactory video quality under various Internet conditions while fully utilizing the available network bandwidth.

Unicasting video streams over TCP connections is a challenging problem, because video sources cannot normally adapt to delay and throughput variations of TCP connections. This paper describes a method of extending TCP so that TCP connections can effectively carry hierarchically-encoded layered video streams, while being friendly to other competing connections. We call the method Receiver-based Delay Control (RDC). Under RDC, a TCP connection can slow down its transmission rate to avoid congestion by delaying ACK packet generation at the TCP receiver based on congestion notifications from routers. We present the principle behind RDC, argue that it is TCP-friendly, describe an implementation that uses 1-bit congestion notification from routers, and demonstrate by simulations its effectiveness in streaming hierarchically-encoded layered video.

Many services on the Internet are provided by multiple identical servers in order to improve performance and robustness. The number, the location and the distribution of servers affect the performance and reliability of a service. The server placement is, however, often determined based on the empirical knowledge of the administrators. This paper investigates issues of the server placement in terms of the service performance and the server load. We identify that a server selection mechanism plays an important role in server placement, and thus, evaluate different server selection algorithms. The result shows that it is essential to the robustness of a service to employ a mechanism which distributes service requests to the servers according to the measured response time of each server. As a case study, we evaluate the server selection mechanisms employed by different DNS (Domain Name System) implementations. Then, we show the effects of the different server selection algorithms using root-server measurements taken at different locations around the world.

One purpose of Quality-of-Service (QoS) routing is to develop polynomial-time heuristic algorithms to tackle the MCP (multi-constrained-path) problem, which is NP-complete. In this paper, we introduce a new QoS routing heuristic framework, which focuses on how to increase the success ratio for finding a feasible path subject to multiple additive constraints. The key issue of this framework is to transform the single source single destination QoS routing problem to a single source multi-destination problem by expanding the destination vertex to its neighboring vertices. After that, the modified problem can be solved by existing source routing heuristic algorithms. The analysis and simulation results demonstrate that the framework can achieve a higher success ratio of finding a feasible path without increasing the computational complexity by setting the expansion operation properly.

Although TCP is widely used in the Internet, new specifications are still proposed and implemented. In the circumstance above, it is highly possible that some errors are detected on the communication between new and old implementations. Several test tools were developed so far. However, they do not have enough functions to allow test operators to modify test sequences suitable for their test purposes. We have developed a TCP tester which generates test sequence using test scenario. The tester performs exceptional TCP protocol behavior only when the condition specified in the test scenario is satisfied. Otherwise, it performs normal TCP behavior. The tester is implemented by modifying TCP module of NetBSD with SACK code developed by Pittsburgh Supercomputing Center. We have also evaluated implementations of congestion control and SACK algorithms using the tester.

In this paper, we describe the development and the analysis of the Label Distribution Protocol (LDP) for Multiprotocol Label Switching System. We review the implementation issues that are required to construct the LDP for a gigabit switched router and propose a detailed design of the LDP. We present the detailed design using the Deviation Tree of the protocol state machine and a formal specification of the state machine using the process algebra. These specifications are based on the IETF standard. By analyzing the protocol behaviors of the Deviation Trees and the formal specification, we prove the interoperability, completeness, liveness, reachability, and the safety of the implemented LDP. We expect that the reliability would be improved using these analyses. With these proofs we expect the implemented LDP will be interoperable with other commercialized products. As a result we validate the protocol behaviors of the implemented LDP.

In recent years, requests for new advanced features, decentralization, and improvements in the forwarding speed, have been made for IX. A new IX architecture using MPLS (Multiple Label Switching) technology (MPLS-IX) is proposed to solve these requirements and rectify the problems. In this paper, a comparison between current IX and MPLS-IX based on router's packet forwarding performance is examined, and the feasibility of MPLS-IX is discussed. Moreover, the QoS requirements to provide IX service are discussed.

As the Internet role changes from the experimental environment to the social infrastructure, end-to-end quality for data transfer of various types of traffic has been required as well as its connectivity. So we should precisely measure some performance such as packet loss probability and delay at routers on some source-destination path. By using so-called passive measurement technique, we can get the queue length distribution from some routers individually and estimate the end-to-end transmission delay. However, there may be some correlation between queue lengths of two or more routers packets go through in sequence, which would lead to inaccurate estimation of end-to-end delay performance. Thus in this paper, we model two tandem routers as queueing system, and analyze the queue length distributions and their correlation. Through some numerical results, we will investigate the impact of traffic parameters on the degree of correlation and how it affects the estimation of delay performance.

In this paper, we investigate the performance of Mobile IP regional registration and compare it with that of Mobile IP. The performance measures used are registration delay and the CPU processing overheads loaded on the agents to handle mobility of mobile nodes. Through the investigation, the effectiveness of adopting Mobile IP regional registration in the wide-area wireless network in terms of reducing the CPU processing overheads on the home agent and lowering the signaling delay is observed. We also compare the scalability of Mobile IP regional registration schemes when two and three levels of foreign agent hierarchy are considered. Based on the comparison, we propose a network design strategy for achieving optimized performance and cost.

This letter presents the implementation framework of a video streaming server which uses an optical disk library as a source of media archiving. In order to handle the optical storage subsystem in the framework of disk-based stream service model, we have devised an effective stream scheduling, disk caching, and admission control mechanism. The proposed system has been implemented and its key principles are validated with real experiments.