Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Rahman, Muntasir Raihan"'
Autor:
Liu, Si, Ganhotra, Jatin, Rahman, Muntasir Raihan, Nguyen, Son, Gupta, Indranil, Meseguer, José
Publikováno v:
Leibniz Transactions on Embedded Systems, Vol 4, Iss 1, Pp 03:1-03:26 (2017)
The promise of high scalability and availability has prompted many companies to replace traditional relational database management systems (RDBMS) with NoSQL key-value stores. This comes at the cost of relaxed consistency guarantees: key-value stores
Externí odkaz:
https://doaj.org/article/7d16402990b14d9d88cdebda4ebc7fe8
Federated learning is a promising framework for learning over decentralized data spanning multiple regions. This approach avoids expensive central training data aggregation cost and can improve privacy because distributed sites do not have to reveal
Externí odkaz:
http://arxiv.org/abs/2012.07183
Efficient network slicing is vital to deal with the highly variable and dynamic characteristics of network traffic generated by a varied range of applications. The problem is made more challenging with the advent of new technologies such as 5G and ne
Externí odkaz:
http://arxiv.org/abs/1908.03242
Autor:
Pek, Edgar, Garg, Pranav, Rahman, Muntasir Raihan, Palmskog, Karl, Gupta, Indranil, Madhusudan, P.
Production distributed systems are challenging to formally verify, in particular when they are based on distributed protocols that are not rigorously described or fully understood. In this paper, we derive models and properties for two core distribut
Externí odkaz:
http://arxiv.org/abs/1712.10056
Autor:
Rahman, Muntasir Raihan
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respec
Externí odkaz:
http://hdl.handle.net/10012/5168
The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first present and prove two CAP-like impossibility theorems. To state these theorems, we present probabilistic models to characterize the three imp
Externí odkaz:
http://arxiv.org/abs/1509.02464
Large-scale key-value storage systems sacrifice consistency in the interest of dependability (i.e., partition tolerance and availability), as well as performance (i.e., latency). Such systems provide eventual consistency,which---to this point---has b
Externí odkaz:
http://arxiv.org/abs/1211.4290
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
INFOCOMP Journal of Computer Science; Vol. 7 No. 2 (2008): June, 2008; 21-25
INFOCOMP: Jornal de Ciência da Computação
Universidade Federal de Lavras (UFLA)
instacron:UFLA
INFOCOMP: Jornal de Ciência da Computação
Universidade Federal de Lavras (UFLA)
instacron:UFLA
An edge-ranking of a graph G is a labeling of the edges of G with positive integers such that every path between two edges with the same label ° contains an edge with label ¸ > °. In the on-line edge-ranking model the edges e1; e2 : : : ; em arriv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::a8f749f4088a8a0ca7dfdc92914ea5e3
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/213
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/213
Publikováno v:
ACM Transactions on Autonomous & Adaptive Systems; Jan2017, Vol. 11 Issue 4, p20:1-20:36, 36p