A Unified Route Optimization Scheme for Network Mobility
Recently Network Mobility(NEMO) is being concerned as new mobility issue. Lots of NEMO issues are already being touched in IETF NEMO WG but the solution is still premature especially to the Route Optimization (RO). NEMO has several problem spaces that need RO such as nested tunnels problem. Unfortunately, there is no solution that can be universally applied as one for all that results in supporting the coherent network mobility. In this paper, we propose a unified route optimization scheme that can solve several types of RO problem by using Path Control Header (PCH). In our scheme, Home Agent (HA) does piggyback the PCH on the packet which is reversely forwarded from Mobile Router (MR). That enables any PCH-aware routing facility on the route to make a RO tunnel with MR using the Care-of address of MR contained in the PCH. By applying to some already known NEMO RO problems, we show that our scheme can incrementally optimize the routes via default HA-MR tunnel through the simple PCH interpretation.

title: EIMD: A New Congestion Control for Fast Long-Distance Networks
abstract: In fast long-distance networks, TCP fails to fully utilize the bandwidth due to its congestion control mechanism A plethora of congestion control schemes that may enhance the performance of the transport protocol in fast long-distance networks have been proposed The proposed schemes aim to satisfy three requirements of congestion control schemes: bandwidth scalability, TCP friendliness, and RTT fairness However, due to the trade-off among these requirements, it is difficult to satisfy all the requirements simultaneously In this paper, we propose a new window-based congestion control scheme called EIMD (Exponential Increase/Multiplicative Decrease) that increases congestion window size exponentially to quickly grap the unutilized bandwidth We evaluate the performance of EIMD via computer simulations The simulation results show that EIMD satisfies the three requirements In addition, EIMD converges fast to the fair-share points.

title: TCP Performance Improvement with ACK Pacing in Wireless Data Networks
abstract: Wireless data services are fundamental in ubiquitous networks. In wireless data networks, the TCP congestion mechanism can mistake a wireless channel error or blackout for congestion on the route. Several wireless TCP protocols have been proposed considering TCP performance degradation in wireless systems. However, these protocols are too complex to deploy in wireless systems. In this paper, we propose the ACK Pacing algorithm for long lasting loss periods like a hand-off or a blackout. By pacing ACK packets sending, we prevent bursty data delivery to the old path and a spurious timeout occurrence. Also, paced ACK packets trigger the route update to the new path faster. The proposed algorithm can be implemented in the wireless-node-side which is easily applicable to wireless systems. From simulation results, ACK Pacing improves TCP performance compared with many TCP variations. The ACK Pacing algorithm shows good performance during a long lasting loss period.

title: Specification and validation of dynamic systems using temporal logic
abstract: A specification and validation technique for dynamic systems is proposed. In particular, a new temporal logic called HDTL, is presented and the tableau method revised for automatic analysis. Using a freeze quantifier, HDTL with the revised tableau method makes it possible to specify the correctness requirements of dynamic systems and validate them. The proposed logic is rather generic, i.e. it has only a few assumptions on operational language. The authors introduce a simple dynamic modelling language and illustrate its experiment. The experiment shows that HDTL is suitable for specifying dynamic properties and the analysis technique is promising.

title: A Data-Driven Statistical Approach to Analyzing Process Variation in 65nm SOI Technology
abstract: This paper presents a simple yet effective method to analyze process variations using statistics on manufacturing in-line data without assuming any explicit underlying model for process variations. Our method is based on a variant of principal component analysis and is able to reveal systematic variation patterns existing on a die-to-die and wafer-to-wafer level individually. The separation of die variation from wafer variation can enhance the understanding of a nature of the process uncertainty. Our case study based on the proposed decomposition method shows that the dominating die-to-die variation and wafer-to-wafer variation represent 31% and 25% of the total variance of a large set of in-line parameters in 65nm SOI CMOS technology

title: Extending the SCR Method for Real-Time Systems
abstract: Wepropose timed SCR specifications, which are a generalizationof SCR specifications, intended to specify quantitative timingproperties of real-time systems. We extend the tabular notationof the SCR method to deal with sporadic and periodic timing constraints.We present a formal semantics for timed SCR specifications bytranslating them into timed transition systems. A shutdown systemin Korean nuclear power plants is used as a case study to illustratetimed SCR specifications.