Relevant bibliographies by topics / Burstiness

Academic literature on the topic 'Burstiness'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Burstiness.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Burstiness"

1

Cruz, Rene L. "Service Burstiness and Dynamic Burstiness Measures: A Framework." Journal of High Speed Networks 1, no. 2 (1992): 105–27. http://dx.doi.org/10.3233/jhs-1992-1201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hartleb, Detlef, Andreas Ahrens, and Jelena Zascerinska. "EXPLORING THE IMPACT OF BURSTINESS ON THE SERVICE PROCESS AT THE CASH REGISTER." ENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference 3 (June 16, 2021): 104–9. http://dx.doi.org/10.17770/etr2021vol3.6563.

Full text
Abstract:
The service process is the key phase in any queue system applied to business and industry operations. The service process in shops is defined as the payment process at the cash register. The service process consists of two elements or sub-processes: the waiting in the queue to the cash register as well as the payment processing (scanning the goods, giving receipts to customers, etc). Analysis of burstiness as the indicator of the service process has been well-established. Against this background on burstiness as the indicator of the service process, burstiness is also defined as a factor that influences the service process. However, burstiness as a factor in the service process has not attracted a lot of research attention. The aim of this paper is to analyse burstiness as a factor in the service process underpinning the elaboration of scenarios of the service process for the queue management purposes. The present work mostly employs theoretical methods: scientific literature analysis, synthesis, modelling, comparison, and systematization. The theoretical research results in the outline of the conceptual framework for exploring the impact of burstiness on the service process. The key concepts have been identified, namely binary customer behaviour, buyers’ burstiness, bottlenecks’ emergence at the server, and queue management. The logical chain of the development has been emphasized: binary customer behaviour → buyers’ burstiness → bottlenecks’ emergence at the check-out station or cash register (server) → queue management. The presented logical chain allows finding out that buyers’ burstiness leads to the queue appearance in the service process. In turn, queue appearance requires queue management measures. Hence, buyers’ burstiness influences on the decisions in regard to queue management within the service process. Further on, two functions of buyers’ burstiness are defined: the indicators of the service process, and the factor that influences the service process. This bi-modal role of buyers’ burstiness in the service process highlights the complex nature of the queue management. Five scenarios of the service process will allow using a combination of queue management measures in each scenario or even between scenarios. The findings of the comparative study propose the structure of the service process as the unity of the waiting in the queue to the cash register and the payment processing at the cash register, i.e. scanning of the goods and the payment. The present research has some limitations. Further research tends to validate the model of five scenarios of the service process for the queue management purposes. Comparative studies on buyers’ burstiness in the service process will be continued, too.
APA, Harvard, Vancouver, ISO, and other styles
3

DeSimone, Antonio. "Generating burstiness in networks." ACM SIGCOMM Computer Communication Review 21, no. 1 (January 2, 1991): 24–31. http://dx.doi.org/10.1145/116030.116032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nguyen, Ngoc Huy, and Myung Kyun Kim. "Link Quality Estimation from Burstiness Distribution Metric in Industrial Wireless Sensor Networks." Energies 13, no. 23 (December 4, 2020): 6430. http://dx.doi.org/10.3390/en13236430.

Full text
Abstract:
Although mature industrial wireless sensor network applications increasingly require low-power operations, deterministic communications, and end-to-end reliability, it is very difficult to achieve these goals because of link burstiness and interference. In this paper, we propose a novel link quality estimation mechanism named the burstiness distribution metric, which uses the distribution of burstiness in the links to deal with variations in wireless link quality. First, we estimated the quality of the link at the receiver node by counting the number of consecutive packets lost in each link. Based on that, we created a burstiness distribution list and estimated the number of transmissions. Our simulation in the Cooja simulator from Contiki-NG showed that our proposal can be used in scheduling as an input metric to calculate the number of transmissions in order to achieve a reliability target in industrial wireless sensor networks.
APA, Harvard, Vancouver, ISO, and other styles
5

D'Auria, Bernardo, and Sidney I. Resnick. "Data network models of burstiness." Advances in Applied Probability 38, no. 02 (June 2006): 373–404. http://dx.doi.org/10.1017/s0001867800001014.

