Log in

Relevant bibliographies by topics / Asynchronous transfer mode Mathematics / Journal articles

Journal articles on the topic 'Asynchronous transfer mode Mathematics'

To see the other types of publications on this topic, follow the link: Asynchronous transfer mode Mathematics.

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

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

Select a source type:

Consult the top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Meredith, David, Stephen Crouch, Gerson Galang, Ming Jiang, Hung Nguyen, and Peter Turner. "Towards a scalable, open-standards service for brokering cross-protocol data transfers across multiple sources and sinks." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 368, no. 1926 (September 13, 2010): 4115–31. http://dx.doi.org/10.1098/rsta.2010.0148.

Full text

Abstract:

Data Transfer Service (DTS) is an open-source project that is developing a document-centric message model for describing a bulk data transfer activity, with an accompanying set of loosely coupled and platform-independent components for brokering the transfer of data between a wide range of (potentially incompatible) storage resources as scheduled, fault-tolerant batch jobs. The architecture scales from small embedded deployments on a single computer to large distributed deployments through an expandable ‘worker-node pool’ controlled through message-orientated middleware. Data access and transfer efficiency are maximized through the strategic placement of worker nodes at or between particular data sources/sinks. The design is inherently asynchronous, and, when third-party transfer is not available, it side-steps the bandwidth, concurrency and scalability limitations associated with buffering bytes directly through intermediary client applications. It aims to address geographical–topological deployment concerns by allowing service hosting to be either centralized (as part of a shared service) or confined to a single institution or domain. Established design patterns and open-source components are coupled with a proposal for a document-centric and open-standards-based messaging protocol. As part of the development of the message protocol, a bulk data copy activity document is proposed for the first time.

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

Peyravian, M., and T. D. Tarman. "Asynchronous transfer mode security." IEEE Network 11, no. 3 (1997): 34–40. http://dx.doi.org/10.1109/65.587048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hill, M., A. Cantoni, and T. Moors. "Asynchronous transfer mode receiver." IEE Proceedings E Computers and Digital Techniques 139, no. 5 (1992): 401. http://dx.doi.org/10.1049/ip-e.1992.0058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Aaron, M. R., and M. Decina. "Asynchronous transfer mode or synchronous transfer mode or both." IEEE Communications Magazine 29, no. 1 (January 1991): 10–13. http://dx.doi.org/10.1109/35.64716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Rudin, Harry. "The ATM—Asynchronous transfer mode." Computer Networks and ISDN Systems 24, no. 4 (May 1992): 277–78. http://dx.doi.org/10.1016/0169-7552(92)90113-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Morrison, J. A. "Loss probabilities in a simple circuit-switched network." Advances in Applied Probability 26, no. 2 (June 1994): 456–73. http://dx.doi.org/10.2307/1427446.

Full text

Abstract:

In this paper a particular loss network consisting of two links with C1 and C2 circuits, respectively, and two fixed routes, is investigated. A call on route 1 uses a circuit from both links, and a call on route 2 uses a circuit from only the second link. Calls requesting routes 1 and 2 arrive as independent Poisson streams. A call requesting route 1 is blocked and lost if there are no free circuits on either link, and a call requesting route 2 is blocked and lost if there is no free circuit on the second link. Otherwise the call is connected and holds a circuit from each link on its route for the holding period of the call.The case in which the capacities C1, and C2, and the traffic intensities v1, and v2, all become large of O(N) where N » 1, but with their ratios fixed, is considered. The loss probabilities L1 and L2 for calls requesting routes 1 and 2, respectively, are investigated. The asymptotic behavior of L1 and L2 as N→ ∞ is determined with the help of double contour integral representations and saddlepoint approximations. The results differ in various regions of the parameter space (C1, C2, v1, v2). In some of these results the loss probabilities are given in terms of the Erlang loss function, with appropriate arguments, to within an exponentially small relative error. The results provide new information when the loss probabilities are exponentially small in N. This situation is of practical interest, e.g. in cellular systems, and in asynchronous transfer mode networks, where very small loss probabilities are desired.The accuracy of the Erlang fixed-point approximations to the loss probabilities is also investigated. In particular, it is shown that the fixed-point approximation E2 to L2 is inaccurate in a certain region of the parameter space, since L2 « E2 there. On the other hand, in some regions of the parameter space the fixed-point approximations to both L1 and L2 are accurate to within an exponentially small relative error.

