Abstract
Broken packages are packages with not enough information regarding the destination address and they have a negative impact on a computer network. Broken packages stay in the router too much time and overload it. This is a real problem which appears in the computer network of Sofia University. We know only the time when a broken package arrives in the router. The problem is to find the computer which send broken packages. The aim of this article is to propose a model for defining the data transmission stability and correctness in a computer network. Our theoretical model is temporal dependent and captures the transmission properties of a computer network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahmed, N.U., Wang, Q., Barbosa, L.O.: System Approach to Modeling the Token Bucket Algorithm in Computer Networks. Mathematical Problems in Engineering 8(3), 265–279 (2002)
Ahmed, N.U., Dabbous, T.E., Lee, Y.E.: Dynamic routing for computer queuing networks. Int. J. Systems SCI 19(6) (1988)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On powerlow relationships of the Internet topology. In: Proceeding SIGCOMM Cannes (1999)
Nikoloski, Z., Deo, N., Pucera, L.: Correlation Model of Worm Propagation on Scale - Free Networks. Complexus Network Modelling 3, 169–182 (2006)
Perumalla, K.S., Sundaragopalan, S.: High-Fidelity Modeling of Computer Network Worms. Technical Report GIT-CERCS-04-23, Center of Experimental Research in Computer Science, Georgia Institut of Technology (2004)
Shi, Y., Chen, G.: A discrete computer network model with expanding dimensions, Nonlinear Sciences, Chaotic Dynamics, 14 p. (2007) arXiv:0705.0855v1 [nlin.CD]
Wahida, C., Ahmed, N.U.: Congestion control using dynamic routing and flow control. Stochastic analysis and applications 10(2), 123–142 (1992)
Yook, S.H., Jeong, H., Barabasi, A.I.: Modeling the Internet’s large scale topology. Proc. Nat. Acad. Sci. USA 99, 13382–13386 (2003)
Yuan, J., Mills, K.: Exploring Collective Dynamics in Communication Networks. Journal of Research of national Institute of Standards and Technology 107, 179–191 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simian, D., Georgiev, V., Simian, C. (2009). A Discrete Model for a Network Having Broken Packages. In: Margenov, S., Vulkov, L.G., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2008. Lecture Notes in Computer Science, vol 5434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00464-3_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-00464-3_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00463-6
Online ISBN: 978-3-642-00464-3
eBook Packages: Computer ScienceComputer Science (R0)