Academic literature on the topic 'Asynchronous transfer mode Mathematics'

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 'Asynchronous transfer mode Mathematics.'

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 "Asynchronous transfer mode Mathematics"

1

Chiang, Shu-Yin. "Performance analysis of ATM multiplexer with Bernoulli traffic sources." Mathematical Problems in Engineering 8, no. 6 (2002): 541–52. http://dx.doi.org/10.1080/1024123021000053673.

Full text
Abstract:
In this paper, we study the simplified models of the ATM (Asynchronous Transfer Mode) multiplexer network with Bernoulli random traffic sources. Based on the model, the performance measures are analyzed by the different output service schemes.
APA, Harvard, Vancouver, ISO, and other styles
2

Kopeetsky, M., and A. Lin. "MATHEMATICAL MODELLING OF MODIFIED CELL DELINEATION STRATEGY IN PACKET SWITCHED NETWORKS." Mathematical Modelling and Analysis 11, no. 3 (September 30, 2006): 253–74. http://dx.doi.org/10.3846/13926292.2006.9637317.

Full text
Abstract:
The paper proposes a new mathematical model of Cell Delineation (CD) strategy in any Packet Switching technology when Data Units (DUs) are of constant length. A special strategy that differentiates between synchronization failures and other channel errors with the sufficiently high confidence level has been proposed, analyzed and optimized. The mathematical analysis of the strategy is presented on the Asynchronous Transfer Mode (ATM) network example. The CD cycle implementation time is discussed and analyzed. The numerical results are presented for the case of the standard CD protocol.
APA, Harvard, Vancouver, ISO, and other styles
3

Ali, Saif Mohammed, Haider Mshali, Amer S. Elameer, Mustafa Musa Jaber, and Sura Khalil Abd. "Applying switching and multiple access model for reducing packet loss and network overheads in watm." Eastern-European Journal of Enterprise Technologies 6, no. 9 (114) (December 29, 2021): 15–23. http://dx.doi.org/10.15587/1729-4061.2021.249474.

Full text
Abstract:
As an effectual simple wireless equivalent created in the telecommunications (telephone) industry, Wireless Asynchronous Transfer Mode (WATM) is utilized to stream unified traffics like video, data, and voice data. In the asynchronous data transfer mode, voice data transfer a packet with the same medium, and data share the networks and burst data. Effective WATM data transmission requires an extensive array of designs, techniques used for control, and simulation methodologies. The congestion of the network is among the key challenges that lower the entire WATM performance during this procedure, in addition to the delay in cell and the overload of traffic. The congestions cause cell loss, and it requires expensive switches compared to the LAN. Consequently, in this current study, the application of an effectual switching model together with a control mechanism that possesses multiple accesses is employed. The multiple access process and switching model are utilized to establish an effective data sharing process with minimum complexity. The switching model uses the synchronous inputs and output ports with buffering to ensure the data sharing process. The traffic in the network is decreased, and the loss of packets in the cells is efficiently kept to a minimum by the proposed technique. The system being discussed is employed through the utilization of software employed using OPNET 10.5 simulation, with the valuation of the WATM along with the investigational outcomes accordingly. The system's efficiency is assessed by throughput, latency, cell loss probability value (CLP), overhead network, and packet loss. Thus, the system ensures the minimum packet loss (0.1 %) and high data transmission rate (96.6 %)
APA, Harvard, Vancouver, ISO, and other styles
4

Xia, Mo, Kueiming Lo, Shuangjia Shao, and Mian Sun. "Formal Modeling and Verification for MVB." Journal of Applied Mathematics 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/470139.

Full text
Abstract:
Multifunction Vehicle Bus (MVB) is a critical component in the Train Communication Network (TCN), which is widely used in most of the modern train techniques of the transportation system. How to ensure security of MVB has become an important issue. Traditional testing could not ensure the system correctness. The MVB system modeling and verification are concerned in this paper. Petri Net and model checking methods are used to verify the MVB system. A Hierarchy Colored Petri Net (HCPN) approach is presented to model and simulate the Master Transfer protocol of MVB. Synchronous and asynchronous methods are proposed to describe the entities and communication environment. Automata model of the Master Transfer protocol is designed. Based on our model checking platform M3C, the Master Transfer protocol of the MVB is verified and some system logic critical errors are found. Experimental results show the efficiency of our methods.
APA, Harvard, Vancouver, ISO, and other styles
5

