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.
Multistage interconnection networks (MINs) are commonly deployed in sorting, switching, and other applications. Arithmetic over MINs for various applications is hereby unified in algebra. The key is to structure the signal alphabet as a distributive lattice instead of an ordered set. The theoretic unification enhances the mathematical understanding of properties of MINs and, in particular, demystifies...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
In order to achieve the access of massive high-dimensional data on P2P network efficiently, we present a distributed similarity retrieval system named R-Chord using modified iDistance based on relative position code (RPCID). RPCID calculates the lower bound distance between the query point and the data point using relative position code (RPC). RPC is a data object encoding method based on spatial...
The network coding capacity of a single multicast traffic is characterized by the min-cut/max-flow (mcMF) theorem, which can be achieved by random linear network coding (RLNC). Nonetheless, the graph-theoretic characterization for multiple unicast/multicast traffic remains an open problem. This paper proposes and studies a new class of intersession-network-coding schemes: RLNC with selective cancelling...
This paper study on the MDVRP with vehicle sharing, the vehicles can come to any depots. And we present an improved genetic algorithm with chromosome representing the clients. A typical result and the analysis of experiment indicate the validity of the method to solve the MDVRP.
We study end-to-end delay performance of different routing algorithms in networks with random failures. Specifically, we compare delay performances of differential backlog (DB) and shortest path (SP) routing algorithms and show that DB routing outperforms SP routing in terms of throughput when the network is heavily loaded and/or the failure rate is high while SP routing achieves better delay performance...
In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating...
Network design problem is usually complicated. Network designers may have to optimize various design objectives simultaneously. This paper considers a multi-objective network design problem for routing wavelength assignment (RWA) in WDM networks. The design objectives are to maximize the number of accepted communication requests (source-destination pairs) as well as to minimize the number of wavelength...
Efficient discovery of information based on partially specified and misspelled query keywords is a challenging problem in large scale peer-to-peer (P2P) networks. This paper presents QPM, a P2P search mechanism for efficient information retrieval with misspelled and partial keywords. QPM uses the double metaphone algorithm to phonetically match misspelled query keywords with advertised keywords. For...
In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.
Delay Tolerant Networks (DTN) are sparse ad hoc networks in which no contemporaneous path exists between any two nodes in the network most of the time. Due to non-availability of end-to-end paths, multicast protocols of traditional networks fail in DTN because they try to find connected multicast graph between source and destination nodes before forwarding data packets. Routing protocols proposed...
This paper proposes an improved retain and replace (QGDA) genetic algorithm through selecting code in the ad hoc network routing. The simulation shows that this algorithm has more superior than that of the traditional retain elites (GAES) genetic algorithm and based on information entropy IEIAE immune algorithm in the delay and control of the expenditure.
Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models in grain logistics (GLVRP) and its intelligent algorithm. The objective of GLVRP is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. In this paper, a novel real number encoding...
In the IEEE 802.16j multi-hop relay (MR) network, the design of an effective path selection scheme is an important issue for throughput gain and overhead reduction. This paper proposes a new metric, called SEL, to evaluate the possible relay paths and thereby determine the appropriate one among these paths. SEL mainly considers both link spectral efficiency and link load, and based on SEL, a comprising...
This paper aims to introduce the hard optimization problem of determining tree-based explicit multicast routes with minimum cost. Explicit multicast routing has been proposed as a technique to solve the problem of multicast scalability in IP-based networks. Tree-based explicit routing is a special routing technique in which the multicast tree is encoded explicitly in the datagram headers. These enlarged...
In the open vehicle routing problem (OVRP), a vehicle does not return to the depot after servicing the last customer on a route. The description of this variant of the standard vehicle routing problem appeared in the literature over 20 years ago, but it has still received little attention from researchers for a satisfactory solution. In this paper, a novel real number encoding method of particle swarm...
In this paper, a multi-depot vehicle routing problem with weight-related cost (MDVRPWRC) is discussed. It is an extension of the classical multi-depot vehicle routing problem (MDVRP) by treating the vehicle load, i.e. the total weight of freight in a vehicle, as a variable in the objective of model. The corresponding costs incurred by the vehicle load are considered in the objective function when...
Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. Recently, network coding schemes for DTN has been proposed. However, these schemes work well only in scenarios...
Ngai-Yeung and Erez-Feder independently derived the capacity region of network coding with a single source and two sinks, in which a common message is sent from the source to both sinks but each private message is sent to only the corresponding sink. In this paper, it is shown that the above capacity region can be achieved by separate linear coding such that three routes of private and common messages...
We study the computation of the arithmetic sum of the q-ary source messages in the reverse butterfly network. Specifically, we characterize the maximum rate at which the message sum can be computed at the receiver and demonstrate that linear coding is suboptimal.
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.