Wireless networking is on the verge of boom these days. Many multinational companies are trading in spectrum to provide data and voice services over wireless and mobile space. This research paper is a comparison of va...
详细信息
ISBN:
(数字)9789811034336
ISBN:
(纸本)9789811034336;9789811034329
Wireless networking is on the verge of boom these days. Many multinational companies are trading in spectrum to provide data and voice services over wireless and mobile space. This research paper is a comparison of various network optimization as well as compression technologies for wireless network and mobile network. Asynchronous Transfer Mode (ATM), Genetic algorithms (GA) is compared. It is reviewed that how it can bring efficiency in the current wireless as well as mobile networking. This research paper also reviews loseless and lossy compression and its efficacy in wireless networking scenario. This research paper provides reader a fair and honest view of current compression and speed optimization technologies, so that reader could get an insight of wireless network scenario in the prevailing conditions.
There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms...
详细信息
ISBN:
(纸本)9781728108933
There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms on the privacy protection level and the network lifetime performance. The analysis involved four categories of SLP routing schemes. Analysis results revealed that the algorithms used in the representative schemes for tree-based and angle-based routing schemes incur the highest influence. The tree-based algorithm stimulates the highest energy consumption with the lowest network lifetime while the angle-based algorithm does the opposite. Moreover, for the tree-based algorithm, the influence is highly dependent on the region of the network domain.
The performance of three routing selection algorithms is compared in terms of bandwidth blocking probability, quality of transmission, and run time in EONs over the C+L band. The min-max frequency algorithm shows the ...
详细信息
An extended layered graph of MPLS over WDM mesh networks is designed in this paper, which overcomes the shortcomings of original layered graph and involves the limited optical transceivers at routing nodes. Based on d...
详细信息
An extended layered graph of MPLS over WDM mesh networks is designed in this paper, which overcomes the shortcomings of original layered graph and involves the limited optical transceivers at routing nodes. Based on different QoS constraint, the priority of label switch paths is classified and the corresponding routing algorithm DIRA (Differentiating Integrated routing Algorithm) is proposed and studied. The LSP's QoS and optimized network resources utilization are taken into account comprehensively in DIRA. The comparison of DIRA with the representative optical routing algorithms via simulation shows that it can reduce the blocking probability of delay-constraint LSP and improve the network throughput.
In routing, which is an important step in designing an IC, related nets should be connected together in the best way according to the design rules. The importance of routing is due to its effect on delay and noise spe...
详细信息
Network-on-Chip (NoC) has become the de-facto standard for on-chip communication in MPSoCs. The growing NoC power footprint, increase in the transistor current, and high switching speed of the logic devices, exacerbat...
详细信息
ISBN:
(纸本)9781467392280
Network-on-Chip (NoC) has become the de-facto standard for on-chip communication in MPSoCs. The growing NoC power footprint, increase in the transistor current, and high switching speed of the logic devices, exacerbate the peak power supply noise (PSN) in the NoC power delivery network (PDN). Hence, preserving power supply integrity in the NoC PDN is critical. In this work, we propose PRADA (PSN-aware Runtime Adaptation)-a collection of a novel flow-control protocol (PAF) and an adaptive routing algorithm (PAR), to mitigate PSN in NoCs. Our best scheme achieves 14% and 12% improvements in the regional peak PSN and energy efficiency, with an average of 4.6% performance overhead and marginal area and power footprints.
We evaluate OSPF-TE extensions within GMPLS framework in support of flex-grid optical networks. Based on OSPF-TE LSAs, two routing strategies are proposed achieving up to 15% and 70% respectively improved blocking rat...
详细信息
ISBN:
(纸本)9781629935935
We evaluate OSPF-TE extensions within GMPLS framework in support of flex-grid optical networks. Based on OSPF-TE LSAs, two routing strategies are proposed achieving up to 15% and 70% respectively improved blocking ratio for low loaded network (10-30 Erlangs) compared to the shortest path scenario.
The performance of three routing selection algorithms is compared in terms of bandwidth blocking probability, quality of transmission, and run time in EONs over the C+L band. The min-max frequency algorithm shows the ...
详细信息
We introduce new matheuristic algorithms for the Inventory routing Problem with unsplit and split deliveries for both Order-Up-to Level and Maximum Level replenishment policies. The first matheuristic is based on the ...
详细信息
In the rapidly evolving landscape of wireless networks, achieving enhanced throughput with low latency for data transmission is crucial for future communication systems. While low complexity OSPF-type solutions have s...
详细信息
In the rapidly evolving landscape of wireless networks, achieving enhanced throughput with low latency for data transmission is crucial for future communication systems. While low complexity OSPF-type solutions have shown effectiveness in lightly-loaded networks, they often falter in the face of increasing congestion. Recent approaches have suggested utilizing backpressure and deep learning techniques for route optimization. However, these approaches face challenges due to their high implementation and computational complexity, surpassing the capabilities of networks with limited hardware devices. A key challenge is developing algorithms that improve throughput and reduce latency while keeping complexity levels compatible with OSPF. In this collaborative research between Ben-Gurion University and Ceragon Networks Ltd., we address this challenge by developing a novel approach, dubbed Regularized routing Optimization (RRO). The RRO algorithm offers both distributed and centralized implementations with low complexity, making it suitable for integration into 5G and beyond technologies, where no significant changes to the existing protocols are needed. It increases throughput while ensuring latency remains sufficiently low through regularized optimization. We analyze the computational complexity of RRO and prove that it converges with a level of complexity comparable to OSPF. Extensive simulation results across diverse network topologies demonstrate that RRO significantly outperforms existing methods.
暂无评论