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.
Opportunistic Mobile Social Networks (MSNs) are a type of delay-tolerant networks that are composed of mobile nodes with social characteristics. Most of current research on forwarding algorithms for MSNs leverages the properties of social networks, such as community and centrality. However, the fundamental property, interaction, has not received sufficient attention. The effects of interactions consist...
Pending Interest Table (PIT) in Named Data Networking (NDN) architecture is complex in the forwarding operation in both upload of Interest packets and download of Data packets. PIT is considered useful for so many reasons in the centric-networking. These among other operations include: reducing bandwidth usage, communicating with no prior knowledge of publishers and subscribers, loop and packet loss...
This paper presents a novel multipath load balancing algorithm called priority-based adaptive weighting (PAW) for video over software defined networks (SDN). Based on priority differentiation among video packets, PAW adopts a per-packet strategy to distribute ingress video packets over the multiple egress ports of an entry SDN-switch connecting to those output links leading to the same IP destination,...
We present an analytical framework to investigate the interplay between a communication graph and an overlay of social relationships. Particularly, we focus on geographical distance as the key element that interrelates the concept of routing in a communication network with interaction patterns on the social graph. Through this regime, we attempt to identify classes of social relationships that let...
Large service providers (SP) who own their computing, storage, and networking resources have the potential to jointly manage their resources to achieve better quality of service and lower cost. Information-centric networking (ICN) exploits in-network caching resource, by unique identification of content objects. Orchestrating cache and networking resources in a coordinated way is the key to the success...
Opportunistic routing is studied as a representative example of location-aware greedy routing schemes. The routing process between an arbitrary source-destination pair is modeled as a directed random walk between the two ends in the underlying graph. The mean number of transmissions as well as the average multi-hop distance between arbitrary nodes are unified under a conceptual measure called expected...
We derive asymptotic expressions for the probability mass function (PMF) of the number of hops (a.k.a hop-count distribution) required to reach a designated distance D in random, connected and uniformly distributed one- and two-dimensional ad hoc networks. The elegance of the result is owned to the application of Renewal Theory, a generalization of Poisson processes. The method is general, requiring...
This paper proposes a formulation of the multi-depot vehicle routing problem (MDVRP) that is solved by the particle swarm optimization (PSO) algorithm. PSO is one of the evolutionary computation technique, motivated by the group organism behavior such as bird flocking or fish schooling. Compared with other search methods, such as genetic algorithm, ant colony optimization and simulated annealing algorithm,...
There are more and more attacks aiming at P2P network, and those attacks take on sophisticated technology and hidden ways, which bring in serious threat to P2P network. Current countermeasure only copes with one certain kind of P2P attack, and is powerless to other attacks or new emerged attack. We have researched features and effects of main P2P attacks with quantitative analysis method, and have...
The paper considers a problem of minimizing the total number of labels that are necessary to realize a given set of end-to-end connections in a GMPLS transport network where traffic is handled by means of Label Switched Paths-connections established using the label switching principle. The problem is important for the networks where labels are a scarce/expensive resource, like in optical networks...
With the extremely high volume of traffic carried on wavelength division multiplexing (WDM) networks, survivability becomes increasingly critical in managing high speed networks. In a WDM network, the failure of network element (i.e. fiber links, and cross connects) may cause the failure of several optical channels, thereby leading to large data loss. Here the different approaches are investigated...
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 introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
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.