The IETF Differentiated Services (DiffServ) framework achieves scalability by (1) aggregating traffic flows with coarse grain QoS on the data plane, and (2) allocating network resources with a bandwidth broker (BB) on the control plane. However, there are many issues that need to be addressed under such framework. First, it has been shown that the concatenation of strict priority (SP) scheduler of class-based queues (CBQ) can cause delay jitter unbounded under certain utilization, which is not acceptable to support the premium service (PS). Furthermore, it is not clear how such a DiffServ network can support traffic flows requiring the guaranteed service (GS), which is a desirable feature of the future Internet. This paper presents architecture and mechanisms to support multiple QoS under the DiffServ paradigm. On the data plane, we present a node architecture based on the virtual time reference system (VTRS). The key building block of our node architecture is the core-stateless virtual clock (CSVC) scheduling algorithm, which, in terms of providing delay guarantee, has the same expressive power as a stateful weighted fair queueing (WFQ) scheduler. With the CSVC scheduler as our building block, we design a node architecture that is capable of supporting integrated transport of the GS, the PS, the assured service (AS), and the traditional best effort (BE) service. On the control plane, we present a BB architecture to provide flexible resource allocation and QoS provisioning. Simulation results demonstrate that our architecture and mechanisms can provide scalable and flexible transport of integrated traffic of the GS, the PS, the AS, and the BE services.

A method is described that can allocate bandwidth to each user flow fairly in a scalable network architecture such as differentiated services architecture. As promising queueing techniques for providing differentiated services, class-based packet scheduling and selective packet discarding have been attracting attention. However, if we consider that bandwidth should be allocated to each flow in a weighted manner, the parameters used in these methods such as the weight assigned to each class queue should be pre-determined appropriately based on an assumption about the number of flows in each class. Thus, when the actual traffic pattern differs from the assumed one, they may not work well. Instead of assuming the traffic conditions, our method estimates the number of active flows in each class by simple traffic measurement and dynamically changes the weight assigned to each class queue based on the estimated number. Our method does not need to maintain the per-flow state, which gives it scalability. Simulation showed that this method is effective under various patterns of the number of active flows.

This paper introduces a switched-voltage delay cell with differential inputs. It can be used as a building block for a range of analogue functions such as voltage-to-frenquency converter, A/D converter, etc. Applications incorporating the delay cell are presented. The performances are verified by simulations on PSpice.

The present paper describes the finite difference time domain (FDTD) analysis of the light-beam diffraction from two- and three-dimensional (2-D and 3-D) magneto-optical (MO) disk structures. First, we show that the proposed new FDTD formulation is valid for MO disk medium and can avoid the divergence of fields encountered during the conventional FDTD calculations. Second, as the application of the present method to more complicated models, the main- and cross-polarized diffracted fields are numerically calculated for 2-D and 3-D four-layered MO disk models. The phase differences between two kinds of polarized components are shown. The results obtained here indicate that the proposed FDTD formulation can be applied to more complicated MO disk structures.

In this paper, we present a numerical method with guaranteed accuracy to solve initial value problems (IVPs) of normal form simultaneous first order ordinary differential equations (ODEs) which have wide domain. Our method is based on the algorithm proposed by Kashiwagi, by which we can obtain inclusions of exact values at several discrete points of the solution curve of ODEs. The method can be regarded as an extension of the Lohner's method. But the algorithm is not efficient for equations which have wide domain, because the error bounds become too wide from a practical point of view. Our purpose is to produce tight bounds even for such equations. We realize it by combining Kashiwagi's algorithm with the mean value form. We also consider the wrapping effects to obtain tighter bounds.

As a method of analyzing the wave scattering from a finite periodic surface, this paper introduces a periodic approach. The approach first considers the wave diffraction by a periodic surface that is a superposition of surface profiles generated by displacing the finite periodic surface by every integer multiple of the period . It is pointed out that the Floquet solution for such a periodic case becomes an integral representation of the scattered field from the finite periodic surface when the period goes to infinity. A mathematical relation estimating the scattering amplitude for the finite periodic surface from the diffraction amplitude for the periodic surface is proposed. From some numerical examples, it is concluded that the scattering cross section for the finite periodic surface can be well estimated from the diffraction amplitude for a sufficiently large .