Full text
Abstract:
We review characteristics of data traffic which we term stylized facts: burstiness, long-range dependence, heavy tails, bursty behavior determined by high-bandwidth users, and dependence determined by users without high transmission rates. We propose an infinite-source Poisson input model which supplies traffic in adjacent time slots. We study properties of the model as slot width decreases and traffic intensity increases. This model has the ability to account for many of the stylized facts.
APA, Harvard, Vancouver, ISO, and other styles
6

Neuts, Marcel F. "The burstiness of point processes∗." Communications in Statistics. Stochastic Models 9, no. 3 (January 1993): 445–66. http://dx.doi.org/10.1080/15326349308807275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Woodward, M. E. "Burstiness of interrupted Bernoulli process." Electronics Letters 30, no. 18 (September 1, 1994): 1466–67. http://dx.doi.org/10.1049/el:19941042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

D'Auria, Bernardo, and Sidney I. Resnick. "Data network models of burstiness." Advances in Applied Probability 38, no. 2 (June 2006): 373–404. http://dx.doi.org/10.1239/aap/1151337076.

Full text
Abstract:
We review characteristics of data traffic which we term stylized facts: burstiness, long-range dependence, heavy tails, bursty behavior determined by high-bandwidth users, and dependence determined by users without high transmission rates. We propose an infinite-source Poisson input model which supplies traffic in adjacent time slots. We study properties of the model as slot width decreases and traffic intensity increases. This model has the ability to account for many of the stylized facts.
APA, Harvard, Vancouver, ISO, and other styles
9

Guillemin, Fabrice, Jacqueline Boyer, and Alain Dupuis. "Burstiness in broadband integrated networks." Performance Evaluation 15, no. 3 (September 1992): 163–76. http://dx.doi.org/10.1016/0166-5316(92)90032-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Oudah, Hussein, Bogdan Ghita, Taimur Bakhshi, Abdulrahman Alruban, and David J. Walker. "Using Burstiness for Network Applications Classification." Journal of Computer Networks and Communications 2019 (August 20, 2019): 1–10. http://dx.doi.org/10.1155/2019/5758437.

Full text
Abstract:
Network traffic classification is a vital task for service operators, network engineers, and security specialists to manage network traffic, design networks, and detect threats. Identifying the type/name of applications that generate traffic is a challenging task as encrypting traffic becomes the norm for Internet communication. Therefore, relying on conventional techniques such as deep packet inspection (DPI) or port numbers is not efficient anymore. This paper proposes a novel flow statistical-based set of features that may be used for classifying applications by leveraging machine learning algorithms to yield high accuracy in identifying the type of applications that generate the traffic. The proposed features compute different timings between packets and flows. This work utilises tcptrace to extract features based on traffic burstiness and periods of inactivity (idle time) for the analysed traffic, followed by the C5.0 algorithm for determining the applications that generated it. The evaluation tests performed on a set of real, uncontrolled traffic, indicated that the method has an accuracy of 79% in identifying the correct network application.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Burstiness"

1

Dimopoulos, Peter, and dimpet@gmail com. "Modeling and Improving the Performance of Interactive TCP Traffic in Computer Networks." RMIT University. Computer Science and Information Technology, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080208.150856.

