{"title":"Dial-in virtual private networks using layer 3 tunneling","authors":"G. Malkin","doi":"10.1109/LCN.1997.631026","DOIUrl":"https://doi.org/10.1109/LCN.1997.631026","url":null,"abstract":"Corporate networks are making increasing use of the Internet to connect geographically diverse site networks rather than developing their own \"leased line\" WAN networks. Similarly, they are outsourcing their dial-in capability by replacing their banks of modems with a single connection to a service provider with geographically diverse Points Of Presence (POPs). In this way, users in a corporate network can dial local (or toll free) numbers which will be routed to the nearest POP; then, be connected to their corporate network using some form of tunneling. There are two common forms of tunneling in use in the Internet today: Layer 2 (using L2TP, for example) and Layer 3 (using Mobile IP, for example). The paper presents a design for a Layer 3 Dial-in Virtual Private Network Service (DVS), based on Mobile IP. This design has been implemented by Bay Networks.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127484958","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":"Early selective packet discard for alternating resource access of TCP over ATM-UBR","authors":"K. Cheon, S. Panwar","doi":"10.1109/LCN.1997.631000","DOIUrl":"https://doi.org/10.1109/LCN.1997.631000","url":null,"abstract":"We investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the effective throughput of two existing schemes, Partial Packet Discard (PPD) and Early Packet Discard (EPD), as compared to the Random Cell Discard (RCD) scheme which discards any incoming cells after buffer overflow. We observed that PPD alleviates the effect of packet fragmentation so that it gets effective throughput enhancement over RCD, and EPD provides further enhancement over PPD. After closer investigation, we found that there is a sustained congestion problem other than packet fragmentation that causes the effective throughput to be degraded. We noted that sustained congestion resulted in the synchronization of TCP window expansion and shrinkage. To provide a solution for this problem, we propose the Early Selective Packet Discard (ESPD) policy, a strategy which makes sessions take turns in accessing network capacity by discarding packets from selected sessions rather than randomly. Our results shows that ESPD achieves throughput and fairness enhancement over EPD with only a modest increase in implementation complexity.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128280310","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":"Distributed shared memory layer for cooperative work applications","authors":"H. Guyennet, J. Lapayre, M. Tréhel","doi":"10.1109/LCN.1997.630906","DOIUrl":"https://doi.org/10.1109/LCN.1997.630906","url":null,"abstract":"To create cooperative work applications quickly and efficiently, we have developed a cooperative platform called CAliF: Cooperative Application Framework. This system was defined with four layers. We propose a new consistency protocol for the distributed shared memory (DSM) layer where different shared objects are replicated at each site. CAliF uses the DSM to allow programmers to share objects or variables without having to manage the exchange. We present an algorithm which uses the token technique. The token is a data structure which contains the updates of shared data. These data are carried through the ring on the token, named Pilgrim. The Pilgrim protocol provides both reliable consistency and guaranteed performance according to the type of application described. The protocol is discussed and proved, and we demonstrate its qualities.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114996911","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}
James Hall, R. Sabatino, S. Crosby, I. Leslie, Richard Black
{"title":"Counting the cycles: a comparative study of NFS performance over high speed networks","authors":"James Hall, R. Sabatino, S. Crosby, I. Leslie, Richard Black","doi":"10.1109/LCN.1997.630894","DOIUrl":"https://doi.org/10.1109/LCN.1997.630894","url":null,"abstract":"In the management of a modern LAN or campus network, two issues are of key importance, namely network performance and capacity planning. In this paper we report on results from an experimental programme which aims to quantify the performance that can be achieved with a real distributed application running over a range of different network technologies, including Ethernet, ATM, FDDI, and a 100 Mb/s packet-switched LAN. In particular we analyse the contribution of each of the various application and network components to the overall performance experienced by applications. This information will facilitate planning and management of new networks, and permit the identification of \"hidden costs\" which prevent currently deployed applications from fully exploiting high bandwidth networks.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334184","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}
H. Shigeno, Yoshihiro Fujimaki, Hiro Ohmori, Ken-ichi Okada, Y. Matsushita
{"title":"MC/sup 2/ platform for mobile and wireless computing","authors":"H. Shigeno, Yoshihiro Fujimaki, Hiro Ohmori, Ken-ichi Okada, Y. Matsushita","doi":"10.1109/LCN.1997.630993","DOIUrl":"https://doi.org/10.1109/LCN.1997.630993","url":null,"abstract":"Portable computers can be connected to a network by wireless communication while the user is moving. Users can enjoy this capability and use services on a computer network in any place and at any time. This new style of computer usage is called \"mobile computing\". In a mobile computing environment there are some problems which are caused by using wireless interfaces, such as disconnection and inability to connect to the network. Moreover, it is likely that most users operate not only with their portable computers but also with other computers in their office, home and so on. The authors discuss the agent platform which considers these features of mobile computing. This platform is designed in order to cover the shortages of wireless communication, and to provide a platform for agents that support user mobility.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115846337","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 new explicit rate-based congestion control scheme for ABR services","authors":"Ki-tin. Ma, R. Sankar, Kenneth J. Christensen","doi":"10.1109/LCN.1997.630988","DOIUrl":"https://doi.org/10.1109/LCN.1997.630988","url":null,"abstract":"The ATM Forum has adopted the rate-based scheme as the standard for ABR services. Effective ABR services are essential for ATM LAN emulation. The authors propose a new algorithm or scheme that has equivalent or better performance than existing schemes, but requires only O(1) computation. This O(1) computation is independent of both the number and rates of the connections. The scheme, called the \"USF scheme\", is compared via simulation to the existing EPRCA, MIT, and OSU schemes. Results show that the less complex USF scheme provides better throughput, delay, and fairness than the existing schemes.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122790678","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":"Reliability analysis of partitioned optical passive stars networks","authors":"Feng Cao","doi":"10.1109/LCN.1997.631016","DOIUrl":"https://doi.org/10.1109/LCN.1997.631016","url":null,"abstract":"The author studies reliability in the all-optical partitioned passive stars (POPS) topology. POPS is a physical architecture to scale the traditional optical passive star couplers and explore the advantages of high noise immunity and single-hop. The reliability and fault tolerance in POPS rely on its connectivity. The author analyzes the worst case for network partitions due to either node failures or link errors. For node connectivity, the author shows that the whole system remains connectivity no matter how many nodes don't work. For link connectivity, the author analyzed some worst cases due to link errors and the lower bound for connectivity is demonstrated. Some sufficient approaches are proposed to detect and keep connectivity of the whole system.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131470601","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":"Design and implementation of a bridge between CORBA and DCE","authors":"Dong-Jin Kim, Han Namgoong, Y. Lew","doi":"10.1109/LCN.1997.630904","DOIUrl":"https://doi.org/10.1109/LCN.1997.630904","url":null,"abstract":"This paper considers a bridge which can be used for the communication between the Common Object Request Broker Architecture (CORBA) and the Distributed Computing Environment (DCE). A bridge can overcome the heterogeneity of different distributed middleware platforms. The key point in creating bridges is the design and implementation of the mapping function and interface definition language (IDL) translation, enabling communication between them. The main work addressed in this paper involves the design and implementation of a couple of technologies: the IDL translation tool which translates an existing DCE interface definition into an equivalent CORBA interface definition; and a bridge code generation tool which automatically generates a CORBA-to-DCE bridge, based on a DCE interface definition.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132530116","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 of integrated telephony service over standalone LAN and ATM internetworked LANs","authors":"V. Mirchandani, D. Everitt","doi":"10.1109/LCN.1997.630907","DOIUrl":"https://doi.org/10.1109/LCN.1997.630907","url":null,"abstract":"A substantial demand exists in enterprise networks for obtaining an interLAN telephony service integrated with asynchronous data services. We determine the end-to-end performance of a standalone IEEE 802.5 LAN and ATM internetworked 802.5 LANs by using a simulation based approach and compare their performance. Both the standalone IEEE 802.5 LAN and ATM internetworked 802.5 LANs offer a telephony service integrated with an asynchronous data service. The provision of an interLAN telephony service integrated with asynchronous data services entails the implementation of a novel method in the interworking units so as to segregate the voice data from the asynchronous data. The end subnetworks considered in the case of internetworked integrated services heterogenous ATM LANs are IEEE 802.5 and the recently standardised 802.9a (isoEthernet) LANs. A key issue addressed in this case is the internetworking of the packet based IEEE 802.5 LAN to the 802.9a LAN.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132136250","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 dynamic routing procedure for connections with quality of service requirements","authors":"M. Nour, A. Hafid, M. Gendreau","doi":"10.1109/LCN.1997.631015","DOIUrl":"https://doi.org/10.1109/LCN.1997.631015","url":null,"abstract":"Emerging high-speed networks will support a number of real-time services required by distributed multimedia applications, such as video-on-demand. To support these services, appropriate routing procedures should be used; upon receipt of a request to open a new connection with certain quality of service (QoS) requirements, an appropriate routing procedure calculates an \"optimal\" route (with respect to a certain cost function) which satisfies the connection requirements. Most existing routing procedures for real-time connections determine routes which satisfy only a subset of QoS requirements and optimize in terms of QoS information (e.g. a route with the smallest end-to-end delay). The authors present a routing procedure which finds a route, if it does exist, which satisfies the whole set of QoS requirements; the route could be optimal in terms of QoS information, money to pay for the utilization of network resources, or network reliability; it is up to the network operator to select the optimization criteria to be used by the routing procedure. They also describe how the proposed routing procedure can be used in ATM environment.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123326364","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}