Dpcp (discard Past Consider Present) - A Novel Approach To Adaptive Fault Detection In Distributed Systems

Fault detection is a fundamental issue for fault tolerance in distributed systems. This paper presents the DPCP (Discard Past Consider Present) approach, that discards the last elapsed times of fault detection messages and considers only the current one. By this way, DPCP allows to perform a fast, accurated and scalable adaptive fault monitoring for asynchronous distributed systems. The scalability comes from the parameter Minimum-TimeUnit, that controls the minimum frequency of the fault monitoring messages. The fastness and accuracy of fault monitoring come from the changing of timeout and monitoring interval values as soon as the system workload and the Minimum TimeUnit allow. Some DPCP experiments on ACE+TAO were made to observe DPCP behavior on changing network workloads.7682Aguilera, M.K., Chen, W., Toueg, S., (1998) Failure Detection and Consensus in the Crash-Recovery Model, , Technical Report 98-1676, Department of Computer Science, Cornell UniversityChandra, T.D., Toueg, S., Unreliable failure detectors for reliable distributed systems (1996) Journal of the ACM, 43 (2), pp. 225-267Felber, P., (1998) The CORBA Object Group Service: A Service Approach to Object Groups in CORBA, , PhD thesis, École Polytechnique Fédérale de LausanneMacêdo, R.J.A., Failure detection in asynchronous distributed systems II Test and Fault Tolerance Workshop (II WTF 2000). Curitiba, Brazil, Jul. 2000, , http://www.lasid.ufba.br/public/artigos/Narasimhan, P., Moser, L.E., Melliar-Smith, P.M., Replica consistency of CORBA objects in partitionable distributed systems (1997) Distributed Systems Engineering, 4, pp. 139-150Natarajan, B., Gokhale, A., Schmidt, D.C., DOORS: Towards high-performance fault-tolerant CORBA Proceedings of the 2nd International Symposium on Distributed Objects and Applications (DOA '00). Antwerp, Belgium, Sept. 2000, OMG(2000) Fault Tolerant CORBA Specification, , Object Management GroupAprSchmidt, D.C., Douglas C. Schmidt's Welcome Page, , http://newport.ece.uci.edu/~schmidt/Sergent, N., Défago, X., Schiper, A., Failure detectors: Implementation issues and impact on consensus performance (1999), Technical Report SSC/1999/019. École Polytechnique Fédérale de LausanneSotoma, I., Madeira, E.R.M., ADAPTATION - Algorithms to ADAPTive FAulT MonItOriNg and their implementation on CORBA Proceedings IEEE of the 3rd International Symposium on Distributed Objects and Applications (DOA'01). Rome, Italy, Sep. 2001, , (accepted for publication

A Performance-oriented Adaptive Scheduler For Dependent Tasks On Grids

A scheduler must consider the heterogeneity and communication delays when scheduling dependent tasks on a grid. The task-scheduling problem is NP-Complete in general, which led us to the development of a heuristic for the associated optimization problem. In this work we present a dynamic adaptive approach to schedule dependent tasks onto a grid based on the Xavantes grid middleware. The developed dynamic approach is applied to the Path Clustering Heuristic, and introduces the concept of rounds, which take turns sending tasks to execution and evaluating the performance of the resources. The adaptive extension changes the size of rounds during the process execution, taking task attributes and resources performance as parameters, and it can be adopted in other task schedulers. The experiments show that the dynamic round-based and adaptive schedule can minimize the effects of performance losses while executing processes on the grid. Copyright © 2007 John Wiley & Sons, Ltd.20910291049Bittencourt, L.F., Madeira, E.R.M., Cicerre, F.R.L., Buzato, L.E., A path clustering heuristic for scheduling task graphs onto a grid (short paper) (2005) Proceedings of the 3rd ACM International Workshop on Middleware for Grid Computing, , Grenoble, FranceCicerre, F.R.L., Madeira, E.R.M., Buzato, L.E., A hierarchical process execution support for grid computing (2006) Concurrency and Computation: Practice and Experience, 18 (6), pp. 581-594Kwok, Y.-K., Ahmad, I., Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors (1996) IEEE Transactions on Parallel and Distributed Systems, 7 (5), pp. 506-521Yang T, Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems 19945(9):951-967Bajaj, R., Agrawal, D.R., Improving scheduling of tasks in a heterogeneous environment (2004) IEEE Transactions on Parallel and Distributed Systems, 15 (2), pp. 107-118Sakellariou, R., Zhao, H., A hybrid heuristic for DAG scheduling on heterogeneous systems (2004) Proceedings of the 13th Heterogeneous Computing Workshop, pp. 111-124. , IEEE Computer Society Press: Los Alamitos, CATopcuoglu, H., Hariri, S., Wu, M.-Y., Performance-effective and low-complexity task scheduling for heterogeneous computing (2002) IEEE Transactions on Parallel and Distributed Systems, 13 (3), pp. 260-274Hagras, T., Janeček, J., An approach to compile-time task scheduling in heterogeneous computing systems (2004) Proceedings of the 33rd International Conference on Parallel Processing Workshops, pp. 182-189. , IEEE Computer Society Press: Los Alamitos, CAFrey, J., Condor DAGMan: Handling inter-job dependencies, , http://www.cs.wisc.edu/condor/dagman, 25 July 2006Prodan, R., Fahringer, T., Dynamic scheduling of scientific workflow applications on the grid: A case study (2005) Proceedings of the 2005 ACM Symposium on Applied computing (SAC'05), pp. 687-694. , ACM Press: New YorkChen, H., Maheswaran, M., Distributed dynamic scheduling of composite tasks on grid computing systems (2002) Proceedings of the 11th IEEE Heterogeneous Computing Workshop, , Fort Lauderdale, U.S.ACooper, K., Dasgupta, A., Kennedy, K., Koelbel, C., Mandal, A., Marin, G., Mazina, M., Dongarra, J., New grid scheduling and rescheduling methods in the GrADS project (2004) Proceedings of the IPDPS Next Generation Software Program - NSFNGS - PI Workshop, pp. 199-206. , IEEE Computer Society Press: Los Alamitos, CAFujimoto, N., Hagihra, K., Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid (2003) Second International Symposium on Parallel and Distributed Computing, pp. 80-87. , Ljubljana, SloveniaWolski, R., Spring, N.T., Hayes, J., The network weather service: A distributed resource performance forecasting service for metacomputing (1999) Future Generation Computer Systems, 15 (5-6), pp. 757-76

A Context-aware Negotiation Model For M-commerce

The low prices and the friendly usage of the mobile devices are contributing to increase the number of people who are using them for several tasks, as to pay a bill in an Internet banking, purchase a product, connect to a close printer and so on. Due to this, it is necessary develop applications which can cope with these new user habits. This paper proposes a context-aware negotiation model for mobile commerce between two participants, using mobile agents and taking into account the mobile device personalization. The model copes with the context-aware concepts through the use of created profiles. With these profiles it is possible to automate some tasks depending on the context, as for example the user identity. © Springer-Verlag Berlin Heidelberg 2005.3744 LNCS230239Chavez, A., Maes, P., Kasbah: An agent marketplace for buying and selling goods (1996) First International Conference on the Practical Application of Intelligent Agents and Multi-agent Technology (PAAM'96), pp. 75-90. , London, England, AprilChen, G., Kotz, D., A survey of context-aware mobile computing research (2000) Technical Report, TR2000-381. , Dept. of Computer Science, Dartmouth College, NovemberKorkea-Aho, M., Context-aware Applications Survey, , http://www.hut.fi/mkorkeaa/doc/context-aware.htmlMatos, F.M., Madeira, E.R.M., An automated negotiation model for m-commerce using mobile agents (2003) Lecture Notes in Computer Science, 2722, pp. 72-75. , Proceedings of the International Conference on Web Engineering (ICWE 2003), Oviedo, Asturias, Spain, July. Springer-VerlagSchilit, B., Adams, N., Want, R., Context-aware computing applications (1994) IEEE Workshop on Mobile Computing Systems and Applications, , Santa Cruz, CA, USRahwan, I., Rahwan, T., Rahwan, T., Ashri, R., Agent-based support for mobile users using agentspeak(1) (2004) Lecture Notes in Artificial Intelligence, 3030, pp. 47-62. , Agent-Oriented Information Systems AAMAS-04 Workshop, New York, USA, JulyGu, D.Q.Z.T., Pung, H.K., Wang, X.H., A middleware for building context-aware mobile services (2004) Proceedings of IEEE Vehicular Technology Conference (VTC 2004), , Milan, Italy, MayTsalgatidou, A., Veijalainen, J., Pitoura, E., Challenges in mobile electronic commerce (2000) Proceedings of Lee 2000. Third Internacional Conference on Innovation Through E-commerce, pp. 169-174. , Manchester, England, Novembe

An Automated Negotiation Model For M-commerce Using Mobile Agents

This work proposes an automated negotiation model between two participants, for m-commerce, using mobile agents and considering the mobile device personalization through the use of profiles in the negotiation. © Springer-Verlag Berlin Heidelberg 2003.27227275Tsalgatidou, A., Veijalainen, J., Pitoura, E., Challenges in Mobile Electronic Commerce (2000) Proceedings of Iec 2000. Third Internacional Conference on Innovation Through E-Commerce, pp. 169-174. , Manchester EnglandUeyama, J., Madeira, E.R.M., An Automated Negotiation Model for Electronic Commerce (2001) Proceedings of the Fifth IEEE Internationl Symposium on Autonomous Decentralized Systems - ISADS'01, pp. 29-36. , Dallas US

A Dynamic Approach For Scheduling Dependent Tasks On The Xavantes Grid Middleware

A scheduler must consider the heterogeneity and communication delays when scheduling dependent tasks on a grid. The task scheduling problem is NP-Complete in general, what led us to the development of a heuristic for the associated optimization problem. In this work we present a dynamic approach to schedule dependent tasks onto a grid based on the Xavantes grid middleware. The developed dynamic approach is applied to the Path Clustering Heuristic (PCH), and introduces the concept of rounds, which take turns sending tasks to execution and evaluating the performance of the resources. The experiments show that the round-based dynamic schedule can minimize the effects of performance losses while executing processes on the grid. © 2006 ACM.1941186686Bajaj, R., Agrawal, D.P., Improving scheduling of tasks in a heterogeneous environment (2004) IEEE Trans. Parallel and Distributed Systems, 15 (2), pp. 107-118L. F. Bittencourt, E. R. M. Madeira, F. R. L. Cicerre, and L. E. Buzato. A path clustering heuristic for scheduling taks graphs onto a grid (short paper). In 3rd ACM International Workshop on Middleware for Grid Computing, Grenoble, France, nov 2005Cicerre, F.R.L., Madeira, E.R.M., Buzato, L.E., A hierarchical process execution support for grid computing (2006) Concurrency and Computation: Practice and Experience, 18 (6), pp. 581-594Cooper, K., Dasgupta, A., Kennedy, K., New grid scheduling and rescheduling methods in the grads project (2004) 18th International Parallel and Distributed Processing Symposium, , IEEE Computer SocietyFrey, J., DAGMan, C., (2002) Handling inter-job dependencies, , http://www.cs.wisc.edu/condor/dagmanFujimoto, N., Hagihara, K., Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid (2003) 2nd Intl. Symp. on Parallel and Distributed Computing, Slovenia, pp. 80-87. , IEEE, octHagras, T., Janeček, J., An approach to compile-time task scheduling in heterogeneous computing systems (2004) 33rd International Conference on Parallel Processing Workshops, pp. 182-189. , IEEE Computer SocietyKwok, Y.-K., Ahmad, I., Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors (1996) IEEE Trans. on Parallel and Distributed Systems, 7 (5), pp. 506-521Prodan, R., Fahringer, T., Dynamic scheduling of scientific workflow applications on the grid: A case study (2005) SAC '05: Proceedings of the 2005 ACM symposium on Applied computing, pp. 687-694. , New York, NY, USA, ACM PressTopcuoglu, H., Hariri, S., Wu, M.-Y., Performance-effective and low-complexity task scheduling for heterogeneous computing (2002) IEEE Trans. Parallel and Distributed Systems, 13 (3), pp. 260-274Wolski, R., Spring, N.T., Hayes, J., The network weather service: A distributed resource performance forecasting service for metacomputing (1999) Future Generation Computer Systems, 15 (5-6), pp. 757-76

A Scalable Link Quality Routing Protocol For Multi-radio Wireless Mesh Networks

Due to their installation and management simplicity, Wireless Mesh Networks (WMNs) have become a natural way to deliver wireless coverage for local, campus and metropolitan areas. In order to provide backhaul support, it is necessary to enhance the capacity of WMNs. In this paper, a scalable link quality routing protocol for multi-radio WMNs is proposed. We incorporate a local link quality metric and multi-radio support in the OLSR (Optimized Link State Routing) protocol. This simple and scalable approach helps to find shortest paths with better quality. Simulations were conducted and the results showed expressive performance improvements of the proposed protocol over the original OLSR, with a minimum overhead increase.10531058IEEE 802.15 WPAN™ Task Group 5, , http://www.ieee802.org/15/pub/TG5.html, AvailableIEEE 802.11s TG, Status of Project IEEE 802.11s "ESS Mesh Networking", , http://grouper.ieee.org/groups/802/11/Reports/tgs_update.htm, AvailableIEEE 802.16's Relay Task Group, , http://grouper.ieee.org/groups/802/16/relay/index.html, AvailableWaharte, S., Boutaba, R., Iraqui, Y., Ishibashi, B., Routing protocols in wireless mesh networks: Challenges and design considerations (2006) Multimedia Tools and Applications, 29 (3), pp. 285-303. , Springer Netherlands, JunGupta, P., Kumar, P.R., The capacity of wireless networks (2000) IEEE Trans. Information Theory, 46, pp. 388-404. , MarGong, M.X., Midkiff, S.F., Mao, S., A cross-layer approach to channel assignment in wireless ad hoc networks (2007) Mobile Networks and Applications, 12, pp. 43-56. , JanKyasanur, P., Vaidya, N.H., Routing and interface assignment in multi-channel multi-interfece wireless networks (2005) IEEE WCNC, 4, pp. 2051-2056. , New Orleans, USA, MarY. Qu, C.-H. Lung, and A. Srinivasan, Multi-channel OLSR with dedicated control interface, in SPECTS, Calgary, Canada, Jul-Aug. 2006Raniwala, A., Chiueh, T., Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network (2005) IEEE Infocom, pp. 2223-2234. , Miami, USA, MarAlicherry, M., Bathia, R., Li, L., Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks (2005) ACM Mobicom, pp. 58-72. , Cologne, Germany, pp, Aug-SeptAkyildiz, I.F., Wang, X., Wang, W., Wireless mesh networks: A survey (2005) Computer Networks Journal (Elsevier), 47 (4), pp. 445-487. , MarKyasanur, P., Vaidya, N.H., Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks (2006) ACM Mobile Computing and Communications Review, 10, pp. 31-43. , JanClausen, T., Jacquet, P., (2003) Optimized link state routing protocol (OLSR), , IETF RFC 3626, Oct(1999) IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE 802.11 WG, ISO/IEC 8802-11:1999, IEEE Std. 802.11(2004) IEEE Standard for Local and Metropolitan Area Networks - Part 16: Air Interface for Fixed Broadband Wireless Access Systems, IEEE Std. 802.16-2004Ogier, R., Templin, F., Lewis, M., (2004) Topology dissemination based on reverse-path forwarding (TBRPF), , IETFRFC 3684, FebPerkins, C., Belding-Royer, E., Das, S., (2003) Ad hoc on-demand distance vector (AODV) Routing, , IETF RFC 3561, JulJohnson, D.B., Maltz, D.A., Hu, Y., The dynamic source routing protocol for mobile ad hoc networks (DSR) (2004) IETF Internet Draft, , JulCouto, D.S.J.D., Aguayo, D., Bicket, J., Morris, R., A high throughput path metric for multi-hop wireless routing (2003) ACM Mobicom, pp. 419-434. , San Diego, USA, pp, SeptDraves, R., Padhye, J., Zill, B., Routing in multi-radio, multi-hop wireless mesh networks (2004) ACM Mobicom, pp. 114-128. , Philadelphia, USA, pp, Sept-OctYang, Y., Wang, J., Kravets, R., Designing routing metrics for mesh networks (2005) IEEE WiMesh, , Santa Clara, USA, SeptSubramanian, A.P., Buddkihot, M.M., Miller, S., Interference aware routing in multi-radio wireless mesh networks (2006) IEEE WiMesh, , Reston, USA, SeptM. Bahr, Proposed routing for IEEE 802.11s WLAN mesh networks, in WICON, Boston, USA, Aug. 2006OLSR implementation, , http://hipercom.inria.fr/OOLSR, Hipercom Project, INRIA, AvailableNetwork Simulator NS-2, , http://www.isi.edu/nsnam/ns, AvailableWireless mesh network solution, , http://products.nortel.com/go/solution_content.jsp?segld=0& parld=0&prod_id=47160&locale=en-US, AvailableCisco Systems, Outdoor wireless network solution. Available: http://www. ci sco. com/go/wirelessmeshBelAir, Networks, , http://www.belairnetworks.com, AvailableMicrosoft, Microsoft research mesh networks projetct, , http://research.microsoft.com/mesh, AvailableD. Passos, D. V. Teixeira, D. C. Muchaluat-Saade, L. C. S. Magalhães, and C. V. N. Albuquerque, Mesh network performance measurements, in I2TS, Cuiabá, Brazil, pp. 48-55, Dec. 2006Bicket, J., Aguayo, D., Biswas, S., Morris, R., Architecture and evaluation of an unplanned 802.1 lb mesh network (2005) ACM MobiCom, pp. 31-42. , Cologne, Germany, pp, Aug-Sep