COCP:Coupling Parameters Content Placement Strategy for In-Network Caching-Based Content-Centric Networking

On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus of the CCN caching module is data dissemination within the network.Most of the existing strategies of in-network caching in CCN store the content at the maximumnumber of routers along the downloading path.Consequently,content redundancy in the network increases significantly,whereas the cache hit ratio and network performance decrease due to the unnecessary utilization of limited cache storage.Moreover,content redundancy adversely affects the cache resources,hit ratio,latency,bandwidth utilization,and server load.We proposed an in-network caching placement strategy named Coupling Parameters to Optimize Content Placement(COCP)to address the content redundancy and associated problems.The novelty of the technique lies in its capability tominimize content redundancy by creating a balanced cache space along the routing path by considering request rate,distance,and available cache space.The proposed approach minimizes the content redundancy and content dissemination within the network by using appropriate locations while increasing the cache hit ratio and network performance.The COCP is implemented in the simulator(Icarus)to evaluate its performance in terms of the cache hit ratio,path stretch,latency,and link load.Extensive experiments have been conducted to evaluate the proposed COCP strategy.The proposed COCP technique has been compared with the existing state-of-theart techniques,namely,Leave Copy Everywhere(LCE),Leave Copy Down(LCD),ProbCache,Cache Less forMore(CL4M),and opt-Cache.The results obtained with different cache sizes and popularities show that our proposed caching strategy can achieve up to 91.46%more cache hits,19.71%reduced latency,35.43%improved path stretch and 38.14%decreased link load.These results confirm that the proposed COCP strategy has the potential capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.

An accurate retransmission timeout estimator for content-centric networking based on the Jacobson algorithm

Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, the Jacobson algorithm, which is an Exponentially Weighted Moving Average (EWMA) on the Round Trip Time (RTT) of previous packets, is a promising scheme. Assigning the lower bound to RTO, determining how an EWMA rapidly adapts to changes, and setting the multiplier of variance RTT have the most impact on the accuracy of this estimator for which several evaluations have been performed to set them in Transmission Control Protocol/Internet Protocol (TCP/IP) networks. However, the performance of this estimator in CCN has not been explored yet, despite CCN having a significant architectural difference with TCP/IP networks. In this study, two new metrics for assessing the performance of RTO estimators in CCN are defined and the performance of the Jacobson algorithm in CCN is evaluated. This evaluation is performed by varying the minimum RTO, EWMA parameters, and multiplier of variance RTT against different content popularity distribution gains. The obtained results are used to reconsider the Jacobson algorithm for accurately estimating RTO in CCN. Comparing the performance of the reconsidered Jacobson estimator with the existing solutions shows that it can estimate RTO simply and more accurately without any additional information or computation overhead.

A Survey of Applications Research on Content-Centric Networking

As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholly driven by the data consumer.Consumers must send Interest packets with the content name and not by the host’s network address.Its nature of in-network caching,Interest packets aggregation and hop-byhop communication poses unique challenges to provision of Internet applications,where traditional IP network no long works well.This paper presents a comprehensive survey of state-of-the-art application research activities related to CCN architecture.Our main aims in this survey are(a)to identify the advantages and drawbacks of CCN architectures for application provisioning;(b)to discuss the challenges and opportunities regarding service provisioning in CCN architectures;and(c)to further encourage deeper thinking about design principles for future Internet architectures from the perspective of upper-layer applications.

Degree-Based Probabilistic Caching in Content-Centric Networking

Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.

Exploring Hits-Based Content Provisioning Mechanism in Content-Centric Networking

In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Interest packets by Pending Interest Table(PIT).In this way,most popular content requests will not reach the origin content server.Thus,content providers will be unaware of the actual usages of their contents in network.This new network paradigm presents content providers with unprecedented challenge.It will bring a great impact on existing mature business model of content providers,such as advertising revenue model based on hits amount.To leverage the advantages of CCN and the realistic business needs of content providers,we explore the hits-based content provisioning mechanism in CCN.The proposed approaches can avoid the unprecedented impact on content providers' existing business model and promote content providers to embrace the real deployment of CCN network.

An Efficient Update Strategy for Content Synchronization in Content-Centric Networking(CCN)

Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The emergent proportion of Internet circulation has expectant adjusting Content-centric architecture to enhance serve the user prerequisites of accessing content.In recent years,one of the key aspects of CCN is ubiquitous in-network caching,which has been widely received great attention in research interest.One foremost shortcoming of in-network caching is that content producers have no awareness about where their content is put in storage.Because routers in CCN have caching capabilities,therefore,each and every content router can cache the content item in its storage capacity.This is problematic in the case in which a producer wishes to update or make the changes in its content item.In this paper,we present an approach regarding how to address this issue with a scheme called efficient content update(ECU).Our proposed ECU scheme achieves content update via trifling packets that resemble contemporary CCN communication messages with the use of additional table.We measure the performance of ECU scheme by means of simulations and make available a comprehensive exploration of its results.

Super Node Routing Strategy in Content-Centric Networking

There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.

A Game Theoretic Approach for Energy-Efficient In-Network Caching in Content-Centric Networks

Recently,content-centric networking(CCN) has become a hot research topic for the diffusion of contents over the Internet.Most existing works on CCN focus on the improvement of network resource utilization.Consequently,the energy consumption aspect of CCN is largely ignored.In this paper,we propose a distributed energyefficient in-network caching scheme for CCN,where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption.We formulate the in-network caching problem as a non-cooperative game.Through rigorous mathematical analysis,we prove that pure strategy Nash equilibria exist in the proposed scheme,and it always has a strategy profile that implements the socially optimal configuration,even if the routers are self-interested in nature.Simulation results are presented to show that the distributed solution is competitive to the centralized scheme,and has superior performance compared to other popular caching schemes in CCN.Besides,it exhibits a fast convergence speed when the capacity of content routers varies.

Social-ecological perspective on the suicidal behaviour factors of early adolescents in China:a network analysis

Background In early adolescence,youth are highly prone to suicidal behaviours.Identifying modifiable risk factors during this critical phase is a priority to inform effective suicide prevention strategies.Aims To explore the risk and protective factors of suicidal behaviours(ie,suicidal ideation,plans and attempts)in early adolescence in China using a social-ecological perspective.Methods Using data from the cross-sectional project‘Healthy and Risky Behaviours Among Middle School Students in Anhui Province,China',stratified random cluster sampling was used to select 5724 middle school students who had completed self-report questionnaires in November 2020.Network analysis was employed to examine the correlates of suicidal ideation,plans and attempts at four levels,namely individual(sex,academic performance,serious physical llness/disability,history of self-harm,depression,impulsivity,sleep problems,resilience),family(family economic status,relationship with mother,relationship with father,family violence,childhood abuse,parental mental illness),school(relationship with teachers,relationship with classmates,school-bullying victimisation and perpetration)and social(social support,satisfaction with society).Results In total,37.9%,19.0%and 5.5%of the students reported suicidal ideation,plans and attempts in the past 6 months,respectively.The estimated network revealed that suicidal ideation,plans and attempts were collectively associated with a history of self-harm,sleep problems,childhood abuse,school bullying and victimisation.Centrality analysis indicated that the most influential nodes in the network were history of self-harm and childhood abuse.Notably,the network also showed unique correlates of suicidal ideation(sex,weight=0.60;impulsivity,weight=0.24;family violence,weight=0.17;relationship with teachers,weight=-0.03;school-bullying perpetration,weight=0.22),suicidal plans(social support,weight=-0.15)and suicidal attempts(relationship with mother,weight=-0.10;parental mental llness,weight=0.61).Conclusions This study identified the correlates of suicidal ideation,plans and attempts,and provided practical implications for suicide prevention for young adolescents in China.Firstly,this study highlighted the importance of joint interventions across multiple departments.Secondly,the common risk factors of suicidal ideation,plans and attempts were elucidated.Thirdly,this study proposed target interventions to address the unique influencing factors of suicidal ideation,plans and attempts.

Pluggable multitask diffractive neural networks based on cascaded metasurfaces

Optical neural networks have significant advantages in terms of power consumption,parallelism,and high computing speed,which has intrigued extensive attention in both academic and engineering communities.It has been considered as one of the powerful tools in promoting the fields of imaging processing and object recognition.However,the existing optical system architecture cannot be reconstructed to the realization of multi-functional artificial intelligence systems simultaneously.To push the development of this issue,we propose the pluggable diffractive neural networks(P-DNN),a general paradigm resorting to the cascaded metasurfaces,which can be applied to recognize various tasks by switching internal plug-ins.As the proof-of-principle,the recognition functions of six types of handwritten digits and six types of fashions are numerical simulated and experimental demonstrated at near-infrared regimes.Encouragingly,the proposed paradigm not only improves the flexibility of the optical neural networks but paves the new route for achieving high-speed,low-power and versatile artificial intelligence systems.

Activation Redistribution Based Hybrid Asymmetric Quantization Method of Neural Networks