Gupta, U. C., and Karabi Sikdar. "A finite capacity bulk service queue with single vacation and Markovian arrival process." Journal of Applied Mathematics and Stochastic Analysis 2004, no. 4 (January 1, 2004): 337–57. http://dx.doi.org/10.1155/s1048953304403025.

Full text
Abstract:
Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and arrivals are governed by MAP. The server takes a single vacation when he finds less than “a” customers after service completion. The distributions of buffer contents at various epochs (service completion, vacation termination, departure, arbitrary and pre-arrival) have been obtained. Finally, some performance measures such as loss probability and average queue length are discussed. Numerical results are also presented in some cases.
APA, Harvard, Vancouver, ISO, and other styles
6

Núñez-Queija, R., and O. J. Boxma. "Analysis of a multi-server queueing model of ABR." Journal of Applied Mathematics and Stochastic Analysis 11, no. 3 (January 1, 1998): 339–54. http://dx.doi.org/10.1155/s1048953398000288.

Full text
Abstract:
In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR) traffic in Asynchronous Transfer Mode (ATM) networks. We consider a multi-channel service station with two types of customers, denoted by high priority and low priority customers. In principle, high priority customers have preemptive priority over low priority customers, except on a fixed number of channels that are reserved for low priority traffic. The arrivals occur according to two independent Poisson processes, and service times are assumed to be exponentially distributed. Each high priority customer requires a single server, whereas low priority customers are served in processor sharing fashion. We derive the joint distribution of the numbers of customers (of both types) in the system in steady state. Numerical results illustrate the effect of high priority traffic on the service performance of low priority traffic.
APA, Harvard, Vancouver, ISO, and other styles
7

Et. al., Vishal Chandra ,. "VLSI Design of A Chip With High Speed Atm Switch-A Review." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (April 10, 2021): 1655–59. http://dx.doi.org/10.17762/turcomat.v12i2.1451.

Full text
Abstract:
In current computer communication network, it is overwhelmed by two technologies, in particular Asynchronous Transfer Mode (ATM) and Internet Protocol (IP). Association situated ATM is the awesome constant administrations which require ensured nature of-administration like video conferencing. Be that as it may, connectionless IP is more proficient than ATM for non-ongoing administrations like email. Right now, the significant exploration challenge is on the most proficient method to coordinate ATM and IP into a solitary network effectively. It is shown by the acknowledgment of the highlight of the A/I Net architecture: the A/I Switch. In this postulation, a VLSI execution of a multistage self-steering ATM switch texture which is one of the vital parts of the A/I Switch will be presented. The size of the switch model is 16x16. The chip is intended to work at the very least frequency of 100MHz and the framework is equipped for dealing with the OC-12 (622 Mbps) connect rate. In view of a piece cut architecture, the whole 16x16 switch is acknowledged utilizing four indistinguishable chips. It accomplishes elite by using dispersed control and accelerate with the input-output buffering technique. A need structure, which upholds four-level, permits the postponement delicate ATM cells to be switched with the briefest inertness. It likewise empowers the non-interleaving directing plan of IP cells.
APA, Harvard, Vancouver, ISO, and other styles
8

Guerraoui, Rachid, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. "The consensus number of a cryptocurrency." Distributed Computing 35, no. 1 (October 23, 2021): 1–15. http://dx.doi.org/10.1007/s00446-021-00399-2.

