Analysis and Comparison of Routing and Switching Processes in Campus Area Networks Using Cisco Packet Tracer

Obelovska, Kvitoslava; Kozák, I.; Snaichuk, Yaromyr

doi:10.1007/978-3-031-24475-9_9

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [9] focuses on TCP connections and employs left-right HMMs featuring a significant number of states and probability distributions of discrete emissions. In contrast, reference [10] utilizes ergodic HMMs consisting of four to seven states.…”

Section: State Of the Artmentioning

confidence: 99%

Assessment of Communication Resource Allocation by the Transmission Control Protocol for the Target Virtual Connection under Competitive Conditions

Kovtun,

Grochla

et al. 2024

Electronics

View full text Add to dashboard Cite

The mathematical framework presented in this article focuses on the controlled-transmission protocol’s asynchronous process of bandwidth allocation for the target virtual connection implemented under competition for communication resources. The studied process is formalized as a two-dimensional discrete Markovian chain, taking into account the distributions of queue lengths of TCP data fragments from competing client nodes. Such a chain describes the dynamics of filling the stack of transmitted but unacknowledged data fragments of the investigated end device. Distributions of the chain states were found for various ratios of the target virtual-connection bandwidth, transmission-protocol parameters, and communication-channel characteristics. Analytical dependencies for computing the performance of the target virtual connection for different operating modes were obtained. The results of experiments conducted based on the obtained analytical constructions showed that the performance of the virtual connection with a selective repeat mode is mainly determined by the data-loss intensity, the queue size distribution in transit nodes, and the ratio between the protocol window size and the route length.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Assessment of Communication Resource Allocation by the Transmission Control Protocol for the Target Virtual Connection under Competitive Conditions

Kovtun,

Grochla

et al. 2024

Electronics

View full text Add to dashboard Cite

show abstract

“…In particular, many works are devoted to the implementation of the widely used OSPF protocol in Wide Area Networks (WANs) [4][5][6][7][8][9]. Different tools are used for routing research, such as the Riverbed Modeler [10], the GNS3 [7], the Cisco Packet Tracer simulator [11], etc. These make it possible to study the behavior of protocols in networks of different topologies, at different data transfer rates, to analyze various indicators using different criteria.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the Number of Distrustful Nodes on the Path of IP Packet Transmission

Obelovska,

Tkachuk,

Snaichuk

2024

Computation

View full text Add to dashboard Cite

One of the important directions for improving modern Wide Area Networks is efficient and secure packet routing. Efficient routing is often based on using the shortest paths, while ensuring security involves preventing the possibility of packet interception. The work is devoted to improving the security of data transmission in IP networks. A new approach is proposed to minimize the number of distrustful nodes on the path of IP packet transmission. By a distrustful node, we mean a node that works correctly in terms of hardware and software and fully implements its data transport functions, but from the point of view of its organizational subordination, we are not sure that the node will not violate security rules to prevent unauthorized access and interception of data. A distrustful node can be either a transit or an end node. To implement this approach, we modified Dijkstra’s shortest path tree construction algorithm. The modified algorithm ensures that we obtain a path that will pass only through trustful nodes, if such a path exists. If there is no such path, the path will have the minimum possible number of distrustful intermediate nodes. The number of intermediate nodes in the path was used as a metric to obtain the shortest path trees. Routing tables of routers, built on the basis of trees obtained using a modified algorithm, provide increased security of data transmission, minimizing the use of distrustful nodes.

show abstract

Comparison of Packet Tracer and EVE-NG Tools for Efficient Network Design

Sharma,

Kumar,

Kumar

2024

2024 11th International Conference on Computing for Sustainable Global Development (INDIACom)

View full text Add to dashboard Cite

Analysis and Comparison of Routing and Switching Processes in Campus Area Networks Using Cisco Packet Tracer

Cited by 4 publications

References 16 publications

Assessment of Communication Resource Allocation by the Transmission Control Protocol for the Target Virtual Connection under Competitive Conditions

Assessment of Communication Resource Allocation by the Transmission Control Protocol for the Target Virtual Connection under Competitive Conditions

Minimizing the Number of Distrustful Nodes on the Path of IP Packet Transmission

Comparison of Packet Tracer and EVE-NG Tools for Efficient Network Design

Contact Info

Product

Resources

About