{"title":"A new authentication protocol for GSM networks","authors":"K. Al-Tawil, A. Akrami, H. Youssef","doi":"10.1109/LCN.1998.727643","DOIUrl":"https://doi.org/10.1109/LCN.1998.727643","url":null,"abstract":"Mobile communication is one of the fastest growing sectors of the telecommunication industry. Mobile users can make and receive calls while they are moving independent of time, location and network access. The Global System for Mobile communication (GSM) is a pan-European digital cellular mobile system supporting widespread roaming and personal communication services (PCS) in a worldwide wireless communication network. However, wireless mobile systems are more vulnerable to fraudulent access and eavesdropping. Although the authentication process in GSM provides a reasonable security level it overloads the network with significant signaling traffic and increases the call set up time. The signaling load and the authentication delays are of particular importance and are becoming the subject of widespread research interest. We study and analyze the GSM privacy and authentication protocols, and propose a new authentication protocol with less signaling traffic and better call set up time, that can be used in GSM networks.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124956964","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":"New approach of resource management to provide integrated services over ATM networks","authors":"T. Yokotani, K. Murakami, T. Ichihashi, S. Tonami","doi":"10.1109/LCN.1998.727653","DOIUrl":"https://doi.org/10.1109/LCN.1998.727653","url":null,"abstract":"The cooperative action between RSVP and some protocols performed on ATM networks, is one of problems that should be solved to provide integrated services over ATM networks discussed in IETF. In this paper, after describing some schemes that map RSVP into these protocols to reserve resources over ATM networks, we compare these schemes and point out some problems therein. Next, we propose a new approach referred to as \"the direct lookup approach\" to improve these schemes. The new approach removes overhead by the mapping between RSVP and protocols performed on ATM networks, and control messages of RSVP on ATM networks are directly examined. Finally, we discuss some issues for the implementation of this new approach.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128850770","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 quality-of-service routing in high-speed networks based on selective probing","authors":"Shigang Chen, K. Nahrstedt","doi":"10.1109/LCN.1998.727649","DOIUrl":"https://doi.org/10.1109/LCN.1998.727649","url":null,"abstract":"We propose an integrated QoS routing framework based on selective probing for high-speed packet-switching networks. The framework is fully distributed and depends only on the local state maintained at every individual node. By using controlled diffusion computations, the framework captures the common messaging and computational structure of distributed QoS routing, and allows an efficient implementation due to its simplicity. Different distributed routing algorithms (DRAs) can be quickly developed by specifying only a few well-defined constraint-dependent parameters within the framework. Our simulation shows that the overhead of the proposed algorithms is stable and modest.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448343","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":"Effect of hidden terminals on the performance of IEEE 802.11 MAC protocol","authors":"S. Khurana, Anurag Kahol, A. Jayasumana","doi":"10.1109/LCN.1998.727642","DOIUrl":"https://doi.org/10.1109/LCN.1998.727642","url":null,"abstract":"The hidden terminal problem is unique to wireless networks and as of now there is very limited understanding about its effects on network performance. Results are presented from a simulation study of the IEEE 802.11 MAC protocol when operating in the presence of hidden terminals. We also propose a framework for modeling hidden terminals which can handle complex scenarios of both mobility and static obstructions. Our simulations indicate that hidden terminals can have a very detrimental effect on the performance of the IEEE 802. 11 MAC protocol. Although the throughput is acceptable when about 10 percent of station pairs are hidden, the packet delay can increase by an order of magnitude. The performance of the protocol drops sharply when the number of hidden pairs exceeds 10 percent.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125401405","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 scheme of credit based payment for electronic commerce","authors":"Y. Mu, V. Varadharajan","doi":"10.1109/LCN.1998.727668","DOIUrl":"https://doi.org/10.1109/LCN.1998.727668","url":null,"abstract":"The paper describes a new credit card system, which presents a promise for us to develop a new method of protecting secret information, such as credit card number, PIN and identification. Our credit cards are anonymous. That is, the identity of a card holder and credit card information are not revealed during a payment process. One important feature of our system lies in the fact that, unlike normal electronic credit based systems such as SET, iKP and NetCard, the involvement of the online financial institution that runs the payment system is reduced to a minimum.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126123131","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}
N. Oguchi, Y.-M. Chen, J. Ogawa, T. Tsuruoka, Tomohiko Taniguchi, S. Nojima
{"title":"RISP: address resolution protocol in network layer","authors":"N. Oguchi, Y.-M. Chen, J. Ogawa, T. Tsuruoka, Tomohiko Taniguchi, S. Nojima","doi":"10.1109/LCN.1998.727651","DOIUrl":"https://doi.org/10.1109/LCN.1998.727651","url":null,"abstract":"Conventionally, the network layer (such as IP) to link layer (such as Ethernet and ATM) address translation is done in the link layer. This approach requires link technology-specific solutions such as ARP for Ethernet, and ATMARP or NHRP for ATM. By moving the address resolution function from link layer to network layer, this paper proposes a unified address resolution scheme applicable to current and future network technologies. For NBMA (non-broadcast multi-access) networks, this scheme achieves better implementation efficiency because the conventional scheme would require extra table lookups when the link layer has to consult with network-layer routing function to forward a request that cannot be resolved locally.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129313257","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":"High performance integrated network communications architecture (INCA)","authors":"K. Schug, A. Jayasumana, P. Gopalakrishnan","doi":"10.1109/LCN.1998.727658","DOIUrl":"https://doi.org/10.1109/LCN.1998.727658","url":null,"abstract":"Current communication subsystem mechanisms within workstation and PC class computers are limiting network communication throughput to a percentage of the present network data rates. Though CPU and computer network speeds increased by more than an order of magnitude, the execution rate of computer functions and applications requiring network communications have increased only marginally. An integrated network communications architecture (INCA) is presented that is interoperable with all existing programs, computers and networks, and scales with network and CPU speeds. The INCA architecture minimizes internal system limitations and provides application level, as opposed to network interface level, internal machine data throughput rates near those of high speed network transmission rates. Test results of a software implementation of the INCA architecture on actual systems and networks are presented that show a 260% to 760% improvement in the application level throughput of network communicated data of workstation and PC class computers.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130232733","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":"Source model for VBR coded video traffic in ATM networks","authors":"G. Sisodia, M. Hedley, S. De, L. Guan","doi":"10.1109/LCN.1998.727661","DOIUrl":"https://doi.org/10.1109/LCN.1998.727661","url":null,"abstract":"We present a new approach to modelling variable bit rate (VBR) coded video sources in asynchronous transfer mode (ATM) networks. Unlike the existing methods which model the number of cells generated by the coder for a sequence of video frames, the new approach improves the modelling accuracy by considering the characteristics of different cells generated by the coder, and modelling the number of cells in each type of macroblocks of a frame separately. The model is tested by comparing the autocorrelation function and mean queue size in the buffer by simulation of an ATM switch to the mean queue size produced when traces generated by the model are used as the source. Comparisons with the existing models are performed in the area of measuring the quality of their predictions for the network performance and the grade of service experienced by a user.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134343753","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":"New protocols for hard real-time communication in the switched LAN environment","authors":"S. Norden, G. Manimaran, C. Murthy","doi":"10.1109/LCN.1998.727677","DOIUrl":"https://doi.org/10.1109/LCN.1998.727677","url":null,"abstract":"The problem of real-time communication over a multiple access network has been well studied in the past. But, there has been no prior work addressing real-time communication over a switched local area network (SLAN), where several LAN segments are connected through a switch. In this paper we propose real-time protocols for the SLAN. The proposed protocols are based on CSMA/CD with deterministic collision resolution and belong to the dynamic planning based category, where an admission test is performed for guaranteeing message transmission. This test is based on the worst case channel access time that can elapse before a particular node can transmit its message. We also compute the worst case buffer requirement at the switch. We study the effectiveness of the proposed protocoIs through extensive simulation studies.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131742416","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":"Adaptive sampling methods to determine network traffic statistics including the Hurst parameter","authors":"J. Drobisz, Kenneth J. Christensen","doi":"10.1109/LCN.1998.727664","DOIUrl":"https://doi.org/10.1109/LCN.1998.727664","url":null,"abstract":"Accurate traffic characterization by a packet source is needed to predict the network behavior and to properly allocate network resources to achieve a desired quality of service for all network users. As networks have become faster, the processing load required for complete packet sampling has also grown. In some cases, for example Gigabit Ethernet, the network can deliver packets faster than a network management subsystem can process them. In order to prevent inaccurate traffic statistics due to \"clipping\" of traffic peaks, Claffy et al. (1993) applied several static sampling strategies to network traffic characterization. As shown in this paper, static sampling may produce inaccurate traffic statistics. Adaptive sampling methods are developed and evaluated to address the inaccuracies of static sampling. In addition, the estimation of the Hurst parameter, a measure of traffic self-similarity, is studied for static and adaptive sampling. It is shown that adaptive sampling results in a more accurate estimation of the mean, variance, and Hurst parameter for packet counts.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126849701","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}