APA, Harvard, Vancouver, ISO, and other styles

18

Sivalingam, Krishna M. "Asynchronous transfer mode networks: Performance issues." Computer Communications 18, no. 9 (September 1995): 687. http://dx.doi.org/10.1016/0140-3664(95)90014-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Okada, T., H. Ohnishi, and N. Morita. "Traffic control in asynchronous transfer mode." IEEE Communications Magazine 29, no. 9 (September 1991): 58–62. http://dx.doi.org/10.1109/35.90494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Le Boudec, Jean-Yves. "The Asynchronous Transfer Mode: a tutorial." Computer Networks and ISDN Systems 24, no. 4 (May 1992): 279–309. http://dx.doi.org/10.1016/0169-7552(92)90114-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Imai, Kazuo, Tadashi Ito, Hideki Kasahara, and Naotaka Morita. "ATMR: Asynchronous transfer mode ring protocol." Computer Networks and ISDN Systems 26, no. 6-8 (March 1994): 785–98. http://dx.doi.org/10.1016/0169-7552(94)90045-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Rizk, M. R. M., H. Rashwan, and A. Abdel Aziz. "A Modified Asynchronous Transfer Mode Fuzzy Policer." Sultan Qaboos University Journal for Science [SQUJS] 7, no. 1 (June 1, 2002): 137. http://dx.doi.org/10.24200/squjs.vol7iss1pp137-146.

Full text

Abstract:

A Modified Fuzzy policer for Asynchronous Transfer Mode is introduced. In a preceding fuzzy policer model the time window (time interval where ATM cells are accepted in the policer) is not synchronized with the source activity. In the proposed one, the time windows are not consecutive but are triggered by the first arriving cell. The modified policer gives good improvement to the selectivity, and minimizes the congestion over the path. This improvement can be significant for multiple channels.

APA, Harvard, Vancouver, ISO, and other styles

23

Jeffrey, M. "Asynchronous transfer mode: the ultimate broadband solution." Electronics & Communication Engineering Journal 6, no. 3 (June 1, 1994): 143–51. http://dx.doi.org/10.1049/ecej:19940308.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Minzer, S. E. "Broadband ISDN and asynchronous transfer mode (ATM)." IEEE Communications Magazine 27, no. 9 (September 1989): 17–24. http://dx.doi.org/10.1109/35.35508.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Gutierrez, C. F., and D. Holt. "Asynchronous transfer mode: an engineering management perspective." Engineering Management Journal 8, no. 4 (1998): 177. http://dx.doi.org/10.1049/em:19980409.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Downs, Stephen J. "Asynchronous transfer mode and public broadband networks." Telecommunications Policy 18, no. 2 (March 1994): 114–36. http://dx.doi.org/10.1016/0308-5961(94)90046-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Sameena, T., and S. Pranesh. "Synchronous and Asynchronous Boundary Temperature Modulations on Triple-Diffusive Convection in Couple Stress Liquid Using Ginzburg-Landau Model." International Journal of Engineering & Technology 7, no. 4.10 (October 2, 2018): 645. http://dx.doi.org/10.14419/ijet.v7i4.10.21304.

Full text

Abstract:

A nonlinear study of synchronous and asynchronous boundary temperature modulations on the onset of triple-diffusive convection in couple stress liquid is examined. Two cases of temperature modulations are studied: (a) Synchronous temperature modulation ( ) and (b) Asynchronous temperature modulation ( ). It is done to examine the influence of mass and heat transfer by deriving Ginzburg-Landau equation. The resultant Ginzburg-Landau equation is Bernoulli equation and it is solved numerically by means of Mathematica. The influence of solute Rayleigh numbers and couple stress parameter is studied. It is observed that couple stress parameter increases the mass and heat transfer whereas solute Rayleigh numbers decreases the mass and heat transfer.

APA, Harvard, Vancouver, ISO, and other styles

28

