Abstract: In order to reduce write tail latency, a storage system generates redundant write requests when performing a storage operation for an object. The storage operation is determined to be effectively complete when a minimum number of write requests have completed. For example, the storage system may generate twelve write requests and also generate four redundant write requests for a total of sixteen write requests. The storage system considers the object successfully stored once twelve of the sixteen writes complete successfully. To generate the redundant writes, the storage system may use replication or erasure coding. For replication, the storage system may issue a redundant write request for each of n chunks being written. For erasure coding, the storage system may use rateless codes which can generate unlimited number of parity chunks or use an n+k+k? erasure code which generates an additional k? encoded chunks, in place of an n+k erasure code.

Abstract: In order to reduce write tail latency, a storage system generates redundant write requests when performing a storage operation for an object. The storage operation is determined to be effectively complete when a minimum number of write requests have completed. For example, the storage system may generate twelve write requests and also generate four redundant write requests for a total of sixteen write requests. The storage system considers the object successfully stored once twelve of the sixteen writes complete successfully. To generate the redundant writes, the storage system may use replication or erasure coding. For replication, the storage system may issue a redundant write request for each of n chunks being written. For erasure coding, the storage system may use rateless codes which can generate unlimited number of parity chunks or use an n+k+k? erasure code which generates an additional k? encoded chunks, in place of an n+k erasure code.

Abstract: In order to reduce write tail latency, a storage system generates redundant write requests when performing a storage operation for an object. The storage operation is determined to be effectively complete when a minimum number of write requests have completed. For example, the storage system may generate twelve write requests and also generate four redundant write requests for a total of sixteen write requests. The storage system considers the object successfully stored once twelve of the sixteen writes complete successfully. To generate the redundant writes, the storage system may use replication or erasure coding. For replication, the storage system may issue a redundant write request for each of n chunks being written. For erasure coding, the storage system may use rateless codes which can generate unlimited number of parity chunks or use an n+k+k' erasure code which generates an additional k encoded chunks, in place of an n+k erasure code.

Abstract: Exemplary embodiments described herein permit classification of a new mobile user in a communication network based on demographics associated with the new mobile user. The demographics may include all or any of age, income, occupation, frequency of mobile usage, time of mobile usage, and type of mobile usage associated with the mobile users. In an exemplary implementations described herein, the method of classification may include representing, for a sample set of mobile users, each mobile user by a node and mobile usage between two nodes by an edge connecting the two nodes. The method may further include forming one or more communities of nodes based on increasing modularity. Modularity is a measure of how closely two nodes or communities are connected. The method also includes identifying a plurality of subunits by splitting each of the one or more communities based on articulation point determination.