@INPROCEEDINGS{Gay01:Real, AUTHOR="Mark Gaynor and Scott Bradner", TITLE="The Real Options Approach to Standardization", BOOKTITLE="Hawaii International Conference on Systems Sciences", INSTITUTION="Harvard University", ADDRESS="Hawaii", YEAR=2001, REFERENCES=27, KEYWORDS="standardization", ABSTRACT="In this paper, we propose a new model of technology standardization under market uncertainty and show how its value is quantifiable using the theory of real options. Our options-based approach to standardization shows that a rational way to standardize some IT technology in uncertain markets is with correct structure and proper staging of the standard. First, highly modularized standards provide a higher option value because of the ability to pick and choose the best modules to change at a fine granularity. Secondly, a modular structure that promotes easy and non-disruptive parallel experimentation (such as end-2-end applications) enhances the option value by providing a larger field of options from which to select. Lastly, allowing the standard to evolve along with the customers' expectations of the technology is a good strategy to match standards with uncertain user markets.", URL="http://www.eecs.harvard.edu/~gaynor/ITS-copyright.pdf", } @BOOK{Sun01:Compressed, TITLE="Compressed Video over Networks", EDITOR="Ming-Ting Sun and Amy Reibman", ISBN="0-8247-9423-0", PUBLISHER="Marcel Dekker", ADDRESS="New York", YEAR=2001, KEYWORDS="packet video; Internet", } @INCOLLECTION{Schu01:IP, AUTHOR="Henning Schulzrinne", TITLE="{IP} Networks", BOOKTITLE="Compressed Video Over Networks", EDITOR="Amy Reibman and Ming-Ting Sun", ISBN="0-8247-9423-0", PUBLISHER="Marcel Dekker", YEAR=2001, KEYWORDS="IPv4; RSVP; video measurements; SIP; RTP", } @BOOK{Proc01:Practical, AUTHOR="Paul E. Proctor", TITLE="The Practical Intrusion Detection Handbook", ISBN="0-13-025960-8", PUBLISHER="Prentice Hall", ADDRESS="Upper Saddle River, New Jersey", YEAR=2001, KEYWORDS="security; intrusion detection", } @BOOK{John01:SIP, AUTHOR="Alan Johnston", TITLE="{SIP:} Understanding the Session Initiation Protocol", ISBN=1580531687, PUBLISHER="Artech House", YEAR=2001, KEYWORDS="SIP; Internet telephony", } @MISC{Gemm01:Gaze, AUTHOR="Jim Gemmell", TITLE="Gaze-corrected video conferencing", YEAR=2001, KEYWORDS="video conferencing", ABSTRACT="Corrects for gaze via image manipulation (eye cutout, head translation).", URL="http://research.microsoft.com/barc/telepresence/GazeMaster.htm", } @TECHREPORT{Cisc01:IP, AUTHOR="{Cisco Systems}", TITLE="{IP} Telephony Solutions Guide", INSTITUTION="Cisco", YEAR=2001, KEYWORDS="Internet telephony; dimensioning", ABSTRACT="Describes traffic and other issues for implementing IP telephony.", URL="http://www.cisco.com/warp/public/788/solution\_guide/", } @TECHREPORT{Inte01:ProShare, AUTHOR="Intel", TITLE="ProShare® Video Traffic -- A Traffic Engineering Model for {LAN} Video Conferencing", INSTITUTION="Intel", YEAR=2001, KEYWORDS="Traffic engineering; video conferencing; load factor", URL="http://support.intel.com/support/proshare/8150.htm", } @TECHREPORT{Wire01:Position, AUTHOR="Wireless Campus Networking Working Group", TITLE="Position Paper on {WLAN} Radio Frequency Interference Issues", TYPE="Position Paper", INSTITUTION="net-at-edu", YEAR=2001, KEYWORDS="Wireless networks; wireless Ethernet", ABSTRACT="The purpose of this position paper is to inform campus decision makers about a critical issue associated with operating IEEE 802.11b wireless networks (WLANs). It is not intended to encourage nor discourage deployment of wireless networks but rather to educate interested parties on the issue of radio frequency (RF) congestion and interference problems when operating spread spectrum wireless systems.", URL="http://www.educause.edu/ir/library/pdf/NET0014.pdf", } @BOOK{Hanz01:Voice, AUTHOR="Lajos Hanzo and F. C.A. Somerville and J. P. Woodard", TITLE="Voice Compression and Communications: Principles and Applications for Fixed and Wireless Channels", PUBLISHER="Wiley", YEAR=2001, KEYWORDS="speech coding; mobile telephony; telephony; packet audio; MOS", URL="http://www-mobile.ecs.soton.ac.uk/books/", } @TECHREPORT{3GPP01:Performance, AUTHOR="3GPP", TITLE="Performance Characterization of the {AMR} Speech Codec", TYPE="Technical Specification", INSTITUTION="3GPP", NUMBER="TR 26.975 V3.0.0 (20", YEAR=2001, KEYWORDS="AMR; packet speech; voice coding; MOS", ABSTRACT="This technical report provides background information on the performances of the Adaptive Multi-Rate (AMR) speech codec. Experimental test results from the Verification and Characterization phases of testing are reported to illustrate the behavior of AMR in multiple operational conditions.", URL="http://www.quintillion.co.jp/3GPP/Specs/26975-300.pdf", } @TECHREPORT{Cao01:Internet, AUTHOR="Jin Cao and William Cleveland and Dong Lin and Don Sun", TITLE="{Internet} Traffic Tends To Poisson and Independent as the Load Increases", TYPE="Bell Labs Tech Report", INSTITUTION="Bell Labs", ADDRESS="Murray Hill, New Jersey", YEAR=2001, KEYWORDS="traffic characterization; Poisson model; Internet traffic", ABSTRACT="The burstiness of Internet traffic was established in pioneering work in the early 1990s, which demonstrated that packet arrival times are not Poisson, and packet and byte counts in fixed-length intervals are long-range dependent. Here we demonstrate that these results are one end of a continuum of traffic characteristics. At the other end are Poisson behavior and independence. Our study focuses on packets, what devices actually see; we study the statistical properties of packet inter-arrival times and packet sizes. As the traffic load increases --- that is, as the number of simultaneous transport connections increases --- arrivals tend to Poisson and sizes tend to independence. More specifically, long-range dependence of inter-arrivals and sizes decreases to independence, and the marginal distribution of inter-arrivals tends toward exponential; this happens (1) through time on a single link as the load increases due to daily variation, or (2) at a single point in time as the load increases going from lightly loaded links at the edges of the Internet to heavily loaded links at the core. Convergence is rapid; the packet traffic gets quite close to Poisson and independent loads far less than the maximum we observe.", URL="http://cm.bell-labs.com/stat/doc/ip.poissonindependent.pdf", } @TECHREPORT{Cao01:Scalable, AUTHOR="Jin Cao and D. H. Davis and Scott Vander Wiel and Bin Yu and Zhengyuan Zhu", TITLE="A Scalable Method for Estimating Network Traffic Matrices from Link Counts", TYPE="Bell Labs Tech Report", INSTITUTION="Bell Labs", ADDRESS="Murray Hill, New Jersey", YEAR=2001, KEYWORDS="traffic matrix; traffic characterization", ABSTRACT="Traffic matrices are extremely useful for network configuration, management, engineering, and pricing. Direct measurement is, however, expensive in general and impossible in some cases. This paper proposes a scalable algorithm for statistically estimating a traffic matrix from the readily available link counts. It relies on a divide-and-conquer strategy to lower the computational cost without losing estimation accuracy. The proposed algorithm is tested on a real network with 18 nodes. The estimates are comparable to the direct estimates but require dramatically less computation.", URL="http://cm.bell-labs.com/stat/doc/trafficmatrix.ps", } @ARTICLE{Schw0101:Engineering, AUTHOR="Daniel Schwabe and Luiselena Esmeraldo and Gustavo Hector Rossi and Fernando Lyardet", TITLE="Engineering Web Applications for Reuse", JOURNAL=ieeemm, VOLUME=8, NUMBER=1, MONTH="January--March", YEAR=2001, ABSTRACT="Web design frameworks combine generic conceptual, navigational, and context schemas. Such frameworks offer developers a conceptual approach to maximize design reuse, rather than code reuse, in Web applications. The authors apply the object-oriented hypermedia design extension, OOHDM-Frame, to determine key architectural components and design structures that lend themselves to reuse.", URL="http://www.computer.org/multimedia/mu2001/u1toc.htm", } @ARTICLE{Goes0101:Client, AUTHOR="Karl M. Goeschka and Markus W. Schranz", TITLE="Client and Legacy Integration in Object-Oriented Web Engineering", JOURNAL=ieeemm, VOLUME=8, NUMBER=1, MONTH="January--March", YEAR=2001, ABSTRACT="To be successful, e-commerce and Web information systems depend on systematic analysis and design processes. Even more important, the authors' method is based on standard techniques like UML, XML, and Corba and allows for the integration of different kinds of clients from Java over HTML to WAP into a distributed environment. Through the smooth integration of highly heterogeneous legacy software and databases, the authors' object-oriented Web design provides techniques to achieve this goal.", URL="http://www.computer.org/multimedia/mu2001/u1toc.htm", } @ARTICLE{Lara01:Constructing, AUTHOR="Juan de Lara and Manuel Alfonseca", TITLE="Constructing Simulation-Based Web Documents", JOURNAL=ieeemm, VOLUME=8, NUMBER=1, MONTH="January--March", YEAR=2001, ABSTRACT="The authors present a system for constructing Web documents that features visual interactive simulations and other hypermedia elements. It uses a continuous simulation language composed of abstraction layers that describe the simulation models' behavior, pages or slides, and courses, articles, or presentations. The methods and tools presented stress key points in the development of Web-based applications such as maintainability, reusability integration, and easy testing.", URL="http://www.computer.org/multimedia/mu2001/u1toc.htm", } @ARTICLE{Kird0101:Experiences, AUTHOR="Engin Kirda and Mehdi Jazayeri and Clemens Kerer and Markus W. Schranz", TITLE="Experiences in Engineering Flexible Web Services", JOURNAL=ieeemm, VOLUME=8, NUMBER=1, MONTH="January--March", YEAR=2001, ABSTRACT="The life cycle of Web service includes analysis, design, implementation, and maintenance stages. The majority of existing Web tools only address the implementation phase and lack support for other stages. The authors' experiences in building and maintaining the annual Vienna International Festival's Web site have led them to create engineering tools that cover all phases of the life cycle.", URL="http://www.computer.org/multimedia/mu2001/u1toc.htm", } @ARTICLE{Gmez0104:Conceptual, AUTHOR="Jaime Gómez and Cristina Cachero and Oscar Pastor", TITLE="Conceptual Modeling of Device-Independent Web Applications", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="Existing tools for building and deploying complex Web sites are inadequate for dealing with the software production process that involves connecting with underlying logic in a unified and systematic way. As a solution, we propose the OO-H method, an object-oriented software approach that captures relevant properties involved in modeling and implementing Web application interfaces.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Ricc0104:Understanding, AUTHOR="Filippo Ricca and Paolo Tonella", TITLE="Understanding and Restructuring Web Sites with ReWeb", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="The authors investigated automatic and semiautomatic Web site analysis with our tool ReWeb, focusing on a site's architecture and evolution. Their case study demonstrates how ReWeb addresses the need to support Web site maintenance and evolution while retaining and possibly improving quality.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Barr0104:Multimedia, AUTHOR="Chris Barry and Michael Lang", TITLE="A Survey of Multimedia and Web Development Techniques and Methodology Usage", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="The authors' survey results suggest that no uniform approach exists to multimedia systems development and that practitioners aren't using the multimedia models cited in the literature. They conclude that developers need new techniques that capture requirements and integrate them within a systems development framework.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Klap0104:Semantics, AUTHOR="Reinhold Klapsing and Gustaf Neumann and Wolfram Conen", TITLE="Semantics in Web Engineering: Applying the Resource Description Framework", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="The authors present an extensible Web modeling framework that applies the Resource Description Framework to Web engineering, providing an interoperable exchange format. Their framework uses the same (meta) data model to specify a Web application's structure and content, to make statements about a Web application's elements, and to reason about the data and metadata.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Naga0104:Semantic, AUTHOR="Katashi Nagao and Yoshinari Shirrai and Kevin Square", TITLE="Semantic Annotation and Transcoding: Making Web Content More Accessible", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="The authors propose a method for constructing a superstructure on the Web using XML and external annotations to Web documents. They have three approaches for annotating documents-linguistic, commentary, and multimedia. The result is annotated documents that computers can understand and process more easily, allowing content to reach a wider audience with minimal overhead.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Desh0104:Web, AUTHOR="Yogesh Deshpande and Steve Mark Hansen", TITLE="Web Engineering: Creating a Discipline among Disciplines", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="Web engineering is a discipline among disciplines, cutting across computer science, information systems, and software engineering, as well as benefitting from several non-IT specializations. Intertwining so many disciplines presents a unique problem for organization and development. Here the authors discuss Web engineering's classification, define its characteristics, and contrast its present issues with previous problems in information technology.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @ARTICLE{Turn0104:Comprehensive, AUTHOR="David A. Turner and Keith W. Ross", TITLE="A Comprehensive Architecture for Continuous Media Email", JOURNAL=ieeemm, VOLUME=8, NUMBER=2, MONTH="April--June", YEAR=2001, ABSTRACT="Continuous media email has numerous advantages over plain text email. The authors propose solutions to the key problems resulting from sender-stored delivery of continuous media email that have prevented implementation. To address quality of service, message deletion, and forwarding and replying problems, they advocate an integrated sender- and recipient-stored delivery approach.", URL="http://www.computer.org/multimedia/mu2001/u2toc.htm", } @BOOK{McKn01:Internet, TITLE="{Internet} Telephony", EDITOR="Lee McKnight and William H. Lehr and David D. Clark", ISBN="0-262-13385-7", PUBLISHER="The MIT Press", ADDRESS="Cambridge, Massachusetts", YEAR=2001, KEYWORDS="Internet telephony", } @MISC{Tele01:International, AUTHOR="Telegeography", TITLE="International Bandwidth 2001", YEAR=2001, KEYWORDS="bandwidth; Internet; fiber; satellite; capacity; transatlantic; transpacific", ABSTRACT="Describes international bandwidth costs and availability, for fiber and satellite.", URL="http://www.telegeography.com", } @ARTICLE{Bouc0106:Why, AUTHOR="Anna Bouch and M. Angela Sasse", TITLE="Why Value Is Everything: A User-Centered Approach to {Internet} Quality of Service and Pricing", JOURNAL="Lecture Notes in Computer Science", VOLUME=2092, PAGES="59-72", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="To create acceptable levels of Quality of Service (QoS), designers need to be able to predict users’behaviour in response to different levels of QoS. However, predicting behaviour requires an understanding of users’requirements for specific tasks and contexts. This paper reports qualitative and experimental research that demonstrates that future network service must be based on an old principle: service and its associate cost must represent value in terms of the contribution it makes to customers’goals. Human Computer Interaction (HCI) methods can be applied to identify users’goals and associated QoS requirements. Firstly, we used a qualitative approach to establish the mental concepts that users apply when assessing network services and charges. The subsequent experimental study shows that users require certain types of feedback at the user interface to predict future levels of quality. Price alone cannot be used to regulate demand for QoS.", URL="http://link.springer-ny.com/link/service/series/0558/tocs/t2092.htm", } @ARTICLE{Mann0106:Extended, AUTHOR="Jukka M J Manner and Kimmo E.E. Raatikainen", TITLE="Extended Quality-of-Service for Mobile Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=2092, PAGES="275-280", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Guaranteed QoS for multimedia applications is based on reserved resources in each intermediate node on the whole end-to-end path. This can be achieved more effectively for stationary nodes than for mobile nodes. Many multimedia applications become useless if the continuity is disturbed due to end-to-end or slow re-reservations of resources each time a mobile node moves so that its point-of-presence in the IP network changes. Additionally, due to lack of QoS support from the correspondent node, mobile nodes would need a way to reserve at least local resources, especially wireless link resources. This paper proposes small modifications to the standard Internet resource reservation protocol, RSVP, so that initial resource reservations and re-reservations due to terminal mobility can often be done locally in an access network. This is clearly a significant improvement to the current RSVP.", URL="http://link.springer-ny.com/link/service/series/0558/tocs/t2092.htm", } @ARTICLE{Eklu0101:IP, AUTHOR="Carl Eklund and Jarmo T. Mäkinen and Tero Ojanperä and Juha Pihlaja", TITLE="{IP} optimized broadband wireless access", JOURNAL=jhsn, VOLUME=10, NUMBER=1, PAGES="7-17", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Broadband Wireless Access(BWA)is moving into the IP era. New open interoperability standards for millimeter wave point-to-multipoint(PMP)radios, IEEE802.16 and HiperAccess, are being developed enabling low cost, mass-market systems. In this paper PMP standardization, regulation, service requirements and system design will be discussed.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Kuma0101:Network, AUTHOR="Apurva Kumar and Lakshmi Ramachandran and Rajeev Shorey", TITLE="Performance of network formation and scheduling algorithms in the Bluetooth wireless ad-hoc network", JOURNAL=jhsn, VOLUME=10, NUMBER=1, PAGES="59-76", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="Bluetooth technology; scatternet; piconet; device discovery; inquiry; paging; scheduling; cluster; topology; Media Access Control(MAC); Time Division Duplex(TDD); TCP; IP; UDP; utilization; throughput; end-to-end delays", ABSTRACT="Bluetooth is a promising new technology for short range, low power, low cost, pico-cellular wireless connectivity between mobile devices. Efficient clustering or topology construction algorithms play a very important role in the fast connection establishment of such networks. The performance of these algorithms is mainly dependent on the device discovery time, i.e., the time taken by a node to discover and to connect to another node in its radio range, as well as the protocols used for organizing them into the required topology. We define metrics for device discovery performance and evaluate them by simulating the inquiry routine in Bluetooth for various ad-hoc scenarios. We indicate the scenario where device discovery in Bluetooth can become a bottleneck. We then describe some recent results on topology construction algorithms for Bluetooth. Data applications running over Bluetooth such as http, ftp and real audio will need transport layer protocols such as TCP and UDP to send packets over the wireless links. We propose and compare a number of MAC scheduling algorithms with the aim of improving the performance of asynchronous data traffic over a Bluetooth piconet that supports multiple active slaves. We study how the presence of circuit-switched voice impacts the performance of data traffic.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Gao0101:Improving, AUTHOR="Xia Gao and Thyaga Nandagopal and Vaduvur Bharghavan", TITLE="On improving the performance of utility-based wireless fair scheduling through a combination of adaptive {FEC} and {ARQ}", JOURNAL=jhsn, VOLUME=10, NUMBER=1, PAGES="19-36", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="The increasing number of wireless data users and the deployment of broadband wireless networks have brought the issue of providing fair channel access to the forefront. Wireless fair scheduling algorithms must deal with unique domain-specific issues such as location-dependent and bursty channel error. In the past, a number of scheduling disciplines have been proposed for approximating fluid fair queueing in wireless channels, but using only the ARQ-based link-layer retransmit model(Bhagwat et al., in: IEEE INFOCOM, 1996; Lu et al., in: ACM SIGCOMM, 1997; Ng et al., in: IEEE INFOCOM, 1998; Lu et al., WINET 6, 2000, pp. 323---343; Nandagopal et al., in: ACM MOBICOM, 1999). In this work, we generalize past work in three key ways:(a)we use the notion of'utility-based'fair scheduling, wherein the goal of the scheduler is to serve flows in a way that maximizes the aggregate utility of the system,(b)we combine the techniques of FEC and ARQ in a generalized framework in which different scheduling disciplines can be realized by mixing and matching component algorithms within the framework, and(c)we support the notion of'application level fairness'when flows see different channel error probabilities. Specifically, we explore the combination of adaptive FEC and ARQ-based schemes within the utility-based wireless fair scheduling paradigm. We show through simulation and analysis that this combination enables the scheduling disciplines to optimize the aggregate system utility and achieve application level fairness, while handling varying channel errors effectively.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Toh0101:Intelligent, AUTHOR="Ck Toh and Wei K. Tsai", TITLE="Intelligent control of {QoS} adaptation in next generation wireless broadband networks", JOURNAL=jhsn, VOLUME=10, NUMBER=1, PAGES="37-58", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="This paper highlights the differences in Quality of Service(QoS)definitions for wired high speed ATM networks and wireless broadband ATM networks. In particular, we highlight the issues behind QoS mapping and discuss several frameworks for QoS adaptation in wireless broadband networks. We explain the need for end-to-end adaptation and reveal how such adaptation occurs during mobile handoffs. The instability and sensitivity problems occurred as a result of frequent handoffs and QoS adaptation are explained and related to control theory. We provide several control approaches that will ensure stability in the network under such circumstances. It is important that future broadband wireless networks must be able to offer network services and QoS assurance without causing network instability. This paper, therefore, reveal possible approaches to be considered in the design of future broadband wireless systems.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Tuck0102:New, AUTHOR="Rod Tucker and Shiduan Cheng and Jian Ma and Runtong Zhang", TITLE="An new approach to multi-layer network survivability: strategies, model and algorithm", JOURNAL=jhsn, VOLUME=10, NUMBER=2, PAGES="127-134", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="Multi-layer survivability; escalation strategy; resources sharing pool(RSP)", ABSTRACT="This paper studies multi-layer survivability strategies in multi-layer transport networks. Two escalation strategies, failure-oriented and traffic-oriented, are proposed, with the former reducing the time in both failure detection and notification, and the latter allowing priority restoration for different traffic. To reach the optimal spare resources for multi-layer survivability, a new resource sharing pool(RSP)is provided, which allows resources to be shared among adjacent layers without incurring any additional resource on lower layers to provide for any redundant protection. The RSP is formulated as a difficult optimization problem, and can be combined with any escalation strategies and thus can be used in any type of multiple layer networks, such as WDM-based SDH networks or IP over WDM networks. Finally, simulation is supplied to examine the efficiency of the RSP assuming the SDH-based ATM transport network is in use.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Srid0102:Approaches, AUTHOR="Murari Sridharan and Arun Somani and Murti Salapaka", TITLE="Approaches for capacity and revenue optimization in survivable {WDM} networks", JOURNAL=jhsn, VOLUME=10, NUMBER=2, PAGES="109-125", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="WDM; protection; restoration; survivability; service differentiation; revenue; optimization; ILP", ABSTRACT="In this paper, we consider two important objectives of network operation:(i)capacity minimization and(ii)revenue maximization. For capacity minimization, we formulate three operational phases in survivable WDM network operation viz., initial call set up, short/medium-term reconfiguration, and long-term reconfiguration. All three phases are derived from a single integer linear programming(ILP)formulation. This common framework incorporates service disruption. We modify the framework for revenue maximization that includes a service differentiation model based on lightpath protection. We propose a multistage solution methodology to solve individual service classes sequentially and combine them to obtain a feasible solution. We provide cost comparisons in terms of increase in revenue obtained by various service classes with the base case of accepting demands without any protection. Results are provided to demonstrate the effectiveness of our framework.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Sahi0102:Optical, AUTHOR="Gökhan Sahin and Murat Azizoglu", TITLE="Optical layer survivability for single and multiple service classes", JOURNAL=jhsn, VOLUME=10, NUMBER=2, PAGES="91-108", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="Optical layer protection; WDM; survivability; restoration; service classes", ABSTRACT="This paper considers capacity provisioning for service and restoration in a WDM optical network which provides lightpaths to higher layer networks. An optical network will likely serve several client networks with different protection requirements from the optical layer. In this paper, a framework is developed for jointly assigning wavelengths to service and restoration paths for all failures, for traffic patterns with single or multiple classes of protection. For various restoration methods, the problem is reduced to a vertex coloring problem in a graph. We present routing and wavelength assignment algorithms for service and restoration with varying capacity/restoration time tradeoffs, and evaluate their performance through simulations. We consider three different kinds of traffic patterns in terms of protection requirement: 100\%protected traffic, mixed protected/unprotected traffic, and mixed protected/low-priority traffic. We quantify the capacity cost of protection in mixed traffic patterns as a function of the proportion\rhoof the protected traffic in the mix, and identify the range of\rhowhere protection can be provided at low capacity penalties. This is important for assessing the economical feasibility of providing protection to a class of connections at the expense of reducing the amount of traffic that could be served without protection guarantees.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Vino0102:Survivability, AUTHOR="Kulathumani Vinodkrishnan and Nikhil Chandhok and Arjan Durresi and Raj Jain and Ramesh Jagannathan and Srinivasan Seetharaman", TITLE="Survivability in {IP} over {WDM} networks", JOURNAL=jhsn, VOLUME=10, NUMBER=2, PAGES="79-90", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="The Internet is emerging as the new universal telecommunication medium. IP over WDM has been envisioned as one of the most attractive architectures for the new Internet. Consequently survivability is a crucial concern in designing IP over WDM networks. This paper presents a survey of the survivability mechanisms for IP over WDM networks and thus is intended to provide a summary of what has been done in this area and help further research. A number of optical layer protection techniques have been discussed. They are examined from the point of view of cost, complexity, and application. Survivability techniques are being made available at multiple layers of the network. This paper also studies the recovery features of each network layer and explains the impact of interaction between layers on survivability. The advantages and issues of multi-layer survivability have been identified. The main idea is that the optical layer can provide fast protection while the higher layers can provide intelligent restoration. With this idea in mind, a new scheme of carrying IP over WDM using MPLS or Multi Protocol Lambda-Switching has been discussed. Finally, an architecture is suggested by means of which the optical layer can perform an automatic protection switch, with priority considerations with the help of signaling from the higher layers.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Josh01:Broadband, AUTHOR="Anupam Joshi and Arvind Krishna", TITLE="Broadband Wireless", JOURNAL=jhsn, VOLUME=10, NUMBER=0, PAGES="1-6", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, URL="http://www.iospress.nl/site/html/09266801.html", } @TECHREPORT{Bolo01:Operating, AUTHOR="William J. Bolosky and Richard Draves and Robert P. Fitzgerald and Christopher W. Fraser and Michael B. Jones and Todd B. Knoblock and Rick Rashid", TITLE="Operating System Directions for the Next Millennium", INSTITUTION="Microsoft Research", YEAR=2001, KEYWORDS="operating systems", ABSTRACT="We believe it is time to reexamine the operating system's role in computing. Operating systems exist to create an environment in which compelling applications come to life. They do that by providing abstractions built on the services provided by hardware. We argue that advances in hardware and networking technology enable a new kind of operating system to support tomorrow's applications. Such an operating system would raise the level of abstraction for developers and users, so that individual computers, file systems, and networks become unimportant to most computations in the same way that processor registers, disk sectors, and physical pages are today.", URL="http://research.microsoft.com/research/sn/Millennium/mgoals.html", } @ARTICLE{Oh0101:Visual, AUTHOR="Paul Y. Oh and Peter K. Allen", TITLE="Visual Servoing by Partitioning Degrees-of-Freedom", JOURNAL=ieeera, VOLUME=17, NUMBER=1, PAGES="1-17", YEAR=2001, } @INPROCEEDINGS{Ghos01:Architecture, AUTHOR="Atanu Ghosh and Michael Fry and Jon Crowcroft", TITLE="An Architecture for Application Layer Routing", BOOKTITLE="International Working Conference on Active Networks (IWAN)", ADDRESS="Philadelphia, Pennsylvania", MONTH="September/October", YEAR=2001, REFERENCES=35, KEYWORDS="Application-layer routing; active networks", ABSTRACT="We have previously proposed, implemented and demonstrated an Application Layer Active Network (ALAN) infrastructure. This infrastructure permits the dynamic deployment of active services in the network, but at the application level rather than the router level. Thus the advantages of active networking are realised, without the disadvantages of router level implementation. However we have previously left unsolved the issue of appropriate placement of ALAN supported services. This is an Application Layer Routing problem. In this paper we define this problem and show that, in contrast to IP, it is a multi-metric problem. We then propose an architecture that helps conceptualise the problem and build solutions. We propose detailed approaches to the active node discovery and state maintenance aspects of Application Layer Routing (ALR).", URL="ftp://cs.ucl.ac.uk/darpa/iwan.ps.gz", } @ARTICLE{Ke0103:Cost, AUTHOR="Kai-Wei Ke and Chin-Tau Lea", TITLE="On cost-based routing in connection-oriented high-speed networks", JOURNAL=jhsn, VOLUME=10, NUMBER=3, PAGES="135-160", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Not only does cost-based routing achieve a higher throughput, it also removes the instability problem inherent in fixed-path routing networks with alternate paths. In the paper we evaluate the performance of two cost-based routing schemes: one centralized and one distributed. The latter has a much lower complexity than the former. Although the distributed version does not always use the least-cost path, our results indicate the performance of both schemes are about the same. We also compare them with least-loaded routing to demonstrate the ability of cost-based routing to stabilize the network performance even under an over-loaded condition. But to make cost-based routing a viable option for a high-speed network, we must find a way to compute the cost function. Recently a theory based on the concept of quantization was developed. It can significantly reduce the complexity of cost computation. With this problem solved, cost-based routing becomes a serious contending routing algorithm for a high-speed multirate network. The results in the paper demonstrate that the performance degradation caused by quantizing the cost function is insignificant.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Diwa0103:Speeded, AUTHOR="Roch Guérin and Kumar N. Sivarajan", TITLE="Performance analysis of speeded-up high-speed packet switches", JOURNAL=jhsn, VOLUME=10, NUMBER=3, PAGES="161-186", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="Input queueing; output queueing; high-speed packet switches; speedup factor; HOL blocking", ABSTRACT="In this paper, we study the performance of high-speed packet switches, where the switch fabric operates at a slightly higher speed than the links, i.e., a speeded-up switch. Such structures are by no means new and there are two well studied architectures in the literature for such packet switches: pure input queueing(no speedup)and pure output queueing(speedup of N, the number of links), with output queueing switches offering substantial performance benefits. However, as link speeds keep increasing, the speedup of N needed for pure output queueing becomes a significant technical challenge. This is one of the main reasons for the renewed interest in moderately speeded-up switch fabrics. The aim of this paper is to highlight the result that only a moderate speed-up factor(less than two)is sufficient to achieve full input link utilization. In particular, we emphasize that this holds, even without relying on a central switch controller making intelligent decisions on which packets to schedule through the switch. As shown in recent works, i.e.,[5, 17, 20, 23, 25]there are clearly benefits to using intelligent controllers, but they do come at a cost. Instead, in this paper we focus on what can be achieved by relying simply on switch speedup. We do so by means of analysis and simulations. Our analysis provides explicit expressions for the average queue length in switches with integer and rational speedups. The results are complemented by simulations that are used to obtain delay estimates, and which also allow us to extend our investigation to shared memory switches for which we find that good performance can be achieved with an even lower speedup.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Haas0103:Mobile, AUTHOR="Zygmunt J. Haas and Abhijit Warkhedi", TITLE="The design and performance of Mobile {TCP} for wireless networks", JOURNAL=jhsn, VOLUME=10, NUMBER=3, PAGES="187-207", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="In this paper, we propose a novel approach to reduce the wireless communication overhead associated with the transport layer. Portability is a key element of mobile computing. As mobile devices shrink in terms of size and weight, their computing capabilities are also reduced, constrained by battery capacity. To sustain a good performance level of mobile applications, we devise a solution that reduces the processing complexity on computing-limited mobile devices. Additionally, we aim to minimize the use of wireless resources to further improve performance. Specifically, we develop a streamlined protocol architecture, Mobile TCP(MTCP), that achieves the elimination of IP processing on the wireless segment of the TCP connection. MTCP operates over a single hop wireless link, and, consequently, it eliminates the unnecessary overhead placed on mobile devices, such as the TCP congestion control mechanisms. In addition, we investigate the impact of streamlining the socket layer on offloading the processing overhead. Our experimental results indicate a substantial improvement in the efficiency of protocol processing. For instance, results show that the MTCP processing time per packet is approximately only one fourth that of TCP and the use of CPU resources is reduced by up to 50\%. Furthermore, the protocol incorporates various robust, yet simple, loss recovery techniques to considerably improve the throughput in lossy wireless conditions.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Lee0103:Optimal, AUTHOR="Sang-Kyu Lee and A. Duksu Oh and Hyeong-Ah Choi", TITLE="Optimal transmission schedule in {WDM} optical networks with multiple transmitters and receivers", JOURNAL=jhsn, VOLUME=10, NUMBER=3, PAGES="209-222", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="In this paper, we study the problem of optimal transmission schedules for embedding complete graphs in WDM broadcast-and-select optical networks. An optimal transmission schedule is defined to be the one that schedules transmissions such that each node transmits once to every other node within a repeating cycle of minimum length. Our model assumes that the network has N nodes with k wavelength channels, and each node is equipped with\αtunable transmitters and\βfixed-tuned receivers. Given\α,\β(1\≤\α,\β\≤k)and\δ(tuning delay required for a transmitter to tune from one wavelength to another), we develop an optimal transmission schedule with schedule length max\ \{\α\βN(N\−1)/k,\β(N\−1)+k\δ\}such that each transmitter of each node transmits once to each receiver of its neighboring nodes within this time period.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Jose0103:Hierarchical, AUTHOR="Sabu Joseph and Terence D. Todd", TITLE="Hierarchical photonic {LANs} using spectral folding", JOURNAL=jhsn, VOLUME=10, NUMBER=3, PAGES="223-244", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Local area networks based on passive optical star couplers were originally proposed to exploit the enormous bandwidth of optical fiber[1]. Unfortunately, the maximum throughput of these systems is restricted by the limited number of channels which can be achieved in practice. To address this problem, two-level hierarchical WDM LANs have been proposed[2---4]. These architectures can increase system capacity by permitting a set of local channels(i.e., the local waveband)to be spatially reused across a number of local optical networks(LONs). Full connectivity is maintained by a globally shared remote waveband. In systems of this kind the channels are typically accessed using a single wavelength-agile transmitter at each station[4]. Since fast receiver tuning is currently more difficult to achieve, practical designs are based on dynamic transmitter tuning only[2---4]. Receiver tuning is performed only rarely or during system initialization. An unfortunate complication with hierarchical networks is that stations must maintain a presence in both wavebands. In fixed-tuned receiver designs this means that each station must have one receiver for each waveband. As a result, the amount of station receiver hardware is at least twice that required for single passive star networks just to maintain full connectivity. In this paper, a simple technique is proposed for eliminating this requirement. In the remote section of the network, fixed wavelength conversion is used to fold certain remote wavelengths onto the local ones. This results in an interesting design where the local/remote allocation of bandwidth is dynamically controlled temporally by the stations from the edge of the network. Full connectivity can be maintained with only half the total number of station receivers and the capacity can scale linearly with the number of LONs, as in conventional hierarchies. The price to pay for this simplification however, is that capacity is lost through the wavelength folding process. New media access protocols are required to prevent conflicts in this case. The capacity and delay performance of the system is investigated for four proposed media access control protocols.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Katz0104:Fault, AUTHOR="Irene Katzela and Georgios Ellinas and Won Yoon and Thomas Stern", TITLE="Fault diagnosis in optical networks", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="269-291", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Faults in the optical network environment propagate quickly to different parts of the network raising a large number of alarms. This paper describes two new fault diagnosis techniques for single fault diagnosis in an optical network. Both techniques operate under the same premises: when a fault occurs, a central manager detects the fault and through tests and correlation of information identifies the failure. The performance of the proposed schemes is compared both analytically and by simulation to each other and other proposed schemes for fault diagnosis in the optical network environment.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Mdar0104:Node, AUTHOR="Muriel Médard and Stephen R. Chinn and Poompat Saengudomlert", TITLE="Node wrappers for {QoS} monitoring in transparent optical nodes", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="247-268", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="Transparent optical nodes(TONs), such as all-optical switches and erbium-doped fiber amplifiers, are an increasingly important part of wavelength-division multiplexed(WDM)networks. Our goal in this paper is to consider how quality of service(QoS)may be monitored at such TONs. The question is particularly important as access to WDM networks, and associated security concerns, increase. Our paper has four parts. First, we present an overview of the vulnerabilities of TONs to QoS degradation for two main classes of TONs, namely all-optical switching nodes and amplifiers in optical networks. Second, we discuss the applicability of traditional supervisory methods to such degradations. Third, we propose a novel approach to monitoring QoS degradations in TONs. Our approach works by comparing the input and output at a node and deciding whether unacceptable service degradation has occurred at that node. Finally, we analyze the performance, under simple attack scenarios, of our approach for jamming attacks at transparent optical switching nodes and amplifiers. We show that our method is several orders of magnitude faster than bit error rate testers in detecting QoS degradations.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Zhu0104:Topology, AUTHOR="Keyao Zhu and Laxman Sahasrabuddhe and Biswanath Mukherjee", TITLE="Topology design and upgrade of an optical network by bottleneck-cut identification", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="293-301", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="We investigate the problem of topology design of an optical network by bottleneck-cut identification. For an optical network, the topology-design problem can be viewed as a combined two-layer design problem: physical-topology design and virtual-topology design. In this study, we present the definition of bottleneck cut of an optical network. A heuristic algorithm is proposed to find the bottleneck cut, and then we show how to apply this algorithm to an optical network for topology design and upgrade.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Anan0104:Static, AUTHOR="Vishal Anand and Chunming Qiao", TITLE="Static versus dynamic establishment of protection paths in {WDM} networks", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="317-327", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, ABSTRACT="In wavelength division multiplexed networks(WDM)with 1:1 path protection, a link-disjoint protection(backup)path is also set up at the time of setting up a working(primary)path. Hence, the failure of a single fiber-link does not cause huge data losses. This paper considers on-line routing and wavelength assignment(RWA)of protection paths in such networks. In particular, we study two strategies based on the 1:1 path protection scheme. The Static strategy establishes protection paths such that once a route and wavelength have been chosen they are not allowed to change. On the other hand, the Dynamic strategy allows for re-arrangement of protection paths, that is, both the route and wavelength chosen for a protection path can change so as to accommodate a new request. With either strategy, we assume that the working paths cannot be re-arranged. This is to prevent the disruption of on-going traffic. The two strategies are compared on the basis of the number of connections requests that can be satisfied for a given number of wavelengths, assuming that the requests come one at a time, and wavelengths are assigned according to the First-Fit policy. One of the results of our study is that, contrary to intuition, the Static strategy performs better than the Dynamic strategy.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Sen0104:Survivability, AUTHOR="Bao Hong Shen and Subir Bandyopadhyay", TITLE="Survivability of lightwave networks---path lengths in {WDM} protection scheme", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="303-315", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, KEYWORDS="Optical networks; WDM; survivability; min-max path pair; min-sum path pair; shortest path pair", ABSTRACT="In the protection scheme of fault management in a WDM optical network, corresponding to every source-destination path used for data transmission, a backup path is maintained in a stand-by mode. In the case of a failure(either due to a fiber cut or due to equipment failure)in the primary path, data transmission is quickly switched to the backup path. In order to tolerate any single fault, the backup path must be edge(or node)disjoint from the primary path. Most often a shortest path between the source and the destination is chosen as the primary path. To obtain a link(node)disjoint backup(or secondary)path, the links(nodes)of the primary path are removed from the graph and then a shortest path in the modified graph is chosen as the backup path. The attractive feature of this scheme is its simplicity. However, the scheme has a severe drawback. Due to the choice of a shortest path as the primary path, the length of a link disjoint secondary path may be unacceptably large. In this paper, we propose a novel way of choosing the primary and the secondary paths so that the lengths of both the paths are small. Unfortunately, the problem of choosing primary and secondary paths in this way turns out to be NP-complete. We provide the NP-completeness proof of both the edge disjoint and the node disjoint version of the problem. We provide an approximation algorithm for the problem with a guaranteed performance bound of 2 and a mathematical programming formulation for the exact solution of the problem. Though the approximate solution provides a performance bound of 2, through extensive experimental evaluation, we find that the approximate solution is very close to the optimal solution and the ratio between the approximate to the optimal solution never exceeds 1.2. Although we discuss the single fault scenario in this paper, the algorithms discussed here, can be used equally effectively for the multiple fault scenario also. Finally, we discuss other variations of the disjoint path problem relevant to the lightwave networks.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Choi0104:Survivable, AUTHOR="Hyeong-Ah Choi and Suresh Subramaniam", TITLE="Survivable Optical Networks---Part {II}", JOURNAL=jhsn, VOLUME=10, NUMBER=4, PAGES="245-245", NOTE="International Workshop on Quality of Service (IWQoS)", YEAR=2001, URL="http://www.iospress.nl/site/html/09266801.html", } @TECHREPORT{Rabi01:Positioning, AUTHOR="Matthew Rabinowitz and James Spilker", TITLE="Positioning Using the {ATSC} Digital Television Signal", TYPE="Rosum Corporation Whitepaper", INSTITUTION="Rosum", ADDRESS="Redwood City, California", YEAR=2001, KEYWORDS="GPS; geolocation; HDTV", URL="http://www.rosum.com/whitepaper\_8-7-01.pdf", } @ARTICLE{Hedb01:Evolving, AUTHOR="Tomas Hedberg and Stefan Parkvall", TITLE="Evolving {WCDMA}", JOURNAL=ericssonr, NUMBER=3, YEAR=2001, KEYWORDS="UMTS; UTRAN; air interface", ABSTRACT="WCDMA is rapidly emerging as the leading global third-generation (IMT- 2000) standard, providing simultaneous support for a wide range of services with different characteristics on a common 5 MHz carrier. The current WCDMA specification fully satisfies the IMT-2000 requirements, including support for data rates of up to 2 Mbit/s in indoor or small-cell outdoor environments, wide-area coverage at rates of up to 384 kbit/s, and support for high-rate packet-data and circuit-switched services. Thus, the introduction of third-generation cellular systems allows operators to offer a vast selection of services to meet subscriber demands. Ericsson’s WCDMA products are positioned to guarantee cost-effective delivery of these services. When launching a WCDMA network, most operators will initially focus on delivering stable coverage over a large area—capacity is a lesser concern. The initial deployment will also support essential end-user services, including radio access bearers for circuit- and packet-switched data communication as well as location-based services. Over time, the capacity requirements will increase as more and more subscribers enter the system. Likewise, greater support will be needed for end-user services - that is, multimedia services, high-precision location services, and high-speed packet-data services will become increasingly important. These evolving requirements can be supported through enhancements and additions of new functionality in the current WCDMA standard (R99) and through future additions to it. In this article, the authors discuss ways of evolving the Ericsson family of WCDMA products. Because packet data is expected to have an increasingly important role, the scope of this article is mostly limited to packet data services. The authors outline enhancements to the current standard and propose a subsequent evolution.", URL="http://www.ericsson.com/about/publications/review/2001\_03/files/2001034.pdf", } @INPROCEEDINGS{Kim01:Efficient, AUTHOR="Kyung Tae Kim and Sung Kyo Jung and Young C. Park and Yong Choi and Dae Hee Youn", TITLE="An efficient transcoding algorithm for {G.723.1} and {EVRC} speech coders", BOOKTITLE="Vehicular Technology Conference (VTS)", PAGES="1561-1564", YEAR=2001, REFERENCES=6, KEYWORDS="transcoding; G.723.1; EVRC", ABSTRACT="Interoperability is one of the most important factor for a successful integration of the speech network. To operate speech networks employing different speech coders, but integrated as one, bitstreams generated by one coder should be translated seamlessly to those of the other coders. Connecting two coders in tandem may be the simplest way to accomplish this. However, codecs in tandem connection often produce problems such as poor speech quality, high computational load, and additional transmission delay. In this paper, we propose an efficient transcoding algorithm that can provide interoperability to the networks employing ITU-T G.723.1 and TIA IS-127 EVRC speech coders. Subjective and objective quality evaluations have confirmed that the speech quality produced by the proposed transcoding algorithm was equivalent to, or better than the tandem encoding, while it had shorter processing delay and less computational complexity.", } @INPROCEEDINGS{Tsai01:GSM, AUTHOR="Shu-Min Tsai and Jar-Ferr YANG", TITLE="{GSM} to {G.729} speech transcoder", BOOKTITLE="8th IEEE International Conference on Electronics, Circuits and Systems (ICECS)", PAGES="485-488", YEAR=2001, REFERENCES=4, KEYWORDS="transcoding; GSM", ABSTRACT="With increasing demand of wireless and Internet accesses, the interoperability crossing these two networks becomes increasingly important for modern communications. A transcoding system that translates the coding parameters directly between the GSM and G.729 speech coders is discussed in the present paper. The GSM coder is used for mobile communications while the G.729 is the most favorable coder in Internet communications. For Internet/wireless gateway servers, it is evident that the proposed transcoding system requires much less computation than the conventional decode-then-encode (DTE) approach.", } @BOOK{Bush01:Active, AUTHOR="Stephen Francis Bush and Amit Kulkarni", TITLE="Active Networks and Active Network Management: A Proactive Management Framework", EDITION="1st", PUBLISHER="Kluwer Academic/Plenum Publishers", YEAR=2001, LANGUAGE="English", KEYWORDS="Active Networks, Network Management, Predictive Management", ABSTRACT="Active networking is an exciting new paradigm in digital networking that has the potential to revolutionize the manner in which communication takes place. It is an emerging technology, one in which new ideas are constantly being formulated and new topics of research are springing up even as this book is being written. This technology is very likely to appeal to a broad spectrum of users from academia and industry. Therefore, this book was written in a way that enables all these groups to understand the impact of active networking in their sphere of interest. Information services managers, network administrators, and e-commerce developers would like to know the potential benefits of the new technology to their businesses, networks, and applications. The book introduces the basic active networking paradigm and its potential impacts on the future of information handling in general and on communications in particular. This is useful for forward-looking businesses that wish to actively participate in the development of active networks and ensure a head start in the integration of the technology in their future products, be they applications or networks. Areas in which active networking is likely to make significant impact are identified, and the reader is pointed to any related ongoing research efforts in the area. The book also provides a deeper insight into the active networking model for students and researchers, who seek challenging topics that define or extend frontiers of the technology. It describes basic components of the model, explains some of the terms used by the active networking community, and provides the reader with taxonomy of the research being conducted at the time this book was written. Current efforts are classified based on typical research areas such as mobility, security, and management. The intent is to introduce the serious reader to the background regarding some of the models adopted by the community, to outline outstanding issues concerning active networking, and to provide a snapshot of the fast-changing landscape in active networking research. Management is a very important issue in active networks because of its open nature. The latter half of the book explains the architectural concepts of a model for managing active networks and the motivation for a reference model that addresses limitations of the current network management framework by leveraging the powerful features of active networking to develop an integrated framework. It also describes a novel application enabled by active network technology called the Active Virtual Network Management Prediction (AVNMP) algorithm. AVNMP is a proactive management system; in other words, it provides the ability to solve a potential problem before it impacts the system by modeling network devices within the network itself and running that model ahead of real time.", URL="ISBN 0-306-46560-4", } @ARTICLE{Knob01:Ariadne, AUTHOR="Craig A. Knoblock and Steven Minton and Jose Luis Ambite and Naveen Ashish and Ion Muslea and Andrew G. Philpot and Sheila Tejada", TITLE="The {ARIADNE} Approach to Web-based Information Integration", JOURNAL="International Journal of Cooperative Information Systems", VOLUME=10, NUMBER="1-2", YEAR=2001, LANGUAGE="English", } @INPROCEEDINGS{Ilve01:Length, AUTHOR="Mika Ilvesmäki and Sampo Kaikkonen", TITLE="The Length of Measurement Period to Determine the Application Profile for Traffic Classification in the {Internet}", BOOKTITLE=icc, ORGANIZATION="IEEE", YEAR=2001, LANGUAGE="English", } @INPROCEEDINGS{Ilve01:Notes, AUTHOR="Mika Ilvesmäki and Jouni Karvo", TITLE="Notes on the Per-Flow Packet Count Flow Classifier,", BOOKTITLE=lcn, YEAR=2001, LANGUAGE="English", } @INPROCEEDINGS{Ilve01:Capabilities, AUTHOR="Mika Ilvesmäki and Marko Luoma", TITLE="On the Capabilities of Application Level Traffic Measurements to Differentiate and Classify {Internet} Traffic", BOOKTITLE="ITCOM", ORGANIZATION="SPIE", YEAR=2001, LANGUAGE="English", ABSTRACT="1. The use of network based tra±c classification to di®erentiate aggregate tra±c has been introduced with the development of new Internet service architectures, especially with the Di®erentiated Services. We present measurements and analysis of various packet and flow statistics to aid in classifying or di®erentiating tra±c flows according to the application nature. Our study on methods tra±c classification includes the background analysis of tra±c traces to detect applications of varying nature by measuring packet inter-arrival times, packet lengths, flow inter-arrival times, and packet and flow shares of total tra±c. Most promising results with a single statistic are achieved when classifying tra±c based on packet inter-arrival patterns. The interarrival time distributions of packets seem to be able to divide the tra±c into two distinguishable classes. However, the division to three or more classes remains as somewhat ambiguous issue and needs further research. However, the results also indicate that no single statistic is able to classify application flows with reasonable certainty but that this might be achieved when several statistics and their analysis results are combined. A good method of increasing the classification result would be to increase the dimensionality of the classification. For instance, combining the classification results of packet IAT and packet length distributions would almost certainly lead to the detection of applications of di®erent nature.", } @PHDTHESIS{Ilve01:Behavior, AUTHOR="Mika Ilvesmäki", TITLE="On the Behavior and Performance of the Packet Count Flow Classifier", SCHOOL="Helsinki University of Technology", NOTE="A Licentiate thesis, a pre-doctoral and post-graduate type of thesis.", YEAR=2001, ABSTRACT="1. Flow classification is used in the Internet to find and detect flows of packets that can be handled separately from the rest of the traffic. The packet flows may receive diff erent service levels or they may be treated differently in the network. This work studies a flow classification method where the flows are detected by counting packets on flow candidates. This counting is continued until the packet count threshold is reached and an active flow is established. This work studies the packet count classifier using a set of traffic measurements made in di erent networks. Results show that the number of packets outside of any active flows is relatively small thus reducing the workload of conventional packet forwarding. However, the classified flows are from a large number of different applications and it is doubtful that packet count flow classification may be used to support the introduction of quality of service in the Internet. Furthermore, the candidate table, an essential part of the packet count classifier implementation, forms a significant performance bottleneck because of the size and frequent changes in it.", } @TECHREPORT{Berg01:Wireless, AUTHOR="Magnus Berggren", TITLE="Wireless communication in telemedicine using Bluetooth and {IEEE} 802.11b", INSTITUTION="Department of Information Technology Uppsala University", YEAR=2001, LANGUAGE="English", ABSTRACT="This thesis explores the issues surrounding the simultaneous deployment of Bluetooth \& Wireless LAN (IEEE 802.11b) for networked devices in a telemedicine environment. A key aspect in telemedicine is the ability of the two standards to co-exist in close proximity. This work defines telemedicine, gives examples of applications, and describes the two wireless techniques and the issues that arise when considering the introduction of wireless communication. The thesis tries to answer the question whether the two wireless techniques Bluetooth and Wireless LAN can co-exist in a telemedicine environment. In order to do this, quantified measurements where performed were the two wireless techniques where exposed to radio interference from the other technique. These results are printed as graphs and explained.", } @PROCEEDINGS{Galt01:Predicting, AUTHOR="Virginie Galtier and Yannick Carlinet and Kevin Mills and Stephen Francis Bush", TITLE="Predicting and Controlling Resource Usage in a Heterogeneous Active Network", ORGANIZATION="Active Middleware Services", PUBLISHER="IEEE", YEAR=2001, LANGUAGE="English", KEYWORDS="active network, complexity theory", ABSTRACT="Active network technology envisions deployment of virtual execution environments within network elements, such as switches and routers. As a result, inhomogeneous processing can be applied to network traffic. To use such technology safely and efficiently, individual nodes must provide mechanisms to enforce resource limits. This implies that each node must understand the varying resource requirements for specific network traffic. This paper presents an approach to model the CPU time requirements of active applications in a form that can be interpreted among heterogeneous nodes. Further, the paper demonstrates how this approach can be used successfully to control resources consumed at an active-network node and to predict load among nodes in an active network, when integrated within the Active Virtual Network Management Prediction system.", URL="http://www.research.ge.com/~bushsf/ftn", } @MISC{ViaVoice, AUTHOR="International Business Machines Corporation", TITLE="{{IBM} ViaVoice {ASR} {SDK} for Linux}", YEAR=2001, LANGUAGE="English", ANNOTE="Available at http://www.ibm.com/software/speech/dev/sdk\\_linux.html", URL="http://www.ibm.com/software/speech/dev/sdk\\_linux.html", } @TECHREPORT{Abr:sicstech02, AUTHOR="Henrik Abrahamsson and Ian Robin Marsh", TITLE="{DTMsim} -- {DTM} channel simulation in ns", INSTITUTION="SICS -- Swedish Institute of Computer Science", YEAR=2001, } @INPROCEEDINGS{Ahlg01:Dimensioning, AUTHOR="Bengt Ahlgren and Anders Andersson and Olof Hagsand and Ian Robin Marsh", TITLE="Dimensioning Links for {IP} Telephony", BOOKTITLE="2nd IP-Telephony Workshop (IPtel 2001)", ADDRESS="New York City, New York, USA", MONTH="APR", YEAR=2001, ABSTRACT="Packet loss is an important parameter for dimensioning network links or traffic classes carrying IP telephony traffic. We present a model based on the Markov modulated Poisson process (MMPP) which calculates packet loss probabilities for a set of superpositioned voice input sources and the specified link properties. We do not introduce another new model to the community, rather try and verify one of the existing models via extensive simulation and a real world implementation. A plethora of excellent research on queuing theory is {\em still} in the domain of ATM researchers and we attempt to highlight it's validity to the IP Telephony community. Packet level simulations show very good correspondence with the predictions of the model. Our main contribution is the verification of the MMPP model with measurements in a laboratory environment. The loss rates predicted by the model are in general close to the measured loss rates and the loss rates obtained with simulation. The general conclusion is that the MMPP-based model is a tool well suited for dimensioning links carrying packetized voice in a system with limited buffer space", URL="http://www.sics.se/~ianm/Publications/dimensioning.ps.gz", } @INPROCEEDINGS{Albe01:Simulation, AUTHOR="Lars Albertsson", TITLE="Simulation-Based Debugging of Soft Real-Time Applications", BOOKTITLE="Real-Time Application Symposium", ORGANIZATION="IEEE Computer Society", PUBLISHER="IEEE Computer Society Press", MONTH="MAY", YEAR=2001, ABSTRACT="We present a temporal debugger, capable of examining time flow of soft real-time applications in Unix systems. The debugger is based on a simulator modelling an entire workstation in sufficient detail to run unmodified operating systems and applications. It provides a deterministic and non-intrusive debugging environment, allowing reproducible presentation of program time flow. The primary contribution of this paper is virtual machine translation, a technique necessary to debug applications in a simulated Unix system. We show how a virtual machine translator maps low-level data, provided by the simulator, to data useful to a symbolic debugger. The translator operates by parsing data structures in the target operating system and has been implemented for the GNU debugger and simulated Linux systems.", URL="http://www.sics.se/~lalle/publications/debugging\_soft\_rt.pdf", } @TECHREPORT{Albe01:Overview, AUTHOR="Lars Albertsson", TITLE="An Overview of Practical Research Approaches to Real-Time System Engineering", INSTITUTION="SICS -- Swedish Institute of Computer Science", NUMBER="T2001:16", YEAR=2001, URL="http://www.sics.se/~lalle/literature/literature.pdf", } @TECHREPORT{Dun:minimal-tcp-proxy, AUTHOR="Adam Dunkels", TITLE="Minimal {TCP/IP} implementation with proxy support", INSTITUTION="SICS -- Swedish Institute of Computer Science", NUMBER="T2001:20", NOTE="Master's thesis", MONTH="FEB", YEAR=2001, URL="http://www.sics.se/~adam/thesis.pdf", } @INPROCEEDINGS{Feeney:infocom01, AUTHOR="Laura Feeney and Martin Nilsson", TITLE="Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment", BOOKTITLE="of IEEE Conference on Computer Communications (IEEE InfoCom)", ADDRESS="Anchorage AK, USA", MONTH="APR", YEAR=2001, ABSTRACT="Energy-aware design and evaluation of network potocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a collection of linear equations for calculating the energy consumed in sending, receiving and discarding broadcast and point-to-point data packets of various sizes. Some implications for protocol design and evaluation in ad hoc networks are discussed.", URL="http://www.sics.se/~lmfeeney/info01.ps", } @ARTICLE{Feen01:Energy, AUTHOR="Laura Feeney", TITLE="An Energy-consumption Model for Performance Analysis of RoutingProtocols for Mobile Ad Hoc Networks", JOURNAL="Mobile Networks and Applications (MONET) Journal", VOLUME=6, NUMBER=3, PAGES="239-250", MONTH="JUN", YEAR=2001, ABSTRACT="A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet. Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.", URL="http://www.sics.se/~lmfeeney/monet.ps", } @TECHREPORT{Voigt:docstech01, AUTHOR="Thiemo Voigt and Per Gunningberg", TITLE="Dealing with Memory-intensive Web Requests", INSTITUTION="Dept. of Information Technology, Uppsala University", NUMBER="2001--010", MONTH="MAY", YEAR=2001, } @INPROCEEDINGS{Voi:paws01, AUTHOR="Thiemo Voigt and Per Gunningberg", TITLE="Kernel-based Control of Persistent Web Server Connections", BOOKTITLE="Performance and Architecture of Web Servers (PAWS)", ADDRESS="Cambridge, MA, USA", MONTH="JUN", YEAR=2001, ABSTRACT="Several overload admission control architectures have been developed to protect web servers from overload. Some of these architectures base their admission decision on information found in the HTTP header. In this context, persistent connections represent a challenging problem since the HTTP header of the first request does not reveal any information about the resource consumption of the requests that might follow on the same connection. We have previously presented a kernel-based architecture that protects web servers from overload. The implemented mechanisms have proven to be more efficient and scalable than application level controls implemented in the web server. In this paper, we extend the kernel-based architecture to prevent overload caused by persistent connections. We evaluate our approach by various experiments.", URL="http://www.sics.se/~thiemo/pawslong.ps", } @MISC{Voi:usenix01, AUTHOR="Thiemo Voigt and Renu Tewari and Douglas Freimuth and Ashish Mehra", TITLE="Kernel Mechanisms for Service Differentiation in Overloaded Web Servers", HOWPUBLISHED="2001 Usenix Annual Technical Conference", MONTH="JUN", YEAR=2001, ABSTRACT="The increasing number of Internet users and innovative new services such as e-commerce are placing new demands on Web servers. It is becoming essential for Web servers to provide performance isolation, have fast recovery times, and provide continuous service during overload at least to preferred customers. In this paper, we present the design and implementation of three kernel-based mechanisms that protect Web servers against overload by providing admission control and service differentiation based on connection and application level information. Our basic admission control mechanism, {\em TCP SYN policing}, limits the acceptance rate of new requests based on the connection attributes. The second mechanism, {\em prioritized listen queue}, supports different service classes by reordering the listen queue based on the priorities of the incoming connections. Third, we present {\em HTTP header-based connection control} that uses application-level information such as URLs and cookies to set priorities and rate control policies. We have implemented these mechanisms in AIX 5.0. Through numerous experiments we demonstrate their effectiveness in achieving the desired degree of service differentiation during overload. We also show that the kernel mechanisms are more efficient and scalable than application level controls implemented in the Web serv", URL="http://www.sics.se/~thiemo/usenix01.ps", } @ARTICLE{Voigt:acmperfevalreview, AUTHOR="Thiemo Voigt and Per Gunningberg", TITLE="Kernel-based Control of Persistent Web Server Connections", JOURNAL="ACM Performance Evaluation Review", VOLUME=29, NUMBER=2, PAGES="20-25", MONTH="SEP", YEAR=2001, } @INPROCEEDINGS{WesterlundA:usenix2001, AUTHOR="Assar Westerlund and Johan Danielsson", TITLE="Heimdal and Windows 2000 Kerberos --- how to get them to play together", BOOKTITLE="Usenix 2001 Annual Technical Conference", ADDRESS="Boston, USA", MONTH="JUN", YEAR=2001, URL="http://www.sics.se/cna/publications/heimdal-2k.ps", } @INPROCEEDINGS{Delg01:Adaptation, AUTHOR="A. Delgado and Andrej Mihailovic and N. Georganopuols and Hamid Aghvami", TITLE="Adaptation of Transport Protocols for an {IP} Micromobility Scheme", BOOKTITLE="International Conference on Communications, ICC 2001", ADDRESS="Helsinki, Finland", MONTH="June 11--14", YEAR=2001, } @INPROCEEDINGS{Snoe01:Reconsidering, AUTHOR="Alex C. Snoeren and Hari Balakrishnan and M. Frans Kaashoek", TITLE="Reconsidering {Internet} Mobility", BOOKTITLE="8th Workshop on Hot Topics in Operating Systems (HotOS-VIII)", YEAR=2001, } @INPROCEEDINGS{Ramj01:IP, AUTHOR="Ramachandran Ramjee and T. La Porta and Lianyuan Li and Sneha Kumar Kasera", TITLE="{IP} Paging Architectures", BOOKTITLE="IP-based Cellular Networks, IPCN", ORGANIZATION="UpperSide", YEAR=2001, } @INPROCEEDINGS{Jona01:TCP, AUTHOR="Karl Jonas and others", TITLE="{TCP} Performance under Mobile {IP} Handoffs -- Survey and Performance Results", BOOKTITLE="IP-Based Cellular Networks, IPCN 2001", ADDRESS="Paris, France", MONTH="May 15-18", YEAR=2001, } @INPROCEEDINGS{Hart01:Performance, AUTHOR="Hannes Hartenstein and Karl Jonas and Marco Liebsch and R. Schmitz and M. Stiemerling and Dirk Westhoff", TITLE="Performance of {TCP} in Mobile in the Presence of Mobile {IP} Handoffs", BOOKTITLE="IEEE International Conference on Telecommunications, ICT 2001", ADDRESS="Bucharest, Romania", MONTH="June 4-7", YEAR=2001, } @INPROCEEDINGS{Hart01:Role, AUTHOR="Hannes Hartenstein and Karl Jonas and Marco Liebsch and R. Schmitz and Heiner Josef Stuettgen", TITLE="The Role of Mobile {IP} in Future Mobile Communication Networks", BOOKTITLE="Eurescom Workshop on Mobility for all-IP Networks (MAIN)", MONTH="April 26-27", YEAR=2001, } @INPROCEEDINGS{Jona01:IP, AUTHOR="Karl Jonas and Marco Liebsch and others", TITLE="{IP-based} Mobile Communication", BOOKTITLE="5-th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2001): Invited Session on Mobile Networking beyond UMTS", ADDRESS="Orlando, USA", MONTH="July 22-25", YEAR=2001, } @TECHREPORT{Zand01:Reliable, AUTHOR="Victor Zandy and Barton P. Miller", TITLE="Reliable Sockets", INSTITUTION="Wisconsin University", YEAR=2001, } @INPROCEEDINGS{Leun01:Application, AUTHOR="Ka-Cheong Leung and Dan Shell and Will Ivancic and D. Stewart and T. L. Bell and B. A. Kachmar", TITLE="Application of {Mobile-IP} to Space and Aeronautical Networks", BOOKTITLE="IEEE Proceedings of the Aerospace Conference", ADDRESS="Big Sky, MT", VOLUME=2, PAGES="1027-1033", MONTH="Month", YEAR=2001, } @TECHREPORT{Typp01:Mobility, AUTHOR="Ville Typpo", TITLE="Mobility within Wireless Ad Hoc Networks: Towards Hybrid Wireless Multihop Networks", TYPE="Thesis", INSTITUTION="VTT Electronics and University of Oulu", YEAR=2001, } @ARTICLE{Neme01:Throughput, AUTHOR="Gabor Nemeth and Zoltán Richárd Turányi and Andras Valko", TITLE="Throughput of Ideally Routed Wireless Ad Hoc Networks", JOURNAL="Mobile Computing and Communications Review", VOLUME=5, NUMBER=4, PAGES="40-46", NOTE="October", YEAR=2001, } @INPROCEEDINGS{Wan01:Minimum, AUTHOR="Peng-Jun Wan and Gruia Calinescu and Xue Li and Ophir Frieder", TITLE="Minimum-energy Broadcast Routing in Static Ad Hoc Wireless Networks", BOOKTITLE="of IEEE INFOCOM", YEAR=2001, } @ARTICLE{Bink01:Authenticated, AUTHOR="Jim Binkley and William Trost", TITLE="Authenticated Ad Hoc Routing at the Link Layer for Mobile Systems", JOURNAL="Wireless Networks, Kluwer Academic Publishers", PAGES="139-145", YEAR=2001, } @INPROCEEDINGS{Chan01:Anonymous, AUTHOR="Ranveer Chandra and Venugopalan Ramasubramanian and Ken Birman", TITLE="Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks", BOOKTITLE="21st International Conference on Distributed Computing Systems, 2001", PAGES="275-283", YEAR=2001, } @INPROCEEDINGS{Obra01:Pushing, AUTHOR="Katia Obraczka and Gene Tsudik and Kumar Viswanath", TITLE="Pushing the Limits of Multicast in Ad Hoc Networks", BOOKTITLE="21st International Conference on Distributed Computing Systems, 2001", PAGES="719-722", YEAR=2001, } @INPROCEEDINGS{Deva01:MZR, AUTHOR="V. Devarapalli and D. Sidhu", TITLE="{MZR:} A Multicast Protocol for Mobile Ad Hoc Networks", BOOKTITLE="IEEE International Conference on Communications, ICC 2001", VOLUME=3, PAGES="886-891", YEAR=2001, } @ARTICLE{Krav01:Cooperative, AUTHOR="Robin Kravets and Casey Carter and Luiz Magalhaes", TITLE="A Cooperative Approach to User Mobility", JOURNAL="ACM Computer Communications Review", VOLUME=31, YEAR=2001, } @INPROCEEDINGS{Maga01:End, AUTHOR="Luiz Magalhaes and Robin Kravets", TITLE="End-to-End Inverse Multiplexing for Mobile Hosts", BOOKTITLE="The 19th Brazilian symposium on Computer Networks", ADDRESS="Florianapolis, Brazil", YEAR=2001, } @TECHREPORT{Krav01:Moving, AUTHOR="Robin Kravets", TITLE="Moving from Mobile Hosts to Mobile Networks", TYPE="Technical Report", INSTITUTION="Department of Computer Science, University of Illinois, Urbana-Champaign", NUMBER="UIUCDCS-R-2000-2166", YEAR=2001, } @INPROCEEDINGS{Soma01:Micromobility, AUTHOR="Joseph Soma-Reddy and S. Acampora Anthony", TITLE="Micromobility Strategies for {IP} Based Cellular Networks", BOOKTITLE="Thyrrhenian International Workshop on Digital Communications, IWDC 2001", SERIES="Lecture Notes in Computer Science", PUBLISHER="Springer", ADDRESS="Taormina, Italy", VOLUME=2170, PAGES="67-75", MONTH="September 17-20", YEAR=2001, } @INPROCEEDINGS{Hris01:IP, AUTHOR="Cristina Hristea and Fouad Tobagi", TITLE="{IP} Routing and Mobility", BOOKTITLE="Thyrrhenian International Workshop on Digital Communications, IWDC 2001", SERIES="Lecture Notes in Computer Science", PUBLISHER="Springer", ADDRESS="Taormina, Italy", VOLUME=2170, PAGES="279-294", MONTH="September 17-20", YEAR=2001, } @ARTICLE{Nasi01:Performance, AUTHOR="Asis Nasipuri and R. Castaneda and Sajal Das", TITLE="Performance of Multipath Routing for On-demand Protocols in Ad Hoc Networks", JOURNAL="ACM/Kluwer Mobile Networks and Applications (MONET)", VOLUME=6, NUMBER=4, PAGES="339-349", YEAR=2001, } @PHDTHESIS{Wood01:Internetworking, AUTHOR="Lloyd Wood", TITLE="Internetworking with Satellite Constellations", TYPE="PhD thesis", SCHOOL="University of Surrey", YEAR=2001, } @TECHREPORT{Clar01:Personal, AUTHOR="David D. Clark and John Wroclawski", TITLE="The Personal Router Whitepaper", INSTITUTION="MIT Laboratory for Computer Science", YEAR=2001, } @INPROCEEDINGS{Sant01:Making, AUTHOR="Cesar Santivanez and Ram Ramanathan and Ioannis Stavrakakis", TITLE="Making Link-State Routing Scale for Ad Hoc Networks", BOOKTITLE="ACM Mobihoc Conference", ADDRESS="Long Beach, CA", YEAR=2001, } @INPROCEEDINGS{Miu01:Dynamic, AUTHOR="Allen Miu and Paramvir Bahl", TITLE="Dynamic Host Configuration for Managing Mobility Between Public and Private Networks", BOOKTITLE="3rd USENIX Symposium on Internet Technologies and Systems", ADDRESS="San Francisco, California", MONTH="March 26-28", YEAR=2001, } @PHDTHESIS{Erns01:Le, AUTHOR="Thierry Ernst", TITLE="Le Support de Reseaux Mobiles dans {IPv6}", SCHOOL="INRIA Grenoble, Universite", YEAR=2001, ANNOTE="http://www.inria.fr/rrrt/tu-0714.html accessed July 9th, 2002", } @INPROCEEDINGS{Gwon01:Design, AUTHOR="Yongjune Lee Gwon", TITLE="Design and Performance of Mobile {IP} Predictive Handover with Network Layer Prediction", BOOKTITLE="IPCN 2001", MONTH="May 15-18", YEAR=2001, } @INPROCEEDINGS{Nika01:HARP, AUTHOR="Navid Nikaein and Christian Bonnet and Neda Nikaein", TITLE="{HARP} - Hybrid Ad Hoc Routing Protocol", BOOKTITLE="of International Symposium on Telecommunications, IST", ADDRESS="Tehran, Iran", YEAR=2001, } @ARTICLE{Liao01:GRID, AUTHOR="Wen-Hwa Liao and Jang-Ping Sheu and Yu-Chee Tseng", TITLE="{GRID:} A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks", JOURNAL="Telecommunication Systems", VOLUME=18, NUMBER="1--3", PAGES="37-60", YEAR=2001, } @MASTERSTHESIS{Liu01:Hybrid, AUTHOR="Yolanda Liu", TITLE="A Hybrid Forwarding Approach for the Mesh-based Geocast Routing Protocol in an Ad Hoc Network", SCHOOL="Colorado School of Mines", YEAR=2001, } @INPROCEEDINGS{Bole01:Mesh, AUTHOR="Jeff Boleng and Tracy Camp and Vishy Tolety", TITLE="Mesh-based Geocast Routing Protocols in an Ad Hoc Network", BOOKTITLE="IEEE International Workshop on Parallel and Distributed Computing Issues in Wireless NEtworks and Mobile Computing, IPDPS", YEAR=2001, } @INPROCEEDINGS{Chen01:SOM, AUTHOR="Yuh-Shyan Chen and Tzung-Shi Chen and Ching-Jang Huang", TITLE="{SOM:} Spiral-Fat-Tree Based On-Demand Multicast Protocol in a Wireless Ad-hoc Network", BOOKTITLE="15th International Conference on Information Networking", PAGES="17-24", YEAR=2001, } @INPROCEEDINGS{Lee01:Patchodmrp, AUTHOR="Meejang Lee and Ye Kyung Kim", TITLE="PatchODMRP: an Ad-hoc Multicast Routing Protocol", BOOKTITLE="15th International Conference on Information Networking", PAGES="537-543", YEAR=2001, } @INPROCEEDINGS{Wang01:Intelligent, AUTHOR="Kuochen Wang and Chou-Tang Chang", TITLE="An Intelligent On-Demand Multicast Routing Protocol in Ad Hoc Networks", BOOKTITLE="15th International Conference on Information Networking", PAGES="909-914", YEAR=2001, } @INPROCEEDINGS{Jian01:Performance, AUTHOR="Hang Jiang and J.J. Garcia-Luna-Aceves", TITLE="Performance Comparison of Three Routing Protocols for Ad hoc Networks", BOOKTITLE="Tenth International Conference on Computer Communications and Networks", PAGES="547-554", YEAR=2001, } @INPROCEEDINGS{Koub01:Fully, AUTHOR="Hend Koubaa and Eric Fleury", TITLE="A Fully Distributed Mediator Based Service Location Protocol in Ad Hoc Networks", BOOKTITLE="IEEE Clobal Telecommunications Conference, GLOBECOM'01", VOLUME=5, PAGES="2949-2953", YEAR=2001, } @INPROCEEDINGS{Fleu01:Performance, AUTHOR="Eric Fleury and Hend Koubaa", TITLE="A Performance Study of a Service Covering Protocol in Ad Hoc Networks", BOOKTITLE="Ninth IEEE International Conference on Networks", PAGES="87-92", YEAR=2001, } @INPROCEEDINGS{Diag01:Extension, AUTHOR="M. L. Diagne and Thomas Noel and Jean-Jacques Pansiot", TITLE="Extension of Service Location Protocol for {IPv6} Communication Mobility", BOOKTITLE="IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2001", VOLUME=2, PAGES="495-497", YEAR=2001, } @INPROCEEDINGS{Goff01:Preemptive, AUTHOR="Tom Goff and Nael Abu-Ghazaleh and D. Pathak and Ridvan Kahvecioglu", TITLE="Preemptive Routing in Ad Hoc Networks", BOOKTITLE="of ACM MobiCom", YEAR=2001, } @INPROCEEDINGS{Brow01:Optimal, AUTHOR="Timothy Brown and Sheetalkumar Doshi and Qinqing Zhang", TITLE="Optimal Power Aware Routing in a Wireless Ad Hoc Network", BOOKTITLE="IEEE LANMAN", PAGES="102-105", YEAR=2001, } @INPROCEEDINGS{Chen01:SPAN, AUTHOR="Biao Chen and Kyle A. Jamieson and Hari Balakrishnan and Robert Morris", TITLE="{SPAN:} An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks", BOOKTITLE="of MOBICOM", YEAR=2001, } @INPROCEEDINGS{Fenn01:Investigating, AUTHOR="L. Fenney and Martin Nilsson", TITLE="Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment", BOOKTITLE="IEEE INFOCOM", YEAR=2001, } @INPROCEEDINGS{Li01:Online, AUTHOR="Qinghua Li and Javed Aslam and Daniela Rus", TITLE="Online Power-aware Routing in Wireless Ad-Hoc Networks", BOOKTITLE="of MOBICOM", YEAR=2001, } @INPROCEEDINGS{Torn01:Design, AUTHOR="Audun Tornquist and Michael Neufeld and Dirk Grunwald", TITLE="The Design of a Modular Implementation of Ad Hoc Routing Protocols", BOOKTITLE="Submitted to INFOCOM 2001", YEAR=2001, } @INPROCEEDINGS{Xu01:Geography, AUTHOR="Youshi Xu and John Heidemann and Deborah Estrin", TITLE="Geography-informed Energy Conservation for Ad Hoc Routing", BOOKTITLE="of MOBICOM", YEAR=2001, } @INPROCEEDINGS{Mari01:Multipath, AUTHOR="Mahesh Marina and Sajal Das", TITLE="On-demand Multipath Distance Vector Routing in Ad Hoc Networks", BOOKTITLE="of IEEE International Conference on NEtwork Protocols, ICNP", PAGES="14-23", YEAR=2001, } @INPROCEEDINGS{Barr01:Robust, AUTHOR="L. Barriere and others", TITLE="Robust Position Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges", BOOKTITLE="5th ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications", PAGES="19-27", YEAR=2001, } @ARTICLE{Stoj01:Loop, AUTHOR="Ivan Stojmenovic and Xu Lin", TITLE="Loop-free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks", JOURNAL=ieeepds, VOLUME=12, NUMBER=10, PAGES="1023-1032", YEAR=2001, } @ARTICLE{Stoj01:Power, AUTHOR="Ivan Stojmenovic and Xu Lin", TITLE="Power-Aware Localized Routing in Wireless Networks", JOURNAL=ieeepds, VOLUME=12, NUMBER=11, PAGES="1122-1133", YEAR=2001, } @INPROCEEDINGS{Garc01:Quality, AUTHOR="J. Antonio Garcias-Macias and Franck Rousseau and Gilles Berger-Sabbatel and Leyla Toumi and Andrzej Duda", TITLE="Quality of Service and Mobility for the Wireless {Internet}", BOOKTITLE="First ACM Wireless Mobile Internet Workshop", ADDRESS="Rome, Italy", YEAR=2001, } @ARTICLE{Fiko01:Performance, AUTHOR="N. Fikouras and C. Gorg", TITLE="Performance Comparison of Hinted- and Advertisement-based Movement Detection for Mobile {IP} Handoffs", JOURNAL=cn, YEAR=2001, } @BOOK{Toh01:Ad, AUTHOR="Ck Toh", TITLE="Ad Hoc Mobile Wireless Networks: Protocols and Systems", PUBLISHER="Pearson Education", YEAR=2001, } @INBOOK{LoWa_TelSys2001, AUTHOR="Matthias Lott and B. Walke", TITLE="Performance analysis of a wireless ad hoc network with {QoS} support", BOOKTITLE="Telecommunication Systems", VOLUME=16, PAGES="115-134", YEAR=2001, ABSTRACT="A wireless ad hoc multihop network is introduced and protocols for the air interface are described and evaluated. Ad hoc networks can be realized due to the ability of stations to route connections according to the current meshing of the network. The decentrally organized network is able to guarantee the bandwidth contracted to a connection in a hidden station environment by means of contention-free data transmission, for both cannel and packet switched services, based on real channel connections. Channels are established and used for the duration of a so called train of data packets, released when the train ends and re-established when the next train arrives. To guarantee available capacity of the network for the re-establishment of a connection and to guarantee the quality of service needed for a wireless extension of a fixed ATM network, connection admission control is applied considering the overall interference situation and the current meshing of the stations in the network.\n For the purpose of realistic and reliable performance analysis a simulation tool appropriate for the investigation of the proposed network is introduced, and performance results for the proposed protocols are given by means of event-driven simulation studies in example scenarios. the simulated protocols have been formally specified in SDL, translated to C++, and embedded into a simulation environment", ANNOTE="System Analysis, Ad hoc, Multihop, Self-organizing network, Decentral control", } @INPROCEEDINGS{Sinh01:Enhancing, AUTHOR="Prasun Sinha and Raghupathy Sivakumar and V. Bjarghavan", TITLE="Enhancing Ad-Hoc Routing with Dynamic Virtual Infrastructures", BOOKTITLE="of IEEE INFOCOM", YEAR=2001, } @INPROCEEDINGS{Bhar01:Security, AUTHOR="S. Bhargava and Dakshi Agrawal", TITLE="Security Enhancements in {AODV} Protocol for Wireless Ad Hoc Networks", BOOKTITLE="of Vehicular Technology Conference", YEAR=2001, } @INPROCEEDINGS{Rama01:Comparison, AUTHOR="Ramu Ramamurthy and Sudipta Sengupta and Sid Chaudhuri", TITLE="Comparison of Centralized and Distributed Provisioning in Optical Neworks", BOOKTITLE="Optical Fiber Communications", ORGANIZATION="IEEE", YEAR=2001, LANGUAGE="English", ABSTRACT="This paper compares centralized and distributed online provisioning approaches in optical networks. In the centralized approach, complete network state is available for path computation. In the distributed approach, summmarized information is available for path computation.", } @INPROCEEDINGS{Seng01:Capacity, AUTHOR="Sudipta Sengupta and Ramu Ramamurthy", TITLE="Capacity Efficient Distributed Routing of Mesh-Restored Lightpaths in Optical Networks", BOOKTITLE=globecom, YEAR=2001, LANGUAGE="English", } @INBOOK{Elli01:Advances, AUTHOR="Georgios Ellinas and Krishna Bala", TITLE="Advances in Optical Networks", CHAPTER=2, PUBLISHER="Kluwer Academic Publishers", PAGES="19-46", YEAR=2001, LANGUAGE="English", } @ARTICLE{Hust01:Scaling, AUTHOR="Geoff Huston", TITLE="Scaling Inter-Domain {RoutingA} View Forward", JOURNAL=ipj, VOLUME=4, NUMBER=4, YEAR=2001, LANGUAGE="English", REFERENCES=4, ABSTRACT={In the previous IPJ article, "Analyzing the Internet BGP Routing Table," (Vol. 4, No. 1, March 2001) we looked at the characteristics of the growth of the routing table in recent years. The motivation for this work is to observe aspects of the Internet routing table in order to understand the evolving structure of the Internet and thereby attempt to predict some future requirements for routing technology for the Internet.}, URL="http://www.cisco.com/warp/public/759/ipj\_4-4/ipj\_4-4\_scaling.html", } @ARTICLE{Yuen01:Hybrid, AUTHOR="Wing Ho Yuen and Wing Wong", TITLE="A Hybrid Contention Free Location Update Strategy with Probabilistic Paging for {PCS}", JOURNAL=ieeevt, YEAR=2001, LANGUAGE="English", } @PROCEEDINGS{Mars01:Petri, AUTHOR="M. Ajmone Marsan and M.Gribaudo and M.Meo and M.Sereno", TITLE="On Petri Net-based Modeling Paradigms for the Performance Analysis of Wireless {Internet} Access", ORGANIZATION="International Workshop on Petrinet and Performance Models", PUBLISHER="IEEE", YEAR=2001, LANGUAGE="English", ABSTRACT="Abstract: In this paper we model a wireless Internet access system based on the GSM/GPRS (Global System for Mobile communications/General Packet Radio Service) technology, with three different Petri net-based paradigms: Generalized Stochastic Petri Nets (GSPNs), Deterministic and Stochastic Petri Nets (DSPNs), and Fluid Stochastic Petri Nets (FSPNs). We show that all three Petri net-based paradigms provide very similar performance predictions for some of the considered realistic configurations of GSM/GPRS systems, and for some of the performance metrics of interest. This proves that FSPNs can be an adequate tool for the performance analysis of wireless Internet access systems, and allow the investigation of large system configurations, thanks to the availability of very efficient solution algorithms for FSPN models. However, we also show that in other cases (which can be clearly characterized), the performance predictions generated by FSPN models may become quite optimistic, and thus not suitable for a careful design and planning of GSM/GPRS systems. In those cases, both DSPNs and GSPNs can provide a viable modeling alternative, at least in the case of medium scale systems.", } @ARTICLE{Kaly01:Use, AUTHOR="Shivkumar Kalyanaraman and Raj Jain and Rohit Goyal and Sonia Fahmy and Seong-Cheol Kim", TITLE="Use-it or Lose-it Policies for the Available Bit Rate {(ABR)} Service in {ATM} Networks", JOURNAL=cnis, MONTH=jan, YEAR=2001, ABSTRACT="The Available Bit Rate (ABR) service has been developed to support 21st century data applications over Asynchronous Transfer Mode (ATM). The ABR service uses a closed-loop rate-based traffic management framework where the network divides left-over bandwidth among contending sources. The ATM Forum traffic management group also incorporated open-loop control capabilities to make the ABR service robust to temporary network failures and source inactivity. An important problem addressed was whether rate allocations of sources should be taken away if sources do not use them. The proposed solutions, popularly known as the Use-It-or-Lose-It (UILI) policies, have had significant impact on the ABR service capabilities. In this paper we discuss the design, development, and the final shape of these policies and their impact on the ABR service. We compare the various alternatives through a performance evaluation.", URL="http://www.cis.ohio-state.edu/~jain/papers/uili.htm", } @ARTICLE{Lupu0101:Selected, AUTHOR="Emil Lupu and Subrata Mazumdar and Rolf Stadler", TITLE="Selected topics in network and systems management", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="1-4", MONTH=jan, YEAR=2001, URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Bhoj0101:SLA, AUTHOR="P. Bhoj and Sharad Singhal and S. Chutani", TITLE="{SLA} management in federated environments", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="5-24", MONTH=jan, YEAR=2001, KEYWORDS="federated management; service level agreements; system monitoring", ABSTRACT="Increasingly, Internet services are being deployed over an infrastructure that spans multiple control domains. These services require cooperation between multiple organizations, systems and entities. Currently, few standard mechanisms exist to share selective management information between the various service providers or between service providers and their customers. Such mechanisms are necessary for end-to-end service management and diagnosis as well as for ensuring the service level obligations between a service provider and its customers or partners. This paper describes an architecture that uses contracts based on service level agreements (SLAs) to share selective management information across administrative boundaries. The design of a prototype implementation for automatically measuring, monitoring, and verifying service level agreements for Internet services is also described.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Feri0101:Framework, AUTHOR="M. Feridun and Jens Krause", TITLE="A framework for distributed management with mobile components", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="25-38", MONTH=jan, YEAR=2001, KEYWORDS="distributed management; code mobility; mobile agents; active network management", ABSTRACT="The increasing importance of networks and the growing numbers of devices and services that run on them necessitate effective network and systems management. The traditional centralized management paradigm alone is no longer sufficient for effective management solutions, primarily as it does not scale well. Distribution of management tasks is a promising approach. The distributed management framework (DMF) presented in this paper provides an environment that allows a broad range of management tasks to move and run anywhere within the managed system. In our approach, management tasks are lightweight applications that can be configured and downloaded dynamically as required, reducing the load on managed resources and simplifying the problem of management software updates. We present an object-oriented, Java-based implementation of the DMF and describe applications developed on this platform.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Schn0101:Secure, AUTHOR="J’rgen Sch÷nw„lder and J’rgen Quittek", TITLE="Secure {Internet} management by delegation", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="39-56", MONTH=jan, YEAR=2001, KEYWORDS="network management; internet management; scripting; management by delegation; security; safety; java", ABSTRACT="The IETF Script management information base (MIB) integrates the management by delegation (MbD) model into the Internet management framework. This paper discusses the security aspects of the Script MIB concerning MIB access security and runtime security of delegated management functions. The paper shows how SNMPv3 security mechanisms have been utilized to protect the Script MIB from unauthorized access. A prototype implementation is presented using the Java virtual machine as a runtime system for delegated management functions. The prototype demonstrates how solutions to all security aspects can be integrated.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Flor0101:QoSockets, AUTHOR="Patricia Florissi and Yechiam Yemini and Danilo Florissi", TITLE="QoSockets: a new extension to the sockets {API} for end-to-end application {QoS} management", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="57-76", MONTH=jan, YEAR=2001, KEYWORDS="QoS management; application management", ABSTRACT="The key question addressed by this paper is how multimedia applications can adapt to the QoS delivered by the network and vice versa. QoSockets is an extension to the sockets mechanism, to enable QoS reservation and management. QoSockets automatically generates the instrumentation to monitor QoS. QoSockets mediates interactions among applications and transport protocols, and collects in QoS MIBs statistics on the QoS delivered. The main advantages are: support of single API for transport layer QoS negotiation, connection establishment, and data transmission; support of a single QoS negotiation protocol; generality across application QoS needs; and automatic management of application QoS needs.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Hell0101:Statistical, AUTHOR="Joseph Hellerstein and Fan Zhang and Perwez Shahabuddin", TITLE="A statistical approach to predictive detection", JOURNAL=cnis, VOLUME=35, NUMBER=1, PAGES="77-95", MONTH=jan, YEAR=2001, KEYWORDS="proactive management; time series model; prediction", ABSTRACT={Service providers typically define quality of service problems using threshold tests, such as "Are HTTP operations greater than 12 per second on server XYZ?" Herein, we estimate the probability of threshold violations for specific times in the future. We model the threshold metric (e.g., HTTP operations per second) at two levels: (1) non-stationary behavior (as is done in workload forecasting for capacity planning) and (2) stationary, time-serial dependencies. Our approach is assessed using simulation experiments and measurements of a production Web server. For both assessments, the probabilities of threshold violations produced by our approach lie well within two standard deviations of the measured fraction of threshold violations.}, URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Schm0101:Aggregation, AUTHOR="Jens Schmitt and Martin Karsten and Ralf Steinmetz", TITLE="On the aggregation of deterministic service flows", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="2-18", MONTH=jan, YEAR=2001, ABSTRACT="It is common belief that", } @ARTICLE{Li0101:Selective, AUTHOR="Na Li and Sehyun Park and Shuo-Yen Robert Li", TITLE="A selective attenuation feedback mechanism for rate oscillation avoidance", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="19-34", MONTH=jan, YEAR=2001, KEYWORDS="Rate oscillation; Flow diversity; Feedback overhead; Differentiated service; Fairness", ABSTRACT="We have studied the delay-related rate oscillation within Diffserv. The rate oscillation can come from large round trip latency. Enforcing low feedback overhead can also cause the rate oscillation. The Selective Attenuation Feedback via Estimation (SAFE) is proposed to reduce the oscillation while maintaining fast response to network dynamics. SAFE has no per-flow accounting. Furthermore, the hashing technique is adopted to keep the operating overhead of SAFE to its minimum. System analysis supports the effectiveness of SAFE. Simulation result also shows that SAFE significantly reduces rate oscillation, therefore achieves high link utilization and small queue size while maintaining very low control overhead.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/26/abstract.html", } @ARTICLE{Yeom0101:Marking, AUTHOR="Ikjun Yeom and A. Reddy", TITLE="Marking for {QoS} improvement", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="35-50", MONTH=jan, YEAR=2001, KEYWORDS="Differentiated service; Aggregation; Quality of service; Packet marking strategies; Sender; Receiver QoS", ABSTRACT="Differentiated services architecture is receiving wide attention as a framework for providing different levels of service in the Internet. Current architecture allows customers to mark their packets and the network provider to check them for conformance to service contracts. This paper looks at the problem of achieving specific QoS goals of individual flows by flexibly managing resources available to an aggregated source. The paper shows that an aggregated source can maintain state of individual flows at the edge of the network and utilize this state effectively in adaptively marking packets of individual flows to meet their QoS goals. The paper also proposes a simple scheme for improving the service provided to a receiving-intensive application by transferring resources to the edge of the network on the sender's side. The paper studies the impact of these sender's side marking strategy and the receiver's willingness to pay for resources in achieving QoS goals of individual flows.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/27/abstract.html", } @ARTICLE{Zhu0101:Weighted, AUTHOR="Haifeng Zhu and Aimin Sang and Shuo-Yen Robert Li", TITLE="Weighted fair bandwidth sharing using {SCALE} technique", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="51-63", MONTH=jan, YEAR=2001, ABSTRACT="Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal Max-Min weighted fairness without per-flow management at core routers, in the context of differentiated service (Diffserv) networks. Through extensive simulation and simple analysis, we show the performance problems with current solutions and propose SCALE-WFS to solve these problems. This scheme works effectively for different flow weights, RTTs, protocols (TCP and UDP), under the scenarios of different bandwidth provisioning and multiple congested gateways, all of which we consider the basic requirements for a practical solution. Apart from", } @ARTICLE{Park0101:QoS, AUTHOR="Kihyun Park and W. Wang", TITLE="QoS-sensitive transport of real-time {MPEG} video using adaptive redundancy control", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="78-92", MONTH=jan, YEAR=2001, KEYWORDS="Adaptive redundancy control; Quality of service; Forward error correction; Real-time MPEG video", ABSTRACT="This paper presents an adaptive end-to-end protocol for quality of service (QoS)-sensitive transport of real-time MPEG video using packet-level forward error correction in dynamic networks. The objective is to facilitate a user-specified QoS end-to-end i.e. without special network support for real-time MPEG video whose timing constraints rule out the use of retransmission-based congestion control and QoS provisioning schemes. The degree of redundancy overcode in forward error correction injected into the network is adjusted as a function of network state, decreasing when the network is well-behaved to minimize unnecessary network resource consumption, and increasing when it is not to compensate for adverse network effects so as to maintain an invariant level of end-to-end QoS. We describe an adaptive packet-level forward error correction protocol called AFEC and analyze its properties with respect to optimality and stability. The optimal control problem is nontrivial due to the fact that increased redundancy, beyond a certain point, can backfire resulting in self-induced congestion which impedes the timely recovery of information MPEG video frames at the receiver. We experimentally evaluate the efficacy of our end-to-end QoS control by implementing and customizing AFEC to the transport of real-time MPEG video. We realize the system as a transport/application layer protocol running on UNIX workstations, and measure its performance over controlled network environments. We show that AFEC is able to effectively hide potentially adverse network effects such as packet drops and delays stemming from traffic burstiness and nonstationary structural changes using adaptive redundancy control, exporting a constant QoS service commensurate with user-specified QoS.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/30/abstract.html", } @ARTICLE{Jeon0101:QoS, AUTHOR="Sangjin Jeong and Henry Owen and John Copeland and Jr. Sokol", TITLE="{QoS} support for {UDP/TCP} based networks", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="64-77", MONTH=jan, YEAR=2001, KEYWORDS="QoS provisioning; Queue policy; Resource reservation; Router-based QoS", ABSTRACT="To support UDP-based real-time applications over the Internet, it is necessary to provide bandwidth to the UDP applications within the network so that the performance of the UDP applications will not be seriously affected during periods of congestion. UDP flows do not typically back off when they encounter congestion. Thus, UDP flows aggressively use up more bandwidth than TCP friendly flows. Therefore, while it is important to have router algorithms support UDP flows by assigning appropriate bandwidth, it is also necessary to protect responsive TCP flows from unresponsive or aggressive UDP flows so that all users get a reasonable quality of service (QoS). In this paper, we propose a set of router-based QoS mechanisms including queue policy, resource reservation, and metering. These router-based QoS mechanisms provide rate guarantees to UDP flows, protection of well-behaved TCP flows from unresponsive UDP flows, and bandwidth fairness between TCP flows.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/29/abstract.html", } @ARTICLE{Dika0101:Content, AUTHOR="M. Dikaiakos and A. Stassopoulou", TITLE="Content-selection strategies for the periodic prefetching of {WWW} resources via satellite", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="93-104", MONTH=jan, YEAR=2001, KEYWORDS="Web caching; Satellite multicasting; Content selection; Quality of service; Pricing", ABSTRACT="In this paper we study satellite-caching, that is, the employment of satellite multicasting for the dissemination of prefetched content to WWW caches. This approach is currently being deployed by major satellite operators and ISPs around the world. We introduce a theoretical framework to study satellite-caching and formalize the notions of Utility and Quality of Service. We explore two charging schemes, Usage- and Subscription-based pricing, and propose a framework for negotiating the provision of the satellite-caching service between a satellite operator and its potential clients. We use this negotiation framework to compare theoretically the two pricing schemes at hand. We apply our modeling to formulate the selection of Web-content for satellite-multicasting as a combinatorial optimization problem. We study the complexity of Web-content selection and prove it is NP-complete. Finally, we propose and implement an approximation algorithm for content selection, and conduct experiments to assess its efficiency, validity and applicability.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/31/abstract.html", } @ARTICLE{Kon0101:Using, AUTHOR="F. Kon and R. Campbell and Klara Nahrstedt", TITLE="Using dynamic configuration to manage a scalable multimedia distribution system", JOURNAL=comcom, VOLUME=24, NUMBER=1, PAGES="105-123", MONTH=jan, YEAR=2001, KEYWORDS="Multimedia distribution; Dynamic configuration; Middleware; CORBA; QoS-aware resource management", ABSTRACT="Multimedia applications and interfaces will change radically the way computer systems will look like in the coming years. Radio and TV broadcasting will assume a digital format and their distribution networks will be integrated to the Internet. Existing hardware and software infrastructures, however, are unable to provide all the scalability, flexibility, and quality of service (QoS) that these applications require. We present a framework for building scalable and flexible multimedia distribution systems that greatly improves the possibilities for the provision of quality of service in large-scale networks. We show how to use architectural-awareness, mobile agents, and a CORBA-based framework to support dynamic (re)configuration, efficient code distribution, and fault-tolerance. This approach can be applied not only for multimedia distribution, but also for any QoS-sensitive distributed application.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/32/abstract.html", } @ARTICLE{Schu0101:Internet, AUTHOR="Henning Schulzrinne", TITLE="{Internet} Telefonie -- Mehr als nur ein Telefon mit Paketvermittlung", JOURNAL=pik, VOLUME=24, NUMBER=1, MONTH=jan, YEAR=2001, KEYWORDS="Internet telephony", URL="http://www.cs.columbia.edu/~hgs/papers/Schu0101\_Einfuhrung.pdf", } @ARTICLE{Part0101:Improving, AUTHOR="Chiang Lee and Chih-Horng Ke and Chao-Chun Chen", TITLE="Improving location management for mobile users with frequently visited locations", JOURNAL=pe, VOLUME=43, NUMBER=1, PAGES="1-14", MONTH=jan, YEAR=2001, KEYWORDS="Transient analysis; Tridiagonal determinants; Blocking probabilities", ABSTRACT="Most of the real-time applications involve connection establishment in point-to-point (unicast) communication in computer networks that can be modelled as a problem of resource allocation and resource sharing. These applications have different streams, such as video, voice, graphics, etc., each having different arrival rates. A stream (call) will be admitted into the network only if the network guarantees the `Quality of Service' (QoS) parameters of the call such as bandwidth, delay, jitter and loss probability. Otherwise, the call is rejected. Hence, the study of call blocking probabilities in such communication networks is a problem of growing importance. Application of queueing theory to solve these problems has received considerable attention in the research community. Due to the real-time nature of the applications, it is pertinent to study the time-dependent behaviour of such systems. In this paper, a real-time unicast communication has been modelled as a multi-dimensional Markov process to obtain the time-dependent blocking probabilities. The time-dependent system size probabilities, means, variances and correlation coefficients of different streams are also obtained.", URL="http://www.elsevier.nl/gej-ng/10/35/22/48/22/22/article.pdf", } @ARTICLE{Fern0101:Connection, AUTHOR="Huei-Wen Ferng and Jin-Fu Chang", TITLE="Connection-wise end-to-end performance analysis of queueing networks with {MMPP} inputs", JOURNAL=pe, VOLUME=43, NUMBER=1, PAGES="39-62", MONTH=jan, YEAR=2001, LANGUAGE="English", KEYWORDS="MMPP; Queueing network; Output process characterization; End-to-end performance analysis", ABSTRACT="A systematic method for link/connection-wise end-to-end performance evaluation in queueing networks receiving heterogeneous Markov-modulated Poisson processes (H-MMPPs) is proposed. The method consists of (i) connection-wise nodal performance analysis; (ii)tagged departure process analysis; and (iii) moment matching. For the tagged departure process of an H-MMPPs/G/1 queue, we propose two decomposition schemes to approximate the output process of a tagged traffic stream which is mixed with other traffic streams. A moment matching method is further proposed to emulate the tagged output process as a two-state MMPP. The adjacent down-stream node along a reference connection can be then modeled as an H-MMPPs/G/1 queue. Recursively performing (i)-(iii), the end-to-end performance of a reference connection is obtained. The methodology developed in this paper can be applied to packet-switched high-speed networks, especially to asynchronous transfer mode (ATM) networks.", URL="http://www.elsevier.nl/gej-ng/10/35/22/48/22/24/article.pdf", } @TECHREPORT{Cisc01:Migrating, AUTHOR="{Cisco Systems}", TITLE="Migrating to Multiservice Networks - A Planning Primer", INSTITUTION="Cisco", MONTH=jan, YEAR=2001, KEYWORDS="busy hour load; IP telephony; packet voice; dimensioning; traffic engineering", ABSTRACT="This planning guide reviews the decisions to consider when evolving data-only networks toward a more robust multiservice infrastructure that can include data, voice, and video traffic.", URL="http://www.cisco.com/warp/public/cc/pd/rt/2600/tech/st10\_wp.htm", } @ARTICLE{Emil0101:Web, AUTHOR="Emilia Mendes and Nile Mosley and Steve Counsell", TITLE="Web Metrics--Estimating Design and Authoring Effort", JOURNAL=ieeemm, VOLUME=8, NUMBER=1, MONTH=jan, YEAR=2001, ABSTRACT="Like any software process, Web application development would benefit from early-stage effort estimates. Using an undergraduate university course as a case study, the authors collected metrics corresponding to Web applications, developers, and tools. Then they used those metrics to generate models for predicting design and authoring effort for future Web applications.", URL="http://www.computer.org/multimedia/mu2001/u1toc.htm", } @ARTICLE{Schl0101:Scalable, AUTHOR="Julie Schlembach and Anders Skoe and Ping Yuan and Edward W. Knightly", TITLE="Design and Implementation of Scalable Admission Control", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="1-15", MONTH=jan, YEAR=2001, REFERENCES=12, ABSTRACT="While the IntServ solution to Internet QoS can achieve a strong service model that guarantees flow throughputs and loss rates, it places excessive burdens on high-speed core routers to signal, schedule, and manage state for individual flows. Alternatively, the DiffServ solution achieves scalability via aggregate control, yet cannot ensure a particular QoS to individual flows. To simultaneously achieve scalability and a strong service model, we have designed and implemented a novel architecture and admission control algorithm termed Egress Admission Control. In our approach, the available service on a network path is passively monitored, and admission control is performed only at egress nodes, incorporating the effects of cross traffic with implicit measurements rather than with explicit signaling. In this paper, we describe our implementation of the scheme on a network of prototype routers enhanced with ingress-egress path monitoring and edge admission control. We report the results of testbed experiments and demonstrate the feasibility of an edge-based architecture for providing IntServ-like services in a scalable way.", URL="http://link.springer.de/link/service/series/0558/bibs/1989/19890001.htm", } @ARTICLE{Bern0101:Connection, AUTHOR="Giulia Bernardini and Stefano Giordano and Gregorio Procissi and Sandra Tartarelli", TITLE="Analysis and Performance Evaluation of a Connection Admission Control Scheme Based on the Many Sources Asymptotic", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="17-31", MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="A parsimonious traffic characterisation allows the design of efficient measurement based Connection Admission Control (CAC) algorithms. In recent years the notion of effective bandwidth (EB) has been successfully employed to quantify the amount of bandwidth to allot a connection in order to meet its Quality of Service (QoS) requirements. The EB function depends on two parameters, namely the time scale and the space scale, whose values represent the link operating point and they are related to the link capacity, the buffer size and the traffic mix. In this paper we present a study of the Many Sources Asymptotic (MSA), a Large Deviations technique that employs the notion of EB to evaluate the performance of a queueing system. Since the MSA requires to determine the time and space parameters, we firstly analysed their sensitivity to the variation of the traffic mix. We subsequently applied the results of this analysis to the refinement of a CAC algorithm based on the MSA, by using suitable thresholds for bounding the smallest mix variation beyond which a new estimation of the link operating point is required. Finally, we compared the performance of a CAC algorithm employing first the MSA then the Large Buffer Asymptotic (LBA) to estimate the bandwidth requirement of the active calls.", URL="http://link.springer.de/link/service/series/0558/bibs/1989/19890017.htm", } @ARTICLE{Boll0101:Call, AUTHOR="Raffaele Bolla and Franco R Davoli and Mario Marchese and Marco Perrando", TITLE="Call Admission Control and Routing of QoS-Aware and Best-Effort Flows in an {IP-over-ATM} Networking Environment", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="33-49", MONTH=jan, YEAR=2001, REFERENCES=20, ABSTRACT="In the context of an IP-over-ATM access and transport network, carrying guaranteed quality (CBR, rt-VBR) services as well as IP datagrams (as ABR or UBR traffic classes), we consider the joint problems of Call Admission Control (CAC), bandwidth allocation and routing. The presence of distributed access multiplexers is assumed, which are both geographically dispersed (e.g., at the user premises) and hierarchically structured. Such multiplexers are intelligent devices with decision making capabilities that operate jointly, in order to make the best possible use of the transport capacity of the access network and to maintain the Quality of Service (QoS) requirements of different users and service classes. Following the physical system organization, a hierarchical control structure is defined, where the admission of calls for real-time traffic classes (or different users) is performed by independent controllers; the latter are parametrized by the bandwidths allocated by a common link agent, playing the role of a ``link coordinator'' in the hierarchical control scheme. This decision maker aims at minimizing a general cost that captures QoS requirements both at the call-level (call blocking probability) for QoS-aware, connection-oriented services and at the cell-level (cell loss probability) for connectionless, best-effort, ones. The control architecture also reflects the multilayer hierarchy introduced by the presence of multiple teletraffic time scales, by essentially decoupling the above problem from that of ensuring QoS at the cell-level for services of the first type. We derive the optimal parameters' setting from the numerical solution of a mathematical programming problem. Then, the same structure is applied to link multiplexers of the transport network nodes, which are supposed to possess both ATM and IP switching/routing capabilities. Routing strategies at both ATM and IP levels are defined, which are combined with the above described CAC and bandwidth allocation scheme. The performance of the whole structure is tested by simulation.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890033.pdf", } @ARTICLE{List0101:Upper, AUTHOR="Marco Listanti and Fabio Ricciato and Stefano Salsano", TITLE="An Upper Bound to the Loss Probability in the Multiplexing of Jittered Flows", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="51-66", MONTH=jan, YEAR=2001, REFERENCES=7, ABSTRACT={In the context of Diffserv networks some services should be characterized by end-to-end quantitative QoS guarantees. In order to provide such guarantees to single flows (or flow aggregates), the end-to-end analysis of de-lay and loss performance in a Diffserv domain is needed. The impact of jitter should be considered in the performance analysis at the successive nodes along the path of a flow (flow aggregate). Worst-case analysis is a solution to provide deterministic quantitative guarantees, at the price of very low efficiency. As an alternative this paper proposes a probabilistic approach, aimed at providing statistical quantitative guarantees and achieve higher efficiency. The proposed analytical approach is based on the insertion of a discarding device before the FIFO queue, called "dropper". The purpose of the dropper is to avoid the analysis of the congestion at the burst level in the queue, allowing for the application of an analytical result derived for packet scale conflicts in the modulated ND/D/1 queue. Simulations are presented that validate the analytical bound. Finally numerical results are provided to evaluate the efficiency of the bound in an admission control scheme.}, URL="http://link.springer.de/link/service/series/0558/papers/1989/19890051.pdf", } @ARTICLE{Vutu0101:SMART, AUTHOR="Srinivas Vutukury and Jose J. Garcia-Luna-Aceves", TITLE="{SMART:} A Scalable Multipath Architecture for Intra-domain {QoS} Provisioning", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="67-79", MONTH=jan, YEAR=2001, REFERENCES=22, ABSTRACT="The main concern with the IETF proposed Intserv architecture is that the use of per-flow routing and reservation state in the routers may not be scalable to high-speed backbone networks. This paper proposes the Scalable Multipath Aggregated RouTing (SMART) architecture that aggregates flows along multipaths such that the per-flow reservation state in the routers is reduced to a small scalable aggregated state whose size is dependent only on the number of destinations and flow classes. The SMART architecture can be implemented in current IP networks and the complexity is similar to the best-effort IP architecture.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890067.pdf", } @ARTICLE{Davo0101:Definition, AUTHOR="Franco R Davoli and Daniele Luscardo and Piergiulio Maryni and Angelo Pietra", TITLE="Definition and Experimental Evaluation of an Architecture for Joint Quality of Service Control in Multimedia Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="81-95", MONTH=jan, YEAR=2001, REFERENCES=28, ABSTRACT="We introduce a control architecture in which several (independent) multimedia clusters share the same (local or metropolitan) networking resources in a controlled framework. In particular, a central entity (i.e., the Gatekeeper) harmonizes the transmission rates of the various clusters following a given sharing policy. Each cluster, in turn, adopts its own end-to-end rate control mechanism to meet the Gatekeeper's transmission rate indications. A testbed has been developed and the system has been evaluated with real experiments by using different types of transmission sources. A software architecture is also introduced and described, with particular reference to the middleware framework realized with the Jini system.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890081.pdf", } @ARTICLE{Bore0101:Quality, AUTHOR="Andrea Borella and Giovanni Cancellieri and Elena Pagani and Gian Paolo Rossi", TITLE="Quality-of-Service Guarantees for Multicast Traffic in Heterogeneous Multi-service Networks*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="97-112", MONTH=jan, YEAR=2001, REFERENCES=16, ABSTRACT="Multimedia and real-time applications have peculiar requirements in terms of the quality of data transmission services, that are not satisfied by the best effort nature of IP. Moreover, many of the multimedia applications are characterized by a multicast communication pattern. In this work, we propose a functional architecture aiming at providing a common framework to deploy network protocols supporting QoS. The architecture is compliant with the main standards proposed in the literature. We discuss two possible implementations of the architecture modules for the service set-up, in either the int-serv model or the diff-serv model. We present some performance evaluations obtained by performing experiments with those two implementations.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890097.pdf", } @ARTICLE{Gerl0101:Resource, AUTHOR="Mario Gerla and Claudio E. Casetti and Scott Seongwook Lee and Gianluca Reali", TITLE="Resource Allocation and Admission Control Styles in {QoS} DiffServ Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="113-128", MONTH=jan, YEAR=2001, REFERENCES=20, ABSTRACT="In this paper we propose a DiffServ architecture for the support of real time traffic (e.g., video) with QoS constraints (e.g., bandwidth and delay) over an IP domain. The main goal of the paper is to identify solutions which provide QoS guarantees without requiring per flow processing in the core routers (as is commonly done in IntServ solutions) and which are thus scalable. We propose, and evaluate through simulation, different approaches for call admission control (CAC) and resource allocation. These approaches are all consistent with the DiffServ model, but place different processing and signaling loads on edge and core routers. Paths are computed by means of a QoS routing algorithm, Q-OSPF, and MPLS is used to handle explicit routing and class separation.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890113.pdf", } @ARTICLE{Paga0101:Multicast, AUTHOR="Elena Pagani and Gian Paolo Rossi and Dario Maggiorini", TITLE="A Multicast Transport Service with Bandwidth Guarantees for Diff-Serv Networks*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="129-140", MONTH=jan, YEAR=2001, REFERENCES=18, KEYWORDS="Quality-of-Service; multicast; call admission control; diff-serv domains; bandwidth broker; performance evaluation.", ABSTRACT="The Int-Serv and Diff-Serv differentiation approaches, which have been proposed by the IETF, are in practice unable to provide QoS guarantees to the emerging multicast-enabled applications by means of a scalable mechanism able to support QoS services on a per-call basis and dynamic group memberships. This paper describes a new approach that is capable of ensuring bandwidth guarantees to multicast sessions on IP-based networks and satisfies the above requirements. It includes a scalable, end-to-end Call Admission Multicast Protocol (CAMP) that operates as a sort of distributed bandwidth broker and allows to combine the benefits of both the IS and DS approaches in a single approach which is simple, scalable, operates on a per-call basis and supports the group membership dynamics.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890129.pdf", } @ARTICLE{Case0101:Modeling, AUTHOR="Claudio E. Casetti and Michela Meo", TITLE="Modeling the Stationary Behavior of {TCP} Reno Connections*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="141-156", MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="In this paper, we outline a methodology that can be applied to model the behavior of TCP Reno flows. The proposed methodology stems from a Markovian model of a single TCP source, and eventually considers the superposition and interaction of several such sources using standard queueing analysis techniques. Our approach allows the evaluation of such performance indices as throughput, queueing delay and segment loss of TCP flows. The results obtained through our model are validated by means of simulation, under different traffic settings.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890141.pdf", } @ARTICLE{Coci0101:Markov, AUTHOR="Francesco Cocimano and Alfio Lombardo and Giovanni Schembra", TITLE="A Markov Model for the Design of Feedback Techniques to Match Traffic Specification Parameters in {MPEG} Video Sources", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="157-172", MONTH=jan, YEAR=2001, REFERENCES=14, ABSTRACT="Guaranteeing of quality-of-service (QoS) is a challenging task to promote the evolution of the Internet from a simple data network into a true multiservice network. To this end, the IETF intserv Working Group, with the goal of defining a next generation Internet, has defined two QoS classes: Guaranteed Services and Controlled-Load Services. For both of them the source is required to declare its traffic characteristics by means of a number of Tspec parameters and guarantee these traffic characteristics during transmission. The target of this paper is to develop an analytical tool for the design of feedback laws which allow MPEG encoders to inject into the network video traffic shaped according to the declared Tspec, while maintaining an acceptable perceived quality.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890157.pdf", } @ARTICLE{Beri0101:Intrastandard, AUTHOR="Francesco Beritelli and Salvatore Casale and Mario Francese and Giuseppe Ruggeri", TITLE="Intrastandard Hybrid Speech Coding for Adaptive {IP} Telephony", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="173-187", MONTH=jan, YEAR=2001, REFERENCES=22, ABSTRACT="This paper presents new speech coding issues and algorithms involved in IP telephony. To develop an efficient system of adaptive voice over IP (VoIP), in fact, besides traditional networking aspects, a series of speech processing issues need to be carefully considered. More specifically, two important aspects of discontinuous transmission are dealt with: the impact of the VAD on source throughput and the need for an efficient system of comfort noise. In addition we propose a variable rate, toll quality CS-ACELP coder that uses coding modes compatible with the three 6.4, 8, and 11.8 kbit/s coding schemes standardised by ITU-T in G.729. In particular, the algorithm presents 4 coding categories, with an average bit rate ranging between about 3 and 8 kbit/s, that adapt the rate to changes in network conditions.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890173.pdf", } @ARTICLE{Luca0101:Test, AUTHOR="Marco De Luca and Paolo Senesi and Francesca Cuomo", TITLE="Implementation of a Test-Bed for Telephony over {IP:} Architectural, Theoretical, and Performance Issues", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="189-204", MONTH=jan, YEAR=2001, REFERENCES=17, ABSTRACT={CSELT is evaluating the feasibility of provisioning Telephony over IP (ToIP) services. ToIP is different from Voice over IP, because it is intended as a Carrier-class service, fully featured and with quality of service guarantees, to be offered to a large number of users, either overlapping or substituting classical Plain Old Telephone Services. CSELT is performing both theoretical and experimental analysis; in particular we are focusing our work on the mechanisms and protocols developed in the standardisation bodies in order to verify how the telephony services can be supported by means of an IP network. In the first half of 2000 we have performed a laboratory trial in order to demonstrate the "proof-of-concept" of ToIP capabilities, performance and interoperability with TDM-based switching technology. In the solution tested in CSELT, provided by a leading manufacturer, the IP technology is deployed in the transit network, so it is necessary to have an interworking function between a traditional circuit network and the IP network. It must be underlined that the solution provided by the manufacturer, as requested by CSELT, was still at an early stage of development, hence it has not been possible to perform a full test campaign. From our theoretical analysis and laboratory experiment we observed the suitability of architectures proposed in the standardisation bodies and by the manufacturers for the provisioning of ToIP services. The experimented system, in particular considering its prototype nature, has shown high performance in terms both of voice and signalling quality. The main problem that arises in ToIP systems is the reliability of the system, that is a fundamental concept for providing carrier-class services. The detailed results of both the theoretical analysis and the laboratory experiment are presented in this paper.}, URL="http://link.springer.de/link/service/series/0558/papers/1989/19890189.pdf", } @ARTICLE{Fran0101:Enhanced, AUTHOR="Andrea Francini and Fabio Chiussi and Robert T. Clancy and Kevin D. Drucker and Nasser E. Idirene", TITLE="Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="205-221", MONTH=jan, YEAR=2001, REFERENCES=16, ABSTRACT="Because of their minimal complexity, Weighted Round Robin (WRR) schedulers have become a popular solution for providing bandwidth guarantees to IP flows in emerging networks that support differentiated services. The introduction of applications that require flexible bandwidth management puts emphasis on hierarchical scheduling structures, where bandwidth can be allocated not only to individual flows, but also to aggregations of those flows. With existing WRR schedulers, the superimposition of a hierarchical structure compromises the simplicity of the basic scheduler. Another undesirable characteristic of existing WRR schedulers is their burstiness in distributing service to the flows. In this paper, we present two enhancements for WRR schedulers which solve these problems. In the first enhancement, we superimpose a hierarchical structure by simply redefining the way the WRR scheduler computes the timestamps of the flows. This ``soft'' hierarchy has negligible complexity, since it does not require any additional scheduling layer, yet is highly effective. The second enhancement defines an implementation of a WRR scheduler that substantially reduces the service burstiness with marginal additional complexity.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890205.pdf", } @ARTICLE{Mars0101:Router, AUTHOR="Marco {Ajmone Marsan} and Andrea Bianco and Paolo Giaccone and Emilio Leonardi and Fabio Neri", TITLE="Router Architectures Exploiting Input-Queued Cell-Based Switching Fabrics*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="223-238", MONTH=jan, YEAR=2001, REFERENCES=12, ABSTRACT="Input queued and combined input/output queued switching architectures must be controlled by a scheduling algorithm, which solves contention in the transfer of data units to switch outputs. We consider the case of packet switches (or routers), i.e., devices operating on variable-size data units at their interfaces, assuming that they internally operate on fixed-size data units, and we propose novel extensions of known scheduling algorithms for input queued and combined input/output queued architectures. We show by simulation that such architectures can provide performance advantages over traditional output queued architectures.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890223.pdf", } @ARTICLE{Caso0101:Packet, AUTHOR="Maurizio Casoni", TITLE="Packet Discard Schemes for Differentiated Services Networks with {ATM} Switching Systems*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="239-254", MONTH=jan, YEAR=2001, REFERENCES=25, ABSTRACT="In this paper two packet discard schemes are proposed with the goal to provide incoming data flows different levels of quality of service. In particular, the assured forwarding in the Differentiated Services per-hop-behavior, as reported in the Request For Comments 2597, is considered as reference scenario. The different levels of quality of service imply different portions of bandwidth assigned to data flows which share that same output link. Good performance in terms of throughput and fairness in bandwidth sharing among equal priority flows are also considered as the requirements to meet. The proposed schemes are also evaluated when end-to-end transport protocols, such as TCP, are employed so as to give some informations about their impact on applications. These dropping schemes are shown to provide good results and to represent a relatively low complex solution for dealing with the most demanding data flows during congestion intervals. Numerical results are reported and discussed for homogeneous and non homogeneous data sources.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890239.pdf", } @ARTICLE{Ciul0101:Simulation, AUTHOR="Nicola Ciulli and Stefano Giordano", TITLE="Analysis and Simulation of {WF2Q+} Based Schedulers: Comparisons and Compliance with Theoretical Bounds", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="255-271", MONTH=jan, YEAR=2001, REFERENCES=8, ABSTRACT="The statistical multiplexing of non-fixed-size packet flows with heterogeneous requirements onto a single network interface of a router gave rise to a number of different scheduling mechanisms. These algorithms attempts to work as close as possible to the ideal ``fluid model''. One of the most effective proposals is the Worst-case Fair Weighted Fair Queueing (WF2Q); this pays its optimality with a great computational complexity and has been followed by more ``operative'' derivatives: the WF2Q+ and S-SPFQ. The former has not been specified with a univocal algorithm, thus leaving space for a number of implementations: this article aims to analyse and compare the different algorithms coming out from the WF2Q concept at both theoretical and ``practical'' level (by means of simulations). To this purpose, an on-purpose discrete-event simulator for packet schedulers has been implemented at the University of Pisa. The simulations also allowed to verify to what extent the operative versions of WF2Q fulfill to the WF2Q theoretical properties.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890255.pdf", } @ARTICLE{Larz0101:Requirements, AUTHOR="Lars-Åke Larzon and Mikael Degermark and Stephen Pink", TITLE="Requirements on the {TCP/IP} Protocol Stack for Real-Time Communication in Wireless Environments", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="273-283", MONTH=jan, YEAR=2001, REFERENCES=13, ABSTRACT="A strong trend in the Internet is to provide wireless Internet access to handheld devices. Radio spectrum is a scarce and expensive resource, and a wide-area cellular system that provides satisfying quality for a data service based on the traditional TCP/IP protocol stack will be expensive. This becomes especially problematic for real-time communication based on UDP. To design an economically viable system, different approaches are available. New protocols can be designed that take wireless systems into account. The Wireless Application Protocol (WAP) is an example of such a protocol. Alternatively, the existing TCP/IP protocols can be modified to better support cellular systems. The development of WAP is tempting since it does not have to modify the TCP/IP Protocol stack. However, to provide future proofing, it is a better idea to base the protocol architecture for wireless on TCP/IP since this will be the dominant Internet protocol stack for years to come. This paper discusses requirements on various layers in the TCP/IP protocol stack to better support real-time data services. One key component is a transport layer designed to use limited bandwidth more efficiently for real-time services. Changes are required to other layers as well, but these can be deployed where needed without disturbing the rest of the Internet. By applying these changes, it becomes possible to provide cost efficient, real-time services based on IP in cellular systems.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890273.pdf", } @ARTICLE{Park0101:Multicast, AUTHOR="Koohyun Park and Yong-Sik Shin and Hyun-Chan Lee", TITLE="Multicast Routing by Multiple Tree Routes {*}", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="285-297", MONTH=jan, YEAR=2001, REFERENCES=22, ABSTRACT="A solution to reduce the cost of multicast paths is presented, where the traffic is split over multiple paths to obtain an overall lower cost. Optimal conditions for this split operation are provided and two different algorithms are presented. The methods were shown to work on problems with many different types of simultaneous multicast traffic. Various experiments were conducted and the results showed that the new multicasting was fairly effective on the end-to-end quality of services.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890285.pdf", } @ARTICLE{Fuma0101:Optimal, AUTHOR="Andrea Fumagalli and Marco Tacca", TITLE="Optimal Design of Optical Ring Networks with Differentiated Reliability (DiR)*", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="299-313", MONTH=jan, YEAR=2001, REFERENCES=13, ABSTRACT="Current optical networks typically offer two degrees of service reliability: full protection in presence of a single fault in the network, and no protection at all. This situation reflects the historical duality that has its roots in the once divided telephone and data environment. The circuit oriented service required protection, i.e., provisioning of readily available spare resources to replace working resources in case of a fault. The datagram oriented service relied upon restoration, i.e., dynamic search for and reallocation of affected resources via such actions as routing table updates. The current development trend, however, is gradually driving the design of networks towards a unified solution that will jointly support traditional voice and data services as well as a variety of novel multimedia applications. The growing importance of concepts, such Quality of Service (QoS) and Differentiated Services that provide varying levels of service performance in the same network evidences this trend. Consistently with this pattern, the novel concept of Differentiated Reliability (DiR) is formally introduced in the paper and applied to provide multiple reliability degrees (classes) in the same network layer using a common protection mechanism, i.e., path switching. According to the DiR concept, each connection in the layer under consideration is guaranteed a minimum reliability degree, defined as the Maximum Failure Probability allowed for that connection. The reliability degree chosen for a given connection is thus determined by the application requirements, and not by the actual network topology, design constraints, robustness of the network components, and span of the connection. An efficient algorithm is proposed to design the Wavelength Division Multiplexing (WDM) layer of a DiR ring.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890299.pdf", } @ARTICLE{Call0101:Optical, AUTHOR="Franco Callegati and Giorgio Corazza and Carla Raffaelli", TITLE="An Optical Packet Switch for {IP} Traffic with {QoS} Provisioning", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="315-330", MONTH=jan, YEAR=2001, REFERENCES=22, ABSTRACT="This paper addresses the problem of building optical packet switches able to effectively cope with variable length packet traffic, such as IP traffic. A switching architecture equipped with a multistage fiber delay lines based buffer is presented. The aim is to realize a buffer with fine granularity and long delay with an architecture of limited complexity. QoS mechanisms are proposed to support service differentiation by exploiting the wavelength resource and are evaluated by simulation.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890315.pdf", } @ARTICLE{Mene0101:Policy, AUTHOR="Elionildo da Silva Menezes and Djamel Hadj Sadok and Judith Kelner", TITLE="A Policy Management Framework Using Traffic Engineering in DiffServ Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="331-345", MONTH=jan, YEAR=2001, REFERENCES=30, ABSTRACT="The increasing growth and complexity of current corporate networks calls for higher level models and tools for managing network resources. In this sense, Service Level Management represents an important recent shift in system management. Furthermore, recently the IETF (Internet Engineering Task Force) DiffServ working group, has defined an architecture for implementing scalable service differentiation in the Internet, where network resources are allocated to traffic streams by service provisioning policies. This work presents and evaluates a functional architecture and a framework for mapping service management policies and constraints into DiffServ mechanisms. Various simulation scenarios described through the use of service policies are introduced and analyzed. It is shown that the use of service level management allows for efficient dynamic traffic engineering of DiffServ backbones.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890331.pdf", } @ARTICLE{Xylo0101:Quality, AUTHOR="George Xylomenos and George C. Polyzos", TITLE="Quality of Service Issues in Multi-service Wireless {Internet} Links", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="347-363", MONTH=jan, YEAR=2001, REFERENCES=22, ABSTRACT="Internet application performance over wireless links is disappointing, due to wireless impairments and their adverse interactions with higher protocol layers. In order to effectively address these problems without the need for global protocol upgrades, we focus on link layer enhancement schemes. Simulations reveal that different schemes work best for different applications. We have thus developed a multi-service link layer architecture that can simultaneously enhance the performance of diverse applications by supporting multiple link mechanisms concurrently. Simulations confirm that this architecture provides dramatic performance improvements. The architecture can be embedded in various ways into the Internet. A critical issue for Quality of Service support over wireless links is the unpredictability of available resources. Our approach is based on fair sharing of the link before any measures are taken to improve the performance of individual traffic classes. This approach turns over the error control trade-off to the applications themselves.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890347.pdf", } @ARTICLE{Prig0101:Enhancing, AUTHOR="Giannis Priggouris and Stathes Hadjiefthymiades and Lazaros Merakos", TITLE="Enhancing the General Packet Radio Service with {IP} {QoS} Support", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="365-379", MONTH=jan, YEAR=2001, REFERENCES=18, ABSTRACT="The General Packet Radio Service (GPRS) is the current enhancement in the GSM infrastructure, capable of handling Internet Protocol (IP) traffic for mobile computing and communications. A major deficiency of the current GPRS specification is the lack of adequate IP Quality of Service (QoS) support. In this paper a QoS aware architecture for enhancing the GPRS core network with IP QoS support is presented. The proposed scheme is based on the Integrated Services (Intserv) architecture, processed in the IETF during the past years. The applicability of the proposed architecture as well as the required signalling enhancements and modifications in the components of the GPRS architecture are discussed. To identify the applicability of our proposal in a real GPRS network, a simulation model of the proposed IntServ architecture was developed in order to quantify the effect that signalling overhead has on the GPRS operation and performance. The obtained simulation results show that the proposed scheme demonstrated good scalability, even for large user populations.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890365.pdf", } @ARTICLE{Mous0101:Genetic, AUTHOR="Mohamed {Moustafa Abd-El Aziz Moustafa} and Ibrahim Habib and Mahmoud Naghshineh", TITLE="Genetic Algorithm for Mobiles Equilibrium Applied to Video Traffic", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="381-390", MONTH=jan, YEAR=2001, REFERENCES=15, ABSTRACT="In a CDMA network, resource allocation is critical in order to provide suitable signal quality for each user and achieve channel efficiency. The third-generation mobile communication systems (ITU/IMT-2000) must be designed to support wideband services at bit rates as high as 2 Mbps, with the same quality as fixed networks. Mobiles transmitted power has to be controlled to provide each user a reasonable connection while limiting the interference seen by other users. Transmitted rate has also to be controlled to avoid congestion. An adaptive protocol is proposed for controlling mobile calls transmitter power and rate cooperatively when previous work has focused on handling them separately. The active component of this scheme is called Genetic Algorithm for Mobiles Equilibrium (GAME). Based on an evolutionary computational model, the base station tries to achieve an adequate equilibrium between its users. Thereof, each mobile can send its traffic with a suitable power to support it over the different path losses and interference. In the mean time, its battery life is being preserved while limiting the interference seen by neighbors. A significant enhancement in signal quality and power level has been noticed through several experiments.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890381.pdf", } @ARTICLE{Bian0101:PCP, AUTHOR="Giuseppe Bianchi and Flaminio Borgonovo and Antonio Capone and Luigi Fratta and Chiara Petrioli", TITLE="{PCP:} An End-to-End Measurement-Based Call Admission Control for Real-Time Services over {IP} Networks", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="391-406", MONTH=jan, YEAR=2001, REFERENCES=24, ABSTRACT="Distributed end-to-end measurement based connection admission control mechanisms have been recently proposed. The goal of these schemes is to provide tight QoS control on a per connection basis by means of measurements taken by the edge nodes and priority based forwarding procedure at internal nodes. Since the additional flows handling procedures are implemented at the border routers and the forwarding mechanisms are for flows aggregates only, the approach is fully scalable and compatible with the IETF Differentiated Service proposal. The aim of this paper is to propose specific schemes and to investigate the advantages and limits of the approach by analyzing the basic mechanisms and evaluating its performance. As a results, the paper shows that end-to-end measurements taken over a low priority probing packet stream is an effective and robust way to guarantee bandwidth and delay for real-time services characterized by fast traffic dynamics, such as Voice over IP.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890391.pdf", } @ARTICLE{Bogg0101:Admission, AUTHOR="Gennaro Boggia and Pietro Camarda and Maurizio Tortorici", TITLE="Admission Control for Distribution of Smoothed Video Using Patching Algorithms", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="407-422", MONTH=jan, YEAR=2001, REFERENCES=15, ABSTRACT="The resource sharing techniques in Multimedia on demand systems allow the simultaneous service of a large number of requests with considerable savings in terms of network bandwidth and server resources. In this paper, we report the results of a study that analyzes several key aspects of video distribution systems, in the hypothesis of exploiting patching techniques. Synthetically, such a technique consists in serving a client request by an existing stream for that video object (if there is any) which is buffered in the client equipment and simultaneously a new stream is requested to the server for the frames already transmitted. For such systems, a performance analysis has been carried out, exploiting analytical and simulation models. The results show the main system performance (efficiency, aggregate bandwidth, etc.) allowing to decide about the acceptance of a new service request based on QoS criteria.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890407.pdf", } @ARTICLE{Bian0101:Migration, AUTHOR="Giuseppe Bianchi and Nicola Blefari-Melazzi", TITLE="A Migration Path for the Internet: From Best-Effort to a {QoS} Capable Infrastructure by Means of Localized Admission Control", JOURNAL="Lecture Notes in Computer Science", VOLUME=1989, PAGES="423-438", MONTH=jan, YEAR=2001, REFERENCES=17, ABSTRACT="Looking back at many proposals appeared on the scene in these years, a fundamental lesson to be learned is that their success or failure is strictly tied to their backward compatibility with existing infrastructures. In this paper, we consider the problem of providing explicit admission control decisions for QoS aware services. We rely the decision to admit a new flow upon the successful and timely delivery, through the Internet, of probe packets independently generated by the end points. Our solution, called GRIP (Gauge\&Gate Realistic Internet Protocol), is fully distributed and scalable, as admission control decisions are taken at the edge network nodes, and no coordination between routers, which are stateless and remain oblivious to individual flows, is required. The performance of GRIP are related to the capability of routers to locally take decisions about the degree of congestion in the network, and suitably block probe packets when congestion conditions are expected. The key message of this paper is that GRIP is a novel reservation paradigm which can be seamlessly applied to the existing Diffserv (and even legacy) Internet, although a marginal increase in QoS is envisioned in these existing scenarios. Indeed, GRIP opens up a future smooth migration path toward gradually improved QoS, as routers in different domain will be upgraded with better measurement-based admission decision criteria. The enabling factor is that router decision criteria are localized and do not involve any coordination. This guarantees that they can be enhanced without losing inter-operability with installed devices.", URL="http://link.springer.de/link/service/series/0558/papers/1989/19890423.pdf", } @ARTICLE{Lanc0101:Problem, AUTHOR="David Lancaster and J. S. Reeve", TITLE="A Problem Solving Environment Based on Commodity Software", JOURNAL="Lecture Notes in Computer Science", VOLUME=1823, PAGES="3-11", MONTH=jan, YEAR=2001, REFERENCES=23, ABSTRACT="Following the common use of of commodity hardware to build clusters, we argue that commodity software should be harnessed in a similar way to support Scientific and Engineering work. Problem Solving Environments (PSE) provide the arena where commodity software technology can modernise the development and execution environment. We describe a PSE prototype based on the standard software infrastructure of Java Beans and CORBA that illustrates this idea and provides advanced PSE functionality at minimum effort for medium sized heterogeneus platforms.", URL="http://link.springer.de/link/service/series/0558/papers/1823/18230003.pdf", } @ARTICLE{Bale0101:Voice, AUTHOR="Mel C. Bale", TITLE="Voice and {Internet} multimedia in {UMTS} networks", JOURNAL="BT Technical Journal", VOLUME=2, NUMBER=1, PAGES="48-66", MONTH=jan, YEAR=2001, REFERENCES=9, KEYWORDS="Mobile networks; 3G; 3GPP; SIP", ABSTRACT="Voice telephony is the predominant service on today's cellular mobile networks, in terms of number of customers, revenues and network usage. However, it is difficult to predict how long this will be the case given the rising demand for new Internet multimedia services. It is therefore essential that 3rd generation (3G) mobile networks support a voice telephony service, but also that these networks are also capable of providing Internet multimedia services using the same technology. This paper provides an overview of how voice telephony is provided in the initial phase of the universal mobile telecommunications system (UMTS). It then describes how this is expected to evolve in later phases - so that voice telephony becomes one of a large number of multimedia services provided from a common Internet protocol-based mobile network.", URL="http://www.bt.com/bttj/vol19no1/bale/fulltext.htm", } @ARTICLE{Sher0101:Standards, AUTHOR="Mostafa Hashem Sherif", TITLE="Standards for Biometric Identification", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Gree0101:Progress, AUTHOR="Paul Green", TITLE="Progress in Optical Networking", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, ABSTRACT="This article summarizes the present state of optical networking, how we got to this point, and what needs to be done to complete the job. The point of departure is an assumed future two-level structure in which the transport is by means of steadily growing interconnected all-optical islands of transparency, while the remainder of the communication layers are based on IP, both levels being managed by an MPLS-based control plane. After reviewing why such networks are becoming inevitable, a review is given of the various optical layer technology and architecture bottlenecks that have had to be solved. Issues that remain center on increasing the number of channels and reducing the technology costs.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Neuk0101:MEMS, AUTHOR="Armand Neukermans and Rajiv Ramaswami", TITLE="{MEMS} Technology for Optical Networking Applications", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=15, ABSTRACT="The explosion of the Internet has brought about an acute need for broadband communications, which can only be filled with optical networking. This in turn has resulted in an unprecedented interest in optical micro-electromechanical systems. Since the early days of fiber optics, it has been recognized that micro-optics was a fertile ground for the applications of MEMS. MEMS-based products offer substantial cost and performance advantages for optical networking applications in the area of switching fabrics, variable attenuators, tunable lasers, and other devices. This article provides a review of various types of MEMS technologies for optical networking applications.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Bux0101:Technologies, AUTHOR="Werner Bux and Wolfgang E. Denzel and Ton Engbersen and Andreas Herkersdorf and Ronald P. Luijten", TITLE="Technologies and Building Blocks for Fast Packet Forwarding", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="We provide a review of the state of the art and the future of packet processing and switching. The industry's response to the need for wire-speed packet processing devices whose function can be rapidly adapted to continuously changing standards and customer requirements is the concept of special programmable network processors. We discuss the prerequisites of processing tens to hundreds of millions of packets per second and indicate ways to achieve scalability through parallel packet processing. Tomorrow's switch fabrics, which will provide node-internal connectivity between the input and output ports of a router or switch, will have to sustain terabit-per-second throughput. After reviewing fundamental switching concepts, we discuss architectural and design issues that must be addressed to allow the evolution of packet switch fabrics to terabit-per-second throughput performance.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Moye0101:Impact, AUTHOR="Stan Moyer and Amjad Umar", TITLE="The Impact of Network Convergence on Telecommunications Software", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=6, ABSTRACT="This describes a converged network architecture and then discusses why it needs to be open and programmable and how this can be accomplished. A discussion of two approaches to open/programmable networks -- JAIN and Parlay -- is provided to highlight the key ideas. The converged network is a key player in e-business and the next-generation applications currently being developed for the growing digital economy. We briefly discuss the role of telecommunications bandwidth trading and application integration in NGAs and their relevance to converged networks. Some of the challenges software engineers and programmers can expect to encounter while trying to build these networks are also discussed.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Bjrk0101:Movement, AUTHOR="Nils Björkman and Yong Jiang and Torbjörn Lundberg and Alexander Latour-Henner and Avri Doria", TITLE="The Movement from Monoliths to Component-Based Network Elements", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="To be competitive in a rapidly growing market requires rapid upgrades to the performance and functionality of the network. One way to manage rapid upgrades of the network with minimum risk is to deploy equipment using a modular system architecture. Modularity allows a network operator to mix and match best of breed components to achieve the desired system rather than rely on vendors to implement specific technology before making crucial business decisions. This article begins with an overview of the current global movement toward standards that support network elements with modular system architecture. The story begins with university initiatives and the forming of OpenSig and IEEE P1520 more than five years ago, continuing with related and complementary initiatives by the Parlay Group, Softswitch Consortium, Multiservice Switching Forum, and several IETF working groups. Next, special attention is given to the component-based architecture of the Multiservice Switching Forum released in summer 2000. The trend of building network equipment from components with distinctly different functional specialties is described in three examples: media gateways, IP routers, and virtual IP routers. It is envisioned that component-based network infrastructure will spawn new markets for entrepreneurial developers, spurring competition and accelerating the creation of innovative solutions for all facets of global communications. The article concludes with a smorgasbord of new market opportunities.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Robe0101:Traffic, AUTHOR="Jim Roberts", TITLE="Traffic Theory and the {Internet}", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="We argue that traffic theory, an essential component in the design of traditional telecommunications networks, should be increasingly applied in the development of the multiservice Internet. We discuss the statistical characteristics of Internet traffic at different time scales. Modeling is facilitated on identifying the notion of flow and distinguishing the categories of streaming and elastic traffic. We review mathematical modeling approaches useful for predicting the relationship between demand, capacity and performance for both streaming and elastic flows. Derived results indicate the limitations of service differentiation as a means for guaranteeing QoS and highlight the importance of traditional traffic engineering approaches in ensuring that the network has sufficient capacity to handle offered demand.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Blcs0101:Fixed, AUTHOR="Helmut Bölcskei and Arogyaswami Paulraj and K. V. S. Hari and Rohit Umesh Nabar and Willie Lu", TITLE="Fixed Broadband Wireless Access: State of the Art, Challenges, and Future Directions", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="This article provides an overview of fixed broadband wireless access technology. Focusing on the band below 3 GHz, we describe BWA service and carrier needs, deployment scenarios, architectural requirements, physical layer, medium access control, and radio link protocol requirements. We characterize fixed BWA channels, outline the major challenges of fixed BWA, and study requirements for future BWA systems. Finally, we show that the use of multiple antennas at both ends of a fixed wireless link provides significant leverages.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Bi0101:Wireless, AUTHOR="Qi Bi and George I. Zysman and Hank Menkes", TITLE="Wireless Mobile Communications at the Start of the 21st Century", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="At the start of the 21st century, the wireless mobile markets are witnessing unprecedented growth fueled by an information explosion and a technology revolution. In the radio frequency arena, the trend is to move from narrowband to wideband with a family of standards tailored to a variety of application needs. Many enabling technologies including wideband code-division multiple access, software-defined radio, intelligent antennas, and digital processing devices are greatly improving the spectral efficiency of third-generation systems. In the mobile network area, the trend is to move from traditional circuit-switched systems to packet-switched programmable networks that integrate both voice and packet services, and eventually evolve toward an all-IP network. Furthermore, accompanied by wireless mobile location technology, wireless mobile Internet is expected to revolutionize the services that can be provided to consumers in the right place and at the right time. Wireless mobile communications may not only complement the well-established wireline network; it may also become a serious competitor in years to come. In this article we briefly review the history of the wireless mobile communications, examine the current progress in standards and technologies, and discuss possible trends for wireless mobile solutions.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Huba0101:Self, AUTHOR="Jean-Pierre Hubaux and Thomas Gross and Jean-Yves Le Boudec and Martin Vetterli", TITLE="Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="This article provides a technical overview of mobile ad hoc networks and describes their long-term potential. It covers current research, and describes major technical challenges, including networking, real-time services, and software. It shows that by their very nature, mobile ad hoc networks can bring a paradigm shift in the way networks are organized and operated, and can even lead to a fundamental change in the relationships between information technology and societal organization. As an illustration of these concepts, the article also contains an overall description of our long-term research project, called terminodes.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Konr0101:Visual, AUTHOR="Janusz Konrad", TITLE="Visual Communications of Tomorrow: Natural, Efficient, and Flexible", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=14, ABSTRACT="In the last decade, we have witnessed a phenomenal growth of communication and information technologies. These technologies have greatly simplified and even enriched our daily lives; cellular telephony and the Internet are probably the most striking examples. A particularly promising, and at the same time challenging, aspect of both technologies is the transmission and use of visual information. In this article I overview the state of visual communication at the end of the 20th century, discuss today's challenges, and outline some future directions.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Xu0101:Techniques, AUTHOR="Lisong Xu and Harry Perros and George Rouskas", TITLE="Techniques for Optical Packet Switching and Optical Burst Switching", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="Wavelength-division multiplexing appears to be the solution of choice for providing a faster networking infrastructure that can meet the explosive growth of the Internet. Several different technologies have been developed so far for the transfer of data over WDM. In this article we survey two new technologies which are still in the experimental stage -- optical packet switching and optical burst switching -- and comment on their suitability for transporting IP traffic.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Sano0101:High, AUTHOR="Eiichi Sano", TITLE="High-Speed Lightwave Communication {ICs} Based on {III-V} Compound Semiconductors", JOURNAL=ieeecm, VOLUME=39, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=13, ABSTRACT="Ultra-high-speed ICs are one of the keys to achieving large-capacity lightwave communications systems. This article reviews recent advances in lightwave communication ICs based on III-V compound semiconductors developed to obtain next-generation 40-Gb/s/wavelength channel systems.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/jan/index.html", } @ARTICLE{Ston0101:Network, AUTHOR="Gary Stone and Bert Lundy and Geoffrey Xie", TITLE="Network Policy Languages: A Survey and a New Approach", JOURNAL=ieeenet, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=34, ABSTRACT="In this article a survey of current network policy languages is presented. Next, a summary of the techniques for detecting policy conflicts is given. Finally, a new language, Path-Based Policy Language, which offers improvements to these is introduced. Previous network policy languages vary from the very specific, using packet filters at the bit level, to the more abstract where concepts are represented, with implementation details left up to individual network devices. As background information a policy framework model and policy-based routing protocols are discussed. PPL's path-based approach for representing network policies is advantageous in that quality of service and security policies can be associated with an explicit path through the network. This assignment of policies to network flows aids in new initiatives such as integrated services. The more stringent requirement of supporting path-based policies can easily be relaxed with the use of wild card characters to also support differentiated services and best-effort service, which is provided by the Internet today.", URL="http://www.comsoc.org/~ni/public/2001/jan/index.html", } @ARTICLE{Chan0101:Darwin, AUTHOR="Prashant Chandra and Yang-hua Chu and Allan Fisher and Jun Gao and Corey Kosak and Tok Soon Ng and Peter Steenkiste and Eduardo Takahashi", TITLE="Darwin: Customizable Resource Management for Value-Added Network Services", JOURNAL=ieeenet, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=24, ABSTRACT="The Internet is rapidly changing from a set of wires and switches that carry packets into a sophisticated infrastructure that delivers a set of complex value-added services to end users. Services can range from bit transport all the way up to distributed value-added services like video teleconferencing, virtual private networking, data mining, and distributed interactive simulations. Before such services can be supported in a general and dynamic manner, we have to develop appropriate resource management mechanisms. These resource management mechanisms must make it possible to identify and allocate resources that meet service or application requirements, support both isolation and controlled dynamic sharing of resources across services and applications sharing physical resources, and be customizable so services and applications can tailor resource usage to optimize their performance. The Darwin project has developed a set of customizable resource management mechanisms that support value-added services. In this article we present and motivate these mechanisms, describe their implementation in a prototype system, and describe the results of a series of proof-of-concept experiments.", URL="http://www.comsoc.org/~ni/public/2001/jan/index.html", } @ARTICLE{Bos0101:UMTS, AUTHOR="Lieve Bos and Suresh Leroy", TITLE="Toward an All-IP-Based {UMTS} System Architecture", JOURNAL=ieeenet, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="Looking into the future, two main drivers for the mobile telecommunications market can be identified: third-generation mobile systems (e.g., UMTS) and the Internet (e.g., the introduction of IP technologies like voice/multimedia over IP in mobile networks). UMTS is seen as the enabler of wireless multimedia applications and portability of a personalized service set across network/terminal boundaries, as defined within the virtual home environment (VHE) system concept. In light of these recent evolutions, this article investigates the impact of the evolution toward an all-IP UMTS network architecture on the UMTS service architecture, which is based on the VHE concept. The article discusses two possible scenarios for supporting VoIP services in the UMTS service architecture and analyzes their applicability in an all-IP-based UMTS network. The first is based on the traditional centralized IN service architecture. The second proposes a new decentralized architecture based on direct control of VoIP call control equipment by open service architecture interfaces.", URL="http://www.comsoc.org/~ni/public/2001/jan/index.html", } @ARTICLE{Bona0101:Guaranteed, AUTHOR="Olivier Bonaventure and Jordi Nelissen", TITLE="Guaranteed Frame Rate: A Better Service for {TCP/IP} in {ATM} Networks", JOURNAL=ieeenet, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=30, ABSTRACT="Guaranteed frame rate, recently approved by the ATM Forum, is expected to become an important service category to efficiently support TCP/IP traffic in ATM networks. We first describe the GFR traffic contract in details. We then present different types of switch implementations that have been proposed to support GFR. We analyze the performance of three of these switch implementations by simulations in two different network environments. These simulations show that the scheduler-based implementations provide a much better performance than the simple switch implementation. However, we also show that coupling an active packet discard mechanism to a scheduler-based switch implementation does not produce a performance gain when many TCP connections are multiplexed inside one ATM VC.", URL="http://www.comsoc.org/~ni/public/2001/jan/index.html", } @ARTICLE{Shar0101:Dissemination, AUTHOR="Oran Sharon", TITLE="Dissemination of Routing Information in Broadcast Networks: {OSPF} versus {IS-IS}", JOURNAL=ieeenet, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=2001, REFERENCES=12, ABSTRACT="OSPF and IS-IS are two main standard link state routing protocols designed to operate in various complex network topologies. One aspect that both protocols handle is the reliable dissemination of routing information over broadcast networks such as Ethernet and FDDI. Both protocols suggest different schemes for this purpose, and in this article we compare the two. The performance criteria being checked are: the longest arrival time of a routing update packet at all the routers; the average arrival time of routing update packets at all the routers; the total required bandwidth; and the number of memory accesses a router performs, which is evidence of the amount of internal work it performs. We find that in our model of broadcast networks the scheme suggested in IS-IS is more efficient than that of OSPF in terms of the arrival times of routing update packets. In particular, the average arrival time of routing update packets in OSPF is 2–10 times longer than in IS-IS. In terms of the bandwidth each scheme consumes, there are scenarios where OSPF outperforms IS-IS and vice versa. In terms of the number of memory accesses routers perform in each scheme, IS-IS outperforms OSPF.", URL="http://www.comsoc.org/~ni/public/2001/jan/index.html", } @ARTICLE{Elli0101:Building, AUTHOR="Chip Elliott", TITLE="Building the Wireless {Internet}", JOURNAL=ieeespec, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2001, KEYWORDS="802.11; 3G; wireless; network architecture; bit density; cellular networks; nanocells; wireless Internet", URL="http://www.spectrum.ieee.org/spectrum/jan01/departments/speake.html", } @TECHREPORT{Kero0101:Scalable, AUTHOR="Angelos Keromytis and Sotiris Ioannidis and M. B. Greenwald and Jonathan Smith", TITLE="Scalable Security Mechanisms for the {Internet}", TYPE="Computing Science Technical Report", INSTITUTION="University of Pennsylvania", NUMBER=5, MONTH=jan, YEAR=2001, } @ARTICLE{Kon0101:Conformance, AUTHOR="O. Koné", TITLE="Conformance testing to real-time communications systems", JOURNAL=comcom, VOLUME=25, NUMBER=1, PAGES="32-45", MONTH=jan, YEAR=2001, REFERENCES=46, KEYWORDS="protocol engineering; conformance testing; real-time system; ITU-T Z500 standard", ABSTRACT="Real-time requirements appear in the specifications of new evolving systems such as multimedia applications or embedded systems. Testing is an experimental method aimed at checking the correctness of some implementation and its conformance to some standard specification. At present, standardization institutions are being interested in a formal framework for the development of real-time communications systems. Some ISO working groups are proposing formalisms to describe these systems, while other working groups are proposing formalisms to describe real-time test cases. But few works exist on conformance testing aspects, against time-dependencies that bridge the gap between the two previous activities. The contribution of this paper is the proposition of a complete method to the design of tests against real-time communications systems. The proposed method complies to the ITU-T Z500 standard on tests development and we show that the tests designed by our method are sound and exhaustive. The test construction process is also illustrated with an example of time-dependent protocol.", URL="http://www.elsevier.com/locate/comcom", } @ARTICLE{Yang0101:Multipoint, AUTHOR="Shutang Yang and Shengsheng Yu and Jingli Zhou and Qi Han", TITLE="Multipoint communications with speech mixing over {IP} network", JOURNAL=comcom, VOLUME=25, NUMBER=1, PAGES="46-55", MONTH=jan, YEAR=2001, REFERENCES=14, KEYWORDS="multipoint communications; speech scheduling and mixing system; delayless subband AEC", ABSTRACT="Multipoint communications makes it possible to exchange information among a set of participants and also the key technique to realize a distributed multiparty collaboration communications system. In this paper, a multipoint communications strategy is discussed based on our H.323 multipoint conferencing system. A new architecture, Speech Scheduling and Mixing System (SSMS), is proposed for speech mixing, and its key techniques, such as the synchronous control of real time speeches, the pre-fetching mechanism of speech data, and the method of buffer flush are discussed in order to guarantee the continuity of the mixed speech in a limited complexity. Moreover, echo problem in the conferencing system is observed and a delayless subband AEC is used to cancel acoustic echo. Simulations show that our H.323 system sounds better in the multipoint conferencing mode than those video conferencing products available, such as Microsoft Netmeeting, which is based on the same H.323 specification.", URL="http://www.elsevier.com/locate/comcom", } @ARTICLE{Denn0101:Virtual, AUTHOR="R M Dennis and A R Beresford and K M Brown", TITLE="Virtual University Research Initiative on Mobility", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="12-18", MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="BT's technology acquisition has taken on an increasingly collaborative approach in recent years. This paper provides an insight into a long-running collaboration between BT and three universities in the mobility area.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Holl0101:Virtual, AUTHOR="K A Holley and K G Hall", TITLE="Virtual centre of excellence in mobile and personal communications", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="19-23", MONTH=jan, YEAR=2001, REFERENCES=2, ABSTRACT="The Mobile VCE was set up in 1996 by industry and the DTI with the objective of bringing together industry players and British universities to develop a common base of knowledge and specific implementation goals. BT has been a member of this group since its inception and has been a key player in helping to organise the university research to the maximum benefit of the Mobile VCE community. Mobile VCE is a not-for-profit company, established as a joint initiative of the mobile communications industry and leading research universities, with endorsement from the UK government. Its innovative approach provides companies with a cost-effective means of accessing the best of the academic base to undertake high quality, industry-led, research to support the future development of the wireless industry.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Harm0101:3G, AUTHOR="J A Harmer and C D Friel", TITLE="{3G} products — what will the technology enable?", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="24-31", MONTH=jan, YEAR=2001, REFERENCES=9, ABSTRACT="Following the phenomenal success of second generation global system for mobile communications (GSM) systems, the world has turned its attention to third generation mobile systems (3G). New radio spectrum has been allocated for these networks and over the last 12 months there has been global activity to license this spectrum. Licences have been awarded in a number of ways including 'beauty contests' and (often costly) auctions. Technologists have joined forces to specify the standards for 3G. This paper describes the drivers for 3G and the commercial model that is emerging. The benefits that 3G technology will provide for business and consumer products are identified. A component-based approach to application and product development is described, based on the important value add features of mobile systems. Finally, mobile terminals, billing and payment, and customer care are also considered as they are vital to the overall customer experience.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Harr0101:Development, AUTHOR="F Harrison and K A Holley", TITLE="The development of mobile is critically dependent on standards", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="32-37", MONTH=jan, YEAR=2001, REFERENCES=7, ABSTRACT="The development of mobile standards has been a key factor in the widespread success and take-up of second generation (2G) cellular systems. Well thought through standards, including roaming aspects, have enabled operators, using equipment from different manufacturers, to create global mobile networks, which allow users to roam seamlessly and obtain largely the same services wherever they happen to be. Third generation (3G) standards have built on the success of 2G and have increased the global awareness and applicability. In this light, this paper discusses the background for mobile standards and the factors that are influencing their ongoing development for third generation and beyond.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Lobl0101:GSM, AUTHOR="N C Lobley", TITLE="{GSM} to {UMTS} — architecture evolution to support multimedia", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="38-47", MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="This paper outlines the launch architectures for UMTS and its evolution from GSM. It then carries on to discuss the issues and solutions to evolve this towards a truly open architecture to enable the delivery of multimedia, mass-market speech and IP friendly data communications within the third generation mobile environment. The drivers and requirements for the architecture evolution are explained along with the steps and approaches being taken within the various developments of IP, GPRS and multimedia.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Cook0101:3G, AUTHOR="M D Cookson and D G Smith", TITLE="{3G} service control", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="67-79", MONTH=jan, YEAR=2001, REFERENCES=11, ABSTRACT="The huge investment in 3G mobile licences is an incentive to develop extra services above and beyond basic telephony and data services. Service control provides an infrastructure to deliver services, particularly those of a real-time nature. This paper focuses on the progress in developing service control in the context of the 3GPP Release 4/5 network. To achieve the objectives for service evolution, mass service development and cost-effective services, three technologies are being pursued for service control. These are CAMEL, APIs and SIP service extensions.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Stre0101:OSA, AUTHOR="R M Stretch", TITLE="The {OSA} {API} and other related issues", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="80-87", MONTH=jan, YEAR=2001, ABSTRACT="This paper gives an introduction to the open service architecture (OSA) in 3GPP. It describes why such an interface was deemed necessary and how APIs were used in the description of that interface. Mobility was the original focus for the interface and the paper describes the functionality that was felt appropriate for 3GPP's Release 1999 specification. The paper goes on to show the architectural concepts behind this third party applications interface and describes the joint work that is being undertaken between ETSI, 3GPP and Parlay to ensure one consistent API across the piece.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Ralp0101:Services, AUTHOR="D Ralph and C G Shephard", TITLE="Services via mobility portals", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="88-99", MONTH=jan, YEAR=2001, REFERENCES=10, ABSTRACT="This paper examines the importance of mobility portal services and the technologies that will be essential in delivering content over next generation network technologies. A discussion of some examples of the different mobile portals currently available highlights their limitations and sets the direction for future services. Finally, proposed developments are presented which will extend the functionality available at the mobile portal through the improvements in terminal capability and the evolution of protocols for delivery of content over a mobile network.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{John0101:Terminal, AUTHOR="W Johnston", TITLE="Terminal developments and their media capabilities", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="100-105", MONTH=jan, YEAR=2001, ABSTRACT="Building a 3G network is like buiding a PC — just because you buy the fastest elements, it does not mean that you get the most efficient PC. It is important to integrate and optimise all the elements correctly in order to achieve the best performance. The 3G network is the same — each element of the solution is important. This paper focuses on one aspect of the complete 3G solution, i.e. the handsets/mobile devices that give the customer a gateway into the network services. Key elements of the mobile device that provide the best user experience are identified and briefly discussed and an insight is provided into the direction of the future technology.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Harr0101:Future, AUTHOR="J W Harris", TITLE="The future of radio access in {3G}", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="106-113", MONTH=jan, YEAR=2001, ABSTRACT="In the last two years, UMTS has progressed from the drawing board to prototypes and pre-release trials. Through the concentrated efforts of manufacturers and operators in the standards bodies, the 3GPP specifications for UMTS, including W-CDMA, TD/CDMA and TD/SCDMA, are currently being developed into deployable equipment for the first UMTS networks. However, human nature dictates that there is always room for improvement, with a constant drive for better performance and higher efficiency. UMTS is by no means the ultimate mobile radio access network, and, even before the first equipment rolls off the production lines, the work of the standards bodies is already looking at enhancements to the system. This paper considers some of these improvements, the evolution of W-CDMA, and the role of TDD in the ongoing developments of third generation mobile radio access.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{ONei0101:Edge, AUTHOR="A W O'Neill and G Tsirtsis", TITLE="Edge mobility architecture — routeing and hand-off", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="114-126", MONTH=jan, YEAR=2001, REFERENCES=13, ABSTRACT="This paper presents a network architecture for supporting edge mobility, and goes on to consider IP networks in which the core topology is fixed but where the hosts at the edge of the network may be mobile, as is the case in cellular networks. Within this architecture, mobile enhanced routeing (MER) protocols are used to support the prefix-routed requirements of the fixed Internet, along with the movement of IP addresses allocated to mobile nodes. Specific components for the support of such edge mobility (EMA:MER) are then outlined; these offer fixed/mobile IP network convergence, homogeneous IP hand-off across heterogeneous access technologies, and inter-domain roaming across heterogeneous large-scale IP domains.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Fent0101:3G, AUTHOR="C J Fenton and J G O Moss and D W Lock and R Bloomfield and J S Fisher and D J Pratt and A Brookland and J Gil", TITLE="{3G} trials and developments", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="127-137", MONTH=jan, YEAR=2001, ABSTRACT="This paper summarises the many activities that formed a vigorous and innovative phase of understanding 3rd generation systems and their potential service/product offering. Experience from the introduction of 2nd generation GSM systems showed that, even though based upon strong standards, real hands-on development to validate the design activities was essential for both a workable standard and a smooth and successful service deployment. Trials activities are used to overcome the lack of validation and to bring innovation through integration of capabilities and devices -- they consist of two areas. Firstly, a number of test radio systems were examined and used in the validation of network planning tools plus measurement or real throughput figures, and, secondly, some service scenarios were developed and implemented on an all-IP network to demonstrate that IP can deliver a marketable services level. The interaction with wireless systems and the impact of that on the application were also examined.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Park0101:BT, AUTHOR="T D Parker", TITLE="{BT's} mobile joint ventures and alliances", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="138-141", MONTH=jan, YEAR=2001, REFERENCES=2, ABSTRACT="This paper outlines the current status of the BT Group mobile joint ventures, in terms of shareholding, and goes on to highlight the key challenges BT has faced in order to increase its global reach. A new mobile operator, as a fresh entrant into an already competitive market, has to face a range of major challenges. These key to-date challenges are discussed, along with experiences from a number of major mobile ventures within Europe. With an increasing number of the mobile ventures obtaining licences to operate 3rd generation mobile networks (i.e. UMTS) there is another set of 'new challenges' to be identified and overcome. The preparations for meeting these new challenges posed by the introduction of 3rd generation mobile networks are outlined, alongside some initiatives from BT Group as part of their contribution to the new 'wireless family'.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Tatt0101:Professional, AUTHOR="P Tattersall", TITLE="Professional mobile radio — the {BT} Airwave public safety service and the path for technology and service evolution", JOURNAL=bttj, VOLUME=19, NUMBER=1, PAGES="142-148", MONTH=jan, YEAR=2001, REFERENCES=4, ABSTRACT="Professional mobile radio (PMR) has often been perceived as the 'Cinderella' of the mobility market; however, a wide range of corporate mobile business communications people use PMR intensively, because both its unique functionality and its performance match their requirements better than other mobile technologies. Although there are several new digital PMR technologies, the new ETSI TETRA (terrestrial trunked radio) standard, which offers enhanced speech and data facilities, is a major factor in the quiet revolution in which more and more business users are adopting PMR to meet their mobile communications needs. This market is estimated to be worth over 10bn by 2004 [1] . TETRA is also receiving global acceptance outside Europe with contracts and/or commitments already in Asia Pacific, Latin America, Africa, the Middle East and China, with interest being shown in North America (Com-Net Ericsson/Marconi contract for Florida). BT Quadrant and BT Airwave have been very successful in capturing a significant part of the UK 'public safety' (police, fire, ambulance, etc) market. A Public Private Partnership (PPP) contract worth 2.5bn was secured at the beginning of 2000 for the supply of PMR communications to the police and other 'blue light' services. This contract has a lifetime of over 15 years and it is therefore important to look ahead at how the present capabilities may be evolved to enhance the service, at a time when the capabilities of public cellular networks will be enhanced by new 3rd generation developments. This paper reviews the BT Airwave service for public safety users and discusses how it may be developed to provide users with greater flexibility and increased working effectiveness.", URL="http://www.bt.com/bttj/archive.htm", } @ARTICLE{Fu0101:PRM, AUTHOR="Xiaoming Fu and Yaoxue Zhang", TITLE="{PRM:} A Resource Management Framework for Policy-driven {QoS} Control in Enhanced Internets", JOURNAL="Chinese Journal of Electronics", VOLUME=10, NUMBER=1, PAGES="13-18", MONTH=jan, YEAR=2001, REFERENCES=23, KEYWORDS="Quality of Service(QoS); Resource Reservation Protocol (RSVP); Policy; Resource Management; QoS Pricing", ABSTRACT="The Internet has evolved from a traditional best-effort delivery data network into an enhanced Internet that can provide some Quality of Service(QoS) mechanisms for applications. However, these QoS mechanisms usually do not take policy factors into account such as priority and time-of-day. The paper presents a Resource Management Framework for Policy-driven QoS control (PRM) in enhanced internets, which consists of four components: Domain Policy Controller(DPC) resides an administrator domain, Border Resource Manager(BRM) resides between adjacent domains, Interior Resource Managers(IRM) in each router between two BRMs within the same domain, and Endsystem Resource Manager(ERM) in charge of end-node/host router resources. We first introduce challenges and demands facing the enhanced internets, then give a formalized definition of policy and describe the functions and interaction of components of PRM. Specifically we take QoS-pricing policy used in a Diff-Serv environment as an example to illustrate the operational phases of PRM.", URL="http://www-tkn.ee.tu-berlin.de/~fu/fzh01.pdf", } @INPROCEEDINGS{Kwok0101:New, AUTHOR="Yu-Kwong Kwok and Vincent Lau", TITLE="Design and analysis of a new approach multiple burst admission control for {CDMA} 2000", BOOKTITLE=mobicom, ADDRESS="Rome, Italy", PAGES="310-321", MONTH=jan, YEAR=2001, KEYWORDS="3G; CDMA; admission control; burst data; integer programming; optimal algorithm", ABSTRACT="On the verge of realizing truly ubiquitous access to high quality data (e.g., media, financial, etc.), an efficient burst admission control algorithm is crucial in third generation (3G) wireless communication systems based on wideband CDMA standards. In this paper, w e propose and analyze the performance of a novel burst admission technique, called the multiple-burst admission spatial dimension algorithm (MBA-SD) to judiciously allocate the precious channels in wideband CDMA systems to burst requests. The major con tributions of the present paper are the novel formulation of the problem as an integer programming problem and the derivation of an optimal algorithm for scheduling the burst requests. Both the forward link and the reverse link burst requests are considered and the system is simulated by dynamic simulations which takes into account of the user mobility, power control, and soft hand-off. We found that significant performance improvement, in terms of data user capacity, coverage, and admission and outage probabilities, could be achieved by our scheme compared to the existing burst assignment algorithms.", URL="http://portal.acm.org/browse\_dl.cfm?linked=1\&part=series\&idx=SERIES395\&coll=portal\&dl=ACM\&CFID=1761618\&CFTOKEN=27771328", } @INPROCEEDINGS{Ritt0101:Mobile, AUTHOR="Mike Ritter and Robert J. Friday and Rodrigo Garces and Weill San Filippo and Cuong-Thinh Nguyen", TITLE="Mobile connectivity protocols and throughput measurements in the Ricochet Microcellular data network {(MCDN)} system", BOOKTITLE=mobicom, ADDRESS="Rome, Italy", PAGES="322-331", MONTH=jan, YEAR=2001, KEYWORDS="MCDN system architecture; mobility; wireless networks; wireless protocols; wireless routing", ABSTRACT="We describe the protocols implemented in the Ricochet MCDN system to provide continuous connectivity to mobile users traveling up to 70 mph. These protocols are general in nature for any frequency-hopping microcell-based system, particularly those that follow the FCC part 15.247 rules [9] and operate in unlicensed spectrum. We also present throughput measurements as a function of velocity and describe a model to predict those numbers based upon the protocols implemented. The MCDN system is a mesh-based system of microcells that are connected wirelessly to an interspersed mesh of wired access points (WAPs) that cover approximately 12 square miles on average [7]. The average microcell density is approximately 5-6 per square mile, with 3-8 overlapping cells at each point. Since the system is entirely packet-based, we have instantaneous hand-off between microcells as there are no complicated cellular-type negotiations for circuits required as all of the information needed to route the packet through the system is included in the header; however, when traveling through the mesh of microcells at a high rate of speed, the mobile unit must acquire new microcells fast enough to ensure continuous connectivity. The system must also know how to route packets to the mobile unit as it drops old cells and acquires new ones, as well as being able to contact a moving mobile unit. This paper discusses the acquisition, registration, and routing protocols that make this possible and reviews performance data of typical mobile users.", URL="http://portal.acm.org/browse\_dl.cfm?linked=1\&part=series\&idx=SERIES395\&coll=portal\&dl=ACM\&CFID=1761618\&CFTOKEN=27771328", } @INPROCEEDINGS{Ramj0101:IP, AUTHOR="Ramachandran Ramjee and Lianyuan Li and T. La Porta and Sneha Kumar Kasera", TITLE="{IP} Paging Service for Mobile Hosts", BOOKTITLE=mobicom, ADDRESS="Rome, Italy", PAGES="332-345", MONTH=jan, YEAR=2001, ABSTRACT="In wireless networks, mobile hosts must update the network with their current location in order to get packets delivered. Paging facilitates efficient power management at the mobile host by allo wing the host to update the network less frequently at the cost of providing the network with only approximate location information.The network determines the exact location of a mobile host through paging before delivering packets destined to the mobile host.In this paper, we propose the concept of paging as an IP service. IP paging enables a common infrastructure and protocol to support the di erent wireless interfaces such as CDMA, GPRS, wireless LAN, avoiding the duplication of several application layer paging implementations and the interoperability issues that exists today. We present the design, implementation, and detailed qualitative and quantitative evaluation, using measurements and simulation, of three IP-based paging protocols for mobile hosts.", URL="http://portal.acm.org/browse\_dl.cfm?linked=1\&part=series\&idx=SERIES395\&coll=portal\&dl=ACM\&CFID=1761618\&CFTOKEN=27771328", } @INPROCEEDINGS{Wang0101:Cost, AUTHOR="Wenye Wang and Ian Akyildiz", TITLE="A cost-efficient signaling protocol for mobility application part(MAP) in {IMT-2000} systems", BOOKTITLE=mobicom, ADDRESS="Rome, Italy", PAGES="345-355", MONTH=jan, YEAR=2001, ABSTRACT="An efficient signaling protocol for mobility application part (MAP) is essential to mobility support when mobile terminals roam between different networks in next generation wireless systems such as IMT-2000. In this paper, a new signaling protocol is proposed to reduce the overhead caused by mobility management, alleviating network load and consumption of network resources. Moreover, the new protocol effectively reduces the latency of call delivery and call loss rate due to crossing wireless systems with different standards and signaling protocols. Instead of performing location registration after a mobile user arrives at the new system, the mobile user is required to update its location information prior to its reaching the boundary of two systems. Results in this study demonstrate that the new protocol yields significant benefits in terms of reducing signaling costs, delays, and call loss rates.", URL="http://portal.acm.org/browse\_dl.cfm?linked=1\&part=series\&idx=SERIES395\&coll=portal\&dl=ACM\&CFID=1761618\&CFTOKEN=27771328", } @TECHREPORT{ITU0101:Report, AUTHOR="{International Telecommunication Union (I}", TITLE="Report of the Secretary-General on {IP} Telephony", TYPE="Final report", INSTITUTION="International Telecommunications Union", ADDRESS="Geneva, Switzerland", NOTE="World Telecommunications Forum (WTPF)", MONTH=jan, YEAR=2001, KEYWORDS="IP telephony; packet audio", ABSTRACT="The increasing use of Internet Protocol (IP) networks for communication services, including applications such as telephony, has become a pivotal issue for the telecommunications industry worldwide. The possibility of transmitting voice over IP-based networks, with all its challenges and associated opportunities, such as voice and data integration, constitutes a milestone in the convergence of the communications sector. It also reflects a convergence between two network types that have emerged under very different policy and regulatory circumstances: the Public Switched Telephone Network (PSTN), based largely on circuit-switched technology, which has been fairly extensively regulated by most countries (until recently); the Internet, which is based on packet-switched technology, and which has evolved as a data network subject to few, if any, controls.", URL="http://www.enum.org/information/files/ITU\_WTPFfinalreport31Jan.pdf", } @ARTICLE{Colb0101:Advanced, AUTHOR="Raymond O. Colbert and Diane S. Compton and Randy L. Hackbarth and James Herbsleb and Laurie A. Hoadley and Graham J. Wills", TITLE="Advanced Services: Changing How We Communicate", JOURNAL=bltj, VOLUME=6, NUMBER=1, PAGES="221-228", MONTH=jan, YEAR=2001, LANGUAGE="English", REFERENCES=17, KEYWORDS="Presence; SIP; H.323; call manager; shared applications; collaborative work", ABSTRACT="This paper introduces three next-generation collaboration services designed to restore the human social interactions often lost in geographically distributed work environments. These servicesTeamPortal, ConnectIcon, and OpenChannelwill be delivered as a trial and demonstration system on the service access, mediation, and management (SAMM) platform. SAMM technology allows service providers to use the standard Lucent Softswitch to add converged voice and data services to their networks by employing service frameworks. These frameworks handle service interactions, including service session management; operations, administration, maintenance, and provisioning (OAM\&P); and billing. As examples of new revenue-generating services, the collaboration services demonstrate the advantages of a packet-based core network. This type of network provides always-on communication that creates an awareness of the presence of other team members and enables instant meetings and World-Wide-Web-based meeting areas for geographically distributed teams. SAMM, which interfaces with the Lucent Softswitch through the Java Telephony Application Programming Interface (JTAPI), takes advantage of all available means of establishing communication, including plain old telephone service (POTS), text-based messaging, and voice over IP (VoIP) using softphones, session initiation protocol (SIP), and ITU-T H.323 endpoints", } @TECHREPORT{Pagt0101:Model, AUTHOR="Theodoros Pagtzis and Peter Kirstein", TITLE="A Model for Proactive Seamless Mobility for {IPv6} Networks", INSTITUTION="UCL/CS", ADDRESS="London, United Kingdom", MONTH=jan, YEAR=2001, } @INPROCEEDINGS{Ivan0101:Mobile, AUTHOR="William D. Ivancic and David Stewart and Terry L. Bell and Brian A. Kachmar and Dan Shell and Kent Leung", TITLE="Mobile Router Technology Development", BOOKTITLE="4th ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2001", ADDRESS="Rome, Italy", PAGES="97-104", MONTH=jan, YEAR=2001, } @INPROCEEDINGS{Hong0101:Mobility, AUTHOR="Xiaoyan Hong and Taek Jin Kwon and Mario Gerla and Danyi Gu and Guangyu Pei", TITLE="A Mobility Framework for Ad Hoc Wireless Networks", BOOKTITLE="of ACM Second International Conference on Mobile Data Management, MDM '2001", ADDRESS="Hong Kong", MONTH=jan, YEAR=2001, } @ARTICLE{Rama0101:Capacity, AUTHOR="Ramu Ramamurthy and Zbigniew Bogdanowicz and Shahrokh Samieian and Debanjan Saha and Bala Rajagopalan and Sudipta Sengupta and Sid Chaudhuri and Krishna Bala", TITLE="Capacity performance of dynamic provisioning in optical networks", JOURNAL=ieeejlt, VOLUME=19, NUMBER=1, PAGES="40-48", MONTH=jan, YEAR=2001, LANGUAGE="English", ABSTRACT="This paper describes an architecture and analyzes the performance of dynamic provisioning of lightpaths in an optical network. In dynamic provisioning, a lightpath is set up in real-time without rearranging the working and protection routes of existing lightpaths, and without the knowledge of future lightpath provisioning events. This paper develops a general model of the physical topology of the optical network, and outlines routing approaches for dynamic provisioning of lightpaths. It analyzes via simulations the performance of dynamically provisioned unprotected, 1+1 protected and mesh-restored lightpaths. The analysis of the efficiency of network utilization of dynamic provisioning focuses on the spare capacity needed for protection, and in particular focuses on the impact of sharing of wavelength channels for mesh-restored lightpaths. The main conclusion from the performance studies is that significant capacity gains are achieved with sharing of wavelength-channels for mesh-restored lightpaths with dynamic provisioning even for sparse topologies, and even at moderate loads", } @UNPUBLISHED{McBr0101:Jena, AUTHOR="Brian McBride", TITLE="Jena: Implementing the {RDF} Model and Syntax Specification", NOTE="HP Labs", MONTH=jan, YEAR=2001, LANGUAGE="English", ABSTRACT="Some aspects of W3C's RDF Model and Syntax Specification require careful reading and interpretation to produce a conformant implementation. Issues have arisen around anonymous resources, reification and RDF Graphs. These and other issues are identified, discussed and an interpretation of each is proposed. Jena, an RDF API in Java based on this interpretation, is described.", } @ARTICLE{Poly0102:Adaptive, AUTHOR="Spyros Polykalas and George T. Kolyvas and Iakovos S. Venieris", TITLE="An adaptive congestion control mechanism for intelligent broadband networks", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="97-115", MONTH=feb, YEAR=2001, KEYWORDS="intelligent broadband networks; congestion control mechanism; modelling; simulation", ABSTRACT="The provision of novel multimedia services in broadband networks through intelligent network (IN) technology is a promising solution that guarantees fast deployment of new services and minimum changes to already operating networks. In this architecture, the broadband service control point (B-SCP) is the main actor in the processing of complex IN service requests. This centralized approach which is reflected in the multiplicity of tasks undertaken by the B-SCP in a broadband IN architecture, can easily lead to network performance degradation. Therefore, the presence of a congestion control mechanism operating at the level of calls is considered essential in order to protect the network nodes from overload conditions and to attain high levels of network performance. In this paper, we propose an adaptive congestion control mechanism (ACCM) which is able to guarantee the desirable quality of service under overload conditions. The proposed mechanism gradually reduces the message transmission rate from the source node to the destination node when overflow conditions have been detected, taking as feedback the buffer capacity state of the destination. Results, obtained by simulation show that the proposed ACCM improves the network performance by maximising the number of established calls and reducing the number of rejected calls.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Shar0102:CSMA, AUTHOR="Oran Sharon and Michael Spratt", TITLE="A {CSMA/CD} compatible {MAC} for real-time transmissions based on varying collision intervals", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="117-142", MONTH=feb, YEAR=2001, KEYWORDS="ethernet; CSMA/CD; real-time traffic; broadcast networks; home LAN", ABSTRACT="This paper suggests a CSMA/CD compatible MAC protocol for real-time transmissions in a shared Home or Small Office Local Area Network. The new MAC is based on the distributed assignment of special TAG numbers to the stations transmitting real-time traffic. These TAG numbers determine a Round Robin order of transmissions among the real-time stations. They also help in resolving collisions among real time stations by setting the length of the Jam signal, transmitted in case of a collision, to be a function of the TAG number. In a collision the station with the highest TAG number, and so with the longest Jam, is persisting with its Jam transmission for the longest until all the other stations defer. Thus, the collision terminates and the longest persisting station can transmit its packet successfully. The new protocol enables stations implementing the IEEE 802.3 MAC standard to transmit on the same network with stations implementing the new protocol. After introducing the protocol, we compute an upper bound on the access delay that the protocol guarantees and prove the correctness of the distributed TAG assignment procedure. Finally, we simulate the protocol in a network consisting stations implementing the new protocol together with stations implementing the standard IEEE 802.3 MAC. We show that the access delays of the stations transmitting real-time traffic are indeed bounded as predicted.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Venu0102:Heuristic, AUTHOR="K. R. Venugopal and M. Kumar and Puneet Kumar", TITLE="A heuristic for placement of limited range wavelength converters in all-optical networks", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="143-163", MONTH=feb, YEAR=2001, KEYWORDS="wavelength converters; WDM networks; lightpaths; congestion control; adjacent wavelength conversion", ABSTRACT="Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem [K.C. Lee, V.O.K. Li, IEEE J. Lightwave Technol. 11 (1993) 962-970] in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of optical signals is significantly high. We observe that limited range converters at few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 28-node US long haul network, hypothetical 30-node INET network and the results agree with the analysis.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Post0102:IMA, AUTHOR="Marcos Postigo-Boix and Joan Garca-Haro and Mnica Aguilar-Igartua", TITLE="{IMA:} technical foundations, application and performance analysis", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="165-183", MONTH=feb, YEAR=2001, KEYWORDS="inverse multiplexing for ATM; network planning; modeling", ABSTRACT="Using WAN established infrastructure, one of the main problems ATM network planners and users face, when greater than T1/E1 bandwidth is required, is the disproportionate cost associated with T3/E3 links. The technology to cover the gap between T1/E1 and T3/E3 bandwidth at a reasonable cost is known as inverse multiplexing for ATM (IMA). IMA allows multiple T1/E1 lines to be aggregated to support the transparent transmission of ATM cells over one single virtual trunk. In this paper, the fundamentals and major applications of IMA technology are described. Also, the behavior of IMA multiplexers is carefully analyzed and a method to dimension them proposed. For this purpose, an IMA simulation tool has been developed. The IMA simulator permits the study of individual devices and the evaluation of the end-to-end performance of a logical trunk under several ATM input traffic patterns. The analytical study is based on the comparison with an M/D/C/(N+C) queue system. Under Poisson input traffic, an approximation for the cell loss ratio (CLR) is derived and an estimate of the cell delay in an IMA multiplexer obtained. In addition, the suitability of these results for two types of bursty traffic is investigated.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Liu0102:Improving, AUTHOR="Chunlei Liu and Raj Jain", TITLE="Improving explicit congestion notification with the mark-front strategy", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", MONTH=feb, YEAR=2001, KEYWORDS="explicit congestion notification; mark-front; congestion control; buffer size requirement; fairness", ABSTRACT="Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet loss not only reduces TCP performance, but also adds large delay. Explicit congestion notification (ECN) delivers a faster indication of congestion and has better performance. However, current ECN implementations mark the packet from the tail of the queue. In this paper, we propose the mark-front strategy to send an even faster congestion signal. We show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Simulation results that verify our analysis are also presented.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Li0102:Switched, AUTHOR="Z. Li and Xin Yuan and Chun-Hung Wen and Boon Hee Soong", TITLE="A switched priority scheduling mechanism for {ATM} switches with multi-class output buffers", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="203-221", MONTH=feb, YEAR=2001, KEYWORDS="asynchronous transfer mode; switched priority scheduling mechanism; global convergence; multi-class; analysis", ABSTRACT="In this paper, we propose a switched priority scheduling mechanism for an Asynchronous Transfer Mode (ATM) switch with multi-class output buffers. The switched priority scheduling mechanism is composed of a model-based linear controller, a heuristic nonlinear controller and the corresponding switching law of the controllers. The nonlinear controller is first applied to bring each class buffer into a small neighborhood of its operating point such that the linear controller can be used. The linear controller is then used to ensure that each buffer occupancy converges to its desired operating point. The service rate of each class buffer is periodically computed and dynamically adjusted. We derive the design formulae of the control mechanism such that each buffer occupancy globally converges to its desired operating point related to quality-of-service requirements.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Desm0102:Broadcast, AUTHOR="Yvo Desmedt and Rei Safavi-Naini and Huaxiong Wang and Lynn Batten and Chris Charnes and Josef Pieprzyk", TITLE="Broadcast anti-jamming systems", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="223-236", MONTH=feb, YEAR=2001, KEYWORDS="anti-jamming; cover-free family; perfect hash family; key distribution pattern", ABSTRACT="In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Lee0102:Correctness, AUTHOR="David Lee and Kadangode K. Ramakrishnan and W. M. Moh", TITLE="Correctness and performance of the {ATM} {ABR} rate control scheme", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="237-261", MONTH=feb, YEAR=2001, ABSTRACT={We study both correctness and performance of the source/destination protocols of the available bit rate (ABR) service in asynchronous transfer mode (ATM) networks. Although the basic protocol for rate-based congestion management is relatively simple, the protocol specification has to cope with several "real-world" cases such as failures and delayed/lost feedback which introduce complexity. Rigorous proof of the correct functioning of the protocol based on a formal specification is necessary. We use a formal model to show that the ABR source/destination protocol is free of livelocks, so that under all conditions both resource management (RM) and data cells will be transmitted. Furthermore, if there are data cells available, then the ABR protocol is deadlock free; otherwise, the system goes to a desirable sleep state waiting for data cells, as long as certain parameters are set appropriately at connection setup. We also show that the network options of explicit forward congestion indication (EFCI) and explicit rate (ER) interoperate correctly. In addition to ensuring the correct functioning of the protocol, it is essential that pathological situations do not result in very poor performance, which we view as another form of "incorrect operation". We derive conditions that ensure that the source's allowed cell rate (ACR) is stable in the presence of delayed or lost feedback RM cells. We arrive at bounds on the number of consecutive RM cell losses tolerated while the ACR rate remains stable. We also provide an asymptotic estimate of ACR and the allowable RM cell loss probability to ensure that ACR is stable, statistically. The ABR protocol contributes to the feedback delay in two ways: the source delay of sending out the probe forward RM (FRM) cells and the destination delay of turning around the backward RM (BRM) cell. We provide a worst-case analysis of the delay in turning around RM cells at the destination station and the worst-case inter-departure time of FRM cells from the source.}, URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Cnod0102:Rate, AUTHOR="Stefaan De Cnodder and Omar Elloumi and Kenny Pauwels", TITLE="Rate adaptive shaping for the efficient transport of data traffic in diffserv networks", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="263-285", MONTH=feb, YEAR=2001, KEYWORDS="TCP; traffic shaping; diffServ; trTCM; traffic control", ABSTRACT="In this paper, we introduce the need for traffic shaping for the efficient transport of aggregate Internetworking traffic over Differentiated Services (DiffServ) networks. We propose a family of rate adaptive shapers (RASs) that aim at reducing the traffic burstiness. Although RASs can be used in either pure Best-Effort or any QoS enabled networks, our study is focused on their use in DiffServ networks where the traffic is subject to traffic control consisting of marking the packets according to a pre-negotiated traffic conditioning specification. RASs aim to increase the ratio of packets that are assigned the highest level of forwarding treatment by buffering and appropriate scheduling of packets before applying traffic control functions. The key ideas that motivate RASs design are introduced and evaluated by means of extensive simulations. Some additional enhancements are also discussed.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Tsao0102:Pre, AUTHOR="Shih-Chiang Tsao and Ying-Dar Lin", TITLE="Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="287-305", MONTH=feb, YEAR=2001, KEYWORDS="packet scheduling; fair queueing; round robin; deficit", ABSTRACT="In recent years, many packet fair queueing algorithms have been proposed to approximate generalized processor sharing (GPS). Most of them provide a low end-to-end delay bound and ensure that all connections share the link in a fair manner. However, scalability and simplicity are two significant issues in practice. Deficit Round Robin (DRR) requires only O(1) work to process a packet and is simple enough to be implemented in hardware. However, its large latency and unfair behavior are not tolerated. In this work, a new scheme, Pre-order Deficit Round Robin, is described, which overcomes the problems of DRR. A limited number, Z, of priority queues are placed behind the DRR structure to reorder the transmission sequence to approximate packet by packet generalized processor sharing (PGPS). We provide an analysis on latency and fairness, which shows our scheme as a better alternative to DRR. In most cases PDRR has a per-packet time complexity of O(1), and O(logZ) in other specific cases. Simulation results are also provided to further illustrate its average behavior.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Kaly0102:Admission, AUTHOR="Suresh Kalyanasundaram and Edwin Chong and", TITLE="Admission control schemes to provide class-level {QoS} in multiservice networks", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="307-326", MONTH=feb, YEAR=2001, KEYWORDS="quality of service; call admission control; class-level QoS; constrained Markov decision process; linear program", ABSTRACT="In this work, we consider the scenario where different classes of traffic with differing bandwidth requirements are to be supported over a link with finite capacity. The network will be required to meet class-level quality-of-service (QoS) constraints that are specified as relations between the call blocking probabilities of these traffic classes. The network will also be required to maintain maximum throughput performance. We develop two different admission control schemes that consider these two important criteria. First, we choose an objective that maximizes the throughput subject to the constraint that the maximum deviation from the desired class-level QoS is smaller than a certain pre-specified quantity. In the second approach, we choose an objective that minimizes the deviation from the desired class-level QoS subject to the throughput being greater than a pre-specified minimum value. We show how these problems can be converted to linear programming problems. We illustrate our schemes using numerical examples.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Cayi0102:PCS, AUTHOR="Erdal Cayirci and Cem Ersoy", TITLE="A {PCS} based architecture for tactical mobile communications", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="327-350", MONTH=feb, YEAR=2001, KEYWORDS="tactical communications; mobile subsystem; personal communications services; wideband code division multiple access", ABSTRACT="In this paper, we propose a novel resource management technique, namely virtual cell layout (VCL), for rapidly deployable wireless networks that can be operated in hostile environments. In VCL, the area of communications is tessellated with regularly shaped fixed size virtual cells. The radio resources such as frequency carriers and scrambling codes are assigned to the fixed cells of this layout. The real cells, which do not have to be identical in size to the virtual cells, are mobile over VCL. Mobile base stations that make up the real cells use the radio resources assigned to the virtual cell in which they are located. The terminals of the system access to the network, as they are the terminals of an ordinary cellular network. When the terminals are not in the coverage of any mobile base station, VCL helps them to be organized into clusters. The performance evaluation of the proposed system shows that the VCL based architecture satisfies the rapid deployment requirement and gives an acceptable grade of service.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Shir0102:End, AUTHOR="Shervin Shirmohammadi and Nicolas Georganas", TITLE="An end-to-end communication architecture for collaborative virtual environments", JOURNAL=cnis, VOLUME=35, NUMBER="2-3", PAGES="351-367", MONTH=feb, YEAR=2001, KEYWORDS="networked multiuser spaces; timely reliable communication; collaborative virtual environments; synchronous; tele-collaboration", ABSTRACT="Synchronous collaboration in virtual reality spaces has specific requirements that differ from those of other application data, leading to a different communication approach. Update messages corresponding to the change in the state of a shared object must be communicated both reliably and in a timely manner among users. While a lot of research has been done in terms of transmission of update messages representing the motion of avatars and objects, very few works focus on collaboration itself. Here, we present an architecture that supports tightly coupled collaborative tasks to be performed efficiently in virtual environments. The architecture consists of an application-general layer which is mapped into a communication protocol. An implementation is also presented as proof of concept.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Hami0102:FTP, AUTHOR="Martin Hamilton and A. Novikov", TITLE="{FTP} Mirror Tracker: first steps towards {URN}", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="130-136", MONTH=feb, YEAR=2001, KEYWORDS="FTP; Mirror site; Redirection", ABSTRACT="FTP Mirror Tracker1 is a software package (written in Perl and C++), which enables transparent, user-controlled redirection to the nearest anonymous FTP mirror sites that are exact replicas of the original source. This redirection can be achieved by using a Web Cache server or by making HTTP requests to the FTP Mirror Tracker directly. The Mirror Tracker also has internal URN support and can be used as a URN resolver for FTP requests. Underlying the system is a MySQL database recording FTP mirror site details. In this report we explain how this database is constructed, and show how it may be used directly by end users, and under the policy-based control of Web Cache and mirror service administrators", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/25/abstract.html", } @ARTICLE{Mark0102:Caching, AUTHOR="Evangelos Markatos", TITLE="On caching search engine query results", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="137-143", MONTH=feb, YEAR=2001, KEYWORDS="Caching; Search engines; High-performance computers", ABSTRACT="In this paper we explore the problem of Caching of Search Engine Query Results in order to reduce the computing and I/O requirements needed to support the functionality of a search engine of the World Wide Web. We study query traces from the EXCITE search engine and show that they have a significant amount of temporal locality that is, a significant percentage of the queries have been submitted more than once by the same or a different user. Using trace-driven simulation we demonstrate that medium-size caches can hold the results of most of the frequently submitted queries. Finally, we compare the effectiveness of static and dynamic caching and conclude that although dynamic caching can use large caches more effectively, static caching can perform better for (very) small caches.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/26/abstract.html", } @ARTICLE{Chi0102:Automatic, AUTHOR="Caixia Chi and Yu-Dar Lin and Chi-Hung Chi and Xiang-Yang Li and T. S. Chua", TITLE="Automatic proxy-based watermarking for {WWW}", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="144-154", MONTH=feb, YEAR=2001, KEYWORDS="Internet; Digital libraries; Copyright; Watermarking; Proxy server; Content transformation", ABSTRACT="With the appearance of digital libraries and information archive centers on the Internet, copyright issues are becoming very concerning. Unlike hardcopies, digital data can be modified and distributed very easily. Watermarking is the solution to this copyright problem. By embedding a secure, identifiable mark on the digital data, ownership and content integrity can be ensured. Currently, the watermarking process is usually done manually and off-line. This makes updating of watermarking techniques and watermark logo content difficult. Enforcement of watermarking policies within an organization for providing content on the Internet is also not easy. Furthermore, installing watermarking software on each workstation of an organization is not very cost effective. In this paper, we propose a novel approach to address the copyright issues of digital data on the Internet. The basic idea is to move the watermarking process from the content developers to a reverse proxy server that is usually close to the organization's gateway. Data will be watermarked only when it is retrieved through this proxy. The main advantages of this approach are that: (i) it is cost effective as being independent of the amount of data on the web server and also independent of the number of content developers in the organization, (ii) it makes updates and maintenance tasks easy, being an one-for-all solution, and (iii) the reverse proxy effectively enforces the watermarking guideline. Both design considerations and implementation details of watermarking in a fully functional, Squid-based reverse proxy server are presented and its performance is analyzed. All results show that automatic watermarking in a reverse proxy server is a practical, cost efficient and enforcement effective solution for handling copyright issues in Internet digital libraries.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/27/abstract.html", } @ARTICLE{Mogu0102:Server, AUTHOR="J. C. Mogul", TITLE="Server-directed transcoding", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="155-162", MONTH=feb, YEAR=2001, KEYWORDS="Server-directed transcoding; Transcoding applets", ABSTRACT="Transcoding, the conversion between different representations of Web content at an intermediate proxy, can ameliorate mismatches between the complex content provided by an origin server, and the limited bandwidth to, or display capabilities of, a Web client. Existing transcoding systems use implicit information, such as the HTTP Content-type, to control when and how they convert between representations. This approach must balance the risk of losing important information against the intended goal (such as bandwidth reduction), often without sufficient information to make the optimal choice. A new approach, server-directed transcoding, uses explicit guidance from the server to allow a transcoding proxy to make the best possible choice. This paper describes several possible approaches to server-directed transcoding, including transcoding applets, the use of mobile code to provide the origin server detailed control over transcoding performed by proxies. The paper discusses security, caching, and other operational issues associated with transcoding applets.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/28/abstract.html", } @ARTICLE{Kell0102:Optimal, AUTHOR="Terence Kelly and Douglas Reeves", TITLE="Optimal Web cache sizing: scalable methods for exact solutions", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="163-173", MONTH=feb, YEAR=2001, ABSTRACT="This paper describes two approaches to the problem of determining exact optimal storage capacity for Web caches based on expected workload and the monetary costs of memory and bandwidth. The first approach considers memory/bandwidth tradeoffs in an idealized model. It assumes that workload consists of independent references drawn from a known distribution (e.g. Zipf) and caches employ a", } @ARTICLE{Jin0102:GreedyDual, AUTHOR="Shudong Jin and Azer Bestavros", TITLE="GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="174-183", MONTH=feb, YEAR=2001, KEYWORDS="Web cache replacement; Temporal locality; Proxy caches", ABSTRACT="The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identification of the relative strengths of these two sources of temporal locality in a reference stream. In [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of temporal locality. These findings underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of temporal locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual*, which is a generalization of GreedyDual-Size. GreedyDual* uses the metrics proposed in [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual* when compared to other Web cache replacement policies proposed in the literature.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/30/abstract.html", } @ARTICLE{Will0102:Studying, AUTHOR="C. E. Wills and Mikhail Mikhailov", TITLE="Studying the impact of more complete server information on Web caching", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES=184, MONTH=feb, YEAR=2001, KEYWORDS="Web caching; Content reuse; Object composition; Object relationships; Change characteristics", ABSTRACT="Caching of objects in the World Wide Web is a widely used technique to reduce end-user latencies, network and server load. Currently deployed heuristic-based approaches to caching result in a large number of unnecessary validations, and prior results show potential for better reuse of cached Web content. This work studies a more deterministic approach to caching of Web objects. The idea is to view HTML pages as containers, holding distinct objects with heterogeneous type and change characteristics. Servers compile information about relationships between containers and embedded objects and piggyback it onto existing request/response traffic. Our results indicate that these techniques significantly improve existing cache management strategies.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/31/abstract.html", } @ARTICLE{Gulw0102:WebCaL, AUTHOR="S. Gulwani and A. Tarachandani and D. Gupta and Dheeraj Sanghi and L. P. Barreto and G. Muller and C. Consel", TITLE="{WebCaL} a domain specific language for web caching", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="191-201", MONTH=feb, YEAR=2001, KEYWORDS="WebCal; Domain specific language; Web caching", ABSTRACT="Web caching aims to improve the performance of the Internet in three ways by improving client latency, alleviating network traffic and reducing server load. A web cache is basically a limited store of information which helps in presenting a faster web-access environment to the clients. The performance of a cache depends on proper management of this information and effective inter-cache communication. The existing web caches have simple and hard-coded policies which are not best suited for all environments. They offer limited flexibility just in the form of changing some simple parameters such as cache size, peer caches, etc. This drawback motivates the need for a framework for building new web caches tailored to specific environments. In this paper, we describe a domain specific language based on an event-action model using which new local web cache policies and inter-cache protocols can be easily specified. This should make it possible to write a new policy or protocol quickly, evaluate its performance and test it thoroughly using the complete program-execute-debug cycle.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/32/abstract.html", } @ARTICLE{John0102:Measured, AUTHOR="Kenneth Johnson and J. Carr and Mark Day and M. Frans Kaashoek", TITLE="The measured performance of content distribution networks", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="202-206", MONTH=feb, YEAR=2001, KEYWORDS="Content distribution network; Akamai; Digital island", ABSTRACT="We have measured the performance of two commercial content distribution networks (CDNs), one operated by Akamai and one operated by Digital Island. Although there are differences in the implementation of these services, both CDNs redirect requests by using DNS. In this paper, we describe our simple measurement technique for a DNS-based CDN, our data for the two commercial services, and our interpretation of that data. Our main conclusion is that CDNs provide a valuable service, but that neither Akamai nor Digital Island can consistently pick the best server of those available. Contrary to some widely disseminated marketing messages, we argue that CDNs succeed not so much by choosing an", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/33/abstract.html", } @ARTICLE{Kang0102:Redirection, AUTHOR="Jussi Kangasharju and Keith W. Ross and J. W. Roberts", TITLE="Performance evaluation of redirection schemes in content distribution networks", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="207-214", MONTH=feb, YEAR=2001, KEYWORDS="Content distribution network; Redirection schemes; Simulation models", ABSTRACT="Content distribution on the Web is moving from an architecture where objects are placed on a single, designated server to an architecture where objects are replicated on geographically distributed servers and clients transparently access a nearby copy of an object. In this paper we study how the different redirection schemes used in modern content distribution networks affect the user-perceived performance in normal Web page viewing. Using both simulations and experiments with real Web servers we show that redirection schemes that require clients to retrieve different parts of a Web page from different servers yield sub-optional performance compared to schemes where a client accesses only one server for all the parts of a Web page. This implies that when replicating Web pages, we should treat the whole page (HTML and images) as a single entity.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/34/abstract.html", } @ARTICLE{Nott0102:Defining, AUTHOR="M. Nottingham", TITLE="On defining a role for demand-driven surrogate origin servers", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="215-221", MONTH=feb, YEAR=2001, KEYWORDS="Demand-driven; Surrogate origin servers; High-traffic sites", ABSTRACT="This paper examines the common uses and characteristics of demand-driven surrogate origin servers (also known as reverse proxies and HTTP accelerators), attempts to motivate the definition of a distinct role for them, suggests items for consideration during the development of such a framework, and identifies issues associated with current implementations. The author's primary goal is to encourage discussion and further research of these points.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/35/abstract.html", } @ARTICLE{Gadd0102:Web, AUTHOR="Syam Gadde and Jeff Chase and Michael Rabinovich", TITLE="Web caching and content distribution: a view from the interior", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="222-231", MONTH=feb, YEAR=2001, KEYWORDS="Web caching; Content distribution; Interior cache servers", ABSTRACT="Research in Web caching has yielded analytical tools to model the behavior of large-scale Web caches. Recently, Wolman et al. (Proceedings of the 17th ACM Symposium on Operating Systems Principles, December 1999) have proposed an analytical model and used it to evaluate the potential of cooperative Web proxy caching for large populations. This paper shows how to apply the Wolman model to study the behavior of interior cache servers in multi-level caching systems. Focusing on interior caches gives a different perspective on the model's implications, and it allows three new uses of the model. First, we apply the model to large-scale caching systems in which the interior nodes belong to third-party content distribution services. Second, we explore the effectiveness of content distribution services as conventional Web proxy caching becomes more prevalent. Finally, we correlate the model's predictions of interior cache behavior with empirical observations from the root caches of the NLANR cache hierarchy.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/36/abstract.html", } @ARTICLE{Pier0102:Differentiated, AUTHOR="G. Pierre and I. Kuz and M. van Steen and A. S. Tanenbaum", TITLE="Differentiated strategies for replicating Web documents", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="232-240", MONTH=feb, YEAR=2001, KEYWORDS="Web documents; Replication protocols; Document consistency", ABSTRACT="Replicating Web documents reduces user-perceived delays and wide-area network traffic. Numerous caching and replication protocols have been proposed to manage such replication while keeping the document copies consistent. We claim, however, that no single caching or replication policy can efficiently manage all documents. Instead, we propose that each document be replicated with a policy specifically tailored to it. We have collected traces on our university's Web server and conducted simulations to determine the performance such tailored policies would produce, as opposed to using the same policy for all documents. The results show a significant performance improvement with respect to end-user delays, wide-area network traffic and document consistency. We also present how these results can be used to build adaptive replicated Web documents, capable of automatically selecting the policy that best suits them.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/37/abstract.html", } @ARTICLE{MacL0102:Policy, AUTHOR="Glen MacLarty and Michael Fry", TITLE="Policy-based content delivery: an active network approach", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="241-248", MONTH=feb, YEAR=2001, KEYWORDS="Content delivery; Policy; Active Network; Dynamic proxy server; Content transcoding", ABSTRACT="This paper describes an active network architecture that provides the ability to load code dynamically to facilitate user-based content delivery. The improvements to the base architecture are outlined to define a new architecture that provides flexible content delivery based on specific user preferences. We describe an architecture which allows individual users to define behaviour by specifying content delivery or transcoding proxylets through user-defined policies. This architecture is shown to be non-impacting on client and server architectures, and allowing modification to the type of content delivered as well as to the method in which it is delivered.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/38/abstract.html", } @ARTICLE{Rodr0102:TPOT, AUTHOR="Pablo Rodriguez and Sandeep Sibal and Oliver Spatscheck", TITLE="{TPOT:} translucent proxying of {TCP}", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="249-255", MONTH=feb, YEAR=2001, KEYWORDS="TCP; Translucent proxying; Web proxy networks", ABSTRACT="Transparent proxies are being widely deployed in the current Internet to enable a vast variety of applications. These include Web proxy caching, transcoding, service differentiation and load balancing. To ensure that all IP packets of an intercepted TCP connection are seen by the intercepting transparent proxy, they must sit at focal points in the network. Translucent proxying of TCP (TPOT) overcomes this limitation by using TCP-OPTIONs and IP tunneling to ensure that all IP packets belonging to a TCP connection will traverse the proxy that intercepted the first packet. This guarantee allows the ad hoc deployment of TPOT proxies anywhere within the network. No extra signaling support is required. In addition to the advantages TPOT proxies offer at the application level, they also generally improve the throughput of intercepted TCP connections. In this paper we discuss the TPOT protocol, explain how it enables various applications, address deployment and scalability issues, and summarize the impact of TPOT on TCP performance.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/39/abstract.html", } @ARTICLE{Paul0102:Distributed, AUTHOR="Sanjoy Paul and Zongming Fei", TITLE="Distributed caching with centralized control", JOURNAL=comcom, VOLUME=24, NUMBER=2, PAGES="256-268", MONTH=feb, YEAR=2001, KEYWORDS="Centralized control; Hit ratio; Traffic on backbone; Distributed caching", ABSTRACT="The benefits of using caches for reducing traffic in backbone trunk links and for improving web access times are well-known. However, there are some known problems with traditional web caching, namely, maintaining freshness of web objects, balancing load among a number of caches and providing protection against cache failure. This paper investigates in detail the advantages and disadvantages of a distributed architecture of caches which are coordinated through a central controller. In particular, the performance of a set of independent caches is compared against the performance of a set of coordinated distributed caches using extensive simulation. The conclusion is that a distributed architecture of coordinated caches consistently provides a better hit ratio, improves response time, provides better freshness, achieves load balancing, and increases the overall traffic handling capacity of a network while paying a small price in terms of additional control traffic. In particular, we have observed up to 40\% improvement in hit ratio, 70\% improvement in response time, 60\% improvement in freshness and 25\% improvement in traffic handling capacity of a network with caches.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/27/40/abstract.html", } @ARTICLE{Kwon0102:Location, AUTHOR="J. Kwon and Min Young Chung and Dan Keun Sung", TITLE="A location management scheme to support non-geographic phone numbers in personal communications services", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="271-283", MONTH=feb, YEAR=2001, KEYWORDS="Personal communications system; Location management; Non-geographic phone number; Location registration; Call delivery", ABSTRACT="Subscribers in future personal communications system (PCS) networks will be assigned portable personal numbers, or non-geographic phone numbers (NGPNs), which will not indicate the service provider and home location register (HLR) database which serves the subscribers. A location management scheme for future PCSs based on a three-level hierarchical database architecture, which consists of a directory register (DR), regional location registers (RLRs), and visitor location registers (VLRs), is proposed under the assumption of local property in both called party distribution and user mobility. In addition to inherently providing non-geographic phone numbers, the proposed scheme reduces the number of database access attempts and the signaling cost for location management.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/24/abstract.html", } @ARTICLE{Huan0102:Modeling, AUTHOR="Tzu-Chi Huang", TITLE="Analysis and modeling of a threshold based priority queueing system", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="284-291", MONTH=feb, YEAR=2001, KEYWORDS="Modeling; Waiting time; Queueing system", ABSTRACT="This paper proposes a threshold based priority scheme to provide adequate quality of service to high priority traffic while providing the best possible service to low priority traffic. Two thresholds are used to control the average waiting time of each class of traffic in the queue. The proposed threshold based priority scheme is analyzed based on the three-dimension Markov chain. According to the results, the parameters of this scheme can be tuned dynamically to achieve the delay requirement of each class of traffic.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/25/abstract.html", } @ARTICLE{Will0102:Multilevel, AUTHOR="Emlio C. G. Wille and Walter Godoy", TITLE="Multilevel coding modulation system with binary block codes", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="292-295", MONTH=feb, YEAR=2001, KEYWORDS="Coding modulation; Block codes; Single encoder and decoder", ABSTRACT="This paper proposes an original system for the attainment of codes for multilevel coding modulation. These codes are made up of short binary block codes and are found through computer search. Some of these codes are shown here. The decoding of the proposed codes is easy, due to its binary representation. A comparison with Sayegh's and Baldini's codes is made and the decoding simulation results of some codes are shown.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/26/abstract.html", } @ARTICLE{Yoo0102:New, AUTHOR="S. J. Ben Yoo and Seung-Hoon Kim", TITLE="A new multi-level statistical model for variable bit rate {MPEG} sources over {ATM} networks and its performance study", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="296-307", MONTH=feb, YEAR=2001, KEYWORDS="Traffic modeling; MPEG; Scene-based model; ATM networks; Variable bit rate", ABSTRACT="In this paper, we propose a new traffic model for MPEG-coded video sequences. The proposed modeling scheme uses scene-based traffic characteristics and considers the correlations between frames of consecutive group of pictures (GOPs). Using a simple scene detection algorithm, scene changes are modeled by a state transition matrix and the number of GOPs of a scene state is modeled by a geometric distribution. Frames of a scene are modeled by the mean I, P, and B frame sizes of each state. For more accurate traffic modeling, the residual bits that represent the difference between the original frame size and the mean frame size of each frame type are compensated by autoregressive processes. The modeling results show that our scene-based model can capture the statistical traffic characteristics of the original video sequences well and estimate the queueing performance with good approximation quality.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/27/abstract.html", } @ARTICLE{Huan0102:Ratioed, AUTHOR="Chenn-Jung Huang and Wei Lai and Chua-Chin Wang and Yu-Jyr Jin and Hsin Wei Chen", TITLE="A ratioed channel assignment scheme for initial and handoff calls in mobile cellular systems", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="308-318", MONTH=feb, YEAR=2001, KEYWORDS="Channel assignment; Mobile cellular systems; Personal communication service (PCS); Blocking probability", ABSTRACT="In this paper, we present two schemes to improve the call completion probability of initial and handoff calls in mobile cellular systems. All the previous schemes give priority to handoff calls over initial calls to avoid the forced termination of calls in progress. We observe that giving priority to handoff calls would not yield better call completion probability in general. Moreover, the proportion of handoff to initial attempts in service will influence the call completion probability if both handoff and initial calls are queued. Our theoretical analysis and the simulation results both show that the proposed schemes are better than the NPS scheme and the FIFO scheme when the performance is measured in terms of call completion probability.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/28/abstract.html", } @ARTICLE{Bour0102:Test, AUTHOR="C. Bourhfir and El Mostapha Aboulhamid and Rachida Dssouli and Nathalie Rico", TITLE="A test case generation approach for conformance testing of {SDL} systems", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="319-333", MONTH=feb, YEAR=2001, KEYWORDS="Communicating extended finite state machine (CEFSM); Testing in context; Embedded testing; Partial product; Reachability analysis; Control and data flow testing; Executability", ABSTRACT="This paper presents an approach for automatic executable test case and test sequence generation for a protocol modeled by an SDL system. Our methodology uses a unified method which tests an Extended Finite State Machine (EFSM) based system by using control and data flow techniques. To test an SDL system, it extracts an EFSM from each process then the system is tested by incrementally computing a partial product for each EFSM C, taking into account only transitions which influence (or are influenced by) C, and generating test cases for it. This process ends when the coverage achieved by the generated test cases is satisfactory or when the partial products for all EFSMs are tested. Experimental results show that this method can be applied to systems of practical size.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/29/abstract.html", } @ARTICLE{Mich0102:Reference, AUTHOR="Angelos Michalas and Theodore Kotsilieris and Stylianos Kalogeropoulos and E. Kayafas V. Loumos and V. Kollias", TITLE="A reference model for conformance testing of {T.120} multimedia conferencing protocols", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="334-343", MONTH=feb, YEAR=2001, KEYWORDS="Multimedia conferencing; Conformance testing; T.120 protocols", ABSTRACT="This paper presents a testing methodology to check the conformity of implementations following the ITU-T.120 Multimedia Conferencing protocol (ITU-T Recommendation T.120: data protocols for multimedia conferencing, 1996). The study takes into account the stateless and complex nature of the T.120 protocols and provides a method of compatibility testing appropriate for complex protocol implementations. For this purpose a Reference Model for conformance testing of T.120 systems is defined. A testing tool called Reference Tester/Implementation System has been implemented according to the Reference Model specifications and a test strategy for ensuring compatibility testing is defined. To illustrate the effectiveness of the system, test coverage of testing architectures defined in ISO/IEC 9646-2 (Information technologyopen systems interconnectionconformance testing methodology and frameworkPart 2: Abstract Test Suite Specification, 1994) is shown and the relative conclusions are deducted.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/30/abstract.html", } @ARTICLE{Yoon0102:Adaptive, AUTHOR="Seokhyun Yoon and Saewoong Bahk", TITLE="An adaptive {QoS} guaranteeing {MAC} protocol for real-time traffic in {TDMA-based} wireless {ATM} networks", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="344-352", MONTH=feb, YEAR=2001, KEYWORDS="Adaptive guaranteeing; MAC protocol; TDMA-based wireless ATM networks", ABSTRACT="This paper presents a new media access control (MAC) protocol based on forward error control (FEC), which is appropriate for supporting real-time traffic with strict QoS requirements in wireless ATM networks. As the channel BER in wireless environments is very high and varying 105-102, previous schemes that use powerful FEC have combated to overcome this noisy channel condition at the cost of valuable bandwidth. As most previous works have been dedicated to maximize the channel efficiency, they were not able to meet QoS requirements of real-time applications in wireless networks. A new MAC protocol proposed in this paper is designed to guarantee the throughput requested by a real-time traffic user while keeping the bandwidth consumption at a minimum. The proposed scheme is for a TDMA system and uses adaptive FEC. We analyze the wireless channel and model it as a two-state error control system to design an efficient MAC protocol. We use simulation experiments to show how the proposed scheme provides QoS guarantees, and compare it with the CDMA system in terms of capacity, i.e. the number of users that can be supported.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/31/abstract.html", } @ARTICLE{Lim0102:Flooding, AUTHOR="Hyuk Lim and Chong Sang Kim", TITLE="Flooding in wireless ad hoc networks", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="353-363", MONTH=feb, YEAR=2001, KEYWORDS="Ad", ABSTRACT="In an ad hoc network, each host assumes the role of a router and relays packets toward final destinations. This paper studies efficient routing mechanisms for packet flooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing are different from that of the wired network routing. We show that the minimum cost flooding tree problem is similar to MCDS (Minimum Connected Dominating Set) problem and prove the NP-completeness of the minimum cost flooding tree problem. Then, we propose two flooding methods: self-pruning and dominant pruning. Both methods utilize the neighbor information to reduce redundant transmissions. Performance analysis shows that both methods perform significantly better than the blind flooding. Especially, dominant pruning performs close to the practically achievable best performance limit.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/32/abstract.html", } @ARTICLE{Shen0102:Efficient, AUTHOR="Gangxiang Shen and S. K. Bose and T. Cheng and Chung-Chin Lu and T. Y. Chai", TITLE="Efficient heuristic algorithms for light-path routing and wavelength assignment in {WDM} networks under dynamically varying loads", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="364-373", MONTH=feb, YEAR=2001, KEYWORDS="Wavelength division multiplexing; Non-wavelength continuous; Wavelength continuous; Wavelength assignment; Light-path routing", ABSTRACT="This paper presents heuristic algorithms that may be used for light-path routing and wavelength assignment in optical WDM networks under dynamically varying traffic conditions. We consider both the situations where the wavelength continuity constraint is enforced or not enforced along a light-path. The performance of these algorithms has been studied through simulations. We also compare their performance with that of a simpler system that uses fixed shortest-path routing. Our proposed algorithms provide lower blocking probabilities and are simple enough to be applied for real time network control and management. The heuristic algorithms are computationally simple and efficient to implement and provide good wavelength utilisation leading to efficient usage of the network's resources.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/33/abstract.html", } @ARTICLE{Prob0102:Rapid, AUTHOR="R. L. Probert and Hasan Ural and Alan W. Williams", TITLE="Rapid generation of functional tests using {MSCs,} {SDL} and {TTCN}", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="374-393", MONTH=feb, YEAR=2001, KEYWORDS="Functional testing; Specification and description language; Tree and tabular combined notation; Message sequence chart; Formal description techniques; Test generation", ABSTRACT="This paper reports the results of a study undertaken to determine the suitability of CASE tools and formal methods for systematic, rapid generation of functional test cases. In particular, the study involves the use of Message Sequence Charts (MSCs) [International Telecommunications Union (ITU-T), Recommendation Z.120: Message Sequence Charts, revised 1996], Specification and Description Language (SDL) [International Telecommunications Union (ITU-T), Recommendation Z.100: Specification and Description Language, revised 1996] and Tree and Tabular Combined Notation (TTCN) [International Standards Organization (ISO), OSI Conformance Testing Methodology and FrameworkPart 3: The Tree and Tabular Combined Notation, International Standard 9646-3, 1992] and the use of the Telelogic Tau tool set [Telelogic Tau tool set, version 3.3, Telelogic AB, Malmo Sweden] which supports all three of these languages.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/34/abstract.html", } @ARTICLE{Adam0102:Integrated, AUTHOR="Dionisis Adamopoulos and George Pavlou and Constantine A. Papandreou", TITLE="An integrated and systematic approach for the development of telematic services in heterogeneous distributed platforms", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="394-415", MONTH=feb, YEAR=2001, KEYWORDS="Service development methodology; Service creation; Service engineering; New telecommunications services; Service life-cycle", ABSTRACT="The advent of deregulation combined with new opportunities opened by advances in telecommunications technologies has significantly changed the paradigm of telecommunications services, leading to a dramatic increase in the number and type of services that telecommunication companies can offer. Building new advanced multimedia telecommunications services in a distributed and heterogeneous environment is very difficult, unless there is a methodology to support the entire service development process in a structured and systematic manner, and assist and constrain service designers and developers by setting out goals and providing specific means to achieve these goals. Therefore, in this paper, after a brief examination of important service engineering matters and service modelling issues, a service creation methodology a proposed and presented focusing on its essential characteristics. The application of this methodology to the development of a multimedia conferencing service for education and training is then examined and a possible enhancement of the methodology through the use of design patterns and frameworks is considered finally.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/35/abstract.html", } @ARTICLE{Layu0102:QoS, AUTHOR="Li Layuan and Li Chunling", TITLE="QoS-based routing algorithms for {ATM} networks", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="416-421", MONTH=feb, YEAR=2001, KEYWORDS="ATM networks; Routing algorithms; QoS; Multicast", ABSTRACT="This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI specification from the ATM Forum. It uses an adaptive and iterative path search approach and takes advantage of the PNNI hierarchical network structure to reduce path computation complexity and maximize network throughput. The performances of the PRA and HRA are evaluated by simulations. The simulation results show that the PRA can provide the best performance while the complexity is acceptable and the HRA can reduce processing time and improve network utilization, and both are suited for QoS requirements of ATM networks' routing.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/36/abstract.html", } @ARTICLE{Yeh0102:Reversing, AUTHOR="Yi-Shiung Yeh and Chin-Ching Chiu", TITLE="A reversing traversal algorithm to predict deleting node for the optimal k-node set reliability with capacity constraint of distributed systems", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="422-433", MONTH=feb, YEAR=2001, KEYWORDS="Reversing traversal algorithm; Distributed systems; Reliability optimization; k-node set reliability", ABSTRACT="A k-node set reliability with capacity constraint is defined as the probability that a set, K, of nodes is connected in a distributed system and the total capacity of the nodes in K is sufficient under a given capacity. This is generally an NP-hard problem. For reducing computational time, a reasonable k-node set within a given capacity constraint must be determined by an efficient algorithm. In this work, we propose a reversing traversal method to derive a k-node set under capacity constraint having an approximate solution. Initially, the set K is assigned to all the nodes in a system. The proposed algorithm uses an objective function to evaluate the fitness value of each node in K and predict a deleting node, which is not a critical node, in K with minimal fitness value. After deleting the node, the fitness value of each node that is adjacent to the deleted node is tuned. The above two processes are repeated until the total capacity of the nodes in each subset of the set K does not satisfy the capacity constraint. In our simulation, the proposed method can obtain an exact solution above 90\%. When a sub-optimal solution is obtained, the average deviation from an exact solution is under 0.0033. Computational results demonstrate that the proposed algorithm is efficient in execution time and effective for obtaining an optimal k-node set with capacity constraint.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/37/abstract.html", } @ARTICLE{Chen0102:Resource, AUTHOR="Jiann-Liang Chen and Jian-Hong Gong and Han-Chieh Chao", TITLE="Resource reservation with mobile hosts using fuzzy matrices", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="434-444", MONTH=feb, YEAR=2001, KEYWORDS="Mobile computing; Resource reservation; Fuzzy matrices; Mobility specification; Quality of service", ABSTRACT="To provide high QoS (Quality of Service) with mobile hosts, service managers must first make resource reservations at subsequent locations to which mobile hosts may visit during the lifetime of the connection. In this paper, we propose a mechanism based on Fuzzy Matrices with movement directions and mobility specifications to predict the locations that a mobile host will visit. Through the fuzzification, defuzzification, and inference procedures, a resource reservation scheduling was performed. Our study indicates that the proposed strategy may significantly reduce the mean inefficiency (miss rate) and operating cost at 27 and 32\%, respectively, compared with other approaches at the expense of a small blocking rate.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/38/abstract.html", } @ARTICLE{Huan0102:New, AUTHOR="Tzu-Chi Huang", TITLE="A new shared-buffer packet switch in {ATM} networks", JOURNAL=comcom, VOLUME=24, NUMBER=3, PAGES="445-451", MONTH=feb, YEAR=2001, KEYWORDS="ATM networks; Fairness; Shared-buffer; Switch", ABSTRACT="To improve overall cell loss rate and fairness problem in shared-buffer switches, a new output-queued shared-buffer switch is proposed in this paper. In the proposed shared-buffer switches, a novel structure of output queues is used to improve the behavior of cell loss rate and resolve the fairness problem. Performance of the proposed output-queued shared-buffer switch is analyzed and compared. According to the analyzed results, the proposed shared-buffer switches show superior performance and overcome the fairness problem. Besides, the proposed buffer architecture is simple to implement in the high-speed packet switches.", URL="http://www.elsevier.nl/gej-ng/10/15/19/47/30/39/abstract.html", } @ARTICLE{Awey0102:Discrete, AUTHOR="James Aweya and Michel Ouellette and Delfin Montuno", TITLE="Discrete-time analysis of a rate control mechanism", JOURNAL=pe, VOLUME=43, NUMBER=2, PAGES="63-94", MONTH=feb, YEAR=2001, KEYWORDS="ATM; Available bit rate; Congestion control; Feedback control; Stability analysis", ABSTRACT="A large number of research studies have been done on rate control algorithms. However, many of the proposed algorithms are complex and not scalable to high speeds and large number of connections. In most cases, it is difficult to quantitatively analyze their stability. Our aim in this paper is to provide insight into the design and analysis of a simple, scalable, and provably stable fair rate allocation algorithm. Using discrete-time linear analysis, we analyze quantitatively the performance of the rate control algorithm.", URL="http://www.elsevier.nl/gej-ng/10/35/22/48/25/22/article.pdf", } @ARTICLE{Herr0102:Complete, AUTHOR="Christoph Herrmann", TITLE="The complete analysis of the discrete time finite {DBMAP/G/1/N} queue", JOURNAL=pe, VOLUME=43, NUMBER=2, PAGES=95, MONTH=feb, YEAR=2001, ABSTRACT="A comprehensive analysis of the DBMAP/G/1/N queueing system for both the", } @ARTICLE{Chau0102:Computing, AUTHOR="M. L. Chaudhry and U. C. Gupta", TITLE="Computing waiting-time probabilities in the discrete-time queue: {GIX/G/1}", JOURNAL=pe, VOLUME=43, NUMBER=2, PAGES="123-131", MONTH=feb, YEAR=2001, KEYWORDS="Discrete time; Bulk arrival; Waiting time", ABSTRACT="In this paper, we consider the discrete-time bulk-arrival GIX/G/1 queue and propose a simple procedure for computing waiting-time probabilities of the first and the random customers. As can be seen from our analysis that even analytic procedure is simpler than the one discussed by Murata and Miyahara [Performance Evaluation 13 (1991) 87]. Further, the procedure discussed here works for both finite and specialized infinite support interarrival-/service-time distributions such as geometric and negative binomial.", URL="http://www.elsevier.nl/gej-ng/10/35/22/48/25/24/article.pdf", } @ARTICLE{Leem0102:Waiting, AUTHOR="H. Leemans", TITLE="Waiting time distribution in a two-class two-server heterogeneous priority queue", JOURNAL=pe, VOLUME=43, NUMBER=2, PAGES="133-150", MONTH=feb, YEAR=2001, KEYWORDS="Heterogeneous priority queue; Matrix-geometric; Waiting times; Markovian", ABSTRACT="Our aim is to analyze a Markovian two-class two-server queue with non-preemptive heterogeneous priority structures. We use matrix-geometric methods and derive the stationary distribution of queue lengths. To obtain the distribution of waiting times, we develop a dedicated algorithm by extending the approach of Ramaswami and Lucantoni.", URL="http://www.elsevier.nl/gej-ng/10/35/22/48/25/25/article.pdf", } @ARTICLE{Bere0102:Efficient, AUTHOR="S. A. Berezner and A. Krzesinski", TITLE="An efficient stable recursion to compute multiservice blocking probabilities", JOURNAL=pe, VOLUME=43, NUMBER=2, PAGES="151-164", MONTH=feb, YEAR=2001, KEYWORDS="Call blocking probability; Erlang-B system; Multiservice broadband networks; Stochastic knapsack", ABSTRACT="Quality of service issues are becoming increasingly important in broadband multiservice networks which transport many call classes with widely different bandwidth requirements. The call blocking probability is a major component in the analysis of the QoS. Recursive methods are available to compute the call blocking probabilities the storage and computation needed to compute the recursion are O(C) and O(KC2), respectively, where C is proportional to the bandwidth of the link and K the number of call classes. A necessary property of the recursion is that it is not subject to numerical problems such as imprecision and overflow. This is an essential consideration given the large values that K and C assume in modern networks. We present a new recursion to compute the call blocking probabilities. In addition to being numerically stable, the main features of our recursion are its simplicity and its reduced storage and computation requirements which are O(bK) and O((K+bK)C), respectively, where the class indices are ordered so that calls of class K have the largest bandwidth requirement bK. The computational requirements of our algorithm are significantly lower than those of comparable algorithms, especially when bK<