Full text
Abstract:
AbstractMany blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spending; this is usually solved by achieving consensus on the order of transfers among the participants. In this paper, we treat the asset transfer problem as a concurrent object and determine its consensus number, showing that consensus is, in fact, not necessary to prevent double-spending. We first consider the problem as defined by Nakamoto, where only a single process—the account owner—can withdraw from each account. Safety and liveness need to be ensured for correct account owners, whereas misbehaving account owners might be unable to perform transfers. We show that the consensus number of an asset transfer object is 1. We then consider a more general k-shared asset transfer object where up to k processes can atomically withdraw from the same account, and show that this object has consensus number k. We establish our results in the context of shared memory with benign faults, allowing us to properly understand the level of difficulty of the asset transfer problem. We also translate these results in the message passing setting with Byzantine players, a model that is more relevant in practice. In this model, we describe an asynchronous Byzantine fault-tolerant asset transfer implementation that is both simpler and more efficient than state-of-the-art consensus-based solutions. Our results are applicable to both the permissioned (private) and permissionless (public) setting, as normally their differentiation is hidden by the abstractions on top of which our algorithms are based.
APA, Harvard, Vancouver, ISO, and other styles
9

Hsu, Ivy, and Jean Walrand. "Dynamic bandwidth allocation for ATM switches." Journal of Applied Probability 33, no. 3 (September 1996): 758–71. http://dx.doi.org/10.2307/3215357.

Full text
Abstract:
We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.
APA, Harvard, Vancouver, ISO, and other styles
10

Derkachev, S. V. "Microprocessor protection of electrical motors against phase failure in external power supply network." Vestnik IGEU, no. 1 (February 28, 2022): 46–53. http://dx.doi.org/10.17588/2072-2672.2022.1.046-053.

Full text
Abstract:
Nonsymmetrical modes in the external power supply network during operation can be caused by several reasons: phase failure due to strong wind or glaciation of overhead power lines, wire burnout due to persistent short circuits, open phase automatic reclosing. In case of open phase condition, the external power supply network, synchronous and asynchronous electric motors are powered along the two phases that are in operation. It leads to the negative sequence current, which poses maximum danger for electric motors, since it causes additional heating and, as a result, premature damage. Therefore, the currently important goal of the project is to study transient processes of the motor load when an open phase mode occurs in the external power supply network and to design microprocessor protection of electrical motors against phase failure in the supply network. To achieve the goal, a computer simulation method is used, based on mathematical models of the elements of electrical network presented as the systems of differential equations in a three-phase coordinate system. The regularities of the flow of transient processes in synchronous and asynchronous electric motors in case of open phase modes in both the internal and external power supply networks have been established. Thus, it is possible to develop an algorithm of the operation of microprocessor protection of electrical motors against phase failure in the external power supply network. The proposed algorithm is based on monitoring the negative sequence current level and the absence of current in one of the phases at the section input. The obtained results show that the proposed algorithm to protect electrical motors against open phase modes in an external power supply network has a high selectivity. Its use as a starting element of the fast-acting automatic transfer switch device allows you to provide uninterrupted power supply for enterprises with a continuous technological process.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Asynchronous transfer mode Mathematics"

1

Zhang, Liren. "Recovery of cell loss in ATM networks using forward error correction coding techniques /." Title page, contents and summary only, 1992. http://web4.library.adelaide.edu.au/theses/09PH/09phz6332.pdf.

