The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In scalable storage systems, there are two kinds of methods for data redundancy: mirroring and parity. Each has its pros and cons. Mirroring creates a large amount of redundancy data, resulting in less usable space. Write performance degrades proportionally to the redundancy level due to an increase in communication. Parity-based methods partition data into multiple pieces, add parity information,...
This paper investigates resource allocation algorithms that use limited communication - where the supplier of a resource broadcasts a coordinating signal using one bit of information to users per iteration. Rather than relay anticipated consumption to the supplier, the users locally compute their allocation, while the supplier measures the total resource consumption. Since the users do not compare...
In the present time, the Research and industry are showing more interest in Vehicular Networks. Vehicular Network is providing the Road Safety, Security, traffic monitoring, comfort driving types of applications for person safety. It is the essential point that the servers which are using for safety not give any drawback and problem. For proper communication, it is essential that the communication...
This paper generalizes the piggybacking constructions for distributed storage systems by considering various protected instances and piggybacked instances. Analysis demonstrates that the proportion of protected instances determines the average repair bandwidth for a systematic node. The generalized codes cost much less repair bandwidth than the previous piggybacking codes by optimizing the proportion...
International Data Company (IDC) has estimated the total amount of digital data stored in the world will reach 40 thousand Exabytes at the end of 2020. The idea of accessing this volume of data, anywhere at any time by exploiting commodity hardware, led to the introduction of cloud storage. The abounded rate and variety of failures in the equipment used in cloud storage systems, placed fault tolerance,...
We study the data reliability problem for a community of devices forming a mobile cloud storage system. We consider the application of regenerating codes for maintaining a file within a geographically-limited area. Such codes require lower bandwidth to regenerate lost data fragments compared to file replication or reconstruction. We investigate threshold-based repair strategies where data repair is...
Real-time video communications has been incorporated into many instant communication tools such as ichat, Skype, QQ, etc. Real-time video communications has low delivery delay requirement, which imposes great challenge to the provisioning of such services. To address this problem, in this paper, we propose a selective redundant transmission mechanism to support real-time streaming on multi-interface...
As faster storage devices become commercially viable alternatives to disk drives, the network is increasingly becoming the bottleneck in achieving good performance in distributed storage systems. This is especially true for erasure coded storage, where the reconstruction of lost data can significantly encumber the system. Thus, a significant amount of research has focused on reducing the amount of...
FlexRay has been taken as the next generation protocol of automotive network and has been applied to the safety critical control systems in vehicle. Frame packing is one of key problems in the design of vehicular communication because it directly relates to communication reliability and network utilization. In this paper, the transmission reliability and the slot utilization are defined for FlexRay...
Network coding is becoming a very important technology to improve the reconstructing performance of distributed storage systems due to its high reliability and low redundancy. Update is a typical and important operation involved in the network-coding-based systems. However, the overhead incurred by the update operation has a significant impact on the system performance. Traditionally, the small updated...
With the development of Ultra-High-Definition video, the power consumed by accessing reference frames in the external DRAM has become the bottleneck for the portable video encoding system design. To reduce the dynamic power of DRAM, a lossy frame memory recompression algorithm is proposed. The compression algorithm is composed of a content-aware adaptive quantization, a multi-mode directional prediction,...
This paper presents a new scalable coding (SC) algorithm considering the properties of human visual system (HVS), especially the importance of structures and saliencies for visual perception. The proposed method first finds the salient regions in an image and then applies structure preserving filter to the regions excluding the saliencies. This image is encoded with a pre-specified quantization parameter...
With the development of telecommunication technology over the last decades, the request for digital information compression has increased dramatically. In many applications, such as high quality audio transmission and storage, the target is to achieve audio and speech signal codings at the lowest possible data rates, in order to offer cheaper costs in terms of transmission and storage. Recently, compression...
In this paper, we propose a Fragmentation-based Multipath Routing (FMR) model for Software Defined Networks (SDNs) to enable attack-resilient data transfer. With the use of erasure encoding to fragment a message, the fragments are routed along multiple paths such that no intermediate node receives enough fragments required for message decoding. This ensures that, any intruder on a compromised node...
In volatile network environments, node connectivity and availability changes rapidly. This poses a challenge to efficient repair of failed nodes in distributed storage with erasure-correcting code. The commonly considered bandwidth-efficient data regenerating schemes either rely on availability of specific storage nodes in the network, or require a substantial number of repair nodes. We propose a...
In this paper, we demonstrate a coded computing framework, named Coded Distributed Computing (CDC), which optimally trades extra computation resources for communication bandwidth in a MapReduce-type distributed computing environment. We also empirically illustrate the practical impact of CDC by analyzing the performance of a distributed sorting algorithm, named CodedTeraSort, which was developed by...
Compression is desirable for network applications as it saves bandwidth. Differently, when data is compressed before being encrypted, the amount of compression leaks information about the amount of redundancy in the plaintext. This side channel has led to the “Browser Reconnaissance and Exfiltration via Adaptive Compression of Hypertext (BREACH)” attack on web traffic protected by the TLS protocol...
This paper presents a new encoding and corresponding decoding scheme to reduce crosstalk on a high-speed parallel bus. The scheme is based on a modified Fibonacci sequence and is introduced along with potential benefits in some upcoming memory interfaces. The scheme provides appreciable eye opening for interfaces dominated by crosstalk such as existing memory interfaces.
Distributed storage systems (DSSs) can provide reliable access to data over individually unreliable nodes for a long period of time. Regenerating codes (RCs) are efficient at both storage and repair bandwidth, and thus are regarded as a promising option for DSSs. In this paper, the generalized RCs (GRCs) are considered, which possess the relaxed conditions on reconstruction sets and regeneration sets...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.