The demand for adopting neural networks in resource-constrained embedded devices is continuously increasing.Quantization is one of the most promising solutions to reduce computational cost and memory storage on embedded devices.In order to reduce the complexity and overhead of deploying neural networks on Integeronly hardware,most current quantization methods use a symmetric quantization mapping strategy to quantize a floating-point neural network into an integer network.However,although symmetric quantization has the advantage of easier implementation,it is sub-optimal for cases where the range could be skewed and not symmetric.This often comes at the cost of lower accuracy.This paper proposed an activation redistribution-based hybrid asymmetric quantizationmethod for neural networks.The proposedmethod takes data distribution into consideration and can resolve the contradiction between the quantization accuracy and the ease of implementation,balance the trade-off between clipping range and quantization resolution,and thus improve the accuracy of the quantized neural network.The experimental results indicate that the accuracy of the proposed method is 2.02%and 5.52%higher than the traditional symmetric quantization method for classification and detection tasks,respectively.The proposed method paves the way for computationally intensive neural network models to be deployed on devices with limited computing resources.Codes will be available on https://github.com/ycjcy/Hybrid-Asymmetric-Quantization.

Biodiversity metrics on ecological networks: Demonstrated with animal gastrointestinal microbiomes

Biodiversity has become a terminology familiar to virtually every citizen in modern societies.It is said that ecology studies the economy of nature,and economy studies the ecology of humans;then measuring biodiversity should be similar with measuring national wealth.Indeed,there have been many parallels between ecology and economics,actually beyond analogies.For example,arguably the second most widely used biodiversity metric,Simpson(1949)’s diversity index,is a function of familiar Gini-index in economics.One of the biggest challenges has been the high“diversity”of diversity indexes due to their excessive“speciation”-there are so many indexes,similar to each country’s sovereign currency-leaving confused diversity practitioners in dilemma.In 1973,Hill introduced the concept of“numbers equivalent”,which is based on Renyi entropy and originated in economics,but possibly due to his abstruse interpretation of the concept,his message was not widely received by ecologists until nearly four decades later.What Hill suggested was similar to link the US dollar to gold at the rate of$35 per ounce under the Bretton Woods system.The Hill numbers now are considered most appropriate biodiversity metrics system,unifying Shannon,Simpson and other diversity indexes.Here,we approach to another paradigmatic shift-measuring biodiversity on ecological networks-demonstrated with animal gastrointestinal microbiomes representing four major invertebrate classes and all six vertebrate classes.The network diversity can reveal the diversity of species interactions,which is a necessary step for understanding the spatial and temporal structures and dynamics of biodiversity across environmental gradients.

Insights into microbiota community dynamics and flavor development mechanism during golden pomfret(Trachinotus ovatus)fermentation based on single-molecule real-time sequencing and molecular networking analysis

Popular fermented golden pomfret(Trachinotus ovatus)is prepared via spontaneous fermentation;however,the mechanisms underlying the regulation of its flavor development remain unclear.This study shows the roles of the complex microbiota and the dynamic changes in microbial community and flavor compounds during fish fermentation.Single-molecule real-time sequencing and molecular networking analysis revealed the correlations among different microbial genera and the relationships between microbial taxa and volatile compounds.Mechanisms underlying flavor development were also elucidated via KEGG based functional annotations.Clostridium,Shewanella,and Staphylococcus were the dominant microbial genera.Forty-nine volatile compounds were detected in the fermented fish samples,with thirteen identified as characteristic volatile compounds(ROAV>1).Volatile profiles resulted from the interactions among the microorganisms and derived enzymes,with the main metabolic pathways being amino acid biosynthesis/metabolism,carbon metabolism,and glycolysis/gluconeogenesis.This study demonstrated the approaches for distinguishing key microbiota associated with volatile compounds and monitoring the industrial production of high-quality fermented fish products.

A data-driven model of drop size prediction based on artificial neural networks using small-scale data sets

An artificial neural network(ANN)method is introduced to predict drop size in two kinds of pulsed columns with small-scale data sets.After training,the deviation between calculate and experimental results are 3.8%and 9.3%,respectively.Through ANN model,the influence of interfacial tension and pulsation intensity on the droplet diameter has been developed.Droplet size gradually increases with the increase of interfacial tension,and decreases with the increase of pulse intensity.It can be seen that the accuracy of ANN model in predicting droplet size outside the training set range is reach the same level as the accuracy of correlation obtained based on experiments within this range.For two kinds of columns,the drop size prediction deviations of ANN model are 9.6%and 18.5%and the deviations in correlations are 11%and 15%.

Development of a convolutional neural network based geomechanical upscaling technique for heterogeneous geological reservoir

