Serving at the Edge: An Edge Computing Service Architecture Based on ICN

Different from cloud computing, edge computing moves computing away from the centralized data center and closer to the end-user. Therefore, with the large-scale deployment of edge services, it becomes a new challenge of how to dynamically select the appropriate edge server for computing requesters based on the edge server and network status. In the TCP/IP architecture, edge computing applications rely on centralized proxy servers to select an appropriate edge server, which leads to additional network overhead and increases service response latency. Due to its powerful forwarding plane, Information-Centric Networking (ICN) has the potential to provide more efficient networking support for edge computing than TCP/IP. However, traditional ICN only addresses named data and cannot well support the handle of dynamic content. In this article, we propose an edge computing service architecture based on ICN, which contains the edge computing service session model, service request forwarding strategies, and service dynamic deployment mechanism. The proposed service session model can not only keep the overhead low but also push the results to the computing requester immediately once the computing is completed. However, the service request forwarding strategies can forward computing requests to an appropriate edge server in a distributed manner. Compared with the TCP/IP-based proxy solution, our forwarding strategy can avoid unnecessary network transmissions, thereby reducing the service completion time. Moreover, the service dynamic deployment mechanism decides whether to deploy an edge service on an edge server based on service popularity, so that edge services can be dynamically deployed to hotspot, further reducing the service completion time.

Design of Context Cluster and Load Balanced Video Recommendation System in Cloud Computing

Nowadays, in online social networks, there is an instantaneous extension of multimedia services and there are huge offers of video contents which has hindered users to acquire their interests. To solve these problem different personalized recommendation systems had been suggested. Although, all the personalized recommendation system which have been suggested are not efficient and they have significantly retarded the video recommendation process. So to solve this difficulty, context extractor based video recommendation system on cloud has been proposed in this paper. Further to this the system has server selection technique to handle the overload program and make it balanced. This paper explains the mechanism used to minimize network overhead and recommendation process is done by considering the context details of the users, it also uses rule based process and different algorithms used to achieve the objective. The videos will be stored in the cloud and through application videos will be dumped into cloud storage by reading, coping and storing process.

An Efficient Group-Based Replica Placement Policy for Large-Scale Geospatial 3D Raster Data on Hadoop

Geospatial three-dimensional (3D) raster data have been widely used for simple representations and analysis, such as geological models, spatio-temporal satellite data, hyperspectral images, and climate data. With the increasing requirements of resolution and accuracy, the amount of geospatial 3D raster data has grown exponentially. In recent years, the processing of large raster data using Hadoop has gained popularity. However, data uploaded to Hadoop are randomly distributed onto datanodes without consideration of the spatial characteristics. As a result, the direct processing of geospatial 3D raster data produces a massive network data exchange among the datanodes and degrades the performance of the cluster. To address this problem, we propose an efficient group-based replica placement policy for large-scale geospatial 3D raster data, aiming to optimize the locations of the replicas in the cluster to reduce the network overhead. An overlapped group scheme was designed for three replicas of each file. The data in each group were placed in the same datanode, and different colocation patterns for three replicas were implemented to further reduce the communication between groups. The experimental results show that our approach significantly reduces the network overhead during data acquisition for 3D raster data in the Hadoop cluster, and maintains the Hadoop replica placement requirements.

The Optimization of Classroom Teaching in Colleges and Universities Based on Network Topology

In order to improve the teaching effect of programming courses, this article applies network topology to the construction of programming course teaching platform system and constructs a teaching framework combined with intelligent teaching mode. In addition, this article takes the opportunistic social network composed of mobile smart terminal devices as the application background and briefly introduces the concept, characteristics, and application scenarios of the opportunistic social network. In addition, the typical message forwarding algorithm currently studied in this paper is analyzed. Taking into account the social attributes and forwarding willingness of nodes, in order to increase the message transmission rate and reduce message transmission delay and network overhead, two message transmission strategies are proposed to improve the operating effect of the programming course teaching platform. Finally, this paper verifies the effectiveness of the network topology in the teaching of the algorithm and programming of the intelligent teaching mode through experimental research.

Design of Sports Training System and Motion Monitoring and Recognition under Wireless Sensor Network

In conventional sports training, coaches record and observe athletes' sports data and judge whether it is reasonable based on their own experience. This qualitative analysis method is highly subjective, has large errors, and is susceptible to interference. To solve the above problems, the design of the sports training system under the wireless sensor network and the research of movement monitoring and recognition become very important. This article aims to study the design of sports training system and the monitoring and recognition of actions under the wireless sensor network technology. This paper simulates the implementation of the proposed data collection protocol and the two basic protocols, the direct transfer algorithm and the flooding algorithm, and compares the protocol proposed in this paper with the other two algorithms in terms of average information transmission success rate and average network overhead. Among them, the average information transmission success rate represents the ratio of the number of messages successfully arriving at the base station to the total amount of information generated by all nodes, and the average network overhead represents the average number of messages sent by each node. Experimental results show that the data collection protocol proposed in this paper can dynamically provide different transmission qualities for information of different importance levels, effectively reducing network overhead, and the reduced overhead is 11% of the original.

