Approximation algorithms for optimal routing in wavelength routed WDM network.

Finding an optimum routing scheme, so that a given logical topology for a wavelength routed WDM network handles all traffic requirements in an efficient manner, is an important problem in optical network design. One major design objective is to minimize the congestion of the network, defined as the traffic on the logical link which has the maximum traffic. This is known to be a hard problem taking an enormous amount of time even for moderate sized networks and is intractable for larger networks. The approach we have outlined is that of obtaining an approximate solution to the problem rather than an exact solution. We have developed three closely related approximate algorithms to solve this problem. These three algorithms significantly improved the running time for finding the minimum congestion. We based our approach on the approximation fraction multi-commodity algorithm by Lisa Fleischer [F99] to calculate the primal and dual solutions for the linear program to solve the multi-commodity flow problem. We have compared our algorithm with the standard linear program solution obtained using CPLEX. The experiments show that our algorithms require, on the average, only less than 10% of the time CPLEX uses for networks with 25 nodes or less. Our algorithms perform well for larger networks which CPLEX cannot handle.Dept. of Computer Science. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2004 .L85. Source: Masters Abstracts International, Volume: 43-03, page: 0884. Advisers: Subir Bandyopadhyay; Arunita Jackel. Thesis (M.Sc.)--University of Windsor (Canada), 2004

Security in Wireless Sensor Networks: Issues and Challenges

Wireless Sensor Network (WSN) is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes it lucrative for being exploited in abundance in future. The inclusion of wireless communication technology also incurs various types of security threats. The intent of this paper is to investigate the security related issues and challenges in wireless sensor networks. We identify the security threats, review proposed security mechanisms for wireless sensor networks. We also discuss the holistic view of security for ensuring layered and robust security in wireless sensor networks.Comment: 6 page

Context-aware Synthesis for Video Frame Interpolation

Video frame interpolation algorithms typically estimate optical flow or its variations and then use it to guide the synthesis of an intermediate frame between two consecutive original frames. To handle challenges like occlusion, bidirectional flow between the two input frames is often estimated and used to warp and blend the input frames. However, how to effectively blend the two warped frames still remains a challenging problem. This paper presents a context-aware synthesis approach that warps not only the input frames but also their pixel-wise contextual information and uses them to interpolate a high-quality intermediate frame. Specifically, we first use a pre-trained neural network to extract per-pixel contextual information for input frames. We then employ a state-of-the-art optical flow algorithm to estimate bidirectional flow between them and pre-warp both input frames and their context maps. Finally, unlike common approaches that blend the pre-warped frames, our method feeds them and their context maps to a video frame synthesis neural network to produce the interpolated frame in a context-aware fashion. Our neural network is fully convolutional and is trained end to end. Our experiments show that our method can handle challenging scenarios such as occlusion and large motion and outperforms representative state-of-the-art approaches.Comment: CVPR 2018, http://graphics.cs.pdx.edu/project/ctxsy

A Soft Computing Approach to Dynamic Load Balancing in 3GPP LTE

A major objective of the 3GPP LTE standard is the provision of high-speed data services. These services must be guaranteed under varying radio propagation conditions, to stochastically distributed mobile users. A necessity for determining and regulating the traffic load of eNodeBs naturally ensues. Load balancing is a self-optimization operation of self-organizing networks (SON). It aims at ensuring an equitable distribution of users in the network. This translates into better user satisfaction and a more efficient use of network resources. Several methods for load balancing have been proposed. Most of the algorithms are based on hard (traditional) computing which does not utilize the tolerance for precision of load balancing. This paper proposes the use of soft computing, precisely adaptive Neuro-fuzzy inference system (ANFIS) model for dynamic QoS aware load balancing in 3GPP LTE. The use of ANFIS offers learning capability of neural network and knowledge representation of fuzzy logic for a load balancing solution that is cost effective and closer to human intuitio

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle