The OptIPuter is a radical distributed visualization, teleimmersion, data mining and computing architecture. Observing that the exponential growth rates in bandwidth and storage are now much higher than Moore's Law, this major new project of several universities--currently six in the US and one in Amsterdam--exploits a new world of computing in which the central architectural element is optical networking. This transition is caused by the use of parallelism, as in supercomputing a decade ago. However, this time the parallelism is in multiple wavelengths of light, or lambdas, on single optical fibers, creating a LambdaGrid. Providing applications-centric middleware to control the LambdaGrid on a regional and global scale is a key goal of the OptIPuter and StarLight Optical Switching projects.

In this paper, we first address the current state of broadband services in Korea. Here, we introduce relevant statistics, current access network architectures, and activities of some major carriers. We also briefly introduce Korean government's policies on research and development projects and plans for promoting the country toward an advanced information society. We then introduce a large-scale, collaborative project named "Photonic Access To the Home (PATH)" with five-year period of performance, started in year 2002. The project is under leadership of the government and ETRI in collaboration with universities and industry. We finally provide a rather detailed description of the FTTH (Fiber To The Home) technology based on the wavelength division multiplexing technology, which has been under research in our laboratory as a part of the PATH project. We show some of our achievement including new architectures and networking principles for the FTTH network, analysis of the dynamic allocation of user bandwidth, and the experiment for a low-cost WDM optical source.

This paper proposes an optical access networks that guaranteed QoS in bidirections. Our scheme is the PON (Passive Optical Network) systems using OCDM (Optical Code Division Multiplexing) technology. For the bidirectional 100 Mbps guaranteed, we examined the simple decision circuit, code length (the number of chips), the number of simultaneously accesses and transmission distance. Furthermore, we reported the results that evaluated prototype of speed-down (4 Mbps, 16 chips) for the functional check of simple decision circuit.

This paper proposes a traffic-driven optical IP networking architecture for service provider networks. Its design is derived from the optical GMPLS architecture, which provides high performance but is not scalable since both optical paths and IP routes need to be arranged in a mesh topology. To improve scalability, we first modified the configuration so that paths and routes can be arranged in a tree topology. However, this approach may degrade performance due to traffic concentration at each tree's root. To prevent such performance degradation, we further modified the architecture so that both cut-through optical paths and cut-through IP routes can be assigned reactively, according to traffic demand, and these can work together in cooperation. As a result, our architecture achieves both high performance and scalability, in that the whole network performance can be maintained without a massive increase in the number of optical paths and IP routes, even if the number of customer networks grows.

The growth in the volume of Internet traffic and the increasing variety of Internet applications require Internet backbone networks to be scalable and provided sophisticated quality of service (QoS) capabilities. Internet backbone routers have evolved to achieve sub-Tbps switching capacity in a single unit, but their switch architectures have limited scalability, causing QoS to degrade as the switches get bigger. Hence, we propose a large-scale IP and lambda integrated router architecture with scalable switches. We first describe the system architecture of our proposed backbone router and clarify the requirements for its switching capabilities to meet near-future demands. The new switch architecture, using crossbar-based switching fabrics and optical interconnection devices, meets the requirements for a backbone router to scale up to 82 Tbps and enable light path switching as well as packet switching. The routing tag and its usage algorithm in the switch, and packaging issues, including the quantity of hardware required for expansion, are also discussed.

In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced by its architecture and a packet scheduling algorithm. We compare the performances of these two packet switches by applying different packet scheduling algorithms. Through simulation experiments, we show that each architecture has a parameter region for achieving better performance. For the shared buffer type switch, we found that void space introduces unacceptable performance degradation when the traffic load is high. Accordingly, we propose a void space reduction method. Our simulation results show that our proposed method enables to the shared buffer type switch to outperform the output buffer type switch even under high traffic load conditions.

We evaluate resolution models for resource allocation in a GMPLS distributed control plane for heterogeneous all-optical networks. In a practical regional-to-backbone network environment, the local resolution model is advantageous in resource utilization, protocol compatibility and scalability. We demonstrate a lookup procedure, which inter-works with OSPF-TE and RSVP-TE protocols and allocates resources in the local resolution model.

