Distributed Transaction Management, Fall 2002 Unconventional transactions Jyrki Nummenmaa

Slides:



Advertisements
Similar presentations
University of Tampere, CS Department Distributed Transaction Management Jyrki Nummenmaa
Advertisements

Cryptography and Network Security 2 nd Edition by William Stallings Note: Lecture slides by Lawrie Brown and Henric Johnson, Modified by Andrew Yang.
A Few Slides on TIP (Transaction Internet Protocol)
Implementing A Simple Storage Case Consider a simple case for distributed storage – I want to back up files from machine A on machine B Avoids many tricky.
1 Fault-Tolerance Techniques for Mobile Agent Systems Prepared by: Wong Tsz Yeung Date: 11/5/2001.
Nummenmaa & Thanish: Practical Distributed Commit in Modern Environments PDCS’01 PRACTICAL DISTRIBUTED COMMIT IN MODERN ENVIRONMENTS by Jyrki Nummenmaa.
Distributed Transaction Management, Fall 2002Lecture 2 / Distributed Deadlock Management Jyrki Nummenmaa
Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.
Advanced Database Systems September 2013 Dr. Fatemeh Ahmadi-Abkenari 1.
Department of Information Engineering1 Major Concerns in Electronic Commerce Authentication –there must be proof of identity of the parties in an electronic.
Replicating Basic Components Bettina Kemme McGill University, Montreal, Canada.
Distributed Locking. Distributed Locking (No Replication) Assumptions Lock tables are managed by individual sites. The component of a transaction at a.
Lecture III : Communication Security, Services & Mechanisms Internet Security: Principles & Practices John K. Zao, PhD SMIEEE National Chiao-Tung University.
CS 582 / CMPE 481 Distributed Systems
Class on Security Raghu. Current state of Security Cracks appear all the time Band Aid solutions Applications are not designed properly OS designs are.
Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.
Faculty of Electrical Engineering, Technion DSN 2004 Gal Badishi Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based.
PGP An example of Public Key Encryption software.
Transactions or Concurrency Control. Introduction A program which operates on a DB performs 2 kinds of operations: –Access to the Database (Read/Write)
Transactions. Definitions Transaction (program): A series of Read/Write operations on items in a Database. Example: Transaction 1 Read(C) Read(A) Write(A)
1 Distributed Databases Chapter What is a Distributed Database? Database whose relations reside on different sites Database some of whose relations.
Faculty of Electrical Engineering, Technion DSN 2004 Gal Badishi Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based.
1 More on Distributed Coordination. 2 Who’s in charge? Let’s have an Election. Many algorithms require a coordinator. What happens when the coordinator.
Managing Concurrency in Web Applications. DBI 2007 HUJI-CS 2 Intersection of Concurrent Accesses A fundamental property of Web sites: Concurrent accesses.
Financial Transactions on Internet Financial transactions require the cooperation of more than two parties. Transaction must be very low cost so that small.
Service Oriented Architecture Master of Information System Management Service Oriented Architecture Lecture 9 Notes from: Web Services & Contemporary.
Distributed Deadlocks and Transaction Recovery.
AQA Computing A2 © Nelson Thornes 2009 Section Unit 3 Section 6.4: Internet Security Digital Signatures and Certificates.
Chris Olston, cs294-7, Spring Atomicity in Electronic Commerce J. D. Tygar -- UCB presented by Chris Olston.
Distributed Commit Dr. Yingwu Zhu. Failures in a distributed system Consistency requires agreement among multiple servers – Is transaction X committed?
CS162 Section Lecture 10 Slides based from Lecture and
Distributed Systems Risks and how to tackle them.
Distributed Txn Management, 2003Lecture 3 / Distributed Transaction Management – 2003 Jyrki Nummenmaa
Network Security Lecture 26 Presented by: Dr. Munam Ali Shah.
Distributed Txn Management, 2003Lecture 6 / Distributed Transaction Management – 2003 Jyrki Nummenmaa
1cs Intersection of Concurrent Accesses A fundamental property of Web sites: Concurrent accesses by multiple users Concurrent accesses intersect.
Distributed Transactions Chapter 13
Distributed Txn Management, 2003Lecture 4 / Distributed Transaction Management – 2003 Jyrki Nummenmaa
CS551 - Lecture 18 1 CS551 Object Oriented Middleware (VII) Advanced Topics (Chap of EDO) Yugi Lee STB #555 (816)
Distributed Txn Management, 2003Lecture 1 / Distributed Transaction Management – 2003 Jyrki Nummenmaa
Distributed Transaction Management, Fall 2002Lecture Distributed Commit Protocols Jyrki Nummenmaa
University of Tampere, CS Department Distributed Commit.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Identity Proofing, Signatures, & Encryption in Direct esMD Author of Record Workgroup John Hall Coordinator, Direct Project June 13, 2012.
TIP: Transaction Internet Protocol n Proposed as an Internet Standard. Backed by Microsoft and Tandem.Backed by Microsoft and Tandem. n Heterogeneous Transaction.
E-voting Bringing the voting process to the technology age.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
CSC 240 (Blum)1 Database Transactions. CSC 240 (Blum)2 Transaction  A transaction is an interaction between a user (or application) and a database. A.
Distributed Transaction Management, Fall 2002Lecture 2 / Distributed Locking Jyrki Nummenmaa
9.2 SECURE CHANNELS JEJI RAMCHAND VEDULLAPALLI. Content Introduction Authentication Message Integrity and Confidentiality Secure Group Communications.
Topics in Distributed Databases Database System Implementation CSE 507 Some slides adapted from Navathe et. Al and Silberchatz et. Al.
Electronic Banking & Security Electronic Banking & Security.
SYSTEMS IMPLEMENTATION TECHNIQUES TRANSACTION PROCESSING DATABASE RECOVERY DATABASE SECURITY CONCURRENCY CONTROL.
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Distributed Databases – Advanced Concepts Chapter 25 in Textbook.
Unit 3 Section 6.4: Internet Security
Secure Sockets Layer (SSL)
Chapter 19: Distributed Databases
Database System Implementation CSE 507
Application layer Lecture 7.
9.2 SECURE CHANNELS Medisetty Swathy.
Outline Introduction Background Distributed DBMS Architecture
Outline Announcements Fault Tolerance.
EEC 688/788 Secure and Dependable Computing
X-Road as a Platform to Exchange MyData
CONCURRENCY Concurrency is the tendency for different tasks to happen at the same time in a system ( mostly interacting with each other ) .   Parallel.
Chapter 5 Computer Security
Presentation transcript:

