Learn More
In this report we review recent theoretical progress and the latest experimental results in jet substructure from the Tevatron and the LHC. We review the status of and outlook for calculation and simulation tools for studying jet substructure. Following up on the report of the Boost 2010 workshop, we present a new set of benchmark comparisons of(More)
Robustness of distributed routing policies is studied for dynamical flow networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical flow network is modeled as a system of ordinary differential equations derived from mass conservation laws on a directed acyclic graph with a single origin-destination pair and a(More)
Use of ICT (Information and Communication Technology) or the computer communication using electronic messaging has increased tremendously in recent years. Also the modern networks that support ICT are robust, i.e., its failure due to links, routing protocols, congestion etc is rare and as a result, the estimation of the overall reliability of the(More)
This paper proposes a modeling of data networks with delay, packet loss ratio and network cost and an optimization of them using genetic algorithm. The network delay is expressed in terms of three delays such as propagation delay, transmission delay and queuing delay of links. The packet loss ratio is defined as the ratio of successful packet transmission(More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. In this report we review recent theoretical progress and the latest experimental results in jet substructure from the Tevatron and the LHC. We review the status of and outlook for calculation and simulation tools for studying jet(More)
Data communication networks are often analyzed for the estimation of their dependability and one of the most requirements is to calculate the reliability of the nodes. Since the time complexity of the reliability calculation algorithms is O(n2), this paper proposes a linear-time approximation technique to identify lower reliable node-pairs without(More)
The packets in a data network follow different paths from source to destination and the possible longest path traversed by a packet in a network having « nodes is (n-1). This is termed as the worst case condition and the route followed is called the critical path. The critical paths increase transmission delay, cost, network traffic etc, thus(More)
  • 1