A substrate coupling simulation method suitable for execution in a conventional CAD environment is proposed. In this method, a substrate network is extracted from the layout data, and analyses are carried out using a circuit simulator in a conventional CAD environment. Substrate model simplification techniques are adopted for efficient analysis. Test chips were fabricated in order to compare the simulated results with the measured results. The comparison confirmed the effectiveness of the proposed simulation method.

This paper presents an architecture for content internetworking, which we call CRN (Content Routing Network) architecture. The CRN architecture is different from other content internetworking architectures in many respects: the peering of authentication, authorization and accounting systems, hierarchical and policy-driven request routing, and the web-based system to interconnect distinct CDNs. Both requirements and functional architecture of CRN are presented, followed by the description of its prototypical implementation. CRN is designed to satisfy both content provider's service requirements and service provider's economic/operational requirements. A prototypical implementation has been deployed successfully under one of the biggest live-streaming experiments.

A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPR-TRSs, e.g., {f(x)f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. Bottom-up linear tree transducer, which is a well-known computation model in the tree language theory, is a special case of LT-TRS. We present a sufficient condition for an LT-TRS to be an EPR-TRS. Also reachability and joinability are shown to be decidable for LT-TRSs.

This paper presents a framework for modeling and mixed-mode simulation of circuits/interconnects and electromagnetic (EM-) radiations. The proposed framework investigates the signal integrity in VLSI chips, packages and wiring boards at the GHz-band level, and verifies the electromagnetic interference (EMI) and the electromagnetic compatibility (EMC) of high-speed systems. In our framework, the frequency characteristics of interconnects and EM-radiations are extracted by the full-wave FDTD simulation. The macromodels of interconnects are synthesized as SPICE subcircuits, and the impulse responses of EM-radiations are stored in the database. Once the macromodels are synthesized, the circuit simulation with the consideration of EM-effects can be performed by using SPICE. The EM-field distributions can be also easily calculated by taking convolutions of pre-simulated EM impulse responses and the SPICE results.

Fundamental perspective of high power devices and amplifiers for use in wireless communication systems are described in this paper. First, high power devices and device modeling techniques are presented, focusing on the emerging device technologies such as wide bandgap devices (GaN, SiC) and SiGe devices. Then the commercially available device, circuit and system simulators for wireless communication applications are introduced. Recent active load-pull measurements have made a remarkable progress in fundamental, harmonic, and envelope frequencies for high efficiency and low distortion designs. In addition, pulsed DC/RF and on wafer load-pull measurements have also become popular, which are briefly reviewed. Finally the advances in high power amplifier design techniques for achieving high efficiency and low distortion are presented.

The radiation patterns are synthesized by properly disposing surface variations on dielectric rod waveguides. The genetic algorithm (GA) is applied for searching the optimum disposition of variation sections. A very fast calculation method used in the optimization is presented. The guided waves are related in the form of a 2-port circuit and the radiation field is expressed by superposition of the waves from variation sections. Various conical beams can be synthesized. Short variation sections and combination of several variation sections with different height are used to improve the synthesis performance. The ripple of the mainlobe and the sidelobe levels become small. Spherical sector patterns with a steep fall are synthesized and the agreement with the experimental values is confirmed.

This paper describes a three-port power divider with compensation networks for non-ideal isolation resistor. The compensation networks consist of two pairs of transmission lines and cancel out the parasitic reactance of the non-ideal isolation resistor. The design equations to provide perfect return loss and isolation at a center frequency are presented. The availability of the proposed power divider has been verified by the comparison between calculated and experimental results in the Ku-band.

A parallel current-mode multilevel identifying circuit for flash memories is proposed. The sensing scheme based on the CMOS cross-coupled structure modified from the clamped bit-line sense amplifier achieves high speed and low power dissipation. The offset of the proposed sense amplifier due to mismatch is also reduced significantly. The circuit has been fabricated using 0.6 µm CMOS technology. The simulation and measurement indicate the sensing speed reaches 1 ns at 3 V supply voltage with average power consumption about 2 mW at 50 MHz.

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.

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 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.

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 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.

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.

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.

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.

In this paper, efficient algorithms for content-based video retrieval using motion information are proposed. We describe algorithms for temporal scale invariant retrieval using Distance transformation and temporal scale absolute retrieval using Motion Retrieval Code. The effectiveness of the proposed algorithms has been verified by experimental results.

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.

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.

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.