scholarly journals An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN

2021 ◽  
Vol 11 (2) ◽  
pp. 578
Author(s):  
Bo Li ◽  
Jinlin Wang
Keyword(s):  
Large Scale ◽  
Multicast Tree ◽  
Traffic Load ◽  
Selection Mechanism ◽  
Multicast Protocols ◽  
Multicast Service ◽  
Resolution System ◽  
Low Load ◽  
Routing State ◽  
Shared Tree

Many bandwidth-intensive applications (such as online live, online games, etc.) are more suitable for using multicast to transmit information. Due to the advantages in scalability, Shared Tree (ST) is more suitable for large-scale deployment than Source-Based Tree (SBT). However, in ST-based multicast, all multicast sources need to send multicast data to a center node called a core, which will lead to core overload and traffic concentration. Besides, most existing multicast protocols use the shortest path between the source or the core and each receiver to construct the multicast tree, which will result in traffic overload on some links. In this paper, we propose an Identifier and Locator Decoupled Multicast approach (ILDM) based on Information-Centric Networking (ICN). ILDM uses globally unique names to identify multicast services. For each multicast service, the mapping between the multicast service name and the addresses of multicast tree nodes is stored in the Name Resolution System (NRS). To avoid core overload and traffic aggregation, we presented a dynamic core management and selection mechanism, which can dynamically select a low-load core for each multicast service. Furthermore, we designed a path state-aware multicast tree node selection mechanism to achieve traffic load balancing by using low-load links more effectively. Experimental results showed that our proposed multicast approach outperformed some other multicast methods in terms of core load, number of join requests, link load, traffic concentration, and routing state.

scholarly journals Optimal User Association Strategy for Large-Scale IoT Sensor Networks with Mobility on Cloud RANs

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4415 ◽  
Author(s):  
Taewoon Kim ◽  
Chanjun Chun ◽  
Wooyeol Choi
Keyword(s):  
Load Balancing ◽  
Large Scale ◽  
Mobile Internet ◽  
Base Stations ◽  
Traffic Load ◽  
User Association ◽  
Network Simulator ◽  
Traffic Loads ◽  
Association Strategy ◽  
Radio Access

In networking systems such as cloud radio access networks (C-RAN) where users receive the connection and data service from short-range, light-weight base stations (BSs), users’ mobility has a significant impact on their association with BSs. Although communicating with the closest BS may yield the most desirable channel conditions, such strategy can lead to certain BSs being over-populated while leaving remaining BSs under-utilized. In addition, mobile users may encounter frequent handovers, which imposes a non-negligible burden on BSs and users. To reduce the handover overhead while balancing the traffic loads between BSs, we propose an optimal user association strategy for a large-scale mobile Internet of Things (IoT) network operating on C-RAN. We begin with formulating an optimal user association scheme focusing only on the task of load balancing. Thereafter, we revise the formulation such that the number of handovers is minimized while keeping BSs well-balanced in terms of the traffic load. To evaluate the performance of the proposed scheme, we implement a discrete-time network simulator. The evaluation results show that the proposed optimal user association strategy can significantly reduce the number of handovers, while outperforming conventional association schemes in terms of load balancing.

scholarly journals Mobility Load Balancing in Cellular System with Multicriteria Handoff Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Solomon T. Girma ◽  
Abinet G. Abebe
Keyword(s):  
Load Balancing ◽  
Propagation Model ◽  
Traffic Load ◽  
Call Blocking ◽  
Coverage Area ◽  
Low Load ◽  
Load Balancing Algorithm ◽  
Cover Up ◽  
Highly Loaded ◽  
Traffic Load Balancing