Duerinckx, A. J., A. Hayrapetian, M. Melany, D. J. Valentino, D. Rahbar, M. Kiszonas, R. Franco, S. L. Narin, N. Ragavendra, and E. G. Grant. "Real-time sonographic video transfer using asynchronous transfer mode technology." American Journal of Roentgenology 168, no. 5 (May 1997): 1353–55. http://dx.doi.org/10.2214/ajr.168.5.9129443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Huang, H. K., R. L. Arenson, W. P. Dillon, S. L. Lou, T. Bazzill, and A. W. Wong. "Asynchronous transfer mode technology for radiologic image communication." American Journal of Roentgenology 164, no. 6 (June 1995): 1533–36. http://dx.doi.org/10.2214/ajr.164.6.7754909.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zhu, Zheng-wei, and Yu-ying Guo. "Digital television transmission based on asynchronous transfer mode." Journal of Zhejiang University-SCIENCE A 7, no. 6 (June 2006): 996–1000. http://dx.doi.org/10.1631/jzus.2006.a0996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Chung-Sheng Li. "Asynchronous Transfer Mode Networks: Performance Issues [Book Review]." IEEE Communications Magazine 34, no. 9 (September 1996): 10. http://dx.doi.org/10.1109/mcom.1996.536547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Nakada, H., and K. I. Sato. "Variable rate speech coding for asynchronous transfer mode." IEEE Transactions on Communications 38, no. 3 (March 1990): 277–84. http://dx.doi.org/10.1109/26.48884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Laeticia, Onyejegbu, and Okafor Nkiru. "Congestion Control in Asynchronous Transfer Mode (ATM) Network." International Journal of Computer Applications 142, no. 4 (May 17, 2016): 11–15. http://dx.doi.org/10.5120/ijca2016909736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Dachepally, Maduri, Sheena Mohammed, and A. Annapurna. "Problems and Alternative Approach to Asynchronous Transfer Mode." International Journal of Applied Research on Information Technology and Computing 6, no. 1 (2015): 44. http://dx.doi.org/10.5958/0975-8089.2015.00007.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Suzuki, H., H. Nagano, T. Suzuki, T. Takeuchi, and S. Iwasaki. "Output-buffer switch architecture for asynchronous transfer mode." International Journal of Digital & Analog Cabled Systems 2, no. 4 (1989): 269–76. http://dx.doi.org/10.1002/dac.4520020410.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Shobatake, Yasuro, and Takashi Kamitake. "A large-scale asynchronous transfer mode switch architecture." Electronics and Communications in Japan (Part I: Communications) 79, no. 3 (1996): 1–11. http://dx.doi.org/10.1002/ecja.4410790301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Chung-Sheng Li. "Asynchronous Transfer Mode: Solution for Broadband ISDN [Book Reviews]." IEEE Communications Magazine 34, no. 6 (June 1996): 16. http://dx.doi.org/10.1109/mcom.1996.506807.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Hughes, C. J., and A. (Gill) Waters. "Packet power: B-ISDN and the asynchronous transfer mode." IEE Review 37, no. 10 (1991): 357. http://dx.doi.org/10.1049/ir:19910166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Boffi, Pierpaolo, Guido Maier, Mario Martinelli, and Riccardo Melen. "Optical implementation of asynchronous-transfer-mode header-error control." Applied Optics 39, no. 5 (February 10, 2000): 827. http://dx.doi.org/10.1364/ao.39.000827.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

IHEKWEABA, C., and G. N. ONOH. "An Improved Fuzzy Controlled Asynchronous Transfer Mode (ATM) Network." International Journal of Engineering and Technology 2, no. 6 (2010): 567–73. http://dx.doi.org/10.7763/ijet.2010.v2.183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Anagnostou, M. E., M. E. Theologou, and E. N. Protonotarios. "Cell insertion ratio analysis in asynchronous transfer mode networks." Computer Networks and ISDN Systems 24, no. 4 (May 1992): 335–44. http://dx.doi.org/10.1016/0169-7552(92)90117-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Wang, Shengquan, Chao Wang, Yong Cai, and Guangyao Li. "A novel parallel finite element procedure for nonlinear dynamic problems using GPU and mixed-precision algorithm." Engineering Computations 37, no. 6 (February 22, 2020): 2193–211. http://dx.doi.org/10.1108/ec-07-2019-0328.

Full text

Abstract:

