Based on the advantages of both Grid and peer-to-peer （P2P） networks, an overlay network in the Grid environment is constructed by P2P technologies by a modified version of the Chord protocol. In this mechanism, dif...Based on the advantages of both Grid and peer-to-peer （P2P） networks, an overlay network in the Grid environment is constructed by P2P technologies by a modified version of the Chord protocol. In this mechanism, different nodes＇ accesses to different resources are determined by their contribution. Therefore, the heterogeneous resources of virtual organizations in large-scale Grid can be effectively integrated, and the key node failure as well as system bottleneck in the traditional Grid environment is eliminated. The experimental results indicate that this management mechanism can achieve better average performance in the Grid environment and maintain the P2P characteristics as well.展开更多
Overlay networking is one of the perspective solutions to today's Intemet challenges. At basic service level, overlay networks can serve as a supplement and enhancement of existing services, such as routing and ad...Overlay networking is one of the perspective solutions to today's Intemet challenges. At basic service level, overlay networks can serve as a supplement and enhancement of existing services, such as routing and addressing. At high application level, overlay networks can be used for applications, which are difficult to deploy in existing IP architecture with some specific reasons, e.g., they need high-level information, which is hard to obtain by underlying layers. To address the heterogeneity of today's Internet, overlay networks provide ways to service availability and desirable performance while retaining scalability. In contrast to changing the existing network layer, overlay networks allow bootstrapping, which is most important in the development of Internet infrastructure. Various applications of overlay networking are clarified in this paper. Research challenges including routing and searching in overlay networking are also identified.展开更多
Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and ma...Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.展开更多
Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and h...Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and hierarchical clustering can search the required target quickly, however, in a tree, the internal node has a higher load and its leave or crash often causes a large population of its offspring's problems, so that in the highly dynamic Internet environment the tree structure may still suffer frequent breaks. On the other hand, most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. So, we consider both of the above systems' advantages and disadvantages and realize that in the P2P systems one node may fail easily, but that when a number of nodes organized as a set, which we call "super node", the set is robust. Super nodes can be created and updated aware of topology-aware, and used with simple protocol such as flooding or "servers" to exchange information. Furthermore the entire robust super node can be organized into exquisite tree structure. By using this overlay network architecture, P2P systems are robust, efficient, scalable and secure. The simulation results demonstrated that our architecture greatly reduces the alteration time of the structure while decreasing the average delay time, compared to the common tree structure.展开更多
This paper proposes a channel allocation scheme for multimedia wireless networks,in which a twolayer macro-cell or micro-cell architecture is considered.Macro-cells are used to access high-mobility services;while micr...This paper proposes a channel allocation scheme for multimedia wireless networks,in which a twolayer macro-cell or micro-cell architecture is considered.Macro-cells are used to access high-mobility services;while micro-cells,which are overlaid by the macro-cells,are used to cater low-mobility services.To analyze the scheme,a multidimensional Markov traffic model is firstly developed,in which traffic characteristic of two special periods of time is considered.And then,a pre-emptive channel-borrowing scheme combined with trafficoverflowing strategy for multimedia(voice,video or data) networks is proposed,in which handoff requests can not only borrow channels from adjacent homogenous cells,but also be overflowed to heterogeneous cells.Priority strategies are also dedicated to high-mobility services for they can pre-empt channels being used by low-mobility services in macro-cells.To meet the high quality of service(QoS) requirements of video services and increase the channel utilization ratio,video services can be transformed between real-time services and non-real-time services as necessary.Simulation results show that our schemes can decrease the blocking probabilities and improve the channel utilization.展开更多
This paper presents a method to model network delay for overlay network application. The network topology measurement technology and network AS information is used to build up model of network delay via AS and geograp...This paper presents a method to model network delay for overlay network application. The network topology measurement technology and network AS information is used to build up model of network delay via AS and geographic distance. Based on global Internet measurement result, we calculated the parameters of the model. Furthermore, the model verification is done by comparing on AS-MMI protocol and HMTP protocol.展开更多
Once deployed, sensor networks are capable of providing a comprehensive view of their environment. However, since the current sensor network paradigm promotes isolated networks that are statically tasked, the full pow...Once deployed, sensor networks are capable of providing a comprehensive view of their environment. However, since the current sensor network paradigm promotes isolated networks that are statically tasked, the full power of the harnessed data has yet to be exploited. In recent years, users have become mobile enti-ties that require constant access to data for efficient and autonomous processing. Under the current limita-tions of sensor networks, users would be restricted using only a subset of the vast amount of data being col-lected;depending on the networks they are able to access. Through reliance on isolated networks, prolifera-tion of sensor nodes can easily occur in any area that has high appeals to users. Furthermore, support for dy-namic tasking of nodes and efficient processing of data is contrary to the general view of sensor networks as subject to severe resource constraints. Addressing the aforementioned challenges requires the deployment of a system that allows users to take full advantage of data collected in the area of interest to their tasks. Such a system must enable interoperability of surrounding networks, support dynamic tasking, and swiftly react to stimuli. In light of these observations, we introduce a hardware-overlay system designed to allow users to efficiently collect and utilize data from various heterogeneous sensor networks. The hardware-overlay takes advantage of FPGA devices and the mobile agent paradigm in order to efficiently collect and process data from cooperating networks. The computational and power efficiency of the prototyped system are herein demonstrated. Furthermore, as a proof-of-concept, we present the implementation of a distributed and autonomous visual object tracker implemented atop the Reconfigurable and Interoperable Sensor Network (RISN) showcasing the network’s ability to support ad-hoc agent networks dedicated to user’s tasks.展开更多
Overlay multicast has become one of the most promising multicast solutions for IP network,and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in v...Overlay multicast has become one of the most promising multicast solutions for IP network,and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem,it is incapable of dealing with large scale networks due to the large number of neurons. In this paper,a neural network for overlay multicast tree com-putation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture,which is comprised of Independent Variable Neurons(IDVN) and Dependent Variable Neurons(DVN) ,according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms,it is characterized as shorter computational time,fewer neurons,and better precision.展开更多
Polylactic acid(PLA)is a potential polymer material used as a substitute for traditional plastics,and the accurate molecular weight distribution range of PLA is strictly required in practical applications.Therefore,ex...Polylactic acid(PLA)is a potential polymer material used as a substitute for traditional plastics,and the accurate molecular weight distribution range of PLA is strictly required in practical applications.Therefore,exploring the relationship between synthetic conditions and PLA molecular weight is crucially important.In this work,direct polycondensation combined with overlay sampling uniform design(OSUD)was applied to synthesize the low molecular weight PLA.Then a multiple regression model and two artificial neural network models on PLA molecular weight versus reaction temperature,reaction time,and catalyst dosage were developed for PLA molecular weight prediction.The characterization results indicated that the low molecular weight PLA was efficiently synthesized under this method.Meanwhile,the experimental dataset acquired from OSUD successfully established three predictive models for PLA molecular weight.Among them,both artificial neural network models had significantly better predictive performance than the regression model.Notably,the radial basis function neural network model had the best predictive accuracy with only 11.9%of mean relative error on the validation dataset,which improved by 67.7%compared with the traditional multiple regression model.This work successfully predicted PLA molecular weight in a direct polycondensation process using artificial neural network models combined with OSUD,which provided guidance for the future implementation of molecular weight-controlled polymer's synthesis.展开更多
This paper presents Sphere, a scalable multicast framework in overlay network. Sphere is a highly efficient, serf-organizing and robust multicast protocol overlayed on the Internet. The main contrihutions of this pape...This paper presents Sphere, a scalable multicast framework in overlay network. Sphere is a highly efficient, serf-organizing and robust multicast protocol overlayed on the Internet. The main contrihutions of this paper are twofold. First, Sphere organizes the control topology of overlay network in two directions： horizontal and vertical. The horizontal meshes are used to locate and organize hosts in tracks, and the vertical meshes are. used to manage the data paths between tracks. Second, Sphere balances stress and stretch of the overlay network by assigning hosts into different tracks and clusters. This structure distributes stress on the muhicast trees uniformly, and meantime makes path stretch as small as possible. Simulations results show that Sphere can support multicast with large group size and has good performance on organizing meshes and building data delivery trees.展开更多
To accurately track computer viruses,an overlay network that monitors the activities of viruses is constructed.Identifying and locating nodes infected by virus on network is achieved by a naming system in which a node...To accurately track computer viruses,an overlay network that monitors the activities of viruses is constructed.Identifying and locating nodes infected by virus on network is achieved by a naming system in which a node in the network is mapped to a unique serial number of the hard-drive.By carefully monitoring and recording sensitive communication between local system and remote nodes on the network,and suspicious operations on files that originate from remote nodes and entered via some form of file transfer,activities of viruses in both local and network level are recorded and ready for future analysis.These data can also be used in analysis of the mechanism of a computer virus as well as its spreading mode and pattern.展开更多
In this paper, we propose the dynamically-evolving active overlay network （DEAON）, which is an efficient, scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P network...In this paper, we propose the dynamically-evolving active overlay network （DEAON）, which is an efficient, scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P networks. DEAON consists of three novel components ： a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph; a Semantic-based Neighbor Selection scheme to conduct an online neighbor ranking; a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare DEAON with other several existing distributed search techniques over static and dynamic environments. The results indicate that DEAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.展开更多
From the viewpoint of game theory,this paper proposes a model that combines QoS index with price factor in overlay access networks,and uses the multinomial logit(MNL)to model the choice behaviour of users.Each service...From the viewpoint of game theory,this paper proposes a model that combines QoS index with price factor in overlay access networks,and uses the multinomial logit(MNL)to model the choice behaviour of users.Each service class is considered an independent and competitive entity offered by each provider,which aims at maximizing its own utility.Based on noncooperative game,we prove the existence and uniqueness of equilibriums between QoS levels and prices among various service classes,and demonstrate the properties of equilibriums.Finally,these results are verified via ntunerieal analysis.展开更多
基金The National Natural Science Foundation of China(No60573133)the National Basic Research Program of China (973Program)(No2003CB314801)
文摘Based on the advantages of both Grid and peer-to-peer （P2P） networks, an overlay network in the Grid environment is constructed by P2P technologies by a modified version of the Chord protocol. In this mechanism, different nodes＇ accesses to different resources are determined by their contribution. Therefore, the heterogeneous resources of virtual organizations in large-scale Grid can be effectively integrated, and the key node failure as well as system bottleneck in the traditional Grid environment is eliminated. The experimental results indicate that this management mechanism can achieve better average performance in the Grid environment and maintain the P2P characteristics as well.
文摘Overlay networking is one of the perspective solutions to today's Intemet challenges. At basic service level, overlay networks can serve as a supplement and enhancement of existing services, such as routing and addressing. At high application level, overlay networks can be used for applications, which are difficult to deploy in existing IP architecture with some specific reasons, e.g., they need high-level information, which is hard to obtain by underlying layers. To address the heterogeneity of today's Internet, overlay networks provide ways to service availability and desirable performance while retaining scalability. In contrast to changing the existing network layer, overlay networks allow bootstrapping, which is most important in the development of Internet infrastructure. Various applications of overlay networking are clarified in this paper. Research challenges including routing and searching in overlay networking are also identified.
文摘Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.
基金Project (Nos. 60502014 and 60432030) supported by the National Natural Science Foundation of China
文摘Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and hierarchical clustering can search the required target quickly, however, in a tree, the internal node has a higher load and its leave or crash often causes a large population of its offspring's problems, so that in the highly dynamic Internet environment the tree structure may still suffer frequent breaks. On the other hand, most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. So, we consider both of the above systems' advantages and disadvantages and realize that in the P2P systems one node may fail easily, but that when a number of nodes organized as a set, which we call "super node", the set is robust. Super nodes can be created and updated aware of topology-aware, and used with simple protocol such as flooding or "servers" to exchange information. Furthermore the entire robust super node can be organized into exquisite tree structure. By using this overlay network architecture, P2P systems are robust, efficient, scalable and secure. The simulation results demonstrated that our architecture greatly reduces the alteration time of the structure while decreasing the average delay time, compared to the common tree structure.
基金the National Natural Science Foundation of China (No.60802058)the Leading Academic Discipline Project of Shanghai Municipal Education Commission (No.J51801)
文摘This paper proposes a channel allocation scheme for multimedia wireless networks,in which a twolayer macro-cell or micro-cell architecture is considered.Macro-cells are used to access high-mobility services;while micro-cells,which are overlaid by the macro-cells,are used to cater low-mobility services.To analyze the scheme,a multidimensional Markov traffic model is firstly developed,in which traffic characteristic of two special periods of time is considered.And then,a pre-emptive channel-borrowing scheme combined with trafficoverflowing strategy for multimedia(voice,video or data) networks is proposed,in which handoff requests can not only borrow channels from adjacent homogenous cells,but also be overflowed to heterogeneous cells.Priority strategies are also dedicated to high-mobility services for they can pre-empt channels being used by low-mobility services in macro-cells.To meet the high quality of service(QoS) requirements of video services and increase the channel utilization ratio,video services can be transformed between real-time services and non-real-time services as necessary.Simulation results show that our schemes can decrease the blocking probabilities and improve the channel utilization.
文摘This paper presents a method to model network delay for overlay network application. The network topology measurement technology and network AS information is used to build up model of network delay via AS and geographic distance. Based on global Internet measurement result, we calculated the parameters of the model. Furthermore, the model verification is done by comparing on AS-MMI protocol and HMTP protocol.
文摘Once deployed, sensor networks are capable of providing a comprehensive view of their environment. However, since the current sensor network paradigm promotes isolated networks that are statically tasked, the full power of the harnessed data has yet to be exploited. In recent years, users have become mobile enti-ties that require constant access to data for efficient and autonomous processing. Under the current limita-tions of sensor networks, users would be restricted using only a subset of the vast amount of data being col-lected;depending on the networks they are able to access. Through reliance on isolated networks, prolifera-tion of sensor nodes can easily occur in any area that has high appeals to users. Furthermore, support for dy-namic tasking of nodes and efficient processing of data is contrary to the general view of sensor networks as subject to severe resource constraints. Addressing the aforementioned challenges requires the deployment of a system that allows users to take full advantage of data collected in the area of interest to their tasks. Such a system must enable interoperability of surrounding networks, support dynamic tasking, and swiftly react to stimuli. In light of these observations, we introduce a hardware-overlay system designed to allow users to efficiently collect and utilize data from various heterogeneous sensor networks. The hardware-overlay takes advantage of FPGA devices and the mobile agent paradigm in order to efficiently collect and process data from cooperating networks. The computational and power efficiency of the prototyped system are herein demonstrated. Furthermore, as a proof-of-concept, we present the implementation of a distributed and autonomous visual object tracker implemented atop the Reconfigurable and Interoperable Sensor Network (RISN) showcasing the network’s ability to support ad-hoc agent networks dedicated to user’s tasks.
基金the High-tech Project of Jiangsu Province (No.BG2003001).
文摘Overlay multicast has become one of the most promising multicast solutions for IP network,and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem,it is incapable of dealing with large scale networks due to the large number of neurons. In this paper,a neural network for overlay multicast tree com-putation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture,which is comprised of Independent Variable Neurons(IDVN) and Dependent Variable Neurons(DVN) ,according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms,it is characterized as shorter computational time,fewer neurons,and better precision.
基金funded by the Zhejiang Provincial Natural Science Foundation of China(LD21B060001)the National Natural Science Foundation of China(22078296,21576240).
文摘Polylactic acid(PLA)is a potential polymer material used as a substitute for traditional plastics,and the accurate molecular weight distribution range of PLA is strictly required in practical applications.Therefore,exploring the relationship between synthetic conditions and PLA molecular weight is crucially important.In this work,direct polycondensation combined with overlay sampling uniform design(OSUD)was applied to synthesize the low molecular weight PLA.Then a multiple regression model and two artificial neural network models on PLA molecular weight versus reaction temperature,reaction time,and catalyst dosage were developed for PLA molecular weight prediction.The characterization results indicated that the low molecular weight PLA was efficiently synthesized under this method.Meanwhile,the experimental dataset acquired from OSUD successfully established three predictive models for PLA molecular weight.Among them,both artificial neural network models had significantly better predictive performance than the regression model.Notably,the radial basis function neural network model had the best predictive accuracy with only 11.9%of mean relative error on the validation dataset,which improved by 67.7%compared with the traditional multiple regression model.This work successfully predicted PLA molecular weight in a direct polycondensation process using artificial neural network models combined with OSUD,which provided guidance for the future implementation of molecular weight-controlled polymer's synthesis.
文摘This paper presents Sphere, a scalable multicast framework in overlay network. Sphere is a highly efficient, serf-organizing and robust multicast protocol overlayed on the Internet. The main contrihutions of this paper are twofold. First, Sphere organizes the control topology of overlay network in two directions： horizontal and vertical. The horizontal meshes are used to locate and organize hosts in tracks, and the vertical meshes are. used to manage the data paths between tracks. Second, Sphere balances stress and stretch of the overlay network by assigning hosts into different tracks and clusters. This structure distributes stress on the muhicast trees uniformly, and meantime makes path stretch as small as possible. Simulations results show that Sphere can support multicast with large group size and has good performance on organizing meshes and building data delivery trees.
基金Project is supported by the National Nature Science Foundation of China(Grant No.60672142,60772053,90304005)New architecture and technology for the Internet information sharing,The relation and Countermeasure of Application Layer Behavior and Collective Performance of Internet,Forecast of Traffic Model on Internet+1 种基金Supported by National Basic Research Program of China,(Grant No.2007CB307100,Project No.2007CB307105)The Theory of Mobility and Sensor Network under The Integrated Network and the Universal Ap-plicable Service System
文摘To accurately track computer viruses,an overlay network that monitors the activities of viruses is constructed.Identifying and locating nodes infected by virus on network is achieved by a naming system in which a node in the network is mapped to a unique serial number of the hard-drive.By carefully monitoring and recording sensitive communication between local system and remote nodes on the network,and suspicious operations on files that originate from remote nodes and entered via some form of file transfer,activities of viruses in both local and network level are recorded and ready for future analysis.These data can also be used in analysis of the mechanism of a computer virus as well as its spreading mode and pattern.
文摘In this paper, we propose the dynamically-evolving active overlay network （DEAON）, which is an efficient, scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P networks. DEAON consists of three novel components ： a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph; a Semantic-based Neighbor Selection scheme to conduct an online neighbor ranking; a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare DEAON with other several existing distributed search techniques over static and dynamic environments. The results indicate that DEAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.
基金Supported by the High Technology Research and Development Programme of China(No.2003AA121220)the National Natural Science Foundation of China(No.60472067).
文摘From the viewpoint of game theory,this paper proposes a model that combines QoS index with price factor in overlay access networks,and uses the multinomial logit(MNL)to model the choice behaviour of users.Each service class is considered an independent and competitive entity offered by each provider,which aims at maximizing its own utility.Based on noncooperative game,we prove the existence and uniqueness of equilibriums between QoS levels and prices among various service classes,and demonstrate the properties of equilibriums.Finally,these results are verified via ntunerieal analysis.
