The geometrical transform parameters included in the ancillary file of the system-corrected Landsat TM image, such as a translation, a rotation angle and a scaling, may contain errors. Therefore, it sometimes occurs that the orthoimage obtained by the affine transform is not desirable. In order to overcome this problem, Iikura proposed the method that orthorectifies the satellite image with digital elevation model (DEM) and optimizes the translation with the DEM shaded relief image. His method had practical appeal, but the correction of the rotation angle and scaling were not considered. In this paper, we describe the method to optimize not only the translation but also the rotation angle and scaling using the Fourier-Mellin transform and the Fourier phase-only-correlation (POC) technique. When applied to system-corrected Landsat TM images, the result shows that the parameters obtained by the new method were more accurate than either the original or the re vised parameters contributed by JAXA.

IP networks have evolved into a global and commercial communication infrastructure so that traffic requiring quality of service (QoS) is introduced in addition to best effort traffic. Consequently, network providers need to manage their network resource based on service level agreement (SLA). Conventional distributed routing is not suitable for such SLA based resource management. We propose a QoS control architecture, which provides optimal resource assignment to SLA based traffic applying centralized resource management. We also propose an algorithm to determine QoS control based on resource requests.

Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. This paper proposes a traffic engineering scheme using multiple multipoint-to-point (m-t-p) label switched paths (LSP) which can reduce the number of LSP and required labels in links. The scheme consists of m-t-p LSP creation and flow assignment. Routes are first selected, and m-t-p LSP are designed to include them. The m-t-p LSP design problem is formulated as a 0-1 integer programming problem. The flow assignment problem is formulated as a mixed integer programming problem in which maximum link load, i.e., maximum congestion, is minimized. Numerical comparisons with the conventional point-to-point LSP approach show that the m-t-p LSP approach can reduce the number of required LSP and labels. Moreover, numerical comparisons with conventional shortest path fast-based flow assignment show that our flow assignment scheme can reduce maximum link load.

To develop survivable and cost-efficient networks, it is important to consider practical restoration control in network design. We propose a design for joint capacity assignment to state-independent working paths and state-independent spare paths. The assignment is formulated as an integer programming problem. The use of state-independent paths simplifies the restoration process and shortens the restoration time, and our design is especially suitable to pre-planned distributed restoration schemes. We further apply it to a strategy in which all paths are state-dependent, and to one whose spare paths are state-dependent. A numerical comparison of capacity costs, in which our design was applied to specific network examples, shows that costs for a state-independent approach are only slightly higher than those for state-dependent approach.

This paper examines reliable and economical wavelength-division-multiplexed trunk-network protection architectures. Protection architectures for lightwave networks are classified as path/link switching type or dedicated/shared standby-resources type. The required number of optical links for each protection-architecture is calculated and compared in terms of the number of wavelengths, demand patterns, and several network topologies. The results show that the path-dedicated protection architecture, which enables fast protection, is pretty cost-effective for a typical regional network when the number of wavelengths is more than ten. Dense-WDM technologies will replace the economical and reliable protection-architecture from the ordinary link-shared protection to the path-dedicated protection.

This paper proposes an optimal design scheme for survivable wavelength-division multiplexing (WDM) transport networks in which fast restoration can be achieved by using predetermined restoration paths that are independent of failure locations and which have one to one correspondence with working paths. Integer programming-based design problems are formulated to optimally determine working and their corresponding restoration paths, the number of fibers in each span, and the number of optical cross connects (OXCs) in each node. In these optimization problems, total facility cost, which includes not only transmission cost but also cross connection, is minimized. This design scheme can handle the dedicated/shared allocation of spare resources and several parameters, such as the maximum available number of wavelengths per fiber /spl Omega/, the matrix size of each OXC, and cross-connection to transmission cost-coefficient ratio /spl gamma/. Total fiber length, the total number of OXCs, etc., are evaluated from obtained design results for these options and parameters. Numerical examples show that the dependency of total fiber length and the total number of OXCs on /spl gamma/ is relatively small, and cross-connection to transmission cost ratios (/spl gamma/ times the total number of OXCs divided by total fiber length) in the dedicated and shared cases are almost the same for each combination of /spl gamma/ and /spl Omega/.

This paper proposes the guided restoration algorithm starting at different timing (GRA-DT) which is a scaleable self-healing algorithm that takes into account the buffer size required for the self-healing OAM cells arriving at an ATM crossconnect. In the guided restoration algorithm (GRA) all self-healing processes are started just after VP-AIS cells are detected. Thus if many VPs are affected by failures, a lot of self-healing OAM cells are transmitted during a short period of time. To avoid losing such cells, ATM crossconnects must be equipped with a large size buffer to store the self-healing OAM cells waiting for processing. To reduce the buffer size, we propose the GRA-DT with which self-healing processes are started at different timing for different VPs. This scheme has the effect of dispersing self-healing OAM cell transmission in time. Thus the number of self-healing OAM cells waiting in a buffer decreases and the buffer size can be smaller. This can be achieved by a simple alternation of GRA that adds information on starting timing to one of the VP terminating nodes. The result obtained in evaluating GRA-DT in some lattice networks shows that the number of self-healing OAM cells is about 55-86% of that for GRA in the case of double link failures. In addition, GRA-DT effectively reduces the redundant link resource reservation, and thus the restoration ratio was increased by 20% for the 36 node network in the event of node failures.