Full text
Abstract:
Thesis (Ph. D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 1993.
Copies of author's previously published articles inserted. Includes bibliographical references (leaves 179-186).
APA, Harvard, Vancouver, ISO, and other styles
2

Shankaran, Rajan, University of Western Sydney, and School of Computing and Information Technology. "Asynchronous transfer mode security." THESIS_XXX_CIT_Shankaran_R.xml, 1999. http://handle.uws.edu.au:8081/1959.7/252.

Full text
Abstract:
There is a growing interest in the development of broadband services and networks for commercial use in both local area and wide area networks. The primary reasons for this is a pressing need to meet the demand for increased bandwidth for remote sites interconnection, and in high speed data transfer of bulk data such as images etc. There has also been a significant change in the characteristics of network traffic. It is increasingly taking the form of bursty traffic characterized by an unpredictable demand for bandwidth of several megabytes. A new generation of networking technologies have emerged to meet the demand of growing and uncertain bandwidth requirements. One such technology is called Asynchronous Transfer Mode (ATM) for use on broadband networks under the banner of broadband ISDN. ATM enables interconnection at high speeds in the range of Mbit/s or Gbit/s over wide areas, which effectively moves the bottleneck from networks to end systems. Furthermore, the user is able to access bandwidth on demand and the user is only charged for the bandwidth actually used. As more and more information (audio, image and data) is transferred over ATM networks, security issues are becoming increasingly critical. The rapidly growing use of the Internet to transfer confidential and sensitive information only enhances the importance of security services. One may even argue that the success of ATM will be determined not by its cost effectiveness but also to the level of trust that can be placed on its performance, security and availability. The objective of this dissertation is to address the issues involved in the design of security services for ATM networks.
Master of Science (Hons)
APA, Harvard, Vancouver, ISO, and other styles
3

Shankaran, Rajan. "Asynchronous transfer mode security /." View thesis, 1999. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030616.142410/index.html.

Full text
Abstract:
Thesis (M. Sc.) (Hons.) -- University of Western Sydney, Nepean, 1999.
Thesis submitted in fulfilment of the requirements for the award of the degree Master of Science (Honors) from the University of Western Sydney, Nepean, School of Computing and Information Technology. Bibliography : p. 87-88.
APA, Harvard, Vancouver, ISO, and other styles
4

Marzo, i. Lázaro Josep Lluís. "Enhanced convolution approach for CAC in ATM networks, an analytical study and implementation." Doctoral thesis, Universitat de Girona, 1997. http://hdl.handle.net/10803/7715.

Full text
Abstract:
The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks.
In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees.
Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay.
Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations.
To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution
Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios.
Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of
traffic (CLRj), an expression for the CLRj evaluation is also presented.
We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.
APA, Harvard, Vancouver, ISO, and other styles
5

Hachfi, Fakhreddine Mohamed. "Future of asynchronous transfer mode networking." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2639.

Full text
Abstract:
The growth of Asynchronous Transfer Mode (ATM) was considered to be the ideal carrier of the high bandwidth applications like video on demand and multimedia e-learning. ATM emerged commercially in the beginning of the 1990's. It was designed to provide a different quality of service at a speed up 100 Gbps for both real time and non real time application. The turn of the 90's saw a variety of technologies being developed. This project analyzes these technologies, compares them to the Asynchronous Transfer Mode and assesses the future of ATM.
APA, Harvard, Vancouver, ISO, and other styles
6

Yan, Zhaohui. "Performance Analysis of A Banyan Based ATM Switching Fabric with Packet Priority." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5199.

Full text
Abstract:
Since the emergence of the Asynchronous Transfer Mode ( A TM ) concept, various switching architectures have been proposed. The multistage interconnection networks have been proposed for the switching architecture under the A TM environment. In this thesis, we propose a new model for the performance analysis of an A TM switching fabric based on single-buffered Banyan network. In this model, we use a three-state, i.e., "empty", "new" and "blocked" Markov chain model to describe the behavior of the buffer within a switching element. In addition to traditional statistical analysis including throughput and delay, we also examine the delay variation. Performance results show that the proposed model is more accurate in describing the switch behavior under uniform traffic environment in comparison with the "two-state" Markov chain model developed by Jenq, et. al.[4] [6] . Based on the "three-state" model, we study a packet priority scheme which gives the blocked packet higher priority to be routed forward during contention. It is found that the standard deviation of the network delay is reduced by about 30%.
APA, Harvard, Vancouver, ISO, and other styles
7

Doar, John Matthew Simon. "Multicast in the asynchronous transfer mode environment." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241604.

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

Harris, Carol, Michele Mascari, Kevin Rice, Jeff Smith, and John Steedman. "ASYNCHRONOUS TRANSFER MODE (ATM) CONVERSION DEVICE (ACD)." International Foundation for Telemetering, 1997. http://hdl.handle.net/10150/607525.

Full text
Abstract:
International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada
The Asynchronous Transfer Mode (ATM) Conversion Device (ACD) System is based on state-of-the-art ATM technology. The system interfaces between high-rate ECL/RS-422 raw data bitstreams and Synchronous Optical Network (SONET) OC-3 fiber. The SONET OC-3 interface uses ATM Adaptation Layer Type Five (AAL5) format. The system exceeds its 50 Mbps raw data, single stream requirement and provides single stream raw data throughput at rates up to 75 Mbps. With ATM and SONET packaging overhead, this translates into 90 Mbps on the OC-3 fiber. In addition to high-rate throughput, the system provides multiplexing and demultiplexing of multiple stream throughput based on the ATM cell header Virtual Path and Virtual Channel Identifier (VPI/VCI) values. The system is designed with the flexibility to provide between three and six throughput channels. All of which are multiplexed/demultiplexed to and from the same OC-3 interface. Multiple stream cumulative raw data throughput rates of up to 80 Mbps, or 96 Mbps on the fiber, have successfully run.
APA, Harvard, Vancouver, ISO, and other styles
9

Van, Luinen Steven M. "Lossless statistical data service over Asynchronous Transfer Mode." Curtin University of Technology, Australian Telecommunications Research Institute, 1999. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=9898.

Full text
Abstract:
Asynchronous Transfer Mode (ATM) can provide deterministic channels as required for real time signals, as well as statistical multiplexing. For this reason, ATM has been chosen as the underlying technology for providing a Broadband Integrated Services Digital Network (B-ISDN). Two main classes of services are expected to be supported over a B-ISDN. These classes are real-time services and data services. Data services include computer communications (Local Area Network (LAN) interconnections) and general non-real time traffic, such as file transfer and small transactions.The provision of data services over ATM are better served with statistical multiplexing, provided that the service is loss-free. For multiplexing to be loss-free and still statistical, while the maximum service rate is fixed, the multiplexer tributaries must be controlled in flow, to assure no overflow of the multiplexing buffer. Provision of a service over ATM is accomplished by an ATM layer. Transfer Capability (ATC).This thesis investigates and reports on the operating characteristics of an ATM layer Transfer Capability proposed to the International Telecommunications Union (ITU), and called Controlled Cell Transfer (CCT). CCT uses credit window based flow control on links and a quota based control in switches, and will give loss free statistical multiplexing for data. Other ITU defined ATCs are examined in regard to data service provision and compared with CCT. It is found that only CCT can provide a fast and at the same time efficient data service.The thesis also examines the impact that support of the CCT capability would have on an ATM switch, through determination of required functionality, and mapping of the required functions into a switch design. Finally, an architecture and implementation of an ATM switch is described that would support the CCT as well as the Deterministic Bit Rate (DBR) ++
transfer capability, and would provide efficient data and real-time services.
APA, Harvard, Vancouver, ISO, and other styles
10

Eslinger, Brian, and Joleen McCombe. "Range Communications System Using Asynchronous Transfer Mode (ATM)." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/609653.

Full text
Abstract:
International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California
As aircraft become more complex and require more resources over larger areas, the challenge of the test ranges is to provide economical solutions to move telemetry data from the test article to the data processing facility. Edwards AFB is in the process of upgrading the ground transmission facilities to transport data including telemetry using Asynchronous Transfer Mode (ATM). This paper documents the challenge of supporting telemetry over ATM, different approaches that are available, the benefits of using ATM, and discussion of candidate hardware options. The effort at Edwards include the linking of the major range facilities over a fiber optic backbone and links to other major test ranges in the Southwest Range Complex via microwave. The fiber optic backbone is expected to be OC-12c (622 Mbps) ATM supporting new capabilities as well as all of the legacy systems. The backbone system will be designed so that migration to OC-48 is possible without service disruption. The microwave links are multiple DS-3 capable. Some of these DS-3s may support legacy systems, but the ability to link ranges using ATM is expected simultaneously.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Asynchronous transfer mode Mathematics"

1

Hübner, Frank. Discrete-time performance analysis of finite-capacity queueing models for ATM multiplexers. Aachen: Verlag Shaker, 1994.

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

Pendarakis, Dimitrios E. On the tradeoff between transport and signaling in broadband network. New York, NY: Columbia University, 1996.

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

1953-, Kim Byung Guk, ed. Discrete-time models for communication systems including ATM. Boston: Kluwer Academic Publishers, 1993.

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

Prycker, Martin de. Asynchronous transfer mode: ATM. München ; Toronto: Prentice Hall, 1996.

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

Viniotis, Yannis, and Raif O. Onvural, eds. Asynchronous Transfer Mode Networks. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2844-9.

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

Viniotis, Yannis. Asynchronous Transfer Mode Networks. Boston, MA: Springer US, 1993.

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

Yannis, Viniotis, Onvural Raif O. 1959-, and TriComm '93 (1993 : Raleigh, N.C.), eds. Asynchronous transfer mode networks. New York: Plenum Press, 1993.

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

Asynchronous transfer mode networks: Performance issues. 2nd ed. Boston: Artech House, 1995.

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

Asynchronous transfer mode networks: Performance issues. Boston: Artech House, 1994.

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

ATM, asynchronous transfer mode, user's guide. New York: Flatiron Publishing, 1994.

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

Book chapters on the topic "Asynchronous transfer mode Mathematics"

1

Häckelmann, Heiko, Hans Joachim Petzold, and Susanne Strahringer. "Asynchronous Transfer Mode." In Kommunikationssysteme, 151–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-57242-5_14.

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

Weik, Martin H. "asynchronous transfer mode." In Computer Science and Communications Dictionary, 71. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_944.

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

Weik, Martin H. "Asynchronous Transfer Mode." In Computer Science and Communications Dictionary, 71. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_945.

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

Buchanan, William J. "Asynchronous Transfer Mode (ATM)." In Advanced Data Communications and Networks, 497–514. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4419-8670-2_31.

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

Weik, Martin H. "asynchronous transfer mode adaptation." In Computer Science and Communications Dictionary, 71. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_946.

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

Robertazzi, Thomas. "Asynchronous Transfer Mode (ATM)." In Basics of Computer Networking, 45–51. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-2104-7_5.

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

Buchanan, W. "Asynchronous Transfer Mode (ATM)." In Applied Data Communications and Networks, 229–42. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1207-9_12.

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

Abensour, Daniel, Jean Calvignac, and Len Felton. "Some Obstacles on the Road to ATM." In Asynchronous Transfer Mode Networks, 1–13. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2844-9_1.

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

Holtsinger, Douglas S. "Congestion Control Mechanisms for ATM Networks." In Asynchronous Transfer Mode Networks, 107–22. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2844-9_10.

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

Sohraby, Khosrow. "Highly-Bursty Sources and their Admission Control in ATM Networks." In Asynchronous Transfer Mode Networks, 123–33. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2844-9_11.

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

Conference papers on the topic "Asynchronous transfer mode Mathematics"

1

Bechtold, John. "Supporting Asynchronous Transfer Mode on satellite communication links." In Space Programs and Technologies Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1996. http://dx.doi.org/10.2514/6.1996-4234.

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

Hodgkinson, T. "Internet and asynchronous transfer mode networking: a philosophical comparison." In IEE Colloquium on Shaping Tomorrow's Networks: Trends in Network Architectures for Delivering Present and Future Services. IEE, 1998. http://dx.doi.org/10.1049/ic:19980496.

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

Garrett, Ken. "Realities of Asynchronous Transfer Mode in fiber optic networks." In Critical Review Collection. SPIE, 1994. http://dx.doi.org/10.1117/12.192182.

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

Andonovic, I., M. Tweddle, B. Culshaw, and I. Marshall. "Optical techniques for header recognition in asynchronous transfer-mode networks." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 1992. http://dx.doi.org/10.1364/ofc.1992.wh5.

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

Otter, M. D. "Modelling asynchronous transfer mode (ATM) traffic over the satellite bearer." In IEE Colloquium on Military Satellite Communications. IEE, 2000. http://dx.doi.org/10.1049/ic:20000129.

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

Chao Zhang, Jialuo Xiao, and Liang Zhao. "Wireless Asynchronous Transfer Mode based fly-by-wireless avionics network." In 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference (DASC). IEEE, 2013. http://dx.doi.org/10.1109/dasc.2013.6712589.

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

Zhang, Chao, Jialuo Xiao, and Liang Zhao. "Wireless Asynchronous Transfer Mode Based Fly-by-Wireless Avionics Network." In 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference (DASC). IEEE, 2013. http://dx.doi.org/10.1109/dasc.2013.6719671.

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

Wong, Albert W. K., H. K. Huang, Joseph K. Lee, Todd M. Bazzill, and Xiaoming Zhu. "High-performance image communication network with asynchronous transfer mode technology." In Medical Imaging 1996, edited by R. Gilbert Jost and Samuel J. Dwyer III. SPIE, 1996. http://dx.doi.org/10.1117/12.239294.

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

Duerinckx, Andre J., Alek S. Hayrapetian, Daniel J. Valentino, Edward G. Grant, Darius Rahbar, Mike Kiszonas, Ricky Franco, et al. "Assessment of asynchronous transfer mode (ATM) networks for regional teleradiology." In Medical Imaging 1996, edited by R. Gilbert Jost and Samuel J. Dwyer III. SPIE, 1996. http://dx.doi.org/10.1117/12.239298.

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

Yamamoto, K., K. Kihara, K. Yamazaki, and H. Kobayashi. "A subscriber line interface processor for asynchronous transfer mode switching system." In 1990 37th IEEE International Conference on Solid-State Circuits. IEEE, 1990. http://dx.doi.org/10.1109/isscc.1990.110114.

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

Reports on the topic "Asynchronous transfer mode Mathematics"

1

Long, Douglas, and Peter Samsel. Asynchronous Transfer Mode (ATM) User Security Services. Fort Belvoir, VA: Defense Technical Information Center, June 2001. http://dx.doi.org/10.21236/ada388288.

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

Thompson, B., T. Koren, and B. Buffam. PPP Over Asynchronous Transfer Mode Adaptation Layer 2 (AAL2). RFC Editor, December 2002. http://dx.doi.org/10.17487/rfc3336.

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

Tolendino, L. F. Windows NT 4.0 Asynchronous Transfer Mode network interface card performance. Office of Scientific and Technical Information (OSTI), February 1997. http://dx.doi.org/10.2172/459446.

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

Yu, Christopher C. Preliminary Analysis of Asynchronous Transfer Mode (ATM) over Microwave Channels. Fort Belvoir, VA: Defense Technical Information Center, December 1993. http://dx.doi.org/10.21236/ada275214.

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

Thompson, B., T. Koren, and B. Buffam. Class Extensions for PPP over Asynchronous Transfer Mode Adaptation Layer 2. RFC Editor, December 2002. http://dx.doi.org/10.17487/rfc3337.

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

Kumar, R. Asynchronous Transfer Mode (ATM) Package for the Media Gateway Control Protocol (MGCP). RFC Editor, January 2003. http://dx.doi.org/10.17487/rfc3441.

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

Singh, S., M. Townsley, and C. Pignataro. Asynchronous Transfer Mode (ATM) over Layer 2 Tunneling Protocol Version 3 (L2TPv3). RFC Editor, May 2006. http://dx.doi.org/10.17487/rfc4454.

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

Martini, L., J. Jayakumar, M. Bocci, N. El-Aawar, J. Brayley, and G. Koleyni. Encapsulation Methods for Transport of Asynchronous Transfer Mode (ATM) over MPLS Networks. RFC Editor, December 2006. http://dx.doi.org/10.17487/rfc4717.

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

Ott, Teunis J., James E. Burns, and Larry H. Wong. Transmission Control Protocol (TCP) Over Asynchronous Transfer Mode (ATM): A Simulation Study. Fort Belvoir, VA: Defense Technical Information Center, November 2000. http://dx.doi.org/10.21236/ada386671.

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

Malis, A., L. Martini, J. Brayley, and T. Walsh. Pseudowire Emulation Edge-to-Edge (PWE3) Asynchronous Transfer Mode (ATM) Transparent Cell Transport Service. RFC Editor, February 2007. http://dx.doi.org/10.17487/rfc4816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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