Improvements of Internet technology during the last decade have shifted the technical focus from reachability to the quality of communication. There are many technical frameworks, such as Integrated Service and Differentiated Services, which have been standardized to assure the quality of communication. QoS routing is also one of such frameworks. It changes or fixes a route that IP datagrams take, and is also indispensable to put a variety of services into practice. Nevertheless, experiment reports of QoS routing on operational network are quite few, especially with dynamic SLA. Therefore, we still do not know much about the important factors for QoS-enabled network to be realized, such as users' behavior, suitable services to offer, and configuration parameters. In this paper, we carried out field-trial with pseudo QoS routing and dynamic SLA in an actual network built at the WIDE retreat in autumn 2000. In this field-trial, we provided two different types of links to attendees. Attendees chose one of the links, through which their flows go, with our dynamic SLA. We describe the details and the results of this experiment. Our results could help to understand the customers' behavior for differentiated services, and therefore be useful for designing and deploying various QoS technologies.

Negative differential conductance based on lateral interband tunnel effect is demonstrated in a planar degenerate p+-n+ diode (Esaki tunnel diode). The device is fabricated with the current silicon ultralarge scale integration (Si ULSI) process, paying attention to the processing damage so as to reduce an excess tunnel current that flows over some intermediate states in the tunnel junction. I-V characteristics at a low temperature clearly show an intrinsic electron transport, indicating phonon-assisted tunneling in Si as in the case of the previous Esaki diodes fabricated by the alloying method. In addition, a simple circuit function of bistable operation is demonstrated by connecting the planar Esaki diode with conventional Si metal-oxide-semiconductor field effect transistors (MOSFETs). The planar Esaki diode will be a promising device element in the functional library for enhancing the total system performance for the coming system-on-a-chip (SoC) era.

This paper presents a digital reaction-diffusion system (DRDS)--a model of a discrete-time discrete-space reaction-diffusion dynamical system--for designing new image processing algorithms inspired by biological pattern formation phenomena. The original idea is based on the Turing's model of pattern formation which is widely known in mathematical biology. We first show that the Turing's morphogenesis can be understood by analyzing the pattern forming property of the DRDS within the framework of multidimensional digital signal processing theory. This paper also describes the design of an adaptive DRDS for image processing tasks, such as enhancement and restoration of fingerprint images.

We analyze electron transport of silicon single-electron transistors (Si SETs) with an ultra-small quantum dot using a master-equation model taking into account the discreteness of quantum levels and the finiteness of scattering rates. In the simulated SET characteristics, aperiodic Coulomb blockade oscillations, fine structures and negative differential conductances due to the quantum mechanical effects are superimposed on the usual Coulomb blockade diagram. These features are consistent with the previously measured results. Large peak-to-valley current ratio of negative differential conductances at room temperature is predicted for Si SETs with an ultra-small dot whose size is smaller than 3 nm.

To improve the unstable performance of the traditional keyword-based search engine due to ambiguities of a natural language such as synonymy and /or polysemy, we have developed a new advanced DLSI (differential latent semantic index) space based probabilistic information retrieval system. The new method exploits a most likelihood posteriori function providing a measure of reliability in retrieving a document in the database having a closest match with another document of a query. Our simple experiment gives a supporting evidence for the validity of the theory, which is capable of capturing the intricate variability in word usage contributing to a more robust context contingent search engine.

In this paper, we present a new transmit diversity scheme with power control by using two transmit antennas in which the power control unit is added to adaptively suit the channel fading variation. Compared to the transmit diversity scheme (STD, one space time coding scheme) proposed by Alamouti and the traditional maximal ratio combining (MRC) diversity scheme employed at the receiver, simulation results indicate that the new scheme has considerable performance gain. We also discuss the effects of the imperfect channel parameter estimation on the performance of the system. Simulation results show that the new system is more robust to the estimation error of channel fading parameters than the STD. As the signal to noise ratio is relatively high, the diversity scheme with power control is more sensitive to the channel estimation error compared to the MRC. But when the channel estimation accuracy is relatively high, the diversity scheme with power control still has better performance than the ideal MRC as the BER is about 1 10-3.

