Author image not provided
 Maysam Yabandeh

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.29
Citation Count88
Publication count14
Publication years2007-2015
Available for download5
Average downloads per article640.00
Downloads (cumulative)3,200
Downloads (12 Months)316
Downloads (6 Weeks)34
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


14 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 14 of 14
Sort by:

1 published by ACM
May 2015 SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 13,   Downloads (12 Months): 155,   Downloads (Overall): 932

Full text available: PDFPDF
Web sites, social networks, sensors, and scientific experiments currently generate massive amounts of data. Owners of this data strive to obtain insights from it, often by applying machine learning algorithms. Many machine learning algorithms, however, do not scale well to cope with the ever increasing volumes of data. To address ...
Keywords: high-dimensional pca, sparse pca, hadoop, principal component analysis, scalable machine learning, spark pca

2 published by ACM
December 2014 Middleware '14: Proceedings of the 15th International Middleware Conference
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 30,   Downloads (Overall): 188

Full text available: PDFPDF
Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency among replicas through a message-passing based agreement protocol. In this paper, we ...
Keywords: multicore, consensus, message passing, scalability

3 published by ACM
April 2012 EuroSys '12: Proceedings of the 7th ACM european conference on Computer Systems
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 10,   Downloads (12 Months): 97,   Downloads (Overall): 845

Full text available: PDFPDF
The support for transactions is an essential part of a database management system (DBMS). Without this support, the developers are burdened with ensuring atomic execution of a transaction despite failures as well as concurrent accesses to the database by other transactions. Ideally, a transactional system provides serializability, which means that ...
Keywords: distributed data stores, read-write conflict, write-write conflict, lock-free transactional support, serializability, snapshot isolation, transactions, HBase, key-value stores

4
October 2011 SRDS '11: Proceedings of the 2011 IEEE 30th International Symposium on Reliable Distributed Systems
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

It is notoriously hard to develop dependable distributed systems. This is partly due to the difficulties in foreseeing various corner cases and failure scenarios while implementing a system that will be deployed over an asynchronous network. In contrast, reasoning about the desired distributed system behavior and the corresponding invariants is ...

5
June 2011 DSNW '11: Proceedings of the 2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5

In this paper, we introduce ReTSO, a reliable and efficient design for transactional support in large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations of a transaction read a consistent snapshot of the data stored. The centralized scheme of ReTSO ...

6
March 2011 NSDI'11: Proceedings of the 8th USENIX conference on Networked systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 7

Current approaches to model checking distributed systems reduce the problem to that of model checking centralized systems: global states involving all nodes and communication links are systematically explored. The frequent changes in the network element of the global states lead however to a rapid state explosion and make it impossible ...

7 published by ACM
August 2010 ACM Transactions on Computer Systems (TOCS): Volume 28 Issue 1, March 2010
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 7,   Downloads (12 Months): 24,   Downloads (Overall): 983

Full text available: PDFPDF
We propose a new approach for developing and deploying distributed systems, in which nodes predict distributed consequences of their actions and use this information to detect and avoid errors. Each node continuously runs a state exploration algorithm on a recent consistent snapshot of its neighborhood and predicts possible future violations ...
Keywords: Distributed systems, execution steering, reliability, enforcing safety properties, consequence prediction

8 published by ACM
July 2010 LADIS '10: Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 3,   Downloads (12 Months): 10,   Downloads (Overall): 252

Full text available: PdfPdf
Byzantine fault tolerant (BFT) protocols are replication-based solutions to the problem of tolerating the arbitrary failures of software and hardware components. The essential assumption for replication is independence of failures. In this paper, we categorize four different failure independence levels that could be obtained from the cloud. Not surprisingly, providing ...
Keywords: fault independence, Byzantine fault tolerance, consensus, BFT, cloud computing

9
January 2010
Bibliometrics:
Citation Count: 0

Having multiple network interfaces or gateways available, the Internet users can transfer their data through multiple paths to achieve load balancing, fault-tolerance, and more aggregate bandwidth. However, transferring the packets of the same flow over multiple paths with diverse delays could introduce reordering among the received packets at the destination. ...

10
May 2009 HotOS'09: Proceedings of the 12th conference on Hot topics in operating systems
Publisher: USENIX Association
Bibliometrics:
Citation Count: 1

Distributed systems are difficult to design and develop. The difficulties arise both in basic safety correctness properties, as well as in achieving high performance. As a result of this complexity, the implementation of a distributed system often contains the basic algorithm coupled with an embedded strategy for making choices, such ...

11
April 2009 NSDI'09: Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 43

We propose a new approach for developing and deploying distributed systems, in which nodes predict distributed consequences of their actions, and use this information to detect and avoid errors. Each node continuously runs a state exploration algorithm on a recent consistent snapshot of its neighborhood and predicts possible future violations ...

12
November 2007 Computer Communications: Volume 30 Issue 17, November 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 6

One major drawback of multipath transferring schemes inspired by usage of different paths with diverse delays is the emergence of reordering among packets of the same flow. In this paper, we present two separate approaches to resolve this problem for UDP and TCP connections. By properly scheduling the packets among ...
Keywords: Delay, Multimedia communication, Multipath transferring, Reordering, Transport protocols

13
April 2007 ICN '07: Proceedings of the Sixth International Conference on Networking
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

Anonymous communication methods, try to prevent traffic analysis attacks by hiding nodes' identities from outside observers. As a result, adversaries can not find any correlation between observed traffic patterns and nodes' real information. In this paper, we have introduced PseudoAODV protocol in which origin identifiers of nodes are replaced by ...
Keywords: MANET, Security, Privacy, Anonymity, Pseudonimity.

14
March 2007 Cybernetics and Systems: Volume 38 Issue 3, March 2007
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0

The term multipath routing means using multiple paths concurrently to transport data over network. The main problem of this routing scheme is the difference among the delays of selected paths, which causes reordering of a single flow's packets. In this paper, this problem is analyzed through a sociological perspective. We ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us