Thesis (M. Sc. (Data Processing)) - University of Ulster, 1986.
Ribeiro C., El Baz D. () A dual method for optimal routing in packet-switched networks. In: Davisson L.D. et al. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol Cited by: 2. 1 day ago Mobile Ad-hoc Network (MANETs) is a wireless network topology with mobile network nodes and movable communication routes. In addition, the network nodes in MANETs are free to either join or leave the network. Typically, routing in MANETs is multi-hop because of the limited communication range of nodes. Then, routing protocols have been developed for MANETs. The specific route information stored depends on the type of packet switching. But in general, creating a routing table, need information on state of links, need to distribute links state information, and compute optimal routes based on link state information. The figure shows a . In telecommunications, packet switching is a method of grouping data that is transmitted over a digital network into s are made of a header and a in the header is used by networking hardware to direct the packet to its destination, where the payload is extracted and used by application switching is the primary basis for data communications in computer.
The routing in packet switching network is considered as a shortest-path (SP) problem. The new routing algorithm, initially inspired by the Hopfield neural network, is designed to find the optimal. As computer networks became more pervasive, more and more data and also less voice was transmitted over telephone lines. Circuit Switching The telephone network used circuit switching. Circuit switching operates by first reserving a complete route from the . In this paper we consider the problem of real-time traffic load estimation in a packet-switched network environment. In emerging highspeed packet-switched networks, many control functions such as bandwidth management, dynamic route selection and rate-based traffic control depend on real-time characterization of traffic load in the network. Optimal Design of Mixed-Media Packet-Switching Networks: Routing and Capacity Assignment Article (PDF Available) in IEEE Transactions on Communications 25(1) - .
CANTOR AND GERLA: OPTIMAL ROUTING Theroutingproblemfor apacket-switched communica-tion networkis formulated as follows: Given: a directed network of NNnodes and NAarcs, anNNXNNmatrixR= [rif], calledtherequire-mentmatrix, whoseentries are nonnegative. Minimize (over f): T= (1/7y) E_lNAfl(C-fi) wheref = (fsf2,. *,fNA)v Constraints: 1) fis a multicommodity flow satisfying. 19 Broadcast routing & Spanning trees 20 Shortest path routing 21 Distributed routing algorithms, optimal routing 22 Flow Control - Window/Credit Schemes 23 Flow Control - Rate Based Schemes 24 Transport layer and TCP/IP 25 ATM Networks 26 Special topic: Optical Networks, Wireless networks Final Exam during final exam week. Optimal Routing in a Packet-Switched Computer Network Abstract: The problem of finding optimal routes in a packet-switched computer network can be formulated as . The performance and control of communication networks can be analyzed using a beautiful theory based on queue stability. This theory gave us the backpressure algorithm firstly proposed by Tassiulas & Ephremides in , whereby packets flow in the data network according to queue backlog differences (a packet always flows from a highly-backlogged node to a neighboring node with smaller.