{"title":"A comparison of regular topologies for all-optical networks","authors":"M. Marsan, A. Bianco, Emilio Leonardi, F. Neri","doi":"10.1109/INFCOM.1993.253251","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253251","url":null,"abstract":"Two regular meshed topologies are compared in terms of their possible use for implementing large all-optical wavelength routing communication networks or interconnection systems. It is assumed that the networks provide full connectivity among users and operate with either packet or circuit switching in a wavelength-division-multiplexing (WDM) environment, so that source-destination pairs are identified through a frequency and a physical path. The topologies considered are the K-dimensional bidirectional square lattice and the shuffle topology. The comparison is based on the maximum and average distance between nodes, and on the minimum number of identifiers (frequencies in the WDM comb) necessary to discriminate all source-destination pairs.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129033460","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}
{"title":"Multicasting in a linear lightwave network","authors":"K. Bala, K. Petropoulos, T. Stern","doi":"10.1109/INFCOM.1993.253399","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253399","url":null,"abstract":"Dynamic routing algorithms are proposed for setting up multicast connections in a linear lightwave network (LLN). The problem of finding a physical path for the multicast connection so as to satisfy all the constraints in the LLN is shown to be NP-complete, and a heuristic approach is presented. An algorithm is presented that decomposes the LLN into edge disjoint trees with at least one spanning tree. A multicast call is allocated a physical path on one of the trees, using the smallest component tree (SCT) or the minimum interference tree (MIT) criterion. Finally, the call is allocated the least used channel from among channels that can be allocated to it. The best performance (low blocking probability) is obtained when the LLN is decomposed into many spanning trees, each of them having a small diameter. It is also found that the selection of trees for each call using the MIT criterion exhibits better performance than with the SCT criterion.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125622682","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}
M. Yamamoto, Toshihito Hirata, C. Ohta, H. Tode, H. Okada, Y. Tezuka
{"title":"Traffic control scheme for interconnection of FDDI networks through ATM network","authors":"M. Yamamoto, Toshihito Hirata, C. Ohta, H. Tode, H. Okada, Y. Tezuka","doi":"10.1109/INFCOM.1993.253335","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253335","url":null,"abstract":"A traffic control scheme for FDDI (fiber distributed data interface) interconnection through an ATM (asynchronous transfer mode) network is presented. The scheme consists of two parts, a VP (virtual path) bandwidth allocation algorithm and a feedback type buffer protection flow control. Both use the acknowledge for the frame of FDDI as a control unit. Simulation results show that VP bandwidth allocated by the scheme increases according to arrival traffic when the destination FDDI has enough capacity and allocated bandwidth is not increased when its capacity is less than arrival traffic. Thus, the scheme has desirable VP bandwidth allocation characteristics. Simulation results also show that the scheme prevents cell loss at a destination gateway completely.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019538","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}
{"title":"A slot interleaved multiple access scheme for DQDB metropolitan area networks","authors":"N. Huang, Shiann-Tsong Sheu","doi":"10.1109/INFCOM.1993.253257","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253257","url":null,"abstract":"A slot interleaved multiple access (SIMA) scheme for distributed-queue dual-bus (DQDB) metropolitan area networks is proposed. In this scheme, all the active nodes will access the slots in an interleaved fashion. This scheme is very efficient for solving the bandwidth domination problem and the priority domination problem, which cannot be solved readily by the DQDB medium access control (MAC) protocol with a bandwidth balancing mechanism. An enhanced SIMA (ESIMA) scheme is proposed to solve the bandwidth allocation problem, which cannot be solved by the DQDB MAC protocol. Simulation results show that SIMA and ESIMA perform much better than the DQDB MAC on throughput as well as the access delay.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122428367","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}
{"title":"A general relationship between buffer occupancy and delay in discrete-time multiserver queueing models, applicable in ATM networks","authors":"B. Steyaert, H. Bruneel, Y. Xiong","doi":"10.1109/INFCOM.1993.253387","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253387","url":null,"abstract":"A multiserver discrete-time buffer system is studied. Packets arrive in the system according to a general correlated process, which is not further specified. The service times of the packets are of constant length. Explicit expressions are derived for the distribution, the probability generating function, and the mean and variance of the packet delay, in terms of the distribution, the probability generating function, and the mean and variance of the buffer contents. It is observed that knowledge of the exact nature of the arrival process is not required to be able to derive these relationships between the statistics of the delay and the occupancy.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131206367","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}
Francesco Masetti-Placci, P. Gavignet, D. Chiaroni, G. D. Loura
{"title":"Fiber delay lines optical buffer for ATM photonic switching applications","authors":"Francesco Masetti-Placci, P. Gavignet, D. Chiaroni, G. D. Loura","doi":"10.1109/INFCOM.1993.253273","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253273","url":null,"abstract":"An optical buffer shift register based on a set of fiber delay lines is presented, with the goal of providing cell storage and queuing in asynchronous transfer mode (ATM) photonic switches. The concept of multiwavelength cell buffering is adopted, to realize a shared buffer with a storage capacity equivalent to a set of shift registers. Since only one wavelength-encoded cell must enter one delay line at each time slot, contention resolution is necessary to determine the queuing order between the incoming cells. The use of optical fibers as delay lines and semiconductor optical amplifiers as gates associated with passive splitters to realize buffering and time-switching has been demonstrated. An experimental setup has been implemented at 600 Mb/s and operates without guard bands between packets. The low penalty observed shows that system synchronization and reliability are good.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116524739","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}
{"title":"Competitive routing in multi-user communication networks","authors":"A. Orda, R. Rom, N. Shimkin","doi":"10.1109/INFCOM.1993.253270","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253270","url":null,"abstract":"A communication network shared by several selfish users is considered. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. The Nash equilibrium of such systems is investigated. For a two-node multiple-link system, the uniqueness of the Nash equilibrium is proved under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, the uniqueness of the Nash equilibrium is established under various assumptions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652324","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}
{"title":"Performance study of Markov modulated fluid flow models with priority traffic","authors":"Ji Zhang","doi":"10.1109/INFCOM.1993.253254","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253254","url":null,"abstract":"The steady-state performance of generic high-speed queuing system with priority traffic is studied, using the Markov modulated fluid models. the focus is on systems with traffic partitioned into two priorities according to a splitting factor alpha , so that low priority traffic can be discarded when congestion occurs. The results are used to further study issues of congestion control with priority traffic. In particular, the expected values, waiting times, variances of the buffer contents, and tail distributions are evaluated. It is found that the waiting time is more sensitive to changes of alpha than the buffer contents. This shows that for time-constrained traffic, the priority assignment is important for properly balancing the tradeoff between packet loss and delays. This model can be considered as a direct extension of the fluid-flow model to include priorities.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115852529","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}
{"title":"A packet-switched WDM passive optical star based metropolitan area network","authors":"A. Ganz, B. Li","doi":"10.1109/INFCOM.1993.253249","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253249","url":null,"abstract":"A cost-efficient metropolitan area network (MAN) based on a two-level structure is introduced. The physical topology of each level is a wavelength-division-multiplexing (WDM) passive star. The system design incorporates both the restrictions imposed by the unique features of the metropolitan environment, such as a relatively large number of nodes and large propagation delays, and the hardware limitations dictated by the WDM technology, such as a limited number of transceivers per node and the unavailability of wide-range rapidly tunable transceivers. A multicontrol channel-based protocol that is particularly suitable for packet switched communications is proposed. An analytical model is presented, and the system performance in terms of throughput and average delay is obtained.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123502339","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}
{"title":"Path allocation in a three-stage broadband switch with intermediate channel grouping","authors":"M. Collier, T. Curran","doi":"10.1109/INFCOM.1993.253274","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253274","url":null,"abstract":"A method for path allocation for use with three-stage ATM switches that feature multiple channels between the switch modules in adjacent stages is described. The method is suited to hardware implementation using parallelism to achieve a very short execution time. This allows path allocation to be performed anew in each time slot. A detailed description of the necessary hardware is presented. This hardware counts the number of cells requesting each output module, allocates a path through the intermediate stage of the switch to each cell, and generates a routing tag for each cell, indicating the path assigned to it.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121608878","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}