Full text
Abstract:
The Internet has become one of the most widely used forms of communication available. Many applications used on the Internet require the user to interact constantly with the network. For example web browsing where the user will expect the browser to respond quickly, to finish loading pages quickly and to do all of this at an equal level for all users. The network's performance is dependant on the protocols it uses and how the resources of the network are distributed. This is why TCP (Transmission Control Protocol) is one of the most important protocols, because it controls the amount of data entering the network and provides reliability to most interactive applications. The thesis starts by introducing a basic TCP model which is later extended to model the effects of burstiness produced by TCP. Burstiness can cause a routers buffer to unnecessarily overflow. These overflows cause TCP connections to under-utilise link bandwidth because of unnecessary packet retransmissions. A model to define a quantitative measure of both burstiness and throughput of a system of TCP connections is introduced. The model gives insight into how the TCP protocol causes burstiness and can be used to find scenarios where burstiness is decreased. This helps to improve the utilization of links by reducing the burstiness of protocols. An important performance metric for interactive traffic is user perceived delay, the delay that an end user would encounter when using an application. An example of user perceived delay is the time a user waits before a HTML web page starts loading. The retransmission delays are the most important type of delay for interactive traffic because they are usually very large. A dynamic priority RED Queue (DPRQ) is introduced which changes the priority of the queues based on the goodput (throughput of succesfully transmitted packets) threshold of the interactive traffic. Using dynamic priority allows packet loss to be reduced by up to eight times for interactive traffic, which intern reduces retransmission delay. Fairness measures how equally network resources are allocated amongst different connections. When a link with TCP connections is overloaded each connection on the link will reduce its throughput to allow all the connections to have approximately equal load. This does not take into account that other links may be under utilized. The fairness issue is addressed by introducing Multipath TCP (MATCP) which allows path selection to occur at the TCP layer. This allows each unique flow to take a different path, instead of all the flows of one source using the same path. Using MATCP, a finer grain of load-balancing can be achieved and the complexity and state required in the network is greatly reduced. Two analytic models are provided in chapters three and four, which investigate slow start and TCP burstiness. In chapter five the DPRQ queue is introduced to reduce user perceived delay. An analytic model of the DPRQ is provided and verified through experimental simulation. In chapter six an analytic model of Multipath TCP is provided, which is also verified by simulation.
APA, Harvard, Vancouver, ISO, and other styles
2

Pola, Tommaso. "Statistical analysis of written languages." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6307/.

Full text
Abstract:
La tesi presenta una serie di risultati dell'analisi quantitativa sulla linguistica. Inizialmente sono studiate due fra le leggi empiriche più famose di questo campo, le leggi di Zipf e Heaps, e vengono esposti vari modelli sullo sviluppo del linguaggio. Nella seconda parte si giunge alla discussione di risultati più specifici sulla presenza di fenomeni di burstiness e di correlazioni a lungo raggio nei testi. Tutti questi studi teorici sono affiancati da analisi sperimentali, svolte utilizzando varie traduzioni del libro "Guerra e pace" di Leo Tolstoj e concentrate principalmente sulle eventuali differenze riscontrabili tra le diverse lingue.
APA, Harvard, Vancouver, ISO, and other styles
3

Bingmer, Markus [Verfasser], Gaby [Akademischer Betreuer] Schneider, and Anton [Akademischer Betreuer] Wakolbinger. "A stochastic model for the joint evaluation of burstiness and regularity in oscillatory spike trains / Markus Bingmer. Gutachter: Gaby Schneider ; Anton Wakolbinger. Betreuer: Gaby Schneider." Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2013. http://d-nb.info/1043977996/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Clinchant, Stéphane. "Modèles probabilistes pour les fréquences de mots et la recherche d'information." Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENT046/document.

Full text
Abstract:
Nous nous intéressons à la fois à la modélisation des fréquences des mots dans les collections textuelles et aux modèles probabilistes de recherche d'information (RI). Concernant les modèles statistiques de fréquences de mots, nous portons notre attention sur l'étude du phénomène de rafale (burstiness). Nous établissons une propriété sur les distributions de probabilité caractérisant leur capacité à modéliser ce phénomène et nous étudions ensuite les distributions Beta Negative Binomial et Log-Logistique pour la modélisation des fréquences de mots. Nous portons ensuite notre attention sur les modèles probabilistes de RI et leur propriétés fondamentales. Nous pouvons montrer que les modèles classiques ne reposent pas sur des lois de probabilité en rafale, même si des propriétés fondamentales comme la concavité des modèles permettent implicitement de le prendre en compte. Nous introduisons ensuite une nouvelle famille de modèles probabiliste pour la recherche d'information, fondé sur la notion d'information de Shannon et qui permet d'établir un lien conséquent entre les propriétés importantes des modèles de RI et le phénomène de rafale. Enfin, nous étudions empiriquement et théoriquement les modèles de rétro-pertinence. Nous proposons un cadre théorique qui permet ainsi d'expliquer leurs caractéristiques empiriques et leur performances. Ceci permet entre autres de mettre en avant les propriétés importantes des modèles de retro-pertinence et de montrer que certains modèles de référence sont déficients
The present study deals with word frequencies distributions and their relation to probabilistic Information Retrieval (IR) models. We examine the burstiness phenomenon of word frequencies in textual collections. We propose to model this phenomenon as a property of probability distributions and we study the Beta Negative Binomial and Log-Logistic distributions to model word frequencies. We then focus on probabilistic IR models and their fundamental properties. Our analysis reveals that probability distributions underlying most state-of-the-art models do not take this phenomenon into account , even if fundamental properties of IR models such as concavity enable implicitly to take it into account. We then introduce a novel family of probabilistic IR model, based on Shannon information. These new models bridge the gap between significant properties of IR models and the burstiness phenomenon of word frequencies. Lastly, we study empirically and theoretically pseudo relevance feedback models. We propose a theoretical framework which explain well the empirical behaviour and performance of pseudo relevance feedback models. Overall, this highlights interesting properties for pseudo relevance feedback and shows that some state-of-the-art model are inadequate
APA, Harvard, Vancouver, ISO, and other styles
5

