Relevant bibliographies by topics / Routers (Computer networks) Packet switching (Data transmission) Computer algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters

Academic literature on the topic 'Routers (Computer networks) Packet switching (Data transmission) Computer algorithms'

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

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Routers (Computer networks) Packet switching (Data transmission) Computer algorithms.'

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 "Routers (Computer networks) Packet switching (Data transmission) Computer algorithms"

1

Shijer, Sameera Sadey, and Ahmad H. Sabry. "Analysis of performance parameters for wireless network using switching multiple access control method." Eastern-European Journal of Enterprise Technologies 4, no. 9(112) (August 31, 2021): 6–14. http://dx.doi.org/10.15587/1729-4061.2021.238457.

Full text
Abstract:
The developments of wireless networks have directed to search for opportunities of a broad diversity of improved and new networking contributions. Wireless Asynchronous Transfer Mode (ATM) is a non-synchronous or random mode of transferring information. The advantages of circuit switching include dedicated connections and guaranteed traffic parameters and the benefits of packet switching are the efficiency at the physical layer and a more cost-effective design. ATM is the only protocol that offers the best of both communication methods. Although the Variable Bit-Rate (VBR) transmission presents a promising prospective of stable data quality, it is usually accompanied by network traffic overload and cell packet loss, which extensively weakens that potential. This work overcomes these concerns by developing a switching-based multiple access control model to improve the data transmission performance of wireless ATM. Therefore, this work discusses the effectiveness of the developed approach to minimize the cell packet losses and network traffic overload in wireless ATM. Three control access is processed; polling, token passing, and reservation algorithms for collision avoidance. The reservation stage reserves the data before sending, which includes two timeline intervals; a fixed-time reservation period, and variable data transmission interval. Using OPNET 10.5, the results show that the presented switching-based multiple access control model can achieve a throughput value of 98.3 %, data transmission delay of about 40.2 ms, and 0.024 % of packet losses during data transmission between the source and destination. It is demonstrated that the introduced method effectively transmits information without creating any network complexity and delay
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Routers (Computer networks) Packet switching (Data transmission) Computer algorithms"

1

Liu, Jing. "Stable and scalable arbitration algorithms for crossbar-based switches/routers /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LIUJ.

Full text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 92-96). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
2

Lou, Jianyu Shen Xiaojun. "Frame-based packet scheduling algorithms for input queued switches." Diss., UMK access, 2006.

Find full text
Abstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.
"A dissertation in computer networking and telecommunications networking." Advisor: Xiaojun Shen. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 1, 2007. Includes bibliographical references (leaves 121-127). Online version of the print edition.
APA, Harvard, Vancouver, ISO, and other styles
3

Garige, Naga Siddhardha. "A Distributed Routing Algorithm for ER-LSP Setup in MLPS Networks." [Tampa, Fla. : s.n.], 2003. http://purl.fcla.edu/fcla/etd/SFE0000086.

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

Suryadevara, Usha. "Buffer management in tone allocated multiple access protocol." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000357.

