Papers published on a yearly basis
Papers
More filters
••
04 Nov 1998TL;DR: This work used automatic test case generation technology to develop sets of self checking test cases based on a machine readable specification of the messages in the protocol under test, and found the combinatorial approach of covering pairwise interactions between input fields to be highly effective.
Abstract: The paradigm of model based testing shifts the focus of testing from writing individual test cases to developing a model from which a test suite can be generated automatically. We report on our experience with model based testing of a highly programmable system that implements intelligent telephony services in the US telephone network. Our approach used automatic test case generation technology to develop sets of self checking test cases based on a machine readable specification of the messages in the protocol under test. The AETG/sup TM/ software system selected a minimal number of test data tuples that covered pairwise combinations of tuple elements. We found the combinatorial approach of covering pairwise interactions between input fields to be highly effective. Our tests revealed failures that would have been difficult to detect using traditional test designs. However, transferring this technology to the testing organization was difficult. Automatic generation of cases represents a significant departure from conventional testing practice due to the large number of tests and the amount of software development involved.
65 citations
••
TL;DR: A framing congestion control strategy based on a packet admission policy at the edges of the network and on a service discipline called stop-and-go queuing at the switching nodes is described, which provides bounded end-to-end delay and a small and controllable delay-jitter.
Abstract: The problem of congestion control in high-speed networks for multimedia traffic, such as voice and video, is considered. It is shown that the performance requirements of high-speed networks involve delay, delay-jitter, and packet loss. A framing congestion control strategy based on a packet admission policy at the edges of the network and on a service discipline called stop-and-go queuing at the switching nodes is described. This strategy provides bounded end-to-end delay and a small and controllable delay-jitter. The strategy is applicable to packet switching networks in general, including fixed cell length asynchronous transfer mode (ATM), as well as networks with variable-size packets. >
65 citations
•
29 Apr 2010TL;DR: In this article, a mapping table is created to indicate correlations between IP prefixes and AS numbers, based on routing information collected from a plurality of data sources, and an EAS table is used to determine if an operation traffic flow is allowed to enter the network.
Abstract: A method and apparatus for detecting spoofed IP network traffic is presented. A mapping table is created to indicate correlations between IP address prefixes and AS numbers, based on routing information collected from a plurality of data sources. At each interface of a target network, IP address prefixes from a training traffic flow are acquired and further converted into AS numbers based on the mapping table. An EAS (Expected Autonomous System) table is populated by the AS numbers collected for each interface. The EAS table is used to determine if an operation traffic flow is allowed to enter the network.
65 citations
•
TL;DR: A least-squares algorithm for fitting ultrametric and path length or additive trees to two-way, two-mode proximity data to enforce theUltrametric inequality generalized for asymmetric, and generally rectangular (rather than square) proximity matrices in estimating an Ultrametric tree.
Abstract: A least-squares algorithm for fitting ultrametric and path length or additive trees to two-way, two-mode proximity data is presented. The algorithm utilizes a penalty function to enforce the ultrametric inequality generalized for asymmetric, and generally rectangular (rather than square) proximity matrices in estimating an ultrametric tree. This stage is used in an alternating leastsquares fashion with closed-form formulas for estimating path length constants for deriving path length trees. The algorithm is evaluated via two Monte Carlo studies. Examples of fitting ultrametric and path length trees are presented.
65 citations
•
31 Aug 1988TL;DR: In this paper, the replication process can be triggered by an inter-process signal, by the occurrance of an external condition, or by a triggering signal embedded in the normal data input to the process.
Abstract: A computer system is disclosed in which individual executing process can be replaced with updated or corrected versions of themselves without interrupting or otherwise interfering with the operation of the computer system. In particular, embedded in the process itself is a command or function or subroutine call which operates to overlay the process code in memory with an updated version of itself, without losing or altering the relationships of the process to the other processes in the computer. As an example, in a UNIX system, the execute command can be used to perform the replication function. The replication process can be triggered by an inter-process signal, by the occurrance of an external condition, or by a triggering signal embedded in the normal data input to the process.
65 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 |