Huselius, Gylling Kira. "Quadratic sample entropy as a measure of burstiness : A study in how well Rényi entropy rate and quadratic sampleentropy can capture the presence of spikes in time-series data." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-130593.

Full text
Abstract:
Requests to internet servers do not in general behave in a manner which can be easily modelled and forecast with typical time-series methods, but often have a significant presence of spikes in the data, a property we call “burstiness”. In this thesis we study various entropy measures and their properties for different distributions, both theoretically and via simulation, in order to better find out how these measures could be used to characterise the predictability and burstiness of time series. We find that a low entropy can indicate a heavy-tailed distribution, which for time series corresponds to a high burstiness. Using a previous result that connects the quadratic sample entropy for a time series with the Rényi entropy rate of order 2, we suggest a way of detecting burstiness by comparing the quadratic sample entropy of the time series with the Rényi entropy rate of order 2 for a symmetric and a heavy-tailed distribution.
Anrop till internetservrar beter sig i allmänhet inte på sätt som lätt kan modelleras och prediceras med typiska tidsseriemetoder, utan har ofta en signifikant andel spikar i datan, en egenskap som kallas “burstiness” (adekvat svensk översättning saknas). I den här uppsatsen studerar vi diverse entropimått och deras egenskaper för olika fördelningar, både teoretiskt och via simulering, för att kunna ta reda på hur dessa mått kan användas för att karaktärisera förutsägbarhet och burstiness hos tidsserier. Vi finner att en låg entropi kan indikera en tungsvansad fördelning, vilket för tidsserier motsvarar hög burstiness. Genom att använda ett tidigare resultat som sammankopplar kvadratisk stickprovsentropi med Rényis entropitakt av ordning 2 föreslår vi ett sätt att upptäcka burstiness genom att jämföra den kvadratiska stickprovsentropin för en tidsserie med Rényis entropitakt av ordning 2 för en symmetrisk och en tungsvansad fördelning.
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Yuh-Jih, and 陳育智. "Burstiness, Delay and Loss Patterns of Correlated Packet traffic." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/68794863978325511259.

Full text
Abstract:
碩士
國立交通大學
資訊科學學系
83
Due to there exists correlation within packets, traffic tends to arrive in bursts. This phenomenon may congest the network and reduce the system performance. To improve the system performance, we need to study the characteristics of correlated packet traffic. In this thesis, we use HAP model, a traffic model to capture correlation within packet traffic, as our traffic source to measure burstiness, delay and loss. When measuring burstiness, it is important and necessary to determine a burst. if we regard traffic as consecutive burst periods and silent periods. We propose three burst definitions which can be used to determine a burst. To observe the mean number of bursts, mean burst length and burstiness from these definitions, we find their advantages and suggest a hybrid method. We measure mean delay, delay variance and loss ratio by varying server queue size to see the behaviors of delay and loss patterns of correlated packet traffic. We find that HAP traffic suffers serious delay and loss. We also chart delay and loss curves to see thetradeoff between them.
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Chung-Shong, and 吳中雄. "A Simulation Study of ATM Rate-based Flow Control with Call- level and Cell-level Burstiness." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/36365070271917353833.

