Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Modeling Internet Traffic Generations Based On Users And Activities For Telecommunication Applications, Sara Stoudt, Pamela Badian-Pessot, Blanche Ngo Mahop, Erika Earley, Jordan Menter, Yadira Flores, Danielle Williams, Weijia Zhang, Liza Maharjan, Yixin Bao, Laura Rosenbauer, Van Nguyen, Veena Mendiratta, Nessy Tania
Modeling Internet Traffic Generations Based On Users And Activities For Telecommunication Applications, Sara Stoudt, Pamela Badian-Pessot, Blanche Ngo Mahop, Erika Earley, Jordan Menter, Yadira Flores, Danielle Williams, Weijia Zhang, Liza Maharjan, Yixin Bao, Laura Rosenbauer, Van Nguyen, Veena Mendiratta, Nessy Tania
Mathematics Sciences: Faculty Publications
A traffic generation model is a stochastic model of the data flow in a communication network. These models are useful during the development of telecommunication technologies and for analyzing the performance and capacity of various protocols, algorithms, and network topologies. We present here two modeling approaches for simulating internet traffic. In our models, we simulate the length and interarrival times of individual packets, the discrete unit of data transfer over the internet. Our first modeling approach is based on fitting data to known theoretical distributions. The second method utilizes empirical copulae and is completely data driven. Our models were based …
Changing Of The Guards: Strip Cover With Duty Cycling∗, Amotz Bar-Noy, Benjamin Baumer, Dror Rawitz
Changing Of The Guards: Strip Cover With Duty Cycling∗, Amotz Bar-Noy, Benjamin Baumer, Dror Rawitz
Mathematics Sciences: Faculty Publications
The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that take turns covering the region in question, and each sensor can belong to at most one shift. We consider the imposition of the duty cycling model upon the Strip Cover problem, where we are given n sensors on a one-dimensional region, and each shift can contain at most k ≤ n sensors. We call the problem of finding the optimal set of shifts so as to maximize the length …
The Smallest Non-Autograph, Benjamin Baumer, Yijin Wei, Gary S. Bloom
The Smallest Non-Autograph, Benjamin Baumer, Yijin Wei, Gary S. Bloom
Mathematics Sciences: Faculty Publications
Suppose that G is a simple, vertex-labeled graph and that S is a multiset. Then if there exists a one-to-one mapping between the elements of S and the vertices of G, such that edges in G exist if and only if the absolute difference of the corresponding vertex labels exist in S, then G is an autograph, and S is a signature for G. While it is known that many common families of graphs are autographs, and that infinitely many graphs are not autographs, a non-autograph has never been exhibited. In this paper, we identify the smallest non-autograph: a graph …