Distributed Transaction Management, Fall 2002 Unconventional transactions Jyrki Nummenmaa

Distributed Transaction Management, Fall 2002 Motivation n Transactions managing design data can be very long, as the design progresses slowly. n Business transactions may progress slowly, as they may involve exchange of electronic documents between companies.

Distributed Transaction Management, Fall 2002 Traditional TP for long txns? n Traditional transaction processing may not be appropriate, as l items may get locked for too long, l global commit or rollback may not be feasible, and l global recovery may not be feasible

Distributed Transaction Management, Fall 2002 Hierarchical transactions n One approach to solving these problems is to divide the transactions into parts hierarchically. l Each part will be committed separately. l The hierarhical division is, of course, fundamentally different from just distribution. l The transactions in the hierarchy may be distributed or centralised.

Distributed Transaction Management, Fall 2002 Hierarchical transaction commit n Principle: a transaction in the hierarchy can be committed, when all of its sub-parts have been committed. n Sub-parts are committed as their work is done. n This way, locking will be less problematic, as locks are released as part-transactions commit.

Distributed Transaction Management, Fall 2002 Problematic rollback n If all goes well (all transactions in the hierarhcy commit) n What happens, if there is a need to rollback, and some part-transactions have already been committed? n We need some way to manage with the already committed part-transactions.

Distributed Transaction Management, Fall 2002 Simple rollback is not possible n Suppose that one part-transaction in the hierarchy needs to rollback, while some other part-transaction has already committed. n Simple rollback does not necessarily do, as committed transactions may have some side-effects.