Full text
Abstract:
碩士
國立交通大學
資訊科學學系
84
The appearance of ATM(Asynchronous Transfer Mode) networks brings the possible solution for those applications demanding more bandwidth, low jitters, and limited cell loss and delay. It also supports LAN emulation and IP-over-ATM for the existing applications to run on ATM networks. These applications use ATM ABR (Available Bit Rate) services and are subject to flow control. Effects of flow controlling these bursty traffic sources should be carefully examined to avoid inferior performance in ATM than in slower networks. In this work, we simulate a rate-based flow control scheme called ERMC (Explicit Rate based on Multiple Conditions) under burstiness at call and cell levels. Rather than fixing the number of sources, the number of sources is variable. In addition, the cell transmission rate, instead of arrival rate, of a source is adjusted based on the congestion state of the feedback point. Moreover, the control mechanism is based on ER-type feedback. Using the traffic and network models, we obtain the average cell loss probability and average waiting time. With these results, we find that the cell loss probability under burstiness at the cell-level is more sensitive than under burstiness at the call-level. Also, the performance measures of using the function, based on fixed number of sources and probability, is not a good approximation to the performance of variable number of sources. About the control mechanism, the multiple-threshold mechanism has better performance than single- threshold mechanism. Moreover, the flow control is suitable on LAN rather than on WAN. Hence, the flow control on WAN environment would also be an interesting topic.
APA, Harvard, Vancouver, ISO, and other styles
8

Xue, Cheng. "Neuronal representation and attentional modulation of space and feature information in primate vision." Doctoral thesis, 2016. http://hdl.handle.net/11858/00-1735-0000-0023-3F35-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schaigorodsky, Ana Laura. "Procesos de memoria en sistemas con distribuciones de Zipf-Pareto." Doctoral thesis, 2018. http://hdl.handle.net/11086/6072.

Full text
Abstract:
Tesis (Doctor en Física)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2018.
Estudios recientes realizados en una base de datos de Ajedrez cronológicamente ordenada, han mostrado que la distribución de popularidades de líneas de juego de Ajedrez se ajusta a una ley de Zipf. La ley de Zipf es común a muchos sistemas y es usualmente observada en conjunto con efectos de memoria tales como correlaciones de largo alcance y burstiness. Sin embargo los modelos existentes que estudian estos fenómenos no dan cuenta simultáneamente con la ley de Zipf y los efectos de memoria. En este trabajo de tesis, mediante una variante del modelo de crecimiento preferencial de Yule-Simon, introducido por Cattuto et al., se provee una explicación de la aparición simultanea de la ley de Zipf y los efectos de memoria en forma de correlaciones de largo alcance en la base de datos de Ajedrez. Se encuentra que el modelo de Cattuto et al. es capaz de reproducir ambos fenómenos, la ley de Zipf y las correlaciones de largo alcance, incluyendo además los efectos de tamaño del exponente de Hurst de las correspondientes series temporales. Más aún, se encuentra burstiness en la actividad de los grupos de jugadores más activos, aunque la actividad agregada del conjunto completo de jugadores presenta una distribución de tiempos entre eventos sin burstiness. Dado que el modelo de Cattuto et al. no es capaz de producir series temporales con comportamiento ’bursty ’, se realiza una modificación al núcleo de memoria que permite lograr una dinámica bursty. Introduciendo un núcleo de memoria finito, se mantiene el comportamiento de ley de potencia en la distribución de popularidades y, al mismo tiempo se obtienen series temporales que presentan burstiness como consecuencia de una transición de fase, en la cual, en el estado crítico, la dinámica está dominada por las fluctuaciones.
Recent works studying a chronologically sorted chess database have shown that the popularity distribution of opening lines in the game of chess follow a Zipf law. Zipf law is common to many systems and is usually observed together with memory effects, such as long-range correlations and burstiness. Nevertheless, existing models that study these phenomena do not account for the Zipf’s law and memory effects simultaneously. In this thesis, using a variant of the Yule-Simon preferential growth model, introduced by Cattuto et al., we provide an explanation of the simultaneous emergence of Zipf’s law and memory effects in the form of long-range correlations in the chess database. We find that Cattuto’s model is able to reproduce both phenomena, Zipf’s law and the long-range correlations., including the size effects displayed by the Hurst exponent of the corresponding time series. Furthermore, we find burstiness in the activity of the most active players, although the aggregated activity of all players in the database presents an interevent time distribution without burstiness. Since Cattuto’s model is not able to generate times series with a bursty behavior, we made a modification to the memory kernel that allows a bursty dynamics. By introducing a finite memory kernel, we keep the power-law behavior in the popularity distribution and, at the same time, we obtain time series that present burstiness as a consequence of a phase transition in which, at the critical point, the dynamic is ruled by fluctuations.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Burstiness"

