Sijing Zhang, T. Cheng, K. R. Subramanian, Liren Zhang, Chee Heng Tan
{"title":"Testing the feasibility of synchronous bandwidth allocation for time-critical communication in FDDI networks","authors":"Sijing Zhang, T. Cheng, K. R. Subramanian, Liren Zhang, Chee Heng Tan","doi":"10.1109/ICCCN.1997.623331","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623331","url":null,"abstract":"One of the key issues related to deadline guarantees of synchronous messages in FDDI networks is the feasibility test of synchronous bandwidth allocation (SBA). Much work has been done on how to allocate synchronous bandwidth properly in order to guarantee synchronous messages transmission before their deadlines, and as a result quite a few SBA schemes have been proposed. In contrast, limited research has been done on how to effectively test the feasibility of a given allocation of synchronous bandwidths (i.e., whether or not a given allocation can guarantee the synchronous message set considered), and the existing approach cannot always give an effective test and may even produce wrong testing results. This paper presents an algorithm of polynomial time worst-case complexity which ensures the correctness and effectiveness of the testing for any given synchronous message set with message deadlines equal to periods.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115294959","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":"NetRAP-a network resource allocation protocol for IP over Ethernet","authors":"M. Gitsels, H. Eberle, Christian Kleitsch","doi":"10.1109/ICCCN.1997.623348","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623348","url":null,"abstract":"For more than a decade, IP over the Ethernet has been the dominating local area network technology because it is cost-efficient, simple and reliable. Unfortunately, it does not support the transport of continuous data as generated by multimedia applications. The large number of IP installations makes it necessary to find ways to provide support for multimedia applications in existing network environments without making interfaces used by existing applications incompatible. In this paper, we present the design, implementation and evaluation of the network resource allocation protocol NetRAP. NetRAP extends IP in that it allows applications to allocate bandwidth. Access to the network happens in two phases. In the first phase, a token-based access protocol is used to give applications with bandwidth reservations access to the network. In the second phase, the network is operated in normal CSMA/CD mode giving all other applications without bandwidth reservations the opportunity to access the network. For this purpose, we have extended an existing IP stack with a transport protocol able to control access times. Our performance measurements show that NetRAP adds little overhead. Since the implementation of NetRAP only requires few modifications of existing protocol software and, moreover, does not invalidate existing networked applications, it offers a simple and cost-efficient alternative to other more complex solutions.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130732242","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}
C. Chao, T. Katura, M. Kisimoto, T. Ueda, T. Matukawa, H. Okada
{"title":"Network connectivity of layered self-organizing wireless networks","authors":"C. Chao, T. Katura, M. Kisimoto, T. Ueda, T. Matukawa, H. Okada","doi":"10.1109/ICCCN.1997.623323","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623323","url":null,"abstract":"This paper proposes a new organizing method for packet radio networks: layered self-organizing method. In the layered self-organizing network, a whole service area is divided into multiple sub-service areas and one base station is settled in each sub-service area. Base stations are connected to the backbone network, a high-speed wired network. A base station covering area is tuned to be less than a sub-service area. Mobile stations that stay in the outside area of a base station covering area are connected with one of the near base stations through several repeating mobile stations in a self-organized fashion. So a layered self-organizing wireless network can cover a wide area with fewer base stations than the conventional cellular networks. This paper evaluates the network connectivity by computer simulation and shows the effectiveness of the method. Furthermore, the paper presents an additional power-control protocol to obtain almost complete connectivity in the whole network.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131373497","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":"Admission control for wireless networks with heterogeneous traffic using event based resource estimation","authors":"J. Misic, S. Chanson, F. S. Lai","doi":"10.1109/ICCCN.1997.623322","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623322","url":null,"abstract":"In this paper a new distributed adaptive admission control algorithm for wireless cellular networks with heterogeneous traffic is proposed. The resources needed for handoff calls are estimated by calculating the probability of visiting particular cells during the call lifetime based on the call duration and residence time statistics. This information is then communicated to the base stations in the S surrounding rings. The amount of reserved resources is updated at handoffs and call termination which involves simple arithmetic operations only. The admission algorithm also maintains the tuning parameters by which hard constraints on handoff dropping probabilities can be met. We have also derived the QoS bounds for homogeneous traffic.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125616152","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":"An improved topology discovery algorithm for networks with wormhole routing and directed links","authors":"Yingxin Huang, M. Molle","doi":"10.1109/ICCCN.1997.623297","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623297","url":null,"abstract":"We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was developed for the ATOMIC high speed local area network to avoid the need for manually updating routing tables. Similar needs may arise in wireless networks where channels may be unidirectional because of limited transmission power, multipath, and similar effects. Like the ATOMIC topology discovery algorithm, our algorithm accumulates a map of the network at a distinguished node called the address consultant. However, our algorithm is much faster. In addition, our algorithm is more general, because it can correctly resolve topologies that contain multiply connected nodes. We implemented both algorithms in a concurrent simulation environment, and tested them on a variety of topologies.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783141","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":"Scheduling support for multicasting sessions in broadband communication networks","authors":"Khalid H. Sheta, M. Singhal","doi":"10.1109/ICCCN.1997.623310","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623310","url":null,"abstract":"Multimedia applications require support from the underlying broadband network at the end-to-end communication level. Multicasting is an important paradigm of end-to-end communication. The root node of a multicasting session is responsible for controlling the session including monitoring, maintenance, and the implementation of the multicasting protocol. The job that controls the multicasting session executes as a group of tasks at the root node of a multicasting tree. The scheduling scheme at the root node should give support to a multicasting session by improving the completion time of the jobs controlling the multicasting session, hence increasing throughput and the probability of admitting new multicast sessions. We model the tasks that carry out the multicasting session monitoring and maintenance as a fork-join job executing on a multiprocessor system. We assume that an executing task blocks for device I/O as a part of the activities associated with sending and receiving data packets. We develop two analytic models for scheduling a session control job on a multiprocessor system. The first allows incoming job tasks to multiplex processors with existing tasks of another multicasting session; the other model schedules a task of the incoming job to an idle processor. We assume that the overhead of rescheduling a task to another processor is large. We compare the performance of both models and show the range of conditions under which a model outperforms the other. The results can be used in the design of an adaptive scheduler that uses both models to improve throughput and the probability of admitting new multicast sessions.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125262796","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":"Archiving agents for the World Wide Web","authors":"C. Braendli, H. Rudin","doi":"10.1109/ICCCN.1997.623346","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623346","url":null,"abstract":"The information available on the World Wide Web changes with incredible speed. New information is added and old information is altered. This means that a document which is important to a user accessing the Web may change, move or even disappear altogether. Described here is an autonomous agent, written in Java, which locally archives documents that are deemed important by the user. These locally archived documents are then available-quickly-when needed.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114860715","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 scalable computing for real-time applications","authors":"T. Boggess, F. Shirley","doi":"10.1109/ICCCN.1997.623332","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623332","url":null,"abstract":"Sanders is integrating emerging interconnect technologies with other high-performance computing technologies to meet the demanding requirements of future, real-time, embedded military applications. Myrinet, a switched network, is used to connect heterogeneous computer nodes in a low-latency, high-throughput system area network (SAN). Myrinet includes a standardized intelligent node-to-network interface, called a LANai, which isolates each node from the network. Types of nodes under development include digital signal processor (DSP), reduced instruction set computing (RISC), and reconfigurable computing (RC). Modeling and simulation of the computing system are performed within the Ptolemy environment. High density interconnect (HDI) packaging reduces size, weight and power (SWAP), a requirement especially important for avionics applications. PacketWay, an Internet Engineering Task Force (IETF) proposed standard, provides a high-performance interface between heterogeneous SANs, and includes an option for high speed inter-SAN encryption. A prototype high-performance scalable computer is being built at Sanders with this set of technologies, to meet the requirements of several future military programs.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116779917","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 low cost searching device for an ATM adapter","authors":"R. Glaise, J. Munier","doi":"10.1109/ICCCN.1997.623356","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623356","url":null,"abstract":"A key function of an ATM adapter is its ability to sort the incoming traffic from the VPi/VCi field of the cell headers. This has to be done at media speed and requires a hardware assist to keep up with the high speed lines over which ATM cells are transported. Although the device of choice to perform a search is a content addressable memory (CAM) such devices are seldom used, especially in the cost sensitive part of the market, because they require a large die size to be built and are too expensive. However, numerous methods have been devised just using regular R/W RAMs. The most efficient, based on various tree structures, tend to be difficult to manage when updating is considered (especially deletions). Hashing, because of its simplicity, is often preferred. Although \"no hash function is perfect\" some are better adapted in a particular situation. The paper describes a hash device which makes use of the HEC header field as the hash function, requires a modest RAM space and is able to sort cell traffic at the ingress of an ATM adapter with predictable performance.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115398149","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 framework for secure network management","authors":"Farid G. Hatefi, F. Golshani","doi":"10.1109/ICCCN.1997.623360","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623360","url":null,"abstract":"We introduce a new protocol, SNMS (secure network management system) with four primary goals. First, it uses encryption to establish a secure channel between a network manager and a network agent. Second, it allows network management tasks to be performed from any station on the network. Third, it enables a manager to remotely add manageable objects to an agent. Finally, it makes a prototype along with a set of guidelines to make the transition from SNMP (simple network management protocol) to SNMS. The SNMS combines features from HTTP (hyper text transfer protocol), SSL (secure socket layer) security mechanism, and CGI (common gateway interface) programming techniques, and deals with the entire Web client/server paradigm. Network managers can securely monitor and control the network elements from any station on the network. Compared with SNMP, which does not provide any safety measures for exchanging information between a manager and an agent, the SNMS offers a high degree of security by encrypting all the traffic between the manager and an agent. The SNMS applies public key and private key encryption and decryption with a mixture of digital signature and two way authentication.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121074337","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}