Implementation issues on generalized multi-protocol label switching (GMPLS) -based photonic switching networks are experimentally analyzed. A resilient control plane architecture using in-fiber and out-of-fiber control channels is proposed to resolve issues of establishing the control plane in out-of-band networks. The resilient control plane is demonstrated in a photonic cross-connect (PXC) -based GMPLS network involving a 1,000 km transmission line. Fast signaling for provisioning and restoration operation is accomplished by implementing in-fiber control channels as primary, and the out-of-fiber control channels effectively operate as secondary and restore messaging of the control information between neighbors. The control channel protection is initiated by the link management protocol (LMP). Using the test bed, optical layer routing operation is investigated to assess the effects on the signal quality of wavelength paths, and transparent routing of the wavelength paths over one-hop and two-hops route is demonstrated within 1 dB difference regarding the Q factor. Stable operation of loss of light (LOL) -triggered restoration is demonstrated by setting the optical level threshold 5 dB higher than the amplified spontaneous emission (ASE) noise level.

This paper addresses the routing and wavelength assignment (RWA) problem in a wavelength routed all optical network. One of the main issues is the assignment of the limited number of wavelengths over each physical fiber connection so that high aggregate capacity can be achieved. In a typical mesh topology, this problem has been shown to be NP-hard. In this paper, we propose a new heuristic based algorithm building upon one of the best known wavelength assignment algorithms proposed by Zhang and Acampora. The salient feature of the proposed algorithm is to consider the inherent multihop nature of the underlying mesh topology. We demonstrate that the proposed algorithm reduces the complexity by an order of magnitude, while at the same time achieving significantly lower blocking probability.

The authors have established new switching architecture of all optical WDM network suitable for the application of video transmission. In this paper, emphasis is put on a setup of a wavelength connection based on contiguous wave-band pool and we have proposed new Wave-Band Routing and Assignment (WBRA) method which provides simple switching and high speed wavelength assignment. Assuming the environment without wavelength convertor, our wave-band switching scheme is applied to several network topologies for performance evaluation. Then effectiveness and feasibility of this scheme are confirmed from a viewpoint of the number of required wavelengths. Simulation results indicate that our proposal scheme attains lower number of required wavelengths as compared to the fixed wave-band scheme. Assuming to use wavelength convertors, we have also evaluated the situation that the number of hops is restricted.

An IP (Internet Protocol) over WDM network is expected to be an infrastructure for the next-generation Internet by directly carrying IP packets on the WDM-based network. Among several architectures for IP over WDM networks, one promising way is to overlay a logical topology consisting of lightpaths over the physical WDM network so that IP packets are carried on the lightpaths. The conventional methods for designing the logical topology have been focusing on maximizing throughput of the traffic. However, when the WDM network is applied to IP, the end-to-end path provided by the logical topology of the WDM network is not suitable to IP since IP has its own metrics for route selection. In this paper, we propose a new heuristic algorithm to design a logical topology by considering the delay between nodes as an objective metric. This algorithm uses a non-bifurcated flow deviation to obtain a set of routes that IP packets are expected to traverse. Our proposal is then compared with conventional methods in terms of the average packet delays and throughput. It is shown that our method becomes effective when the number of wavelengths is a limited resource.

Progress in WDM transmission technology and the development of optical cross-connect systems has made optical backbone networks a reality. The conventional planning methodologies for such optical backbone networks calculate optimum light-path arrangements to minimize the network cost under the condition that the number of demanded light-paths is given in advance. However, the light-path demand varies according to the light-path prices. Thus, a new planning methodology for the optical backbone networks is necessary to optimize the light-path prices and to maximize the profit obtained from the network. This paper proposes a new planning methodology for the survivable optical networks. This methodology is based on economic theory for competitive markets involving plural kinds of commodities. Using this methodology, the optimum light-path prices can be decided to maximize the obtained profit. A numerical example is presented to show that the obtained profit can be improved by preparing various light-path classes with different recovery modes and introducing an appropriate light-path pricing according to the reliability of each light-path class.

This paper studies the local Poisson property of aggregated IP traffic. First, it describes the scenario where IP traffic presents a Poisson-like characteristic within some limited range of time scales when packets from independent traffic streams are aggregated. Each of the independent traffic streams corresponds to a series of correlated IP packets such as those of a transport connection. Since the Poisson-like characteristic is observed only within some limited range of time scales, we call this characteristic the local Poisson property. The limited range of time scales of the local Poisson property can be estimated from a network configuration and characteristics of transport connections. Second, based on these observations, we seek the possibility to apply an ordinary Poisson process to evaluation of the packet loss probability in IP networks. The analytical investigation, where IP traffic is modeled by a superposition of independent branching Poisson processes that presents the local Poisson property, suggests that the packet loss probability can be estimated by a finite-buffer queue with a Poisson process when the buffer size is within a certain range. The investigation is verified by simulations. These findings expand the applicability of conventional Poisson-based approaches to IP network design issues.