Purpose The purpose of this paper is to improve the computational speed of solving nonlinear dynamics by using parallel methods and mixed-precision algorithm on graphic processing units (GPUs). The computational efficiency of traditional central processing units (CPUs)-based computer aided engineering software has been difficult to satisfy the needs of scientific research and practical engineering, especially for nonlinear dynamic problems. Besides, when calculations are performed on GPUs, double-precision operations are slower than single-precision operations. So this paper implemented mixed precision for nonlinear dynamic problem simulation using Belytschko-Tsay (BT) shell element on GPU. Design/methodology/approach To minimize data transfer between heterogeneous architectures, the parallel computation of the fully explicit finite element (FE) calculation is realized using a vectorized thread-level parallelism algorithm. An asynchronous data transmission strategy and a novel dependency relationship link-based method, for efficiently solving parallel explicit shell element equations, are used to improve the GPU utilization ratio. Finally, this paper implements mixed precision for nonlinear dynamic problems simulation using the BT shell element on a GPU and compare it to the CPU-based serially executed program and a GPU-based double-precision parallel computing program. Findings For a car body model containing approximately 5.3 million degrees of freedom, the computational speed is improved 25 times over CPU sequential computation, and approximately 10% over double-precision parallel computing method. The accuracy error of the mixed-precision computation is small and can satisfy the requirements of practical engineering problems. Originality/value This paper realized a novel FE parallel computing procedure for nonlinear dynamic problems using mixed-precision algorithm on CPU-GPU platform. Compared with the CPU serial program, the program implemented in this article obtains a 25 times acceleration ratio when calculating the model of 883,168 elements, which greatly improves the calculation speed for solving nonlinear dynamic problems.

APA, Harvard, Vancouver, ISO, and other styles

43

Al-Sharhan, S., F. Karray, and W. Gueaieb. "Learning-based resource optimization in asynchronous transfer mode (ATM) networks." IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 33, no. 1 (February 2003): 122–32. http://dx.doi.org/10.1109/tsmcb.2003.808178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Zhang, Zhijian. "Optical buffer in an asynchronous transfer mode photonic switching system." Optical Engineering 35, no. 5 (May 1, 1996): 1511. http://dx.doi.org/10.1117/1.600688.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Bates, S. "The asynchronous transfer mode: is it a waste of space?" Electronics & Communication Engineering Journal 8, no. 5 (October 1, 1996): 225–33. http://dx.doi.org/10.1049/ecej:19960503.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Sundarambal, M., R. Devaraj, and P. Anbalagan. "Evolutionary approach for buffer management in asynchronous transfer mode networks." International Journal of Information Systems and Change Management 3, no. 4 (2008): 344. http://dx.doi.org/10.1504/ijiscm.2008.026710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kamiyama, Noriaki, Hideki Tode, Miki Yamamoto, and Hiromi Okada. "A quantitative evaluation for the introduction of quasi-synchronous transfer mode method on the asynchronous transfer mode network." Electronics and Communications in Japan (Part I: Communications) 79, no. 8 (1996): 1–11. http://dx.doi.org/10.1002/ecja.4410790801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Xu, Jin, Qiao Wang, Jian Wei Tian, and Zheng Mao Mei. "Research of Asynchronous Communication Based on the 1394 Bus Network." Advanced Materials Research 760-762 (September 2013): 542–45. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.542.

Full text

Abstract:

This paper introduced the asynchronous communication mechanism in 1394 bus network, and described 1394 network communication system for building the network topology, node architecture and asynchronous transfer mode communication. We proposed a 1394 bus network asynchronous communication mechanism with high-security, high-reliability. At last it verified the communication in the network with one control computer and four remote nodes.

APA, Harvard, Vancouver, ISO, and other styles

49

Ibrahim Diyeb, Ibrahim Ali, and Sharaf A. Alhomdy. "Frame Relay versus Asynchronous Transfer Mode: A Comparative Study and Simulation." International Journal of Computer Network and Information Security 9, no. 10 (October 8, 2017): 33–40. http://dx.doi.org/10.5815/ijcnis.2017.10.04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chao, H. J., C. A. Johnston, and L. S. Smoot. "A packet video/audio system using the asynchronous transfer mode technique." IEEE Transactions on Consumer Electronics 35, no. 2 (May 1989): 97–105. http://dx.doi.org/10.1109/30.24662.

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!