Papers published on a yearly basis
Papers
More filters
••
TL;DR: A much better bound is proved on the tree-width of planar graphs with no minor isomorphic to a g × g grid and this is the best known bound.
488 citations
••
TL;DR: Simulation results demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes, and indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.
Abstract: The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree. Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate domains with different unicast protocols. Certain tree nodes are designated by AMRoute as logical cores, and are responsible for initiating and managing the signaling component of AMRoute, such as detection of group members and tree setup. Logical cores differ significantly from those in CBT and PIM-SM, since they are not a central point for data distribution and can migrate dynamically among member nodes. Simulation results (using ns-2) demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.
477 citations
•
02 Feb 1994TL;DR: A store-and-forward architecture which stores and distributes information programs to subscribers includes: information warehouses which archive information programs and dispense information programs in segments to central offices in bursts; central offices which manage subscriber's requests for service and buffer segments of information programs for delivery to subscribers in real-time under the subscriber's interactive control; and customer premises equipment as discussed by the authors.
Abstract: A store-and-forward architecture which stores and distributes information programs to subscribers includes: information warehouses which archive information programs and dispense information programs in segments to central offices in bursts; central offices which manage subscriber's requests for service and buffer segments of information programs for delivery to subscribers in real-time under the subscriber's interactive control; and customer premises equipment. The central offices employ CO buffers, and each CO buffer includes: processors (402, 405), for administering internal buffer operations and processing subscribers requests based upon the service presentation script and a program presentation map; interfaces (43, 46) for providing external access; busses (411, 412) for internal transport; buffer storage (403, 404) for storing segments of information programs; and memory storage (407, 413) for storing the script and map.
464 citations
••
TL;DR: The tree-width of a graph G is the minimum k such that G may be decomposed into a "tree-structure" of pieces each with at most k + l vertices, and it is proved that this equals the maximum ksuch that there is a collection of connected subgraphs, pairwise intersecting or adjacent, such that no set of ≤ k vertices meets all of them.
460 citations
••
TL;DR: Two improvements for the solution of Maxwell's equations in periodic dielectrics media are introduced, abandoning the plane-wave cutoff and interpolating the dielectric function, which permit the accurate study of previously inaccessible systems.
Abstract: Two improvements for the solution of Maxwell's equations in periodic dielectric media are introduced, abandoning the plane-wave cutoff and interpolating the dielectric function. These improvements permit the accurate study of previously inaccessible systems. Example calculations are discussed, employing a basis of \ensuremath{\sim}${10}^{6}$ plane waves for which these two improvements reduce both the memory and central processing unit requirements by \ensuremath{\sim}${10}^{4}$.
439 citations
Authors
Showing all 3097 results
Name | H-index | Papers | Citations |
---|---|---|---|
Joseph E. Stiglitz | 164 | 1142 | 152469 |
Pete Smith | 156 | 2464 | 138819 |
Jean-Marie Tarascon | 136 | 853 | 137673 |
Ramamoorthy Ramesh | 122 | 649 | 67418 |
Martin Vetterli | 105 | 761 | 57825 |
Noga Alon | 104 | 895 | 44575 |
Amit P. Sheth | 101 | 753 | 42655 |
Harold G. Craighead | 101 | 569 | 40357 |
Susan T. Dumais | 100 | 346 | 60206 |
Andrzej Cichocki | 97 | 952 | 41471 |
Robert E. Kraut | 97 | 297 | 38116 |
Kishor S. Trivedi | 95 | 698 | 36816 |
David R. Clarke | 90 | 553 | 36039 |
Axel Scherer | 90 | 736 | 43939 |
Michael R. Lyu | 89 | 696 | 33257 |