Method and apparatus providing connection-oriented services for packet switched data communications networks. Directory services include distributed discovery of MAC addresses and protocol alias addresses. Topology services include a link state topology exchange among switches, which provides each switch with a complete topology graph of the network. This enables an access switch receiving a data packet to determine a complete path from a source end system to a destination end system. Another service includes resolution of broadcast frames to unicast frames, in order to reduce the amount of broadcast traffic. Policy restrictions may be applied prior to connection setup. Path determination services enable multiple paths from a source to a destination. Connection management includes source routed mapping of connections on the desired path. A distributed call rerouting service is provided wherein if a link on an active path fails, each switch receives a topology change notification and unmaps any connection involving the failed link. A broadcast/unknown service provides restricted flooding of nonresolvable packets. Furthermore, connection-oriented switching is provided based on the source and destination MAC addresses as a connection identifier. Still further, resolution of networks outside the switch domain is enabled by access switches listening for network and server route advertisements and maintaining best routes to said networks and servers. The best route metrics may be combined with best path metrics to determine a path from a first access switch to an egress switch connected to the external network.

Distributed connection-oriented services for switched communication networks

A family of medium access control protocols for single-channel packet radio networks is specified and analyzed. These protocols are based on a new channel access discipline called floor acquisition multiple access (FAMA), which consists of both carrier sensing and a collision-avoidance dialogue between a source and the intended receiver of a packet. Control of the channel (the floor) is assigned to at most one station in the network at any given time, and this station is guaranteed to be able to transmit one or more data packets to different destinations with no collision with transmissions from other stations. The minimum length needed in control packets to acquire the floor is specified as a function of the channel propagation time. The medium access collision avoidance (MACA) protocol proposed by Karn and variants of CSMA based on collision avoidance are shown to be variants of FAMA protocols when control packets last long enough compared to the channel propagation delay. The throughput of FAMA protocols is analyzed and compared with the throughput of non-persistent CSMA. This analysis shows that using carrier sensing as an integral part of the floor acquisition strategy provides the benefits of MACA in the presence of hidden terminals, and can provide a throughput comparable to, or better than, that of non-persistent CSMA when no hidden terminals exist.

/pdf/floor-acquisition-multiple-access-fama-for-packet-radio-34jdbbhlt2.pdf

Floor acquisition multiple access (FAMA) for packet-radio networks

Wireless networked control systems (WNCSs) are composed of spatially distributed sensors, actuators, and controllers communicating through wireless networks instead of conventional point-to-point wired connections. Due to their main benefits in the reduction of deployment and maintenance costs, large flexibility and possible enhancement of safety, WNCS are becoming a fundamental infrastructure technology for critical control systems in automotive electrical systems, avionics control systems, building management systems, and industrial automation systems. The main challenge in WNCS is to jointly design the communication and control systems considering their tight interaction to improve the control performance and the network lifetime. In this survey, we make an exhaustive review of the literature on wireless network design and optimization for WNCS. First, we discuss what we call the critical interactive variables including sampling period, message delay, message dropout, and network energy consumption. The mutual effects of these communication and control variables motivate their joint tuning. We discuss the analysis and design of control systems taking into account the effect of the interactive variables on the control system performance. Moreover, we discuss the effect of controllable wireless network parameters at all layers of the communication protocols on the probability distribution of these interactive variables. We also review the current wireless network standardization for WNCS and their corresponding methodology for adapting the network parameters. Finally, we present the state-of-the-art wireless network design and optimization for WNCS, while highlighting the tradeoff between the achievable performance and complexity of various approaches. We conclude the survey by highlighting major research issues and identifying future research directions.

https://ieeexplore.ieee.org/ielaam/9739/8362823/8166737-aam.pdf

Wireless Network Design for Control Systems: A Survey

A polling model is a system of multiple queues accessed by a single server in cyclic order. Polling models provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems. This paper presents an overview of the state of the art of polling model analysis, as well as an extensive list of references. In particular, single-buffer systems and infinite-buffer systems with exhaustive, gated, and limited service disciplines are treated. There is also some discussion of systems with a noncyclic order of service and systems with priority. Applications to computer networks are illustrated, and future research topics are suggested.

