A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks

Jia, Wen-Kang; Wang, Li-Chun

doi:10.1109/jsac.2013.131206

Cited by 31 publications

(14 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such traditional multicast algorithms suffer from huge amount of required memory space and high process time to perform the routing. With the aim of improving flexibility, scalability, and the efficiency of multicast forwarding, and based on Chinese remainder theorem (CRT) properties, residues are used in Scalar-pair Vectors Routing and Forwarding (SVRF) algorithm [3]. Simulation results illustrate that the mentioned method can lead to less memory usage, processing time, and hardware cost compared with the general Bloom filter [12], which is widely used in network functions especially unicast/multicast forwarding.…”

Section: Rns For Unicast/multicast Routing and Forwarding In Sdnmentioning

confidence: 99%

“…This section describes a recently introduced multicast forwarding/routing method (SVRF) [3] based on utilizing RNS properties to improve multicast packet forwarding in SDNs. This algorithm treats multicast and unicast packets in the same way, and enhances the forwarding process.…”

Section: Svrf Approachmentioning

confidence: 99%

“…However, recently modern applications of RNS have been introduced which profit from RNS in new aspects with distinct goals and also new challenges [2]. RNS can be used in network applications with the aim of solving some issues such as determining output port in simpler way [3] or increasing a wireless sensor network (WSN) lifetime [4]. Moreover, it is possible to design a switch which can process multicast or unicast traffic by using RNS concepts [3,5].…”

mentioning

confidence: 99%

“…RNS can be used in network applications with the aim of solving some issues such as determining output port in simpler way [3] or increasing a wireless sensor network (WSN) lifetime [4]. Moreover, it is possible to design a switch which can process multicast or unicast traffic by using RNS concepts [3,5]. Redundant residue number system is even used in cloud storage with the aim of providing a novel method to enhance reliability [6].…”

mentioning

confidence: 99%

See 3 more Smart Citations

RNS Applications in Computer Networks

Zarandi

2017

Embedded Systems Design With Special Arithmetic and Number Systems

View full text Add to dashboard Cite

Residue number system (RNS) is a non-weighted number system, which represents any integer number with some residues, based on the selected moduli set. Therefore, computations can be done on these residues in parallel to decrease the delay, and also due to the reduction of bit-length, low power processors can be designed. Moreover, another characteristic of this number system is its ability to improve the reliability by using redundant moduli. These are the most famous advantages of RNS, which numerous works have been done on them, and they led to valuable achievements [1]. However, recently modern applications of RNS have been introduced which profit from RNS in new aspects with distinct goals and also new challenges [2]. RNS can be used in network applications with the aim of solving some issues such as determining output port in simpler way [3] or increasing a wireless sensor network (WSN) lifetime [4]. Moreover, it is possible to design a switch which can process multicast or unicast traffic by using RNS concepts [3,5]. Redundant residue number system is even used in cloud storage with the aim of providing a novel method to enhance reliability [6]. Another application of RNS in WSN is its usage in increasing the reliability of data transmission by improving packet reception rate and end-to-end delay [7]. Furthermore, RNS can be applied to WSN in order to perform data aggregation [8] which results in a good trade-off between energy consumption and reliability.This chapter briefly reviews some of the important and effective applications of RNS in computer networks to show how RNS can improve performance in different ways than conventional methods. In other words, our aim is creating a

show abstract

Section: Rns For Unicast/multicast Routing and Forwarding In Sdnmentioning

confidence: 99%

Section: Svrf Approachmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

RNS Applications in Computer Networks

Zarandi

2017

Embedded Systems Design With Special Arithmetic and Number Systems

View full text Add to dashboard Cite

show abstract

“…In addition, with the rapid development of datacenters, large amounts of non-real-time network traffic should be transmitted or communicated between the datacenters, such as data backup traffic and content synchronization traffic (Jia & Wang, 2013). The optimization of the network link transmission efficiency could meet the traffic demands and attaining a low congestion as well as high-efficient utilization of network resources (Huerta, Hesselbach & Fabregat, 2006).…”

Section: Introductionmentioning

confidence: 99%

Non-Real-Time Network Traffic in Software-Defined Networking: A Link Bandwidth Prediction-Based Algorithm

Dai¹,

Yang²,

Gao³

et al. 2015

CIS

View full text Add to dashboard Cite

Network traffic control is the process of managing, prioritizing, controlling or reducing the network traffic by the network scheduler. High utilization of link bandwidth is very significant for network control and maintenance in Software-Defined Networking (SDN). When we get the accurate link bandwidth predictions for T time periods of the future in a specific network topology, the residual link bandwidth could be determined by the link bandwidth capacity and corresponding prediction values. Given the non-real-time request pairs, this process can be transformed into a multi-commodity flow model. But the traditional multi-commodity model has not introduced the time dimension. In this paper, the model associated with the time dimension is to complete the transmission of the non-real-time network traffic. However, in consideration of the large scale of the problem, a heuristic algorithm on the basis of greedy strategy is proposed to schedule the non-real-time network traffic properly. The experiments show that the heuristic algorithm is superior to global optimization in computing speed and the single path resulting from heuristic algorithm occupies fewer links in the network topology for the non-real-time network traffic.

show abstract