Efficient traffic load balancing algorithm is very important to serve more mobile users in the cellular networks. This paper is based on mobility load balancing handoff algorithm using fuzzy logic. The rank of the serving and the neighboring Base Transceiver Stations (BTSs) are calculated every half second with the help of measurement report from the two-ray propagation model. This algorithm is able to balance load of the BTS by handing off some ongoing calls on BTS’s edge of highly loaded BTS to move to overlapping underloaded BTS, such that the coverage area of loaded BTS virtually shrunk towards BTS center of a loaded sector. In case of low load scenarios, the coverage area of a BTS is presumed to be virtually widened to cover up to the partial serving area of neighboring BTS. This helps a highly loaded neighboring BTS or failed BTS due to power or transmission. Simulation shows that new call blocking and handoff blocking using the proposed algorithm are enhanced notably.

Routing state reduction in multicast protocols

1999 ◽  
Vol 35 (12) ◽  
pp. 970 ◽  
Author(s):  
Xu Sheng ◽  
Ng Chee Hock
Keyword(s):  
State Reduction ◽  
Multicast Protocols ◽  
Routing State

scholarly journals An Efficient SDN Multicast Architecture for Dynamic Industrial IoT Environments

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Hyeong-Su Kim ◽  
Seongjin Yun ◽  
Hanjin Kim ◽  
Heonyeop Shin ◽  
Won-Tae Kim
Keyword(s):  
Large Scale ◽  
Packet Delay ◽  
Smart Factory ◽  
Point Selection ◽  
Virtual Factory ◽  
Industrial Iot ◽  
Rendezvous Point ◽  
Point To Point ◽  
Switching Method ◽  
Shared Tree

Large-scale industrial IoT services appear in smart factory domains such as factory clouds which integrate distributed small factories into a large virtual factory with dynamic combination based on orders of consumers. A smart factory has so many industrial elements including various sensors/actuators, gateways, controllers, application servers, and IoT clouds. Since there are complex connections and relations, it is hard to handle them in point-to-point manner. In addition, many duplicated traffics are exchanged between them through the Internet. Multicast is believed as an effective many-to-many communication mechanism by establishing multicast trees between sources and receivers. There are, however, some issues for adopting multicast to large-scale industrial IoT services in terms of QoS. In this paper, we propose a novel software-defined network multicast based on group shared tree which includes near-receiver rendezvous point selection algorithm and group shared tree switching mechanism. As a result, the proposed multicast mechanism can reduce the packet loss by 90% compared to the legacy methods under severe congestion condition. GST switching method obtains to decreased packet delay effect, respectively, 2%, 20% better than the previously studied multicast and the legacy SDN multicast.

scholarly journals MULTICAST STATE DISTRIBUTION BY JOINS USING MULTIPLE SHORTEST PATHS

2005 ◽  
Vol 06 (02) ◽  
pp. 115-129
Author(s):  
DAMIEN MAGONI ◽  
PASCAL LORENZ
Keyword(s):  
Routing Protocol ◽  
Shortest Paths ◽  
Multicast Tree ◽  
Tree Size ◽  
Crucial Issue ◽  
State Distribution ◽  
State Information ◽  
Multicast Protocols ◽  
Unicast Routing ◽  
Simulation Results

The lack of resources in routers will become a crucial issue with the deployment of state storing protocols. In particular, single or any source multicast protocols will most probably take over large amounts of resources for maintaining multicast tree information. The aim of this paper is to study the possibility and benefit of using multiple shortest paths in order for a new member to reach a multicast tree. Such a mechanism would not reduce the overall amount of state information in the network but it would distribute this amount more evenly among all routers. The idea is to use alternate shortest paths provided by the underlying unicast routing protocol to avoid saturated routers, that is, routers that can not or do not want to store any more multicast state information. As the simulation results are very sensitive to the topology, we have used subgraphs of an Internet map. We have then simulated our multipath join mechanism and have found that depending on the tree size, the use of our mechanism can increase successful join attempts by up to 55% when the network is half saturated.

scholarly journals Multiorder Fusion Data Privacy-Preserving Scheme for Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Mingshan Xie ◽  
Yong Bai ◽  
Mengxing Huang ◽  
Zhuhua Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Privacy Protection ◽  
Data Privacy ◽  
Large Scale ◽  
Privacy Preserving ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Fusion Data ◽  
Data Privacy Protection