Queuing analysis of polling models

In connection-oriented networks, resource reservations must be made before data can be sent along a route. For short or bursty connections, a selected route must have the required resources to ensure appropriate communication with regard to desired quality-of-service (QoS). For example, in ATM networks, the route setup process considers only links with sufficient resources and reserves these resources while it advances toward the destination. The same concern for QoS routing appears in datagram networks such as the Internet, when applications with QoS requirements need to reserve resources along pinned routes. In this paper, we analyze the performance of multi-path routing algorithms and compare them to single-path reservation that might be persistent, i.e., retry after a failure. The analysis assumes that the routing process reserves resources while it advances toward the destination, thus there is a penalty associated with a reservation that cannot be used. Our analysis shows that while multi-path reservation algorithms perform comparably to single-path reservation algorithms, either persistent or not, the connection-establishment time for multi-path reservation is significantly lower. Thus, multi-path reservation becomes an attractive alternative for interactive applications such as World Wide Web browsing.

/pdf/analysis-of-multi-path-routing-4fqki4emby.pdf

Analysis of multi-path routing

Conflict-free access protocols aloha protocols carrier sensing protocols collision resolution protocols additional topics. Appendix: mathematical formulae and background.

Multiple Access Protocols

A system for implementing flow control in an information network such as a local area network (LAN) utilizing a Carrier Sense Multiple Access with Collision Detection (CSMA/CD) as specified by the IEEE standard 802.03. The information network transmits computer information such as computer data between various computer systems coupled to the information network. The information network includes information network switches capable of routing information packets received via its input ports to its output ports. The received packets are held in buffers of the output ports before being transmitted via the output ports. A portion of each output port buffer is allocated to each input port. The information network switch provides a control packet such as a PAUSE frame to an upstream source operably coupled to the input port in response to the level occupancy of the portion of the buffer allocated to the input port exceeding a first level. The PAUSE frame inhibits the upstream source from transmitting information packets to the input port. In one system, each upstream source has the capability of ignoring the control packet when the level of occupancy of an output buffer of the upstream source exceeds a threshold level.

Flow control using output port buffer allocation

Network testing is conducted using a pair of traffic agents that acts as sender and receiver endpoints. The sending traffic agent generates and transmits a stream of packet batches, each batch being composed of high and low priority packets in a predetermined sending order. The receiving traffic agent analyzes the order of packet arrival in the stream relative to the sending order, and returns results to a traffic control module. Path speed and the priority classification of the traffic are parameters used to configure the tests. The tests are typically run periodically under different load conditions in order to evaluate the effects of other traffic being concurrently transiting the network.

Quality of service testing of communications networks

A method for testing of a communication network, using a plurality of traffic agents coupled to communicate via the network. The method includes transmitting a sequence of data packets via the network from a first one of the traffic agents to a second one of the traffic agents and recording arrival characteristics of the packets in the sequence, responsive to receiving the packets at the second traffic agent. The arrival characteristics of different packets in the sequence are compared so as to determine a measure of variability in transmission of the packets via the network.

Analysis of network performance

In a communication network having a set of hosts and switch based label swapping communication nodes, each node has a control processor that is also a host that sends and receives messages via the switching apparatus in its associated node. Each node's control processor also includes a virtual connection (VC) traversal procedure that implements the methodology of the present invention. The control processor of any node along an established connection can initiate the transmission of a VC traversal message to the control processors of all the nodes along the connection. The VC traversal message is transmitted as one or more ATM cells, where each cell includes a standard ATM header for routing the cell to a neighboring node's control processor, as well as a VC traversal header in the body of the cell that identifies the connection being traversed. When a node receives a VC traversal message with a VC traversal header in it, the virtual connection traversal procedure in the receiving node processes that message by (A) performing whatever command is indicated in the VC traversal header, (B) routing a copy of the VC traversal message to the control processor of each node to which a data cell on the connection being traversed would be sent, and (C) performing a VC traversal header swapping operation on each such copy of the VC traversal message so that the VC traversal header in each forwarded VC traversal message identifies the segment of the connection being traversed by the control message.

System and method for traversing ATM networks based on forward and reverse virtual connection labels

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Moshe Sidi

Author Tools

Chat about Author