Geomechanical assessment using coupled reservoir-geomechanical simulation is becoming increasingly important for analyzing the potential geomechanical risks in subsurface geological developments.However,a robust and efficient geomechanical upscaling technique for heterogeneous geological reservoirs is lacking to advance the applications of three-dimensional(3D)reservoir-scale geomechanical simulation considering detailed geological heterogeneities.Here,we develop convolutional neural network(CNN)proxies that reproduce the anisotropic nonlinear geomechanical response caused by lithological heterogeneity,and compute upscaled geomechanical properties from CNN proxies.The CNN proxies are trained using a large dataset of randomly generated spatially correlated sand-shale realizations as inputs and simulation results of their macroscopic geomechanical response as outputs.The trained CNN models can provide the upscaled shear strength(R^(2)>0.949),stress-strain behavior(R^(2)>0.925),and volumetric strain changes(R^(2)>0.958)that highly agree with the numerical simulation results while saving over two orders of magnitude of computational time.This is a major advantage in computing the upscaled geomechanical properties directly from geological realizations without the need to perform local numerical simulations to obtain the geomechanical response.The proposed CNN proxybased upscaling technique has the ability to(1)bridge the gap between the fine-scale geocellular models considering geological uncertainties and computationally efficient geomechanical models used to assess the geomechanical risks of large-scale subsurface development,and(2)improve the efficiency of numerical upscaling techniques that rely on local numerical simulations,leading to significantly increased computational time for uncertainty quantification using numerous geological realizations.

Discontinuity development patterns and the challenges for 3D discrete fracture network modeling on complicated exposed rock surfaces

Natural slopes usually display complicated exposed rock surfaces that are characterized by complex and substantial terrain undulation and ubiquitous undesirable phenomena such as vegetation cover and rockfalls.This study presents a systematic outcrop research of fracture pattern variations in a complicated rock slope,and the qualitative and quantitative study of the complex phenomena impact on threedimensional(3D)discrete fracture network(DFN)modeling.As the studies of the outcrop fracture pattern have been so far focused on local variations,thus,we put forward a statistical analysis of global variations.The entire outcrop is partitioned into several subzones,and the subzone-scale variability of fracture geometric properties is analyzed(including the orientation,the density,and the trace length).The results reveal significant variations in fracture characteristics(such as the concentrative degree,the average orientation,the density,and the trace length)among different subzones.Moreover,the density of fracture sets,which is approximately parallel to the slope surface,exhibits a notably higher value compared to other fracture sets across all subzones.To improve the accuracy of the DFN modeling,the effects of three common phenomena resulting from vegetation and rockfalls are qualitatively analyzed and the corresponding quantitative data processing solutions are proposed.Subsequently,the 3D fracture geometric parameters are determined for different areas of the high-steep rock slope in terms of the subzone dimensions.The results show significant variations in the same set of 3D fracture parameters across different regions with density differing by up to tenfold and mean trace length exhibiting differences of 3e4 times.The study results present precise geological structural information,improve modeling accuracy,and provide practical solutions for addressing complex outcrop issues.

Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

A multilayer network diffusion-based model for reviewer recommendation

With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.

Verifying hierarchical network nonlocality in general quantum networks

Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full network nonlocality(FNN), l-level quantum network nonlocality(l-QNN) was defined in arxiv. 2306.15717 quant-ph(2024). FQNN is a NN that can be generated only from a network with all sources being non-classical. This is beyond the existing standard network nonlocality, which may be generated from a network with only a non-classical source. One of the challenging tasks is to establish corresponding Bell-like inequalities to demonstrate the FQNN or l-QNN. Up to now, the inequality criteria for FQNN and l-QNN have only been established for star and chain networks. In this paper, we devote ourselves to establishing Bell-like inequalities for networks with more complex structures. Note that star and chain networks are special kinds of tree-shaped networks. We first establish the Bell-like inequalities for verifying l-QNN in k-forked tree-shaped networks. Such results generalize the existing inequalities for star and chain networks. Furthermore, we find the Bell-like inequality criteria for l-QNN for general acyclic and cyclic networks. Finally, we discuss the demonstration of l-QNN in the well-known butterfly networks.

Special Section on Emerging Developments on Space-Terrestrial Integrated Network and Related Key Technologies

To meet the pressing demands brought by the emerging applications such as ubiquitous Internet of Things(IoT)and virtual reality(VR)/augmented reality(AR),the envisioning of space-terrestrial integrated networks(STIN)has attracted great attention from both academic and industry fields.Novel architectures and networking techniques need to be deeply investigated to enhance network flexibility and adaptability of STIN to various and dynamic environments,with the consideration of different requirements of diverse services and the characteristics of heterogeneous networks with diverse functionalities and dynamic network topology.