We have developed a new scheme to provide Diffserv-based QoS over ATM access networks. Well-known Diffserv over ATM scheme requires some extension for conventional routers with ATM interfaces. The routers must map their Diffserv classes of services into ATM QoS classes and forward IP packets into prioritized VCs based on DSCP (DiffServ Code Point). The purpose of this work is to provide Diffserv-based QoS over ATM network using conventional IP over ATM interfaces on routers. We propose DSCP snooping at ATM edge nodes, which differentiates services over a single VC between two IP domains. A prototype circuit was used to evaluate this scheme.

Explicit formulas for the tap-coefficients of Taylor series based type III FIR digital differentiators have already been presented. However, those formulas were not derived mathematically from the Taylor series and were based on observation of different sets of the results. In this paper, we provide a mathematical proof of the formulas by deriving them mathematically from the Taylor series.

This paper describes simple and efficient (linear-preserving) reductions between the Decision Diffie-Hellman problem and related problems.

Differentiated services (Diffserv) model is one of the possible solutions for providing quality of service (QoS) on the Internet. Most existing approaches assume that the packet loss is an indication of network congestion and thus reduce the sending rates of sources. For wireless networks, the assumption is not proper since packet losses may be caused by other reasons, such as fading and interference of the signal. Therefore, these approaches do not work well in wireless networks. In this paper, we propose an approach which is able to provide service differentiation in wireless environments. In our approach, the rate share of a connection is determined by the associated weight. By keeping a proper amount of extra data in the network, the proposed approach can achieve weighted proportional fairness, which can provide selective QoS without any particular support from the network. We use the ns simulator to evaluate our approach. Simulation results show the validity of the proposed approach.

This paper proposes an optical power limiter composed of serially connected two tapered velocity couplers consisting partly of nonlinear material. The method of device designing is explained and it is exemplified that the optical output can be regulated stably to a prescribed value over a wide range of optical input. The device performance is simulated by means of FD-BPM algorithm.

In this manuscript, two key agreement protocols which are resistant to a denial-of-service attack are constructed from a key agreement protocol in [9] provably secure against passive and active attacks. The denial-of-service attack considered is the resource-exhaustion attack on a responder. By the resource-exhaustion attack, a malicious initiator executes a key agreement protocol simultaneously as many times as possible to exhaust the responder's resources and to disturb executions of it between honest initiators and the responder. The resources are the storage and the CPU. The proposed protocols are the first protocols resistant to both the storage-exhaustion attack and the CPU-exhaustion attack. The techniques used in the construction are stateless connection, weak key confirmation, and enforcement of heavy computation. The stateless connection is effective to enhancing the resistance to the storage-exhaustion attack. The weak key confirmation and the enforcement of heavy computation are effective to enhancing the resistance to the CPU-exhaustion attack.

The block cipher CAST-256 based on CAST-128 was a candidate algorithm for the AES round 1. In this paper we present a first result of a differential attack on CAST-256 reduced to 9 quad-rounds. One of the three round functions of CAST-256 has differential characteristics, for which a non-zero inputxor results in a zero outputxor, with high probability. This type of characteristic is the most useful for differential attack. We also show that CAST-256 has weak keys with respect to differential attack. Thus CAST-256 reduced to 9 quad-rounds can be attacked using 2123 chosen plaintexts in the case of differentially weak keys. The time complexity is about 2100 encryptions. Immunity to differential cryptanalysis of CAST-256 is not necessarily improved compared with CAST-128. Only 5 rounds of CAST-128 can be attacked using a similar differential characteristic.

This paper presents a new and robust technique for a coarse frequency offset estimation in OFDM system. As an evaluation of the proposed algorithm, we apply it to Eureka 147 DAB system. The proposed coarse frequency offset estimation algorithm is based on the differential detection technique between adjacent subcarriers to eliminate the phase shift effects of symbol timing offset and fractional frequency offset. Coarse frequency offset is determined from the correlation outputs between a received intercarrier differential phase reference symbol and several locally generated but frequency shifted intercarrier differential phase reference symbols. The performance of our estimation algorithm is evaluated by means of computer simulation and compared with that of previous proposed algorithms for DAB transmission modes I, II, III and IV. Simulation results show that the proposed algorithm generates extremely accurate estimates with a low complexity irrespective of the symbol timing offset.