Privacy-preserving in wireless sensor networks is one of the key problems to be solved in practical applications. It is of great significance to solve the problem of data privacy protection for large-scale applications of wireless sensor networks. The characteristics of wireless sensor networks make data privacy protection technology face serious challenges. At present, the technology of data privacy protection in wireless sensor networks has become a hot research topic, mainly for data aggregation, data query, and access control of data privacy protection. In this paper, multiorder fusion data privacy-preserving scheme (MOFDAP) is proposed. Random interference code, random decomposition of function library, and cryptographic vector are introduced for our proposed scheme. In multiple stages and multiple aspects, the difficulty of cracking and crack costs are increased. The simulation results demonstrate that, compared with the typical Slice-Mix-AggRegaTe (SMART) algorithm, the algorithm proposed in this paper has a better data privacy-preserving ability when the traffic load is not very heavy.

scholarly journals Molecular Dynamics Studies on the Conformational Transitions of Adenylate Kinase: A Computational Evidence for the Conformational Selection Mechanism

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Jie Ping ◽  
Pei Hao ◽  
Yi-Xue Li ◽  
Jing-Fang Wang
Keyword(s):  
Escherichia Coli ◽  
Molecular Dynamics ◽  
Adenylate Kinase ◽  
Large Scale ◽  
Conformational Transition ◽  
Conformational Transitions ◽  
Selection Mechanism ◽  
Conformational Selection ◽  
Domain Motion ◽  
Lid Domain

Escherichia coliadenylate kinase (ADK) is a monomeric phosphotransferase enzyme that catalyzes reversible transfer of phosphoryl group from ATP to AMP with a large-scale domain motion. The detailed mechanism for this conformational transition remains unknown. In the current study, we performed long time-scale molecular dynamics simulations on both open and closed states of ADK. Based on the structural analyses of the simulation trajectories, we detected over 20 times conformational transitions between the open and closed states of ADK and identified two novel conformations as intermediate states in the catalytic processes. With these findings, we proposed a possible mechanism for the large-scale domain motion ofEscherichia coliADK and its catalytic process: (1) the substrate free ADK adopted an open conformation; (2) ATP bound with LID domain closure; (3) AMP bound with NMP domain closure; (4) phosphoryl transfer occurred with ATP, and AMP converted into two ADPs, and no conformational transition was detected in the enzyme; (5) LID domain opened with one ADP released; (6) another ADP released with NMP domain open. As both open and closed states sampled a wide range of conformation transitions, our simulation strongly supported the conformational selection mechanism forEscherichia coliADK.

A Multi-core Shared Tree Algorithm Based on Network Coding for Multi-point Optical Multicast

2015 ◽  
Vol 36 (1) ◽  
Author(s):  
Huanlin Liu ◽  
Yuming Yang ◽  
Yuan Li ◽  
Yong Chen ◽  
Sheng Huang
Keyword(s):  
Network Coding ◽  
Wavelength Division Multiplexing ◽  
Heuristic Method ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Tree Algorithm ◽  
Network Bandwidth ◽  
The Core ◽  
Core Node ◽  
Shared Tree

AbstractWith the growth of multi-point to multi-point multicast applications, the optical network bandwidth resource consumption is increasing rapidly. It attracted more and more researchers to improve the limited wavelength bandwidth utilization for multicast applications in wavelength division multiplexing (WDM) networks. In the paper, a multi-core shared multicast tree algorithm based on network coding is proposed to minimize the fiber link stress. The proposed algorithm includes three processes: searching the core node candidate set excluding core node loop path, selecting the core nodes from the convergence matrix based on heuristic algorithm, and constructing the multi-core nodes shared trees. The convergence matrix based on the heuristic method is constructed for selecting the core nodes from candidate core node set. To improve the limited wavelength utilization, we introduce network coding into the shared tree to compress the transmitting information. The simulation results show that the proposed algorithm’s performance is better than the existing algorithms’ performance in terms of link stress and balance degree.

Sign in / Sign up

Export Citation Format

Share Document