The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Online shopping behaviors lead to a large number of goods need to be transported in the real world. Researches on logistics have attracted extensive attentions. One of popular topics is logistic route planning. Although various previous studies have discussed some classical routing problems, real logistic constraints are not considered such as the vehicle capacity, various logistic requirements, etc...
Ad-hoc networks are collection of self-organized, autonomous nodes (routers) and capable to communicate directly with neighbors' node through broadcast packet in within transmission range. Ad hoc network has a primary concern to provide protected communication between mobile nodes. In transmission channel, nodes can be a malicious node and compromise or breaches service, which makes security extremely...
E-sports, multiplayer online games or similar Internet applications need peer-to-peer network to offer fast response and adaptability. Those typical P2P file sharing protocols can't meet this requirement good enough. This paper introduces an optimized double-layer overlay network, called GMeridian, which defines a node's placement by measuring its round-trip latency to other nodes. The results of...
In social networks, people can directly contact some acquaintances that potentially have knowledge about the resources they are looking for. Similarly to social networks, where people are connected by their social relationships, two autonomous peer nodes can be connected in unstructured peer-to-peer (P2P) networks if users in those nodes are interested in each other's data. The similarity between...
With the widely use of wireless sensor network (WSN), data forwarding security has become more and more important to the whole network. In order to avoid the selective forwarding attack, we proposed a scheme of secure data transmission which can forward the data safely, and detect the selective forwarding attack. In this paper, we judge the trust value of each node to select a secure path for message...
Efficient search in unstructured P2P networks has been extensively studied in the literature. And search in unstructured P2P networks shows promise to become an alternative to the state-of-the-art search engines. However, efficient search techniques for guaranteed location of shared resource in unstructured P2P networks are yet to be devised. The paper presents a simple but highly effective search...
The peer-to-peer network has been widely used to share large files anonymously. Because of its open nature, nodes can join and leave peer-to-peer networks freely. But there are few limited methods to ensure their trust. Malicious nodes can expose great security threats to peer-to-peer networks such as spreading unauthentic data and viruses. But handling all the malicious nodes in the same way causes...
Presently available schemes for data centric storage in sensor networks usually use geographical routing protocols to communicate data between sensor nodes. However, sensor nodes are required to know their locations for them to use geographical routing protocols. In this paper, we propose a new routing protocol that does not rely on location information, and thus can be used for data centric storage...
IEEE 802.15.4-2003 is a standard for low rate, low powered, Low memory wireless personal area network (WPAN). The physical layer (PHY) and medium access control (MAC) specification has been given by IEEE and the network layer by ZigBee alliance. They support two kind of net work tree/mess. In tree network no routing table is required for routing. After the great success in PAN this technique has also...
In distance vector routing [4,7, 9, 10] each router collects and forwards the information from and to the neighbors. It was the original ARPANET routing algorithm and use in the Internet under the RIP [2]. The methodology of collecting and broadcasting the routing related information initiates the problems i.e. (1) two-node loop instability, (2) three-node loop instability and (3) count-to-infinity,...
Fault-tolerance in an interconnection network is very important for its continuous operation over a relatively long period of time. Fault-tolerance is the ability of the system to continue operating in the presence of faults. In this paper a new irregular network IABN has been proposed and an efficient routing procedure has been defined to study the fault tolerance of the network. The behavior of...
Lookup architectures are among the well researched subjects in networking. This is due to its fundamental role in the performance of Internet routers. Internet routers use a lookup method known as Longest Prefix Match (LPM) algorithm to determine the next-hop to forward the packet to. State-of-the-art lookup designs try to achieve better search times and/or reduce storage requirements thereby sacrificing...
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so as to facilitate wire bonding, is an important physical design problem for SiP design because the quality of a pad assignment solution affects both the cost and performance of a SiP design. In this paper, we study a pad assignment...
This paper studies the effects of clustering as a pre-processing step and routability estimation in the placement flow. The study shows that when clustering and routability estimation are considered, the placer effectively improves the routed wirelength for the circuits of IBM-PLACE 2.0 standard-cell Benchmark Suite and results in the best average routed wirelength when compared against state-of-the-art...
Modern circuits become harder to route with the ever decreasing design features. Previous routability-driven placement techniques are usually tightly coupled with the underlying placers. So usually they cannot be easily integrated into various placement tools. In this paper, we propose a tool called CROP (Congestion Refinement of Placement) for mixed-size placement solutions. CROP is independent of...
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner tree problem optimally. Our work is developed based on the GeoSteiner approach, modified and extended to allow rectilinear blockages in the routing region. We extended the proofs on the possible topologies of full Steiner tree (FST) to allow blockages, where FST is the basic concept used in GeoSteiner...
In Data-Centric Storage sensor networks where numerous sensors collaborate to monitor and report occurrences of environmental events, GPSR routing algorithm can be used to route event and query packets efficiently. However, the routing algorithm usually routes packets completely around perimeters enclosing destination locations. In this paper, we show that such perimeter walks cause significant overhead...
With the wide deployment of P2P networks, the attacks against them have been attracting more and more attention. However, studies on security problems in P2P network mainly focus on individual attack. We still lack systemic analysis of attacks in P2P network. Understanding the taxonomy and the relationships between attacks will help to build the security mechanism and effectively organize the defense...
The traditional Pastry design is a flat overlay network and limited-scope searching, in which all nodes have identical capabilities and responsibilities and all communication is symmetric. But in practice, because of a variety of available bandwidth and delay, each node has different capabilities. in this paper, a hierarchical Pastry network model is presented to address this limitation. Furthermore,...
Distributed denial of service (DDoS) attacks have become a major threat to organizations and especially to Internet and intranet. In DDoS attacks targets are overwhelmed by sending an enormous amount of traffic from a number of attack sites. The major tasks of any defense system are to detect these attacks accurately and early on, before it causes an unrecoverable loss. Most of the research in this...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.