1

Burstiness Management for Smart, Sustainable and Inclusive Growth: Emerging Research and Opportunities. IGI Global, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Burstiness"

1

Buckley, James J. "Burstiness." In Fuzzy Probabilities and Fuzzy Sets for Web Planning, 131–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-36426-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Min, Byungjoon, and K. I. Goh. "Burstiness: Measures, Models, and Dynamic Consequences." In Understanding Complex Systems, 41–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36461-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Mao, Qiang Liu, Yuewei Ming, and Jianping Yin. "Group Burstiness Weighting for Image Retrieval." In Advances in Multimedia Information Processing – PCM 2017, 244–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77383-4_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pierrehumbert, Janet B. "Burstiness of Verbs and Derived Nouns." In Shall We Play the Festschrift Game?, 99–115. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30773-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shakkottai, Srinivas, Nevil Brownlee, and kc claffy. "A Study of Burstiness in TCP Flows." In Lecture Notes in Computer Science, 13–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31966-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ying, Yu, Ravi Mazumdar, Catherine Rosenberg, and Fabrice Guillemin. "The Burstiness Behavior of Regulated Flows in Networks." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 918–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mandjes, Michel, and Remco van de Meent. "Inferring Traffic Burstiness by Sampling the Buffer Occupancy." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 303–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rolland, Chloé, Julien Ridoux, and Bruno Baynat. "Catching IP Traffic Burstiness with a Lightweight Generator." In NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 924–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72606-7_79.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gómez, María E., and Vicente Samonja. "On the Impact of Workload Burstiness on Disk Performance." In Workload Characterization of Emerging Computer Applications, 181–201. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1613-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wei, Jinwu, and Jiangxing Wu. "Nonstationarity of Network Traffic Within Multi-scale Burstiness Constraint." In Computational Intelligence and Security, 971–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596981_144.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Burstiness"

1

Alves, Rodrigo Augusto da Silva, Renato Martins Assuncao, and Pedro Olmo Stancioli Vaz de Melo. "Burstiness Scale." In KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2939672.2939852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kalogeratos, Argyris, Panagiotis Zagorisios, and Aristidis Likas. "Improving Text Stream Clustering using Term Burstiness and Co-burstiness." In SETN '16: 9th Hellenic Conference on Artificial Intelligence. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2903220.2903229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ali-Eldin, Ahmed, Oleg Seleznjev, Sara Sjostedt-de Luna, Johan Tordsson, and Erik Elmroth. "Measuring Cloud Workload Burstiness." In 2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC). IEEE, 2014. http://dx.doi.org/10.1109/ucc.2014.87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Papathanasiou and Scott. "Energy efficiency through burstiness." In Proceedings DARPA Information Survivability Conference and Exposition MCSA-03. IEEE, 2003. http://dx.doi.org/10.1109/mcsa.2003.1240766.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Revaud, Jerome, Matthijs Douze, and Cordelia Schmid. "Correlation-based burstiness for logo retrieval." In the 20th ACM international conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2393347.2396358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Starobinski, D., and M. Sidi. "Stochastically bounded burstiness for communication networks." In IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320). IEEE, 1999. http://dx.doi.org/10.1109/infcom.1999.749250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Doyle, Gabriel, and Charles Elkan. "Accounting for burstiness in topic models." In the 26th Annual International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1553374.1553410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jegou, Herve, Matthijs Douze, and Cordelia Schmid. "On the burstiness of visual elements." In 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops). IEEE, 2009. http://dx.doi.org/10.1109/cvpr.2009.5206609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jegou, H., M. Douze, and C. Schmid. "On the burstiness of visual elements." In 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2009. http://dx.doi.org/10.1109/cvprw.2009.5206609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Woodruff, Jackson, Andrew W. Moore, and Noa Zilberman. "Measuring Burstiness in Data Center Applications." In BS '19: 2019 Workshop on Buffer Sizing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3375235.3375240.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Burstiness' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography