The multi-tenancy concept in cloud data center (DC) networks paves the way towards advancements and innovation in the underlying infrastructure such as network virtualization. Multicast routing is essential in leveraging multi-tenancy to its full potential. However, traditional IP multicast routing is not suitable for DC networks due to the need to support a massive amount of multicast groups and hosts. State-of-the-art DC multicast routing approaches aim to overcome these scalability issues by, for instance, taking advantage of the symmetry of DC topologies and the programmability of DC switches to compactly encode multicast group information inside packets, thereby reducing the overhead resulting from the need to store the states of flows at the network switches. Although these approaches scale well with the number of multicast groups, they do not perform well with group sizes and, as a result, yield substantial traffic control overhead and network congestion. In this article, we present Bert, a scalable source-initiated DC multicast routing approach that scales well with both the number and size of multicast groups through the clustering of multicast group members where each cluster employs its own forwarding rules. Compared to the stateof-the-art approach, Bert yields much less traffic control overhead by significantly reducing packet header sizes and eliminating switch memory usage across the switches.
Data centers (DCs) nowadays house tens of thousands of servers and switches, interconnected by high-speed communication links. With the rapid growth of cloud DCs, in both size and number, tremendous efforts have been undertaken to efficiently design the network and manage the traffic within these DCs. However, little effort has been made toward measuring, understanding and chattelizing how the network-level traffic of these DCs behave. In this paper, we aim to present a systematic taxonomy and survey of these DC studies. Specifically, our survey first decomposes DC network traffic behavior into two main stages, namely (1) data collection methodologies and (2) research findings, and then classifies and discusses the recent research studies in each stage. Finally, the survey highlights few research challenges related to DC network traffic that require further research investigation.
In the network field, Wireless Sensor Networks (WSN) contain prolonged attention due to afresh augmentations. Industries like health care, traffic, defense, and many more systems espoused the WSN. These networks contain tiny sensor nodes containing embedded processors, Tiny OS, memory, and power source. Sensor nodes are responsible for forwarding the data packets. To manage all these components, there is a need to select appropriate parameters which control the quality of service of WSN. Multiple sensor nodes are involved in transmitting vital information, and there is a need for secure and efficient routing to reach the quality of service. But due to the high cost of the network, WSN components have limited resources to manage the network. There is a need to design a lightweight solution that ensures the quality of service in WSN. In this given manner, this study provides the quality of services in a wireless sensor network with a security mechanism. An incorporated hybrid lightweight security model is designed in which random waypoint mobility (RWM) model and grey wolf optimization (GWO) is used to enhance service quality and maintain security with efficient routing. MATLAB version 16 and Network Stimulator 2.35 (NS2.35) are used in this research to evaluate the results. The overall cost factor is reduced at 60% without the optimization technique and 90.90% reduced by using the optimization technique, which is assessed by calculating the signal-to-noise ratio, overall energy nodes, and communication overhead.
Traditional IP multicast routing is not suitable for cloud data center (DC) networks due to the need for supporting large numbers of groups with large group sizes. State-of-the-art DC multicast routing approaches aim to overcome the scalability issues by, for instance, taking advantage of the symmetry of DC topologies and the programmability of DC switches to compactly encode multicast group information inside packets, thereby reducing the overhead resulting from the need to store the states of flows at the network switches. However, although these scale well with the number of multicast groups, they do not do so with group sizes, and as a result, they yield substantial traffic control overhead and network congestion. In this paper, we present Bert, a scalable, source-initiated DC multicast routing approach that scales well with both the number and the size of multicast groups, and does so through clustering, by dividing the members of the multicast group into a set of clusters with each cluster employing its own forwarding rules. Compared to the state-of-the-art approach, Bert yields much lesser traffic control overhead by significantly reducing the packet header sizes and the number of extra packet transmissions, resulting from the need for compacting forwarding rules across the switches.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.