This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which ...
详细信息
ISBN:
(纸本)9781728150895
This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which uses Bloom filter-based signaling to inform servers about the name prefixes of available requests. For content retrieval, we propose in this paper a feedback-based cooperative protocol implementing network coding-based forwarding. The proposed network coding-based protocol provides a distributed solution to control the multi-session codeblock size, i.e., the number of variables that are combined into network coded packets, by setting a capacity constraint on each node and by piggybacking the available capacity as feedback on messages sent to neighbors. The network codes are decided using linear programming. We compare the proposed network coding-based protocol with push-based BFR [2] and pull-based BFR [1]. The results show that the proposed protocol outperforms both push-based BFR and pull-based BFR in terms of content discovery overhead and average content block retrieval delay.
Sorting extremely large datasets is a frequently occurring task in practice. These datasets are usually much larger than the computer's main memory;thus, external memory sorting algorithms, first introduced by Agg...
详细信息
Sorting extremely large datasets is a frequently occurring task in practice. These datasets are usually much larger than the computer's main memory;thus, external memory sorting algorithms, first introduced by Aggarwal and Vitter, are often used. The complexity of comparison-based external memory sorting has been understood for decades by now;however, the situation remains elusive if we assume the keys to be sorted are integers. In internal memory, one can sort a set of n integer keys of Theta(lg n) bits each in O(n) time using the classic Radix Sort algorithm;however, in external memory, there are no faster integer sorting algorithms known than the simple comparison-based ones. Whether such algorithms exist has remained a central open problem in external memory algorithms for more than three decades. In this paper, we present a tight conditional lower bound on the complexity of external memory sorting of integers. Our lower bound is based on a famous conjecture in network coding by Li and Li, who conjectured that network coding cannot help anything beyond the standard multicommodity flow rate in undirected graphs. The only previous work connecting the Li and Li conjecture to lower bounds for algorithms is due to Adler et al. Adler et al. indeed obtain relatively simple lower bounds for oblivious algorithms (the memory access pattern is fixed and independent of the input data). Unfortunately, obliviousness is a strong limitation, especially for integer sorting: we show that the Li and Li conjecture implies an Omega(n lg n) lower bound for internal memory oblivious sorting when the keys are Theta(lg n) bits. This is in sharp contrast to the classic (nonoblivious) Radix Sort algorithm. Indeed, going beyond obliviousness is highly nontrivial;we need to introduce several new methods and involved techniques, which are of their own interest, to obtain our tight lower bound for external memory integer sorting.
In existing wireless networks, path loss and signal interference have a negative impact on the user experience. network coding is a technique that brings higher throughput and more stable *** network coding based algo...
详细信息
ISBN:
(纸本)9781665439831
In existing wireless networks, path loss and signal interference have a negative impact on the user experience. network coding is a technique that brings higher throughput and more stable *** network coding based algorithms for end-to-end network performance is seldom addressed which might limit the opportunities applying network coding in reality. In this paper, we propose a network coding platform that consist of network Simulator 3 (ns-3) and a programmable switch (NetFPGA). The former is used to emulate a wireless network environment for an application while the latter is used to enhance the performance running the network coding based algorithms which are computationally intensive in realtime. We will demonstrate the usage of the proposed platform to evaluate the performance in terms of end-to-end throughput and latency in aWiFi network. Based on such platform, various computationally intensive algorithms can be further designed and investigated in different networks in the future.
In this paper, we propose a network coding (NC) enabled transmission strategy in the User Plane (UP) of mobile backhaul for networks operators. In the proposed method, NC provides robustness against the transport netw...
详细信息
ISBN:
(纸本)9783903176317
In this paper, we propose a network coding (NC) enabled transmission strategy in the User Plane (UP) of mobile backhaul for networks operators. In the proposed method, NC provides robustness against the transport network failures, so that there will not be any more processing for re-transmission by the User Equipment (UE) in comparison to traditional approaches where re-transmissions are performed by UE applications. Our simulation results indicate that an average 1% loss ratio in the backhaul link creates 59.44% additional total transmission time compared to normal standard GPRS Tunneling Protocol - User Plane (GTP-U) transmission. On the other hand, applying NC at 1% and 2% rates reduces this amount to 52.99% and 56.26% respectively, which is also better than the total transmission time performance of some previously studied dynamic replication schemes as keeping bandwidth utilization at low ratios. Moreover, we also observe a trade-off between total transmission time and NC rate related to expected packet loss ratio such that minimum total transmission time is obtained when NC rate is equal to expected packet loss rate.
Mobile ad-hoc networks (MANETs) have limited network resources, such as node battery capacity and wireless frequency band. Therefore, in such networks, it is particularly important to reduce unnecessary packet transfe...
详细信息
Images play an important part in our daily life. They convey our personal stories and maintain meaningful objects, events, emotions etc. People, therefore, mostly use images as visual information for their communicati...
详细信息
Wireless resources are limited, and the reliability of data transmission is increasingly demanded. With the progress of wireless technology, higher data rate is required, which leads to how to reliably improve the dat...
详细信息
5G new radio (NR) requires a very dense deployment of cellular infrastructure, which poses a great economical challenge if traditional fiber backhaul links are used. To cope with this problem, 3GPP introduced integrat...
详细信息
ISBN:
(纸本)9781728161242
5G new radio (NR) requires a very dense deployment of cellular infrastructure, which poses a great economical challenge if traditional fiber backhaul links are used. To cope with this problem, 3GPP introduced integrated access and backhaul (IAB), aiming to use wireless backhaul to provide high capacity and great deployment flexibility. The multi-hop and multi-route topology for this new type of access networks challenges the existing retransmission-/repetition-based reliability-enhancing technique, such as ARQ/HARQ and packet duplication. However, it also opens up new opportunities for novel reliability enhancement techniques. In this paper, taking advantage of the more complex network topology of IAB, we propose to use linear network coding as a potentially better solution to improve end-to-end latency and reliability. We discuss its placement in the IAB protocol stack, and propose two novel schemes to improve the performance of network coding in the IAB network: the rate-proportional traffic splitting scheme in the multi-route scenario, and the adaptive coded-forwarding scheme in the multi-hop scenario. Simulation results show that in some typical IAB scenarios our network coding solution has considerable performance gains over the existing repetition-based technology.
We study network coding gaps for the problem of makespan minimization of multiple unicasts. In this problem distinct packets at different nodes in a network need to be delivered to a destination specific to each packe...
详细信息
ISBN:
(纸本)9781728196213
We study network coding gaps for the problem of makespan minimization of multiple unicasts. In this problem distinct packets at different nodes in a network need to be delivered to a destination specific to each packet, as fast as possible. The network coding gap specifies how much coding packets together in a network can help compared to the more natural approach of routing. While makespan minimization using routing has been intensely studied for the multiple unicasts problem, no bounds on network coding gaps for this problem are known. We develop new techniques which allow us to upper bound the network coding gap for the makespan of k unicasts, proving this gap is at most polylogarithmic in k. Complementing this result, we show there exist instances of k unicasts for which this coding gap is polylogarithmic in k. Our results also hold for average completion time, and more generally any l(p) norm of completion times.
Vehicular ad-hoc networks play an important role in providing safety on the road. Vehicles generate and exchange emergency and control messages to avoid dangerous situations. According to IEEE 1609.4 standard, all the...
详细信息
Vehicular ad-hoc networks play an important role in providing safety on the road. Vehicles generate and exchange emergency and control messages to avoid dangerous situations. According to IEEE 1609.4 standard, all these messages share the same control channel interval even if the emergency messages are with a highest priority. Besides that, network's characteristics, such as vehicle density and high mobility, would make the diffusion of emergency messages a challenging task. Especially with the absence of acknowledgements and retransmission. network coding could be seen as a solution where a block of data packets could be sent on the same transmission process. Firstly, we analyze the messages' dissemination, and we propose a thoroughly model for success probability according to the emergency messages' generation probabilities. Further, we propose a new network coding access scheme. The emergency messages take the priority in the channel access and it could be retransmitted several times. Thus, the scheme deals with the emergency messages' loss and latency. NS-3 simulations show that our model increases emergency messages' reliability.
暂无评论