Pengaruh Native VLAN terhadap Overhead Trafik Data pada Jaringan LAN

ABSTRAKPenggunaan switch pada jaringan yang sudah menerapkan teknologi VLAN dapat membagi jaringan menjadi beberapa wilayah jaringan yang berbeda dimana proses ini sebelumnya hanya bisa dilakukan oleh router. Data yang dipertukarkan antar wilayah jaringan yang berbeda akan melewati jalur trunk yang menghubungkan antar perangkat switch. Proses penambahan header ke dalam data dilakukan perangkat switch sebelum diteruskan melewati jalur trunk. Namun proses tersebut akan menambah overhead (beban trafik tambahan) dari setiap data yang dilewatkan pada jalur trunk. Produk switch dari Cisco memiliki fasilitas yang dinamakan sebagai native VLAN. Apabila asal wilayah VLAN dari data yang dilewatkan pada jalur trunk sama dengan informasi native VLAN yang tersimpan pada perangkat switch, maka data tersebut tidak perlu ditambahkan header disaat ingin dilewatkan jalur trunk. Penelitian ini bertujuan untuk menguji pengaruh penggunaan native VLAN dalam mengurangi beban trafik jaringan pada jalur trunk. Hasil pengujian memperlihatkan penggunaan native VLAN dapat mengurangi beban overhead trafik data sebesar 4,77%.Kata kunci: VLAN, Native VLAN, Trunk, Jaringan LAN, Overhead Trafik ABSTRACTThe use of switches in the switch network with implementing VLAN technology can divide a network into several different networks that previously just be done with a router. The data that is exchanged among different networks will pass the trunk link that connects between switches. The process of adding a header within data is done by a switch before entering that data into the trunk link. However, that process will increase overhead traffic (additional traffic load) within each data that passed on the trunk link. Cisco's switches have a facility known as native VLAN. If the origin of the data's VLAN area that will be passed on the trunk link is the same as native VLAN information, then the data will not add with a header when will pass on the trunk link. This research will analyze the effect of using native VLAN in reducing overload data traffic on the trunk link. The test result shows that the use of native VLAN can reduce data traffic overhead by 4.77%.Keywords: VLANs, Native VLANs, Trunk Link, Switch Network, Overhead Traffic

Research on MAC Protocols in Cluster-Based Ad Hoc Networks

Mobile ad hoc networks can be widely used in many scenes, for example, military communication, emergency communication, and 5G wide area coverage as well as ultradense network scenes. A cluster-based network can decrease network overhead effectively and then constitute a large-scale network through extending network scale by clustering and cascading. In view of multiservice simultaneous transmission demand for small-scale dense networking scene and large-scale extended networking scene, a MAC protocol based on scheduling of cluster head is proposed, which can avoid collision and retransmission between nodes effectively, and then the network synchronizing in intercluster and intracluster as well as the time-slot scheduling is solved fast and efficiently. A network synchronization algorithm based on clock spread of the sponsorship node is proposed to achieve network self-synchronizing, and a modified schedule-tree algorithm based on cluster head and exactly sponsorship node is proposed to decrease network overhead and to increase network fairness, then MAC protocol based on scheduling of cluster head is verified by simulated analysis. Finally, a dynamic gateway selection algorithm based on link stability is proposed in this paper to decrease intercluster communication control overhead and improve intercluster communication reliability.

SMGSAF: A Secure Multi-Geocasting based Routing Scheme for Opportunistic Networks

This paper proposes a novel Secure Multi- Geocasting Spray And Flood technique for opportunistic networks called SMGSAF, which uses secret sharing and disjoint path routing to secure the privacy of messages. In multi-geocasting, routing aims to successfully deliver a given geomessage to all the nodes, or to as many as possible, located inside defined geographic areas within a given time interval. It is desired that as long as a message is outside its destination casts it cannot be read by intermediate nodes. Encryption is a proven way to ensure this but classical encryption techniques are not well suited for the opportunistic paradigm. Key distribution and scarcity of resources are the major challenges in this regard. Therefore we have used secret sharing and disjoint path routing to protect the privacy of messages. Simulation results show that the proposed SMGSAF protocol provides the intended security but at the expense of performance, that is within acceptable limits. Notably, the SMGSAF protocol outperforms unitary geocasting in terms of delivery probability. The proposed protocol is evaluated in terms of delivery probability, network overhead, and latency. Its performance has been compared to MGSAF and GSAF.