We propose a protocol, ATM/IP, that encapsulates ATM cells into TCP segments to virtually connect end-user multimedia terminals with ATM based backbone networks. This protocol will enable end-users or service providers to develop and deploy real-time, network-aware applications where the network backbone is ATM based, and the backbone is connected to the multimedia terminals over a well-managed local IP network or a dial-up IP connection. Approaches such as RSVP, diffServ, MPLS and IP over SONET are underway to bring real-time services capability to the Internet independent of ATM. However, ATM continues to be the only promising technology in this area because of its ability to negotiate connection parameters and to enforce performance across the network to guarantee those parameters. Our proposal bridges the gap in networks where ATM will be the primary technology used in the network backbone, but not to connect the backbone to end-user terminals.
我们提出了一种ATM/IP协议，它将ATM单元封装到TCP段中，以虚拟地将终端用户多媒体终端与基于ATM的骨干网连接起来。该协议将使最终用户或服务提供商能够开发和部署实时的网络感知应用，其中网络骨干网是基于ATM的，骨干网通过管理良好的本地IP网络或拨号IP连接连接到多媒体终端。诸如RSVP、diffServ、MPLS和IP over SONET等方法正在进行中，它们将独立于ATM的实时服务能力引入互联网。然而，ATM仍然是该领域唯一有前途的技术，因为它能够协商连接参数并在整个网络中强制执行性能以保证这些参数。我们的建议弥补了ATM将成为骨干网中使用的主要技术的网络差距，但不是将骨干网连接到最终用户终端。
{"title":"Encapsulating ATM cells in TCP/IP for transport between ATM based backbone and end-user terminals, to enable real-time network-aware services","authors":"S. Kowtha","doi":"10.1109/ATM.1999.786857","DOIUrl":"https://doi.org/10.1109/ATM.1999.786857","url":null,"abstract":"We propose a protocol, ATM/IP, that encapsulates ATM cells into TCP segments to virtually connect end-user multimedia terminals with ATM based backbone networks. This protocol will enable end-users or service providers to develop and deploy real-time, network-aware applications where the network backbone is ATM based, and the backbone is connected to the multimedia terminals over a well-managed local IP network or a dial-up IP connection. Approaches such as RSVP, diffServ, MPLS and IP over SONET are underway to bring real-time services capability to the Internet independent of ATM. However, ATM continues to be the only promising technology in this area because of its ability to negotiate connection parameters and to enforce performance across the network to guarantee those parameters. Our proposal bridges the gap in networks where ATM will be the primary technology used in the network backbone, but not to connect the backbone to end-user terminals.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127157880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, an error correction scheme employing side information is proposed for the first time to improve the throughput of asynchronous transfer mode (ATM) transmission over a Rayleigh fading channel using binary phase shift keying (BPSK) modulation. With the combination of the selective repeat protocol (SR) in the link layer and the error correction scheme, the throughput of the ATM cell is improved significantly. Numerical examples show that at high bit error rate the throughput gain is enormous.
{"title":"Throughput of ATM cell over wireless Rayleigh channel","authors":"Jingshown Wu, Che-Li Lin","doi":"10.1109/ATM.1999.786890","DOIUrl":"https://doi.org/10.1109/ATM.1999.786890","url":null,"abstract":"In this paper, an error correction scheme employing side information is proposed for the first time to improve the throughput of asynchronous transfer mode (ATM) transmission over a Rayleigh fading channel using binary phase shift keying (BPSK) modulation. With the combination of the selective repeat protocol (SR) in the link layer and the error correction scheme, the throughput of the ATM cell is improved significantly. Numerical examples show that at high bit error rate the throughput gain is enormous.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117243152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a shared multi-buffer ATM switch, in which each unicast cell has chances to be read from a shared buffer during three consecutive read cycles and each multicast cell is read from a shared buffer if the shared buffer is not accessed for read of a unicast cell at the last read cycle. The HOL effect that the unicast cells experience is not augmented by the multicast cells and the utilization rate of the output ports is increased because both a unicast cell and a multicast cell have the opportunity to be read for each output port. For a fixed multicast rate, the proposed scheme shows 98.9% throughput even though the offered load reaches 1. We designed the proposed shared multi-buffer ATM switch in 0.6 um single-poly triple metal CMOS technology. The designed shared multi-buffer ATM switch has 8/spl times/8 ports and operates at 20 MHz, which supports 155.52 Mbit/s STM-1 source rate for each port.
{"title":"Design of a shared multi-buffer ATM switch with enhanced throughput in multicast environments","authors":"JongIck Lee, JongMoo Sohn, MoonKey Lee","doi":"10.1109/ATM.1999.786896","DOIUrl":"https://doi.org/10.1109/ATM.1999.786896","url":null,"abstract":"We propose a shared multi-buffer ATM switch, in which each unicast cell has chances to be read from a shared buffer during three consecutive read cycles and each multicast cell is read from a shared buffer if the shared buffer is not accessed for read of a unicast cell at the last read cycle. The HOL effect that the unicast cells experience is not augmented by the multicast cells and the utilization rate of the output ports is increased because both a unicast cell and a multicast cell have the opportunity to be read for each output port. For a fixed multicast rate, the proposed scheme shows 98.9% throughput even though the offered load reaches 1. We designed the proposed shared multi-buffer ATM switch in 0.6 um single-poly triple metal CMOS technology. The designed shared multi-buffer ATM switch has 8/spl times/8 ports and operates at 20 MHz, which supports 155.52 Mbit/s STM-1 source rate for each port.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hakyong Kim, Kiseon Kim, Yongtak Lee, Hyunho Yoon, C. Oh
A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N/sup 2/) in the worst case, where N is the switch size.
{"title":"Cell selection algorithm for the multiple input-queued ATM switch: chessboard and random cell selections","authors":"Hakyong Kim, Kiseon Kim, Yongtak Lee, Hyunho Yoon, C. Oh","doi":"10.1109/ATM.1999.786866","DOIUrl":"https://doi.org/10.1109/ATM.1999.786866","url":null,"abstract":"A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N/sup 2/) in the worst case, where N is the switch size.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117168383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Efficient integration of network- and link-layers is becoming very important in deploying ATM networks in the IP-dominant Internet environment. Existing integration schemes, often called shortcut schemes, primarily map network layer services (such as IP protocol) onto link layer connections (such as ATM connections). Those existing schemes, however, have some drawbacks in scalability and latency when performing this mapping. Therefore, we propose a new scheme in which the features of the existing shortcut schemes are combined to overcome the drawbacks of existing schemes. The proposed scheme is based on the overlay model in the sense that both IP and ATM addresses are used and provide standard ATM connections as direct shortcuts using the ATM address resolved from the IP address. This scheme, at the same time, allows a flexible mechanism for various levels of flow aggregation capability using IP topology information provided by routing protocols such as BGP, OSPF, etc.
{"title":"A partition shortcut scheme for IP/ATM integration","authors":"S. Ahn, T. Suda","doi":"10.1109/ATM.1999.786860","DOIUrl":"https://doi.org/10.1109/ATM.1999.786860","url":null,"abstract":"Efficient integration of network- and link-layers is becoming very important in deploying ATM networks in the IP-dominant Internet environment. Existing integration schemes, often called shortcut schemes, primarily map network layer services (such as IP protocol) onto link layer connections (such as ATM connections). Those existing schemes, however, have some drawbacks in scalability and latency when performing this mapping. Therefore, we propose a new scheme in which the features of the existing shortcut schemes are combined to overcome the drawbacks of existing schemes. The proposed scheme is based on the overlay model in the sense that both IP and ATM addresses are used and provide standard ATM connections as direct shortcuts using the ATM address resolved from the IP address. This scheme, at the same time, allows a flexible mechanism for various levels of flow aggregation capability using IP topology information provided by routing protocols such as BGP, OSPF, etc.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
It is important to establish the technology to accommodate best-effort TCP/IP traffic over wide area ATM networks. The UBR (unspecified bit rate) service category is the most typical service category for the best-effort traffic, especially in the LAN environment. On the other hand, the VBR (variable bit rate) service category with SCD (selective cell discard) option is considered as the service category which is appropriate for wide area networks due to its fairness and minimum guarantee of the cell transmission using not only PCR (peak cell rate) but SCR (sustainable cell rate) and MBS (maximum burst size). However, there is no actual evaluation for such service. We have, therefore, performed the experimental studies on TCP/IP over VBR with SCD service along with UBR and VBR without SCD cases. Through these experiments, we measured the link utilization of the effective data and the fairness between each obtained TCP/IP throughput during congestion of the ATM switch. From the results of the link utilization, the value is always over 90% under the various conditions. Therefore, even in the case of cell losses due to SCD or buffer overflow in ATM switch congestion, the average throughput is almost the same as the value which equals the trunk line speed divided by the number of the accommodated TCP/IP connections. From the results of the fairness, VBR with SCD has almost the same characteristics as UBR and obtains better TCP/IP throughput than VBR without SCD. Finally, we discuss the effectiveness of VBR with SCD and the other service categories, such as UBR and ABR (available bit rate), and conclude that VBR with SCD is one of the most suitable ATM service categories for wide area ATM networks.
{"title":"A study on accommodation of TCP/IP best-effort traffic to wide area ATM network with VBR service category using selective cell discard","authors":"S. Ano, T. Hasegawa, T. Kato","doi":"10.1109/ATM.1999.786907","DOIUrl":"https://doi.org/10.1109/ATM.1999.786907","url":null,"abstract":"It is important to establish the technology to accommodate best-effort TCP/IP traffic over wide area ATM networks. The UBR (unspecified bit rate) service category is the most typical service category for the best-effort traffic, especially in the LAN environment. On the other hand, the VBR (variable bit rate) service category with SCD (selective cell discard) option is considered as the service category which is appropriate for wide area networks due to its fairness and minimum guarantee of the cell transmission using not only PCR (peak cell rate) but SCR (sustainable cell rate) and MBS (maximum burst size). However, there is no actual evaluation for such service. We have, therefore, performed the experimental studies on TCP/IP over VBR with SCD service along with UBR and VBR without SCD cases. Through these experiments, we measured the link utilization of the effective data and the fairness between each obtained TCP/IP throughput during congestion of the ATM switch. From the results of the link utilization, the value is always over 90% under the various conditions. Therefore, even in the case of cell losses due to SCD or buffer overflow in ATM switch congestion, the average throughput is almost the same as the value which equals the trunk line speed divided by the number of the accommodated TCP/IP connections. From the results of the fairness, VBR with SCD has almost the same characteristics as UBR and obtains better TCP/IP throughput than VBR without SCD. Finally, we discuss the effectiveness of VBR with SCD and the other service categories, such as UBR and ABR (available bit rate), and conclude that VBR with SCD is one of the most suitable ATM service categories for wide area ATM networks.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose an extension to enable applications that can take full advantage of ATM SVC services. The proposed extension, the adaptive broadband extension (ABE), has the following advantages: (1) systems can appropriately invoke VC establishment taking into account the application requirements recognized at the application layer, e.g., file size and video bit-rate; (2) information providers can upgrade their systems with the proposed extension while preserving connectivity with existing WWW clients; (3) service quality, such as transfer speed and jitter are improved without the need to modify old muitimedia/hypermedia scripts, e.g., HTML. We are now planning to implement ABE-Web systems on a wide ATM SVC network. Security enhancement is another issue to be pursued.
{"title":"Adaptive broadband extension of Web systems","authors":"H. Abe, M. Kawashima","doi":"10.1109/ATM.1999.786892","DOIUrl":"https://doi.org/10.1109/ATM.1999.786892","url":null,"abstract":"We propose an extension to enable applications that can take full advantage of ATM SVC services. The proposed extension, the adaptive broadband extension (ABE), has the following advantages: (1) systems can appropriately invoke VC establishment taking into account the application requirements recognized at the application layer, e.g., file size and video bit-rate; (2) information providers can upgrade their systems with the proposed extension while preserving connectivity with existing WWW clients; (3) service quality, such as transfer speed and jitter are improved without the need to modify old muitimedia/hypermedia scripts, e.g., HTML. We are now planning to implement ABE-Web systems on a wide ATM SVC network. Security enhancement is another issue to be pursued.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123870740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The main focus of this paper is native ATM versus IP over ATM solutions. We investigate the theoretical and experimental comparative performance of native ATM and CLIP. We explicitly quantify loss, throughput at the receiver (inversely proportional to delay) and CPU utilization. The key results of this work are: first, we observe a relatively important loss rate for small packet sizes which gets smaller for larger packets. UDP shows larger loss rate than native ATM. For larger packet sizes loss rate tends to zero. Second, for both UDP and native ATM, throughput at the destination is unstable for packets of small size. It reaches equilibrium for packet sizes on the order of 10k octets. Native ATM has a higher throughput owing to the smaller overhead it presents. Third, for both protocols, the CPU is used more at the receiver. At the transmitter, UDP uses more CPU than native ATM, owing to the overhead it introduces across the layers. Those results are further discussed.
本文的主要焦点是本机ATM与IP over ATM解决方案。我们研究了原生ATM和CLIP的理论和实验性能比较。我们明确量化了损失、接收器上的吞吐量(与延迟成反比)和CPU利用率。这项工作的关键结果是:首先，我们观察到小数据包大小的相对重要的损失率，对于较大的数据包会变小。UDP比本机ATM丢包率高。对于较大的包大小，丢包率趋于零。其次，对于UDP和本机ATM，对于小尺寸的数据包，目的地的吞吐量是不稳定的。它在10k字节量级的数据包大小上达到平衡。本机ATM具有更高的吞吐量，因为它的开销更小。第三，对于这两种协议，CPU更多地用于接收端。在发送端，UDP比本机ATM使用更多的CPU，因为它跨层引入了开销。这些结果将进一步讨论。
{"title":"Native ATM versus IP over ATM: comparative study","authors":"T. Chahed, S. Ben Fredj, C. Fayet","doi":"10.1109/ATM.1999.786777","DOIUrl":"https://doi.org/10.1109/ATM.1999.786777","url":null,"abstract":"The main focus of this paper is native ATM versus IP over ATM solutions. We investigate the theoretical and experimental comparative performance of native ATM and CLIP. We explicitly quantify loss, throughput at the receiver (inversely proportional to delay) and CPU utilization. The key results of this work are: first, we observe a relatively important loss rate for small packet sizes which gets smaller for larger packets. UDP shows larger loss rate than native ATM. For larger packet sizes loss rate tends to zero. Second, for both UDP and native ATM, throughput at the destination is unstable for packets of small size. It reaches equilibrium for packet sizes on the order of 10k octets. Native ATM has a higher throughput owing to the smaller overhead it presents. Third, for both protocols, the CPU is used more at the receiver. At the transmitter, UDP uses more CPU than native ATM, owing to the overhead it introduces across the layers. Those results are further discussed.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124386688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In asynchronous transfer mode (ATM) networks, to avoid congestion situations which decrease the quality of service (QoS) of already established connections, usage parameter control (UPC) is necessary. An ideal UPC mechanism must be able to detect any possible violation from the traffic contract. In this paper we use the benefits of fuzzy logic to design a high performance fuzzy traffic controller. In our proposed fuzzy traffic controller, the actual mean cell rate of the traffic source is estimated and the traffic controller is adjusted so its loss load is equal to the generated excessive load. To improve the channel utilization, the proposed fuzzy traffic controller uses feedback from the network to decide whether to pass, mark or discard the input cells. Simulation results show that the proposed fuzzy traffic controller can outperform the traditional UPC mechanisms. It has been also observed that our proposed fuzzy traffic controller improves the channel utilization and demonstrates a low cell loss probability.
{"title":"A high performance fuzzy traffic controller for ATM networks","authors":"M. Yaghmaee, M. Safavi, M. B. Menhaj","doi":"10.1109/ATM.1999.786885","DOIUrl":"https://doi.org/10.1109/ATM.1999.786885","url":null,"abstract":"In asynchronous transfer mode (ATM) networks, to avoid congestion situations which decrease the quality of service (QoS) of already established connections, usage parameter control (UPC) is necessary. An ideal UPC mechanism must be able to detect any possible violation from the traffic contract. In this paper we use the benefits of fuzzy logic to design a high performance fuzzy traffic controller. In our proposed fuzzy traffic controller, the actual mean cell rate of the traffic source is estimated and the traffic controller is adjusted so its loss load is equal to the generated excessive load. To improve the channel utilization, the proposed fuzzy traffic controller uses feedback from the network to decide whether to pass, mark or discard the input cells. Simulation results show that the proposed fuzzy traffic controller can outperform the traditional UPC mechanisms. It has been also observed that our proposed fuzzy traffic controller improves the channel utilization and demonstrates a low cell loss probability.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The ATM Forum has defined the private network-network interface (PNNI) for routing and signalling in ATM networks. This paper presents a novel graph coloring technique to compute the transition matrix of a PNNI peer group. The transition matrix shows traffic parameters associated with traversing a PNNI peer group between each pair of ingress-egress nodes. This matrix is computed for symmetric restrictive costs (e.g., bandwidth) with a computational complexity of O(eloge), e being the number of edges in the peer group. This algorithm also features very interesting dynamic behavior that allows the transition matrix to be updated without having to rerun the entire algorithm.
{"title":"Transition matrix generation for complex node representation","authors":"I. Iliadis, P. Scotton","doi":"10.1109/ATM.1999.786901","DOIUrl":"https://doi.org/10.1109/ATM.1999.786901","url":null,"abstract":"The ATM Forum has defined the private network-network interface (PNNI) for routing and signalling in ATM networks. This paper presents a novel graph coloring technique to compute the transition matrix of a PNNI peer group. The transition matrix shows traffic parameters associated with traversing a PNNI peer group between each pair of ingress-egress nodes. This matrix is computed for symmetric restrictive costs (e.g., bandwidth) with a computational complexity of O(eloge), e being the number of edges in the peer group. This algorithm also features very interesting dynamic behavior that allows the transition matrix to be updated without having to rerun the entire algorithm.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120985086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：