A novel packet exchanging strategy for preventing HoL-blocking in fat-trees

Mohtavipour, Seyed Mehdi; Mollajafari, Morteza; Naseri, Ali

doi:10.1007/s10586-019-02940-2

Cited by 16 publications

(7 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The accounts within each community need to communicate constantly, and the relationship between accounts coincides with the graph structure in the data structurers. Therefore, Graph structure is an effective way to represent relational relationships [33]. Based on the above, we abstract the relationship between accounts as a weighted graph to analyze the relationship between accounts more directly.…”

Section: Related Workmentioning

confidence: 99%

Blockchain Transaction Sharding Algorithm Based on Account-Weighted Graph

Li,

Ning

2024

IEEE Access

View full text Add to dashboard Cite

Sharding technology is widely regarded as an effective way to solve blockchain scalability limitations, such as lower throughput and longer delay time. However, sharding encounters challenges related to high cross-shard transactions proportion and complex cross-shard transaction verification. Therefore, a transaction sharding algorithm based on account-weighted graph is proposed. Firstly, an account-based transaction sharding model is established from the viewpoint of data sharding. Secondly, based on this model, an account-weighted graph is constructed with accounts as nodes and transaction frequency between accounts as weights for the long-term accumulated transaction data of blockchain. The community discovery algorithm is adopted, and the accounts with the largest modularity gain are selected and merged according to the association relationship between the accounts, so multi-shards blockchain is formed initially. Finally, multishards blockchain are adjusted and rebuilt by splitting and merging. The proposed algorithm is compared with modular sharding algorithm and random sharding algorithm under the sharding size of 10. The crossshard transaction proportion is reduced by 78%, the average cross-shard transaction delay of accounts is reduced by 36.1% and 44.5%, and the transaction throughput is increased by 93% and 122%. Under the other granularities, the proposed algorithm also outperforms the two algorithms in terms of cross-shard transaction proportion and account transaction delay. In conclusion, the method effectively reduces the cross-shard transaction proportion and minimizes cross-shard transaction delay.

show abstract

Section: Related Workmentioning

confidence: 99%

Blockchain Transaction Sharding Algorithm Based on Account-Weighted Graph

Li,

Ning

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The fat-tree interconnection network as proposed in the research [48] stands out as a widely adopted choice in massively parallel processing systems, due to its advantageous features like deterministic routing, in-order delivery, and performance comparable to adaptive routing methods. However, challenges arise during high traffic workloads due to deterministic routing and simultaneous use of switch links, leading to Head of Line (HoL)-blocking in buffers.…”

Section: Related Workmentioning

confidence: 99%

A Lightweight Multi-Chaos-Based Image Encryption Scheme for IoT Networks

Jain,

Titus,

Krishnan

et al. 2024

IEEE Access

View full text Add to dashboard Cite

The swift development of the Internet of Things (IoT) has accelerated digitalization across several industries, offering networked applications in fields such as security, home automation, logistics, and quality control. The growth of connected devices, on the other hand, raises worries about data breaches and security hazards. Because of IoT devices' computational and energy limits, traditional cryptographic methods face issues. In this context, we emphasize the importance of our contribution to image encryption in IoT environments through the proposal of Multiple Map Chaos Based Image Encryption (MMCBIE), a novel method that leverages the power of multiple chaotic maps. MMCBIE uses multiple chaotic maps to construct a strong encryption framework that considers the inherent features of digital images. Our proposed method, MMCBIE, distinguishes itself by integrating multiple chaotic maps like Henon Chaotic Transform and 2D-Logistic Chaotic Transform in a novel combination, a unique approach that sets it apart from existing schemes. Compared to other chaotic-based encryption systems, this feature renders them practically indistinguishable from pure visual noise. Security evaluations and cryptanalysis confirm MMCBIE's highlevel security properties, indicating its superiority over existing image encryption techniques. MMCBIE demonstrated superior performance with NPCR (Number of Pixel Changing Rate) score of 99.603, UACI (Unified Average Changing Intensity) score of 32.8828, MSE (Mean Square Error) score of 6625.4198, RMSE (Root Mean Square Error) score of 80.0063, PSNR (Peak Signal to Noise Ratio) score of 10.2114, and other security analyses.

show abstract

“…In [23] the buffer information of each wireless router is used to prevent congestion. On the other hand, using the deterministic routing algorithms lead to Head-of-Line (HoL) blocking when load traffic is high [30][31][32]. Hence, some studies used congestion control mechanisms to eliminate HoL and reduce congestion in the wireless routers congestion-aware routing algorithms [33][34].…”

Section: -3-2-end-to-end Flow Control Mechanismsmentioning

confidence: 99%

Mathematical Modeling of Flow Control Mechanism in Wireless Network-on-Chip

Rad¹,

Gerami²

2023

jist

View full text Add to dashboard Cite

Network-on-chip (NoC) is an effective interconnection solution of multicore chips. In recent years, wireless interfaces (WIs) are used in NoCs to reduce the delay and power consumption between long-distance cores. This new communication structure is called wireless network-on-chip (WiNoC). Compared to the wired links, demand to use the shared wireless links leads to congestion in WiNoCs. This problem increases the average packet latency as well as the network latency. However, using an efficient control mechanism will have a great impact on the efficiency and performance of the WiNoCs. In this paper, a mathematical modeling-based flow control mechanism in WiNoCs has been investigated. At first, the flow control problem has been modeled as a utility-based optimization problem with the wireless bandwidth capacity constraints and flow rate of processing cores. Next, the initial problem has been transformed into a dual problem without limitations and the best solution of the dual problem is obtained by the gradient projection method. Finally, an iterative algorithm is proposed in a WiNoC to control the flow rate of each core. The simulation results of synthetic traffic patterns show that the proposed algorithm can control and regulate the flow rate of each core with an acceptable convergence. Hence, the network throughput will be significantly improved.

show abstract

A novel packet exchanging strategy for preventing HoL-blocking in fat-trees

Cited by 16 publications

References 40 publications

Blockchain Transaction Sharding Algorithm Based on Account-Weighted Graph

Blockchain Transaction Sharding Algorithm Based on Account-Weighted Graph

A Lightweight Multi-Chaos-Based Image Encryption Scheme for IoT Networks

Mathematical Modeling of Flow Control Mechanism in Wireless Network-on-Chip

Contact Info

Product

Resources

About