Multiple access interference and near-far effect cause the performance of the conventional single user detector in DS/CDMA systems to degrade. Due to high complexity of the optimum multiuser detector, suboptimal multiuser detectors with less complexity and reasonable performance have received considerable attention. In this paper we apply the classic and a new modified genetic algorithm for multiuser detection of DS/CDMA signals. It is shown that the classic genetic algorithm (GA) reaches an error floor at high signal to noise ratios (SNR) while the performance of proposed modified GA is much better than the classic one and is comparable to the optimum detector with much less complexity. The results hold true for AWGN and fading channels. We also describe another GA called as meta GA to find the optimum parameters of the modified GA. We compare the performance of proposed method with the other detectors used in CDMA.

Carrier frequency and symbol timing errors may greatly degrade the performance of the orthogonal frequency division mulitplexing (OFDM) system, especially in multipath environment. In this paper, we explore the cyclostationarity of OFDM signals, which only relies on second order statistics, to estimate the synchronization offset. First, a coarse carrier frequency offset estimator for multipath environment is developed using the second order statistics of the received OFDM signal. It has a wide capture range though not accurate. Second, we introduce a new synchronization algorithm based on cyclostationarity and matched filter theories, which can get the maximal estimation SNR in multipath environment. Both estimators utilize channel state information to achieve better estimation performance and are non-pilot aided. They can be combined to form a whole OFDM synchronizer for multipath environment. Finally, simulations confirm the performance of the estimation algorithm.

With the growing demand for mobile communications, multicarrier (MC) schemes are receiving an increasing amount of attention, primarily because they handle frequency selective channels better than ordinary single-carrier schemes. However, despite offering several advantages, MC systems have certain weak points. One is a high sensitivity to interchannel interference (ICI). Using a Markov chain approach, we synthesized an optimal receiver for a situation where interference affects three adjacent subchannels. Simulation results showed that the proposed 'turbo scheme' provided better BER performance than a conventional receiver, especially at higher signal-to-noise ratios. The implementation of the turbo algorithm is independent of the transmitted signal, providing complete OFDM reception compatibility.

Adaptive arrays have been recognized as an attractive mean for overcoming multipath fading and interference rejection in the field of mobile communications. In, an adaptive array applicable to single-user spread spectrum (SS) systems has been proposed. In this system, any a priori information concerning incoming signal, even the spreading code and synchronization, is not necessary while it achieves equalizing, beamforming and despreading of a received signal, simultaneously. In this paper, we propose a multistage blind adaptive array antenna based on the above-mentioned adaptive algorithm in order to realize blind signal processing that is applicable to multi-user SS systems. Behavior and performance of the proposed multistage system are examined through computer simulations.

In this paper, expressions are derived for the bit error rate (BER) of the multicarrier-CDMA (MC-CDMA) downlink in the presence of pure impulsive interference and a frequency-selective fading and the BER performance is numerically evaluated by a Monte-Carlo simulation method. Minimum mean square error combining (MMSEC) and orthogonal restoration combining (ORC) are considered for frequency-domain equalization. The joint weight of antenna diversity reception using maximal ratio combining (MRC) and frequency equalization combining is derived. The MC-CDMA transmission performance in the presence of pure impulsive interference is compared with that of DS-CDMA transmission.

In this paper, we propose multiple subcarrier modulation (MSM) for infrared wireless systems using punctured convolutional codes and variable amplitude block codes to minimize the average optical power by allocating the appropriate amplitudes to the puncturing bits. The proposed system maps the coded bits corresponding to zeros in the puncturing table to the amplitudes of subcarriers, while the rate-compatible punctured convolutional (RCPC) code deletes them. We compare two proposed systems with the conventional systems: one block code maps the coded bits corresponding to zeros in the puncturing table to zeros (proposed 1), and the other maps them to the appropriate values among 0, and 1 (proposed 2) so that the required bias can be minimized. We show that the proposed 2 can achieve the minimum required SNR at the same average optical power and the same information rate among all the systems.

Future electric lights will be comprised of white LEDs (Light Emitting Diodes). White LEDs with a high power output are expected to serve in the next generation of lamps. In this paper, an indoor visible data transmission system utilizing white LED lights is proposed. In the proposed system, these devices are used not only for illuminating rooms but also for an optical wireless communication system. This system is suitable for private networks such as consumer communication networks. However, it remains necessary to investigate the properties of white LEDs when they are used as optical transmitters. Based on numerical analyses and computer simulations, it was confirmed that the proposed system could be used for indoor optical transmission.

This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.

Recently, diverse multimedia applications with stringent multiple Quality of Service (QoS) requirements have been increasing. In particular, multicast communication has become more popular because of its availability and for efficient use of network resources. Most multicasts are point-to-multipoint, in which a source delivers data to multiple designated recipients, such as for video or audio distribution. In the near future, multipoint-to-multipoint communication services, including multimedia collaborations such as video conferencing and distant-learning, will be developed. However, when a conventional multicast routing algorithm is applied to a multipoint-to-multipoint communication service, it might result in excessive traffic concentration on some links. Therefore, we propose a new multipoint-to-multipoint routing method. It utilizes the Fallback+ algorithm to perform multicast routing for the purpose of satisfying multiple QoS requirements and alleviating traffic concentrations. Simulation experiments show that our method improves traffic load balance and achieves efficient use of network resources.

Integration of the IP/MPLS network and the WDM optical mesh network is a promising approach to realizing an efficient backbone network. Because of the great volumes of traffic carried, the social cost incurred by a failure will be extremely high, so survivability is very important in the backbone network. In survivable IP/MPLS over WDM backbone networks, cooperation of the optical level fault recovery and the IP/MPLS level fault recovery is essential. This paper analyzes cost characteristics of the optical level fault recovery and the IP/MPLS level fault recovery. A mathematical programming method is proposed to minimize the initial network cost when the IP/MPLS level fault recovery is utilized in the survivable IP/MPLS over WDM networks. Using this method, the initial network cost needed for the IP/MPLS level fault recovery is compared with that for the optical level fault recovery. The initial network cost for the LSP (Label Switched Path) protection scheme is smaller than that for the shared light-path protection scheme and larger than that for the pre-plan type light-path restoration scheme. The LSP protection scheme is suitable for the best-effort type traffic while the shared light-path protection scheme may be suitable for the bandwidth guaranteed type traffic.

An element consist of a slot and a post is designed for canceling the reflection in a rectangular waveguide by the method of moments. For reducing the computation time in practical design of the element with a wide range of coupling strength for an array, only the axial uniform currents on the post surface are considered. This approximation is valid when the post for reflection-canceling is far enough from the slot. The post location is determined by this simple analysis for both transverse and longitudinal slots with typical coupling strength. Measured results using 4 GHz-band standard waveguides reveal that the assumption of uniform line currents on the post surface is acceptable. The design is further extended to demonstrate its applicability to a practical array design by considering a wide range of coupling strength.

In this paper, we propose a scalable Extended Differentiated-Services (EDS) architecture to guarantee edge-to-edge explicit rate allocation. In presence of flows with explicit rate allocation, to share bandwidth fairly, a new fairness definition is proposed. Based on EDS and the proposed fairness definition, a scalable fair Edge-to-Edge Congestion Control Algorithm with Explicit Rate Allocation (ECC-ERA) is presented to solve the bandwidth assurance problem facing Differentiated Service architecture, where EDS uses congestion control packets to carry the flow-related states and congestion control information. By designing efficiency control and fairness control separately, the ECC-ERA can achieve good scalability to link capacity, round-trip time and number of flows. It will be shown that EDS plus ECC-ERA outperforms the general Diff-Serv bandwidth guarantee approaches. The main advantages of EDS+ECC-ERA are as follows: (1) it not only can guarantee explicit rate allocation, but also can guarantee near-zero packet loss in core routers, high utilization, lower and smoother queueing delay, better fairness and better protection from unresponsive traffic. (2) Neither resource pre-reservation nor sophisticated scheduling mechanisms are required. The simple FIFO at core routers is enough. (3) EDS plus EC-ERA is very efficient and can be used as end-to-end QoS building block.

The high-resolution frequency estimators most commonly used, such as Least Square (LS) method based on AR model, MVSE, MUSIC and ESPRIT, determine estimates of the sinusoidal frequencies from the sample noise-corrupted data. In this paper, a new frequency estimation method named Pole-Placement Least Square (PPLS) is presented, which is a modified LS method with a certain number of model poles restricted to the unit circle. The statistical performance of PPLS is studied numerically, and compared with the Cramer-Rao bound as well as the statistical performance corresponding to the LS methods. PPLS is shown to have higher resolution than the conventional LS method. The relationship between poles location and its resolution is also discussed in detail.

In this letter, we present a practical method of implementing the parallel interference cancellation (PIC) algorithm in an asynchronous CDMA system. A novel pipelined structure is employed in this method in order to reduce the processing delay and the memory space comparing to the conventional PIC processing scheme.

In this paper, a joint adaptive interference canceller (AIC) and maximum likelihood (ML) decoder scheme is proposed for a space-time coded DS-CDMA system with the difference between arrival times from transmit antennas. As the arrival time difference causes not only ISI and MAI, but also inter-antenna interference, performance degradation in the space-time coded DS-CDMA system is more severe than that of a regular DS-CDMA system with single transmit antenna. To mitigate the effect of the interference during space-time decoding, a joint algorithm for the proposed scheme merges adaptation process of the AIC into a ML decoding algorithm. Performance of the proposed scheme is evaluated for QPSK space-time trellis codes with two transmit antennas. It is shown that the proposed scheme achieves better performance than the conventional ML decoding scheme.

In this paper, we propose a blind adaptive channel identification and equalization algorithm with phase offset compensation for single-input multiple-output (SIMO) channel. It is based on the one-step forward multichannel linear prediction error method and can be implemented by an RLS algorithm. Phase offset problem is inherent part of any second-order statistics-based blind identification and equalization. To solve this problem, we use a blind adaptive algorithm called the constant modulus derotator (CMD) algorithm based on constant modulus algorithm (CMA). Moreover, unlike many known subspace (SS) methods or cross relation (CR) methods, our proposed algorithms do not require channel order estimation. Therefore, our algorithms are robust to channel order mismatch.

The transmission quality in mobile wireless communication systems is affected by not only AWGN but also multi-path fading. Particularly, the Doppler frequency, the delay spread and the Rician factor have a great influence upon the quality over fading channels. This letter proposes the approximate equation for easily calculating the BER in DS-CDMA systems over multi-path fading channels. The validity of the approximate equation is confirmed from the fact that the BER calculated by the equation coincides with that by the computer simulation.

This Letter proposes a way of resolving spreading code mismatch in blind multiuser detection with subspace-based technique. It has been shown that subspace-based (SSB) blind multiuser detectors demonstrate the advantages of fast convergence speed and less sensitivity to spreading code mismatch over constrained mean output energy (CMOE) detectors. With a corrected scheme of the desired user code, the proposed method offers more robust capabilities over existing SSB techniques. Numerical results show that the effectiveness of the proposed technique.

We propose a hierarchical cross-connect node employing tunable waveband aggregators on the internal links. In a square grid network, the number of the switch ports for the internal links is reduced by 40 to 60% when the number of nodes is 50.

The file sizes of on going flows are fairly disparate on the current network. In this letter, we propose an "age-based" packet discard scheme in the Traffic Conditioner (TC) of a gateway to improve the performance of file transmission. The on going flows will be grouped to three classes of priority according to their "age" as network congestion occurs and the simulation results show that the proposed model can work efficiently in most of the congestion conditions.

A new beamforming method based on simplex downhill optimaization process has been presented for the reverse link CDMA systems. The proposed system performs code-filtering at each antenna for each user. The new beamforming method gives lower computations and faster convergence properties than existing algorithms. The simulation results show that the proposed algorithm has a better BER performance in the case of the time-varing channel.

In this paper, we present a technique to obtain an accurate closed-form spatial Green's function for a coplanar waveguide. The integration of the Sommerfeld integrals is performed on the real axis, and the path deformation is avoided in the sampling data. The results are in good agreement with the numerical integration over wide ranges of the signal frequency and the observation distance.

A new approach to correcting the array amplitude failure by a combination of B-spline techniques and genetic algorithms is proposed. Some array elements indicate the control knots for a B-spline curve by their nominal positions and amplitudes; others distribute the excitation amplitudes according to the sampling points on the curve. The inherent smoothness of the B-spline curves reduce the effect of excessive coupling between adjacent elements. Genetic algorithms are used to search for a quasi-optimized B-spline curve to produce the ultimate amplitude distribution for correcting the array failure. To demonstrate the method's effectiveness, simulation results for correcting failures with three- and four-element failures are presented.

Adaptive arrays with signal blocking have the advantages of fast convergence and robustness to pointing errors as well as of rejecting a coherent interference in addition to incoherent ones. In this paper, we propose a novel method for performance improvement in such arrays with no increase in complexity. The proposed method utilizes all of the array elements to obtain the adaptive output so that its performance is superior to that of the conventional method which does not utilize one of the elements. Their performances are compared analytically and by computer simulation.

In this letter, we take advantage of both types of Interactive and Batch services by considering a hybrid multimedia-on-demand (MOD) system which provides both services. Also, we propose two serving methods with an incentive charging scheme to optimize the coexistence of both services. Numerical results show that the proposed hybrid system outperforms both individual systems. In particular, the system provider receives more revenue by serving more users concurrently, while the users have a better viewing experience due to higher availability of contents.

In this paper, a new video broadcast protocol is proposed for video-on-demand (VoD) in shared environment. The new protocol is developed by modifying the first segment delivery scheme for the skyscraper protocol using the idea of patching. The results show that the start-up latency for users is greatly reduced when using our new protocol.