grapes are among the world most planted horticultural crops. since the last century, attempts have been made to improve the quality of grapes in the world. meanwhile, the necessity of having knowledge about the history of progenies families led to the link between genealogy and breeding. considering some previous mislabeling, in order to find out the accuracy of the controlled crosses as well a...

This paper revisits the problem of Traffic Engineering (TE) to evaluate the performance improvements achieved by destination-based TE when OSPF routing is fine-tuned to achieve route optimisation. We build upon the framework provided by evolutionary algorithms to present a TE model where link weights are computed by a genetic algorithm and used as fine-tuning parameters in destination-based pat...

A number of emerging dynamic traffic analysis applications, such as regional or statewide traffic assignment, require a theoretically rigorous and computationally efficient model to describe the propagation and dissipation of system congestion with bottleneck capacity constraints. An open-source light-weight dynamic traffic assignment (DTA) package, namely DTALite, has been developed to allow a...

The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have focused exclusively on producing paths with high bandwidth. In contrast to traditional node-based path techniques in which relay selection is biased by relays’ node-characteristics (i.e., bandwidth), this paper presents...

This paper considers the link capacity requirement for a N N mesh-torus network under a uniform all-to-all traffic model. Both primary capacity and spare capacity for recovering from link failures are examined. In both cases, we use a novel method of “cuts on a graph” to obtain lower bounds on capacity requirements and subsequently find algorithms for routing and failure recovery that meet thes...

This paper investigates the problem of path calcul ation of multiple metric routing. Toda 's Internet routing is based on a single metric path selecting algorithm. Single metric path is a best effort service that can only support path for one requirement. In order to support quality-of-service(QoS) call, path is subjec to multiple constraints on routing metric. In many cases, the path finding p...