Abstract

Scenarios such as online banking, mobile payment systems, stock trading, selling merchandise, and a host of other applications that need a high level of security have moved from the research domain to real world. Moreover, the nature of clients has been changing from traditional desktops to mobile and handheld devices. Protocols like SSL, SSH are the present standard for establishing secure channels. However, the drawback in these protocols is that both the server and the client need to perform computationally expensive public-key operations for secure channel establishment. In this paper, we present simple constructions that spread the cost of secure channel establishment over several sessions. Our constructions are incrementally deployable and can operate with existing protocols such as SSL and SSH. Experimental results indicate that our constructions are practical and efficient in reducing the computational load at the server as well as the client side.

Abstract

In this paper, we address the security of routing protocols. Internet routing protocols are subject to attacks in the control plane as well as the data plane. In the control plane, a routing protocol, e.g., BGP, OSPF, exchanges routing state updates and enables routers to compute the best paths towards various destinations. During this phase, an attacker can modify or inject malicious control messages leading to incorrect computation of routing paths. In the data plane, the routers forward the data along the paths computed in the control plane. Even if an attacker is not successful during the control phase, he can choose not to use the correct routing paths and forward data along routes that benefit him. Research shows that, attacks on the control plane can be mitigated by ensuring message integrity and, attacks on the data plane can be mitigated by ensuring route integrity. Earlier works have addressed these two problems independently with many interesting solutions. However, due to the nature of these solutions, network architects cannot deploy security at both planes without increasing the overhead on the network. In this paper, we focus on an integrated approach and propose the use of symmetric key protocols for addressing the security at both the control and data planes. We describe approaches that enable the reuse of the symmetric key protocols thereby eliminating the need for separate solutions at different planes. We used symmetric key protocols as they are efficient and scalable. Our experimental results show that our approaches are practical and can be incrementally deployed as well.

Abstract

people volunteer their time and energy and work in a dedicated fashion to pull everything together each year, including our very supportive Steering Comm-tee members led by Sukumar Ghosh. However, the success of ICDCN is mainly due to the hard work of all those people who submit papers and/or attend the conference. We thank you all. January 2009 Prasad Jayanti Andrew T. Campbell Message from the Technical Program Chairs Welcome to the proceedings of the 10thInternationalConferenceon Distributed Computing and Networking (ICDCN) 2009. As ICDCN celebrates its 10th-niversary, ithasbecomeanimportantforumfordisseminatingthelatestresearch results in distributed computing and networking. We received 179 submissions from all over the world, including Algeria, A-tralia, Canada, China, Egypt, France, Germany, Hong Kong, Iran, Italy, Japan, Malaysia, The Netherlands, Poland, Singapore, South Korea, Taiwan, and the USA, besides India, the host country. The submissions were read and evaluated by the Program Committee, which consisted of 25 members for the Distributed Computing Track and 28 members for the Networking Track, with the ad-tional help of external reviewers. The Program Committee selected 20 regular papers and 32 short papers for inclusion in the proceedings and presentation at the conference. We were fortunate to have several distinguished scientists as keynote speakers. Andrew Campbell (Dartmouth College, USA), Maurice Herlihy (Brown University, USA), and PR Kumar (University of of Illinois, Urbana-Champaign) delivered the keynote address. Krithi Ramamritham from IIT Bombay, India

Abstract

An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a (G), is the minimum number of colors required for acyclic vertex coloring of graph G=(V, E). In this paper we show that for any graph G with maximum degree∆, a (G)≤ 3∆ 2+ 4∆+ 8

Abstract

In this paper, we discuss the numerical modeling of infinite media using transmitting boundary condition. This is done for simulating the propagation of elastic waves in soil media. Wave interaction with different kinds of boundaries is discussed explaining the numerical modeling procedure. Wave propagation in different directions is studied while calculating the velocities in different soil domain. For investigating the above-mentioned objectives, we used newly developed numerical model, viz., Applied Element Method and compared our results with Finite Element Method (FEM).

Abstract

Earthquake problems in India need no introduction. Some of the great earthquakes of the world occurred in India and neighborhood areas. During past two decades, India has witnessed 7 moderate earthquakes which caused large number of casualties and innumerable property loss. Most of these losses are due to poor quality of construction and generally low level of awareness of the earthquake hazard prevalent in the country. In this regard, there is a need for coordinated and sustained effort towards earthquake risk reduction in the country. This can be achieved through education and awareness building.

Abstract

This paper present detailed seismic hazard assessment of the peninsular india which is considered to be seismically most stable landmasses of the indian plate. Past seismic history in this region clearly shows that the seismicity of the area is varying. There were more than five damaging earthquakes with magnitude greater than 6 have occurred in this region stressing the importance of detailed seismic hazard assessment for the region.

Abstract

This paper presents the detailed seismic hazard assessment of the peninsular India (lat. 8°-28°N and long. 67.5°-90°E) which is considered to be seismically most stable landmasses of the Indian plate. Past seismic history in this region (Koyna, 10 December 1967; Bhadrachalam, 13 April 1969; Broach, 23 March 1970; Hyderabad, 30 June 1983; Latur, 30 September 1993; Jabalpur, 22 May 1997; Bhuj, 26 January 2001 etc) clearly shows that the seismicity of the area is varying. There were more than five damaging earthquakes with magnitudes greater than Mw 6.0 have occurred in this region, stressing the importance of detailed seismic hazard assessment for the region. For India, Bhatia et al. (1999) published a probabilistic seismic hazard map based on several well identified and prominent source zones in the country. An attempt has been made in this paper to study the present seismic status of this region incorporating the seismicity, tectonic and geological characteristics and using the collected earthquake data Peak Ground Acceleration was estimated using the attenuation relation developed by Iyengar and Raghukanth (2004). Estimated PGA values were used to compute the deviation with respect to assigned PGA values for various regions provided in Indian Standard code IS 1893:2002. The results show that, the estimated PGA in many areas of the Peninsular India is more than the specified value in the current seismic macrozonation map of the country. This provides an important basis for attempting the detailed microzonation of an area within the Penisular India.

Abstract

This paper presents the detailed seismic hazard assessment of the peninsular India (lat. 8°-28°N and long. 67.5°-90°E) which is considered to be seismically most stable landmasses of the Indian plate. Past seismic history in this region (Koyna, 10 December 1967; Bhadrachalam, 13 April 1969; Broach, 23 March 1970; Hyderabad, 30 June 1983; Latur, 30 September 1993; Jabalpur, 22 May 1997; Bhuj, 26 January 2001 etc) clearly shows that the seismicity of the area is varying. There were more than five damaging earthquakes with magnitudes greater than Mw 6.0 have occurred in this region, stressing the importance of detailed seismic hazard assessment for the region. For India, Bhatia et al. (1999) published a probabilistic seismic hazard map based on several well identified and prominent source zones in the country. An attempt has been made in this paper to study the present seismic status of this region incorporating the seismicity, tectonic and geological characteristics and using the collected earthquake data Peak Ground Acceleration was estimated using the attenuation relation developed by Iyengar and Raghukanth (2004). Estimated PGA values were used to compute the deviation with respect to assigned PGA values for various regions provided in Indian Standard code IS 1893:2002. The results show that, the estimated PGA in many areas of the Peninsular India is more than the specified value in the current seismic macrozonation map of the country. This provides an important basis for attempting the detailed microzonation of an area within the Penisular India

Abstract

In environments with identical features, the global localization of a robot, might result in multiple hypotheses of its location. If the situation is extrapolated to multiple robots, it results in multiple hypotheses for multiple robots. The localization is facilitated if the robots are actively guided towards locations where it can use other robots as well as obstacles to localize itself. This paper aims at presenting a learning technique for the above process of active localization of multiple robots by co-operation. An MDP framework is used for learning the task, over a semi-decentralized team of robots hereby maintaining a bounded complexity as opposed to various multi-agent learning techniques, which scale exponentially with the increase in the number of robots.