We have designed a scalable and expressive naming system called SENS, capable of retrieving information of computing and content resources distributed widely across the Internet through exact queries and multi-attribute range queries over resource names. Our system utilizes a descriptive naming scheme to name resources and a multi-dimensional resource ID space for message routing through an overlay network of name servers (NSs). The resource ID space is constructed on the overlay network based on CAN routing algorithm. Our novel mapping scheme between resource names and resource IDs preserves resource ID locality while still achieving good load balancing regarding resource information distribution. We also propose a multicast routing algorithm to deliver resource information and a broadcast routing algorithm to route query messages to corresponding NSs with small cost of message transmission. Our simulation results show that our system can achieve good routing performance and load balancing.

A test structure to analyze asymmetry and orientation dependence of MOSFETs is presented. n-MOSFETs with 8 different channel orientation and three kinds of process conditions were measured and symmetry characteristics of IDsat and IBmax with respect to the interchange of source and drain was examined. Although both IDsat and IBmax have similar channel orientation dependence, IBmax in interchanged S/D measurements shows asymmetrical characteristics, which can be applied to a sensitive method for device asymmetry detection.

Hot-carrier degradation of voltage controlled oscillator (VCO) was investigated by a reliability simulator known as BERT. The appropriate monitor of VCO frequency degradation shifts from the saturated drain current of an N MOSFET to linear drain current with an increase in VCO input voltage. The degradation of the VCO drastically increases with a small reduction in initial oscillation frequency. These results imply the need for an appropriate reliability margin around the standard operating point as well as a performance margin, which cannot be achieved by using conventional drain current monitors.

Periodic reservation allows periodic and random packets to share the same satellite random access channel efficiently. The periodic reservation protocol is particularly suitable for mobile satellite position reporting services, where some of the information messages, such as dispatch function, are classified as "periodic" and others, such as signaling, are classified as "random." When a new mobile terminal logs on to the system, Network Management Center (NMC) reserves subsequent time slots for transmitting periodic packets without contention. A mobile terminal recognizes each time slot as "reserved" or "unreserved (available)" according to the broadcast message received from NMC. Other random packets use the slotted ALOHA protocol to contend with other mobile terminals for an unreserved time slot. The performance results suggest that the use of the periodic reservation protocol can be regarded as a viable solution for mobile satellite position reporting services such as automatic dependent surveillance (ADS).

This paper presents severl radio resource scheduling algorithms which aim to provide best-effort service for non-real-time unit-oriented, or message traffic. The objective of resource scheduling algorithm is to distribute radio resources between competing message traffic sources while attaining throughput as high and fair as possible for each source without any explicit quality-of-service (QoS) guarantee. Computer simulations are carried out to evaluate the performance in terms of the average of allocation plus transfer delay, the average of throughput, the variance of throughput, and the usage of resources. The message-size distributions of homepages in World-Wide-Web and e-mails obtained by actual measurement are used. Message size-based resource scheduling algorithms are found to provide high and fair throughput as well as efficient use of the resources.

Frequency delta sigma modulation (FDSM) is a unique analog to digital conversion technique featuring large dynamic range with wide frequency band width. It can be used for high performance digital-output sensors, if the oscillator in the FDSM is replaced by a variable frequency oscillator whose frequency depends on a certain external physical quantity. One of the most important parameters governing the performance of these sensors is a phase noise of the oscillator. The phase noise is an essential error source in the FDSM, and it is quite important for this type of sensors because they use a high frequency oscillator and an extremely large oversampling ratio. In this paper, we will discuss the quantitative effects of the phase noise on the FDSM output on the basis of a simple model. The model was validated with experiments for three types of oscillators.

An important issue in the realization of optical packet-switched (OPS) networks is the resolution of packet contention caused by the lack of RAM-like optical buffering. Although an optical buffer using fiber delay lines (FDLs) has been proposed, its capacity is extremely limited. There have been several studies of this problem. One approach is deflection routing, which is widely used in electronic packet-switched networks or optical burst-switched (OBS) networks. However, in OPS networks, packet lengths are short, so that the speed requirement for route lookup is very stringent. If the network topology is geometric, such as a Manhattan Street Network (MSN), hop-by-hop routing can be implemented by simple optical logic devices without an electronic routing table. However, if the topology is not geometric, it is hard to implement deflection routing electronically or optically. Another approach is reflection routing, which is easy to implement but has a higher probability of packet loss than does deflection routing. In this paper, we propose a packet contention resolution scheme, reflection-based deflection routing, which is based on reflection routing and enables switching the reflected packet to an alternate path if its primary path remains congested. Our method alleviates the time limitation on setting an alternate path by making use of the packet reflection latency and also reduces the probability of packet loss. We evaluate the performance of the proposed method by simulation experiments and show its effectiveness.