Full text
Abstract:
Thesis (M.S.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains vi, 78 p.; also contains graphics. Includes vita. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
5

Krishnan, Anupama. "The Multipath Fault-Tolerant Protocol for Routing in Packet-Switched Communication Network." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4199/.

Full text
Abstract:
In order to provide improved service quality to applications, networks need to address the need for reliability of data delivery. Reliability can be improved by incorporating fault tolerance into network routing, wherein a set of multiple routes are used for routing between a given source and destination. This thesis proposes a new fault-tolerant protocol, called the Multipath Fault Tolerant Protocol for Routing (MFTPR), to improve the reliability of network routing services. The protocol is based on a multipath discovery algorithm, the Quasi-Shortest Multipath (QSMP), and is designed to work in conjunction with the routing protocol employed by the network. MFTPR improves upon the QSMP algorithm by finding more routes than QSMP, and also provides for maintenance of these routes in the event of failure of network components. In order to evaluate the resilience of a pair of paths to failure, this thesis proposes metrics that evaluate the non-disjointness of a pair of paths and measure the probability of simultaneous failure of these paths. The performance of MFTPR to find alternate routes based on these metrics is analyzed through simulation.
APA, Harvard, Vancouver, ISO, and other styles
6

Pathirana, Dhammika. "RODMRP : resilient on demand multicast routing protocol /." Online version of thesis, 2007. http://hdl.handle.net/1850/5288.

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

Lee, Choong-Soo. "WHITE : achieving fair bandwidth allocation with priority dropping based on round trip times." Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0430102-193829.

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

Barreto, Fernando. "Esquema de caminhos emergenciais rápidos para amenizar perdas de pacotes." Universidade Tecnológica Federal do Paraná, 2008. http://repositorio.utfpr.edu.br/jspui/handle/1/127.

Full text
Abstract:
Os backbones IP utilizam protocolos de roteamento do tipo estado do enlace para definir as rotas corretamente. Em situações de mudança na topologia, como uma falha, esses protocolos necessitam de um tempo para reagir e encontrar novas rotas. Durante esse tempo, as rotas ficam instáveis com alta taxa de pacotes perdidos e queda na confiabilidade do backbone. Esse trabalho propõe uma abordagem pró-ativa denominada Esquema de Caminhos Emergenciais Rápidos para auxiliar o protocolo de roteamento OSPF a reduzir a taxa de pacotes perdidos durante esse período. Essa abordagem realiza cálculos reutilizando a base de informações de roteamento do OSPF para gerar esses caminhos emergenciais, que são representados na tabela de encaminhamento através de marcas. Essas marcas são utilizadas então para guiar corretamente os pacotes no contorno de uma falha. Essa abordagem é avaliada em representações de topologias artificiais e reais, e também em simulação para analisar qual o ganho obtido na redução de pacotes perdidos em relação ao OSPF original. A abordagem desenvolvida demonstra resultados bastante satisfatórios em termos de extensão dos caminhos de recuperação utilizados e quantidade de informações extras adicionadas na tabela de encaminhamento em relação à abordagem concorrente.
IP network backbones use link state routing protocols to find correct routes. In face of a topology change, e.g. a failure, these protocols need some time to react to it in order to find new routes. During this time, the routes become unstable, causing high packet loss rate and depreciation of backbone reliability. This work presents a proactive approach named Fast Emergency Paths Schema to help the OSPF routing protocol during the convergence period in order to reduce packet loss rate. The approach conducts calculations reusing the routing information base of the OSPF in order to generate these emergency paths, which are represented in the forwarding table as marks. These are then used to guide the packets to correctly bypass a failure. The approach is evaluated by using various artificial and real topologies, and a simulation is also implemented in order to analyze the packet loss rate reduction in relation to the original OSPF. The analysis yielded satisfactory results in terms of the extension of the recovery paths used and of the amount of extra information added to the forwarding table in relation to the concurrent approach.
APA, Harvard, Vancouver, ISO, and other styles
9

"Switch scheduling based on round robin algorithms." Thesis, 2006. http://library.cuhk.edu.hk/record=b6074292.

Full text
Abstract:
Recently, the Birkhoff-von Neumann (BvN) switch has become a typical model for providing QoS in input-queued switch. The major idea is to consider a set of predetermined permutation matrices as independent flows, and the scheduling problem in the input-queued switch can be simply handled by single-server scheduling algorithms, such as weighted fair queueing (WFQ). However, a number of problems are observed. Firstly, although WFQ is a fair algorithm, it has a poor delay performance that depends on the port counts. Secondly, the BvN switch does not perform well under certain traffic requirement, thus unable to provide tight performance guarantees. In this thesis, a set of admission control strategies and scheduling algorithms are therefore developed to improve the QoS performance.
The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high speeds. A central problem in designing an input-queued switch is choosing the scheduling algorithm, i.e. deciding which packets to transfer from input ports to output ports in a given timeslot. Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control.
Choy Man Ting.
"September 2006."
Adviser: Tony T. Lee.
Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1815.
Thesis (Ph.D.)--Chinese University of Hong Kong, 2006.
Includes bibliographical references (p. 89-94).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstracts in English and Chinese.
School code: 1307.
APA, Harvard, Vancouver, ISO, and other styles
10

Prakash, Amit. "Architectures and algorithms for high performance switching." Thesis, 2004. http://hdl.handle.net/2152/1295.

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

Books on the topic "Routers (Computer networks) Packet switching (Data transmission) Computer algorithms"

1

Wu, Weidong. Packet forwarding technologies. New York: Auerbach Publications, 2008.

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

Russ, White, and McKee Stacia, eds. Cisco express forwarding. Indianapolis, IN: Cisco Press, 2006.

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

Bin, Liu, ed. High performance switches and routers. Hoboken, N.J: Wiley-Interscience, 2007.

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

Ray, Mary Beth, ed. Introducing Routing and Switching in the Enterprise: CCNA Discovery Learning Guide. Indianapolis, Ind: Cisco Press, 2008.

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

Workshop on High Performance Switching and Routing (2006 Poznań, Poland). 2006 Workshop on High Performance Switching and Routing: HPSR 2006 : Poznań, Poland, June 7-9 2006. Piscataway, NJ: IEEE, 2006.

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

Workshop on High Performance Switching and Routing (2007 Brooklyn, N.Y.). 2007 Workshop on High Performance Switching and Routing: Brooklyn, NY, 30 May-1 June 2007. Piscataway, N.J: IEEE, 2007.

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

Dave, Hucaby, ed. CCNP BCMSN official exam certification guide. 4th ed. Indianapolis, Ind: Cisco, 2007.

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

Lee, Tony T. Principles of broadband switching and networking. Hoboken, N.J: John Wiley & Sons, 2010.

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

Lee, Tony T. Principles of broadband switching and networking. Hoboken, N.J: John Wiley & Sons, 2010.

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

Lee, Tony T. Principles of broadband switching and networking. Hoboken, N.J: John Wiley & Sons, 2010.

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

Book chapters on the topic "Routers (Computer networks) Packet switching (Data transmission) Computer algorithms"

1

Bleakley, Chris. "The Internet." In Poems That Solve Puzzles, 117–42. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198853732.003.0007.

Full text
Abstract:
Chapter 7 exposes the algorithms that are the foundations of the Internet. The Internet relies on “packet-switching” to transfer data between computers. Messages are broken into ‘‘packets’’ of data and these packets are routed across the network in a series of hops between linked computers. The advantage of packet-switching is that the network is easily extended and is robust to isolated computer failures. Data sent on the Internet is protected from errors by means of an algorithm invented by Richard Hamming. His algorithm adds information to packets, enabling receiving computers to detect and correct transmission errors. Communication on the Internet is secured by means of an algorithm published in 1977. The RSA algorithm relies on the properties of large prime numbers to prevent eavesdroppers from reading encrypted messages.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Routers (Computer networks) Packet switching (Data transmission) Computer algorithms' for particular source types:
Books
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