Distributed Transaction Management, Fall 2002 Restarting the part-transaction n If it is possible to re-start the initially failed part-transaction, then the problem of rolling back the already committed disappears. n This may not be always possible, but should, of course, be done whenever possible.

Distributed Transaction Management, Fall 2002 Compensating transactions n One possibility to roll back an already committed (part-)transaction is to use a compensating transaction. n A compensating transaction somehow negates the effects of the original transaction.

Distributed Transaction Management, Fall 2002 What cannot be compensated n Examples: l money given from a cashline machine l a money transfer to a bank account l an access given and already used l an electronic document/program downloaded or sent

Distributed Transaction Management, Fall 2002 The previous slide was not exactly true... n Although the compensation can not be done automatically, there may be ways to do it through electronic or manual document or message exhange. n This is particularly true for business-to- business transactions between trusted partners.

Distributed Transaction Management, Fall 2002 Alternative continuations n In some application fields it may be possible to continue the transaction in some other way, if the first way does not work out, without having to roll back the all or some parts of the transaction. n If some part of a business transaction leads to failure, there may be another equally possible way to do it.

Distributed Transaction Management, Fall 2002 Technology for distributed txn management n Java2EE and Microsoft have their own technologies available for middleware implementation. n You can use an API to make a participant and use the coordinator provided by J2EE/Microsoft. n TIP is yet another possibility – but has not been a success.

Distributed Transaction Management, Fall 2002 Why this is not enough? n These technologies do not support the hierarchical transaction management. n The companies like to have the control over their transactions. n TIP supports heterogeneous environments, but is vulnerable to failure and attacks.

Distributed Transaction Management, Fall 2002 Problems to solve with TIP-like solutions n Security n Trust n Denial-of-service attacks n Recovery, when the protocol fouls up.

Distributed Transaction Management, Fall 2002 TIP – denial of service attacks n PULL-based: l A rogue company that knows the transaction ID sends a PULL to a site then close the connection. n PUSH-based l Flood a sites with PUSHes so that it cannot service legitimate requests. n If a site loses its connection to its superior, the rogue sites sends it a RECONNECT command and tells it the wrong result of the commit.

Distributed Transaction Management, Fall 2002 TIP – repudiation n Interaction of 2PC and authenticated protocol messages l The semantics of the authenticated messages only apply if the txn is committed. n If a message from A to B is part of a 2PC protocol, then B’s possession of the digital signature proves nothing. l A can claim: Yes, that was sent, but the action was rolled back. l B must prove that the action was committed. B must also prove that the message was part of that txn.

Distributed Transaction Management, Fall 2002 Problems to solve with TIP-like solutions : security n It is possible to use Secure- HTTP/SSL/TLS with l encryption and l end-to-end authentication n This works for just security, but developments for trust and denial-of- service attack management will probably require changes here.

Distributed Transaction Management, Fall 2002 Problems to solve with TIP-like solutions : trust n If just about any company may participate in the transactions, then trust for the good will of the company is required. This, in particular has to do with denial-of-service attacks and non- repudiation. n Even if participation is limited to companies, whose good will we trust, we still need to trust their implementations.

Distributed Transaction Management, Fall 2002 Problems to solve with TIP-like solutions : ”manual” recovery n If the protocol fails and manual recover is necessary, then how will this be done in inter-company transactions? n In other words, operator intervention is needed when the commit protocol fouls up - how will this work on the Internet?

Distributed Transaction Management, Fall 2002 Brokerage companies / electronic marketplaces n It would seem from above that there is demand for electronic marketplaces or brokerage companies through which business is done. n Some such marketplaces have been implemented – they have been expensive and there is no evidence as yet that they will meet the expectations.

Distributed Transaction Management, Fall 2002 Current trend n Companies write their complicated business transactions in a way in which they manage their own transactions themselves instead of giving the control outside. n This means that in case of troublesome rollback situations, they have to use compensating – but not necessarily 100% automatic – transactions.