We present a 64-b adder having a 2.6-ns delay time at 3.3 V power supply within 0.27 mm2 using 0.5-µm CMOS technology. We derived our adder design from architectural level considerations. The considerations include not only the gate intrinsic delay but also the wiring delay and the gate capacitance delay. As a result, a 64-b adder, (56-b Carry Look-ahead Adder(CLA) +8-b Carry Select Adder (CSA)), was designed. In this design, a new carry select scheme called Modified Carry Select (MCS) is also proposed.

In this letter, we investigated in detail the basic characteristics of W type slab waveguide in the vicinity of the cutoff frequency. Concerning with the leaky mode, we obtained some interesting results.

High-resolution Direction-of-Arrival (DOA) estimation techniques for antenna arrays have been widely desired in many applications such as smart antennas, RF position location, and RFID system. To realize high-resolution capability of the techniques, precise array calibration is necessary. For an array of single-mode elements, a calibration matrix derived by the open-circuit method is the simplest one. Unfortunately, calibration performance of the method is not enough for the high-reslution DOA estimation techniques. In this paper, we consider problems of the calibration matrix derived by the method, and show that errors in the matrix can be effectively removed by an optimal diagonal weight coefficient. In the proposed compensation technique, the number of newly introduced parameters, or unknowns, is only one for an array of the identical elements. Performance of the simple compensation technique is verified numerically and experimentally.

Super regenerative detectors using a resonant tunneling diode (RTD) were fabricated and investigated for ultra-high frequency detectors. A key point is to use the RTD super regenerative detector for detecting much higher frequencies than the free-running oscillation frequency of the detector. This is possible owing to the superior high frequency characteristics of the RTDs. This has various advantages, such as circuit simplicity, easy design, and low power consumption. Clear detection of 50,GHz signal was demonstrated with a super regenerative detector which has 1.5,GHz free-running frequency. Moreover, detailed experiments revealed that the frequency dependence of the detection efficiency is smooth, and the harmonic frequencies have no effect. This is advantageous for high frequency detection.

We describe an approach to describe moving pictures in terms of their structural properties for video editing, video indexing, and video coding. The description contains 2D shape, motion, spatial relation, and relative depth of each region. To obtain the description, we develop the incremental segmentation scheme which includes dynamic occlusion analysis to determine relative depths of several objects. The scheme has been designed along the analysis-by-synthesis" approach, and uses a sequence of images to estimate object boundaries and motion information successively/incrementally. The scheme consists of three components: motion estimation, prediction with dynamic occlusion analysis, and update of the segmentation results. By combining the information from extended (longer) image sequences, and also by treating the segmentation and dynamic occlusion analysis simultaneously, the scheme attempts to improve successively over time the accuracy of the object boundary and motion estimation.

Application-level multicast (ALM) is a novel technology for multipoint applications, such as large scale file distribution, video and audio streaming, and video conferencing. Although many ALM mechanisms or algorithms have been proposed, all the multicast functions have been independently developed and integrated into individual applications. In such a situation, the development of ALM applications includes a lot of redundancy. Our goal is to improve the efficiency of developing ALM applications by reducing the development redundancy and to provide application developers with a middleware on which various ALM applications can be efficiently developed with minimum efforts. To this end, we develop a functional unit oriented ALM middleware, namely RelayCast. RelayCast provides a minimum but fundamental set of functionality as a functional unit, and constructs the basis on which additional and specific functions (i.e. codec, video capture, etc.) for each application are implemented. Some functional units contain several components with different algorithms, and RelayCast meets the requirements of various applications by choosing the appropriate component. In this paper, we propose RelayCast architecture, and present the implementation and experiments of a prototype.

Real-time and reliable radio communication is essential for wireless control systems (WCS). In WCS, preambles create significant overhead and affect the real-time capability since payloads are typically small. To shorten the preamble transmission time in OFDM systems, previous works have considered adopting either time-direction extrapolation (TDE) or frequency-direction interpolation (FDI) for channel estimation which however result in poor performance in fast fading channels and frequency-selective fading channels, respectively. In this work, we propose a subcarrier-selectable short preamble (SSSP) by introducing selectability to subcarrier sampling patterns of a preamble such that it can provide full sampling coverage of all subcarriers with several preamble transmissions. In addition, we introduce adaptability to a channel estimation algorithm for the SSSP so that it conforms to both fast and frequency-selective channels. Simulation results validate the feasibility of the proposed method in terms of the reliability and real-time capability. In particular, the SSSP scheme shows its advantage in flexibility as it can provide a low error rate and short communication time in various channel conditions.

This paper proposes a MAC protocol for presence information discovery in ubiquitous networks. The proposed protocol is designed for proactive discovery in which wireless devices periodically broadcast packets containing presence information. The protocol is based on Framed Aloha. The objective of the protocol is to assure the discovery time of single-hop neighbors considering wireless collisions and also power consumption. In this paper, we show that the proposed protocol is able to assure specified discovery time in distributed networks with random topology.

Burst switched WDM optical networks are coming up as suitable network architectures for future Optical Internet backbones. However, the lack of optical processing capabilities results in increased burst blocking probability, which in turn lead to very limited network performance. Efficient contention resolution algorithm is therefore necessary. In this paper, we propose a distributed wavelength assignment algorithm named Priority-based Wavelength Assignment (PWA) for such networks. Each node selectively assigns wavelengths based on the wavelength priority information "learned" from its wavelength utilization history in a distributed manner. As the learning process progresses, nodes in the same part of the network tend to assign different wavelengths to avoid contentions. Simulation results show that the PWA can effectively reduce the blocking probability and increase the performance of burst optical networks compared to previous algorithms such as random assignment.

Load size for a service on the Internet changes remarkably every hour. Thus, it is expected for service system scales to change dynamically according to load size. KVS (key-value store) is a scalable DBMS (database management system) widely used in largescale Internet services. In this paper, we focus on Cassandra, a popular open-source KVS implementation, and discuss methods for improving dynamic scaling performance. First, we evaluate node joining time, which is the time to complete adding a node to a running KVS system, and show that its bottleneck process is disk I/O. Second, we analyze disk accesses in the nodes and indicate that some heavily accessed files cause a large number of disk accesses. Third, we propose two methods for improving elasticity, which means decreasing node adding and removing time, of Cassandra. One method reduces disk accesses significantly by keeping the heavily accessed file in the page cache. The other method optimizes I/O scheduler behavior. Lastly, we evaluate elasticity of our methods. Our experimental results demonstrate that the methods can improve the scaling-up and scaling-down performance of Cassandra.

A supply voltage (VDD) independent temperature sensor circuit, which can be realized by the optimum combination of three current modes of n-MOSFETs including the subthreshold current using the feedback scheme from the temperature dependent voltage (VTD) output to the gates of three n-MOSFETs, was proposed and fabricated by a standard 1.2 µm n-well CMOS process. The circuit consists of only 17 MOSFETs without high resistors resulting in a small die area of 0.18 mm2. The temperature coefficient TC of the sensor circuit can be controlled by the channel length ratio L4/L3 of two n-MOSFETs. The average temperature sensor voltage VTS and its typical TC are 1.77 V at VDD=5.0 V (20) and 5.1 mV/ for VDD=5.01.0 V in the temperature range of -20-100 in case of L4/L3=9, respectively.

For future generation mobile networks, we expect that the mobile devices like PDAs, note PCs or any VoIP-enabled communicators will have the feature of being always switched on, ready for service, constantly reachable by the wireless Internet. In addition to high access speed, attractive real-time contents or other expected spectacular features of the future wireless Internet environment, the mobile terminals has to be very much energy-aware to enable literal untethered movement of the user. Mechanisms for network activities like maintaining location information and wireless system discovery, which require regular network access, should be energy-efficient and resource-efficient in general. Cellular systems employ the notion of passive connectivity to reduce the power consumption of idle mobile hosts. In IP based Multi-service User Terminal (MUT) that may have multiple wireless interfaces for receiving various classes of services from the network, there should be an efficient addressing of the energy consumption issue. To devise an energy-efficient scheme for simultaneous or single operation of the wireless interfaces attached to such terminals we should have comprehensive understanding of the power consumption of the devices/modules in various operational states. This paper investigates the power consumption pattern or behavior of some selected wireless interfaces that are good candidates for being part of the future of the multi-service user terminals. We propose a simple model for predicting energy consumption in a terminal attributed to the wireless network interfaces. We measured the actual consumption pattern to estimate the parameters of the model.