@Preamble{
"\input bibnames.sty"
# "\input path.sty"
# "\ifx \undefined \bioname \def \bioname#1{{{\em #1\/}}} \fi"
# "\ifx \undefined \k \let \k = \c \fi"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}
@Article{Abbott:1993:LAP,
author = "Mark B. Abbott and Larry L. Peterson",
title = "A language-based approach to protocol implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "4--19",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p4-abbott/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; languages;
performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, Specialized application languages.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Rangan:1993:CAA,
author = "P. Venkat Rangan and Harrick M. Vin and Srinivas
Ramanathan",
title = "Communication architectures and algorithms for media
mixing in multimedia conferences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "20--30",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p20-rangan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement;
performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf H.5.1}
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems. {\bf
C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf H.4.3} Information Systems, INFORMATION SYSTEMS
APPLICATIONS, Communications Applications, Computer
conferencing, teleconferencing, and videoconferencing.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Message sending. {\bf D.4.4} Software,
OPERATING SYSTEMS, Communications Management, Network
communication.",
}
@Article{Ramaswami:1993:ALE,
author = "V. Ramaswami and Jonathan L. Wang",
title = "Analysis of the link error monitoring protocols in the
common channel signaling network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "31--47",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p31-ramaswami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement;
performance",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network monitoring. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Wang:1993:FDM,
author = "Clark Wang and Mischa Schwartz",
title = "Fault detection with multiple observers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "48--55",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p48-wang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management",
subject = "{\bf C.1.3} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Other Architecture Styles. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations, Network management.",
}
@Article{Estrin:1993:PRE,
author = "Deborah Estrin and Martha Steenstrup and Gene Tsudik",
title = "A protocol for route establishment and packet
forwarding across multidomain {Internets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "56--70",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p56-estrin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.",
}
@Article{Garrett:1993:JSC,
author = "Mark W. Garrett and Martin Vetterli",
title = "Joint source\slash channel coding of statistically
multiplexed real-time services on packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "71--80",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p71-garrett/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.3}
Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS, Signal processing systems.",
}
@Article{Humblet:1993:BTA,
author = "Pierre Humblet and Amit Bhargava and Michael G.
Hluchyj",
title = "Ballot theorems applied to the transient analysis of
{nD/D/1} queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "81--95",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p81-humblet/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf D.4.8}
Software, OPERATING SYSTEMS, Performance, Queueing
theory.",
}
@Article{Sharon:1993:SSS,
author = "Oran Sharon and Adrian Segall",
title = "A simple scheme for slot reuse without latency for a
dual bus configuration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "96--104",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p96-sharon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Access schemes. {\bf B.4.3} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections
(Subsystems), Topology.",
}
@Article{Chung:1993:CAB,
author = "Shun-Ping Chung and Arik Kashper and Keith W. Ross",
title = "Computing approximate blocking probabilities for large
loss networks with state-dependent routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "105--115",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p105-chung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; measurement; performance",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Access schemes. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks.",
}
@Article{Miller:1993:GMC,
author = "Raymond E. Miller and Sanjoy Paul",
title = "On the generation of minimal-length conformance tests
for communication protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "116--129",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p116-miller/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; reliability; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf B.4.5} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Reliability, Testing, and
Fault-Tolerance**, Test generation**. {\bf F.1.1}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Models of Computation, Automata. {\bf F.3.1} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques.",
}
@Article{Garcia-Lunes-Aceves:1993:LRU,
author = "J. J. Garcia-Lunes-Aceves",
title = "Loop-free routing using diffusing computations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "130--141",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p130-garcia-lunes-aceves/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Path and circuit problems.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf F.2.2} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.2.4} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems.",
}
@Article{Chen:1993:SFP,
author = "David X. Chen and Jon W. Mark",
title = "{SCOQ}: a fast packet switch with shared concentration
and output queueing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "1",
pages = "142--151",
month = feb,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-1/p142-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks.",
}
@Article{Zhong:1993:CNS,
author = "Wen De Zhong and Jaidev Kaniyil and Y. Onozato",
title = "A copy network with shared buffers for large-scale
multicast {ATM} switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "157--165",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p157-de_zhong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Ramanathan:1993:SAM,
author = "Subramanian Ramanathan and Errol L. Lloyd",
title = "Scheduling algorithms for multihop radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "166--177",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p166-ramanathan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement;
performance",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Woodside:1993:ASA,
author = "C. Murray Woodside and R. Greg Franks",
title = "Alternative software architectures for parallel
protocol execution with synchronous {IPC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "178--186",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p178-woodside/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; standardization",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf F.1.2} Theory of Computation, COMPUTATION
BY ABSTRACT DEVICES, Modes of Computation, Parallelism
and concurrency. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Open Systems Interconnection reference model (OSI).",
}
@Article{Orda:1993:MDR,
author = "Ariel Orda and Raphael Rom and Moshe Sidi",
title = "Minimum delay routing in stochastic networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "187--198",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p187-orda/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Papadopoulos:1993:EES,
author = "Christos Papadopoulos and Gurudatta M. Parulkar",
title = "Experimental evaluation of {SUNOS IPC} and {TCP\slash
IP} protocol implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "199--216",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p199-papadopoulos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; measurement; performance;
standardization",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf G.m} Mathematics of
Computing, MISCELLANEOUS, Queueing theory**.",
}
@Article{Kristol:1993:PAG,
author = "David M. Kristol and David Lee and Arun N. Netravali
and Krishan Sabnani",
title = "A polynomial algorithm for gateway generation from
formal specifications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "217--229",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p217-kristol/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; standardization",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol architecture. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology. {\bf F.1.1}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Models of Computation, Automata. {\bf F.1.3} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES,
Complexity Measures and Classes.",
}
@Article{Wang:1993:EEC,
author = "Qinglin Wang and Victor S. Frost",
title = "Efficient estimation of cell blocking probability for
{ATM} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "230--235",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p230-wang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, ISDN (Integrated
Services Digital Network). {\bf I.6.8} Computing
Methodologies, SIMULATION AND MODELING, Types of
Simulation, Monte Carlo.",
}
@Article{Leung:1993:CMT,
author = "Kin K. Leung and Raymond W. Yeung and Bhaskar
Sengupta",
title = "A credit manager for traffic regulation in high-speed
networks: a queueing analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "236--245",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p236-leung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; measurement; performance;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations, Network management. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Modeling techniques.",
}
@Article{Ramanathan:1993:AFT,
author = "Srinivas Ramanathan and P. Venkat Rangan",
title = "Adaptive feedback techniques for synchronized
multimedia retrieval over integrated networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "246--260",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p246-ramanathan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "management; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf H.3.3} Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.5.1} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems.",
}
@Article{Gibbens:1993:DRM,
author = "Richard J. Gibbens and Frank P. Kelly and Stephen R.
E. Turner",
title = "Dynamic routing in multiparented networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "2",
pages = "261--270",
month = apr,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-2/p261-gibbens/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; reliability",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Bagheri:1993:SBM,
author = "Mehran Bagheri and Dennis T. Kong and Wayne S. Holden
and Fernando C. Irizarry and Derek D. Mahoney",
title = "An {STS-N} byte-interleaving multiplexer\slash
scrambler and demultiplexer\slash descrambler
architecture and its experimental {OC-48}
implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "282--285",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p282-bagheri/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf H.5.2}
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, User Interfaces. {\bf C.3} Computer
Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS, Signal processing systems.
{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Kompella:1993:MRM,
author = "Vachaspathi P. Kompella and Joseph C. Pasquale and
George C. Polyzos",
title = "Multicast routing for multimedia communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "286--292",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p286-kompella/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf G.1.6} Mathematics of Computing,
NUMERICAL ANALYSIS, Optimization. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf H.5.1} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems.",
}
@Article{Devetsikiotis:1993:SOD,
author = "Michael Devetsikiotis and J. Keith Townsend",
title = "Statistical optimization of dynamic importance
sampling parameters for efficient simulation of
communication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "293--305",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p293-devetsikiotis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design",
subject = "{\bf G.1.6} Mathematics of Computing, NUMERICAL
ANALYSIS, Optimization. {\bf G.3} Mathematics of
Computing, PROBABILITY AND STATISTICS. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Kessler:1993:CFR,
author = "Ilan Kessler and Arvind Krishna",
title = "On the cost of fairness in ring networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "306--313",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p306-kessler/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Token rings. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.",
}
@Article{Pattavina:1993:AIO,
author = "Achille Pattavina and Giacomo Bruzzi",
title = "Analysis of input and output queueing for nonblocking
{ATM} switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "314--328",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p314-pattavina/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.1.3} Mathematics of Computing,
NUMERICAL ANALYSIS, Numerical Linear Algebra,
Eigenvalues and eigenvectors (direct and iterative
methods).",
}
@Article{Elwalid:1993:EBG,
author = "Anwar I. Elwalid and Debasis Mitra",
title = "Effective bandwidth of general {Markovian} traffic
sources and admission control of high speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "329--343",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p329-elwalid/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.3} Mathematics of Computing,
PROBABILITY AND STATISTICS. {\bf G.1.3} Mathematics of
Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Eigenvalues and eigenvectors (direct and
iterative methods). {\bf H.5.1} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems, Video (e.g., tape, disk, DVI).",
}
@Article{Parekh:1993:GPS,
author = "Abhay K. Parekh and Robert G. Gallager",
title = "A generalized processor sharing approach to flow
control in integrated services networks: the
single-node case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "344--357",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p344-parekh/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Design studies.",
}
@Article{Ural:1993:OLT,
author = "Hasan Ural and Keqin Zhu",
title = "Optimal length test sequence generation using
distinguishing sequences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "358--371",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p358-ural/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf G.1.6} Mathematics of Computing, NUMERICAL
ANALYSIS, Optimization. {\bf F.1.1} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
Computation, Automata. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Yaron:1993:PSC,
author = "Opher Yaron and Moshe Sidi",
title = "Performance and stability of communication networks
via robust exponential bounds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "372--385",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p372-yaron/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Modeling techniques. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Packet-switching
networks. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Abu-Amara:1993:FTM,
author = "Hosame Abu-Amara",
title = "A fast topology maintenance algorithm for
high-bandwidth networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "3",
pages = "386--394",
month = jun,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-3/p386-abu-amara/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}
@Article{Floyd:1993:RED,
author = "Sally Floyd and Van Jacobson",
title = "Random early detection gateways for congestion
avoidance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "397--413",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p397-floyd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.3} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Operations. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Sequencing and
scheduling.",
}
@Article{Liang:1993:NMN,
author = "Luping Liang and Gerald W. Neufeld and Samuel T.
Chanson",
title = "A name model for nested group communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "414--423",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p414-liang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Network problems.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf H.4.3} Information Systems, INFORMATION
SYSTEMS APPLICATIONS, Communications Applications.",
}
@Article{Kesidis:1993:EBM,
author = "George Kesidis and Jean Walrand and Cheng-Shang
Chang",
title = "Effective bandwidths for multiclass {Markov} fluids
and other {ATM} sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "424--428",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p424-kesidis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes.",
}
@Article{Partridge:1993:FU,
author = "Craig Partridge and Stephen Pink",
title = "A faster {UDP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "429--440",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p429-partridge/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement;
performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.0} Software, OPERATING SYSTEMS, General, UNIX.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf D.4.8} Software, OPERATING SYSTEMS,
Performance, Measurements.",
}
@Article{Pieris:1993:LLB,
author = "Gerard R. Pieris and Galen H. Sasaki",
title = "A linear lightwave {Benes} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "441--445",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p441-pieris/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.1.2} Computer Systems Organization,
PROCESSOR ARCHITECTURES, Multiple Data Stream
Architectures (Multiprocessors), Interconnection
architectures. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Routing and
layout.",
}
@Article{Skelly:1993:HMV,
author = "Paul Skelly and Mischa Schwartz and Sudhir Dixit",
title = "A histogram-based model for video traffic behavior in
an {ATM} multiplexer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "446--459",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p446-skelly/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf H.5.1} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems, Video (e.g., tape, disk, DVI).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Performance attributes.",
}
@Article{Girard:1993:DAR,
author = "Andr{\'e} Girard and Bernard Liau",
title = "Dimensioning of adaptively routed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "460--468",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p460-girard/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems.",
}
@Article{Cidon:1993:CEH,
author = "Israel Cidon and Inder S. Gopal and Adrian Segall",
title = "Connection establishment in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "469--481",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p469-cidon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Bianchi:1993:IQA,
author = "Giuseppe Bianchi and Jonathan S. Turner",
title = "Improved queueing analysis of shared buffer switching
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "482--490",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p482-bianchi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Performance attributes. {\bf C.3} Computer
Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf D.4.8} Software, OPERATING
SYSTEMS, Performance, Queueing theory. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design,
Circuit-switching networks.",
}
@Article{Rumsewicz:1993:AES,
author = "Michael P. Rumsewicz",
title = "Analysis of the effects of {SS7} message discard
schemes on call completion rates during overload",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "4",
pages = "491--502",
month = aug,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-4/p491-rumsewicz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Performance attributes. {\bf C.3} Computer
Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}
@Article{Ghanbari:1993:PCV,
author = "Mohammad Ghanbari and Charles J. Hughes",
title = "Packing coded video signals into {ATM} cells",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "505--509",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p505-ghanbari/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; theory",
subject = "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Compression (Coding). {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design,
Packet-switching networks. {\bf E.4} Data, CODING AND
INFORMATION THEORY.",
}
@Article{Orda:1993:CRM,
author = "Ariel Orda and Raphael Rom and Nahum Shimkin",
title = "Competitive routing in multiuser communication
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "510--521",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p510-orda/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network management. {\bf C.2.3} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Operations, Network monitoring. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Li:1993:QRIa,
author = "San-qi Li and Chia-Lin Hwang",
title = "Queue response to input correlation functions:
discrete spectral analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "522--533",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p522-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Marsan:1993:TWA,
author = "M. Ajmone Marsan and Andrea Bianco and Emilio Leonardi
and Fabio Neri",
title = "Topologies for wavelength-routing all-optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "534--546",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p534-marsan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.2.m} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Miscellaneous. {\bf C.1.2} Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors), Interconnection
architectures.",
}
@Article{Low:1993:NAS,
author = "Steven H. Low and Pravin P. Varaiya",
title = "A new approach to service provisioning in {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "547--553",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p547-low/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network monitoring.",
}
@Article{Thekkath:1993:INP,
author = "Chandramohan A. Thekkath and Thu D. Nguyen and Evelyn
Moy and Edward D. Lazowska",
title = "Implementing network protocols at user level",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "554--565",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p554-thekkath/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; security",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Coppo:1993:OCD,
author = "Paolo Coppo and Matteo D'Ambrosio and Riccardo Melen",
title = "Optimal cost\slash performance design of {ATM}
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "566--575",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p566-coppo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Performance attributes. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design.",
}
@Article{Landry:1993:QSP,
author = "Randall Landry and Ioannis Stavrakakis",
title = "Queueing study of a $3$-priority policy with distinct
service strategies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "576--589",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p576-landry/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
General.",
}
@Article{Sidhu:1993:THP,
author = "Deepinder P. Sidhu and Howard Motteler and Raghu
Vallurupalli",
title = "On testing hierarchies for protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "590--599",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p590-sidhu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; measurement; reliability; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Abbott:1993:INT,
author = "Mark B. Abbott and Larry L. Peterson",
title = "Increasing network throughput by integrating protocol
layers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "5",
pages = "600--610",
month = oct,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-5/p600-abbott/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; security; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Security and
protection (e.g., firewalls). {\bf E.3} Data, DATA
ENCRYPTION.",
}
@Article{Cocchi:1993:PCN,
author = "Ron Cocchi and Scott Shenker and Deborah Estrin and
Lixia Zhang",
title = "Pricing in computer networks: motivation, formulation,
and example",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "614--627",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p614-cocchi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; economics; management; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Performance attributes. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology. {\bf K.6.2} Computing Milieux, MANAGEMENT OF
COMPUTING AND INFORMATION SYSTEMS, Installation
Management, Pricing and resource allocation.",
}
@Article{Baiocchi:1993:EAA,
author = "Andrea Baiocchi and Nicola Bl{\'e}fari-Melazzi",
title = "An error-controlled approximate analysis of a
stochastic fluid flow model applied to an {ATM}
multiplexer with heterogeneous {On-Off} sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "628--637",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p628-baiocchi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Modeling techniques. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design.",
}
@Article{Chen:1993:ACM,
author = "Xing Chen and Jeremiah F. Hayes",
title = "Access control in multicast packet switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "638--649",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p638-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.5}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Local and Wide-Area Networks, Access schemes.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Kaiserswerth:1993:PPE,
author = "Matthias Kaiserswerth",
title = "The {Parallel Protocol Engine}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "650--663",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p650-kaiserswerth/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol architecture. {\bf C.1.2} Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{vanDoorn:1993:BPL,
author = "Erik A. van Doorn and Frans J. M. Panken",
title = "Blocking probabilities in a loss system with arrivals
in geometrically distributed batches and heterogeneous
service requirements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "664--667",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p664-van_doorn/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Modeling techniques. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design. {\bf C.2.5} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Local and Wide-Area Networks, Access schemes.",
}
@Article{Hu:1993:DCA,
author = "Limin Hu",
title = "Distributed code assignments for {CDMA Packet Radio
Network}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "668--677",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p668-hu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Li:1993:QRIb,
author = "San-qi Li and Chia-Lin Hwang",
title = "Queue response to input correlation functions:
continuous spectral analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "678--692",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p678-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Benmohamed:1993:FCC,
author = "Lotfi Benmohamed and Semyon M. Meerkov",
title = "Feedback control of congestion in packet switching
networks: the case of a single congested node",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "693--708",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p693-benmohamed/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.3} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Operations. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{Lee:1993:QAT,
author = "Duan-Shin Lee and Bhaskar Sengupta",
title = "Queueing analysis of a threshold based priority scheme
for {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "709--717",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p709-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Georgiadis:1993:TPF,
author = "Leonidas Georgiadis and Roch Gu{\'e}rin and Israel
Cidon",
title = "Throughput properties of fair policies in ring
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "718--728",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p718-georgiadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Token rings. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.",
}
@Article{Lin:1993:LSS,
author = "Frank Y. S. Lin",
title = "Link set sizing for networks supporting {SMDS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "729--739",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p729-lin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks.",
}
@Article{LaPorta:1993:PAM,
author = "Thomas F. {La Porta} and Mischa Schwartz",
title = "Performance analysis of {MSP}: feature-rich high-speed
transport protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "1",
number = "6",
pages = "740--753",
month = dec,
year = "1993",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1993-1-6/p740-la_porta/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Open Systems
Interconnection reference model (OSI).",
}
@Article{Leland:1994:SNE,
author = "Will E. Leland and Murad S. Taqqu and Walter Willinger
and Daniel V. Wilson",
title = "On the self-similar nature of {Ethernet} traffic
(extended version)",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "1--15",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p1-leland/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Ethernet. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks.",
}
@Article{McAuley:1994:WSC,
author = "A. J. McAuley",
title = "Weighted sum codes for error detection and their
comparison with existing codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "16--22",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Farkas:1995:CWS}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p16-mcauley/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; reliability",
subject = "{\bf B.4.5} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Reliability, Testing, and
Fault-Tolerance**, Error-checking**. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.0} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
General, Data communications.",
}
@Article{Chlamtac:1994:MTS,
author = "Imrich Chlamtac and Andr{\'a}s Farag{\'o}",
title = "Making transmission schedules immune to topology
changes in multi-hop packet radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "23--29",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p23-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; reliability; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Tsai:1994:PAT,
author = "Zsehong Tsai and Wen-der Wang and Chien-Hwa Chiou and
Jin-Fu Chang and Lung-Sing Liang",
title = "Performance analysis of two echo control designs in
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "30--39",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p30-tsai/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Performance attributes.",
}
@Article{Wu:1994:PPS,
author = "Tsong-Ho Wu",
title = "A passive protected self-healing mesh network
architecture and applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "40--52",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p40-wu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; economics; performance; reliability; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability.",
}
@Article{Sheng:1994:SAP,
author = "Hong-Dah Sheng and San-Qi Li",
title = "Spectral analysis of packet loss rate at a statistical
multiplexer for multimedia services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "53--65",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p53-sheng/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf H.5.1}
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
D.4.8} Software, OPERATING SYSTEMS, Performance,
Queueing theory.",
}
@Article{Tel:1994:SAN,
author = "Gerard Tel and Ephraim Korach and Shmuel Zaks",
title = "Synchronizing {ABD} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "66--69",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p66-tel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sequencing and scheduling. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Sivarajan:1994:LNB,
author = "Kumar N. Sivarajan and Rajiv Ramaswami",
title = "Lightwave networks based on {de Bruijn} graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "70--79",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p70-sivarajan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Simmons:1994:DED,
author = "Jane M. Simmons and Robert G. Gallager",
title = "Design of error detection scheme for class {C} service
in {ATM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "80--88",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p80-simmons/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf B.4.5} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Reliability, Testing, and
Fault-Tolerance**, Error-checking**. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design. {\bf C.2.0}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, General, Data communications. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols.",
}
@Article{Sharon:1994:ESR,
author = "Oran Sharon and Adrian Segall",
title = "On the efficiency of slot reuse in the {Dual Bus}
configuration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "1",
pages = "89--100",
month = feb,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-1/p89-sharon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Buses. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Access schemes. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology.",
}
@Article{Pieris:1994:STW,
author = "Gerard R. Pieris and Galen H. Sasaki",
title = "Scheduling transmissions in {WDM} broadcast-and-select
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "105--110",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p105-pieris/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Escobar:1994:FSP,
author = "Julio Escobar and Craig Partridge and Debra Deutsch",
title = "Flow synchronization protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "111--121",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p111-escobar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; performance; standardization;
theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Floyd:1994:SPR,
author = "Sally Floyd and Van Jacobson",
title = "The synchronization of periodic routing messages",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "122--136",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p122-floyd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf F.1.2} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
Computation, Probabilistic computation.",
}
@Article{Parekh:1994:GPS,
author = "Abhay K. Parekh and Robert G. Gallagher",
title = "A generalized processor sharing approach to flow
control in integrated services networks: the multiple
node case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "137--150",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p137-parekh/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf G.m} Mathematics of
Computing, MISCELLANEOUS, Queueing theory**.",
}
@Article{Marsan:1994:LEP,
author = "Marco Ajmone Marsan and Andrea Bianco and Luigi
Ciminiera and Riccardo Sisto and Adriano Valenzano",
title = "A {LOTOS} extension for the performance analysis of
distributed systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "151--165",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p151-marsan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "languages; measurement; performance; verification",
subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING,
Requirements/Specifications, Lotos. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Probabilistic
computation.",
}
@Article{Chang:1994:ACP,
author = "Chung-Ju Chang and Tian-Tsair Su and Yueh-Yiing
Chiang",
title = "Analysis of a cutoff priority cellular radio system
with finite queueing and reneging\slash dropping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "166--175",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p166-chang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations. {\bf F.1.2} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation. {\bf C.3} Computer Systems
Organization, SPECIAL-PURPOSE AND APPLICATION-BASED
SYSTEMS.",
}
@Article{Lucantoni:1994:MPE,
author = "David M. Lucantoni and Marcel F. Neuts and Amy R.
Reibman",
title = "Methods for performance evaluation of {VBR} video
traffic models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "176--180",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p176-lucantoni/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Probabilistic
computation.",
}
@Article{Omundsen:1994:PMA,
author = "Daniel S. Omundsen and A. Roger Kaye and Samy A.
Mahmoud",
title = "A pipelined, multiprocessor architecture for a
connectionless server for broadband {ISDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "181--192",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p181-omundsen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.1.2} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Multiple Data Stream Architectures
(Multiprocessors), Pipeline processors**. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Hart:1994:ARC,
author = "George W. Hart and Samir G. Kelekar",
title = "Automated repair of complex systems by fault
compensation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "193--205",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p193-hart/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; languages; performance;
reliability; theory; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf F.4.3} Theory
of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Formal Languages, Classes defined by
grammars or automata.",
}
@Article{Hong:1994:AAT,
author = "Seung Ho Hong",
title = "Approximate analysis of timer-controlled priority
scheme in the single-service token-passing systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "2",
pages = "206--215",
month = apr,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-2/p206-hong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design. {\bf F.1.2} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
Computation, Probabilistic computation.",
}
@Article{Ganz:1994:EAV,
author = "Aura Ganz and Xudong Wang",
title = "Efficient algorithm for virtual topology design in
multihop lightwave networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "217--225",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p217-ganz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf G.1.6} Mathematics
of Computing, NUMERICAL ANALYSIS, Optimization.",
}
@Article{Gopal:1994:NTP,
author = "Inder Gopal and Roch Gu{\'e}rin",
title = "Network transparency: the {plaNET} approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "226--239",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p226-gopal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; standardization",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design,
Circuit-switching networks.",
}
@Article{Cidon:1994:PBP,
author = "Israel Cidon and Roch Gu{\'e}rin and Asad Khamisy",
title = "On protective buffer policies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "240--246",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p240-cidon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Barcaccia:1994:PTO,
author = "Piera Barcaccia and Maurizio A. Bonuccelli",
title = "Polynomial time optimal algorithms for time slot
assignment of variable bandwidth systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "247--251",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p247-barcaccia/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.1.6} Mathematics of Computing,
NUMERICAL ANALYSIS, Optimization. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Dimitrijevic:1994:RMN,
author = "Dragomir D. Dimitrijevic and Basil Maglaris and Robert
R. Boorstyn",
title = "Routing in multidomain networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "252--262",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p252-dimitrijevic/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.1.2} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Multiple Data Stream Architectures
(Multiprocessors), Interconnection architectures.",
}
@Article{Cohen:1994:SSN,
author = "Reuven Cohen",
title = "{``Session} swapping'': a new approach for optimal
bandwidth sharing of ring circuit switched channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "263--268",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p263-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.5} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Local and Wide-Area Networks.",
}
@Article{Sharon:1994:SSR,
author = "Oran Sharon and Adrian Segall",
title = "Schemes for slot reuse in {CRMA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "269--278",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p269-sharon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Access schemes.",
}
@Article{Todd:1994:TGN,
author = "Terence D. Todd",
title = "The token grid network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "279--287",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p279-todd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Byun:1994:DAA,
author = "Jae W. Byun and Tony T. Lee",
title = "The design and analysis of an {ATM} multicast switch
with adaptive traffic controller",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "288--298",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p288-byun/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.3}
Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS.",
}
@Article{Varvarigos:1994:PHR,
author = "Emmanouel A. Varvarigos and Dimitri P. Bertsekas",
title = "Performance of hypercube routing schemes with or
without buffering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "3",
pages = "299--311",
month = jun,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-3/p299-varvarigos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network communications.",
}
@Article{Paxson:1994:EDA,
author = "Vern Paxson",
title = "Empirically derived analytic models of wide-area {TCP}
connections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "316--336",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p316-paxson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{R:1994:CSF,
author = "Allen R. and J. r. Bonde and Sumit Ghosh",
title = "A comparative study of fuzzy versus ``fixed''
thresholds for robust queue management in
cell-switching networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "337--344",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p337-bonde/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Design studies.",
}
@Article{To:1994:MIE,
author = "Philip P. To and Tak-Shing P. Yum and Yiu-Wing Leung",
title = "Multistar implementation of expandable shufflenets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "345--351",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p345-to/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks.",
}
@Article{Zitterbart:1994:HPT,
author = "Martina Zitterbart and Ahmed N. Tantawy and Dimitrios
N. Serpanos",
title = "A high performance transparent bridge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "352--362",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p352-zitterbart/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Distributed networks. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Network topology. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Peha:1994:AFT,
author = "Jon M. Peha and Fouad A. Tobagi",
title = "Analyzing the fault tolerance of double-loop
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "363--373",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p363-peha/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Tassiulas:1994:OBC,
author = "Leandros Tassiulas and Yao Chung Hung and Shivendra S.
Panwar",
title = "Optimal buffer control during congestion in an {ATM}
network node",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "374--386",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p374-tassiulas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf B.3.2}
Hardware, MEMORY STRUCTURES, Design Styles, Cache
memories.",
}
@Article{Rosenberg:1994:HFS,
author = "Catherine Rosenberg and Bruno Lagu{\"e}",
title = "A heuristic framework for source policing in {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "387--397",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p387-rosenberg/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology.",
}
@Article{Gianatti:1994:PAA,
author = "Stefano Gianatti and Achille Pattavina",
title = "Performance analysis of {ATM Banyan} networks with
shared queueing --- part {I}: random offered traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "398--410",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p398-gianatti/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.1.2}
Computer Systems Organization, PROCESSOR ARCHITECTURES,
Multiple Data Stream Architectures (Multiprocessors),
Interconnection architectures. {\bf B.3.2} Hardware,
MEMORY STRUCTURES, Design Styles, Cache memories. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Pattavina:1994:PAA,
author = "Achille Pattavina and Stefano Gianatti",
title = "Performance analysis of {ATM Banyan} networks with
shared queueing --- part {II}: correlated\slash
unbalanced offered traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "4",
pages = "411--424",
month = aug,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-4/p411-pattavina/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.1.2}
Computer Systems Organization, PROCESSOR ARCHITECTURES,
Multiple Data Stream Architectures (Multiprocessors),
Interconnection architectures. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Schwartz:1994:AIG,
author = "Michael F. Schwartz and Calton Pu",
title = "Applying an information gathering architecture to
{Netfind}: a white pages tool for a changing and
growing {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "426--439",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p426-schwartz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; measurement; performance",
subject = "{\bf H.4.3} Information Systems, INFORMATION SYSTEMS
APPLICATIONS, Communications Applications, Internet.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Internet. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations. {\bf H.3.3} Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval.",
}
@Article{Amer:1994:PTS,
author = "Paul D. Amer and Christophe Chassot and Thomas J.
Connolly and Michel Diaz and Phillip Conrad",
title = "Partial-order transport service for multimedia and
other applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "440--456",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p440-amer/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; reliability;
standardization",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf H.5.1} Information Systems, INFORMATION INTERFACES
AND PRESENTATION, Multimedia Information Systems. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Miller:1994:SAP,
author = "Raymond E. Miller and Sanjoy Paul",
title = "Structural analysis of protocol specifications and
generation of maximal fault coverage conformance test
sequences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "457--470",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p457-miller/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; reliability; standardization;
verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol verification. {\bf F.1.1} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
Computation, Automata. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{LaMaire:1994:TRS,
author = "Richard O. LaMaire and Dimitrios N. Serpanos",
title = "Two-dimensional round-robin schedulers for packet
switches with multiple input queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "471--482",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p471-lamaire/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**.",
}
@Article{Lundy:1994:SAS,
author = "Gilbert M. Lundy and H. Alphan Tipici",
title = "Specification and analysis of the {SNR} high-speed
transport protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "483--496",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p483-lundy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; documentation; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol verification. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf F.3.1} Theory
of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about
Programs.",
}
@Article{Lee:1994:DSF,
author = "Tsern-Huei Lee and Jin-Jye Chou",
title = "Diagnosis of single faults in bitonic sorters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "497--507",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p497-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; reliability; verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sorting and searching. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf B.4.5} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Reliability,
Testing, and Fault-Tolerance**.",
}
@Article{Abdelaziz:1994:SOT,
author = "Mohamed Abdelaziz and Ioannis Stavrakakis",
title = "Some optimal traffic regulation schemes for {ATM}
networks: a {Markov} decision approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "508--519",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p508-abdelaziz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Probabilistic
computation. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf G.m} Mathematics of
Computing, MISCELLANEOUS, Queueing theory**.",
}
@Article{Logothetis:1994:RAD,
author = "Dimitris Logothetis and Kishor S. Trivedi",
title = "Reliability analysis of the double counter-rotating
ring with concentrator attachments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "520--532",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p520-logothetis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; reliability",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.2.m} Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous. {\bf C.2.5}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Local and Wide-Area Networks, Token rings.",
}
@Article{Luciani:1994:AMP,
author = "James V. Luciani and C. Y. Roger Chen",
title = "An analytical model for partially blocking
finite-buffered switching networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "533--540",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p533-luciani/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf H.5.1} Information Systems, INFORMATION INTERFACES
AND PRESENTATION, Multimedia Information Systems. {\bf
G.m} Mathematics of Computing, MISCELLANEOUS, Queueing
theory**.",
}
@Article{Cohen:1994:SML,
author = "Reuven Cohen and Yoram Ofek",
title = "Self-termination mechanism for label swapping
routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "5",
pages = "541--545",
month = oct,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-5/p541-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Leung:1994:MMV,
author = "Yiu-Wing Leung and Tak-Shing Yum",
title = "A modular multirate video distribution system: design
and dimensioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "549--557",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p549-leung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Distributed
networks.",
}
@Article{Mitra:1994:ECU,
author = "Debasis Mitra and John A. Morrison",
title = "{Erlang} capacity and uniform approximations for
shared unbuffered resources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "558--570",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p558-mitra/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Modeling techniques.",
}
@Article{Kim:1994:DPM,
author = "Hyong S. Kim",
title = "Design and performance of {Multinet} switch: a
multistage {ATM} switch architecture with partially
shared buffers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "571--580",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p571-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf B.3.2}
Hardware, MEMORY STRUCTURES, Design Styles, Cache
memories. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory.",
}
@Article{Chlamtac:1994:OSV,
author = "Imrich Chlamtac and Andr{\'a}s Farag{\'o} and Tao
Zhang",
title = "Optimizing the system of virtual paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "581--587",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p581-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf B.4.0}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
General. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Huang:1994:SPD,
author = "Chun-Chong Huang and Alberto Leon-Garcia",
title = "Separation principle of dynamic transmission and
enqueueing priorities for real- and nonreal-time
traffic in {ATM} multiplexers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "588--601",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p588-huang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.m}
Computer Systems Organization, MISCELLANEOUS. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital
Network).",
}
@Article{Sharony:1994:UMS,
author = "Jacob Sharony",
title = "The universality of multidimensional switching
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "2",
number = "6",
pages = "602--612",
month = dec,
year = "1994",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1994-2-6/p602-sharony/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, ISDN
(Integrated Services Digital Network). {\bf B.4.0}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
General. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Rumsewicz:1995:CSC,
author = "Michael P. Rumsewicz and Donald E. Smith",
title = "A comparison of {SS7} congestion control options
during mass call-in situations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "1--9",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p1-rumsewicz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
standardization; theory",
subject = "{\bf K.1} Computing Milieux, THE COMPUTER INDUSTRY,
Standards. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Li:1995:LCA,
author = "San-Qi Li and Song Chong and Chia-Lin Hwang",
title = "Link capacity allocation and network control by
filtered input rate in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "10--25",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p10-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory",
subject = "{\bf H.5.1} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, Multimedia Information
Systems. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**.",
}
@Article{Lee:1995:BAR,
author = "Wei-Tsong Lee and Ling-Yang Kung",
title = "Binary addressing and routing schemes in the
{Manhattan} street network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "26--30",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p26-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout.",
}
@Article{Bird:1995:KFL,
author = "Ray Bird and Inder Gopal and Amir Herzberg and Phil
Janson and Shay Kutten and Refik Molva and Moti Yung",
title = "The {KryptoKnight} family of light-weight protocols
for authentication and key distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "31--41",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p31-bird/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; security; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Security and
protection (e.g., firewalls). {\bf K.6.5} Computing
Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
SYSTEMS, Security and Protection, Authentication. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.6} Software, OPERATING SYSTEMS, Security and
Protection, Authentication.",
}
@Article{Levine:1995:AST,
author = "Judah Levine",
title = "An algorithm to synchronize the time of a computer to
universal time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "42--50",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p42-levine/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; measurement;
performance; theory",
subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Synchronization. {\bf C.2.0} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
General. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf B.4.2} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Input/Output Devices, Channels and
controllers.",
}
@Article{Gutekunst:1995:DPG,
author = "Thomas Gutekunst and Daniel Bauer and Germano Caronni
and Bernhard Plattner and Hasan",
title = "A distributed and policy-free general-purpose shared
window system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "51--62",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p51-gutekunst/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory",
subject = "{\bf H.5.2} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces, Windowing
systems. {\bf D.2.2} Software, SOFTWARE ENGINEERING,
Design Tools and Techniques, X-Window. {\bf C.2.0}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, General, Data communications.",
}
@Article{Wong:1995:DAN,
author = "P. C. Wong and M. S. Yeung",
title = "Design and analysis of a novel fast packet switch:
pipeline {Banyan}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "63--69",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p63-wong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.1.2}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation, Parallelism and concurrency. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Lee:1995:NDN,
author = "Jeong Gyu Lee and Byeong Gi Lee",
title = "A new distribution network based on controlled
switching elements and its applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "70--81",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p70-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**.",
}
@Article{Liu:1995:BRP,
author = "Zhen Liu and Don Towsley",
title = "Burst reduction properties of rate-control throttles:
downstream queue behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "82--90",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p82-liu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability; theory;
verification",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Data communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Ward:1995:DLC,
author = "Christopher Ward and Cheong H. Choi and Thomas F.
Hain",
title = "A data link control protocol for {LEO} satellite
networks providing a reliable datagram service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "1",
pages = "91--103",
month = feb,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-1/p91-ward/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
reliability; standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf J.2} Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Aerospace. {\bf I.6.3} Computing
Methodologies, SIMULATION AND MODELING, Applications.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Barker:1995:AUI,
author = "Paul Barker",
title = "An analysis of user input to an {X.500} white pages
directory service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "112--125",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p112-barker/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; human factors",
subject = "{\bf H.3.3} Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval, Query
formulation. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems.",
}
@Article{Chao:1995:DAL,
author = "H. Jonathan Chao and Byeong-Seog Choe",
title = "Design and analysis of a large-scale multicast output
buffered {ATM} switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "126--138",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p126-chao/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.5.4}
Computer Systems Organization, COMPUTER SYSTEM
IMPLEMENTATION, VLSI Systems.",
}
@Article{Lee:1995:CAS,
author = "Hyong W. Lee and Jon W. Mark",
title = "Capacity allocation in statistical multiplexing of
{ATM} sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "139--151",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p139-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf G.3} Mathematics of Computing,
PROBABILITY AND STATISTICS. {\bf G.1.2} Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Chen:1995:STS,
author = "Wen-Huei Chen and Hasan Ural",
title = "Synchronizable test sequences based on multiple {UIO}
sequences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "152--157",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p152-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol verification. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Levine:1995:PMA,
author = "David A. Levine and Ian F. Akyildiz",
title = "{PROTON}: a media access control protocol for optical
networks with star topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "158--168",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p158-levine/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.2.5} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Local and Wide-Area Networks.",
}
@Article{Ofek:1995:MPA,
author = "Yoram Ofek and Moti Yung",
title = "{METANET}: principles of an arbitrary topology {LAN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "169--180",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p169-ofek/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Min:1995:NAB,
author = "P. S. Min and H. Saidi and M. V. Hegde",
title = "A nonblocking architecture for broadband multichannel
switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "181--198",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p181-min/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks. {\bf C.2.0}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, General, Data communications. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, ISDN
(Integrated Services Digital Network).",
}
@Article{Lee:1995:CLA,
author = "Myung J. Lee and David S. Ahn",
title = "Cell loss analysis and design trade-offs of
nonblocking {ATM} switches with nonuniform traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "199--210",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p199-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Circuit-switching networks.",
}
@Article{Rouskas:1995:AOT,
author = "George N. Rouskas and Mostafa H. Ammar",
title = "Analysis and optimization of transmission schedules
for single-hop {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "211--221",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p211-rouskas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Design studies.",
}
@Article{Farkas:1995:CWS,
author = "Peter Farka{\u{s}}",
title = "Comments on {``Weighted sum codes for error detection
and their comparison with existing codes''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "2",
pages = "222--223",
month = apr,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{McAuley:1994:WSC}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-2/p222-farkas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf E.4} Data, CODING AND INFORMATION THEORY, Error
control codes.",
}
@Article{Paxson:1995:WAT,
author = "Vern Paxson and Sally Floyd",
title = "Wide area traffic: the failure of {Poisson} modeling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "226--244",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p226-paxson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Modeling techniques. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf G.m} Mathematics of
Computing, MISCELLANEOUS, Queueing theory**.",
}
@Article{Mills:1995:IAS,
author = "David L. Mills",
title = "Improved algorithms for synchronizing computer network
clocks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "245--254",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p245-mills/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf D.4.1} Software, OPERATING SYSTEMS,
Process Management, Synchronization.",
}
@Article{Shankar:1995:MTP,
author = "A. Udaya Shankar and David Lee",
title = "Minimum-latency transport protocols with
modulo-{$N$}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "255--268",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Olah:1996:CMT}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p255-shankar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Pankaj:1995:WRA,
author = "Rajesh K. Pankaj and Robert G. Gallager",
title = "Wavelength requirements of all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "269--280",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p269-pankaj/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Permutations and combinations. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Network problems. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Network topology.",
}
@Article{Zhang:1995:HWA,
author = "Zhensheng Zhang and Anthony S. Acampora",
title = "A heuristic wavelength assignment algorithm for
multihop {WDM} networks with wavelength routing and
wavelength re-use",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "281--288",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p281-zhang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf I.2.8} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods. {\bf G.2.1} Mathematics of
Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Network problems.",
}
@Article{Saidi:1995:NSP,
author = "H. Saidi and P. S. Min and M. V. Hegde",
title = "A new structural property of statistical data forks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "289--298",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p289-saidi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf B.4.2}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
Input/Output Devices, Channels and controllers. {\bf
G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Permutations and combinations. {\bf G.3}
Mathematics of Computing, PROBABILITY AND STATISTICS.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf F.1.2} Theory of Computation, COMPUTATION
BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation.",
}
@Article{Cao:1995:PMA,
author = "Xi-Ren Cao and Don Towsley",
title = "A performance model for {ATM} switches with general
packet length distributions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "299--309",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p299-cao/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf F.1.2} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
Computation, Probabilistic computation. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures.",
}
@Article{McMillan:1995:DAC,
author = "David McMillan",
title = "Delay analysis of a cellular mobile priority queueing
system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "310--319",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p310-mcmillan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.0}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, General, Data communications. {\bf F.1.2}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation, Probabilistic computation.",
}
@Article{Cohen:1995:NLS,
author = "Reuven Cohen and Yoram Ofek and Adrian Segall",
title = "A new label-based source routing for multi-ring
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "320--328",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p320-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; standardization;
theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Token rings. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Network
problems. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Reibman:1995:TDV,
author = "Amy R. Reibman and Arthur W. Berger",
title = "Traffic descriptors for {VBR} video teleconferencing
over {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "329--339",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p329-reibman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf H.4.3} Information Systems, INFORMATION SYSTEMS
APPLICATIONS, Communications Applications, Computer
conferencing, teleconferencing, and videoconferencing.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Hamdaoui:1995:STT,
author = "Moncef Hamdaoui and Parameswaran Ramanathan",
title = "Selection of timed token protocol parameters to
guarantee message deadlines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "340--351",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p340-hamdaoui/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems. {\bf D.4.1} Software,
OPERATING SYSTEMS, Process Management,
Synchronization.",
}
@Article{Lea:1995:BQS,
author = "Chin-Tau Lea and Anwar Alyatama",
title = "Bandwidth quantization and states reduction in the
broadband {ISDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "3",
pages = "352--360",
month = jun,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-3/p352-lea/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf I.4.1} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Digitization and Image Capture,
Quantization. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf F.1.2} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
Computation, Probabilistic computation.",
}
@Article{Floyd:1995:LRM,
author = "Sally Floyd and Van Jacobson",
title = "Link-sharing and resource management models for packet
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "365--386",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p365-floyd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; performance",
subject = "{\bf H.3.5} Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Online Information Services, Data
sharing. {\bf I.6.7} Computing Methodologies,
SIMULATION AND MODELING, Simulation Support Systems,
Environments. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Sequencing and
scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS,
Process Management, Scheduling. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Packet-switching
networks.",
}
@Article{Zegura:1995:EBP,
author = "Ellen Witte Zegura",
title = "Evaluating blocking probability in generalized
connectors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "387--398",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p387-zegura/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; theory; verification",
subject = "{\bf I.6.1} Computing Methodologies, SIMULATION AND
MODELING, Simulation Theory, Model classification. {\bf
C.1.2} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Multiple Data Stream Architectures
(Multiprocessors), Connection machines. {\bf C.1.2}
Computer Systems Organization, PROCESSOR ARCHITECTURES,
Multiple Data Stream Architectures (Multiprocessors),
Interconnection architectures. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf I.6.6}
Computing Methodologies, SIMULATION AND MODELING,
Simulation Output Analysis.",
}
@Article{Figueira:1995:UBD,
author = "Norival R. Figueira and Joseph Pasquale",
title = "An upper bound on delay for the {VirtualClock} service
discipline",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "399--408",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p399-figueira/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; theory",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic, Proof theory.
{\bf F.2.0} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, General.",
}
@Article{Moldeklev:1995:HLA,
author = "Kjersti Moldeklev and Per Gunningberg",
title = "How a large {ATM MTU} causes deadlocks in {TCP} data
transfers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "409--422",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p409-moldeklev/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; performance; theory",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Deadlocks. {\bf D.4.4} Software, OPERATING
SYSTEMS, Communications Management, Buffering. {\bf
B.4.3} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
Interconnections (Subsystems), Asynchronous/synchronous
operation. {\bf B.4.1} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Data Communications Devices.",
}
@Article{Konstantopoulos:1995:OFC,
author = "Takis Konstantopoulos and Venkat Anantharam",
title = "Optimal flow control schemes that regulate the
burstiness of traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "423--432",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p423-konstantopoulos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network management. {\bf B.4.3} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections
(Subsystems), Asynchronous/synchronous operation. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures.",
}
@Article{Li:1995:ANP,
author = "Guang-Liang Li and Patrick W. Dowd",
title = "An analysis of network performance degradation induced
by workload fluctuations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "433--440",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p433-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "management; performance; theory",
subject = "{\bf B.4.4} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Performance Analysis and Design Aids**,
Worst-case analysis**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Model theory.",
}
@Article{Bertossi:1995:CAH,
author = "Alan A. Bertossi and Maurizio A. Bonuccelli",
title = "Code assignment for hidden terminal interference
avoidance in multihop packet radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "441--449",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p441-bertossi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; theory; verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Network problems.
{\bf I.6.6} Computing Methodologies, SIMULATION AND
MODELING, Simulation Output Analysis. {\bf F.4.1}
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic, Proof theory. {\bf
I.2.8} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.",
}
@Article{Kim:1995:TTS,
author = "Kyeong Soo Kim and Byeong Gi Lee",
title = "Three-level traffic shaper and its application to
source clock frequency recovery for {VBR} services in
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "450--458",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p450-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory",
subject = "{\bf I.2.10} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding, Modeling
and recovery of physical attributes. {\bf B.4.3}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
Interconnections (Subsystems), Asynchronous/synchronous
operation. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication.",
}
@Article{Bala:1995:RLL,
author = "Krishna Bala and Thomas E. Stern and David Simchi-Levi
and Kavita Bala",
title = "Routing in a linear lightwave network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "459--469",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p459-bala/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory",
subject = "{\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems),
Topology. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic, Recursive
function theory. {\bf B.4.0} Hardware, INPUT/OUTPUT AND
DATA COMMUNICATIONS, General. {\bf G.1.3} Mathematics
of Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Sparse, structured, and very large systems
(direct and iterative methods).",
}
@Article{Iness:1995:GGS,
author = "Jason Iness and Subrata Banerjee and Biswanath
Mukherjee",
title = "{GEMNET}: a generalized, shuffle-exchange-based,
regular, scalable, modular, multihop, {WDM} lightwave
network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "470--476",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p470-iness/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; performance; theory",
subject = "{\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems),
Topology. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol architecture. {\bf D.4.1} Software, OPERATING
SYSTEMS, Process Management, Scheduling. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf G.2.2} Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Jia:1995:SVM,
author = "Feiling Jia and Biswanath Mukherjee and Jason Iness",
title = "Scheduling variable-length messages in a single-hop
multichannel local lightwave network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "4",
pages = "477--488",
month = aug,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-4/p477-jia/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; performance; theory",
subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf I.6.1} Computing
Methodologies, SIMULATION AND MODELING, Simulation
Theory, Systems theory.",
}
@Article{Ramaswami:1995:RWA,
author = "Rajiv Ramaswami and Kumar N. Sivarajan",
title = "Routing and wavelength assignment in all-optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "489--500",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p489-ramaswami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout.",
}
@Article{Gupta:1995:RPR,
author = "Amit Gupta and Domenico Ferrari",
title = "Resource partitioning for real-time communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "501--508",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p501-gupta/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.3}
Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS, Real-time and embedded
systems.",
}
@Article{Bannister:1995:PMD,
author = "Joseph Bannister and Flaminio Borgonovo and Luigi
Fratta and Mario Gerla",
title = "A performance model of deflection routing in
multibuffer networks with nonuniform traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "509--520",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p509-bannister/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf D.4.8} Software, OPERATING SYSTEMS, Performance,
Modeling and prediction.",
}
@Article{Merchant:1995:ACS,
author = "Arif Merchant and Bhaskar Sengupta",
title = "Assignment of cells to switches in {PCS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "521--526",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p521-merchant/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.1.6} Mathematics of Computing,
NUMERICAL ANALYSIS, Optimization, Integer
programming.",
}
@Article{Padmanabhan:1995:EAF,
author = "Krishnan Padmanabhan",
title = "An efficient architecture for fault-tolerant {ATM}
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "527--537",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p527-padmanabhan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf D.4.5} Software, OPERATING SYSTEMS,
Reliability, Fault-tolerance.",
}
@Article{Smith:1995:ERC,
author = "Donald E. Smith",
title = "Ensuring robust call throughput and fairness for {SCP}
overload controls",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "538--548",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p538-smith/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.",
}
@Article{Chan:1995:PSM,
author = "Ming H. Chan and John P. Princen",
title = "Prioritized statistical multiplexing of {PCM}
sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "549--559",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p549-chan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS.",
}
@Article{Silva:1995:PSS,
author = "Edmundo de Souza e. Silva and H. Richard Gail and
Richard R. Muntz",
title = "Polling systems with server timeouts and their
application to token passing networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "560--575",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p560-de_souza_e_silva/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**.",
}
@Article{Tassiulas:1995:PMS,
author = "Leandros Tassiulas and Jinoo Joung",
title = "Performance measures and scheduling policies in ring
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "576--584",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p576-tassiulas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory; verification",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Token rings. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations.",
}
@Article{Choudhury:1995:IAC,
author = "Gagan L. Choudhury and Kin K. Leung and Ward Whitt",
title = "An inversion algorithm to compute blocking
probabilities in loss networks with state-dependent
rates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "585--601",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p585-choudhury/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; theory; verification",
subject = "{\bf G.3} Mathematics of Computing, PROBABILITY AND
STATISTICS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**.",
}
@Article{Borst:1995:USL,
author = "Sem C. Borst and Onno J. Boxma and Hanoch Levy",
title = "The use of service limits for efficient operation of
multistation single-medium communication systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "602--612",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p602-borst/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory; verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Lee:1995:SCA,
author = "Whay Chiou Lee and Pierre A. Humblet",
title = "Space-time characteristics of {ALOHA} protocols in
high-speed bidirectional bus networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "5",
pages = "613--622",
month = oct,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-5/p613-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Hwang:1995:OPD,
author = "Ren-Hung Hwang and James F. Kurose and Don Towsley",
title = "On-call processing delay in high speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "628--639",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p628-hwang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Feldmeier:1995:FSI,
author = "David C. Feldmeier",
title = "Fast software implementation of error detection
codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "640--651",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p640-feldmeier/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
reliability; standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf E.4} Data, CODING AND INFORMATION
THEORY, Error control codes. {\bf C.2.0} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
General. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Chao:1995:AQM,
author = "H. Jonathan Chao and Necdet Uzun",
title = "An {ATM} queue manager handling multiple delay and
loss priorities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "652--659",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p652-chao/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement;
performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, ISDN (Integrated Services
Digital Network). {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network management.",
}
@Article{Wu:1995:BAS,
author = "Guo-Liang Wu and Jon W. Mark",
title = "A buffer allocation scheme for {ATM} networks:
complete sharing based on virtual partition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "660--670",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p660-wu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf F.1.2} Theory of Computation, COMPUTATION
BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation.",
}
@Article{Kanakia:1995:ACC,
author = "Hemant Kanakia and Partho P. Mishra and Amy R.
Reibman",
title = "An adaptive congestion control scheme for real time
packet video transport",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "671--682",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p671-kanakia/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory",
subject = "{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Packet-switching
networks. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Xie:1995:DGV,
author = "Geoffrey G. Xie and Simon S. Lam",
title = "Delay guarantee of virtual clock server",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "683--689",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p683-xie/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf C.2.0} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
General. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks.",
}
@Article{Shi:1995:HSR,
author = "Jianxu Shi and John P. Fonseka",
title = "Hierarchical self-healing rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "690--697",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p690-shi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Token rings. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout.",
}
@Article{Madhow:1995:OWR,
author = "Upamanyu Madhow and Michael L. Honig and Kenneth
Steiglitz",
title = "Optimization of wireless resources for personal
communications mobility tracking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "698--707",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p698-madhow/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf I.2.8}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Problem Solving, Control Methods, and Search, Dynamic
programming.",
}
@Article{Chen:1995:NMP,
author = "C. Y. Roger Chen and Shuo-Hsien Hsiao and Abdulaziz S.
Almazyad",
title = "A new model for the performance evaluation of
synchronous circuit switched multistage interconnection
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "708--715",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p708-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Multiple Data Stream Architectures
(Multiprocessors), Interconnection architectures. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Circuit-switching
networks.",
}
@Article{Ghosal:1995:PAP,
author = "Dipak Ghosal and T. V. Lakshman and Yennun Huang",
title = "Parallel architectures for processing high speed
network signaling protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "716--728",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p716-ghosal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory",
subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Parallelism and
concurrency. {\bf C.1.3} Computer Systems Organization,
PROCESSOR ARCHITECTURES, Other Architecture Styles.
{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Zhang:1995:OSB,
author = "Sijing Zhang and Alan Burns",
title = "An optimal synchronous bandwidth allocation scheme for
guaranteeing synchronous message deadlines with the
timed-token {MAC} protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "729--741",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p729-zhang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems. {\bf C.2.5} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Local and Wide-Area Networks, Token rings. {\bf B.4.3}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
Interconnections (Subsystems), Asynchronous/synchronous
operation.",
}
@Article{Jeong:1995:DPE,
author = "Dong Guen Jeong and Chong-Ho Choi and Wha Sook Jeon",
title = "Design and performance evaluation of a new medium
access control protocol for local wireless data
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "742--752",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p742-jeong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Katzela:1995:SFI,
author = "Irene Katzela and Mischa Schwartz",
title = "Schemes for fault identification in communication
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "753--764",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p753-katzela/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability; theory; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
communications. {\bf G.2.0} Mathematics of Computing,
DISCRETE MATHEMATICS, General. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis.",
}
@Article{Pollini:1995:ERI,
author = "Gregory P. Pollini and Kathleen S. Meier-Hellstern",
title = "Efficient routing of information between
interconnected cellular mobile switching centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "765--774",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p765-pollini/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Path and circuit problems. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Herzberg:1995:HAS,
author = "Meir Herzberg and Stephen J. Bye and Anthony Utano",
title = "The hop-limit approach for spare-capacity assignment
in survivable networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "775--784",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p775-herzberg/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.1.6} Mathematics of Computing,
NUMERICAL ANALYSIS, Optimization, Linear programming.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Sidhu:1995:MGB,
author = "Ikhlaq Sidhu and Scott Jordan",
title = "Multiplexing gains in bit stream multiplexors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "785--797",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p785-sidhu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.1.2} Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation.",
}
@Article{Smith:1995:SPR,
author = "Donald E. Smith and H. Jonathan Chao",
title = "Sizing a packet reassembly buffer at a host computer
in an {ATM} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "798--808",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p798-smith/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Medhi:1995:MMC,
author = "D. Medhi",
title = "Multi-hour, multi-traffic class network design for
virtual path-based dynamically reconfigurable wide-area
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "809--818",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p809-medhi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Path and circuit problems.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
I.2.8} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods.",
}
@Article{Shenker:1995:MGW,
author = "Scott J. Shenker",
title = "Making greed work in networks: a game-theoretic
analysis of switch service disciplines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "819--831",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p819-shenker/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory;
verification",
subject = "{\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**.",
}
@Article{DAmbrosio:1995:ELB,
author = "Matteo D'Ambrosio and Riccardo Melen",
title = "Evaluating the limit behavior of the {ATM} traffic
within a network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "832--841",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p832-d_ambrosio/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**.",
}
@Article{Rubin:1995:AMQ,
author = "Izhak Rubin and James Chien-Hsing Wu",
title = "Analysis of an {M\slash G\slash 1\slash N} queue with
vacations and its iterative application to {FDDI}
timed-token rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "842--856",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p842-rubin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Token rings. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Probabilistic
computation. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks.",
}
@Article{Min:1995:NCN,
author = "Paul S. Min and Manjunath V. Hegde and Hossein Saidi
and Alex Chandra",
title = "Nonblocking copy networks in multi-channel switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "857--871",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p857-min/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Probabilistic
computation. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**.",
}
@Article{Chen:1995:QAP,
author = "C. Y. Roger Chen and Georges A. Makhoul and Dikran S.
Meliksetian",
title = "A queueing analysis of the performance of {DQDB}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "3",
number = "6",
pages = "872--881",
month = dec,
year = "1995",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1995-3-6/p872-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Banerjea:1996:TRP,
author = "Anindo Banerjea and Domenico Ferrari and Bruce A. Mah
and Mark Moran and Dinesh C. Verma and Hui Zhang",
title = "The {Tenet} real-time protocol suite: design,
implementation, and experiences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "1--10",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p1-banerjea/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems.",
}
@Article{Cruz:1996:CAA,
author = "R. L. Cruz and Jung-Tsung Tsai",
title = "{COD}: alternative architectures for high speed packet
switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "11--21",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p11-cruz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks.",
}
@Article{Murakami:1996:VPR,
author = "Kazutaka Murakami and Hyong S. Kim",
title = "Virtual path routing for survivable {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "22--39",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p22-murakami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout.",
}
@Article{Heyman:1996:SMV,
author = "Daniel P. Heyman and T. V. Lakshman",
title = "Source models for {VBR} broadcast-video traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "40--48",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p40-heyman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf I.6.4} Computing Methodologies,
SIMULATION AND MODELING, Model Validation and
Analysis.",
}
@Article{Hung:1996:BSW,
author = "Anthony Hung and George Kesidis",
title = "Bandwidth scheduling for wide-area {ATM} networks
using virtual finishing times",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "49--54",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p49-hung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.",
}
@Article{Leue:1996:POI,
author = "Stefan Leue and Philippe A. Oechslin",
title = "On parallelizing and optimizing the implementation of
communication protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "55--70",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p55-leue/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features. {\bf D.2.2} Software, SOFTWARE
ENGINEERING, Design Tools and Techniques,
Computer-aided software engineering (CASE). {\bf F.3.1}
Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques.",
}
@Article{Picker:1996:ESF,
author = "Dan Picker and Ronald D. Fellman and Paul M. Chau",
title = "An extension to the {SCI} flow control protocol for
increased network efficiency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "71--85",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p71-picker/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; standardization;
theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf K.1} Computing Milieux, THE COMPUTER INDUSTRY,
Standards.",
}
@Article{Doeringer:1996:RLP,
author = "Willibald Doeringer and G{\"u}nter Karjoth and Mehdi
Nassehi",
title = "Routing on longest-matching prefixes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "86--97",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See corrections \cite{Doeringer:1997:CRL}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p86-doeringer/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; theory;
verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS,
General.",
}
@Article{Lee:1996:WFC,
author = "Daniel Chonghwan Lee",
title = "Worst-case fraction of {CBR} teletraffic unpunctual
due to statistical multiplexing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "98--105",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p98-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{Koppelman:1996:CBN,
author = "David M. Koppelman",
title = "Congested {Banyan} network analysis using
congested-queue states and neighboring-queue effects",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "106--111",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p106-koppelman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Modeling techniques.",
}
@Article{Rosberg:1996:CMA,
author = "Zvi Rosberg",
title = "Cell multiplexing in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "112--122",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p112-rosberg/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Dziong:1996:FCA,
author = "Zbigniew Dziong and Lorne G. Mason",
title = "Fair-efficient call admission control policies for
broadband networks --- a game theoretic framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "1",
pages = "123--136",
month = feb,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-1/p123-dziong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.",
}
@Article{Chandranmenon:1996:TPH,
author = "Girish P. Chandranmenon and George Varghese",
title = "Trading packet headers for packet processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "141--152",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p141-chandranmenon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf B.4.4}
Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
Performance Analysis and Design Aids**, Formal
models**. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Deering:1996:PAW,
author = "Stephen Deering and Deborah L. Estrin and Dino
Farinacci and Van Jacobson and Ching-Gung Liu and
Liming Wei",
title = "The {PIM} architecture for wide-area multicast
routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "153--162",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p153-deering/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.4} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems.",
}
@Article{Jiang:1996:PCB,
author = "Hua Jiang and Stephen S. Rappaport",
title = "Prioritized channel borrowing without locking: a
channel sharing strategy for cellular communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "163--172",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p163-jiang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Access schemes. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Design studies.",
}
@Article{Zarros:1996:ISR,
author = "Panagiotis N. Zarros and Myung J. Lee and Tarek N.
Saadawi",
title = "Interparticipant synchronization in real-time
multimedia conferencing using feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "173--180",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p173-zarros/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf H.4.3}
Information Systems, INFORMATION SYSTEMS APPLICATIONS,
Communications Applications, Computer conferencing,
teleconferencing, and videoconferencing. {\bf D.4.4}
Software, OPERATING SYSTEMS, Communications Management.
{\bf H.5.1} Information Systems, INFORMATION INTERFACES
AND PRESENTATION, Multimedia Information Systems.",
}
@Article{Bauer:1996:DAM,
author = "Fred Bauer and Anujan Varma",
title = "Distributed algorithms for multicast path setup in
data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "181--191",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p181-bauer/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Path and
circuit problems.",
}
@Article{Liu:1996:GFR,
author = "Hong Liu and Raymond E. Miller",
title = "Generalized fair reachability analysis for cyclic
protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "192--204",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p192-liu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory; verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf F.1.1} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Models of Computation,
Automata. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Path and circuit
problems. {\bf F.3.1} Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Specifying and Verifying and
Reasoning about Programs.",
}
@Article{Tassiulas:1996:WPS,
author = "Leandros Tassiulas and Leonidas Georgiadis",
title = "Any work-conserving policy stabilizes the ring with
spatial re-use",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "205--208",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p205-tassiulas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; standardization; theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Token rings. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network management. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Packet-switching
networks.",
}
@Article{Erramilli:1996:EQA,
author = "Ashok Erramilli and Onuttom Narayan and Walter
Willinger",
title = "Experimental queueing analysis with long-range
dependent packet traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "209--223",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p209-erramilli/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; management; measurement;
performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Modeling techniques.",
}
@Article{Mishra:1996:HRC,
author = "Partho Pratim Mishra and Hemant Kanakia and Satish K.
Tripathi",
title = "On hop-by-hop rate-based congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "224--239",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p224-mishra/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance; theory",
subject = "{\bf D.4.8} Software, OPERATING SYSTEMS, Performance,
Operational analysis. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General.
{\bf I.5.1} Computing Methodologies, PATTERN
RECOGNITION, Models.",
}
@Article{Zho:1996:IMC,
author = "Hongbo Zho and Victor S. Frost",
title = "In-service monitoring for cell loss quality of service
violations in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "240--248",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p240-zho/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance; theory",
subject = "{\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems),
Asynchronous/synchronous operation. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations, Network monitoring. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Buffering. {\bf I.6.7} Computing
Methodologies, SIMULATION AND MODELING, Simulation
Support Systems, Environments.",
}
@Article{Gaiti:1996:PMI,
author = "Dominique Ga{\"\i}ti and Guy Pujolle",
title = "Performance management issues in {ATM} networks:
traffic and congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "249--257",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p249-gaiti/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf B.4.3} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections
(Subsystems), Asynchronous/synchronous operation. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Network problems. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Jacob:1996:DPS,
author = "Lillykutty Jacob and Anurag Kumar",
title = "Delay performance of some scheduling strategies in an
input queuing {ATM} switch with multiclass bursty
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "258--271",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p258-jacob/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf B.4.3} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections
(Subsystems), Asynchronous/synchronous operation. {\bf
I.6.3} Computing Methodologies, SIMULATION AND
MODELING, Applications.",
}
@Article{Clementi:1996:HAO,
author = "Andrea E. F. Clementi and Miriam {Di Ianni}",
title = "On the hardness of approximating optimum schedule
problems in store and forward networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "272--280",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p272-clementi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; management; theory",
subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Store and forward networks.
{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Network
problems.",
}
@Article{Liotopoulos:1996:SNO,
author = "Fotios K. Liotopoulos and Suresh Chalasani",
title = "Semi-rearrangeably nonblocking operation of {Clos}
networks in the multirate environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "281--291",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p281-liotopoulos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory; verification",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks.",
}
@Article{Altman:1996:BPM,
author = "Eitan Altman and Daniel Kofman",
title = "Bounds for performance measures of token rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "2",
pages = "292--299",
month = apr,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-2/p292-altman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management",
subject = "{\bf F.2.0} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems),
Asynchronous/synchronous operation.",
}
@Article{Heyman:1996:WIL,
author = "Daniel P. Heyman and T. V. Lakshman",
title = "What are the implications of long-range dependence for
{VBR}-video traffic engineering?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "301--317",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p301-heyman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; performance;
theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf F.1.2} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation. {\bf G.3} Mathematics of
Computing, PROBABILITY AND STATISTICS, Statistical
computing. {\bf H.4.3} Information Systems, INFORMATION
SYSTEMS APPLICATIONS, Communications Applications,
Computer conferencing, teleconferencing, and
videoconferencing.",
}
@Article{Braun:1996:PEC,
author = "Torsten Braun and Christophe Diot",
title = "Performance evaluation and cache analysis of an {ILP}
protocol implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "318--330",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p318-braun/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Performance attributes. {\bf
B.3.3} Hardware, MEMORY STRUCTURES, Performance
Analysis and Design Aids**.",
}
@Article{Kabatepe:1996:FDQ,
author = "Mete Kabatepe and Kenneth S. Vastola",
title = "The fair distributed queue {(FDQ)} protocol for
high-speed metropolitan-area networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "331--339",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p331-kabatepe/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol architecture. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Modeling techniques.",
}
@Article{Turletti:1996:VI,
author = "Thierry Turletti and Christian Huitema",
title = "Videoconferencing on the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "340--351",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p340-turletti/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf H.4.3} Information Systems, INFORMATION SYSTEMS
APPLICATIONS, Communications Applications, Computer
conferencing, teleconferencing, and videoconferencing.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Internet. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Compression (Coding).",
}
@Article{Wrege:1996:DDB,
author = "Dallas E. Wrege and Edward W. Knightly and Hui Zhang
and J{\"o}rg Liebeherr",
title = "Deterministic delay bounds for {VBR} video in
packet-switching networks: fundamental limits and
practical trade-offs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "352--362",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p352-wrege/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Design studies.",
}
@Article{Cohen:1996:STP,
author = "Reuven Cohen and Baiju V. Patel and Frank Schaffa and
Marc Willebeek-LeMair",
title = "The sink tree paradigm: connectionless traffic support
on {ATM LAN}'s",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "363--374",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p363-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology.",
}
@Article{Shreedhar:1996:EFQ,
author = "M. Shreedhar and George Varghese",
title = "Efficient fair queueing using deficit round-robin",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "375--385",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p375-shreedhar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{Wu:1996:CMP,
author = "Guo-Liang Wu and Jon W. Mark",
title = "Computational methods for performance evaluation of a
statistical multiplexer supporting bursty traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "386--397",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p386-wu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Modeling techniques. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Asynchronous Transfer
Mode (ATM).",
}
@Article{Tassiulas:1996:PFL,
author = "Leandros Tassiulas",
title = "Push forward link-level scheduling for network-wide
performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "398--406",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p398-tassiulas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.",
}
@Article{Papadimitriou:1996:LAR,
author = "Georgios I. Papadimitriou and Dimitris G. Maritsas",
title = "Learning automata-based receiver conflict avoidance
algorithms for {WDM} broadcast-and-select star
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "407--412",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p407-papadimitriou/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Network
topology. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Performance attributes. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling.",
}
@Article{Pejhan:1996:ECU,
author = "Sassan Pejhan and Mischa Schwartz and Dimitris
Anastassiou",
title = "Error control using retransmission schemes in
multicast transport protocols for real-time media",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "413--427",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p413-pejhan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Performance
attributes. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Reliability, availability, and
serviceability.",
}
@Article{Asawa:1996:OSH,
author = "Manjari Asawa and Wayne E. Stark",
title = "Optimal scheduling of handoffs in cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "428--441",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p428-asawa/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf F.1.2}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation, Probabilistic computation. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Modeling techniques. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes. {\bf F.2.0} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, General.",
}
@Article{Birk:1996:EDI,
author = "Yitzhak Birk and Noam Bloch",
title = "The effects of destructive interference and wasted
transmissions on the uniform-traffic capacity of
non-bus-oriented single-hop interconnections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "442--448",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p442-birk/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory",
subject = "{\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems), Fiber
optics. {\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Interconnections (Subsystems),
Topology. {\bf F.2.1} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
Algorithms and Problems, Computations on matrices.",
}
@Article{Catania:1996:CAF,
author = "Vincenzo Catania and Giuseppe Ficili and Sergio
Palazzo and Daniela Panno",
title = "A comparative analysis of fuzzy versus conventional
policing mechanisms for {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "449--459",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p449-catania/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Uncertainty, ``fuzzy,'' and
probabilistic reasoning.",
}
@Article{Cheng:1996:DFT,
author = "Ray-Guang Cheng and Chung-Ju Chang",
title = "Design of a fuzzy traffic controller for {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "460--469",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p460-cheng/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf G.3}
Mathematics of Computing, PROBABILITY AND STATISTICS,
Probabilistic algorithms (including Monte Carlo). {\bf
I.2.3} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving,
Uncertainty, ``fuzzy,'' and probabilistic reasoning.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Performance attributes.",
}
@Article{Swiderski:1996:APA,
author = "Jacek {\'S}widerski",
title = "Approximate performance analysis of real-time traffic
over heavily loaded networks with timed token
protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "3",
pages = "470--478",
month = jun,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-3/p470-swiderski/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.5}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Local and Wide-Area Networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols.",
}
@Article{Georgiadis:1996:ENQ,
author = "Leonidas Georgiadis and Roch Gu{\'e}rin and Vinod
Peris and Kumar N. Sivarajan",
title = "Efficient network {QoS} provisioning based on per node
traffic shaping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "482--501",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p482-georgiadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory; verification",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management. {\bf G.m} Mathematics of Computing,
MISCELLANEOUS, Queueing theory**. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Ahuja:1996:DIP,
author = "R. Ahuja and S. Keshav and H. Saran",
title = "Design, implementation, and performance measurement of
a native-mode {ATM} transport layer (extended
version)",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "502--515",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p502-ahuja/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Salehi:1996:EAS,
author = "James D. Salehi and James F. Kurose and Don Towsley",
title = "The effectiveness of affinity-based scheduling in
multiprocessor network protocol processing (extended
version)",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "516--530",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p516-salehi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf D.4.4} Software, OPERATING
SYSTEMS, Communications Management.",
}
@Article{Mitra:1996:AND,
author = "Debasis Mitra and John A. Morrison and K. G.
Ramakrishnan",
title = "{ATM} network design and optimization: a multirate
loss network framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "531--543",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p531-mitra/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Subramaniam:1996:ANS,
author = "Suresh Subramaniam and Murat Azizo{\u{g}}lu and Arun
K. Somani",
title = "All-optical networks with sparse wavelength
conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "544--557",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p544-subramaniam/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.2.2} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Protocols. {\bf B.4.1} Hardware, INPUT/OUTPUT
AND DATA COMMUNICATIONS, Data Communications Devices.",
}
@Article{Ramanathan:1996:MTG,
author = "S. Ramanathan",
title = "Multicast tree generation in networks with asymmetric
links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "558--568",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p558-ramanathan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; theory",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Charny:1996:TSA,
author = "Anna Charny and K. K. Ramakrishnan and Anthony Lauck",
title = "Time scale analysis scalability issues for explicit
rate allocation in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "569--581",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p569-charny/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication. {\bf F.2.0} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, General. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology.",
}
@Article{Zibman:1996:AAM,
author = "Israel Zibman and Carl Woolf and Peter O'Reilly and
Larry Strickland and David Willis and John Visser",
title = "An architectural approach to minimizing feature
interactions in telecommunications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "582--596",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p582-zibman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Marcus:1996:AQA,
author = "William S. Marcus",
title = "An architecture for {QoS} analysis and
experimentation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "597--603",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p597-marcus/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; theory; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.5.0} Computer Systems Organization, COMPUTER SYSTEM
IMPLEMENTATION, General.",
}
@Article{Smith:1996:IGP,
author = "Peter J. Smith and Mansoor Shafi",
title = "The impact of {G.826} on the performance of transport
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "604--614",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p604-smith/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization",
subject = "{\bf B.4.0} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, General. {\bf B.5.0} Hardware,
REGISTER-TRANSFER-LEVEL IMPLEMENTATION, General. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Moghe:1996:ECP,
author = "Pratyush Mogh{\'e} and Izhak Rubin",
title = "Enhanced call: a paradigm for applications with
dynamic client-membership and client-level binding in
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "615--628",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p615-moghe/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "management; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Akyildiz:1996:MLU,
author = "Ian F. Akyildiz and Joseph S. M. Ho and Yi-Bing Lin",
title = "Movement-based location update and selective paging
for {PCS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "629--638",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p629-akyildiz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks.",
}
@Article{Modiano:1996:EAP,
author = "Eytan Modiano and Anthony Ephremides",
title = "Efficient algorithms for performing packet broadcasts
in a mesh network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "639--648",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p639-modiano/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Rubin:1996:PAD,
author = "Izhak Rubin and Ho-Ting Wu",
title = "Performance analysis and design of {CQBT} algorithm
for a ring network with spatial reuse",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "649--659",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p649-rubin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Network communication.",
}
@Article{Olah:1996:CMT,
author = "Andr{\'a}s L. Ol{\'a}h and Sonia M. Heemstra de
Groot",
title = "Comments on {``Minimum-latency transport protocols
with modulo-$N$''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "4",
pages = "660--666",
month = aug,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Shankar:1995:MTP}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-4/p660-olah/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "documentation; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Gong:1996:AEC,
author = "Fengmin Gong and Gurudatta M. Parulkar",
title = "An application-oriented error control scheme for
high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "669--683",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p669-gong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Mukherjee:1996:SPD,
author = "Biswanath Mukherjee and Dhritiman Banerjee and S.
Ramamurthy and Amarnath Mukherjee",
title = "Some principles for designing a wide-area {WDM}
optical network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "684--696",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p684-mukherjee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; measurement;
performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS.",
}
@Article{Lam:1996:LSA,
author = "Simon S. Lam and Simon Chow and David K. Y. Yau",
title = "A lossless smoothing algorithm for compressed video",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "697--708",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p697-lam/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; measurement;
performance; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf I.4.3}
Computing Methodologies, IMAGE PROCESSING AND COMPUTER
VISION, Enhancement, Smoothing. {\bf I.1.2} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms. {\bf I.4.2}
Computing Methodologies, IMAGE PROCESSING AND COMPUTER
VISION, Compression (Coding). {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Ho:1996:LAS,
author = "Joseph S. M. Ho and Ian F. Akyildiz",
title = "Local anchor scheme for reducing signaling costs in
personal communications networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "709--725",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p709-ho/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; human factors; measurement; performance;
theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations.",
}
@Article{Bononi:1996:AEI,
author = "Alberto Bononi and Paul R. Prucnal",
title = "Analytical evaluation of improved access techniques in
deflection routing networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "726--730",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p726-bononi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf F.1.2} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations.",
}
@Article{Schultz:1996:MCR,
author = "Kenneth J. Schultz and P. Glenn Gulak",
title = "Multicast contention resolution with single-cycle
windowing using content addressable {FIFO}'s",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "731--742",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p731-schultz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital
Network).",
}
@Article{Ahn:1996:PNS,
author = "Jong Suk Ahn and Peter B. Danzig",
title = "Packet network simulation: speedup and accuracy versus
timing granularity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "743--757",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p743-ahn/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; measurement;
performance; reliability; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations.",
}
@Article{Lee:1996:DRC,
author = "Tsern-Huei Lee and Kuen-Chu Lai and Shii-Tyng Duann",
title = "Design of a real-time call admission controller for
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "758--765",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p758-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf B.4.2} Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Input/Output Devices, Channels and
controllers. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf C.3} Computer Systems
Organization, SPECIAL-PURPOSE AND APPLICATION-BASED
SYSTEMS, Real-time and embedded systems. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, ISDN
(Integrated Services Digital Network).",
}
@Article{Elbaum:1996:TDL,
author = "Reuven Elbaum and Moshe Sidi",
title = "Topological design of local-area networks using
genetic algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "766--778",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p766-elbaum/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf I.2.8} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Heuristic methods. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms.",
}
@Article{Narahari:1996:EAE,
author = "Bhagirath Narahari and Sunil Shende and Rahul Simha",
title = "Efficient algorithms for erasure node placement on
slotted dual bus networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "779--784",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p779-narahari/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Agarwal:1996:UAF,
author = "Anjali Agarwal and J. William Atwood",
title = "A unified approach to fault-tolerance in communication
protocols based on recovery procedures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "785--795",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p785-agarwal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Security and
protection (e.g., firewalls).",
}
@Article{Vargas:1996:SPL,
author = "Cesar Vargas and Manjunath V. Hegde and Morteza
Naraghi-Pour and Paul S. Min",
title = "Shadow prices for {LLR} and {ALBA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "5",
pages = "796--807",
month = oct,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-5/p796-vargas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout.",
}
@Article{Low:1996:ACC,
author = "Steven H. Low and Nicholas F. Maxemchuk and Sanjoy
Paul",
title = "Anonymous credit cards and their collusion analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "809--816",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p809-low/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
security; standardization; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Security and protection (e.g., firewalls). {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols.",
}
@Article{Kay:1996:PRP,
author = "Jonathan Kay and Joseph Pasquale",
title = "Profiling and reducing processing overheads in
{TCP\slash IP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "817--828",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p817-kay/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Williamson:1996:DBA,
author = "Carey L. Williamson",
title = "Dynamic bandwidth allocation using loss-load curves",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "829--839",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p829-williamson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{LaPorta:1996:CSL,
author = "Thomas F. {La Porta} and Malathi Veeraraghavan and
Richard W. Buskens",
title = "Comparison of signaling loads for {PCS} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "840--856",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p840-la_porta/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols.",
}
@Article{Papavassiliou:1996:JOC,
author = "Symeon Papavassiliou and Leandros Tassiulas",
title = "Joint optimal channel base station and power
assignment for wireless access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "857--872",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p857-papavassiliou/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Gerstel:1996:LVP,
author = "Ornan Gerstel and Israel Cidon and Shmuel Zaks",
title = "The layout of virtual paths in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "873--884",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p873-gerstel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Liebeherr:1996:EAC,
author = "J{\"o}rg Liebeherr and Dallas E. Wrege and Domenico
Ferrari",
title = "Exact admission control for networks with a bounded
delay service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "885--901",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p885-liebeherr/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling.",
}
@Article{Abu-Amara:1996:STM,
author = "Hosame Abu-Amara and Brian A. Coan and Shlomi Dolev
and Arkady Kanevsky and Jennifer L. Welch",
title = "Self-stabilizing topology maintenance protocols for
high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "902--912",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p902-abu-amara/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Choi:1996:EST,
author = "Hongsik Choi and Hyeong-Ah Choi and Murat
Azizo{\u{g}}lu",
title = "Efficient scheduling of transmissions in optical
broadcast networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "913--920",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p913-choi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Chung:1996:CCU,
author = "Sung-hark Chung and Hu-gon Kim and Yong-seok Yoon and
Dong-wan Tcha",
title = "Cost-minimizing construction of a unidirectional {SHR}
with diverse protection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "921--928",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p921-chung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Data communications. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Token rings.",
}
@Article{Kamal:1996:PMP,
author = "Ahmed E. Kamal",
title = "Performance modeling of partial packet discarding
using the end-of-packet indicator in {AAL} type 5",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "929--940",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p929-kamal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols.",
}
@Article{Ramesh:1996:RMA,
author = "Sridhar Ramesh and Catherine Rosenberg and Anurag
Kumar",
title = "Revenue maximization in {ATM} networks using the {CLP}
capability and buffer priority management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "941--950",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p941-ramesh/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.",
}
@Article{Henniger:1996:STB,
author = "Olaf Henniger and Michel Barbeau and Beh{\c{c}}et
Sarikaya",
title = "Specification and testing of the behavior of network
management agents using {SDL-92}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "4",
number = "6",
pages = "951--962",
month = dec,
year = "1996",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1996-4-6/p951-henniger/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Internet. {\bf C.2.2} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Protocols.",
}
@Article{Levine:1997:REC,
author = "David A. Levine and Ian F. Akyildiz and Mahmoud
Naghshineh",
title = "A resource estimation and call admission algorithm for
wireless multimedia networks using the shadow cluster
concept",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "1--12",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p1-levine/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; performance",
subject = "{\bf C.1.3} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Other Architecture Styles, Cellular
architecture. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology.",
}
@Article{I:1997:PMM,
author = "Chih-Lin I. and Gregory P. Pollini and Richard D.
Gitlin",
title = "{PCS} mobility management using the reverse virtual
call setup algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "13--24",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p13-i/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Lin:1997:RLU,
author = "Yi-Bing Lin",
title = "Reducing location update cost in a {PCS} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "25--33",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p25-lin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Modeling techniques.",
}
@Article{Tcha:1997:NLB,
author = "Dong-wan Tcha and Yong-joo Chung and Taek-jin Choi",
title = "A new lower bound for the frequency assignment
problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "34--39",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p34-tcha/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network communications. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management, Message sending.",
}
@Article{Kalmanek:1997:XLE,
author = "Charles R. Kalmanek and Srinivasan Keshav and William
T. Marshall and Samuel P. Morgan and Robert C.
{Restrick III}",
title = "{Xunet 2}: lessons from an early wide-area {ATM}
testbed",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "40--55",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p40-kalmanek/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; management; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.1.3} Computer Systems Organization,
PROCESSOR ARCHITECTURES, Other Architecture Styles.",
}
@Article{Jamin:1997:MAC,
author = "Sugih Jamin and Peter B. Danzig and Scott J. Shenker
and Lixia Zhang",
title = "A measurement-based admission control algorithm for
integrated service packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "56--70",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p56-jamin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Measurement techniques. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design,
Packet-switching networks.",
}
@Article{Willinger:1997:STH,
author = "Walter Willinger and Murad S. Taqqu and Robert Sherman
and Daniel V. Wilson",
title = "Self-similarity through high-variability: statistical
analysis of {Ethernet LAN} traffic at the source
level",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "71--86",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p71-willinger/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Liew:1997:SSB,
author = "Soung C. Liew",
title = "On the stability of shuffle-exchange and bidirectional
shuffle-exchange deflection networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "87--94",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p87-liew/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.5}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Local and Wide-Area Networks. {\bf D.4.4}
Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Li:1997:CTM,
author = "San-qi Li and Chia-lin Hwang",
title = "On the convergence of traffic measurement and queueing
analysis: a statistical-matching and queueing {(SMAQ)}
tool",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "95--110",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p95-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf I.6.4}
Computing Methodologies, SIMULATION AND MODELING, Model
Validation and Analysis. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Network
problems.",
}
@Article{Ofek:1997:ISA,
author = "Yoram Ofek and Khosrow Sohraby and Ho-Ting Wu",
title = "Integration of synchronous and asynchronous traffic on
the {MetaRing} and its performance study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "111--121",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p111-ofek/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design.",
}
@Article{Matragi:1997:JCA,
author = "Wassim Matragi and Khosrow Sohraby and Chatschik
Bisdikian",
title = "Jitter calculus in {ATM} networks: multiple nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "122--133",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p122-matragi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; theory;
verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Access schemes. {\bf D.4.8}
Software, OPERATING SYSTEMS, Performance, Simulation.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM).",
}
@Article{Dziong:1997:FBM,
author = "Zbigniew Dziong and Marek Juda and Lorne G. Mason",
title = "A framework for bandwidth management in {ATM} networks
--- aggregate equivalent bandwidth estimation
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "134--147",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p134-dziong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf I.6.6} Computing
Methodologies, SIMULATION AND MODELING, Simulation
Output Analysis. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Asynchronous Transfer Mode
(ATM). {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications.",
}
@Article{Garcia-Luna-Aceves:1997:PAL,
author = "J. J. Garcia-Luna-Aceves and Shree Murthy",
title = "A path-finding algorithm for loop-free routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "148--160",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p148-garcia-luna-aceves/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Path and circuit problems.",
}
@Article{Korilis:1997:ANO,
author = "Yannis A. Korilis and Aurel A. Lazar and Ariel Orda",
title = "Achieving network optima using {Stackelberg} routing
strategies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "1",
pages = "161--173",
month = feb,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-1/p161-korilis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Routing and layout. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General.",
}
@Article{Todd:1997:MMM,
author = "Terence D. Todd and Ellen L. Hahne",
title = "Multi-access mesh (multimesh) networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "181--189",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p181-todd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance;
reliability; standardization",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.2.2} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Protocols. {\bf C.2.4} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems.",
}
@Article{Cidon:1997:IFA,
author = "Israel Cidon and Leonidas Georgiadis and Roch
Gu{\'e}rin and Yuval Shavitt",
title = "Improved fairness algorithms for rings with spatial
reuse",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "190--204",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p190-cidon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability; theory; verification",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Token rings. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Lam:1997:GPS,
author = "Simon S. Lam and Geoffrey G. Xie",
title = "Group priority scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "205--218",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p205-lam/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
theory; verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.5.3} Computer Systems Organization, COMPUTER
SYSTEM IMPLEMENTATION, Microcomputers. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems.",
}
@Article{Knightly:1997:DAT,
author = "Edward W. Knightly and Hui Zhang",
title = "{D-BIND}: an accurate traffic model for providing
{QoS} guarantees to {VBR} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "219--231",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p219-knightly/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability; theory;
verification",
subject = "{\bf H.5.1} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, Multimedia Information
Systems, Video (e.g., tape, disk, DVI). {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, ISDN
(Integrated Services Digital Network). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Figueira:1997:SCD,
author = "Norival R. Figueira and Joseph Pasquale",
title = "A schedulability condition for deadline-ordered
service disciplines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "232--244",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p232-figueira/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Spinelli:1997:SSW,
author = "John M. Spinelli",
title = "Self-stabilizing sliding window {ARQ} protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "245--254",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p245-spinelli/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Andersin:1997:SSA,
author = "Michael Andersin and Jens Zander and Zvi Rosberg",
title = "Soft and safe admission control in cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "255--265",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p255-andersin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.4} Mathematics of Computing, MATHEMATICAL
SOFTWARE, Algorithm design and analysis.",
}
@Article{Greenberg:1997:CTA,
author = "Albert G. Greenberg and R. Srikant",
title = "Computational techniques for accurate performance
evaluation of multirate, multihop communication
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "266--277",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p266-greenberg/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
reliability; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, ISDN
(Integrated Services Digital Network). {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Ohsaki:1997:PIB,
author = "Hiroyuki Ohsaki and Naoki Wakamiya and Masayuki Murata
and Hideo Miyahara",
title = "Performance of an input\slash output buffered-type
{ATM LAN} switch with back-pressure function",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "278--290",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p278-ohsaki/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf B.4.2} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output
Devices.",
}
@Article{Bolla:1997:CMS,
author = "Raffaele Bolla and Franco Davoli",
title = "Control of multirate synchronous streams in hybrid
{TDM} access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "291--304",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p291-bolla/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf J.7} Computer
Applications, COMPUTERS IN OTHER SYSTEMS, Command and
control. {\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General.",
}
@Article{Cohen:1997:CRI,
author = "Joel E. Cohen and Clark Jeffries",
title = "Congestion resulting from increased capacity in
single-server queueing networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "305--310",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p305-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design.",
}
@Article{Willebeek-LeMair:1997:ADM,
author = "Marc Willebeek-LeMair and Perwez Shahabuddin",
title = "Approximating dependability measures of computer
networks: an {FDDI} case study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "2",
pages = "311--327",
month = apr,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-2/p311-willebeek-lemair/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.1.2} Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design.",
}
@Article{Sestini:1997:RCG,
author = "Fabrizio Sestini",
title = "Recursive copy generation for multicast {ATM}
switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "329--335",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p329-sestini/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.",
}
@Article{Lakshman:1997:PTN,
author = "T. V. Lakshman and Upamanyu Madhow",
title = "The performance of {TCP\slash IP} for networks with
high bandwidth-delay products and random loss",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "336--350",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p336-lakshman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability; standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Internet.",
}
@Article{Labourdette:1997:PIP,
author = "Jean-Fran{\c{c}}ois P. Labourdette",
title = "Performance impact of partial reconfiguration on
multihop lightwave networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "351--358",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p351-labourdette/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf B.4.1} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Data
Communications Devices.",
}
@Article{Rouskas:1997:PSB,
author = "George N. Rouskas and Vijay Sivaraman",
title = "Packet scheduling in broadcast {WDM} networks with
arbitrary transceiver tuning latencies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "359--370",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p359-rouskas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf I.2.8} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods.",
}
@Article{Bellur:1997:SNA,
author = "Bhargav R. Bellur and Galen H. Sasaki",
title = "A {SAT}-based network access scheme for fairness in
high speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "371--381",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p371-bellur/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks, Token rings.",
}
@Article{Lau:1997:SMB,
author = "Wing-cheong Lau and San-qi Li",
title = "Statistical multiplexing and buffer sharing in
multimedia high-speed networks: a frequency-domain
perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "382--396",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p382-lau/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf H.5.1} Information Systems, INFORMATION INTERFACES
AND PRESENTATION, Multimedia Information Systems. {\bf
C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf F.1.2} Theory of Computation, COMPUTATION
BY ABSTRACT DEVICES, Modes of Computation,
Probabilistic computation.",
}
@Article{Tsybakov:1997:STA,
author = "Boris Tsybakov and Nicoals D. Georganas",
title = "On self-similar traffic in {ATM} queues: definitions,
overflow probability bound, and cell delay
distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "397--409",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p397-tsybakov/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, ISDN (Integrated Services
Digital Network). {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf F.1.2}
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation, Probabilistic computation.",
}
@Article{Sharon:1997:PLS,
author = "Oran Sharon",
title = "A proof for lack of starvation in {DQDB} with and
without slot reuse",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "410--420",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p410-sharon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Stamatelos:1997:RBA,
author = "George M. Stamatelos and Vassilios N. Koukoulidis",
title = "Reservation-based bandwidth allocation in a radio
{ATM} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "420--428",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p420-stamatelos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf H.5.1} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, Multimedia Information
Systems. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks.",
}
@Article{Li:1997:LLF,
author = "San-qi Li and James D. Pruneski",
title = "The linearity of low frequency traffic flow: an
intrinsic {I/O} property in queueing systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "3",
pages = "429--443",
month = jun,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-3/p429-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf G.m} Mathematics of Computing, MISCELLANEOUS,
Queueing theory**. {\bf C.2.4} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems. {\bf C.2.0} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
General.",
}
@Article{Krupczak:1997:IPR,
author = "Bobby Krupczak and Kenneth L. Calvert and Mostafa H.
Ammar",
title = "Increasing the portability and re-usability of
protocol code",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "445--459",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p445-krupczak/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf G.1.6} Mathematics of
Computing, NUMERICAL ANALYSIS, Optimization.",
}
@Article{Wallach:1997:AAH,
author = "Deborah A. Wallach and Dawson R. Engler and M. Frans
Kaashoek",
title = "{ASHs}: application-specific handlers for
high-performance messaging",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "460--474",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p460-wallach/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols.",
}
@Article{Yau:1997:ARS,
author = "David K. Y. Yau and Simon S. Lam",
title = "Adaptive rate-controlled scheduling for multimedia
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "475--488",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p475-yau/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; theory",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Network operating systems. {\bf D.4.4} Software,
OPERATING SYSTEMS, Communications Management. {\bf C.3}
Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS.",
}
@Article{LaPorta:1997:DSS,
author = "Thomas F. {La Porta} and Kuo-Wei Herman Chen",
title = "A direct signaling system for flexible access and
deployment of telecommunication services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "489--501",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p489-la_porta/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Tantiprasut:1997:APS,
author = "Duke Tantiprasut and John Neil and Craig Farrell",
title = "{ASN.1} protocol specification for use with arbitrary
encoding schemes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "502--513",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p502-tantiprasut/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; languages; standardization; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
Protocol verification. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.",
}
@Article{Castelluccia:1997:GEP,
author = "Claude Castelluccia and Walid Dabbous and Sean
O'Malley",
title = "Generating efficient protocol code from an abstract
specification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "514--524",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p514-castelluccia/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors.",
}
@Article{Olah:1997:ASV,
author = "Andr{\'a}s L. Ol{\'a}h and Sonia M. Heemstra de
Groot",
title = "Alternative specification and verification of a
periodic state exchange protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "525--529",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p525-olah/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Yener:1997:IAO,
author = "B{\"u}lent Yener and Spyridon Matsoukas and Yoram
Ofek",
title = "Iterative approach to optimizing convergence routing
priorities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "530--542",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p530-yener/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Landry:1997:SDJ,
author = "Randall Landry and Ioannis Stavrakakis",
title = "Study of delay jitter with and without peak rate
enforcement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "543--553",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p543-landry/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Heyman:1997:GSM,
author = "Daniel P. Heyman",
title = "The {GBAR} source model for {VBR} videoconferences",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "554--560",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p554-heyman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; documentation; experimentation; measurement",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management.",
}
@Article{Goyal:1997:GGR,
author = "Pawan Goyal and Harrick M. Vin",
title = "Generalized guaranteed rate scheduling algorithms: a
framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "561--571",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p561-goyal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Reliability,
availability, and serviceability.",
}
@Article{Bensaou:1997:ECL,
author = "Brahim Bensaou and Shirley T. C. Lam and Hon-Wai Chu
and Danny H. K. Tsang",
title = "Estimation of the cell loss ratio in {ATM} networks
with a fuzzy system and application to
measurement-based call admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "572--584",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p572-bensaou/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; documentation; measurement",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Naik:1997:ECU,
author = "Kshirasagar Naik",
title = "Efficient computation of unique input\slash output
sequences in finite-state machines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "585--599",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p585-naik/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; documentation; experimentation;
measurement",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf F.1.1} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Models of Computation.",
}
@Article{Doeringer:1997:CRL,
author = "Willibald Doeringer and G{\"u}nter Karjoth and Mehdi
Nassehi",
title = "Corrections to {``Routing on longest-matching
prefixes''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "4",
pages = "600--600",
month = aug,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Doeringer:1996:RLP}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-4/p600-doeringer/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paxson:1997:ERB,
author = "Vern Paxson",
title = "End-to-end routing behavior in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "601--615",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p601-paxson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "documentation; experimentation; management;
measurement; performance; reliability",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Reliability, availability, and
serviceability. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Internet. {\bf F.2.2} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations, Network monitoring.",
}
@Article{Heidemann:1997:MPH,
author = "John Heidemann and Katia Obraczka and Joe Touch",
title = "Modeling the performance of {HTTP} over several
transport protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "616--630",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p616-heidemann/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf I.6.0} Computing Methodologies, SIMULATION AND
MODELING, General. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Arlitt:1997:IWS,
author = "Martin F. Arlitt and Carey L. Williamson",
title = "{Internet Web} servers: workload characterization and
performance implications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "631--645",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p631-arlitt/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; management; measurement;
performance",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems. {\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.2.4} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems.",
}
@Article{Ho:1997:DHD,
author = "Joseph S. M. Ho and Ian F. Akyildiz",
title = "Dynamic hierarchical database architecture for
location management in {PCS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "646--660",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p646-ho/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; performance; theory",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology. {\bf C.1.0}
Computer Systems Organization, PROCESSOR ARCHITECTURES,
General.",
}
@Article{Cobb:1997:FT,
author = "Jorge A. Cobb and Mohamed G. Gouda",
title = "Flow theory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "661--674",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p661-cobb/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; reliability; theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Network problems.",
}
@Article{Bennett:1997:HPF,
author = "Jon C. R. Bennett and Hui Zhang",
title = "Hierarchical packet fair queueing algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "675--689",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p675-bennett/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; management",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Goyal:1997:SFQ,
author = "Pawan Goyal and Harrick M. Vin and Haichen Cheng",
title = "Start-time fair queueing: a scheduling algorithm for
integrated services packet switching networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "690--704",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p690-goyal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS, Queueing
theory**. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.",
}
@Article{Varvarigos:1997:RVC,
author = "Emmanouel A. Varvarigos and Vishal Sharma",
title = "The ready-to-go virtual circuit protocol: a loss-free
protocol for multigigabit networks using {FIFO}
buffers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "705--718",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p705-varvarigos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Tridandapani:1997:CSM,
author = "Srini B. Tridandapani and Biswanath Mukherjee and Geir
Hallingstad",
title = "Channel sharing in multi-hop {WDM} lightwave networks:
do we need more channels?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "719--727",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p719-tridandapani/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf I.6.4}
Computing Methodologies, SIMULATION AND MODELING, Model
Validation and Analysis. {\bf D.4.8} Software,
OPERATING SYSTEMS, Performance.",
}
@Article{Choudhury:1997:NBM,
author = "Abhijit K. Choudhury and Ellen L. Hahne",
title = "A new buffer management scheme for hierarchical shared
memory switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "5",
pages = "728--738",
month = oct,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-5/p728-choudhury/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf I.6.0} Computing
Methodologies, SIMULATION AND MODELING, General.",
}
@Article{Grossglauser:1997:RSE,
author = "Matthias Grossglauser and Srinivasan Keshav and David
N. C. Tse",
title = "{RCBR}: a simple and efficient service for multiple
time-scale traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "741--755",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p741-grossglauser/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; management; measurement",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf I.6.4} Computing Methodologies,
SIMULATION AND MODELING, Model Validation and Analysis.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Design studies.",
}
@Article{Balakrishnan:1997:CMI,
author = "Hari Balakrishnan and Venkata N. Padmanabhan and
Srinivasan Seshan and Randy H. Katz",
title = "A comparison of mechanisms for improving {TCP}
performance over wireless links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "756--769",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p756-balakrishnan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Wireless communication. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf D.4.8} Software,
OPERATING SYSTEMS, Performance, Modeling and
prediction. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Design studies.",
}
@Article{Zegura:1997:QCG,
author = "Ellen W. Zegura and Kenneth L. Calvert and Michael J.
Donahoo",
title = "A quantitative comparison of graph-based models for
{Internet} topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "770--783",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p770-zegura/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf I.6.0} Computing
Methodologies, SIMULATION AND MODELING, General. {\bf
D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Floyd:1997:RMF,
author = "Sally Floyd and Van Jacobson and Ching-Gung Liu and
Steven McCanne and Lixia Zhang",
title = "A reliable multicast framework for light-weight
sessions and application level framing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "784--803",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p784-floyd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; reliability; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Design studies. {\bf I.6.0}
Computing Methodologies, SIMULATION AND MODELING,
General.",
}
@Article{Chlamtac:1997:TMT,
author = "Imrich Chlamtac and Andr{\'a}s Farag{\'o} and Hongbiao
Zhang",
title = "Time-spread multiple-access {(TSMA)} protocols for
multihop mobile radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "804--812",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p804-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf D.4.0} Software, OPERATING SYSTEMS, General. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Optimization.",
}
@Article{Weller:1997:SNT,
author = "Timothy Weller and Bruce Hajek",
title = "Scheduling nonuniform traffic in a packet-switching
system with small propagation delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "813--823",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p813-weller/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf F.2.1} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on matrices.",
}
@Article{Varghese:1997:HHT,
author = "George Varghese and Anthony Lauck",
title = "Hashed and hierarchical timing wheels: efficient data
structures for implementing a timer facility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "824--834",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p824-varghese/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability",
subject = "{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Crovella:1997:SWW,
author = "Mark E. Crovella and Azer Bestavros",
title = "Self-similarity in {World Wide Web} traffic: evidence
and possible causes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "835--846",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p835-crovella/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; management; measurement",
subject = "{\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations.",
}
@Article{Herzog:1997:SCM,
author = "Shai Herzog and Scott Shenker and Deborah Estrin",
title = "Sharing the ``cost'' of multicast trees: an axiomatic
analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "847--860",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p847-herzog/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; economics; management; performance;
theory",
subject = "{\bf C.2.6} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Internetworking. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations. {\bf K.6.0} Computing
Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
SYSTEMS, General, Economics.",
}
@Article{Lazar:1997:VPB,
author = "Aurel A. Lazar and Ariel Orda and Dimitrios E.
Pendarakis",
title = "Virtual path bandwidth allocation in multiuser
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "861--871",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p861-lazar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "management; measurement",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems. {\bf D.4.1} Software, OPERATING SYSTEMS,
Process Management.",
}
@Article{Limb:1997:PET,
author = "John O. Limb and Dolors Sala",
title = "A protocol for efficient transfer of data over hybrid
fiber\slash coax systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "872--881",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p872-limb/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Bianchi:1997:RLS,
author = "Giuseppe Bianchi and Riccardo Melen",
title = "The role of local storage in supporting video
retrieval services on {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "882--892",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p882-bianchi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
I.6.7} Computing Methodologies, SIMULATION AND
MODELING, Simulation Support Systems. {\bf D.4.2}
Software, OPERATING SYSTEMS, Storage Management.",
}
@Article{Fang:1997:MPN,
author = "Yuguang Fang and Imrich Chlamtac and Yi-Bing Lin",
title = "Modeling {PCS} networks under general call holding
time and cell residence time distributions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "893--906",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p893-fang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf I.6.4} Computing Methodologies,
SIMULATION AND MODELING, Model Validation and Analysis.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management.",
}
@Article{Bhattacharya:1997:DCA,
author = "Partha P. Bhattacharya and Leonidas Georgiadis and
Arvind Krishna",
title = "Distributed channel allocation for {PCN} with variable
rate traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "907--923",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p907-bhattacharya/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Wireless communication. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.2.3} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Operations.",
}
@Article{Murali:1997:RAL,
author = "Ramaswamy Murali and Brian L. Hughes",
title = "Random access with large propagation delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "924--935",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p924-murali/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; management; measurement",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf D.4.0} Software, OPERATING SYSTEMS,
General.",
}
@Article{Ramaswami:1997:DNC,
author = "Rajiv Ramaswami and Adrian Segall",
title = "Distributed network control for optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "936--943",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p936-ramaswami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; reliability",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols, Routing protocols. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Distributed networks.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Medhi:1997:NDP,
author = "D. Medhi and Sujit Guptan",
title = "Network dimensioning and performance of multiservice,
multirate loss networks with dynamic routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "944--957",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p944-medhi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "documentation; management; performance",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf D.4.4} Software, OPERATING SYSTEMS, Communications
Management. {\bf I.6.7} Computing Methodologies,
SIMULATION AND MODELING, Simulation Support Systems.
{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management.",
}
@Article{Lombardo:1997:APC,
author = "Alfio Lombardo and Giovanni Schembra",
title = "An analytical paradigm to compare routing strategies
in an {ATM} multimedia environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "958--969",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p958-lombardo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations.
{\bf I.6.4} Computing Methodologies, SIMULATION AND
MODELING, Model Validation and Analysis. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Izmailov:1997:DAC,
author = "Rauf Izmailov and Duan-Shin Lee and Bhaskar Sengupta",
title = "Design and analysis of a congestion-free overlay on a
high-speed network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "970--980",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p970-izmailov/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; reliability; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf D.4.4} Software, OPERATING SYSTEMS,
Communications Management. {\bf I.6.4} Computing
Methodologies, SIMULATION AND MODELING, Model
Validation and Analysis.",
}
@Article{MacGregor:1997:DPR,
author = "M. H. MacGregor and Wayne D. Grover",
title = "Distributed partial-express routing of broad-band
transport network demands",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "981--988",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p981-macgregor/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf I.6.0} Computing Methodologies, SIMULATION AND
MODELING, General.",
}
@Article{Yener:1997:CDC,
author = "B{\"u}lent Yener and Yoram Ofek and Moti Yung",
title = "Combinatorial design of congestion-free networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "5",
number = "6",
pages = "989--1000",
month = dec,
year = "1997",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p989-yener/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf I.6.4} Computing Methodologies,
SIMULATION AND MODELING, Model Validation and
Analysis.",
}
@Article{Thaler:1998:UNM,
author = "David G. Thaler and Chinya V. Ravishankar",
title = "Using name-based mappings to increase hit rates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "1--14",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p1-thaler/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design
Styles, Cache memories. {\bf C.5.5} Computer Systems
Organization, COMPUTER SYSTEM IMPLEMENTATION, Servers.
{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Internet. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.",
}
@Article{Cohen:1998:THP,
author = "Reuven Cohen and Srinivas Ramanathan",
title = "{TCP} for high performance in hybrid fiber coaxial
broad-band access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "15--29",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p15-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Internet. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Xie:1998:RBT,
author = "Geoffrey G. Xie and Simon S. Lam",
title = "Real-time block transfer under a link-sharing
hierarchy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "30--41",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p30-xie/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Liew:1998:CAA,
author = "Soung C. Liew and Derek Chi-yin Tse",
title = "A control-theoretic approach to adapting {VBR}
compressed video for transport over a {CBR}
communications channel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "42--55",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p42-liew/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
reliability; theory",
subject = "{\bf G.0} Mathematics of Computing, GENERAL. {\bf
C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf H.5.1} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems, Video (e.g., tape, disk, DVI).
{\bf E.4} Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.4.2} Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output
Devices, Channels and controllers. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS.",
}
@Article{Dixit:1998:TDM,
author = "Sudhir S. Dixit and Sharad Kumar",
title = "Traffic descriptor mapping and traffic control for
frame relay over {ATM} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "56--70",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p56-dixit/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement;
performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Northcote:1998:SCP,
author = "Bruce S. Northcote and Donald E. Smith",
title = "Service control point overload rules to protect
intelligent network services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "71--81",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p71-northcote/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf I.2.1}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Applications and Expert Systems. {\bf G.4} Mathematics
of Computing, MATHEMATICAL SOFTWARE, Algorithm design
and analysis. {\bf I.6.3} Computing Methodologies,
SIMULATION AND MODELING, Applications.",
}
@Article{Girard:1998:MFM,
author = "Andre Girard and Brunilde Sans{\'o}",
title = "Multicommodity flow models, failure propagation, and
reliable loss network design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "82--93",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p82-girard/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
reliability; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis.",
}
@Article{Ravindran:1998:CAM,
author = "K. Ravindran and Ting-Jian Gong",
title = "Cost analysis of multicast transport architectures in
multiservice networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "1",
pages = "94--109",
month = feb,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-1/p94-ravindran/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement;
performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf K.6.0} Computing Milieux,
MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS,
General, Economics. {\bf C.2.3} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Operations.",
}
@Article{Newman:1998:ISU,
author = "Peter Newman and Greg Minshall and Thomas L. Lyon",
title = "{IP} switching --- {ATM} under {IP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "117--129",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p117-newman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols, IP.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks.",
}
@Article{Choudhury:1998:DQL,
author = "Abhijit K. Choudhury and Ellen L. Hahne",
title = "Dynamic queue length thresholds for shared-memory
packet switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "130--140",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p130-choudhury/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Asynchronous
Transfer Mode (ATM). {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Performance
attributes.",
}
@Article{Privalov:1998:PJA,
author = "Aleksandr Privalov and Khosrow Sohraby",
title = "Per-stream jitter analysis in {CBR ATM} multiplexors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "141--149",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p141-privalov/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; standardization",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital Network).
{\bf G.3} Mathematics of Computing, PROBABILITY AND
STATISTICS, Probabilistic algorithms (including Monte
Carlo).",
}
@Article{Fulton:1998:DJF,
author = "Cathy A. Fulton and San-qi Li",
title = "Delay jitter first-order and second-order statistical
functions of general traffic on high-speed multimedia
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "150--163",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p150-fulton/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf G.1.2}
Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation. {\bf I.6.8} Computing Methodologies,
SIMULATION AND MODELING, Types of Simulation, Discrete
event. {\bf G.1.3} Mathematics of Computing, NUMERICAL
ANALYSIS, Numerical Linear Algebra, Eigenvalues and
eigenvectors (direct and iterative methods). {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computation of transforms.",
}
@Article{Stiliadis:1998:RSD,
author = "Dimitrios Stiliadis and Anujan Varma",
title = "Rate-proportional servers: a design methodology for
fair queueing algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "164--174",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p164-stiliadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling.",
}
@Article{Stiliadis:1998:EFQ,
author = "Dimitrios Stiliadis and Anujan Varma",
title = "Efficient fair queueing algorithms for packet-switched
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "175--185",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p175-stiliadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling.",
}
@Article{Karasan:1998:EWR,
author = "Ezhan Karasan and Ender Ayanoglu",
title = "Effects of wavelength routing and selection algorithms
on wavelength conversion gain in {WDM} optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "186--196",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p186-karasan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Circuit-switching networks. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Network problems. {\bf G.3} Mathematics of
Computing, PROBABILITY AND STATISTICS, Probabilistic
algorithms (including Monte Carlo). {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols, Routing protocols.",
}
@Article{Mokhtar:1998:AWR,
author = "Ahmed Mokhtar and Murat Azizo{\u{g}}lu",
title = "Adaptive wavelength routing in all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "197--206",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p197-mokhtar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance",
subject = "{\bf C.2.6} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Internetworking,
Routers. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology. {\bf G.2.2} Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory,
Network problems.",
}
@Article{Murakami:1998:OCF,
author = "Kazutaka Murakami and Hyong S. Kim",
title = "Optimal capacity and flow assignment for self-healing
{ATM} networks based on line and end-to-end
restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "207--221",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p207-murakami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Network problems. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}
@Article{Anerousis:1998:VPC,
author = "Nikolaos Anerousis and Aurel A. Lazar",
title = "Virtual path control for {ATM} networks with call
level quality of service guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "2",
pages = "222--236",
month = apr,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-2/p222-anerousis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; performance;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf G.2.2} Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory,
Network problems. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Network topology.",
}
@Article{Partridge:1998:IR,
author = "Craig Partridge and Philip P. Carvey and Ed Burgess
and Isidro Castineyra and Tom Clarke and Lise Graham
and Michael Hathaway and Phil Herman and Allen King and
Steve Kohalmi and Tracy Ma and John Mcallen and Trevor
Mendez and Walter C. Milliken and Ronald Pettyjohn and
John Rokosz and Joshua Seeger and Michael Sollins and
Steve Storch and Benjamin Tober and Gregory D. Troxel",
title = "A {50-Gb/s IP} router",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "237--248",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p237-partridge/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory",
subject = "{\bf C.2.6} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Internetworking,
Routers. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf C.2.5} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Local and Wide-Area Networks, Internet.",
}
@Article{Ramjee:1998:PEC,
author = "Ramachandran Ramjee and Thomas F. {La Porta} and Jim
Kurose and Don Towsley",
title = "Performance evaluation of connection rerouting schemes
for {ATM}-based wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "249--261",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p249-ramjee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; management;
measurement; performance",
subject = "{\bf C.2.3} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Operations,
Network management. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Asynchronous Transfer Mode
(ATM). {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Wireless communication. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Design
studies.",
}
@Article{Bjorkman:1998:PMM,
author = "Mats Bj{\"o}rkman and Per Gunningberg",
title = "Performance modeling of multiprocessor implementations
of protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "262--273",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p262-bjorkman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "measurement; performance",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}
@Article{Cobb:1998:TSS,
author = "Jorge A. Cobb and Mohamed G. Gouda and Amal El-Nahas",
title = "Time-shift scheduling --- fair scheduling of flows in
high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "274--285",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p274-cobb/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems. {\bf C.2.1} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Architecture and Design, Packet-switching
networks.",
}
@Article{Aharoni:1998:RDS,
author = "Ehud Aharoni and Reuven Cohen",
title = "Restricted dynamic {Steiner} trees for scalable
multicast in datagram networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "286--297",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p286-aharoni/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory; verification",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Trees. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis. {\bf C.2.2} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Protocols.",
}
@Article{Ju:1998:OTS,
author = "Ji-Her Ju and Victor O. K. Li",
title = "An optimal topology-transparent scheduling method in
multihop packet radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "298--306",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p298-ju/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.",
}
@Article{Liew:1998:BNM,
author = "Soung C. Liew and Ming-Hung Ng and Cathy W. Chan",
title = "Blocking and nonblocking multirate {Clos} switching
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "307--318",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p307-liew/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; measurement; performance;
theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf I.2.8} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Heuristic
methods. {\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General.",
}
@Article{Yeung:1998:NPO,
author = "Kwan Lawrence Yeung and Tak-Shing Peter Yum",
title = "Node placement optimization in {ShuffleNets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "319--324",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p319-yeung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf G.4} Mathematics of Computing, MATHEMATICAL
SOFTWARE, Algorithm design and analysis. {\bf G.1.6}
Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization. {\bf G.2.0} Mathematics of Computing,
DISCRETE MATHEMATICS, General. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network topology.",
}
@Article{Iraschko:1998:OCP,
author = "Rainer R. Iraschko and M. H. MacGregor and Wayne D.
Grover",
title = "Optimal capacity placement for path restoration in
{STM} or {ATM} mesh-survivable networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "325--336",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p325-iraschko/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; standardization;
theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols.",
}
@Article{Neelakantan:1998:SFM,
author = "B. Neelakantan and S. V. Raghavan",
title = "Scientific foundations to the multilevel method",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "3",
pages = "337--346",
month = jun,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-3/p337-neelakantan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf F.1.1} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Models of Computation,
Automata. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf I.2.8} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols, Protocol verification.",
}
@Article{Nonnenmacher:1998:PLR,
author = "J{\"o}rg Nonnenmacher and Ernst W. Biersack and Don
Towsley",
title = "Parity-based loss recovery for reliable multicast
transmission",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "349--361",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p349-nonnenmacher/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; reliability;
standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf E.4} Data, CODING AND INFORMATION
THEORY, Error control codes.",
}
@Article{Clark:1998:EAB,
author = "David D. Clark and Wenjia Fang",
title = "Explicit allocation of best-effort packet delivery
service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "362--373",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p362-clark/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.4} Mathematics of Computing, MATHEMATICAL
SOFTWARE, Algorithm design and analysis.",
}
@Article{Gopalakrishnan:1998:EUP,
author = "R. Gopalakrishnan and Gurudatta M. Parulkar",
title = "Efficient user-space protocol implementations with
{QoS} guarantees using real-time upcalls",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "374--388",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p374-gopalakrishnan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; management; measurement; performance;
reliability; standardization; theory",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.
{\bf D.4.0} Software, OPERATING SYSTEMS, General. {\bf
H.5.1} Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems. {\bf C.3}
Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS, Real-time and embedded
systems.",
}
@Article{Hoschka:1998:CEP,
author = "Philipp Hoschka",
title = "Compact and efficient presentation conversion code",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "389--396",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p389-hoschka/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; experimentation; languages; measurement;
performance; theory",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS. {\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Compilers. {\bf G.3} Mathematics of
Computing, PROBABILITY AND STATISTICS, Markov
processes. {\bf K.6.2} Computing Milieux, MANAGEMENT OF
COMPUTING AND INFORMATION SYSTEMS, Installation
Management, Benchmarks.",
}
@Article{Salehi:1998:SSV,
author = "James D. Salehi and Shi-Li Zhang and Jim Kurose and
Don Towsley",
title = "Supporting stored video: reducing rate variability and
end-to-end resource requirements through optimal
smoothing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "397--410",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p397-salehi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement;
performance; theory; verification",
subject = "{\bf H.5.1} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, Multimedia Information
Systems, Video (e.g., tape, disk, DVI). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf D.4.0} Software, OPERATING SYSTEMS, General. {\bf
C.5.5} Computer Systems Organization, COMPUTER SYSTEM
IMPLEMENTATION, Servers. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis.",
}
@Article{Shroff:1998:ILC,
author = "Ness B. Shroff and Mischa Schwartz",
title = "Improved loss calculations at an {ATM} multiplexer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "411--421",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p411-shroff/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf G.3}
Mathematics of Computing, PROBABILITY AND STATISTICS,
Markov processes. {\bf G.3} Mathematics of Computing,
PROBABILITY AND STATISTICS, Queueing theory. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Chlamtac:1998:DAE,
author = "Imrich Chlamtac and Hongbiao Zhang and Andr{\'a}s
Farag{\'o} and Andrea Fumagalli",
title = "A deterministic approach to the end-to-end analysis of
packet flows in connection-oriented networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "422--431",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 18:05:33 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p422-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf C.1.3} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Other Architecture Styles, Neural nets.
{\bf G.3} Mathematics of Computing, PROBABILITY AND
STATISTICS, Queueing theory. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design,
Packet-switching networks. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Asynchronous Transfer Mode
(ATM).",
xxnote = "See comments \cite{Boudec:2000:CQD}.",
}
@Article{Gerstel:1998:ESC,
author = "Ornan Ori Gerstel and Israel Cidon and Shmuel Zaks",
title = "Efficient support for client\slash server applications
over heterogeneous {ATM} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "432--446",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p432-gerstel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Routing and layout. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@Article{Berger:1998:EBP,
author = "Arthur W. Berger and Ward Whitt",
title = "Effective bandwidths with priorities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "447--460",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p447-berger/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.3} Mathematics of Computing, PROBABILITY AND
STATISTICS, Queueing theory. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis.",
}
@Article{Parsa:1998:IAD,
author = "Mehrdad Parsa and Qing Zhu and J. J.
Garcia-Luna-Aceves",
title = "An iterative algorithm for delay-constrained
minimum-cost multicasting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "461--474",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p461-parsa/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; management; measurement;
performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis. {\bf H.5.1} Information Systems, INFORMATION
INTERFACES AND PRESENTATION, Multimedia Information
Systems. {\bf I.2.8} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Heuristic methods.",
}
@Article{Huang:1998:SIC,
author = "Nen-Fu Huang and Huey-Ing Liu",
title = "A study of isochronous channel reuse in {DQDB}
metropolitan area networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "475--484",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p475-huang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; experimentation; measurement;
performance; theory",
subject = "{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE, Algorithm design and
analysis. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf F.1.3} Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Complexity Measures
and Classes, Reducibility and completeness. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General.",
}
@Article{Kumar:1998:CPA,
author = "Anurag Kumar",
title = "Comparative performance analysis of versions of {TCP}
in a local network with a lossy link",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "485--498",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p485-kumar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance;
standardization; theory",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, Internet.",
}
@Article{Lee:1998:CDT,
author = "Tsern-Huei Lee and Kuen-Chu Lai",
title = "Characterization of delay-sensitive traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "4",
pages = "499--504",
month = aug,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-4/p499-lee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; measurement; performance; theory;
verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, ISDN (Integrated Services Digital
Network).",
}
@Article{Mills:1998:AHC,
author = "David L. Mills",
title = "Adaptive hybrid clock discipline algorithm for the
network time protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "505--514",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p505-mills/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance; reliability;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Internet. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes.",
}
@Article{Labovitz:1998:IRI,
author = "Craig Labovitz and G. Robert Malan and Farnam
Jahanian",
title = "{Internet} routing instability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "515--528",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p515-labovitz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Internet. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Network communications. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes.",
}
@Article{Stone:1998:PCC,
author = "Jonathan Stone and Michael Greenwald and Craig
Partridge and James Hughes",
title = "Performance of checksums and {CRC}'s over real data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "529--543",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p529-stone/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement; performance;
theory; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Reliability, availability, and
serviceability. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP.",
}
@Article{Che:1998:ARM,
author = "Hao Che and San-qi Li and Arthur Lin",
title = "Adaptive resource management for flow-based {IP\slash
ATM} hybrid switching systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "544--557",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p544-che/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Asynchronous
Transfer Mode (ATM). {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols, IP. {\bf I.2.6} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Learning. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{Firoiu:1998:EAC,
author = "Victor Firoiu and Jim Kurose and Don Towsley",
title = "Efficient admission control of piecewise linear
traffic envelopes at {EDF} schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "558--570",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p558-firoiu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; verification",
subject = "{\bf C.2.0} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf G.4} Mathematics of Computing, MATHEMATICAL
SOFTWARE, Algorithm design and analysis. {\bf C.2.3}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Operations.",
}
@Article{Mishra:1998:EFC,
author = "Shivakant Mishra and Lei Wu",
title = "An evaluation of flow control in group communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "571--587",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p571-mishra/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf I.6.8} Computing Methodologies, SIMULATION AND
MODELING, Types of Simulation, Discrete event. {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Performance attributes. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability.",
}
@Article{Hajek:1998:VQR,
author = "Bruce Hajek and Linhai He",
title = "On variations of queue response for inputs with the
same mean and autocorrelation function",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "588--598",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p588-hajek/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance; theory",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Performance attributes. {\bf
G.3} Mathematics of Computing, PROBABILITY AND
STATISTICS, Queueing theory. {\bf I.6.8} Computing
Methodologies, SIMULATION AND MODELING, Types of
Simulation, Discrete event.",
}
@Article{Kalampoukas:1998:ASP,
author = "Lampros Kalampoukas and Anujan Varma",
title = "Analysis of source policy and its effects on {TCP} in
rate-controlled {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "599--610",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p599-kalampoukas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sequencing and scheduling. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Performance
attributes.",
}
@Article{Stiliadis:1998:LSG,
author = "Dimitrios Stiliadis and Anujan Varma",
title = "Latency-rate servers: a general model for analysis of
traffic scheduling algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "611--624",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p611-stiliadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; theory; verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf F.2.2}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sequencing and scheduling. {\bf C.4} Computer
Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@Article{Shiomoto:1998:SBM,
author = "Kohei Shiomoto and Shinichiro Chaki and Naoaki
Yamanaka",
title = "A simple bandwidth management strategy based on
measurements of instantaneous virtual path utilization
in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "625--634",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p625-shiomoto/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; measurement; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Measurement techniques.",
}
@Article{Adas:1998:UAL,
author = "Abdelnaser Mohammad Adas",
title = "Using adaptive linear prediction to support real-time
{VBR} video under {RCBR} network service model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "635--644",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p635-adas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.1}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design, Asynchronous
Transfer Mode (ATM). {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Sequencing and
scheduling. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Reliability, availability, and
serviceability.",
}
@Article{Kim:1998:DSG,
author = "Peter Kim",
title = "Deterministic service guarantees in {IEEE 802.12}
networks --- part {I}: the single-hub case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "645--658",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p645-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement; performance;
standardization; theory; verification",
subject = "{\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.2}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Protocols. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Performance
attributes. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Sequencing and scheduling.",
}
@Article{Choe:1998:CAA,
author = "Jinwoo Choe and Ness B. Shroff",
title = "A central-limit-theorem-based approach for analyzing
queue behavior in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "659--671",
month = oct,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p659-choe/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; performance; reliability; theory;
verification",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.2.5} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area
Networks, High-speed. {\bf G.3} Mathematics of
Computing, PROBABILITY AND STATISTICS, Queueing theory.
{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf I.6.8}
Computing Methodologies, SIMULATION AND MODELING, Types
of Simulation.",
}
@Article{Feldmann:1998:EPC,
author = "Anja Feldmann and Jennifer Rexford and Ram{\'o}n
C{\'a}ceres",
title = "Efficient policies for carrying {Web} traffic over
flow-switched networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "673--685",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p673-feldmann/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.2.5}
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Local and Wide-Area Networks, Internet.",
}
@Article{Liu:1998:LER,
author = "Ching-Gung Liu and Deborah Estrin and Scott Shenker
and Lixia Zhang",
title = "Local error recovery in {SRM}: comparison of two
approaches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "686--699",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p686-liu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "experimentation; performance; reliability",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Packet-switching networks. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability.",
}
@Article{Yau:1998:MSS,
author = "David K. Y. Yau and Simon S. Lam",
title = "Migrating sockets --- end system support for
networking with quality of service guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "700--716",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p700-yau/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Reliability, availability, and
serviceability. {\bf C.2.2} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols, TCP/IP. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design.",
}
@Article{Duffield:1998:SAS,
author = "N. G. Duffield and K. K. Ramakrishnan and Amy R.
Reibman",
title = "{SAVE}: an algorithm for smoothed adaptive video over
explicit rate networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "717--728",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p717-duffield/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems.",
}
@Article{Kalampoukas:1998:TTT,
author = "Lampros Kalampoukas and Anujan Varma and K. K.
Ramakrishnan",
title = "Two-way {TCP} traffic over rate controlled channels:
effects and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "729--743",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p729-kalampoukas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP. {\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM).",
}
@Article{Ramaswami:1998:MON,
author = "Rajiv Ramaswami and Galen Sasaki",
title = "Multiwavelength optical networks with limited
wavelength conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "744--754",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p744-ramaswami/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS.",
}
@Article{Ramamurthy:1998:OAP,
author = "Byrav Ramamurthy and Jason Iness and Biswanath
Mukherjee",
title = "Optimizing amplifier placements in a multiwavelength
optical {LAN\slash MAN}: the unequally powered
wavelengths case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "755--767",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p755-ramamurthy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance",
subject = "{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf C.2.5} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Local
and Wide-Area Networks.",
}
@Article{Lorenz:1998:QRN,
author = "Dean H. Lorenz and Ariel Orda",
title = "{QoS} routing in networks with uncertain parameters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "768--778",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p768-lorenz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design; performance; reliability",
subject = "{\bf C.2.6} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Internetworking,
Routers. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Reliability, availability, and
serviceability.",
}
@Article{Saha:1998:CRR,
author = "Debanjan Saha and Sarit Mukherjee and Satish K.
Tripathi",
title = "Carry-over round robin: a simple cell scheduling
mechanism for {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "779--796",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Pronk:2001:CCR}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p779-saha/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kulkarni:1998:PAR,
author = "Lalita A. Kulkarni and San-qi Li",
title = "Performance analysis of a rate-based feedback control
scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "797--810",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p797-kulkarni/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mark:1998:RED,
author = "Brian L. Mark and Gopalakrishnan Ramamurthy",
title = "Real-time estimation and dynamic renegotiation of
{UPC} parameters for arbitrary traffic sources in {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "811--827",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p811-mark/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jia:1998:DAD,
author = "Xiaohua Jia",
title = "A distributed algorithm of delay-bounded multicast
routing for multimedia applications in wide area
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "828--837",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Huang:2005:CID}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p828-jia/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kweon:1998:PDD,
author = "Seok-Kyu Kweon and Kang G. Shin",
title = "Providing deterministic delay guarantees in {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "838--850",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p838-kweon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hac:1998:DLM,
author = "Anna Ha{\'c} and Bo Liu",
title = "Database and location management schemes for mobile
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "6",
pages = "851--865",
month = dec,
year = "1998",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-6/p851-hac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chlamtac:1999:SWA,
author = "Imrich Chlamtac and Vikt{\'o}ria Elek and Andrea
Fumagalli and Csaba Szab{\'o}",
title = "Scalable {WDM} access network architecture based on
photonic slot routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "1--9",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p1-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical networks; network scalability; packet
switching; photonic slot routing; wavelength-division
multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Greenberg:1999:RSB,
author = "Albert G. Greenberg and R. Srikant and Ward Whitt",
title = "Resource sharing for book-ahead and
instantaneous-request calls",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "10--22",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p10-greenberg/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "advance reservation; book-ahead calls; integrated
services networks; link partitioning; loss networks;
quality of service; video teleconferencing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Hobson:1999:PEP,
author = "Richard F. Hobson and P. S. Wong",
title = "A parallel embedded-processor architecture for {ATM}
reassembly",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "23--37",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p23-hobson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; embedded systems; medium access control;
segmentation and reassembly",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Processor Architectures --- Parallel Architectures
(C.1.4)",
}
@Article{Li:1999:CCN,
author = "Junyi Li and Ness B. Shroff and Edwin K. P. Chong",
title = "Channel carrying: a novel handoff scheme for mobile
cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "38--50",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p38-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "channel borrowing; channel reservation; dynamic
channel allocation; modified fixed channel allocation",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}",
}
@Article{Chlamtac:1999:ECA,
author = "Imrich Chlamtac and Chiara Petrioli and Jason Redi",
title = "Energy-conserving access protocols for identification
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "51--59",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p51-chlamtac/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Protocols (C.2.2)",
}
@Article{Nong:1999:ANA,
author = "Ge Nong and Jogesh K. Muppala and Mounir Hamdi",
title = "Analysis of nonblocking {ATM} switches with multiple
input queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "60--74",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p60-nong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "analytical modeling; ATM switch; computer simulation;
performance evaluation",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}",
}
@Article{Capone:1999:DQR,
author = "Jeffrey M. Capone and Ioannis Stavrakakis",
title = "Delivering {QoS} requirements to traffic with diverse
delay tolerances in a {TDMA} environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "75--87",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p75-capone/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "integrated services; QoS; scheduling; TDMA; wireless",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Tassiulas:1999:CTS,
author = "Leandros Tassiulas",
title = "Cut-through switching, pipelining, and scheduling for
network evacuation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "88--97",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p88-tassiulas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Xiong:1999:RSS,
author = "Yijun Xiong and Lorne G. Mason",
title = "Restoration strategies and spare capacity requirements
in self-healing {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "98--110",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p98-xiong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; heuristics; linear programming; network design;
network reliability/survivability; self-healing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}",
}
@Article{Cheng:1999:QPN,
author = "Ray-Guang Cheng and Chung-Ju Chang and Li-Fong Lin",
title = "A {QoS-Provisioning} neural fuzzy connection admission
controller for multimedia high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "111--121",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p111-cheng/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Lombardo:1999:DTP,
author = "Alifo Lombardo and Giacomo Morabito and Giovanni
Schembra",
title = "A discrete-time paradigm to evaluate skew performance
in a multimedia {ATM} multiplexer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "1",
pages = "122--139",
month = feb,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-1/p122-lombardo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; Markov models; multimedia; performance
evaluation; skew",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Akyildiz:1999:SCP,
author = "Ian F. Akyildiz and David A. Levine and Inwhee Joe",
title = "A slotted {CDMA} protocol with {BER} scheduling for
wireless multimedia networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "146--158",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p146-akyildiz/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BER scheduling; code division multiple access;
multimedia traffic; power control; priority; wireless
networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}",
}
@Article{Cheshire:1999:COB,
author = "Stuart Cheshire and Mary Baker",
title = "Consistent overhead {Byte} stuffing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "159--172",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p159-cheshire/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Byte stuffing; framing; packet; serial; transmission",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}",
}
@Article{Feng:1999:UIT,
author = "Wu-chang Feng and Dilip D. Kandlur and Debanjan Saha
and Kang G. Shin",
title = "Understanding and improving {TCP} performance over
networks with minimum rate guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "173--187",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p173-feng/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "differentiated services; integrated services; queue
management; TCP",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2)",
}
@Article{McKeown:1999:ISA,
author = "Nick McKeown",
title = "The {iSLIP} scheduling algorithm for input-queued
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "188--201",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p188-mckeown/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM switch; crossbar switch; input-queueing; IP
router; scheduling",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf IP}; Theory of Computation --- Analysis
of Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Sequencing and
scheduling}",
}
@Article{Rexford:1999:SVB,
author = "Jennifer Rexford and Don Towsley",
title = "Smoothing variable-bit-rate video in an
{Internetwork}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "202--215",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p202-rexford/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Bandwidth-smoothing; Internetwork; majorization;
prefetching; variable-bit-rate video",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Information Systems
--- Information Interfaces and Presentation ---
Multimedia Information Systems (H.5.1): {\bf Video
(e.g., tape, disk, DVI)}",
}
@Article{Kim:1999:PAD,
author = "Yonghwan Kim and San-qi Li",
title = "Performance analysis of data packet discarding in
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "216--227",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p216-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "badput; buffer threshold; early packet discarding;
goodput; packet loss probability; packet tail
discarding; packet-level control; stochastic modeling",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Haas:1999:AH,
author = "Zygmunt J. Haas and Ben Liang",
title = "Ad hoc mobility management with uniform quorum
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "228--240",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p228-haas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0)",
}
@Article{Qiao:1999:LPE,
author = "Chunming Qiao and Yousong Mei",
title = "Off-line permutation embedding and scheduling in
multiplexed optical networks with regular topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "241--250",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p241-qiao/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "rearrangeable nonblocking; wavelength conversion;
wavelength routing; wavelength-division multiplexing;
WDM meshes; WDM rings",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Zafirovic-Vukotic:1999:WTE,
author = "Mirjana Zafirovic-Vukotic and Ignatius G. M. M.
Niemegeers",
title = "Waiting time estimates in symmetric {ATM}-oriented
rings with the destination release of used slots",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "251--261",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p251-zafirovic-vukotic/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; LAN; queueing model",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
}
@Article{Gopal:1999:FBH,
author = "Ajei Gopal and Inder Gopal and Shay Kutten",
title = "Fast broadcast in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "2",
pages = "262--275",
month = apr,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-2/p262-gopal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Protocols (C.2.2); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Modeling techniques}",
}
@Article{Paxson:1999:EEI,
author = "Vern Paxson",
title = "End-to-end {Internet} packet dynamics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "277--292",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p277-paxson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "computer network performance; computer network
reliability; computer networks; failure analysis;
Internet-working; stability",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization --- Performance of
Systems (C.4): {\bf Reliability, availability, and
serviceability}",
}
@Article{Grossglauser:1999:FRM,
author = "Matthias Grossglauser and David N. C. Tse",
title = "A framework for robust measurement-based admission
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "293--309",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p293-grossglauser/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Measurement; Performance; Reliability;
Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4)",
}
@Article{Agrawal:1999:PBF,
author = "Rajeev Agrawal and Rene L. Cruz and Clayton Okino and
Rajendran Rajan",
title = "Performance bonds for flow control protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "310--323",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p310-agrawal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Performance; Theory; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "adaptive service; burstiness; delay; guaranteed
service; network calculus; queueing; regulator;
scheduler; service curve",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Performance attributes}",
}
@Article{Lampson:1999:ILU,
author = "Butler Lampson and Venkatachary Srinivasan and George
Varghese",
title = "{IP} lookups using multiway and multicolumn search",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "324--334",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p324-lampson/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf IP}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization ---
Computer-Communication Networks --- Internetworking
(C.2.6): {\bf Routers}",
}
@Article{Varvarigos:1999:VCD,
author = "Emmanouel A. Varvarigos and Jonathan P. Lang",
title = "A virtual circuit deflection protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "335--349",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p335-varvarigos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "deflection routing; Manhattan Street network;
multigigabit networks; optical switching; performance
analysis; tell-and-go protocol; virtual circuit
switching",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Circuit-switching
networks}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Guerin:1999:QRN,
author = "Roche A. Gu{\'e}rin and Ariel Orda",
title = "{QoS} routing in networks with inaccurate information:
theory and algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "350--364",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p350-guerin/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Bandwidth; delay; inaccuracy; networks; QoS; routing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2)",
}
@Article{Orda:1999:REE,
author = "Ariel Orda",
title = "Routing with end-to-end {QoS} guarantees in broadband
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "365--374",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p365-orda/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "constrained path optimization; hierarchical networks;
QoS routing; rate-based schedulers; topology
aggregation",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Routing and layout}; Mathematics of Computing ---
Discrete Mathematics --- Graph Theory (G.2.2): {\bf
Network problems}",
}
@Article{Nonnenmacher:1999:SFL,
author = "J{\"o}rg Nonnenmacher and Ernst W. Biersack",
title = "Scalable feedback for large groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "375--386",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p375-nonnenmacher/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "extreme value theory; feedback; multicast; performance
evaluation; reliable multicast",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Reliability, availability, and serviceability}",
}
@Article{Manzoni:1999:WMV,
author = "Pietro Manzoni and Paolo Cremonesi and Giuseppe
Serazzi",
title = "Workload models of {VBR} video traffic and their use
in resource allocation policies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "387--397",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p387-manzoni/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "burstiness; communication systems performance;
delay-sensitive traffic; multimedia communication;
networks",
subject = "Computer Systems Organization --- Performance of
Systems (C.4): {\bf Performance attributes}; Computer
Systems Organization --- Computer-Communication
Networks --- General (C.2.0)",
}
@Article{Chandra:1999:MOT,
author = "Kavitha Chandra and Amy R. Reibman",
title = "Modeling one- and two-layer variable bit rate video",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "398--413",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p398-chandra/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MPEG2; multiplexing; traffic model; two-layer; VBR
video",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0);
Computer Systems Organization --- Performance of
Systems (C.4): {\bf Modeling techniques}; Mathematics
of Computing --- Probability and Statistics (G.3): {\bf
Markov processes}",
}
@Article{Pankaj:1999:WRM,
author = "Rajesh K. Pankaj",
title = "Wavelength requirements for multicasting in
all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "414--424",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p414-pankaj/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical networks; multicasting; wavelength
division multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2); Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}",
}
@Article{Modiano:1999:RAS,
author = "Eytan Modiano",
title = "Random algorithms for scheduling multicast traffic in
{WDM} broadcast-and-select networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "425--434",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p425-modiano/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadcast star topology; lightwave networks; local
lightwave networks; multicast scheduling algorithms;
multicast switching; multicast/broadcast algorithms;
wavelength division multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}; Computer Systems
Organization --- Computer-Communication Networks ---
Local and Wide-Area Networks (C.2.5)",
}
@Article{Zhang:1999:SAA,
author = "Xijun Zhang and Chunming Qiao",
title = "On scheduling all-to-all personalized connections and
cost-effective designs in {WDM} rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "435--445",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p435-zhang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical paths; all-to-all communications; lower
bound; wavelength requirement",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}",
}
@Article{Dasylva:1999:OWS,
author = "Abel Dasylva and R. Srikant",
title = "Optimal {WDM} schedules for optical star networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "3",
pages = "446--456",
month = jun,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-3/p446-dasylva/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical networks; polynomial-time algorithms;
scheduling; wavelength-division multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Computation by Abstract Devices --- Complexity
Measures and Classes (F.1.3)",
}
@Article{Floyd:1999:PUE,
author = "Sally Floyd and Kevin Fall",
title = "Promoting the use of end-to-end congestion control in
the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "458--472",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p458-floyd/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Computer Systems Organization --- Performance
of Systems (C.4)",
}
@Article{Lu:1999:FSW,
author = "Songwu Lu and Vaduvur Bharghavan and R. Srikant",
title = "Fair scheduling in wireless packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "473--489",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p473-lu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}",
}
@Article{Presti:1999:STS,
author = "Francesco {Lo Presti} and Zhi-Li Zhang and Jim Kurose
and Don Towsley",
title = "Source time scale and optimal buffer\slash bandwidth
tradeoff for heterogeneous regulated traffic in a
network node",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "490--501",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p490-presti/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Wong:1999:DSF,
author = "Chung Kei Wong and Simon S. Lam",
title = "Digital signatures for flows and multicasts",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "502--513",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p502-wong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Security and protection (e.g., firewalls)};
Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Trees}",
}
@Article{Raghavan:1999:RAC,
author = "Sriram Raghavan and G. Manimaran and C. Siva Ram
Murthy",
title = "A rearrangeable algorithm for the construction
delay-constrained dynamic multicast trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "514--529",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p514-raghavan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Trees}",
}
@Article{Kong:1999:MSS,
author = "Keith Kong and Dipak Ghosal",
title = "Mitigating server-side congestion in the {Internet}
through pseudoserving",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "530--544",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p530-kong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "caching; flash-crowd; Internet server technology;
pseudoserving",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet}",
}
@Article{Xiao:1999:AAW,
author = "Gaoxi Xiao and Yiu-Wing Leung",
title = "Algorithms for allocating wavelength converters in
all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "545--557",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p545-xiao/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "All-optical WDM networks; simulation-based
optimization; wavelength converter",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization --- Performance of
Systems (C.4): {\bf Performance attributes}",
}
@Article{Grover:1999:HAP,
author = "Wayne D. Grover",
title = "High availability path design in ring-based optimal
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "558--574",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p558-grover/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Modeling techniques}",
}
@Article{Sharma:1999:OBM,
author = "Supriya Sharma and Yannis Viniotis",
title = "Optimal buffer management policies for shared-buffer
{ATM} switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "575--587",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p575-sharma/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM switches; buffer management; optimal policies",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}",
}
@Article{Park:1999:DSR,
author = "Jae-Hyun Park and Hyunsoo Yoon and Heung-Kyu Lee",
title = "The deflection self-routing {Banyan} network: a
large-scale {ATM} switch using the fully adaptive
self-routing and its performance analyses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "4",
pages = "588--604",
month = aug,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-4/p588-park/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algebraic formalism; ATM switch; deflection
self-routing Banyan network; performance evaluation;
topological properties; unbuffered Banyan network",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}",
}
@Article{Chaskar:1999:TWL,
author = "Hemant M. Chaskar and T. V. Lakshman and U. Madhow",
title = "{TCP} over wireless with link level error control:
analysis and design methodology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "605--615",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p605-chaskar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "link-layer protocols; performance analysis; rayleigh
fading; TCP; wireless networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf TCP/IP}; Computer Systems Organization
--- Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Choi:1999:UCS,
author = "Sunghyun Choi and Kang G. Shin",
title = "An uplink {CDMA} system architecture with diverse
{QoS} guarantees for heterogeneous traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "616--628",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p616-choi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "admission control; admission tests; automatic
retransmission request; CDMA systems; dynamic
time-division duplexing (D-TDD); location-dependent
errors; MAC protocol; multicode CDMA; polling; power
control; priority scheduling; QoS guarantees;
QoS-sensitive communication; reed-Solomon/convolutional
concatenated code; transmission-rate request access
protocol; wireless LAN; wireless/mobile communication",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
}
@Article{Grossglauser:1999:RLR,
author = "Matthias Grossglauser and Jean-Chrysostome Bolot",
title = "On the relevance of long-range dependence in network
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "629--640",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p629-grossglauser/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "long-range dependence; network traffic modeling;
self-similarity",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Modeling techniques}",
}
@Article{Medard:1999:RTP,
author = "Muriel M{\'e}dard and Steven G. Finn and Richard A.
Barry",
title = "Redundant trees for preplanned recovery in arbitrary
vertex-redundant or edge-redundant graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "641--652",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p641-medard/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "graph theory; multicasting; network recovery; network
robustness; routing; trees",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
topology}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Trees}",
}
@Article{Banerjea:1999:FRG,
author = "Anindo Banerjea",
title = "Fault recovery for guaranteed performance
communications connections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "653--668",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p653-banerjea/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "B-ISDN; computer network management; connection
routing; network reliability; real time channels",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf ISDN (Integrated
Services Digital Network)}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Packet-switching networks}",
}
@Article{Sariowan:1999:SGS,
author = "Hanrijanto Sariowan and Rene L. Cruz and George C.
Polyzos",
title = "{SCED}: a generalized scheduling policy for
guaranteeing quality-of-service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "669--684",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p669-sariowan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "integrated services networks; multiplexing; network
calculus; quality-of-service guarantees; scheduling;
service curves; traffic envelopes",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Sequencing and
scheduling}",
}
@Article{Feng:1999:APM,
author = "Wu-Chang Feng and Dilip D. Kandlur",
title = "Adaptive packet marking for maintaining end-to-end
throughput in a differentiated-services {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "685--697",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p685-feng/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "differentiated services; integrated services;
Internet; quality-of-service; TCP",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Internet};
Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf TCP/IP}; Computer Systems Organization
--- Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}",
}
@Article{Manimaran:1999:NDR,
author = "G. Manimaran and Hariharan Shankar Rahul and C. Siva
Ram Murthy",
title = "A new distributed route selection approach for channel
establishment in real-time networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "698--709",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p698-manimaran/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "channel establishment; distributed routing;
heuristics; quality of service; real-time networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Lakshman:1999:TCV,
author = "T. V. Lakshman and P. P. Mishra and K. K.
Ramakrishnan",
title = "Transporting compressed video over {ATM} networks with
explicit-rate feedback control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "710--723",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p710-lakshman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; congestion control; packet video",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Information Systems ---
Information Interfaces and Presentation --- Multimedia
Information Systems (H.5.1): {\bf Video (e.g., tape,
disk, DVI)}; Data --- Coding and Information Theory
(E.4): {\bf Data compaction and compression}",
}
@Article{Al-Mouhamed:1999:EPD,
author = "Mayez A. Al-Mouhamed and Mohammed Kaleemuddin and
Habib Yousef",
title = "Evaluation of pipelined dilated banyan switch
architectures for {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "724--740",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p724-al-mouhamed/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf ISDN (Integrated
Services Digital Network)}",
}
@Article{Kolarov:1999:CTA,
author = "Aleksandar Kolarov and G. Ramamurthy",
title = "A control-theoretic approach to the design of an
explicit rate controller for {ABR} service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "741--753",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p741-kolarov/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ABR service; ATM networks; feedback control; flow
control",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Modeling
techniques}",
}
@Article{Subramaniam:1999:OCP,
author = "Suresh Subramaniam and Murat Azizo{\u{g}}lu and Arun
K. Somani",
title = "On optimal converter placement in wavelength-routed
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "754--766",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p754-subramaniam/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "call blocking performance; optimal converter
placement; sparse wavelength conversion;
wavelength-routing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Circuit-switching
networks}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
topology}",
}
@Article{Alanyali:1999:PAW,
author = "Murat Alanyali and Ender Ayanoglu",
title = "Provisioning algorithms for {WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "767--778",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p767-alanyali/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5); Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Network problems}",
}
@Article{Li:1999:DWR,
author = "Ling Li and Arun K. Somani",
title = "Dynamic wavelength routing using congestion and
neighborhood information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "5",
pages = "779--786",
month = oct,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Gong:2004:CDW}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-5/p779-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "alternate shortest-path routing; circuit switching;
neighborhood-information-based routing; wavelength
routing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Circuit-switching
networks}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}",
}
@Article{Bennett:1999:PRP,
author = "Jon C. R. Bennett and Craig Partridge and Nicholas
Shectman",
title = "Packet reordering is not pathological network
behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "789--798",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/1999-7-6/p789-bennett/p789-bennett.pdf;
http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p789-bennett/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication system traffic; Internet; packet
switching",
}
@Article{Basagni:1999:MTD,
author = "Stefano Basagni and Imrich Chlamtac and Danilo
Bruschi",
title = "A mobility-transparent deterministic broadcast
mechanism for ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "799--807",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/1999-7-6/p799-basagni/p799-basagni.pdf;
http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p799-basagni/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Naor:1999:LLA,
author = "Zohar Naor and Hanoch Levy",
title = "{LATS}: a load-adaptive threshold scheme for tracking
mobile users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "808--817",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p808-naor/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile; PCS; user tracking; wireless",
}
@Article{Li:1999:RPC,
author = "Junyi Li and Ness B. Shroff and K. P. Chong",
title = "A reduced-power channel reuse scheme for wireless
packet cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "818--832",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p818-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capture division packet access; channel reuse; packet
cellular networks; power control",
}
@Article{Gerstel:1999:WCA,
author = "Ori Gerstel and Galen Sasaki and Shay Kutten and Rajiv
Ramaswami",
title = "Worst-case analysis of dynamic wavelength allocation
in optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "833--846",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p833-gerstel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network design; optical networks; wavelength
assignment",
}
@Article{Aksoy:1999:SAL,
author = "Demet Aksoy and Michael Franklin",
title = "{$ R \times W $}: a scheduling approach for
large-scale on-demand data broadcast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "846--860",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p846-aksoy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Low:1999:OFC,
author = "Steven H. Low and David E. Lapsley",
title = "Optimization flow control, {I}: basic algorithm and
convergence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "861--874",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 07 14:12:50 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Karbowski:2003:CSF}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p861-low/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous algorithm; congestion pricing;
convergence; gradient projection; optimization flow
control",
}
@Article{Libman:1999:DPA,
author = "Lavy Libman and Ariel Orda",
title = "The designer's perspective to atomic noncooperative
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "875--884",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p875-libman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "atomic (unsplittable) resource sharing; capacity
allocation; network management; noncooperative
networks; routing",
}
@Article{Cidon:1999:AMP,
author = "Israel Cidon and Raphael Rom and Yuval Shavitt",
title = "Analysis of multi-path routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "885--896",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p885-cidon/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tsai:1999:CGP,
author = "Wei K. Tsai and John K. Antonio and Garng M. Huang",
title = "Complexity of gradient projection method for optimal
routing in data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "897--905",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p897-tsai/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithm complexity; congestion control;
internetworking; routing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Routing and layout}; Mathematics of Computing ---
Numerical Analysis --- Optimization (G.1.6): {\bf
Gradient methods}",
}
@Article{Felstaine:1999:DRC,
author = "Eyal Felstaine and Reuven Cohen",
title = "On the distribution of routing computation in
hierarchical {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "906--916",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p906-felstaine/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; hierarchical routing; load balancing; NIMROD;
PNNI",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Theory of Computation ---
Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Routing and layout}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Kousa:1999:PAN,
author = "Maan A. Kousa and Ahmed K. Elhakeem and Hui Yang",
title = "Performance of {ATM} networks under hybrid {ARQ\slash
FEC} error control scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "917--925",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p917-kousa/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ARQ packet; ARQ/FEC; ATM networks; Go-back-N;
throughput efficiency; traffic intensity; virtual
circuits",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Levy:1999:SEB,
author = "Hanoch Levy and Tzippi Mendelson and Moshe Sidi and
Joseph Keren-Zvi",
title = "Sizing exit buffers in {ATM} networks: an intriguing
coexistence of instability and tiny cell loss rates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "7",
number = "6",
pages = "926--936",
month = dec,
year = "1999",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:43:37 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1999-7-6/p926-levy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; buffer sizing; CBR; D+G/D/1 queue; end-to-end
loss rate",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Decasper:2000:RPS,
author = "Dan Decasper and Zubin Dittia and Guru Parulkar and
Bernhard Plattner",
title = "Router plugins: a software architecture for
next-generation routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "2--15",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p2-decasper/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication system routing; communication system
security; Internet; modular computer systems",
}
@Article{Wong:2000:SGC,
author = "Chung Kei Wong and Mohamed Gouda and Simon S. Lam",
title = "Secure group communications using key graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "16--30",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p16-wong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "confidentiality; group communications; group key
management; key distribution; multicast; privacy;
rekeying; security",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Security and protection (e.g., firewalls)}",
}
@Article{Baldi:2000:AGM,
author = "Mario Baldi and Yoram Ofek and B{\"u}lent Yener",
title = "Adaptive group multicast with time-driven priority",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "31--43",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p31-baldi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fairness; multicast; quality of service; real time;
ring networks; scheduling; time-driven priority",
}
@Article{Choi:2000:UWL,
author = "Sunghyun Choi and Kang G. Shin",
title = "A unified wireless {LAN} architecture for real-time
and non-real-time communication services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "44--59",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p44-choi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Iatrou:2000:DRS,
author = "Steve Iatrou and Ioannis Stavrakakis",
title = "A dynamic regulation and scheduling scheme for
real-time traffic management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "60--70",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p60-iatrou/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay variance; dynamic policy; QoS; regulation;
scheduling; throughput",
}
@Article{Ghani:2000:EDE,
author = "Nasir Ghani and Jon W. Mark",
title = "Enhanced distributed explicit rate allocation for
{ABR} services in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "71--86",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p71-ghani/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "available bit-rate services; feedback flow control;
max-min fairness; weighted fairness",
}
@Article{Kalyanaraman:2000:ESA,
author = "Shivkumar Kalyanaraman and Raj Jain and Sonia Fahmy
and Rohit Goyal and Bobby Vandalore",
title = "The {ERICA} switch algorithm for {ABR} traffic
management in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "87--98",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p87-kalyanaraman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM network; Internet",
}
@Article{Su:2000:SMM,
author = "Ching-Fong Su and Gustavo {De Veciana}",
title = "Statistical multiplexing and mix-dependent alternative
routing in multiservice {VP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "99--108",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p99-su/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "alternative routing; statistical multiplexing; traffic
mix; virtual path",
}
@Article{Byun:2000:USA,
author = "Sung Hyuk Byun and Dan Keun Sung",
title = "The {UniMIN} switch architecture for large-scale {ATM}
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "109--120",
month = feb,
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p109-byun/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM switch; distribution network; fair virtual FIFO;
general expansion architecture; UniMIN",
}
@Article{Padhye:2000:MTR,
author = "Jitendra Padhye and Victor Firoiu and Donald F.
Towsley and James F. Kurose",
title = "Modeling {TCP Reno} performance: a simple model and
its empirical validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "133--145",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Chen:2006:CMT}.",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p133-padhye/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "empirical validation; modeling; retransmission
timeouts; TCP",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf TCP/IP}; Computer Systems Organization
--- Performance of Systems (C.4): {\bf Modeling
techniques}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1)",
}
@Article{Spatscheck:2000:OTF,
author = "Oliver Spatscheck and J{\o}rgen S. Hansen and John H.
Hartman and Larry L. Peterson",
title = "Optimizing {TCP} forwarder performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "146--157",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p146-spatscheck/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "firewall; proxy; router; TCP",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf TCP/IP}; Computer Systems Organization
--- Performance of Systems (C.4): {\bf Performance
attributes}; Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Security and protection (e.g., firewalls)}",
}
@Article{Rizzo:2000:RPP,
author = "Luigi Rizzo and Lorenzo Vicisano",
title = "Replacement policies for a proxy cache",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "158--170",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p158-rizzo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "caching; communication networks; policies;
replacement; Web",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
communications}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Performance
attributes}",
}
@Article{Paschalidis:2000:CDP,
author = "Ioannis Ch. Paschalidis and John N. Tsitsiklis",
title = "Congestion-dependent pricing of network services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "171--184",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p171-paschalidis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic programming; Internet economics; loss
networks; revenue management",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Performance attributes}",
}
@Article{Stoica:2000:HFS,
author = "Ion Stoica and Hui Zhang and T. S. Eugene Ng",
title = "A hierarchical fair service curve algorithm for
link-sharing, real-time, and priority services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "185--199",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p185-stoica/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fairness; link-sharing; packet scheduling; quality of
service (QoS); real-time",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Performance attributes}",
}
@Article{Corner:2000:PSI,
author = "Mark D. Corner and J{\"o}rg Liebeherr and Nada Golmie
and Chatschik Bisdikian and David H. Su",
title = "A priority scheme for the {IEEE 802.14 MAC} protocol
for hybrid fiber-coax networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "200--211",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p200-corner/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "local area networks; quality-of-service",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Data communications}; Computer Systems
Organization --- Computer-Communication Networks ---
Local and Wide-Area Networks (C.2.5)",
}
@Article{Biswas:2000:DFB,
author = "Subir K. Biswas and Rauf Izmailov",
title = "Design of a fair bandwidth allocation policy for {VBR}
traffic in {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "212--212",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p212-biswas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access control; asynchronous transfer mode; resource
management; wireless LAN",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5); Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}",
}
@Article{Lacher:2000:PCC,
author = "Martin S. Lacher and J{\"o}rg Nonnenmacher and Ernst
W. Biersack",
title = "Performance comparison of centralized versus
distributed error recovery for reliable multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "224--224",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p224-lacher/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ARQ; error control; FEC; performance evaluation;
reliable multicast protocol",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Reliability, availability, and serviceability}; Theory
of Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Routing and layout}",
}
@Article{Reeves:2000:DAD,
author = "Douglas S. Reeves and Hussein F. Salama",
title = "A distributed algorithm for delay-constrained unicast
routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "239--250",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p239-reeves/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay constraints; distributed algorithms; quality of
service; routing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed applications}; Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Routing and layout}",
}
@Article{Grah:2000:PSL,
author = "Adrian Grah and Terence D. Todd",
title = "Packet-switched local area networks using
wavelength-selective station couplers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "251--264",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p251-grah/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
}
@Article{Berthaud:2000:TSN,
author = "Jean-Marc Berthaud",
title = "Time synchronization over networks using convex
closures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "2",
pages = "265--277",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-2/p265-berthaud/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "continuous estimation from discrete samplings;
distributed processing; error propagation; network time
synchronization",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Distributed Systems (C.2.4)",
}
@Article{Fan:2000:SCS,
author = "Li Fan and Pei Cao and Jussara Almeida and Andrei Z.
Broder",
title = "Summary cache: a scalable wide-area {Web} cache
sharing protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "281--293",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p281-fan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bloom filter; cache sharing; ICP; Web cache; Web
proxy",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Information Systems
--- Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf World Wide Web (WWW)};
Information Systems --- Information Storage and
Retrieval --- Systems and Software (H.3.4): {\bf
Performance evaluation (efficiency and effectiveness)};
Information Systems --- Information Storage and
Retrieval --- Online Information Services (H.3.5): {\bf
Data sharing}",
}
@Article{Kasera:2000:SRM,
author = "Sneha Kumar Kasera and G{\'\i}sli Hj{\'a}lmt{\'y}sson
and Donald F. Towsley and James F. Kurose",
title = "Scalable reliable multicast using multiple multicast
channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "294--310",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p294-kasera/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multicast channel; reliable multicast; retransmission
scoping",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Protocols (C.2.2): {\bf Routing protocols};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Path and circuit problems};
Mathematics of Computing --- Numerical Analysis ---
Optimization (G.1.6)",
}
@Article{Chen:2000:MPP,
author = "Shiwen Chen and Oktay G{\"u}nl{\"u}k and B{\"u}lent
Yener",
title = "The multicast packing problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "311--318",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p311-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "lower bounds; multicast congestion; multicast
optimization; multicast packing; multicasting",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Network problems}; Mathematics of
Computing --- Numerical Analysis --- Optimization
(G.1.6)",
}
@Article{Li:2000:ODM,
author = "Jie Li and Hisao Kameda and Keqin Li",
title = "Optimal dynamic mobility management for {PCS}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "319--327",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p319-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3): {\bf Network management}; Computer Systems
Organization --- Computer-Communication Networks ---
Distributed Systems (C.2.4): {\bf Network operating
systems}",
}
@Article{Acampora:2000:NAM,
author = "Anthony S. Acampora and Srikanth V. Krishnamurthy",
title = "A new adaptive {MAC} layer protocol for broadband
packet wireless networks in harsh fading and
interference environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "328--336",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p328-acampora/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "media access protocols; wireless",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5): {\bf Access schemes}; Computer
Systems Organization --- Computer-Communication
Networks --- Network Architecture and Design (C.2.1):
{\bf Packet-switching networks}",
}
@Article{Kim:2000:BAW,
author = "Jeong Geun Kim and Marwan M. Krunz",
title = "Bandwidth allocation in wireless networks with
guaranteed packet-loss performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "337--349",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p337-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "effective bandwidth; fluid analysis; QoS; wireless
networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf Wireless
communication}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Modeling
techniques}",
}
@Article{Su:2000:ERF,
author = "Ching-Fong Su and Gustavo {De Veciana} and Jean
Walrand",
title = "Explicit rate flow control for {ABR} services in {ATM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "350--361",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p350-su/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ABR service; ATM networks; delay differential
equations; explicit rate flow control",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Asynchronous Transfer Mode (ATM)}; Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Network problems}; Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Modeling techniques}",
}
@Article{Mayer:2000:LCD,
author = "Alain Mayer and Yoram Ofek and Moti Yung",
title = "Local and congestion-driven fairness algorithm in
arbitrary topology networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "362--372",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p362-mayer/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Distributed Systems (C.2.4): {\bf Network operating
systems}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Trees};
Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
topology}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}",
}
@Article{Low:2000:EBB,
author = "Steven H. Low",
title = "Equilibrium bandwidth and buffer allocations for
elastic traffics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "373--383",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p373-low/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth and buffer allocation; elastic traffic;
equilibrium allocation; equilibrium pricing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Packet-switching networks}; Information Systems ---
Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf Performance evaluation
(efficiency and effectiveness)}; Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}",
}
@Article{Crochat:2000:PIW,
author = "Olivier Crochat and Jean-Yves {Le Boudec} and Ornan
Gerstel",
title = "Protection interoperability for {WDM} optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "384--395",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p384-crochat/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "interoperability; optical network; protection;
routing; taboo search; WDM",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Path and circuit problems}",
}
@Article{Sikdar:2000:QAS,
author = "Biplab Sikdar and D. Manjunath",
title = "Queueing analysis of scheduling policies in copy
networks of space-based multicast packet switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "396--406",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p396-sikdar/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "copy networks; multicast switches; queueing analysis;
scheduling algorithms",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Packet-switching networks}",
}
@Article{Kannan:2000:MMM,
author = "Rajgopal Kannan and Sibabrata Ray",
title = "{MSXmin}: a modular multicast {ATM} packet switch with
low delay and hardware complexity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "407--418",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p407-kannan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous transfer mode; multistage interconnection
networks; routing; switching circuits",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Packet-switching networks}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Asynchronous Transfer Mode (ATM)}; Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Routing and layout}; Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Trees}",
}
@Article{Wong:2000:ARC,
author = "Eric W. M. Wong and Andy K. M. Chan and Tak-Shing
Peter Yum",
title = "Analysis of rerouting in circuit-switched networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "3",
pages = "419--427",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-3/p419-wong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "circuit-switched networks; dynamic routing; least
loaded routing; rerouting",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Circuit-switching networks}; Theory of Computation ---
Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Routing and layout}; Computing Methodologies ---
Simulation and Modeling --- Simulation Output Analysis
(I.6.6); Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Path and
circuit problems}",
}
@Article{Zhang:2000:VSP,
author = "Zhi-Li Zhang and Yuewei Wang and David H. C. Du and
Dongli Shu",
title = "Video staging: a proxy-server-based approach to
end-to-end video delivery over wide-area networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "429--442",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p429-zhang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "end-to-end video delivery; heterogeneous networking
environment; MPEG; proxy server; video smoothing; video
staging; video streaming",
subject = "Information Systems --- Information Interfaces and
Presentation --- Multimedia Information Systems
(H.5.1): {\bf Video (e.g., tape, disk, DVI)}; Computer
Systems Organization --- Computer System Implementation
--- Servers (C.5.5); Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4)",
}
@Article{Abdalla:2000:KMR,
author = "Michel Abdalla and Yuval Shavitt and Avishai Wool",
title = "Key management for restricted multicast using
broadcast encryption",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "443--454",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p443-abdalla/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Data --- Data Encryption (E.3); Information Systems
--- Information Systems Applications --- Communications
Applications (H.4.3): {\bf Internet}; Computing Milieux
--- Computers and Society --- Public Policy Issues
(K.4.1): {\bf Intellectual property rights}; Computing
Milieux --- Computers and Society --- Electronic
Commerce (K.4.4)",
}
@Article{Zegura:2000:ALA,
author = "Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei
and Samrat Bhattacharjee",
title = "Application-layer anycasting: a server selection
architecture and use in a replicated {Web} service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "455--466",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p455-zegura/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anycasting; replication; server selection",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Client/server}; Information Systems ---
Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf World Wide Web (WWW)}; Computer
Systems Organization --- Computer-Communication
Networks --- Network Protocols (C.2.2)",
}
@Article{Roughan:2000:RTE,
author = "Matthew Roughan and Darryl Veitch and Patrice Abry",
title = "Real-time estimation of the parameters of long-range
dependence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "467--478",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p467-roughan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "estimation; fractal; Hurst parameter; long-range
dependence; on-line; real-time; self-similar; traffic
modeling; wavelets",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3): {\bf Network management}; Mathematics of
Computing --- Numerical Analysis --- Approximation
(G.1.2): {\bf Wavelets and fractals}",
}
@Article{Baldi:2000:EED,
author = "Mario Baldi and Yoram Ofek",
title = "End-to-end delay analysis of videoconferencing over
packet-switched networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "479--492",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p479-baldi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "end-to-end delay; MPEG; performance guarantees;
quality of service; time-driven priority;
videoconference",
subject = "Information Systems --- Information Systems
Applications --- Communications Applications (H.4.3):
{\bf Videotex}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Data --- Coding and Information Theory
(E.4): {\bf Data compaction and compression}",
}
@Article{Iliadis:2000:OPC,
author = "Ilias Iliadis",
title = "Optimal {PNNI} complex node representations for
restrictive costs and minimal path computation time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "493--506",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p493-iliadis/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "complex node representation; PNNI; restrictive cost;
state aggregation",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Numerical
Algorithms and Problems (F.2.1): {\bf Computations on
matrices}",
}
@Article{Barcelo:2000:WCT,
author = "Jos{\'e} M. Barcel{\'o} and Jorge Garc{\'\i}a-Vidal
and Olga Casals",
title = "Worst-case traffic in a tree network of {ATM}
multiplexers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "507--516",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p507-barcelo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; Bene{\v{s}} method; periodic traffic; tree
networks; worst-case traffic",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Mathematics of Computing ---
Discrete Mathematics --- Graph Theory (G.2.2);
Mathematics of Computing --- Probability and Statistics
(G.3): {\bf Queueing theory}",
}
@Article{Chen:2000:ECS,
author = "Wen-Tsuen Chen and Chun-Fu Huang and Yi-Luang Chang
and Wu-Yuin Hwang",
title = "An efficient cell-scheduling algorithm for multicast
{ATM} switching systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "517--525",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p517-chen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous transfer mode; cell-scheduling algorithm;
head-of-line blocking problem; multicast",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Theory of Computation ---
Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}; Hardware --- Logic Design
--- Design Aids (B.6.3): {\bf Hardware description
languages}",
}
@Article{Kim:2000:PSR,
author = "Dongsoo S. Kim and Ding-Zhu Du",
title = "Performance of split routing algorithm for three-stage
multicast networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "526--534",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p526-kim/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multicast; performance evaluation; probabilistic
model; switching networks",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2): {\bf Routing and layout}; Mathematics
of Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Network problems}",
}
@Article{Hwang:2000:NMT,
author = "Frank K. Hwang and Sheng-Chyang Liaw",
title = "On nonblocking multicast three-stage {Clos} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "535--539",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p535-hwang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multicast traffic; strictly nonblocking; switching
networks; wide-sense nonblocking",
subject = "Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Network problems}; Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Routing and layout}",
}
@Article{Lakshman:2000:TIP,
author = "T. V. Lakshman and Upamanyu Madhow and Bernhard
Suter",
title = "{TCP\slash IP} performance with random loss and
bidirectional congestion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "541--555",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-5/p541-lakshman/p541-lakshman.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p541-lakshman/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Experimentation; Measurement;
Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ADSL; buffer management; cable modems; scheduling;
TCP",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf TCP/IP}; Computer Systems Organization
--- Computer-Communication Networks --- Internetworking
(C.2.6): {\bf Standards (e.g., TCP/IP)}; Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Sequencing and scheduling}; Computer
Systems Organization --- Performance of Systems (C.4):
{\bf Performance attributes}",
}
@Article{Mo:2000:FEE,
author = "Jeonghoon Mo and Jean Walrand",
title = "Fair end-to-end window-based congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "556--567",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p556-mo/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Management; Theory; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth sharing; congestion control; fairness; TCP;
window",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Computer Systems Organization ---
Computer-Communication Networks --- Internetworking
(C.2.6): {\bf Standards (e.g., TCP/IP)}; Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Sequencing and scheduling}; Computer
Systems Organization --- Performance of Systems (C.4)",
}
@Article{Krishnan:2000:CLP,
author = "P. Krishnan and Danny Raz and Yuval Shavitt",
title = "The cache location problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "568--582",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p568-krishnan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Performance; Reliability; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "location problem; mirror placement; transparent
cache",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3): {\bf Network management}; Computer Systems
Organization --- Computer-Communication Networks ---
Distributed Systems (C.2.4): {\bf Client/server};
Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5); Computer Systems Organization ---
Performance of Systems (C.4): {\bf Design studies};
Hardware --- Memory Structures --- Design Styles
(B.3.2): {\bf Cache memories}; Mathematics of Computing
--- Discrete Mathematics --- Graph Theory (G.2.2)",
}
@Article{Bambos:2000:CAA,
author = "Nicholas Bambos and Shou C. Chen and Gregory J.
Pottie",
title = "Channel access algorithms with active link protection
for wireless communication networks with power
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "583--597",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p583-bambos/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Experimentation; Measurement; Theory;
Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "admission control; multiple access; power control;
radio channel access; wireless networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3): {\bf Network management}; Computing
Methodologies --- Simulation and Modeling ---
Simulation Output Analysis (I.6.6)",
}
@Article{Banerjee:2000:WRO,
author = "Dhritiman Banerjee and Biswanath Mukherjee",
title = "Wavelength-routed optical networks: linear
formulation, resource budgeting tradeoffs, and a
reconfiguration study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "598--607",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p598-banerjee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Experimentation; Measurement; Performance;
Theory; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "integer linear program; lightpath; optical network;
optimization; reconfigurability; resource budgeting;
virtual topology; wavelength routing; WDM",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Circuit-switching
networks}; Mathematics of Computing --- Numerical
Analysis --- Optimization (G.1.6): {\bf Integer
programming}; Mathematics of Computing --- Numerical
Analysis --- Optimization (G.1.6): {\bf Linear
programming}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}",
}
@Article{Zhang:2000:ECA,
author = "Xijun Zhang and Chunming Qiao",
title = "An effective and comprehensive approach for traffic
grooming and wavelength assignment in {SONET\slash WDM}
rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "608--617",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p608-zhang/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Experimentation; Measurement;
Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ADMs; SONET; traffic grooming; wavelength assignment;
WDM rings",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Operations (C.2.3): {\bf Network management};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2)",
}
@Article{Gerstel:2000:CET,
author = "Ornan Gerstel and Rajiv Ramaswami and Galen H.
Sasaki",
title = "Cost-effective traffic grooming in {WDM} rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "618--630",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p618-gerstel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Experimentation; Measurement;
Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "electronic traffic grooming; nonblocking networks;
optical networks; wavelength division multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Operations (C.2.3): {\bf Network management};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2)",
}
@Article{Jue:2000:MMP,
author = "Jason P. Jue and Biswanath Mukherjee",
title = "Multiconfiguration multihop protocols: a new class of
protocols for packet-switched {WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "631--642",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p631-jue/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Experimentation; Measurement; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multiconfiguration; multihop; optical network; packet
switching; passive-star coupler; single-hop;
wavelength-division multiplexing",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Network
problems}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}",
}
@Article{Berger:2000:DBE,
author = "Arthur W. Berger and Yaakov Kogan",
title = "Dimensioning bandwidth for elastic traffic in
high-speed data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "643--654",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p643-berger/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Experimentation; Measurement; Theory; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic approximation; asynchronous transfer mode;
closed queueing networks; computer network performance;
effective bandwidths; Internet; traffic engineering;
transmission control protocol",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3); Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Computer Systems Organization ---
Computer-Communication Networks --- Internetworking
(C.2.6): {\bf Standards (e.g., TCP/IP)}",
}
@Article{Biswas:2000:CSE,
author = "Subir K. Biswas and Rauf Izmailov and Bhaskar
Sengupta",
title = "Connection splitting: an efficient way of reducing
call blocking in {ATM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "655--666",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p655-biswas/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access control; asynchronous transfer mode;
communication system routing; resource management;
scheduling",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}; Theory of Computation ---
Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Routing and layout}; Mathematics of Computing ---
Discrete Mathematics --- Graph Theory (G.2.2): {\bf
Network problems}",
}
@Article{Yaiche:2000:GTF,
author = "Ha{\"\i}kel Ya{\"\i}che and Ravi R. Mazumdar and
Catherine Rosenberg",
title = "A game theoretic framework for bandwidth allocation
and pricing in broadband networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "667--678",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p667-yaiche/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Theory; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth allocation; elastic traffic; game theory;
Nash bargaining solution; pricing",
subject = "Computing Methodologies --- Simulation and Modeling
--- Types of Simulation (I.6.8): {\bf Gaming}; Computer
Systems Organization --- Computer-Communication
Networks --- Network Operations (C.2.3); Mathematics of
Computing --- Numerical Analysis --- Optimization
(G.1.6)",
}
@Article{Cheung:2000:DMR,
author = "Chi-Chung Cheung and Danny H. K. Tsang and Sanjay
Gupta",
title = "Dynamic multicast routing based on mean number of new
calls accepted before blocking for single rate loss
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "5",
pages = "679--688",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-5/p679-cheung/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Experimentation; Measurement;
Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic routing; multicast routing; single rate loss
networks",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2): {\bf Routing and layout}; Mathematics
of Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Network problems}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1)",
}
@Article{LeBoudec:2000:OSG,
author = "Jean-Yves {Le Boudec} and Olivier Verscheure",
title = "Optimal smoothing for guaranteed service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "689--696",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p689-le\_boudec/p689-le\_boudec.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p689-le\_boudec/;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p689-le_boudec/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network calculus; playback delay; video transmission",
}
@Article{Hu:2000:PST,
author = "Rose Qingyang Hu and David W. Petr",
title = "A predictive self-tuning fuzzy-logic feedback rate
controller",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "697--709",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p697-hu/p697-hu.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p697-hu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "adaptive control; asynchronous transfer mode; computer
network performance; feedback systems; fuzzy control;
predictive control; traffic control",
}
@Article{Frey:2000:GBF,
author = "Michael Frey and Son Nguyen-Quang",
title = "A gamma-based framework for modeling variable-rate
{MPEG} video sources: the {GOP} {GBAR} model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "710--719",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p710-frey/p710-frey.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p710-frey/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "buffer overflow loss; frame size model; group of
pictures; MPEG video; video traffic modeling",
}
@Article{Vickers:2000:SAM,
author = "Brett J. Vickers and C{\'e}lio Albuquerque and Tatsuya
Suda",
title = "Source-adaptive multilayered multicast algorithms for
real-time video distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "720--733",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p720-vickers/p720-vickers.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p720-vickers/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; feedback control; multilayered
video",
}
@Article{Narvaez:2000:NDA,
author = "Paolo Narv{\'a}ez and Kai-Yeung Siu and Hong-Yi
Tzeng",
title = "New dynamic algorithms for shortest path tree
computation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "734--746",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p734-narvaez/p734-narvaez.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p734-narvaez/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "routing; shortest path trees",
subject = "Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}; Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Graph algorithms}",
}
@Article{Zhu:2000:PDA,
author = "Yuhong Zhu and George N. Rouskas and Harry G. Perros",
title = "A path decomposition approach for computing blocking
probabilities in wavelength-routing networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "747--762",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p747-zhu/p747-zhu.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p747-zhu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "call-blocking probability; converter placement;
decomposition algorithms; wavelength-division
multiplexing; wavelength-routing networks",
}
@Article{Noel:2000:PMM,
author = "Eric Noel and K. Wendy Tang",
title = "Performance modeling of multihop network subject to
uniform and nonuniform geometric traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "763--774",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p763-noel/p763-noel.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p763-noel/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "deflection routing; multihop networks; performance
modeling; store-and-forward routing",
}
@Article{Cohen:2000:CVP,
author = "Reuven Cohen and Gideon Kaempfer",
title = "On the cost of virtual private networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "775--784",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p775-cohen/p775-cohen.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p775-cohen/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cali:2000:DTI,
author = "Frederico Cal{\`\i} and Marco Conti and Enrico
Gregori",
title = "Dynamic tuning of the {IEEE} 802.11 protocol to
achieve a theoretical throughput limit",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "785--799",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p785-cal/p785-cal.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p785-cal/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multiple access protocol (MAC); performance analysis;
protocol capacity; wireless LAN (WLAN)",
}
@Article{Ivanovich:2000:SDM,
author = "Milosh Ivanovich and Moshe Zukerman and Fraser
Cameron",
title = "A study of deadlock models for a multiservice medium
access protocol employing a {Slotted} {Aloha}
signalling channel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "6",
pages = "800--811",
year = "2000",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2000-8-6/p800-ivanovich/p800-ivanovich.pdf;
http://www.acm.org/pubs/citations/journals/ton/2000-8-6/p800-ivanovich/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "",
}
@Article{deVeciana:2001:SPA,
author = "Gustavo {De Veciana} and Takis Konstantopoulos and
Tae-Jin Lee",
title = "Stability and performance analysis of networks
supporting elastic services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "2--14",
year = "2001",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.909020",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p2-de\_veciana/p2-de\_veciana.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p2-de\_veciana/;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p2-de_veciana/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Management; Performance; Reliability",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ABR service; bandwidth allocation; Lyapunov functions;
performance analysis; proportional fairness; rate
control; stability; TCP/IP; weighted max-min fairness",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
}
@Article{Abraham:2001:NAA,
author = "Santosh Paul Abraham and Anurag Kumar",
title = "A new approach for asynchronous distributed rate
control of elastic sessions in integrated packet
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "15--30",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p15-abraham/p15-abraham.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p15-abraham/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ABR switch algorithms; effective service capacity;
explicit rate-based congestion control; stochastic
approximation",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Protocols (C.2.2); Computer Systems
Organization --- Computer-Communication Networks ---
Local and Wide-Area Networks (C.2.5)",
}
@Article{Yeom:2001:MTB,
author = "Ikjun Yeom and A. L. Narasimha Reddy",
title = "Modeling {TCP} behavior in a differentiated services
network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "31--46",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p31-yeom/p31-yeom.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p31-yeom/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Management",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "AF PHB; differentiated service; TCP modeling",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
}
@Article{Chich:2001:UDR,
author = "Thierry Chich and Pierre Fraigniaud and Johanne
Cohen",
title = "Unslotted deflection routing: a practical and
efficient protocol for multihop optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "47--59",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p47-chich/p47-chich.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p47-chich/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical networks; deflection routing; slotted
versus unslotted networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Theory of Computation
--- Computation by Abstract Devices --- Models of
Computation (F.1.1); Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5)",
xxauthor = "Thierry Chich and Johanne Cohen and Pierre
Fraigniaud",
xxtitle = "Unslotted deflection routing: a practical protocol for
multihop optical networks",
}
@Article{Li:2001:WAP,
author = "Guangzhi Li and Rahul Simha",
title = "On the wavelength assignment problem in multifiber
{WDM} star and ring networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "60--68",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p60-li/p60-li.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p60-li/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical networks; wavelength routing and assignment;
WDM optical networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Local and Wide-Area Networks (C.2.5)",
}
@Article{Shad:2001:DSA,
author = "Faisal Shad and Terence D. Todd and Vytas Kezys and
John Litva",
title = "Dynamic slot allocation {(DSA)} in indoor {SDMA\slash
TDMA} using smart antenna basestation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "69--81",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p69-shad/p69-shad.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p69-shad/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computing
Methodologies --- Artificial Intelligence --- Problem
Solving, Control Methods, and Search (I.2.8): {\bf
Heuristic methods}",
}
@Article{Awerbuch:2001:TAD,
author = "Baruch Awerbuch and Yuval Shavitt",
title = "Topology aggregation for directed graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "82--90",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p82-awerbuch/p82-awerbuch.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p82-awerbuch/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous transfer mode; communication system
routing; directed graphs; graph theory; PNNI; topology;
wide-area networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5); Software --- Operating Systems ---
Communications Management (D.4.4)",
}
@Article{Gerla:2001:RBS,
author = "Mario Gerla and Emilio Leonardi and Fabio Neri and
Prasasth Palnati",
title = "Routing in the bidirectional shufflenet",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "91--103",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p91-gerla/p91-gerla.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p91-gerla/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "deadlock avoidance; shufflenet; wormhole routing",
}
@Article{Leonardi:2001:SIQ,
author = "Emilio Leonardi and Marco Mellia and Fabio Neri and
Marco Ajmone Marsan",
title = "On the stability of input-queued switches with
speed-up",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "1",
pages = "104--118",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-1/p104-leonardi/p104-leonardi.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-1/p104-leonardi/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "input buffered switches; Lyapunov methods; scheduling
algorithm; stability",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Local and Wide-Area Networks (C.2.5)",
}
@Article{Chan:2001:DSA,
author = "S.-H Gary Chan and Fouad Tobagi",
title = "Distributed servers architecture for networked video
services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "125--136",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p125-chan/p125-chan.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p125-chan/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Measurement; Performance; Reliability",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "architecture; caching schemes; distributed servers;
network channels and local storage; tradeoff; unicast
and multicast; video-on-command",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Client/server}; Information Systems ---
Information Interfaces and Presentation --- Multimedia
Information Systems (H.5.1): {\bf Video (e.g., tape,
disk, DVI)}",
}
@Article{Ekici:2001:DRA,
author = "Eylem Ekici and Ian F. Akyildiz and Michael D.
Bender",
title = "A distributed routing algorithm for datagram traffic
in {LEO} satellite networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "137--147",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p137-ekici/p137-ekici.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p137-ekici/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "connectionless/datagram routing; low earth orbit
(LEO); satellite networks",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf Routing protocols}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf Wireless
communication}; Computer Applications --- Physical
Sciences and Engineering (J.2): {\bf Aerospace}; Theory
of Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2): {\bf Routing and layout}",
}
@Article{Krishnamurthy:2001:PBM,
author = "Srikanth V. Krishnamurthy and Anthony S. Acampora and
Michele Zorzi",
title = "Polling-based media access protocols for use with
smart adaptive array antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "148--161",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p148-krishnamurthy/p148-krishnamurthy.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p148-krishnamurthy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Measurement; Performance;
Reliability; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "antenna; arrays; media; polling; protocols",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Wireless
communication}; Hardware --- Input/Output and Data
Communications --- Data Communications Devices (B.4.1);
Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2)",
}
@Article{Shaikh:2001:EIS,
author = "Anees Shaikh and Jennifer Rexford and Kang G. Shin",
title = "Evaluating the impact of stale link state on
quality-of-service routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "162--176",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p162-shaikh/p162-shaikh.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p162-shaikh/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Management; Measurement; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "explicit routing; link-state; modeling;
quality-of-service; signaling; source-directed
routing",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2): {\bf Routing and layout}; Computer
Systems Organization --- Computer-Communication
Networks --- Network Protocols (C.2.2); Computer
Systems Organization --- Computer-Communication
Networks --- Network Architecture and Design (C.2.1):
{\bf Packet-switching networks}; Computer Systems
Organization --- Computer-Communication Networks ---
Network Architecture and Design (C.2.1): {\bf
Asynchronous Transfer Mode (ATM)}; Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Reliability, availability, and serviceability}",
}
@Article{Iida:2001:DAC,
author = "Katsuyoshi Iida and Tetsuya Takine and Hideki Sunahara
and Yuji Oie",
title = "Delay analysis for {CBR} traffic under static-priority
scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "177--185",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p177-iida/p177-iida.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p177-iida/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access networks; constant bit rate; delay analysis;
G.723.1; static priority scheduling",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2)",
}
@Article{Krishnaswamy:2001:DLT,
author = "Rajesh M. Krishnaswamy and Kumar N. Sivarajan",
title = "Design of logical topologies: a linear formulation for
wavelength-routed optical networks with no wavelength
changers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "186--198",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p186-krishnaswamy/p186-krishnaswamy.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p186-krishnaswamy/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Design; Performance; Reliability; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical networks; linear program; network
planning; topology design",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
topology}; Computer Systems Organization ---
Computer-Communication Networks --- Network Operations
(C.2.3); Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Routing and
layout}",
}
@Article{Qiu:2001:MBA,
author = "Jingyu Qiu and Edward W. Knightly",
title = "Measurement-based admission control with aggregate
traffic envelopes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "199--210",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p199-qiu/p199-qiu.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p199-qiu/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Measurement; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "admission control; quality of service; real-time
flows; traffic envelopes",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Computer Systems
Organization --- Computer-Communication Networks ---
Network Operations (C.2.3); Computer Systems
Organization --- Computer-Communication Networks ---
Distributed Systems (C.2.4); Theory of Computation ---
Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2): {\bf
Sequencing and scheduling}",
}
@Article{Valaee:2001:REW,
author = "Shahrokh Valaee",
title = "A recursive estimator of worst-case burstiness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "2",
pages = "211--222",
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jul 26 07:58:06 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "http://www.acm.org/pubs/articles/journals/ton/2001-9-2/p211-valaee/p211-valaee.pdf;
http://www.acm.org/pubs/citations/journals/ton/2001-9-2/p211-valaee/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
generalterms = "Algorithms; Design; Measurement; Performance; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ATM; burstiness curve; deterministic source modeling;
leaky bucket; reflection mapping; regulator",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Asynchronous
Transfer Mode (ATM)}",
}
@Article{Savage:2001:NSI,
author = "Stefan Savage and David Wetherall and Anna Karlin and
Tom Anderson",
title = "Network support for {IP} traceback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "226--237",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barford:2001:CPA,
author = "Paul Barford and Mark Crovella",
title = "Critical path analysis of {TCP} transactions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "238--248",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Christiansen:2001:TRW,
author = "Mikkel Christiansen and Kevin Jeffay and David Ott and
F. Donelson Smith",
title = "Tuning {RED} for {Web} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "249--264",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Feldmann:2001:DTD,
author = "Anja Feldmann and Albert Greenberg and Carsten Lund
and Nick Reingold and Jennifer Rexford and Fred True",
title = "Deriving traffic demands for operational {IP}
networks: methodology and experience",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "265--280",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffield:2001:TSD,
author = "N. G. Duffield and Matthias Grossglauser",
title = "Trajectory sampling for direct traffic observation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "280--292",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Labovitz:2001:DIR,
author = "Craig Labovitz and Abha Ahuja and Abhijit Bose and
Farnam Jahanian",
title = "Delayed {Internet} routing convergence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "293--306",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akyildiz:2001:TPN,
author = "Ian F. Akyildiz and Giacomo Morabito and Sergio
Palazzo",
title = "{TCP-Peach}: a new congestion control scheme for
satellite {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "307--321",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chong:2001:SSS,
author = "Song Chong and Sangho Lee and Sungho Kang",
title = "A simple, scalable, and stable explicit rate
allocation algorithm for {MAX-MIN} flow control with
minimum rate guarantee",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "322--335",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wong:2001:SCP,
author = "Vincent W. S. Wong and Mark E. Lewis and Victor C. M.
Leung",
title = "Stochastic control of path optimization for
inter-switch handoffs in wireless {ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "336--350",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Siwko:2001:CAC,
author = "J. Siwko and I. Rubin",
title = "Connection admission control for capacity-varying
networks with stochastic capacity change times",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "351--360",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2001:PBU,
author = "Hairong Sun and Xinyu Zang and Kishor S. Trivedi",
title = "Performance of broadcast and unknown server {(BUS)} in
{ATM LAN} emulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "361--372",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pronk:2001:CCR,
author = "Verus Pronk and Jan Korst",
title = "Comments on {``Carry-over Round Robin: A Simple Cell
Scheduling Mechanism for ATM networks''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "3",
pages = "373--373",
month = jun,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 25 17:57:23 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Saha:1998:CRR}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shakkottai:2001:TPE,
author = "Sanjay Shakkottai and Anurag Kumar and Aditya Karnik
and Ajit Anvekar",
title = "{TCP} performance over end-to-end rate control and
stochastic available capacity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "377--391",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Floyd:2001:DSI,
author = "Sally Floyd and Vern Paxson",
title = "Difficulties in simulating the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "392--403",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rodriguez:2001:AWC,
author = "Pablo Rodriguez and Christian Spanner and Ernst W.
Biersack",
title = "Analysis of {Web} caching architectures: hierarchical
and distributed caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "404--418",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akyildiz:2001:AFS,
author = "Ian F. Akyildiz and Inwhee Joe and Henry Driver and
Yung-Lung Ho",
title = "An adaptive {FEC} scheme for data traffic in wireless
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "419--426",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Haas:2001:PQC,
author = "Zygmunt J. Haas and Marc R. Pearlman",
title = "The performance of query control schemes for the zone
routing protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "427--438",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sharon:2001:EPM,
author = "Oran Sharon and Eitan Altman",
title = "An efficient polling {MAC} for wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "439--451",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2001:NSU,
author = "Zhi-Ren Chang and I-Chung Lee and Cheng-Shang Chang
and Chien-Hsin Li and Ben-Li Sui",
title = "A novel scheme using the information of departure
processes for delay guarantees of distributed {VBR}
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "452--463",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Legout:2001:BAP,
author = "Arnaud Legout and J{\"o}rg Nonnenmacher and Ernst W.
Biersack",
title = "Bandwidth-allocation policies for unicast and
multicast flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "464--478",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhatnagar:2001:OSF,
author = "Shalabh Bhatnagar and Michael C. Fu and Steven I.
Marcus and Pedram J. Fard",
title = "Optimal structured feedback policies for {ABR} flow
control using two-timescale {SPSA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "479--491",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mansour:2001:JCQ,
author = "Yishay Mansour and Boaz Patt-Shamir",
title = "Jitter control in {QoS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "492--502",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lang:2001:AOA,
author = "Jonathan P. Lang and Vishal Sharma and Emmanouel A.
Varvarigos",
title = "An analysis of oblivious and adaptive routing in
optical networks with wavelength translation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "503--517",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2001:EPC,
author = "Xiaojun Shen and Fan Yang and Yi Pan",
title = "Equivalent permutation capabilities between
time-division optical omega networks and non-optical
extra-stage omega networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "4",
pages = "518--524",
month = aug,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Francis:2001:IGI,
author = "Paul Francis and Sugih Jamin and Cheng Jin and Yixin
Jin and Danny Raz and Yuval Shavitt and Lixia Zhang",
title = "{IDMaps}: a global {Internet} host distance estimation
service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "525--540",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bonuccelli:2001:SRT,
author = "Maurizio A. Bonuccelli and M. Claudia Cl{\`o}",
title = "Scheduling of real-time messages in optical
broadcast-and-select networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "541--552",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mohan:2001:EAR,
author = "G. Mohan and C. Siva Ram Murthy and Arun K. Somani",
title = "Efficient algorithms for routing dependable
connections in {WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "553--566",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Banerjee:2001:PEQ,
author = "Ayan Banerjee and Ronald A. Iltis and Emmanouel A.
Varvarigos",
title = "Performance evaluation for a quasi-synchronous packet
radio network {(QSPNET)}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "567--577",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2001:JBD,
author = "Qiong Li and David L. Mills",
title = "Jitter-based delay-boundary prediction of wide-area
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "578--590",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bensaou:2001:CBF,
author = "Brahim Bensaou and Danny H. K. Tsang and King Tung
Chan",
title = "Credit-based fair queueing {(CBFQ)}: a simple
service-scheduling algorithm for packet-switched
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "591--604",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tabatabaee:2001:QPT,
author = "Vahid Tabatabaee and Leonidas Georgiadis and Leandros
Tassiulas",
title = "{QoS} provisioning and tracking fluid policies in
input queueing switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "605--617",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Beard:2001:PRA,
author = "Cory C. Beard and Victor S. Frost",
title = "Prioritized resource allocation for stressed
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "618--633",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2001:MHN,
author = "Sheng Ma and Chuanyi Ji",
title = "Modeling heterogeneous network traffic in wavelet
domain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "634--649",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Katevenis:2001:WIC,
author = "Manolis G. H. Katevenis and Iakovos Mavroidis and
Georgios Sapountzis and Eva Kalyvianaki and Ioannis
Mavroidis and Georgios Glykopoulos",
title = "Wormhole {IP} over (connectionless) {ATM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "650--661",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tham:2001:UAF,
author = "Yiu Kwok Tham",
title = "A unified algorithmic framework for variable-rate
{TDM} switching assignments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "662--668",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Thomopoulos:2001:LAT,
author = "Efstratios Thomopoulos and Louise E. Moser and Peter
M. Melliar-Smith",
title = "Latency analysis of the totem single-ring protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "5",
pages = "669--680",
month = oct,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:29 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2001:SIR,
author = "Lixin Gao and Jennifer Rexford",
title = "Stable {Internet} routing without global
coordination",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "681--692",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Afek:2001:RC,
author = "Yehuda Afek and Anat Bremler-Barr and Sariel
Har-Peled",
title = "Routing with a clue",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "693--705",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Narvaez:2001:NDS,
author = "Paolo Narv{\'a}ez and Kai-Yeung Siu and Hong-Yi
Tzeng",
title = "New dynamic {SPT} algorithm based on a ball-and-string
model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "706--718",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{VanMieghem:2001:EM,
author = "Piet {Van Mieghem} and Gerard Hooghiemstra and Remco
van der Hofstad",
title = "On the efficiency of multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "719--732",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2001:IAS,
author = "Lixin Gao",
title = "On inferring autonomous system relationships in the
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "733--745",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Su:2001:JTS,
author = "Weilian Su and Ian F. Akyildiz",
title = "The jitter time-stamp approach for clock recovery of
real-time variable bit-rate traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "746--754",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2001:LPC,
author = "Han S. Kim and Ness B. Shroff",
title = "Loss probability calculations and asymptotic analysis
for finite buffer multiplexers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "755--768",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rummukainen:2001:PCA,
author = "Hannu Rummukainen and Jorma Virtamo",
title = "Polynomial cost approximations in {Markov} decision
theory based call admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "769--779",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pillai:2001:DOC,
author = "R. Radhakrishna Pillai",
title = "A distributed overload control algorithm for
delay-bounded call setup",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "780--789",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2001:DAC,
author = "Mingbo Xiao and Ness B. Shroff and Edwin K. P. Chong",
title = "Distributed admission control for power-controlled
cellular wireless systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "790--800",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leung:2001:APD,
author = "Matthew K. H. Leung and John C. S. Lui and David K. Y.
Yau",
title = "Adaptive proportional delay differentiated services:
characterization and performance evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "801--817",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Johari:2001:EEC,
author = "Ramesh Johari and David Kim Hong Tan",
title = "End-to-end congestion control for the {Internet}:
delays and stability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "818--832",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Begole:2001:RSR,
author = "James Begole and Randall B. Smith and Craig A. Struble
and Clifford A. Shaffer",
title = "Resource sharing for replicated synchronous
groupware",
journal = j-IEEE-TRANS-NETWORKING,
volume = "9",
number = "6",
pages = "833--843",
month = dec,
year = "2001",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 11 08:34:30 MDT 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ammar:2002:E,
author = "Mostafa H. Ammar",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "1--1",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nahum:2002:PIW,
author = "Erich Nahum and Tsipora Barzilai and Dilip D.
Kandlur",
title = "Performance issues in {WWW} servers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "2--11",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dovrolis:2002:PDS,
author = "Constantinos Dovrolis and Dimitrios Stiliadis and
Parameswaran Ramanathan",
title = "Proportional differentiated services: delay
differentiation and packet scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "12--26",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Reisslein:2002:FGS,
author = "Martin Reisslein and Keith W. Ross and Srinivas
Rajagopal",
title = "A framework for guaranteeing statistical {QoS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "27--42",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cobb:2002:PQS,
author = "Jorge Arturo Cobb",
title = "Preserving quality of service guarantees in spite of
flow aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "43--53",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2002:QAM,
author = "Shuqian Yan and Michalis Faloutsos and Anindo
Banerjea",
title = "{QoS-aware} multicast routing for the {Internet}: the
design and evaluation of {QoSMIC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "54--66",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2002:SFC,
author = "Xi Zhang and Kang G. Shin and Debanjan Saha and Dilip
D. Kandlur",
title = "Scalable flow control for multicast {ABR} services in
{ATM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "67--85",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gau:2002:MFC,
author = "Rung-Hung Gau and Zygmunt J. Haas and Bhaskar
Krishnamachari",
title = "On multicast flow control for heterogeneous
receivers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "86--101",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lorenz:2002:OPQ,
author = "Dean H. Lorenz and Ariel Orda",
title = "Optimal partition of {QoS} requirements on unicast
paths and multicast trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "102--114",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Meddeb:2002:IPM,
author = "Aref Meddeb and Andr{\'e} Girard and Catherine
Rosenberg",
title = "The impact of point-to-multipoint traffic
concentration on multirate networks design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "115--124",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mao:2002:LPA,
author = "Guoqiang Mao and Daryoush Habibi",
title = "Loss performance analysis for heterogeneous {{\sc
ON-OFF}} sources with application to connection
admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "125--138",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Varadarajan:2002:ESP,
author = "Srivatsan Varadarajan and Hung Q. Ngo and Jaideep
Srivastava",
title = "Error spreading: a perception-driven approach to
handling error in continuous media streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "139--152",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Medard:2002:GLB,
author = "Muriel M{\'e}dard and Richard A. Barry and Steven G.
Finn and Wenbo He and Steven S. Lumetta",
title = "Generalized loop-back recovery in optical mesh
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "1",
pages = "153--164",
month = feb,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rubenstein:2002:IML,
author = "Dan Rubenstein and Jim Kurose and Don Towsley",
title = "The impact of multicast layering on network fairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "169--182",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ekici:2002:MRA,
author = "Eylem Ekici and Ian F. Akyildiz and Michael D.
Bender",
title = "A multicast routing algorithm for {LEO} satellite {IP}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "183--192",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Smith:2002:FSV,
author = "Mark A. Smith and K. K. Ramakrishnan",
title = "Formal specification and verification of safety and
performance of {TCP} selective acknowledgment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "193--207",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2002:IPG,
author = "Xi-Ren Cao and Hong-Xia Shen and Rodolfo Milito and
Patrica Wirth",
title = "{Internet} pricing with a game theoretical approach:
concepts and examples",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "208--216",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Courcoubetis:2002:TES,
author = "Costas A. Courcoubetis and Antonis Dimakis and George
D. Stamoulis",
title = "Traffic equivalence and substitution in a multiplexer
with applications to dynamic available capacity
estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "217--231",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Griffin:2002:SPP,
author = "Timothy G. Griffin and F. Bruce Shepherd and Gordon
Wilfong",
title = "The stable paths problem and interdomain routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "232--243",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2002:HAM,
author = "Xin Yuan",
title = "Heuristic algorithms for multiconstrained
quality-of-service routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "244--256",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2002:DCA,
author = "Si Wu and K. Y. Michael Wong and Bo Li",
title = "A dynamic call admission policy with precision {QoS}
guarantee using stochastic control for mobile wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "257--271",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{La:2002:UBR,
author = "Richard J. La and Venkat Anantharam",
title = "Utility-based rate control in the {Internet} for
elastic traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "272--286",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Smiljanic:2002:FBA,
author = "Aleksandra Smiljani{\'c}",
title = "Flexible bandwidth allocation in high-capacity packet
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "2",
pages = "287--293",
month = apr,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:01 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raman:2002:IIT,
author = "Suchitra Raman and Hari Balakrishnan and Murari
Srinivasan",
title = "{ITP}: an {Image Transport Protocol} for the
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "297--307",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gouda:2002:HIC,
author = "Mohamed G. Gouda and E. N. (Mootaz) Elnozahy and
Chin-Tser Huang and Tommy M. McGuire",
title = "Hop integrity in computer networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "308--319",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Massoulie:2002:BSO,
author = "Laurent Massouli{\'e} and James Roberts",
title = "Bandwidth sharing: objectives and algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "320--328",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{LeBoudec:2002:SPV,
author = "Jean-Yves {Le Boudec}",
title = "Some properties of variable length packet shapers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "329--337",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kalampoukas:2002:EWA,
author = "Lampros Kalampoukas and Anujan Varma and K. K.
Ramakrishnan",
title = "Explicit window adaptation: a method to enhance {TCP}
performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "338--350",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramamurthy:2002:FAR,
author = "Ramu Ramamurthy and Biswanath Mukherjee",
title = "Fixed-alternate routing and wavelength conversion in
wavelength-routed optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "351--367",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hahne:2002:DQL,
author = "Ellen L. Hahne and Abhijit K. Choudhury",
title = "Dynamic queue length thresholds for multiple loss
priorities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "368--380",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rubenstein:2002:DSC,
author = "Dan Rubenstein and Jim Kurose and Don Towsley",
title = "Detecting shared congestion of flows via end-to-end
measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "381--395",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramjee:2002:HDB,
author = "Ramachandran Ramjee and Kannan Varadhan and Luca
Salgarelli and Sandra R. Thuel and Shie-Yuan Wang and
Thomas {La Porta}",
title = "{HAWAII}: a domain-based approach for supporting
mobility in wide-area wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "396--410",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akyildiz:2002:MNR,
author = "Ian F. Akyildiz and Eylem Ekici and Michael D.
Bender",
title = "{MLSR}: a novel routing algorithm for multilayered
satellite {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "411--424",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paschalidis:2002:PML,
author = "Ioannis Ch. Paschalidis and Yong Liu",
title = "Pricing in multiservice loss networks: static pricing,
asymptotic optimality, and demand substitution
effects",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "3",
pages = "425--438",
month = jun,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Psounis:2002:ERW,
author = "Konstantinos Psounis and Balaji Prabhakar",
title = "Efficient randomized web-cache replacement schemes
using samples from past eviction times",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "441--455",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rodriguez:2002:DPA,
author = "Pablo Rodriguez and Ernst W. Biersack",
title = "Dynamic parallel access to replicated content in the
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "455--465",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Brassil:2002:SIM,
author = "Jack Brassil and Henning Schulzrinne",
title = "Structuring {Internet} media streams with cueing
protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "466--476",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Grossglauser:2002:MIC,
author = "Matthias Grossglauser and David N. C. Tse",
title = "Mobility increases the capacity of ad hoc wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "477--486",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Uysal-Biyikoglu:2002:EEP,
author = "Elif Uysal-Biyikoglu and Balaji Prabhakar and Abbas
{El Gamal}",
title = "Energy-efficient packet transmission over a wireless
link",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "487--499",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chaintreau:2002:ITL,
author = "Augustin Chaintreau and Fran{\c{c}}ois Baccelli and
Christophe Diot",
title = "Impact of {TCP}-like congestion control on the
throughput of multicast groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "500--512",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Feng:2002:BAQ,
author = "Wu-chang Feng and Kang G. Shin and Dilip D. Kandlur
and Debanjan Saha",
title = "The {{\sc BLUE}} active queue management algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "513--528",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bennett:2002:DJB,
author = "Jon C. R. Bennett and Kent Benson and Anna Charny and
William F. Courtney and Jean-Yves {Le Boudec}",
title = "Delay jitter bounds and packet scale rate guarantee
for expedited forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "529--540",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sobrinho:2002:AAQ,
author = "Jo{\~a}o Lu{\'\i}s Sobrinho",
title = "Algebra and algorithms for {QoS} path computation and
hop-by-hop routing in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "541--550",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Libman:2002:ORT,
author = "Lavy Libman and Ariel Orda",
title = "Optimal retrial and timeout strategies for accessing
network resources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "551--564",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kumar:2002:APV,
author = "Amit Kumar and Rajeev Rastogi and Avi Silberschatz and
Bulent Yener",
title = "Algorithms for provisioning virtual private networks
in the hose model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "565--578",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{dHalluin:2002:MCT,
author = "Yann d'Halluin and Peter A. Forsyth and Kenneth R.
Vetzal",
title = "Managing capacity for telecommunications networks
under uncertainty",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "4",
pages = "579--587",
month = aug,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:02 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jung:2002:DPE,
author = "Jaeyeon Jung and Emil Sit and Hari Balakrishnan and
Robert Morris",
title = "{DNS} performance and the effectiveness of caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "589--603",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mitzenmacher:2002:CBF,
author = "Michael Mitzenmacher",
title = "Compressed bloom filters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "604--612",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guerin:2002:CSP,
author = "Roch Gu{\'e}rin and Ariel Orda",
title = "Computing shortest paths for any number of hops",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "613--620",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Libeskind-Hadas:2002:MRW,
author = "Ran Libeskind-Hadas and Rami Melhem",
title = "Multicast routing and wavelength assignment in
multihop optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "621--629",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Antoniou:2002:EDC,
author = "Zoe Antoniou and Ioannis Stavrakakis",
title = "An efficient deadline-credit-based transport scheme
for prerecorded semisoft continuous media
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "630--643",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Blanchini:2002:RRC,
author = "Franco Blanchini and Renato {Lo Cigno} and Roberto
Tempo",
title = "Robust rate control for integrated services packet
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "644--652",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mneimneh:2002:SUP,
author = "Saad Mneimneh and Vishal Sharma and Kai-Yeung Siu",
title = "Switching using parallel input-output queued switches
with no speedup",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "653--665",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marsan:2002:PMS,
author = "Marco Ajmone Marsan and Andrea Bianco and Paolo
Giaccone and Emilio Leonardi and Fabio Neri",
title = "Packet-mode scheduling in input-queued cell-based
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "666--678",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffield:2002:RMH,
author = "N. G. Duffield and Pawan Goyal and Albert Greenberg
and Partho Mishra and K. K. Ramakrishnan and Jacobus E.
van der Merwe",
title = "Resource management with hoses: point-to-cloud
services for virtual private networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "679--692",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2002:SDA,
author = "Young Lee and James M. Tien",
title = "Static and dynamic approaches to modeling end-to-end
routing in circuit-switched networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "5",
pages = "693--705",
month = oct,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:03 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shannon:2002:BFO,
author = "Colleen Shannon and David Moore and K. C. Claffy",
title = "Beyond folklore: observations on fragmented traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "709--720",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Snoeren:2002:SPI,
author = "Alex C. Snoeren and Craig Partridge and Luis A.
Sanchez and Christine E. Jones and Fabrice Tchakountio
and Beverly Schwartz and Stephen T. Kent and W. Timothy
Strayer",
title = "Single-packet {IP} traceback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "721--734",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Markatos:2002:WCS,
author = "Evangelos P. Markatos and Dionisios N. Pnevmatikatos
and Michail D. Flouris and Manolis G. H. Katevenis",
title = "{Web}-conscious storage management for {Web} proxies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "735--748",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2002:EHR,
author = "Yigal Bejerano and Israel Cidon and Joseph (Seffi)
Naor",
title = "Efficient handoff rerouting algorithms: a competitive
on-line algorithmic approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "749--760",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{LoPresti:2002:MBI,
author = "Francesco {Lo Presti} and N. G. Duffield and Joe
Horowitz and Don Towsley",
title = "Multicast-based inference of network-internal delay
distributions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "761--775",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2002:CMS,
author = "Chengzhi Li and Edward W. Knightly",
title = "Coordinated multihop scheduling: a framework for
end-to-end services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "776--789",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nelakuditi:2002:APR,
author = "Srihari Nelakuditi and Zhi Li Zhang and Rose P. Tsang
and David H. C. Du",
title = "Adaptive proportional routing: a localized {QoS}
routing approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "790--804",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2002:MST,
author = "Cheng Shang Chang and Rene L. Cruz and Jean Yves {Le
Boudec} and Patrick Thiran",
title = "A min,+ system theory for constrained traffic
regulation and dynamic service guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "805--817",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Georgiadis:2002:LOB,
author = "Leonidas Georgiadis and Panos Georgatsos and
Konstantinos Floros and Stelios Sartzetakis",
title = "Lexicographically optimal balanced networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "818--829",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oki:2002:CRR,
author = "Eiji Oki and Zhigang Jing and Roberto Rojas-Cessa and
H. Jonathan Chao",
title = "Concurrent round-robin-based dispatching schemes for
{Clos}-network switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "10",
number = "6",
pages = "830--844",
month = dec,
year = "2002",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ammar:2003:E,
author = "Mostafa Ammar",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "1--1",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Intanagonwiwat:2003:DDW,
author = "Chalermek Intanagonwiwat and Ramesh Govindan and
Deborah Estrin and John Heidemann and Fabio Silva",
title = "Directed diffusion for wireless sensor networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "2--16",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stoica:2003:CSP,
author = "Ion Stoica and Robert Morris and David Liben-Nowell
and David R. Karger and M. Frans Kaashoek and Frank
Dabek and Hari Balakrishnan",
title = "{Chord}: a scalable peer-to-peer lookup protocol for
{Internet} applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "17--32",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stoica:2003:CSF,
author = "Ion Stoica and Scott Shenker and Hui Zhang",
title = "{{\em Core\/}}-stateless fair queueing: a scalable
architecture to approximate fair bandwidth allocations
in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "33--46",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lombardo:2003:PEA,
author = "Alfio Lombardo and Giovanni Schembra",
title = "Performance evaluation of an adaptive-rate {MPEG}
encoder matching intserv traffic constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "47--65",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keon:2003:OPM,
author = "Neil J. Keon and G. Anandalingam",
title = "Optimal pricing for multiple services in
telecommunications networks offering quality-of-service
guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "66--80",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gummadi:2003:EPS,
author = "Krishna Phani Gummadi and Madhavarapu Jnana Pradeep
and C. Siva Ram Murthy",
title = "An efficient primary-segmented backup scheme for
dependable real-time communication in multihop
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "81--94",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2003:ECA,
author = "Jiafu He and Khosrow Sohraby",
title = "An extended combinatorial analysis framework for
discrete-time queueing systems with general sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "95--110",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Srinivasan:2003:AFE,
author = "R. Srinivasan and Arun K. Somani",
title = "On achieving fairness and efficiency in high-speed
shared medium access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "111--124",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2003:MSR,
author = "Qing Zhao and Lang Tong",
title = "A multiqueue service room {MAC} protocol for wireless
networks with multipacket reception",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "125--137",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neely:2003:PAR,
author = "Michael J. Neely and Eytan Modiano and Charles E.
Rohrs",
title = "Power allocation and routing in multibeam satellites
with time-varying channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "138--152",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chalmers:2003:TMT,
author = "Robert C. Chalmers and Kevin C. Almeroth",
title = "On the topology of multicast trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "153--165",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Auerbach:2003:MGM,
author = "Joshua Auerbach and Madan Gopal and Marc Kaplan and
Shay Kutten",
title = "Multicast group membership management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "1",
pages = "166--175",
month = feb,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:04 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rastogi:2003:OCO,
author = "Rajeev Rastogi and Yuri Breitbart and Minos
Garofalakis and Amit Kumar",
title = "Optimal configuration of {OSPF} aggregates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "181--194",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mahanti:2003:SDM,
author = "Anirban Mahanti and Derek L. Eager and Mary K. Vernon
and David J. Sundaram-Stukel",
title = "Scalable on-demand media streaming with packet loss
recovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "195--209",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2003:UBP,
author = "Mingbo Xiao and Ness B. Shroff and Edwin K. P. Chong",
title = "A utility-based power-control scheme in wireless
cellular systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "210--221",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eun:2003:MAA,
author = "Do Young Eun and Ness B. Shroff",
title = "A measurement-analytic approach for {QoS} estimation
in a network based on the dominant time scale",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "222--235",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gencata:2003:VTA,
author = "Ayseg{\"u}l Gen{\c{c}}ata and Biswanath Mukherjee",
title = "Virtual-topology adaptation for {WDM} mesh networks
under dynamic traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "236--247",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zang:2003:PPR,
author = "Hui Zang and Canhui Ou and Biswanath Mukherjee",
title = "Path-protection routing and wavelength assignment
({RWA}) in {WDM} mesh networks under duct-layer
constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "248--258",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ozdaglar:2003:RWA,
author = "Asuman E. Ozdaglar and Dimitri P. Bertsekas",
title = "Routing and wavelength assignment in optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "259--272",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2003:RSH,
author = "Kayi Lee and Kai-Yeung Siu",
title = "On the reconfigurability of single-hub {WDM} ring
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "273--284",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2003:NGG,
author = "Hongyue Zhu and Hui Zang and Keyao Zhu and Biswanath
Mukherjee",
title = "A novel generic graph model for traffic grooming in
heterogeneous {WDM} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "285--299",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dahlin:2003:EEW,
author = "Michael Dahlin and Bharat Baddepudi V. Chandra and Lei
Gao and Amol Nayate",
title = "End-to-end {WAN} service availability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "300--313",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Iyer:2003:APP,
author = "Sundar Iyer and Nick W. McKeown",
title = "Analysis of the parallel packet switch architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "314--324",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chan:2003:SPG,
author = "Man Chi Chan and Tony T. Lee",
title = "Statistical performance guarantees in large-scale
cross-path packet switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "325--337",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karbowski:2003:CSF,
author = "Andrzej Karbowski",
title = "Comments on {``Optimization flow control, I: Basic
algorithm and convergence''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "2",
pages = "338--339",
month = apr,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Aug 7 14:11:05 MDT 2003",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Low:1999:OFC}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2003:STF,
author = "Shudong Jin and Liang Guo and Ibrahim Matta and Azer
Bestavros",
title = "A spectrum of {TCP}-friendly window-based congestion
control algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "341--355",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Martin:2003:DBC,
author = "Jim Martin and Arne Nilsson and Injong Rhee",
title = "Delay-based congestion avoidance for {TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "356--369",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Anjum:2003:CSV,
author = "Farooq Anjum and Leandros Tassiulas",
title = "Comparative study of various {TCP} versions over a
wireless link with correlated losses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "370--383",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Korkmaz:2003:BDC,
author = "Turgay Korkmaz and Marwan Krunz",
title = "Bandwidth-delay constrained path selection under
inaccurate state information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "384--398",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2003:DRR,
author = "Murali Kodialam and T. V. Lakshman",
title = "Dynamic routing of restorable bandwidth-guaranteed
tunnels using aggregated network resource usage
information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "399--410",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Lau:2008:CDR}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Starobinski:2003:ANC,
author = "David Starobinski and Mark Karpovsky and Lev A.
Zakrevski",
title = "Application of network calculus to general topologies
using turn-prohibition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "411--421",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2003:SMR,
author = "Huirong Fu and Edward W. Knightly",
title = "A simple model of real-time flow aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "422--435",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2003:DAF,
author = "Xi Zhang and Kang G. Shin",
title = "Delay analysis of feedback-synchronization signaling
for multicast flow control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "436--450",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baldi:2003:CRT,
author = "Mario Baldi and Yoram Ofek",
title = "A comparison of ring and tree embedding for real-time
group multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "451--464",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marsan:2003:MTI,
author = "Marco Ajmone Marsan and Andrea Bianco and Paolo
Giaccone and Emilio Leonardi and Fabio Neri",
title = "Multicast traffic in input-queued switches: optimal
scheduling and maximum throughput",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "465--477",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2003:PAM,
author = "Hakyong Kim and Kiseon Kim",
title = "Performance analysis of the multiple input-queued
packet switch with the restricted rule",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "478--487",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2003:OEA,
author = "Alvin C. Fu and Eytan Modiano and John N. Tsitsiklis",
title = "Optimal energy allocation and admission control for
communications satellites",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "488--500",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fumagalli:2003:ODS,
author = "Andrea Fumagalli and Isabella Cerutti and Marco
Tacca",
title = "Optimal design of survivable mesh networks based on
line switched {WDM} self-healing rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "3",
pages = "501--512",
month = jun,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zegura:2003:Ea,
author = "Ellen W. Zegura",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "513--513",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Siganos:2003:PLL,
author = "Georgos Siganos and Michalis Faloutsos and Petros
Faloutsos and Christos Faloutsos",
title = "Power laws and the {AS}-level {Internet} topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "514--524",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Low:2003:DMT,
author = "Steven H. Low",
title = "A duality model of {TCP} and queue management
algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "525--536",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jain:2003:EEA,
author = "Manish Jain and Constantinos Dovrolis",
title = "End-to-end available bandwidth: measurement
methodology, dynamics, and relation with {TCP}
throughput",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "537--549",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Grossglauser:2003:TSD,
author = "Matthias Grossglauser and David N. C. Tse",
title = "A time-scale decomposition approach to
measurement-based admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "550--563",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Loguinov:2003:EER,
author = "Dmitri Loguinov and Hayder Radha",
title = "End-to-end rate-based congestion control: convergence
properties and scalability analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "564--577",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Orda:2003:PSQ,
author = "Ariel Orda and Alexander Sprintson",
title = "Precomputation schemes for {QoS} routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "578--591",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chaskar:2003:FST,
author = "Hemant M. Chaskar and Upamanyu Madhow",
title = "Fair scheduling with tunable latency: a round-robin
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "592--601",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Daigle:2003:APN,
author = "John N. Daigle and Marcos Nascimento Magalh{\~a}es",
title = "Analysis of packet networks having contention-based
reservation with application to {GPRS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "602--615",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rojas-Cessa:2003:CFD,
author = "Roberto Rojas-Cessa and Eiji Oki and H. Jonathan
Chao",
title = "Concurrent fault detection for a multiple-plane packet
switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "616--627",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sichitiu:2003:EUT,
author = "Mihail L. Sichitiu and Peter H. Bauer and Kamal
Premaratne",
title = "The effect of uncertain time-variant delays in {ATM}
networks with explicit rate feedback: a control
theoretic approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "628--637",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarkar:2003:MFL,
author = "Uttam K. Sarkar and Subramanian Ramakrishnan and Dilip
Sarkar",
title = "Modeling full-length video using {Markov}-modulated
{Gamma}-based framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "638--649",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sahni:2003:ECM,
author = "Sartaj Sahni and Kun Suk Kim",
title = "Efficient construction of multibit tries for {IP}
lookup",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "650--662",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gouda:2003:MRM,
author = "Mohamed G. Gouda and Marco Schneider",
title = "Maximizable routing metrics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "663--675",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2003:OMR,
author = "Murali Kodialam and T. V. Lakshman and Sudipta
Sengupta",
title = "Online multicast routing with bandwidth guarantees: a
new approach using multicast network flow",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "4",
pages = "676--686",
month = aug,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:07 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kunniyur:2003:EEC,
author = "Srisankar Kunniyur and R. Srikant",
title = "End-to-end congestion control schemes: utility
functions, random losses and {ECN} marks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "689--702",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cen:2003:EED,
author = "Song Cen and Pamela C. Cosman and Geoffrey M.
Voelker",
title = "End-to-end differentiation of congestion and wireless
losses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "703--717",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2003:PDB,
author = "Ben Liang and Zygmunt J. Haas",
title = "Predictive distance-based mobility management for
multidimensional {PCS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "718--732",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marbach:2003:PSM,
author = "Peter Marbach",
title = "Priority service and max-min fairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "733--746",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Markopoulou:2003:AQV,
author = "Athina P. Markopoulou and Fouad A. Tobagi and Mansour
J. Karam",
title = "Assessing the quality of voice communications over
{Internet} backbones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "747--760",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2003:EDR,
author = "Guangzhi Li and Dongmei Wang and Charles Kalmanek and
Robert Doverspike",
title = "Efficient distributed restoration path selection for
shared mesh restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "761--771",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kar:2003:RRB,
author = "Koushik Kar and Murali Kodialam and T. V. Lakshman",
title = "Routing restorable bandwidth guaranteed connections
using maximum $2$-route flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "772--781",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koetter:2003:AAN,
author = "Ralf Koetter and Muriel M{\'e}dard",
title = "An algebraic approach to network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "782--795",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fecko:2003:TGF,
author = "Mariusz A. Fecko and M. {\"U}mit Uyar and Ali Y. Duale
and Paul D. Amer",
title = "A technique to generate feasible tests for
communications systems with multiple timers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "796--809",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{LeBoudec:2003:PSR,
author = "Jean-Yves {Le Boudec} and Anna Charny",
title = "Packet scale rate guarantee for non-{FIFO} nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "810--820",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borst:2003:GPS,
author = "Sem Borst and Michel Mandjes and Miranda van Uitert",
title = "Generalized processor sharing with light-tailed and
heavy-tailed input",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "821--834",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Towles:2003:GSS,
author = "Brian Towles and William J. Dally",
title = "Guaranteed scheduling for switches with configuration
overhead",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "835--847",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Andrews:2003:ASN,
author = "Matthew Andrews and Lisa Zhang",
title = "Achieving stability in networks of input-queued
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "848--857",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mneimneh:2003:ATI,
author = "Saad Mneimneh and Kai-Yeung Siu",
title = "On achieving throughput in an input-queued switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "5",
pages = "858--867",
month = oct,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 3 17:35:08 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zegura:2003:Eb,
author = "Ellen Zegura",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "869--869",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duan:2003:SON,
author = "Zhenhai Duan and Zhi-Li Zhang and Yiwei Thomas Hou",
title = "Service overlay networks: {SLAs}, {QoS}, and bandwidth
provisioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "870--883",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2003:PAT,
author = "Lixin Gao and Zhi-Li Zhang and Don Towsley",
title = "Proxy-assisted techniques for delivering continuous
multimedia streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "884--894",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhattacharyya:2003:ERC,
author = "Supratik Bhattacharyya and James F. Kurose and Don
Towsley and Ramesh Nagarajan",
title = "Efficient rate-controlled bulk data transfer using
multiple multicast groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "895--907",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2003:PDS,
author = "X. Brian Zhang and Simon S. Lam and Dong-Young Lee and
Y. Richard Yang",
title = "Protocol design for scalable and reliable group
rekeying",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "908--922",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karol:2003:PDL,
author = "Mark Karol and S. Jamaloddin Golestani and David Lee",
title = "Prevention of deadlocks and livelocks in lossless
backpressured packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "923--934",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nayak:2003:DON,
author = "Tapan Kumar Nayak and Kumar N. Sivarajan",
title = "Dimensioning optical networks under traffic growth
models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "935--947",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Heyman:2003:MMI,
author = "Daniel P. Heyman and David Lucantoni",
title = "Modeling multiple {IP} traffic streams with rate
limits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "948--958",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sikdar:2003:AML,
author = "Biplab Sikdar and Shivkumar Kalyanaraman and Kenneth
S. Vastola",
title = "Analytic models for the latency and steady-state
throughput of {TCP Tahoe}, {Reno}, and {SACK}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "959--971",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shakkottai:2003:BTC,
author = "Sanjay Shakkottai and R. Srikant and Sean P. Meyn",
title = "Bounds on the throughput of congestion controllers in
the presence of feedback delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "972--981",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2003:BBC,
author = "Xiaohong Jiang and Hong Shen and Md. Mamun-ur-Rashid
Khandker and Susumu Horiguchi",
title = "Blocking behaviors of crosstalk-free optical {Banyan}
networks on vertical stacking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "982--993",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kong:2003:NSS,
author = "Peng-Yong Kong and Kee-Chaing Chua and Brahim
Bensaou",
title = "A novel scheduling scheme to share dropping ratio
while guaranteeing a delay bound in a {multiCode-CDMA}
network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "11",
number = "6",
pages = "994--1006",
month = dec,
year = "2003",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jan 28 17:11:35 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zegura:2004:E,
author = "Ellen Zegura",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "1--1",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Spring:2004:MIT,
author = "Neil Spring and Ratul Mahajan and David Wetherall and
Thomas Anderson",
title = "Measuring {ISP} topologies with rocketfuel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "2--16",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lui:2004:RTA,
author = "King-Shan Lui and Klara Nahrstedt and Shigang Chen",
title = "Routing with topology aggregation in delay-bandwidth
sensitive networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "17--29",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zappala:2004:APR,
author = "Daniel Zappala",
title = "Alternate path routing for multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "30--43",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Helmy:2004:SMB,
author = "Ahmed Helmy and Sandeep Gupta and Deborah Estrin",
title = "The {STRESS} method for boundary-point performance
analysis of end-to-end multicast timer-suppression
mechanisms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "44--58",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jukan:2004:PSM,
author = "Admela Jukan and Gerald Franzl",
title = "Path selection methods with multiple constraints in
service-guaranteed {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "59--72",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ho:2004:RSC,
author = "Pin-Han Ho and Hussein T. Mouftah",
title = "Reconfiguration of spare capacity for {MPLS}-based
recovery in the {Internet} backbone networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "73--84",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gambiroza:2004:DAI,
author = "Violeta Gambiroza and Ping Yuan and Laura Balzano and
Yonghe Liu and Steve Sheafor and Edward Knightly",
title = "Design, analysis, and implementation of {DVSR}: a fair
high-performance protocol for packet rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "85--102",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2004:WBT,
author = "Xudong Wang",
title = "Wide-band {TD-CDMA MAC} with minimum-power allocation
and rate- and {BER}-scheduling for wireless multimedia
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "103--116",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gau:2004:CSM,
author = "Rung-Hung Gau and Zygmunt J. Haas",
title = "Concurrent search of mobile users in cellular
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "117--130",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2004:MPE,
author = "Wei Li and Xiuli Chao",
title = "Modeling and performance evaluation of a cellular
mobile network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "131--145",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mao:2004:DDA,
author = "Zuji Mao and Christos Douligeris",
title = "A distributed database architecture for global roaming
in next-generation mobile networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "146--160",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2004:PFC,
author = "Dongyu Qiu and Ness B. Shroff",
title = "A predictive flow control scheme for efficient network
utilization and {QoS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "161--172",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Albuquerque:2004:NBP,
author = "C{\'e}lio Albuquerque and Brett J. Vickers and Tatsuya
Suda",
title = "Network border patrol: preventing congestion collapse
and promoting fairness in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "173--186",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2004:PAH,
author = "Ben-Jye Chang and Ren-Hung Hwang",
title = "Performance analysis for hierarchical multirate loss
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "1",
pages = "187--199",
month = feb,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stoica:2004:III,
author = "Ion Stoica and Daniel Adkins and Shelley Zhuang and
Scott Shenker and Sonesh Surana",
title = "{Internet} indirection infrastructure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "205--218",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sen:2004:APP,
author = "Subhabrata Sen and Jia Wang",
title = "Analyzing peer-to-peer traffic across large networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "219--232",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Challenger:2004:ESD,
author = "James R. Challenger and Paul Dantzig and Arun Iyengar
and Mark S. Squillante and Li Zhang",
title = "Efficiently serving dynamic data at highly accessed
{Web} sites",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "233--246",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lety:2004:SSC,
author = "Emmanuel L{\'e}ty and Thierry Turletti and
Fran{\c{c}}ois Baccelli",
title = "{SCORE}: a scalable communication protocol for
large-scale virtual environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "247--260",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Watson:2004:PSN,
author = "David Watson and Matthew Smart and G. Robert Malan and
Farnam Jahanian",
title = "Protocol scrubbing: network security through
transparent flow modification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "261--273",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deb:2004:CCF,
author = "Supratim Deb and R. Srikant",
title = "Congestion control for fair resource allocation in
networks with multicast flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "274--285",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kunniyur:2004:AVQ,
author = "Srisankar S. Kunniyur and R. Srikant",
title = "An adaptive virtual queue ({AVQ}) algorithm for active
queue management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "286--299",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garetto:2004:CQN,
author = "Michele Garetto and Renato {Lo Cigno} and Michela Meo
and Marco Ajmone Marsan",
title = "Closed queueing network models of interacting
long-lived {TCP} flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "300--311",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marbach:2004:ASP,
author = "Peter Marbach",
title = "Analysis of a static pricing scheme for priority
services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "312--325",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2004:PAD,
author = "Shengquan Wang and Dong Xuan and Riccardo Bettati and
Wei Zhao",
title = "Providing absolute differentiated services for
real-time applications in static-priority scheduling
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "326--339",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Charikar:2004:ROQ,
author = "Moses Charikar and Joseph Naor and Baruch Schieber",
title = "Resource optimization in {QoS} multicast routing of
real-time multimedia",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "340--348",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2004:EBN,
author = "Shanchieh Jay Yang and Gustavo {De Veciana}",
title = "Enhancing both network and user performance for
networks supporting best effort traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "349--360",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2004:FPA,
author = "Mingyan Liu and John S. Baras",
title = "Fixed point approximation for multirate multihop loss
networks with state-dependent routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "361--374",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hartline:2004:OVT,
author = "Jeff R. K. Hartline and Ran Libeskind-Hadas and Kurt
M. Dresner and Ethan W. Drucker and Katrina J. Ray",
title = "Optimal virtual topologies for one-to-many
communication in {WDM} paths and rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "375--383",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sridharan:2004:BAO,
author = "Ashwin Sridharan and Kumar N. Sivarajan",
title = "Blocking in all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "2",
pages = "384--397",
month = apr,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Breitbart:2004:TDH,
author = "Yuri Breitbart and Minos Garofalakis and Ben Jai and
Cliff Martin and Rajeev Rastogi and Avi Silberschatz",
title = "Topology discovery in heterogeneous {IP} networks: the
{{\em NetInventory\/}} system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "401--414",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lagoa:2004:ACA,
author = "Constantino M. Lagoa and Hao Che and Bernardo A.
Movsichoff",
title = "Adaptive control algorithms for decentralized optimal
traffic engineering in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "415--428",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liao:2004:DCP,
author = "Raymond R.-F. Liao and Andrew T. Campbell",
title = "Dynamic core provisioning for quantitative
differentiated services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "429--442",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lombardo:2004:NAF,
author = "Alfio Lombardo and Giacomo Morabito and Giovanni
Schembra",
title = "A novel analytical framework compounding statistical
traffic modeling and aggregate-level service curve
disciplines: network performance and efficiency
implications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "443--455",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Papadopoulos:2004:LWM,
author = "Christos Papadopoulos and Guru Parulkar and George
Varghese",
title = "Light-weight multicast services ({LMS}): a
router-assisted scheme for reliable multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "456--468",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Radoslavov:2004:CAL,
author = "Pavlin Radoslavov and Christos Papadopoulos and Ramesh
Govindan and Deborah Estrin",
title = "A comparison of application-level and router-assisted
hierarchical schemes for reliable multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "469--482",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raz:2004:DCE,
author = "Danny Raz and Yuval Shavitt and Lixia Zhang",
title = "Distributed council election",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "483--492",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2004:MAC,
author = "Wei Ye and John Heidemann and Deborah Estrin",
title = "Medium access control with coordinated adaptive
sleeping for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "493--506",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wan:2004:MPM,
author = "Peng-Jun Wan and Gruia C{\~a}linescu and Chih-Wei Yi",
title = "Minimum-power multicast routing in static ad hoc
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "507--514",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2004:SSA,
author = "Feng Xie and Joseph L. Hammond and Daniel L.
Noneaker",
title = "Steady-state analysis of a split-connection scheme for
{Internet} access through a wireless terminal",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "515--525",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qin:2004:MCC,
author = "Xiangdong Qin and Yuanyuan Yang",
title = "Multicast connection capacity of {WDM} switching
networks with limited wavelength conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "526--538",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chow:2004:FOL,
author = "Timothy Y. Chow and Fabian Chudak and Anthony M.
Ffrench",
title = "Fast optical layer mesh protection using
pre-cross-connected trails",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "539--548",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2004:DBM,
author = "C. Y. Li and P. K. A. Wai and Victor O. K. Li",
title = "The decomposition of a blocking model for
connection-oriented networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "549--558",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tseng:2004:SCT,
author = "Yu-Chee Tseng and Yu-Chi Chueh and Jang-Ping Sheu",
title = "Seamless channel transition for the staircase video
broadcasting scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "559--571",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2004:CDW,
author = "Yongtao Gong and Peiyuan Lee and Wanyi Gu",
title = "Comments on {``Dynamic wavelength routing using
congestion and neighborhood information''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "3",
pages = "572--572",
month = jun,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 10 09:53:35 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Li:1999:DWR}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gurbani:2004:TTS,
author = "Vijay K. Gurbani and Xian-He Sun",
title = "Terminating telephony services on the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "571--581",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jamjoom:2004:RCB,
author = "Hani Jamjoom and Padmanabhan Pillai and Kang G. Shin",
title = "Resynchronization and controllability of bursty
service requests",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "582--594",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Samar:2004:IZR,
author = "Prince Samar and Marc R. Pearlman and Zygmunt J.
Haas",
title = "Independent zone routing: an adaptive hybrid routing
framework for ad hoc wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "595--608",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2004:MLR,
author = "Jae-Hwan Chang and Leandros Tassiulas",
title = "Maximum lifetime routing in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "609--619",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vlajic:2004:PAD,
author = "Natalija Vlajic and Charalambos D. Charalambous and
Dimitrios Makrakis",
title = "Performance aspects of data broadcast in wireless
networks with user retrials",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "620--633",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akan:2004:AAR,
author = "{\"O}zg{\"u}r B. Akan and Ian F. Akyildiz",
title = "{ARC}: the analytical rate control scheme for
real-time traffic in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "634--644",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tham:2004:SSS,
author = "Yiu Kwok Tham",
title = "Scheduling satellite-switched time-division multiple
access with general switching modes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "645--652",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2004:SMK,
author = "Yan Sun and Wade Trappe and K. J. Ray Liu",
title = "A scalable multicast key management scheme for
heterogeneous wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "653--666",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2004:MCM,
author = "Xi Zhang and Kang G. Shin",
title = "{Markov}-chain modeling for multicast signaling delay
analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "667--680",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lenzini:2004:TBL,
author = "Luciano Lenzini and Enzo Mingozzi and Giovanni Stea",
title = "Tradeoffs between low complexity, low latency, and
fairness with deficit round-robin schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "681--693",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2004:UCT,
author = "Ao Tang and Jiantao Wang and Steven H. Low",
title = "Understanding {CHOKe}: throughput and spatial
characteristics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "694--707",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2004:MEP,
author = "Zhili Zhao and Swaroop Darbha and A. L. Narasimha
Reddy",
title = "A method for estimating the proportion of
nonresponsive traffic at a router",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "708--718",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aweya:2004:DSA,
author = "James Aweya and Michel Ouellette and Delfin Y.
Montuno",
title = "Design and stability analysis of a rate control
algorithm using the {Routh--Hurwitz} stability
criterion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "719--732",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{deOliveira:2004:NPP,
author = "Jaudelice C. de Oliveira and Caterina Scoglio and Ian
F. Akyildiz and George Uhl",
title = "New preemption policies for {DiffServ}-aware traffic
engineering to minimize rerouting in {MPLS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "733--745",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Levy:2004:DAR,
author = "Hanoch Levy and Tsippy Mendelson and Gilad Goren",
title = "Dynamic allocation of resources to virtual path
agents",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "746--758",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Andrew:2004:FSW,
author = "Lachlan L. H. Andrew",
title = "Fast simulation of wavelength continuous {WDM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "4",
pages = "759--765",
month = aug,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:57 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Byers:2004:ICD,
author = "John W. Byers and Jeffrey Considine and Michael
Mitzenmacher and Stanislav Rost",
title = "Informed content delivery across adaptive overlay
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "767--780",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cherkasova:2004:AEM,
author = "Ludmila Cherkasova and Minaxi Gupta",
title = "Analysis of enterprise media server workloads: access
patterns, locality, content evolution, and rates of
change",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "781--794",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarac:2004:TSM,
author = "Kamil Sarac and Kevin C. Almeroth",
title = "{Tracetree}: a scalable mechanism to discover
multicast tree topologies in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "795--808",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Steinder:2004:PFL,
author = "Ma{\l}gorzata Steinder and Adarshpal S. Sethi",
title = "Probabilistic fault localization in communication
systems using belief networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "809--822",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hao:2004:ISI,
author = "Ruibing Hao and David Lee and Rakesh K. Sinha and
Nancy Griffeth",
title = "Integrated system interoperability testing with
applications to {VoIP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "823--836",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Varsamopoulos:2004:DAR,
author = "Georgios Varsamopoulos and Sandeep K. S. Gupta",
title = "Dynamically adapting registration areas to user
mobility and call patterns for efficient location
management in {PCS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "837--850",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{VanMieghem:2004:CEQ,
author = "Piet {Van Mieghem} and Fernando A. Kuipers",
title = "Concepts of exact {QoS} routing algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "851--864",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Panagakis:2004:OCA,
author = "Antonis Panagakis and Nandita Dukkipati and Ioannis
Stavrakakis and Joy Kuri",
title = "Optimal call admission control on a single link with a
{GPS} scheduler",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "865--878",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Znati:2004:NDA,
author = "Taieb F. Znati and Rami Melhem",
title = "Node delay assignment strategies to support end-to-end
delay requirements in heterogeneous networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "879--892",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cavendish:2004:CTA,
author = "Dirceu Cavendish and Mario Gerla and Saverio Mascolo",
title = "A control theoretical approach to congestion control
in packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "893--906",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paschalidis:2004:ISE,
author = "Ioannis Ch. Paschalidis and Spyridon Vassilaras",
title = "Importance sampling for the estimation of buffer
overflow probabilities via trace-driven simulations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "907--919",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bouillet:2004:DCS,
author = "Eric Bouillet and Jean-Fran{\c{c}}ois Labourdette",
title = "Distributed computation of shared backup path in mesh
optical networks using probabilistic methods",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "920--930",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramasubramanian:2004:AON,
author = "Srinivasan Ramasubramanian and Arun K. Somani",
title = "Analysis of optical networks with heterogeneous
grooming architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "931--943",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Somani:2004:TWF,
author = "Arun K. Somani and Mani Mina and Ling Li",
title = "On trading wavelengths with fibers: a cost-performance
based study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "944--951",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2004:BST,
author = "Cheng-Shang Chang and Zhen Liu",
title = "A bandwidth sharing theory for a large number of
{HTTP}-like connections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "5",
pages = "952--962",
month = oct,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 1 19:04:58 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dovrolis:2004:PDT,
author = "Constantinos Dovrolis and Parameswaran Ramanathan and
David Moore",
title = "Packet-dispersion techniques and a capacity-estimation
methodology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "963--977",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffield:2004:NTM,
author = "N. G. Duffield and Francesco {Lo Presti}",
title = "Network tomography from measured end-to-end delay
covariance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "978--992",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shavitt:2004:BBS,
author = "Yuval Shavitt and Tomer Tankel",
title = "Big-bang simulation for embedding network distances in
{Euclidean} space",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "993--1006",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rabinovich:2004:DEC,
author = "Michael Rabinovich and Hua Wang",
title = "{DHTTP}: an efficient and cache-friendly transfer
protocol for the {Web}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1007--1020",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akyildiz:2004:PUM,
author = "Ian F. Akyildiz and Wenye Wang",
title = "The predictive user mobility profile framework for
wireless multimedia networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1021--1035",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2004:HSS,
author = "Hsiao-Hwa Chen and Wee-Teck Tea",
title = "Hierarchy schedule-sensing protocol for {CDMA}
wireless data-centric networks with multiple packet
collision and capture effect",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1036--1048",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2004:UUR,
author = "Haiyun Luo and Jiejun Kong and Petros Zerfos and
Songwu Lu and Lixia Zhang",
title = "{URSA}: ubiquitous and robust access control for
mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1049--1063",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2004:EIM,
author = "Yigal Bejerano",
title = "Efficient integration of multihop wireless and wired
networks with {QoS} constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1064--1078",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ranjan:2004:NIT,
author = "Priya Ranjan and Eyad H. Abed and Richard J. La",
title = "Nonlinear instabilities in {TCP-RED}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1079--1092",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jordan:2004:VOB,
author = "Scott Jordan and Kalpana Jogi and Chunlin Shi and
Ikhlaq Sidhu",
title = "The variation of optimal bandwidth and buffer
allocation with the number of sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1093--1104",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ho:2004:SSP,
author = "Pin-Han Ho and J{\'a}nos Tapolcai and Tibor Cinkler",
title = "Segment shared protection in mesh communications
networks with bandwidth guaranteed tunnels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1105--1118",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments \cite{Luo:2007:CSS}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Choi:2004:LRD,
author = "Hongsik Choi and Suresh Subramaniam and Hyeong-Ah
Choi",
title = "Loopback recovery from double-link failures in optical
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1119--1130",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marsan:2004:UIP,
author = "Marco Ajmone Marsan and Mirko Franceschinis and Emilio
Leonardi and Fabio Neri and Alessandro Tarello",
title = "Underload instabilities in packet networks with flow
schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1131--1143",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2004:STC,
author = "Chuanxiong Guo",
title = "{SRR}: an {$ O(1) $} time-complexity packet scheduler
for flows in multiservice packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1144--1155",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{delAngel:2004:OPR,
author = "Guillermo del Angel and Terrence L. Fine",
title = "Optimal power and retransmission control policies for
random access systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1156--1166",
month = dec,
year = "2004",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zegura:2005:Ea,
author = "Ellen W. Zegura",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "1--1",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baboescu:2005:SPC,
author = "Florin Baboescu and George Varghese",
title = "Scalable packet classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "2--14",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2005:FTB,
author = "Jun Xu and Richard J. Lipton",
title = "On fundamental tradeoffs between delay bounds and
computational complexity in packet scheduling
algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "15--28",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yau:2005:DAD,
author = "David K. Y. Yau and John C. S. Lui and Feng Liang and
Yeung Yam",
title = "Defending against distributed denial-of-service
attacks with max-min fair server-centric router
throttles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "29--42",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paganini:2005:CCH,
author = "Fernando Paganini and Zhikui Wang and John C. Doyle
and Steven H. Low",
title = "Congestion control for high performance, stability,
and fairness in general networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "43--56",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2005:QPF,
author = "Dongyu Qiu and Ness B. Shroff",
title = "Queueing properties of feedback flow control systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "57--68",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xia:2005:ABC,
author = "Yong Xia and David Harrison and Shivkumar Kalyanaraman
and Kishore Ramachandran and Arvind Venkatesan",
title = "Accumulation-based congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "69--80",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lakshmikantha:2005:RRV,
author = "Ashvin Lakshmikantha and Carolyn L. Beck and R.
Srikant",
title = "Robustness of real and virtual queue-based active
queue management schemes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "81--93",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pitsillides:2005:ANC,
author = "Andreas Pitsillides and Petros Ioannou and Marios
Lestas and Loukas Rossides",
title = "Adaptive nonlinear congestion controller for a
differentiated-services framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "94--107",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karnik:2005:PTC,
author = "Aditya Karnik and Anurag Kumar",
title = "Performance of {TCP} congestion control with explicit
rate feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "108--120",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarkar:2005:FDC,
author = "Saswati Sarkar and Leandros Tassiulas",
title = "Fair distributed congestion control in multirate
multicast networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "121--133",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Trappe:2005:RAC,
author = "Wade Trappe and Yuke Wang and K. J. Ray Liu",
title = "Resource-aware conference key establishment for
heterogeneous networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "134--146",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2005:CBD,
author = "Li Li and Joseph Y. Halpern and Paramvir Bahl and
Yi-Min Wang and Roger Wattenhofer",
title = "A cone-based distributed topology-control algorithm
for wireless multi-hop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "147--159",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2005:SNM,
author = "Guanglei Liu and Chuanyi Ji and Vincent W. S. Chan",
title = "On the scalability of network management information
for inter-domain light-path assessment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "160--172",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2005:ERW,
author = "Li-Wei Chen and Eytan Modiano",
title = "Efficient routing and wavelength assignment for
reconfigurable {WDM} ring networks with wavelength
converters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "173--186",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2005:ABP,
author = "Kejie Lu and Gaoxi Xiao and Imrich Chlamtac",
title = "Analysis of blocking probability for distributed
lightpath establishment in {WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "187--197",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2005:AOS,
author = "Yu Liu and David Tipper and Peerapon
Siripongwutikorn",
title = "Approximating optimal spare capacity allocation by
successive survivable routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "1",
pages = "198--211",
month = feb,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mitra:2005:STE,
author = "Debasis Mitra and Qiong Wang",
title = "Stochastic traffic engineering for demand uncertainty
and risk-aware network revenue management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "221--233",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sridharan:2005:ANO,
author = "Ashwin Sridharan and Roch Gu{\'e}rin and Christophe
Diot",
title = "Achieving near-optimal traffic engineering solutions
for current {OSPF\slash IS-IS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "234--247",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kerivin:2005:DCS,
author = "Herv{\'e} Kerivin and Dritan Nace and Thi-Tuyet-Loan
Pham",
title = "Design of capacitated survivable networks with a
single facility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "248--261",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ascia:2005:EMS,
author = "Giuseppe Ascia and Vincenzo Catania and Daniela
Panno",
title = "An evolutionary management scheme in high-performance
packet switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "262--275",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2005:SCP,
author = "Chengzhi Li and Edward W. Knightly",
title = "Schedulability criterion and performance analysis of
coordinated schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "276--287",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Younis:2005:FSL,
author = "Ossama Younis and Sonia Fahmy",
title = "{FlowMate}: scalable on-line flow clustering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "288--301",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deb:2005:RAB,
author = "Supratim Deb and Ayalvadi Ganesh and Peter Key",
title = "Resource allocation between persistent and transient
flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "302--315",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mellia:2005:TSF,
author = "Marco Mellia and Michela Meo and Claudio Casetti",
title = "{TCP} smart framing: a segmentation algorithm to
reduce {TCP} latency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "316--329",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sastry:2005:CTW,
author = "Nishanth R. Sastry and Simon S. Lam",
title = "{CYRF}: a theory of window-based unicast congestion
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "330--342",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kwak:2005:PAE,
author = "Byung-Jae Kwak and Nah-Oak Song and Leonard E.
Miller",
title = "Performance analysis of exponential backoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "343--355",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altman:2005:SMT,
author = "Eitan Altman and Konstantin Avrachenkov and Chadi
Barakat",
title = "A stochastic model of {TCP\slash IP} with stationary
random losses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "356--369",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2005:IQV,
author = "Ying Xu and Roch Gu{\'e}rin",
title = "Individual {QoS} versus aggregate {QoS}: a loss
performance study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "370--383",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Su:2005:TDS,
author = "Weilian Su and Ian F. Akyildiz",
title = "Time-diffusion synchronization protocol for wireless
sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "384--397",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Park:2005:OTL,
author = "Taejoon Park and Kang G. Shin",
title = "Optimal tradeoffs for location-based routing in
large-scale ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "398--410",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eryilmaz:2005:SSP,
author = "Atilla Eryilmaz and R. Srikant and James R. Perkins",
title = "Stable scheduling policies for fading wireless
channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "411--424",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dousse:2005:IIC,
author = "Olivier Dousse and Fran{\c{c}}ois Baccelli and Patrick
Thiran",
title = "Impact of interferences on connectivity in ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "425--436",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bouillet:2005:LRO,
author = "Eric Bouillet and Jean-Fran{\c{c}}ois Labourdette and
Ramu Ramamurthy and Sid Chaudhuri",
title = "Lightpath re-optimization in mesh optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "437--447",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dasylva:2005:OOC,
author = "Abel Dasylva and Delfin Y. Montuno and Prasad
Kodaypak",
title = "Optimization of optical cross-connects with
wave-mixing conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "2",
pages = "448--458",
month = apr,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zegura:2005:Eb,
author = "Ellen W. Zegura",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "461--461",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Clark:2005:TCD,
author = "David D. Clark and John Wroclawski and Karen R.
Sollins and Robert Braden",
title = "Tussle in cyberspace: defining tomorrow's {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "462--475",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ko:2005:DSS,
author = "Bong-Jun Ko and Dan Rubenstein",
title = "Distributed self-stabilizing placement of replicated
resources in emerging networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "476--487",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Feng:2005:TCP,
author = "Wu-chang Feng and Francis Chang and Wu-chi Feng and
Jonathan Walpole",
title = "A traffic characterization of popular on-line games",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "488--500",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rubenstein:2005:CUP,
author = "Dan Rubenstein and Sambit Sahu",
title = "Can unstructured {P2P} protocols survive flash
crowds?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "501--512",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lim:2005:CIC,
author = "Hyuk Lim and Jennifer C. Hou and Chong-Ho Choi",
title = "Constructing {Internet} coordinate system based on
delay measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "513--525",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eun:2005:NDT,
author = "Do Young Eun and Ness B. Shroff",
title = "Network decomposition: theory and practice",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "526--539",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yousefizadeh:2005:LMM,
author = "Homayoun Yousefi'zadeh and Hamid Jafarkhani and Amir
Habibi",
title = "Layered media multicast control {(LMMC)}: rate
allocation and partitioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "540--553",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akyildiz:2005:RCS,
author = "Ian F. Akyildiz and {\"O}zg{\"u}r B. Akan and Giacomo
Morabito",
title = "A rate control scheme for adaptive real-time
applications in {IP} networks with lossy links and long
round trip times",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "554--567",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vojnovic:2005:LRB,
author = "Milan Vojnovi{\'c} and Jean-Yves {Le Boudec}",
title = "On the long-run behavior of equation-based rate
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "568--581",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2005:CLO,
author = "Jiantao Wang and Lun Li and Steven H. Low and John C.
Doyle",
title = "Cross-layer optimization in {TCP\slash IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "582--595",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Biaz:2005:RCL,
author = "Sa{\^a}d Biaz and Nitin H. Vaidya",
title = "{``De-randomizing''} congestion losses to improve
{TCP} performance over wired-wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "596--608",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2005:NSC,
author = "Hongyi Wu and Chong Wang and Nian-Feng Tzeng",
title = "Novel self-configurable positioning technique for
multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "609--621",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kabamba:2005:RAR,
author = "Pierre T. Kabamba and Semyon M. Meerkov and Choon Yik
Tang",
title = "Ranking and adaptive ranking {CDMA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "622--635",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borst:2005:ULP,
author = "Sem Borst",
title = "User-level performance of channel-aware scheduling
algorithms in wireless data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "636--647",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2005:ACQ,
author = "Yigal Bejerano and Yuri Breitbart and Ariel Orda and
Rajeev Rastogi and Alexander Sprintson",
title = "Algorithms for computing {QoS} paths with
restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "648--661",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chakrabarti:2005:RCR,
author = "Anirban Chakrabarti and G. Manimaran",
title = "Reliability constrained routing in {QoS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "662--675",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2005:QPG,
author = "Xiang Yu and Ian Li-Jin Thng and Yuming Jiang and
Chunming Qiao",
title = "Queueing processes in {GPS} and {PGPS} with {LRD}
traffic inputs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "676--689",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basu:2005:FIU,
author = "Anindya Basu and Girija Narlikar",
title = "Fast incremental updates for pipelined forwarding
engines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "690--703",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chu:2005:DRW,
author = "Xiaowen Chu and Bo Li",
title = "Dynamic routing and wavelength assignment in the
presence of wavelength conversion for all-optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "3",
pages = "704--715",
month = jun,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kuipers:2005:CIC,
author = "Fernando A. Kuipers and Piet F. A. {Van Mieghem}",
title = "Conditions that impact the complexity of {QoS}
routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "717--730",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Maxemchuk:2005:QMT,
author = "Nicholas F. Maxemchuk and Iradj Ouveysi and Moshe
Zukerman",
title = "A quantitative measure for telecommunications networks
topology design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "731--742",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chait:2005:TDU,
author = "Yossi Chait and C. V. Hollot and Vishal Misra and Don
Towsley and Honggang Zhang and Yong Cui",
title = "Throughput differentiation using coloring at the
network edge and preferential marking at the core",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "743--754",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Taylor:2005:RHC,
author = "David E. Taylor and Andreas Herkersdorf and Andreas
D{\"o}ring and Gero Dittmann",
title = "Robust header compression {(ROHC)} in next-generation
network processors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "755--768",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akhbarizadeh:2005:HBI,
author = "Mohammad J. Akhbarizadeh and Mehrdad Nourani",
title = "Hardware-based {IP} routing using partitioned lookup
table",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "769--781",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ganjali:2005:CSV,
author = "Yashar Ganjali and Abtin Keshavarzian and Devavrat
Shah",
title = "Cell switching versus packet switching in input-queued
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "782--789",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2005:LBP,
author = "Weiguang Shi and M. H. MacGregor and Pawel
Gburzynski",
title = "Load balancing for parallel forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "790--801",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sangireddy:2005:SME,
author = "Rama Sangireddy and Natsuhiko Futamura and Srinivas
Aluru and Arun K. Somani",
title = "Scalable, memory efficient, high-speed {IP} lookup
algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "802--812",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2005:SND,
author = "Xiaojun Lin and Ness B. Shroff",
title = "Simplification of network dynamics in large systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "813--826",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2005:NCO,
author = "Jang-Won Lee and Ravi R. Mazumdar and Ness B. Shroff",
title = "Non-convex optimization and rate control for
multi-class services in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "827--840",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baccelli:2005:ITF,
author = "Fran{\c{c}}ois Baccelli and Dohy Hong",
title = "Interaction of {TCP} flows as billiards",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "841--853",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2005:DPA,
author = "Jang-Won Lee and Ravi R. Mazumdar and Ness B. Shroff",
title = "Downlink power allocation for multi-class wireless
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "854--867",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2005:CAR,
author = "Murali Kodialam and Thyaga Nandagopal",
title = "Characterizing achievable rates in multi-hop wireless
mesh networks with orthogonal channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "868--880",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sinha:2005:ITA,
author = "Sushant Sinha and C. Siva Ram Murthy",
title = "Information theoretic approach to traffic adaptive
{WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "881--894",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saengudomlert:2005:DWA,
author = "Poompat Saengudomlert and Eytan H. Modiano and Robert
G. Gallager",
title = "Dynamic wavelength assignment for {WDM} all-optical
tree networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "895--905",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Labourdette:2005:FAD,
author = "Jean-Fran{\c{c}}ois Labourdette and Eric Bouillet and
Ramu Ramamurthy and Ahmet A. Akyama{\c{c}}",
title = "Fast approximate dimensioning and performance analysis
of mesh optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "906--917",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2005:SRL,
author = "Lu Shen and Xi Yang and Byrav Ramamurthy",
title = "Shared risk link group {(SRLG)-diverse} path
provisioning under hybrid service level agreements in
wavelength-routed optical mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "4",
pages = "918--931",
month = aug,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 5 06:43:22 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffield:2005:EFD,
author = "Nick Duffield and Carsten Lund and Mikkel Thorup",
title = "Estimating flow distributions from sampled flow
statistics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "933--946",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2005:EPP,
author = "Yin Zhang and Matthew Roughan and Carsten Lund and
David L. Donoho",
title = "Estimating point-to-point and point-to-multipoint
traffic matrices: an information-theoretic approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "947--960",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zou:2005:MED,
author = "Cliff C. Zou and Weibo Gong and Don Towsley and Lixin
Gao",
title = "The monitoring and early detection of {Internet}
Worms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "961--974",
month = oct,
year = "2005",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2005.857113",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "After many Internet-scale worm incidents in recent
years, it is clear that a simple self-propagating worm
can quickly spread across the Internet and cause severe
damage to our society. Facing this great security
threat, we need to build an early detection system that
can detect the presence of a worm in the Internet as
quickly as possible in order to give people accurate
early warning information and possible reaction time
for counteractions. This paper first presents an
Internet worm monitoring system. Then, based on the
idea of ``detecting the trend, not the burst'' of
monitored illegitimate traffic, we present a ``trend
detection'' methodology to detect a worm at its early
propagation stage by using Kalman filter estimation,
which is robust to background noise in the monitored
data. In addition, for uniform-scan worms such as Code
Red, we can effectively predict the overall vulnerable
population size, and estimate accurately how many
computers are really infected in the global Internet
based on the biased monitored data. For monitoring a
nonuniform scan worm, especially a sequential-scan worm
such as Blaster, we show that it is crucial for the
address space covered by the worm monitoring system to
be as distributed as possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Computer network security; early detection; Internet
worm; network monitoring",
}
@Article{Pan:2005:SME,
author = "Rong Pan and Balaji Prabhakar and Konstantinos Psounis
and Damon Wischik",
title = "{SHRiNK}: a method for enabling scaleable performance
prediction and efficient network simulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "975--988",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fang:2005:MPA,
author = "Yuguang Fang",
title = "Modeling and performance analysis for wireless mobile
networks: a new analytical approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "989--1002",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akan:2005:ESR,
author = "{\"O}zg{\"u}r B. Akan and Ian F. Akyildiz",
title = "Event-to-sink reliable transport in wireless sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1003--1016",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koskie:2005:NGA,
author = "Sarah Koskie and Zoran Gajic",
title = "A {Nash} game algorithm for {SIR}-based power control
in {$3$G} wireless {CDMA} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1017--1026",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuen:2005:PBR,
author = "Clement Yuen and Peter Marbach",
title = "Price-based rate control in random access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1027--1040",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2005:DUP,
author = "Youngmi Jin and George Kesidis",
title = "Dynamics of usage-priced communication networks: the
case of a single bottleneck resource",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1041--1053",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2005:AFJ,
author = "Yunkai Zhou and Harish Sethu",
title = "On achieving fairness in the joint allocation of
processing and bandwidth resources: principles and
algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1054--1067",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2005:ERS,
author = "Shao Liu and Tamer Ba{\c{s}}ar and R. Srikant",
title = "Exponential-{RED}: a stabilizing {AQM} scheme for low-
and high-speed {TCP} protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1068--1081",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tian:2005:SAD,
author = "Yu-Ping Tian",
title = "Stability analysis and design of the second-order
congestion control for networks with heterogeneous
delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1082--1093",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Amir:2005:CBF,
author = "Yair Amir and Baruch Awerbuch and Claudiu Danilov and
Jonathan Stanton",
title = "A cost-benefit flow control for reliable multicast and
unicast in overlay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1094--1106",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Loguinov:2005:GTA,
author = "Dmitri Loguinov and Juan Casas and Xiaoming Wang",
title = "Graph-theoretic analysis of structured peer-to-peer
systems: routing distances and fault resilience",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1107--1120",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2005:ILL,
author = "Hui Zhang and Ashish Goel and Ramesh Govindan",
title = "Improving lookup latency in distributed hash table
systems using random sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1121--1134",
month = oct,
year = "2005",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2005.857106",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed hash table (DHT) systems are an important
class of peer-to-peer routing infrastructures. They
enable scalable wide-area storage and retrieval of
information, and will support the rapid development of
a wide variety of Internet-scale applications ranging
from naming systems and file systems to
application-layer multicast. DHT systems essentially
build an overlay network, but a path on the overlay
between any two nodes can be significantly different
from the unicast path between those two nodes on the
underlying network. As such, the lookup latency in
these systems can be quite high and can adversely
impact the performance of applications built on top of
such systems. In this paper, we discuss a random
sampling technique that incrementally improves lookup
latency in DHT systems. Our sampling can be implemented
using information gleaned from lookups traversing the
overlay network. For this reason, we call our approach
lookup-parasitic random sampling (LPRS). LPRS converges
quickly, and requires relatively few modifications to
existing DHT systems. For idealized versions of DHT
systems like Chord, Tapestry, and Pastry, we
analytically prove that LPRS can result in lookup
latencies proportional to the average unicast latency
of the network, provided the underlying physical
topology has a power-law latency expansion. We then
validate this analysis by implementing LPRS in the
Chord simulator. Our simulations reveal that LPRS-Chord
exhibits a qualitatively better latency scaling
behavior relative to unmodified Chord. The overhead of
LPRS is one sample per lookup hop in the worst case.
Finally, we provide evidence which suggests that the
Internet router-level topology resembles power-law
latency expansion. This finding implies that LPRS has
significant practical applicability as a general
latency reduction technique for many DHT systems. This
finding is also of independent interest since it might
inform the design of latency-sensitive topology models
for the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2005:PCC,
author = "Xuehong Sun and Sartaj K. Sahni and Yiqiang Q. Zhao",
title = "Packet classification consuming small amount of
memory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1135--1145",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Orda:2005:SAP,
author = "Ariel Orda and Alexander Sprintson",
title = "A scalable approach to the partition of {QoS}
requirements in unicast and multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1146--1159",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sobrinho:2005:ATD,
author = "Jo{\~a}o Lu{\'\i}s Sobrinho",
title = "An algebraic theory of dynamic network routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1160--1173",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Siachalou:2005:APC,
author = "Stavroula Siachalou and Leonidas Georgiadis",
title = "Algorithms for precomputing constrained widest paths
and multicast trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1174--1187",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2005:EED,
author = "Wei Sun and Kang G. Shin",
title = "End-to-end delay bounds for traffic aggregates under
guaranteed-rate scheduling algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "1188--1201",
month = oct,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alderson:2005:UIT,
author = "David Alderson and Lun Li and Walter Willinger and
John C. Doyle",
title = "Understanding {Internet} topology: principles, models,
and validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1205--1218",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cormode:2005:WNF,
author = "Graham Cormode and S. Muthukrishnan",
title = "What's new: Finding significant differences in network
data streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1219--1232",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2005:DCB,
author = "Nan Jin and Gayathri Venkitachalam and Scott Jordan",
title = "Dynamic congestion-based pricing of bandwidth and
buffer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1233--1246",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2005:IEP,
author = "Haining Wang and Abhijit Bose and Mohamed El-Gendy and
Kang G. Shin",
title = "{IP Easy-pass}: a light-weight network-edge resource
access control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1247--1260",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alpcan:2005:GSA,
author = "Tansu Alpcan and Tamer Basar",
title = "A globally stable adaptive congestion control scheme
for {Internet}-style networks with delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1261--1274",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Weber:2005:RAM,
author = "Steven Weber and Gustavo {De Veciana}",
title = "Rate adaptive multimedia streams: optimization and
admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1275--1288",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marsan:2005:UPD,
author = "Marco Ajmone Marsan and Michele Garetto and Paolo
Giaccone and Emilio Leonardi and Enrico Schiattarella
and Alessandro Tarello",
title = "Using partial differential equations to model {TCP}
mice and elephants in large {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1289--1301",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2005:PBL,
author = "Shengming Jiang and Dajiang He and Jianqiang Rao",
title = "A prediction-based link availability estimation for
routing metrics in {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1302--1312",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2005:LTC,
author = "Ning Li and Jennifer C. Hou",
title = "Localized topology control algorithms for
heterogeneous wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1313--1324",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marbach:2005:CWA,
author = "Peter Marbach and Ying Qiu",
title = "Cooperation in wireless ad hoc networks: a
market-based approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1325--1338",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bandyopadhyay:2005:STS,
author = "Seema Bandyopadhyay and Qingjiang Tian and Edward J.
Coyle",
title = "Spatio-temporal sampling rates and energy efficiency
in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1339--1352",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2005:CDR,
author = "Haibin Lu and Sartaj Sahni",
title = "Conflict detection and resolution in two-dimensional
prefix router tables",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1353--1363",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keslassy:2005:GSS,
author = "Isaac Keslassy and Murali Kodialam and T. V. Lakshman
and Dimitrios Stiliadis",
title = "On guaranteed smooth scheduling for input-queued
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1364--1375",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Valaee:2005:ERP,
author = "Shahrokh Valaee and Jean-Charles Gr{\'e}goire",
title = "An estimator of regulator parameters in a stochastic
setting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1376--1389",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2005:CTA,
author = "Tao Wu and Arun K. Somani",
title = "Cross-talk attack monitoring and localization in
all-optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1390--1401",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rosenberg:2005:HTN,
author = "Eric Rosenberg",
title = "Hierarchical topological network design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1402--1409",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2005:CID,
author = "Tzu-Lun Huang and D. T. Lee",
title = "Comments and an improvement on {``A distributed
algorithm of delay-bounded multicast routing for
multimedia applications in wide area networks''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "6",
pages = "1410--1411",
month = dec,
year = "2005",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 27 07:14:54 MST 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Jia:1998:DAD}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2006:JRA,
author = "Jang-Won Lee and Ravi R. Mazumdar and Ness B. Shroff",
title = "Joint resource allocation and base-station assignment
for the downlink in {CDMA} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "1--14",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kar:2006:DNA,
author = "Koushik Kar and Ananth Krishnamurthy and Neeraj
Jaggi",
title = "Dynamic node activation in networks of rechargeable
sensors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "15--26",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Haas:2006:NNM,
author = "Zygmunt J. Haas and Tara Small",
title = "A new networking model for biological applications of
ad hoc sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "27--40",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cristescu:2006:NCD,
author = "Razvan Cristescu and Baltasar Beferull-Lozano and
Martin Vetterli and Roger Wattenhofer",
title = "Network correlated data gathering with explicit
communication: {NP}-completeness and algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "41--54",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gupta:2006:CSC,
author = "Himanshu Gupta and Zongheng Zhou and Samir R. Das and
Quinyi Gu",
title = "Connected sensor cover: self-organization of sensor
networks for efficient query execution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "55--67",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hohn:2006:IST,
author = "Nicolas Hohn and Darryl Veitch",
title = "Inverting sampled traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "68--80",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Byers:2006:FGL,
author = "John W. Byers and Gu-In Kwon and Michael Luby and
Michael Mitzenmacher",
title = "Fine-grained layered multicast with {STAIR}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "81--93",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ranjan:2006:GSC,
author = "Priya Ranjan and Richard J. La and Eyad H. Abed",
title = "Global stability conditions for rate control with
arbitrary communication delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "94--107",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tinnakornsrisuphap:2006:ABH,
author = "Peerapol Tinnakornsrisuphap and Richard J. La",
title = "Asymptotic behavior of heterogeneous {TCP} flows and
{RED} gateway",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "108--120",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2006:MOQ,
author = "Hyoung-Il Lee and Seung-Woo Seo",
title = "Matching output queueing with a multiple input\slash
output-queued switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "121--132",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Veloso:2006:HCL,
author = "Eveline Veloso and Virg{\'\i}lio Almeida and Wagner
{Meira, Jr.} and Azer Bestavros and Shudong Jin",
title = "A hierarchical characterization of a live streaming
media workload",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "133--146",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2006:CAF,
author = "Dahai Xu and Yang Chen and Yizhi Xiong and Chunming
Qiao and Xin He",
title = "On the complexity of and algorithms for finding the
shortest path with a disjoint counterpart",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "147--158",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fumagalli:2006:DRD,
author = "Andrea Fumagalli and Marco Tacca",
title = "Differentiated reliability {(DiR)} in wavelength
division multiplexing rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "159--168",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2006:WAM,
author = "Jianping Wang and Xiangtong Qi and Biao Chen",
title = "Wavelength assignment for multicast in all-optical
{WDM} networks with splitting constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "169--182",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ferrel:2006:VTM,
author = "Ian Ferrel and Adrian Mettler and Edward Miller and
Ran Libeskind-Hadas",
title = "Virtual topologies for multicasting with multiple
originators in {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "183--190",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Harai:2006:HSB,
author = "Hiroaki Harai and Masayuki Murata",
title = "High-speed buffer management for {40 Gb/s}-based
photonic packet switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "191--204",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ngo:2006:CAN,
author = "Hung Q. Ngo and Dazhen Pan and Chunming Qiao",
title = "Constructions and analyses of nonblocking {WDM}
switches based on arrayed waveguide grating and limited
wavelength conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "205--217",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ou:2006:SVC,
author = "Canhui Ou and Laxman H. Sahasrabuddhe and Keyao Zhu
and Charles U. Martel and Biswanath Mukherjee",
title = "Survivable virtual concatenation for data over
{SONET\slash SDH} in optical transport networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "1",
pages = "218--231",
month = feb,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue May 30 16:30:02 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Banerjee:2006:RMU,
author = "Suman Banerjee and Seungjoon Lee and Bobby
Bhattacharjee and Aravind Srinivasan",
title = "Resilient multicast using overlays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "237--248",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872579",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce Probabilistic Resilient Multicast (PRM):
a multicast data recovery scheme that improves data
delivery ratios while maintaining low end-to-end
latencies. PRM has both a proactive and a reactive
components; in this paper we describe how PRM can be
used to improve the performance of application-layer
multicast protocols especially when there are high
packet losses and host failures. Through detailed
analysis in this paper, we show that this loss recovery
technique has efficient scaling properties-the
overheads at each overlay node asymptotically decrease
to zero with increasing group sizes.As a detailed case
study, we show how PRM can be applied to the NICE
application-layer multicast protocol. We present
detailed simulations of the PRM-enhanced NICE protocol
for 10000 node Internet-like topologies. Simulations
show that PRM achieves a high delivery ratio
({$>$97}\%) with a low latency bound (600 ms) for
environments with high end-to-end network losses
(1\%-5\%) and high topology change rates (5 changes per
second) while incurring very low overheads
({$<$5}\%).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gorinsky:2006:DMP,
author = "Sergey Gorinsky and Sugat Jain and Harrick Vin and
Yongguang Zhang",
title = "Design of multicast protocols robust against inflated
subscription",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "249--262",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872573",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To disseminate data to a heterogeneous body of
receivers efficiently, congestion control protocols for
IP multicast compose a session from several multicast
groups and prescribe guidelines that enable each
receiver to subscribe to an appropriate subset of the
groups. However, a misbehaving receiver can ignore the
group subscription rules and inflate its subscription
to acquire unfairly high throughput. In this paper, we
present the first solution for the problem of inflated
subscription. Our design guards access to multicast
groups with dynamic keys and consists of two
independent components: DELTA (Distribution of
ELigibility To Access) --- a novel method for in-band
distribution of group keys to receivers that are
eligible to access the groups according to the
congestion control protocol, and SIGMA (Secure Internet
Group Management Architecture) --- a generic
architecture for key-based group access at edge
routers. We apply DELTA and SIGMA to derive robust
versions of prominent RLM and FLID-DL protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2006:DCK,
author = "Patrick P. C. Lee and John C. S. Lui and David K. Y.
Yau",
title = "Distributed collaborative key agreement and
authentication protocols for dynamic peer groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "263--276",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872575",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider several distributed collaborative key
agreement and authentication protocols for dynamic peer
groups. There are several important characteristics
which make this problem different from traditional
secure group communication. They are: (1) distributed
nature in which there is no centralized key server; (2)
collaborative nature in which the group key is
contributory (i.e., each group member will
collaboratively contribute its part to the global group
key); and (3) dynamic nature in which existing members
may leave the group while new members may join. Instead
of performing individual rekeying operations, i.e.,
recomputing the group key after every join or leave
request, we discuss an interval-based approach of
rekeying. We consider three interval-based distributed
rekeying algorithms, or interval-based algorithms for
short, for updating the group key: (1) the Rebuild
algorithm; (2) the Batch algorithm; and (3) the
Queue-batch algorithm. Performance of these three
interval-based algorithms under different settings,
such as different join and leave probabilities, is
analyzed. We show that the interval-based algorithms
significantly outperform the individual rekeying
approach and that the Queue-batch algorithm performs
the best among the three interval-based algorithms.
More importantly, the Queue-batch algorithm can
substantially reduce the computation and communication
workload in a highly dynamic environment. We further
enhance the interval-based algorithms in two aspects:
authentication and implementation. Authentication
focuses on the security improvement, while
implementation realizes the interval-based algorithms
in real network settings. Our work provides a
fundamental understanding about establishing a group
key via a distributed and collaborative approach for a
dynamic peer group.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Levy:2006:EPD,
author = "Hanoch Levy and Haim Zlatokrilov",
title = "The effect of packet dispersion on voice applications
in {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "277--288",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872543",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Delivery of real time streaming applications, such as
voice and video over IP, in packet switched networks is
based on dividing the stream into packets and shipping
each of the packets on an individual basis to the
destination through the network. The basic implicit
assumption on these applications is that shipping all
the packets of an application is done, most of the
time, over a single path along the network. In this
work, we present a model in which packets of a certain
session are dispersed over multiple paths, in contrast
to the traditional approach. The dispersion may be
performed by network nodes for various reasons such as
load-balancing, or implemented as a mechanism to
improve quality, as will be presented in this work. To
study the effect of packet dispersion on the quality of
voice over IP (VoIP) applications, we focus on the
effect of the network loss on the applications, where
we propose to use the Noticeable Loss Rate (NLR) as a
measure (negatively) correlated with the voice quality.
We analyze the NLR for various packet dispersion
strategies over paths experiencing memoryless
(Bernoulli) or bursty (Gilbert model) losses, and
compare them to each other. Our analysis reveals that
in many situations the use of packet dispersion reduces
the NLR and thus improves session quality. The results
suggest that the use of packet dispersion can be quite
beneficial for these applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Musacchio:2006:WAP,
author = "John Musacchio and Jean Walrand",
title = "{WiFi} access point pricing as a dynamic game",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "289--301",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TENT.2006.872553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the economic interests of a wireless access
point owner and his paying client, and model their
interaction as a dynamic game. The key feature of this
game is that the players have asymmetric
information-the client knows more than the access
provider. We find that if a client has a ``web
browser'' utility function (a temporal utility function
that grows linearly), it is a Nash equilibrium for the
provider to charge the client a constant price per unit
time. On the other hand, if the client has a ``file
transferor'' utility function (a utility function that
is a step function), the client would be unwilling to
pay until the final time slot of the file transfer. We
also study an expanded game where an access point sells
to a reseller, which in turn sells to a mobile client
and show that if the client has a web browser utility
function, that constant price is a Nash equilibrium of
the three player game. Finally, we study a two player
game in which the access point does not know whether he
faces a web browser or file transferor type client, and
show conditions for which it is not a Nash equilibrium
for the access point to maintain a constant price.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2006:IIS,
author = "Xiaojun Lin and Ness B. Shroff",
title = "The impact of imperfect scheduling on cross-layer
congestion control in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "302--315",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TENT.2006.872546",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study cross-layer design for
congestion control in multihop wireless networks. In
previous work, we have developed an optimal cross-layer
congestion control scheme that jointly computes both
the rate allocation and the stabilizing schedule that
controls the resources at the underlying layers.
However, the scheduling component in this optimal
cross-layer congestion control scheme has to solve a
complex global optimization problem at each time, and
is hence too computationally expensive for online
implementation. In this paper, we study how the
performance of cross-layer congestion control will be
impacted if the network can only use an imperfect (and
potentially distributed) scheduling component that is
easier to implement. We study both the case when the
number of users in the system is fixed and the case
with dynamic arrivals and departures of the users, and
we establish performance bounds of cross-layer
congestion control with imperfect scheduling. Compared
with a layered approach that does not design congestion
control and scheduling together, our cross-layer
approach has provably better performance bounds, and
substantially outperforms the layered approach. The
insights drawn from our analyzes also enable us to
design a fully distributed cross-layer congestion
control and scheduling algorithm for a restrictive
interference model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vuran:2006:SCB,
author = "Mehmet C. Vuran and Ian F. Akyildiz",
title = "Spatial correlation-based collaborative medium access
control in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "316--329",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TENT.2006.872544",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless Sensor Networks (WSN) are mainly
characterized by dense deployment of sensor nodes which
collectively transmit information about sensed events
to the sink. Due to the spatial correlation between
sensor nodes subject to observed events, it may not be
necessary for every sensor node to transmit its data.
This paper shows how the spatial correlation can be
exploited on the Medium Access Control (MAC) layer. To
the best of our knowledge, this is the first effort
which exploits spatial correlation in WSN on the MAC
layer. A theoretical framework is developed for
transmission regulation of sensor nodes under a
distortion constraint. It is shown that a sensor node
can act as a representative node for several other
sensor nodes observing the correlated data. Based on
the theoretical framework, a distributed, spatial
Correlation-based Collaborative Medium Access Control
(CC-MAC) protocol is then designed which has two
components: Event MAC (E-MAC) and Network MAC (N-MAC).
E-MAC filters out the correlation in sensor records
while N-MAC prioritizes the transmission of route-thru
packets. Simulation results show that CC-MAC achieves
high performance in terms energy, packet drop rate, and
latency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saengudomlert:2006:LRW,
author = "Poompat Saengudomlert and Eytan Modiano and Robert G.
Gallager",
title = "On-line routing and wavelength assignment for dynamic
traffic in {WDM} ring and torus networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "330--340",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872549",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop on-line routing and wavelength assignment
(RWA) algorithms for WDM bidirectional ring and torus
networks with $N$ nodes. The algorithms dynamically
support all $k$-allowable traffic matrices, where $k$
denotes an arbitrary integer vector $ [k_1, k - 2,
\ldots {}, k_N]$, and node $i$, $ 1 \leq i \leq N$, can
transmit at most $ k_i$ wavelengths and receive at most
$ k_i$ wavelengths. Both algorithms support the
changing traffic in a rearrangeably nonblocking
fashion. Our first algorithm, for a bidirectional ring,
uses $ \lceil (\sum_{i = 1}^N k_i) / 3 \rceil $
wavelengths in each fiber and requires at most three
lightpath rearrangements per new session request
regardless of the number of nodes $N$ and the amount of
traffic $k$. When all the $ k_i$ 's are equal to $k$,
the algorithm uses $ \lceil k N / 3 \rceil $
wavelengths, which is known to be the minimum for any
off-line rearrangeably nonblocking algorithm. Our
second algorithm, for a torus topology, is an extension
of a known off-line algorithm for the special case with
all the $ k_i$'s equal to $k$. For an $ R \times C$
torus network with $ R \geq C$ nodes, our on-line
algorithm uses $ \lceil k R / 2 \rceil $ wavelengths in
each fiber, which is the same as in the off-line
algorithm, and is at most two times a lower bound
obtained by assuming full wavelength conversion at all
nodes. In addition, the on-line algorithm requires at
most $ C - 1$ lightpath rearrangements per new session
request regardless of the amount of traffic $k$.
Finally, each RWA update requires solving a bipartite
matching problem whose time complexity is only $ O(R)$,
which is much smaller than the time complexity $ O(k C
R^2)$ of the bipartite matching problem for an off-line
algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rosberg:2006:PDO,
author = "Zvi Rosberg and Andrew Zalesky and Moshe Zukerman",
title = "Packet delay in optical circuit-switched networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "341--354",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872570",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A framework is provided for evaluation of packet delay
distribution in an optical circuit-switched network.
The framework is based on a fluid traffic model, packet
queueing at edge routers, and circuit-switched
transmission between edge routers. Packets are assigned
to buffers according to their destination, delay
constraint, physical route and wavelength. At every
decision epoch, a subset of buffers is allocated to
end-to-end circuits for transmission, where circuit
holding times are based on limited and exhaustive
circuit allocation policies. To ensure computational
tractability, the framework approximates the evolution
of each buffer independently. ``Slack variables'' are
introduced to decouple amongst buffers in a way that
the evolution of each buffer remains consistent with
all other buffers in the network. The delay
distribution is derived for a single buffer and an
approximation is given for a network of buffers. The
approximation entails finding a fixed point for the
functional relation between the ``slack variables'' and
a specific circuit allocation policy. An analysis of a
specific policy, in which circuits are
probabilistically allocated based on buffer size, is
given as an illustrative example. The framework is
shown to be in good agreement with a discrete event
simulation model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2006:CIT,
author = "Ao Tang and Jiantao Wang and Steven H. Low",
title = "Counter-intuitive throughput behaviors in networks
under end-to-end control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "355--368",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872552",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been shown that as long as traffic sources
adapt their rates to aggregate congestion measure in
their paths, they implicitly maximize certain utility.
In this paper we study some counter-intuitive
throughput behaviors in such networks, pertaining to
whether a fair allocation is always inefficient and
whether increasing capacity always raises aggregate
throughput. A bandwidth allocation policy can be
defined in terms of a class of utility functions
parameterized by a scalar \alpha that can be
interpreted as a quantitative measure of fairness. An
allocation is fair if \alpha is large and efficient if
aggregate throughput is large. All examples in the
literature suggest that a fair allocation is
necessarily inefficient. We characterize exactly the
tradeoff between fairness and throughput in general
networks. The characterization allows us both to
produce the first counter-example and trivially explain
all the previous supporting examples. Surprisingly, our
counter-example has the property that a fairer
allocation is always more efficient. In particular it
implies that maxmin fairness can achieve a higher
throughput than proportional fairness. Intuitively, we
might expect that increasing link capacities always
raises aggregate throughput. We show that not only can
throughput be reduced when some link increases its
capacity, more strikingly, it can also be reduced when
all links increase their capacities by the same amount.
If all links increase their capacities proportionally,
however, throughput will indeed increase. These
examples demonstrate the intricate interactions among
sources in a network setting that are missing in a
single-link topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bohacek:2006:NTP,
author = "Stephan Bohacek and Joao P. Hespanha and Junsoo Lee
and Chansook Lim and Katia Obraczka",
title = "A new {TCP} for persistent packet reordering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "369--382",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.873366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most standard implementations of TCP perform poorly
when packets are reordered. In this paper, we propose a
new version of TCP that maintains high throughput when
reordering occurs and yet, when packet reordering does
not occur, is friendly to other versions of TCP. The
proposed TCP variant, or TCP-PR, does not rely on
duplicate acknowledgments to detect a packet loss.
Instead, timers are maintained to keep track of how
long ago a packet was transmitted. In case the
corresponding acknowledgment has not yet arrived and
the elapsed time since the packet was sent is larger
than a given threshold, the packet is assumed lost.
Because TCP-PR does not rely on duplicate
acknowledgments, packet reordering (including
out-or-order acknowledgments) has no effect on TCP-PR's
performance.Through extensive simulations, we show that
TCP-PR performs consistently better than existing
mechanisms that try to make TCP more robust to packet
reordering. In the case that packets are not reordered,
we verify that TCP-PR maintains the same throughput as
typical implementations of TCP (specifically, TCP-SACK)
and shares network resources fairly. Furthermore,
TCP-PR only requires changes to the TCP sender side
making it easier to deploy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2006:SAT,
author = "Liangping Ma and Kenneth E. Barner and Gonzalo R.
Arce",
title = "Statistical analysis of {TCP}'s retransmission timeout
algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "383--396",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872577",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The retransmission timeout (RTO) algorithm of
Transmission Control Protocol (TCP), which sets a
dynamic upper bound on the next round-trip time (RTT)
based on past RTTs, plays an important role in reliable
data transfer and congestion control of the Internet. A
rigorous theoretical analysis of the RTO algorithm is
important in that it provides insight into the
algorithm and prompts optimal design strategies.
Nevertheless, such an analysis has not been conducted
to date. This paper presents such an analysis from a
statistical approach. We construct an auto-regressive
(AR) model for the RTT processes based on experimental
results that indicate: (1) RTTs along a certain path in
the Internet can be modeled by a shifted Gamma
distribution and (2) the temporal correlation of RTTs
decreases quickly with lag. This model is used to
determine the average reaction time and premature
timeout probability for the RTO algorithm. We derive a
closed-form expression for the first measure and a
formula for numerically calculating the second. Both
measures are validated through tests on simulated and
real RTT data. The theoretical analysis strengthens a
number of observations reported in past
experiment-oriented studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dharmapurikar:2006:LPM,
author = "Sarang Dharmapurikar and Praveen Krishnamurthy and
David E. Taylor",
title = "Longest prefix matching using {Bloom} filters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "397--409",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872576",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce the first algorithm that we are aware of
to employ Bloom filters for longest prefix matching
(LPM). The algorithm performs parallel queries on Bloom
filters, an efficient data structure for membership
queries, in order to determine address prefix
membership in sets of prefixes sorted by prefix length.
We show that use of this algorithm for Internet
Protocol (IP) routing lookups results in a search
engine providing better performance and scalability
than TCAM-based approaches. The key feature of our
technique is that the performance, as determined by the
number of dependent memory accesses per lookup, can be
held constant for longer address lengths or additional
unique address prefix lengths in the forwarding table
given that memory resources scale linearly with the
number of prefixes in the forwarding table. Our
approach is equally attractive for Internet Protocol
Version 6 (IPv6) which uses 128-bit destination
addresses, four times longer than IPv4. We present a
basic version of our approach along with optimizations
leveraging previous advances in LPM algorithms. We also
report results of performance simulations of our system
using snapshots of IPv4 BGP tables and extend the
results to IPv6. Using less than 2 Mb of embedded RAM
and a commodity SRAM device, our technique achieves
average performance of one hash probe per lookup and a
worst case of two hash probes and one array access per
lookup.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jamjoom:2006:RCP,
author = "Hani Jamjoom and Kang G. Shin",
title = "On the role and controllability of persistent clients
in traffic aggregates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "410--423",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872547",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Flash crowd events (FCEs) present a real threat to the
stability of routers and end-servers. Such events are
characterized by a large and sustained spike in client
arrival rates, usually to the point of service failure.
Traditional rate-based drop policies, such as Random
Early Drop (RED), become ineffective in such situations
since clients tend to be persistent, in the sense that
they make multiple retransmission attempts before
aborting their connection. As it is built into TCP's
congestion control, this persistence is very
widespread, making it a major stumbling block to
providing responsive aggregate traffic controls. This
paper focuses on analyzing and modeling the effects of
client persistence on the controllability of aggregate
traffic. Based on this model, we propose a new drop
strategy called persistent dropping to regulate the
arrival of SYN packets and achieves three important
goals: (1) it allows routers and end-servers to quickly
converge to their control targets without sacrificing
fairness; (2) it minimizes the portion of client delay
that is attributed to the applied controls; and (3) it
is both easily implementable and computationally
tractable. Using a real implementation of this
controller in the Linux kernel, we demonstrate its
efficacy, up to 60\% delay reduction for drop
probabilities less than 0.5.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2006:NPS,
author = "David Lee and Dongluo Chen and Ruibing Hao and Raymond
E. Miller and Jianping Wu and Xia Yin",
title = "Network protocol system monitoring: a formal approach
with passive testing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "424--437",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872572",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study network protocol system monitoring for fault
detection using a formal technique of passive testing
that is a process of detecting system faults by
passively observing its input/output behaviors without
interrupting its normal operations. After describing a
formal model of event-driven extended finite state
machines, we present two algorithms for passive testing
of protocol system control and data portions.
Experimental results on OSPF and TCP are reported.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2006:ELA,
author = "Yigal Bejerano and Mark A. Smith and Joseph (Seffi)
Naor and Nicole Immorlica",
title = "Efficient location area planning for personal
communication systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "438--450",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872555",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A central problem in personal communication systems is
to optimize bandwidth usage, while providing Quality of
Service (QoS) guarantees to mobile users. Network
mobility management, and in particular, location
management, consumes a significant portion of
bandwidth, which is a necessary overhead for supporting
mobile users. We focus our efforts on minimizing this
overhead. Unlike previous works, we concentrate on
optimizing existing schemes, and so the algorithms we
present are easily incorporated into current networks.
We present the first polynomial time approximation
algorithms for minimum bandwidth location management.
In planar graphs, our algorithm provably generates a
solution that uses no more than a constant factor more
bandwidth than the optimal solution. In general graphs,
our algorithm provably generates a solution that uses
just a factor O (log n ) more bandwidth than optimal
where n is the number of base stations in the network.
We show that, in practice, our algorithm produces
near-optimal results and outperforms other schemes that
are described in the literature. For the important case
of the line graph, we present a polynomial-time optimal
algorithm. Finally, we illustrate that our algorithm
can also be used for optimizing the handoff
mechanism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2006:CMT,
author = "Zesheng Chen and Tian Bu and Mostafa Ammar and Don
Towsley",
title = "Comments on {``Modeling TCP Reno performance: a simple
model and its empirical validation''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "451--453",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872541",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Padhye:2000:MTR}.",
abstract = "In this Comments, several errors in Padhye et al.,
2000, are pointed out. The more serious of these errors
result in an over prediction of the send rate. The
expression obtained for send rate in this Comments
leads to greater accuracy when compared with the
measurement data than the original send rate expression
in Padhye et al.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Grossglauser:2006:LMN,
author = "Matthias Grossglauser and Martin Vetterli",
title = "Locating mobile nodes with {EASE}: learning efficient
routes from encounter histories alone",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "457--469",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leung:2006:OPC,
author = "Kin-Kwong Leung and Chi Wan Sung",
title = "An opportunistic power control algorithm for cellular
network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "470--478",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Haas:2006:GBA,
author = "Zygmunt J. Haas and Joseph Y. Halpern and Li Li",
title = "Gossip-based ad hoc routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "479--491",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barrenetxea:2006:LNC,
author = "Guillermo Barrenetxea and Baltasar Berefull-Lozano and
Martin Vetterli",
title = "Lattice networks: capacity limits, optimal routing,
and queueing behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "492--505",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See correction \cite{Barrenetxea:2006:CLN}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2006:PNR,
author = "Xin Wang and Henning Schulzrinne",
title = "Pricing network resources for adaptive applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "506--519",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Arora:2006:LLS,
author = "Anish Arora and Hongwei Zhang",
title = "{LSRP}: local stabilization in shortest path routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "520--531",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shaikh:2006:AID,
author = "Aman Shaikh and Rohit Dube and Anujan Varma",
title = "Avoiding instability during graceful shutdown of
multiple {OSPF} routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "532--542",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Costa:2006:ISD,
author = "Lu{\'\i}s Henrique M. K. Costa and Serge Fdida and
Otto Carlos M. B. Duarte",
title = "Incremental service deployment using the hop-by-hop
multicast routing protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "543--556",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dolev:2006:MTS,
author = "Danny Dolev and Osnat Mokryn and Yuval Shavitt",
title = "On multicast trees: structure and size estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "557--567",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ganesh:2006:CNP,
author = "Ayalvadi J. Ganesh and Peter B. Key and Damien Polis
and R. Srikant",
title = "Congestion notification and probing mechanisms for
endpoint admission control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "568--578",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ying:2006:GSI,
author = "Lei Ying and Geir E. Dullerud and R. Srikant",
title = "Global stability of {Internet} congestion controllers
with heterogeneous delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "579--591",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Thommes:2006:DPM,
author = "Richard W. Thommes and Mark J. Coates",
title = "Deterministic packet marking for time-varying
congestion price estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "592--602",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Moon:2006:RAS,
author = "Ji-Cheol Moon and Byeong Gi Lee",
title = "Rate-adaptive snoop: a {TCP} enhancement scheme over
rate-controlled lossy links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "603--615",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shorten:2006:PSM,
author = "Robert Shorten and Fabian Wirth and Douglas Leith",
title = "A positive systems model of {TCP}-like congestion
control: asymptotic results",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "616--629",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2006:PDP,
author = "Yuming Jiang",
title = "Per-domain packet scale rate guarantee for expedited
forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "630--643",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2006:PGR,
author = "Cheng-Shang Chang and Duan-Shin Lee and Chi-Yao Yue",
title = "Providing guaranteed rate services in the load
balanced {Birkhoff--von Neumann} switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "644--656",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2006:DIS,
author = "Yu Cheng and Weihua Zhuang",
title = "Dynamic inter-{SLA} resource sharing in path-oriented
differentiated services networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "3",
pages = "657--670",
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 21 05:27:29 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2006:ISIa,
author = "Ning Cai and Mung Chiang and Michelle Effros and Ralf
Koetter and Muriel M{\'e}dard and Balaji Prabhakar and
R. Srikant and Don Towsley and Raymond W. Yeung",
title = "Introduction to the special issue on networking and
information theory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2285--2288",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xue:2006:ICL,
author = "Feng Xue and P. R. Kumar",
title = "On the $ \theta $-coverage and connectivity of large
random networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2289--2299",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ciucu:2006:SPS,
author = "Florin Ciucu and Almut Burchard and J{\"o}rg
Liebeherr",
title = "Scaling properties of statistical end-to-end bounds in
the network calculus",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2300--2312",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2006:PLA,
author = "Liang-Liang Xie and P. R. Kumar",
title = "On the path-loss attenuation regime for positive cost
and linear scaling of transport capacity in wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2313--2328",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Katz:2006:RPT,
author = "Michael Katz and Shlomo Shamai",
title = "Relaying protocols for two colocated users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2329--2344",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Harvey:2006:CIN,
author = "Nicholas J. A. Harvey and Robert Kleinberg and April
Rasala Lehman",
title = "On the capacity of information networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2345--2364",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dougherty:2006:UNC,
author = "Randall Dougherty and Chris Freiling and Kenneth
Zeger",
title = "Unachievability of network coding capacity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2365--2372",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2006:OBM,
author = "Xijin Yan and Jun Yang and Zhen Zhang",
title = "An outer bound for multisource multisink network
coding with minimum cost consideration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2373--2385",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Langberg:2006:ECN,
author = "Michael Langberg and Alexander Sprintson and Jehoshua
Bruck",
title = "The encoding complexity of network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2386--2397",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2006:UNC,
author = "Yunnan Wu and Kamal Jain and Sun-Yuan Kung",
title = "A unification of network coding and tree-packing
(routing) theorems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2398--2409",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chekuri:2006:ATA,
author = "Chandra Chekuri and Christina Fragouli and Emina
Soljanin",
title = "On average throughput and alphabet size in network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2410--2424",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ratnakar:2006:MCD,
author = "Niranjan Ratnakar and Gerhard Kramer",
title = "The multicast capacity of deterministic relay networks
with no interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2425--2432",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2006:MGM,
author = "Xue-Bin Liang",
title = "Matrix games in the multicast networks: maximum
information flows with network switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2433--2466",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2006:AMM,
author = "Zongpeng Li and Baochun Li and Lap Chi Lau",
title = "On achieving maximum multicast throughput in
undirected networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2467--2485",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deb:2006:AGN,
author = "Supratim Deb and Muriel M{\'e}dard and Clifford
Choute",
title = "Algebraic gossip: a network coding approach to optimal
multiple rumor mongering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2486--2507",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Boyd:2006:RGA,
author = "Stephen Boyd and Arpita Ghosh and Balaji Prabhakar and
Devavrat Shah",
title = "Randomized gossip algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2508--2530",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sirkeci-Mergen:2006:AAM,
author = "Birsen Sirkeci-Mergen and Anna Scaglione and
G{\"o}khan Mergen",
title = "Asymptotic analysis of multistage cooperative
broadcast in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2531--2550",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shokrollahi:2006:RC,
author = "Amin Shokrollahi",
title = "Raptor codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2551--2567",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{ElGamal:2006:OTD,
author = "Abbas {El Gamal} and James Mammen and Balaji Prabhakar
and Devavrat Shah",
title = "Optimal throughput-delay scaling in wireless networks:
part {I}: the fluid model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2568--2592",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2006:TCS,
author = "Jie Luo and Anthony Ephremides",
title = "On the throughput, capacity, and stability regions of
random multiple access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2593--2607",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lun:2006:MCM,
author = "Desmond S. Lun and Niranjan Ratnakar and Muriel
M{\'e}dard and Ralf Koetter and David R. Karger and
Tracey Ho and Ebad Ahmed and Fang Zhao",
title = "Minimum-cost multicast over coded packet networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2608--2623",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sikora:2006:BPE,
author = "Marcin Sikora and J. Nicholas Laneman and Martin
Haenggi and Daniel J. {Costello, Jr.} and Thomas E.
Fuja",
title = "Bandwidth- and power-efficient routing in linear
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2624--2633",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2006:FLA,
author = "Gang Liang and Nina Taft and Bin Yu",
title = "A fast lightweight approach to origin-destination {IP}
traffic estimation using partial measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2634--2648",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Petrovic:2006:OUR,
author = "Dragan Petrovi{\'c} and Kannan Ramchandran and Jan
Rabaey",
title = "Overcoming untuned radios in wireless networks with
network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2649--2657",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wan:2006:CRD,
author = "Peng-Jun Wan and Chih-Wei Yi",
title = "Coverage by randomly deployed wireless sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2658--2669",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ray:2006:SLD,
author = "Saikat Ray and Wei Lai and Ioannis Ch. Paschalidis",
title = "Statistical location detection with sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2670--2683",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Georgiadis:2006:OOR,
author = "Leonidas Georgiadis and Leandros Tassiulas",
title = "Optimal overload response in sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2684--2696",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sundaresan:2006:CQP,
author = "Rajesh Sundaresan and Sergio Verd{\'u}",
title = "Capacity of queues via point-process channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2697--2709",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gurewitz:2006:OWD,
author = "Omer Gurewitz and Israel Cidon and Moshe Sidi",
title = "One-way delay estimation using network-wide
measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2710--2724",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2006:SCT,
author = "An-Swol Hu and Sergio D. Servetto",
title = "On the scalability of cooperative time synchronization
in pulse-connected networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2725--2748",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borbash:2006:FMW,
author = "Steven A. Borbash and Anthony Ephremides",
title = "The feasibility of matchings in a wireless network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2749--2755",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dousse:2006:TSW,
author = "Olivier Dousse and Massimo Franceschetti and Patrick
Thiran",
title = "On the throughput scaling of wireless relay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2756--2761",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khisti:2006:FLS,
author = "Ashish Khisti and Uri Erez and Gregory W. Wornell",
title = "Fundamental limits and scaling behavior of cooperative
multicasting in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2762--2770",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahmad:2006:OBC,
author = "Sahand Haji Ali Ahmad and Aleksandar Jovi{\v{c}}i{\'c}
and Pramod Viswanath",
title = "On outer bounds to the capacity region of wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2770--2776",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2006:DDC,
author = "Xiaojun Lin and Gaurav Sharma and Ravi R. Mazumdar and
Ness B. Shroff",
title = "Degenerate delay-capacity tradeoffs in ad-hoc networks
with {Brownian} mobility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2777--2784",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramamoorthy:2006:SDS,
author = "Aditya Ramamoorthy and Kamal Jain and Philip A. Chou
and Michelle Effros",
title = "Separating distributed source coding from network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2785--2795",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barbero:2006:CLT,
author = "{\'A}ngela I. Barbero and {\O}yvind Ytrehus",
title = "Cycle-logical treatment for {``Cyclopathic''}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2795--2804",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jain:2006:CMU,
author = "Kamal Jain and Vijay V. Vazirani and Gideon Yuval",
title = "On the capacity of multiple unicast sessions in
undirected graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2805--2809",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dimakis:2006:DEC,
author = "Alexandros G. Dimakis and Vinod Prabhakaran and Kannan
Ramchandran",
title = "Decentralized erasure codes for distributed networked
storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2809--2816",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cristescu:2006:LNC,
author = "Razvan Cristescu and Baltasar Beferull-Lozano",
title = "Lossy network correlated data gathering with
high-resolution coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2817--2824",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Birk:2006:CDI,
author = "Yitzhak Birk and Tomer Kol",
title = "Coding on demand by an informed source {(ISCOD)} for
efficient broadcast of different supplemental data to
caching clients",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2825--2830",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Franceschetti:2006:CNL,
author = "Massimo Franceschetti and Ronald Meester",
title = "Critical node lifetimes in random networks via the
{Chen-Stein} method",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2831--2837",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2006:COF,
author = "Cheng-Shang Chang and Yi-Ting Chen and Duan-Shin Lee",
title = "Constructions of optical {FIFO} queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "SI",
pages = "2838--2843",
month = jun,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Aug 23 09:35:00 MDT 2006",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Towsley:2006:E,
author = "Don Towsley",
title = "Editorial",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "673--673",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2006:ISIb,
author = "Ning Cai and Mung Chiang and Michelle Effros and Ralf
Koetter and Muriel M{\'e}dard and Balaji Prabhakar and
R. Srikant and Don Towsley and Raymond W. Yeung",
title = "Introduction to the special issue on networking and
information theory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "674--674",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Towsley:2006:AIT,
author = "Don Towsley",
title = "Abstracts from the {IEEE} transactions on information
theory, special issue, {June} 2006",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "675--682",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kuzmanovic:2006:LRT,
author = "Aleksandar Kuzmanovic and Edward W. Knightly",
title = "Low-rate {TCP}-targeted denial of service attacks and
counter strategies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "683--696",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Denial of Service attacks are presenting an increasing
threat to the global inter-networking infrastructure.
While TCP's congestion control algorithm is highly
robust to diverse network conditions, its implicit
assumption of end-system cooperation results in a
well-known vulnerability to attack by high-rate
non-responsive flows. In this paper, we investigate a
class of low-rate denial of service attacks which,
unlike high-rate attacks, are difficult for routers and
counter-DoS mechanisms to detect. Using a combination
of analytical modeling, simulations, and Internet
experiments, we show that maliciously chosen low-rate
DoS traffic patterns that exploit TCP's retransmission
timeout mechanism can throttle TCP flows to a small
fraction of their ideal rate while eluding detection.
Moreover, as such attacks exploit protocol homogeneity,
we study fundamental limits of the ability of a class
of randomized timeout mechanisms to thwart such
low-rate DoS attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "denial of service; retransmission timeout; TCP",
}
@Article{Duffield:2006:NLT,
author = "Nick Duffield and Francesco {Lo Presti} and Vern
Paxson and Don Towsley",
title = "Network loss tomography using striped unicast probes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "697--710",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we explore the use of end-to-end
unicast traffic as measurement probes to infer
link-level loss rates. We leverage off of earlier work
that produced efficient estimates for link-level loss
rates based on end-to-end multicast traffic
measurements. We design experiments based on the notion
of transmitting stripes of packets (with no delay
between transmission of successive packets within a
stripe) to two or more receivers. The purpose of these
stripes is to ensure that the correlation in receiver
observations matches as closely as possible what would
have been observed if a multicast probe followed the
same path to the receivers. Measurements provide good
evidence that a packet pair to distinct receivers
introduces considerable correlation which can be
further increased by simply considering longer stripes.
Using an M/M/1/K model for a link, we theoretically
confirm this benefit for stripes. We also use
simulation to explore how well these stripes translate
into accurate link-level loss estimates. We observe
good accuracy with packet pairs, with a typical error
of about 1\%, which significantly decreases as stripe
length is increased.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "correlation; end-to-end measurement; estimation;
network tomography; packet loss rates",
}
@Article{Breitgand:2006:TMP,
author = "David Breitgand and Danny Raz and Yuval Shavitt",
title = "The traveling miser problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "711--724",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Various monitoring and performance evaluation tools
generate considerable amount of low priority traffic.
This information is not always needed in real time and
often can be delayed by the network without hurting
functionality. This paper proposes a new framework to
handle this low priority, but resource consuming
traffic in such a way that it incurs a minimal
interference with the higher priority traffic.
Consequently, this improves the network goodput. The
key idea is allowing the network nodes to delay data by
locally storing it. This can be done, for example, in
the Active Network paradigm. In this paper we show that
such a model can improve the network's goodput
dramatically even if a very simple scheduling algorithm
for intermediate parking is used. The parking imposes
additional load on the intermediate nodes. To obtain
minimal cost schedules we define an optimization
problem called the traveling miser problem. We
concentrate on the on-line version of the problem for a
predefined route, and develop a number of enhanced
scheduling strategies. We study their characteristics
under different assumptions on the environment through
a rigorous simulation study. We prove that if only one
link can be congested, then our scheduling algorithm is
$ O(\log_2 B) $ competitive, where $B$ is congestion
time, and is 3-competitive, if additional signaling is
allowed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "active networks; competitive analysis; delay tolerant
networks; network management; on-line algorithms",
}
@Article{Qiu:2006:SRI,
author = "Lili Qiu and Yang Richard Yang and Yin Zhang and Scott
Shenker",
title = "On selfish routing in {Internet}-like environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "725--738",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A recent trend in routing research is to avoid
inefficiencies in network-level routing by allowing
hosts to either choose routes themselves (e.g., source
routing) or use overlay routing networks (e.g., Detour
or RON). Such approaches result in selfish routing,
because routing decisions are no longer based on
system-wide criteria but are instead designed to
optimize host-based or overlay-based metrics. A series
of theoretical results showing that selfish routing can
result in suboptimal system behavior have cast doubts
on this approach. In this paper, we use a
game-theoretic approach to investigate the performance
of selfish routing in Internet-like environments based
on realistic topologies and traffic demands in our
simulations. We show that in contrast to theoretical
worst cases, selfish routing achieves close to optimal
average latency in such environments. However, such
performance benefits come at the expense of
significantly increased congestion on certain links.
Moreover, the adaptive nature of selfish overlays can
significantly reduce the effectiveness of traffic
engineering by making network traffic less
predictable.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "game theory; optimization; overlay; relaxation;
selfish routing; traffic engineering; traffic
equilibrium",
}
@Article{Kuzmanovic:2006:TLL,
author = "Aleksandar Kuzmanovic and Edward W. Knightly",
title = "{TCP-LP}: low-priority service via end-point
congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "739--752",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Service prioritization among different traffic classes
is an important goal for the Internet. Conventional
approaches to solving this problem consider the
existing best-effort class as the low-priority class,
and attempt to develop mechanisms that provide
`better-than-best-effort' service. In this paper, we
explore the opposite approach, and devise a new
distributed algorithm to realize a low-priority service
(as compared to the existing best effort) from the
network endpoints. To this end, we develop TCP Low
Priority (TCP-LP), a distributed algorithm whose goal
is to utilize only the excess network bandwidth as
compared to the `fair share' of bandwidth as targeted
by TCP. The key mechanisms unique to TCP-LP congestion
control are the use of one-way packet delays for early
congestion indications and a TCP-transparent congestion
avoidance policy. The results of our simulation and
Internet experiments show that: (1) TCP-LP is largely
non-intrusive to TCP traffic; (2) both single and
aggregate TCP-LP flows are able to successfully utilize
excess network bandwidth; moreover, multiple TCP-LP
flows share excess bandwidth fairly; (3) substantial
amounts of excess bandwidth are available to the
low-priority class, even in the presence of `greedy'
TCP flows; (4) the response times of web connections in
the best-effort class decrease by up to 90\% when
long-lived bulk data transfers use TCP-LP rather than
TCP; (5) despite their low-priority nature, TCP-LP
flows are able to utilize significant amounts of
available bandwidth in a wide-area network
environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "available bandwidth; service prioritization; TCP;
TCP-LP; TCP-transparency",
}
@Article{Zhu:2006:PMT,
author = "Jing Zhu and Sumit Roy and Jae H. Kim",
title = "Performance modelling of {TCP} enhancements in
terrestrial-satellite hybrid networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "753--766",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we focus on the performance of TCP
enhancements for a hybrid terrestrial-satellite
network. While a large body of literature exists
regarding modeling TCP performance for the wired
Internet, and recently over a single-hop wireless link,
the literature is very sparse on TCP analysis over a
hybrid wired-wireless (multi-hop) path. We seek to make
a contribution to this problem (where the wireless
segment is a satellite uplink) by deriving analytical
estimates of TCP throughput for two widely deployed
approaches: TCP splitting and E2E (End-to-End) TCP with
link layer support as a function of key parameters such
as terrestrial/satellite propagation delay, segment
loss rate and buffer size. Our analysis is supported by
simulations; throughput comparisons indicate
superiority of TCP splitting over E2E scheme in most
cases. However, in situations where end-to-end delay is
dominated by terrestrial portion and buffering is very
limited at intermediate node, E2E achieves higher
throughput than TCP splitting.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "automatic retransmission request (ARQ); satellite
networks; TCP/IP",
}
@Article{Karsten:2006:CEI,
author = "Martin Karsten",
title = "Collected experience from implementing {RSVP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "767--778",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet quality of service (QoS) is still a highly
debated topic for more than fifteen years. Even with
the large variety of QoS proposals and the impressive
research advances, there is little deployment yet of
network layer QoS technology. One specific problem
domain is QoS signalling, which has recently attracted
increasing attention to bring forward new
standardization approaches. In this paper, an extensive
study of RSVP is presented, covering protocol design,
software design, and performance aspects of the basic
version of RSVP and of certain standardized and
experimental extensions. This work is based on and
presents the experience from implementing RSVP for UNIX
systems and the ns-2 simulation environment. The
implementation includes a variety of protocol
extensions and incorporates several internal
improvements. It has been subject to extensive
functional and performance evaluations, the results of
which are reported here.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "protocol implementation; quality of service;
signalling",
}
@Article{He:2006:IDS,
author = "Xinming He and Christos Papadopoulos and Pavlin
Radoslavov",
title = "Incremental deployment strategies for router-assisted
reliable multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "779--792",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Incremental deployment of a new network service or
protocol is typically a hard problem, especially when
it has to be deployed at the routers. First, an
incrementally deployable version of the protocol may be
needed. Second, a systematic study of the performance
impact of incremental deployment is needed to evaluate
potential deployment strategies. Choosing the wrong
strategy can be disastrous, as it may inhibit reaping
the benefits of an otherwise robust service and prevent
widespread adoption. We focus on two router-assisted
reliable multicast protocols, namely PGM and LMS. Our
evaluation consists of three parts: (1) selection and
classification of deployment strategies; (2) definition
of performance metrics; and (3) systematic evaluation
of deployment strategies. Our study yields several
interesting results: (1) the performance of different
deployment strategies varies widely, for example, with
some strategies, both PGM and LMS approach full
deployment performance with as little as 5\% of the
routers deployed; other strategies require up to 80\%
deployment to approach the same level; (2) our
sensitivity analysis reveals relatively small variation
in the results in most cases; and (3) the impact
associated with partial deployment is different for
each of these protocols; PGM tends to impact the
network, whereas LMS the endpoints. Our study clearly
demonstrates that the choice of a strategy has a
substantial impact on performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "incremental deployment; reliable multicast;
router-assisted services",
}
@Article{Kulkarni:2006:ALI,
author = "Sunil Kulkarni and Aravind Iyer and Catherine
Rosenberg",
title = "An address-light, integrated {MAC} and routing
protocol for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "793--806",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose an address-light, integrated MAC and
routing protocol (abbreviated AIMRP) for wireless
sensor networks (WSNs). Due to the broad spectrum of
WSN applications, there is a need for protocol
solutions optimized for specific application classes.
AIMRP is proposed for WSNs deployed for detecting rare
events which require prompt detection and response.
AIMRP organizes the network into concentric tiers
around the sink(s), and routes event reports by
forwarding them from one tier to another, in the
direction of (one of) the sink(s). AIMRP is
address-light in that it does not employ unique
per-node addressing, and integrated since the MAC
control packets are also responsible for finding the
next-hop node to relay the data, via an anycast query.
For reducing the energy expenditure due to
idle-listening, AIMRP provides a power-saving algorithm
which requires absolutely no synchronization or
information exchange. We evaluate AIMRP through
analysis and simulations, and compare it with another
MAC protocol proposed for WSNs, S-MAC. AIMRP
outperforms S-MAC for event-detection applications, in
terms of total average power consumption, while
satisfying identical sensor-to-sink latency
constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "addressing; anycast routing; cross-layer integration;
MAC; power-saving mode; rare event detection; sensor
networks",
}
@Article{Chou:2006:UNP,
author = "Zi-Tsan Chou and Ching-Chi Hsu and Shin-Neng Hsu",
title = "{UPCF}: a new point coordination function with {QoS}
and power management for multimedia over wireless
{LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "807--820",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a new novel polling-based
medium access control protocol, named UPCF (Unified
Point Coordination Function), to provide power
conservation and quality-of-service (QoS) guarantees
for multimedia applications over wireless local area
networks. Specifically, UPCF has the following
attractive features. First, it supports multiple
priority levels and guarantees that high-priority
stations always join the polling list earlier than
low-priority stations. Second, it provides fast
reservation scheme such that associated stations with
real-time traffic can get on the polling list in
bounded time. Third, it employs dynamic channel time
allocation scheme to support CBR/VBR transportation and
provide per-flow probabilistic bandwidth assurance.
Fourth, it employs the power management techniques to
let mobile stations save as much energy as possible.
Fifth, it adopts the mobile-assisted admission control
technique such that the point coordinator can admit as
many newly flows as possible while not violating QoS
guarantees made to already-admitted flows. The
performance of UPCF is evaluated through both analysis
and simulations. Simulation results do confirm that, as
compared with the PCF in IEEE 802.11, UPCF not only
provides higher goodput and energy throughput, but also
achieves lower power consumption and frame loss due to
delay expiry. Last but not least, we expect that UPCF
can pass the current Wi-Fi certification and may
coexist with the upcoming IEEE 802.11e standard.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IEEE 802.11; medium access control (MAC); multimedia;
point coordination function (PCF); power management;
quality of service (QoS)",
}
@Article{Tsaur:2006:CLA,
author = "Lih-feng Tsaur and Daniel C. Lee",
title = "Closed-loop architecture and protocols for rapid
dynamic spreading gain adaptation in {CDMA} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "821--834",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a closed-loop architecture and protocols
for rapid dynamic spreading gain adaptation and fast
feedback between a transmitter and a receiver
communicating with each other in CDMA networks. These
protocols and architecture do not require the transfer
of an explicit control message indicating the change of
CDMA spreading gain from transmitter to receiver. Also,
with these protocols, the transmitter can change the
spreading gain symbol-by-symbol as opposed to
frame-by-frame, and feedback information (e.g., the
fast-varying channel condition) can be exchanged almost
as frequently as the symbol rate. Thus, adaptation to
the time-varying channel conditions of wireless
networks and/or to the rate variation of traffic can be
much faster than is possible with the existing
frame-by-frame approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CDMA; OVSF codes; rate adaptation",
}
@Article{Chaporkar:2006:DQP,
author = "Prasanna Chaporkar and Saswati Sarkar and Rahul
Shetty",
title = "Dynamic quorum policy for maximizing throughput in
limited information multiparty {MAC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "835--848",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In multiparty MAC, a sender needs to transmit each
packet to a set of receivers within its transmission
range. Bandwidth efficiency of wireless multiparty MAC
can be improved substantially by exploiting the fact
that several receivers can be reached at the MAC layer
by a single transmission. Multiparty communication,
however, requires new design paradigms since systematic
design techniques that have been used effectively in
unicast and wireline multicast do not apply. For
example, a transmission policy that maximizes the
stability region of the network need not maximize the
network throughput. Therefore, the objective is to
design a policy that maximizes the system throughput
subject to maintaining stability. We present a
sufficient condition that can be used to establish the
throughput optimality of a stable transmission policy.
We subsequently design a distributed adaptive stable
policy that allows a sender to decide when to transmit
using simple computations. The computations are based
only on limited information about current transmissions
in the sender's neighborhood. Even though the proposed
policy does not use any network statistics, it attains
the same throughput as an optimal offline stable policy
that uses in its decision process past, present, and
even future network states. We prove the throughput
optimality of this policy using the sufficient
condition and the large deviation results. We present a
MAC protocol for acquiring the local information
necessary for executing this policy, and implement it
in ns-2. The performance evaluations demonstrate that
the optimal policy significantly outperforms the
existing multiparty schemes in ad hoc networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MAC layer scheduling; stability; throughput optimal
policy; wireless multicast",
}
@Article{Bejerano:2006:MFF,
author = "Yigal Bejerano and Randeep S. Bhatia",
title = "{MiFi}: a framework for fairness and {QoS} assurance
for current {IEEE} 802.11 networks with multiple access
points",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "849--862",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a framework for providing
fair service and supporting quality of service (QoS)
requirements in IEEE 802.11 networks with multiple
access points (APs). These issues becomes critical as
IEEE 802.11 wireless LAN are widely deployed in
nationwide networks, linking tens of thousands of
`hotspots' for providing both real-time (voice) and non
real-time (data) services to a large population of
mobile users. However, both fairness and QoS guarantees
cannot be supported in the current 802.11 standard. Our
system, termed MiFi, relies on centralized coordination
of the APs. During any given time of the
`contention-free' period only a set of non-interfering
APs is activated while the others are silenced.
Moreover, the amount of service granted to an AP is
proportional to its load and the system's performance
is optimized by employing efficient scheduling
algorithms. We show that such a system can be
implemented without requiring any modification of the
underlying MAC protocol standard or the behavior of the
mobile stations. Our scheme is complementary to the
emerging 802.11e standard for QoS and guarantees to
overcome the hidden node and the overlapping cell
problems. Our simulations establish that the system
supports fairness and hence can provide QoS guarantees
for real-time traffic, while maintaining a relative
high throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; fairness; IEEE 802.11;
quality of service (QoS); wireless LAN",
}
@Article{Zheng:2006:TBD,
author = "Kai Zheng and Chengchen Hu and Hongbin Lu and Bin
Liu",
title = "A {TCAM}-based distributed parallel {IP} lookup scheme
and performance analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "863--875",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Using ternary content addressable memory (TCAM) for
high-speed IP address lookup has been gaining
popularity due to its deterministic high performance.
However, restricted by the slow improvement of memory
accessing speed, the route lookup engines for
next-generation terabit routers demand exploiting
parallelism among multiple TCAM chips. Traditional
parallel methods always incur excessive redundancy and
high power consumption. We propose in this paper an
original TCAM-based IP lookup scheme that achieves both
ultra-high lookup throughput and optimal utilization of
the memory while being power-efficient. In our
multi-chip scheme, we devise a load-balanced TCAM table
construction algorithm together with an adaptive load
balancing mechanism. The power efficiency is well
controlled by decreasing the number of TCAM entries
triggered in each lookup operation. Using four 133 MHz
TCAM chips and given 25\% more TCAM entries than the
original route table, the proposed scheme achieves a
lookup throughput of up to 533 MPPS while remains
simple for ASIC implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IP; power consumption; route lookup; TCAM;
throughput",
}
@Article{Gurewitz:2006:NCT,
author = "Omer Gurewitz and Israel Cidon and Moshe Sidi",
title = "Network classless time protocol based on clock offset
optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "876--888",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Time synchronization is critical in distributed
environments. A variety of network protocols,
middleware and business applications rely on proper
time synchronization across the computational
infrastructure and depend on the clock accuracy. The
Network Time Protocol (NTP) is the current widely
accepted standard for synchronizing clocks over the
Internet. NTP uses a hierarchical scheme in order to
synchronize the clocks in the network. In this paper we
present a novel non-hierarchical peer-to-peer approach
for time synchronization termed CTP--Classless Time
Protocol. This approach exploits convex optimization
theory in order to evaluate the impact of each clock
offset on the overall objective function. We define the
clock offset problem as an optimization problem and
derive its optimal solution. Based on the solution we
develop a distributed protocol that can be implemented
over a communication network, prove its convergence to
the optimal clock offsets and show its properties. For
compatibility, CTP may use the packet format and number
of measurements used by NTP. We also present
methodology and numerical results for evaluating and
comparing the accuracy of time synchronization schemes.
We show that the CTP outperforms hierarchical schemes
such as NTP in the sense of clock accuracy with respect
to a universal clock.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "classless time protocol (CTP); estimation;
measurements; network management; one-way delay; time
synchronization; UTC",
}
@Article{Naser:2006:JOI,
author = "Hassan Naser and Hussein T. Mouftah",
title = "A joint-{ONU} interval-based dynamic scheduling
algorithm for {Ethernet} passive optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "889--899",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a new dynamic bandwidth allocation
system for Ethernet Passive Optical Networks (EPONs),
subject to requirements of fairness, efficiency, and
cost. An Optical Line Terminal (OLT)-centric bandwidth
allocation model is proposed which employs a credit
pooling technique combined with a weighted-share policy
to partition the upstream bandwidth among different
classes of service, and to prevent Optical Network
Units (ONUs) from monopolizing the bandwidth. The
OLT-centric model allows global optimization of network
resources, a characteristic which is not found in many
earlier proposals. Supported by the new bandwidth
allocation, the paper proposes a joint-ONU
interval-based packet scheduling algorithm, referred to
herein as COPS (Class-of-service Oriented Packet
Scheduling), that meets the requirements set out above.
We compare COPS with another well-known scheduling
algorithm which employed a standard priority-based
bandwidth sharing. We show that COPS is superior in
terms of network utilization and maximum packet delay,
with the consequence of an increase in average packet
delay for the premium traffic. This drawback is
overcome by combining COPS with a rate-based
optimization scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication protocols; network architecture and
design; network technologies",
}
@Article{Awduche:2006:DAC,
author = "Daniel O. Awduche and Bijan Jabbari",
title = "Demand assigned capacity management {(DACM)} in {IP}
over optical {(IPO)} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "900--913",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The demand assigned capacity management (DACM) problem
in IP over optical (IPO) network aims at devising
efficient bandwidth replenishment schedules from the
optical domain conditioned upon traffic evolution
processes in the IP domain. A replenishment schedule
specifies the location, sizing, and sequencing of link
capacity expansions to support the growth of Internet
traffic demand in the IP network subject to economic
considerations. A major distinction in the approach
presented in this paper is the focus of attention on
the economics of `excess bandwidth' in the IP domain,
which can be viewed as an inventory system that is
endowed with fixed and variable costs and depletes with
increase in IP traffic demand requiring replenishment
from the optical domain. We develop mathematical models
to address the DACM problem in IPO networks based on a
class of inventory management replenishment methods. We
apply the technique to IPO networks that implement
capacity adaptive routing in the IP domain and networks
without capacity adaptive routing. We analyze the
performance characteristics under both scenarios, in
terms of minimizing cumulative replenishment cost over
an interval of time. For the non-capacity adaptive
routing scenario, we consider a shortest path approach
in the IP domain, specifically OSPF. For the capacity
adaptive scenario, we use an online constraint-based
routing scheme. This study represents an application of
integrated traffic engineering which concerns
collaborative decision making targeted towards network
performance improvement that takes into consideration
traffic demands, control capabilities, and network
assets at different levels in the network hierarchy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ASON; bandwidth replenishment; capacity management;
demand assigned capacity management; GMPLS; integrated
traffic engineering; inventory management; IP over
optical; IPO; MPLS; network performance optimization;
networks; traffic engineering",
}
@Article{Liang:2006:GAA,
author = "Weifa Liang and Xiaojun Shen",
title = "A general approach for all-to-all routing in multihop
{WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "4",
pages = "914--923",
month = aug,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:51:36 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "WDM optical networks provide unprecedented high speed
and reliability for message transfer among the nodes.
All-to-all routing is a fundamental routing problem in
such networks and has been well studied on single hop
WDM networks. However, the number of wavelengths to
realize all-to-all routing on the single hop model
typically is very large. One way to reduce the number
of wavelengths is to use $k$-hop routing, in which each
routing path consists of $k$ segments and each segment
is assigned a different wavelength, where $k$ usually
is a small constant. Because of the complexity of
design and analysis for such a routing problem, only
few papers discussed and proposed all-to-all routing by
$ k \geq 2$ hops. However, the proposed algorithms are
usually exceeding complicated even for ring topologies.
Often, an ad hoc approach is employed to deal with each
individual topology. In this paper we propose a generic
method for all-to-all routing in multi-hop WDM
networks, which aims to minimize the number of
wavelengths. We illustrate the approach for several
optical networks of commonly used topology, including
lines, rings, tori, meshes, and complete binary trees.
For each case an upper bound on the number of
wavelengths is obtained. The results show that this
approach produces clear routing paths, requires less
wavelengths, and can easily incorporate load balancing.
For simple topologies such as lines and rings, this
approach easily produces the same bounds on the number
of wavelengths that were hard-obtained previously.
Moreover, this general approach provides a unified
routing algorithm for any $d$-dimensional torus, which
seems impossible to obtain by the previous approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-to-all routing; gossiping; multihop routing
algorithms; network design; optical networks; robust
routing protocol; WDM routing",
}
@Article{Estan:2006:BAC,
author = "Cristian Estan and George Varghese and Michael Fisk",
title = "Bitmap algorithms for counting active flows on
high-speed links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "925--937",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a family of bitmap algorithms that
address the problem of counting the number of distinct
header patterns (flows) seen on a high-speed link. Such
counting can be used to detect DoS attacks and port
scans and to solve measurement problems. Counting is
especially hard when processing must be done within a
packet arrival time (8 ns at OC-768 speeds) and, hence,
may perform only a small number of accesses to limited,
fast memory. A naive solution that maintains a hash
table requires several megabytes because the number of
flows can be above a million. By contrast, our new
probabilistic algorithms use little memory and are
fast. The reduction in memory is particularly important
for applications that run multiple concurrent counting
instances. For example, we replaced the port-scan
detection component of the popular intrusion detection
system Snort with one of our new algorithms. This
reduced memory usage on a ten minute trace from 50 to
5.6 MB while maintaining a 99.77\% probability of
alarming on a scan within 6s of when the large-memory
algorithm would. The best known prior algorithm
(probabilistic counting) takes four times more memory
on port scan detection and eight times more on a
measurement application. This is possible because our
algorithms can be customized to take advantage of
special features such as a large number of instances
that have very small counts or prior knowledge of the
likely range of the count.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "counting distinct elements; traffic measurements",
}
@Article{Yi:2006:TSD,
author = "Yung Yi and Supratim Deb and Sanjay Shakkottai",
title = "Time-scale decomposition and equivalent rate-based
marking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "938--950",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Differential equation models for Internet congestion
control algorithms have been widely used to understand
network dynamics and the design of router algorithms.
These models use a fluid approximation for user data
traffic and describe the dynamics of the router queue
and user adaptation through coupled differential
equations. The interaction between the routers and
flows occurs through marking, where routers indicate
congestion by appropriately marking packets during
congestion. In this paper, we show that the randomness
due to short and unresponsive flows in the Internet is
sufficient to decouple the dynamics of the router
queues from those of the end controllers. This implies
that a time-scale decomposition naturally occurs such
that the dynamics of the router manifest only through
their statistical steady-state behavior. We show that
this time-scale decomposition implies that a
queue-length based marking function (e.g., RED-like and
REM-like algorithms, which have no queue averaging, but
depend only on the instantaneous queue length) has an
equivalent form which depends only on the data arrival
rate from the end-systems and does not depend on the
queue dynamics. This leads to much simpler dynamics of
the differential equation models (there is no queueing
dynamics to consider), which enables easier analysis
and could be potentially used for low-complexity fast
simulation. Using packet-based simulations, we study
queue-based marking schemes and their equivalent
rate-based marking schemes for different types of
controlled sources (i.e., proportional fair and TCP)
and queue-based marking schemes. Our results indicate a
good match in the rates observed at the intermediate
router with the queue-based marking function and the
corresponding rate-based approximation. Further, the
window size distributions of a typical TCP flow with a
queue-based marking function as well as the equivalent
rate-based marking function match closely, indicating
that replacing a queue-based marking function by its
equivalent rate-based function does not statistically
affect the end host's behavior.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet congestion control; marking functions;
time-scale decomposition",
}
@Article{Iyengar:2006:CMT,
author = "Janardhan R. Iyengar and Paul D. Amer and Randall
Stewart",
title = "Concurrent multipath transfer using {SCTP} multihoming
over independent end-to-end paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "951--964",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Concurrent multipath transfer (CMT) uses the Stream
Control Transmission Protocol's (SCTP) multihoming
feature to distribute data across multiple end-to-end
paths in a multihomed SCTP association. We identify
three negative side-effects of reordering introduced by
CMT that must be managed before efficient parallel
transfer can be achieved: (1) unnecessary fast
retransmissions by a sender; (2) overly conservative
congestion window (cwnd) growth at a sender; and (3)
increased ack traffic due to fewer delayed acks by a
receiver. We propose three algorithms which augment
and/or modify current SCTP to counter these
side-effects. Presented with several choices as to
where a sender should direct retransmissions of lost
data, we propose five retransmission policies for CMT.
We demonstrate spurious retransmissions in CMT with all
five policies and propose changes to CMT to allow the
different policies. CMT is evaluated against AppStripe,
which is an idealized application that stripes data
over multiple paths using multiple SCTP associations.
The different CMT retransmission policies are then
evaluated with varied constrained receive buffer sizes.
In this foundation work, we operate under the strong
assumption that the bottleneck queues on the end-to-end
paths used in CMT are independent.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "end-to-end; load balancing; load sharing; multipath;
SCTP; transport layer",
}
@Article{Huang:2006:SER,
author = "Yaqing Huang and Roch Gu{\'e}rin and Pranav Gupta",
title = "Supporting excess real-time traffic with active drop
queue",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "965--977",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Real-time applications often stand to benefit from
service guarantees, and in particular delay guarantees.
However, most mechanisms that provide delay guarantees
also hard-limit the amount of traffic the application
can generate, i.e., to enforce to a traffic contract.
This can be a significant constraint and interfere with
the operation of many real-time applications. Our
purpose in this paper is to propose and investigate
solutions that overcome this limitation. We have four
major goals: (1) guarantee a delay bound to a
contracted amount of real-time traffic; (2) transmit
with the same delay bound as many excess real-time
packets as possible; (3) enforce a given link sharing
ratio between excess real-time traffic and other
service classes, e.g., best-effort; and (4) preserve
the ordering of real-time packets, if required. Our
approach is based on a combination of buffer management
and scheduling mechanisms for both guaranteeing delay
bounds, while allowing the transmission of excess
traffic. We evaluate the `cost' of our scheme by
measuring the processing overhead of an actual
implementation, and we investigate its performance by
means of simulations using video traffic traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "quality-of-service (QoS); queue management; real-time
application; service guarantee",
}
@Article{Ma:2006:ISD,
author = "Richard T. B. Ma and Sam C. M. Lee and John C. S. Lui
and David K. Y. Yau",
title = "Incentive and service differentiation in {P2P}
networks: a game theoretic approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "978--991",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Conventional peer-to-peer (P2P) networks do not
provide service differentiation and incentive for
users. Therefore, users can easily obtain information
without themselves contributing any information or
service to a P2P community. This leads to the well
known free-riding problem. Consequently, most of the
information requests are directed towards a small
number of P2P nodes which are willing to share
information or provide service, causing the `tragedy of
the commons.' The aim of this paper is to provide
service differentiation in a P2P network based on the
amount of services each node has provided to the
network community. Since the differentiation is based
on nodes' prior contributions, the nodes are encouraged
to share information/services with each other. We first
introduce a resource distribution mechanism for all the
information sharing nodes. The mechanism is distributed
in nature, has linear time complexity, and guarantees
Pareto-optimal resource allocation. Second, we model
the whole resource request/distribution process as a
competition game between the competing nodes. We show
that this game has a Nash equilibrium. To realize the
game, we propose a protocol in which the competing
nodes can interact with the information providing node
to reach Nash equilibrium efficiently and dynamically.
We also present a generalized incentive mechanism for
nodes having heterogeneous utility functions.
Convergence analysis of the competition game is carried
out. Examples are used to illustrate that the incentive
protocol provides service differentiation and can
induce productive resource sharing by rational network
nodes. Lastly, the incentive protocol is adaptive to
node arrival and departure events, and to different
forms of network congestion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "contribution-based service differentiation; game
theory; incentive protocol; peer-to-peer network",
}
@Article{Maille:2006:PIM,
author = "Patrick Maill{\'e} and Bruno Tuffin",
title = "Pricing the {Internet} with multibid auctions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "992--1004",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Usage-based or congestion-based charging schemes have
been regarded as a relevant way to control congestion
and to differentiate services among users in
telecommunication networks; auctioning for bandwidth
appears as one of several possibilities. In a previous
work, the authors designed a multibid auction scheme
where users compete for bandwidth at a link by
submitting several couples (e.g., amount of bandwidth
asked, associated unit price) so that the link
allocates the bandwidth and computes the charge
according to the second price principle. They showed
that incentive compatibility and efficiency among other
properties are verified. We propose in the present
paper to extend this scheme to the case of a network by
using the properties/ assumptions that the backbone
network is overprovisioned and the access networks have
a tree structure.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "control theory; economics",
}
@Article{Ribeiro:2006:MQA,
author = "Vinay J. Ribeiro and Rudolf H. Riedi and Richard G.
Baraniuk",
title = "Multiscale queueing analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1005--1018",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a new multiscale framework for
estimating the tail probability of a queue fed by an
arbitrary traffic process. Using traffic statistics at
a small number of time scales, our analysis extends the
theoretical concept of the critical time scale and
provides practical approximations for the tail queue
probability. These approximations are non-asymptotic;
that is, they apply to any finite queue threshold.
While our approach applies to any traffic process, it
is particularly apt for long-range-dependent (LRD)
traffic. For LRD fractional Brownian motion, we prove
that a sparse exponential spacing of time scales yields
optimal performance. Simulations with LRD traffic
models and real Internet traces demonstrate the
accuracy of the approach. Finally, simulations reveal
that the marginals of traffic at multiple time scales
have a strong influence on queueing that is not
captured well by its global second-order correlation in
non-Gaussian scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "admission control; critical time scale; fractional
Brownian motion; long-range dependence; marginals;
multifractals; multiscale; network provisioning;
queueing; wavelets",
}
@Article{Celandroni:2006:LLT,
author = "Nedo Celandroni and Franco Davoli and Erina Ferro and
Alberto Gotta",
title = "Long-lived {TCP} connections via satellite:
cross-layer bandwidth allocation, pricing, and adaptive
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1019--1030",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The paper focuses on the assignment of a common
bandwidth resource to TCP connections over a satellite
channel. The connections are grouped according to their
source-destination pairs, which correspond to the up-
and down-link channels traversed, and each group may
experience different fading conditions. By exploiting
the tradeoff between bandwidth and channel redundancy
(as determined by bit and coding rates) in the
maximization of TCP goodput, an overall optimization
problem is constructed, which can be solved by
numerical techniques. Different relations between
goodput maximization and fairness of the allocations
are investigated, and a possible pricing scheme is
proposed. The allocation strategies are tested and
compared in a fading environment, first under static
conditions, and then in a real dynamic scenario. The
goodput-fairness optimization allows significant gains
over bandwidth allocations only aimed at keeping the
channel bit error rate below a given threshold in all
fading conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optimization; resource allocation; satellite networks;
TCP connections",
}
@Article{Taleb:2006:REF,
author = "Tarik Taleb and Nei Kato and Yoshiaki Nemoto",
title = "{REFWA}: an efficient and fair congestion control
scheme for {LEO} satellite networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1031--1044",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper examines some issues that affect the
efficiency and fairness of the Transmission Control
Protocol (TCP), the backbone of Internet protocol
communication, in multihops satellite network systems.
It proposes a scheme that allows satellite systems to
automatically adapt to any change in the number of
active TCP flows due to handover occurrence, the free
buffer size, and the bandwidth-delay product of the
network. The proposed scheme has two major design
goals: increasing the system efficiency, and improving
its fairness. The system efficiency is controlled by
matching the aggregate traffic rate to the sum of the
link capacity and total buffer size. On the other hand,
the system min-max fairness is achieved by allocating
bandwidth among individual flows in proportion with
their RTTs. The proposed scheme is dubbed Recursive,
Explicit, and Fair Window Adjustment (REFWA).Simulation
results elucidate that the REFWA scheme substantially
improves the system fairness, reduces the number of
packet drops, and makes better utilization of the
bottleneck link. The results demonstrate also that the
proposed scheme works properly in more complicated
environments where connections traverse multiple
bottlenecks and the available bandwidth may change over
data transmission time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; fairness; receiver's advertised
window adjustment; satellite networks; TCP",
}
@Article{Nuggehalli:2006:ECP,
author = "Pavan Nuggehalli and Vikram Srinivasan and
Carla-Fabiana Chiasserini and Ramesh R. Rao",
title = "Efficient cache placement in multi-hop wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1045--1055",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we address the problem of efficient
cache placement in multi-hop wireless networks. We
consider a network comprising a server with an
interface to the wired network, and other nodes
requiring access to the information stored at the
server. In order to reduce access latency in such a
communication environment, an effective strategy is
caching the server information at some of the nodes
distributed across the network. Caching, however, can
imply a considerable overhead cost; for instance,
disseminating information incurs additional energy as
well as bandwidth burden. Since wireless systems are
plagued by scarcity of available energy and bandwidth,
we need to design caching strategies that optimally
trade-off between overhead cost and access latency. We
pose our problem as an integer linear program. We show
that this problem is the same as a special case of the
connected facility location problem, which is known to
be NP-hard. We devise a polynomial time algorithm which
provides a suboptimal solution. The proposed algorithm
applies to any arbitrary network topology and can be
implemented in a distributed and asynchronous manner.
In the case of a tree topology, our algorithm gives the
optimal solution. In the case of an arbitrary topology,
it finds a feasible solution with an objective function
value within a factor of 6 of the optimal value. This
performance is very close to the best approximate
solution known today, which is obtained in a
centralized manner. We compare the performance of our
algorithm against three candidate cache placement
schemes, and show via extensive simulation that our
algorithm consistently outperforms these alternative
schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "heuristic optimization; web cache placement; wireless
multi-hop networks",
}
@Article{Koutsopoulos:2006:CLA,
author = "Iordanis Koutsopoulos and Leandros Tassiulas",
title = "Cross-layer adaptive techniques for throughput
enhancement in wireless {OFDM}-based networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1056--1066",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although independent consideration of layers
simplifies wireless system design, it is inadequate
since: (1) it does not consider the effect of
co-channel user interference on higher layers; (2) it
does not address the impact of local adaptation actions
on overall performance; and (3) it attempts to optimize
performance at one layer while keeping parameters of
other layers fixed. Cross-layer adaptation techniques
spanning several layers improve performance and provide
better quality of service for users across layers. In
this study, we consider a synergy between the physical
and access layers and address the joint problem of
channel allocation, modulation level, and power control
in a multicell network. Since performance is determined
by channel reuse, it is important to handle co-channel
interference appropriately by constructing co-channel
user sets and by assigning transmission parameters so
that achievable system rate is maximized. The problem
is considered for orthogonal frequency-division
multiplexing, which introduces novel challenges to
resource allocation due to different quality of
subcarriers for users and existing transmit power
constraints. We study the structure of the problem and
present two classes of centralized heuristic
algorithms. The first one considers each subcarrier
separately and sequentially allocates users from
different base stations in the subcarrier based on
different criteria, while the second is based on
water-filling across subcarriers in each cell. Our
results show that the first class of heuristics
performs better and quantify the impact of different
parameters on system performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-layer design; multicell systems; orthogonal
frequency-division multiplexing (OFDM); resource
allocation",
}
@Article{Andrews:2006:SNW,
author = "Matthew Andrews and Lisa Zhang",
title = "Scheduling over nonstationary wireless channels with
finite rate sets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1067--1077",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a wireless basestation transmitting
high-speed data to multiple mobile users in a cell. The
channel conditions between the basestation and the
users are time-varying and user-dependent. Our
objective is to design a scheduler that determines
which user to schedule at each time step. Previous work
on this problem has typically assumed that the channel
conditions are governed by a stationary stochastic
process. In this setting, a popular algorithm known as
Max-Weight has been shown to have good performance.
However, the stationarity assumption is not always
reasonable. In this paper, we study a more general
worst-case model in which the channel conditions are
governed by an adversary and are not necessarily
stationary. In this model, we show that the
nonstationarities can cause Max-Weight to have
extremely poor performance. In particular, even if the
set of possible transmission rates is finite, as in the
CDMA 1xEV-DO system, Max-Weight can produce queue sizes
that are exponential in the number of users. On the
positive side, we describe a set of tracking algorithms
that aim to track the performance of a schedule
maintained by the adversary. For one of these tracking
algorithms, the queue sizes are only quadratic. We
discuss a number of practical issues associated with
the tracking algorithms. We also illustrate the
performance of Max-Weight and the tracking algorithms
using simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "nonstationary channel rates; wireless scheduling",
}
@Article{Soh:2006:PBR,
author = "Wee-Seng Soh and Hyong S. Kim",
title = "A predictive bandwidth reservation scheme using mobile
positioning and road topology information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1078--1091",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cellular networks, an important practical issue is
how to limit the handoff dropping probability
efficiently. One possible approach is to perform
dynamic bandwidth reservation based on mobility
predictions. With the rapid advances in mobile
positioning technology, and the widespread availability
of digital road maps previously designed for
navigational devices, we propose a predictive bandwidth
reservation scheme built upon these timely
opportunities. In contrast to the common practice of
utilizing only incoming handoff predictions at each
cell to compute the reservations, our scheme is more
efficient as it innovatively utilizes both incoming and
outgoing handoff predictions; it can meet the same
target handoff dropping probability by blocking fewer
new calls. The individual base stations are responsible
for the computations, which are shown to be simple
enough to be performed in real-time. We evaluate the
scheme via simulation, along with five other schemes
for comparison. Simulation results show that those
schemes that rely on positioning information are
significantly more efficient than those that do not.
Our scheme's additional use of the road topology
information further improves upon this advantage,
bringing the efficiency closer to the bound set by a
benchmark scheme that assumes perfect knowledge about
future handoffs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "call admission control; handoff prioritization; mobile
positioning; mobility prediction",
}
@Article{Bejerano:2006:RML,
author = "Yigal Bejerano and Rajeev Rastogi",
title = "Robust monitoring of link delays and faults in {IP}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1092--1103",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we develop failure-resilient techniques
for monitoring link delays and faults in a Service
Provider or Enterprise IP network. Our two-phased
approach attempts to minimize both the monitoring
infrastructure costs as well as the additional traffic
due to probe messages. In the first phase, we compute
the locations of a minimal set of monitoring stations
such that all network links are covered, even in the
presence of several link failures. Subsequently, in the
second phase, we compute a minimal set of probe
messages that are transmitted by the stations to
measure link delays and isolate network faults. We show
that both the station selection problem as well as the
probe assignment problem are NP-hard. We then propose
greedy approximation algorithms that achieve a
logarithmic approximation factor for the station
selection problem and a constant factor for the probe
assignment problem. These approximation ratios are
provably very close to the best possible bounds for any
algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; latency and fault
monitoring; network failures; set cover problem",
}
@Article{Singhal:2006:OMM,
author = "Narendra K. Singhal and Laxman H. Sahasrabuddhe and
Biswanath Mukherjee",
title = "Optimal multicasting of multiple light-trees of
different bandwidth granularities in a {WDM} mesh
network with sparse splitting capabilities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1104--1117",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the advent of next-generation,
bandwidth-intensive multimedia applications such as
HDTV, interactive distance learning, and movie
broadcasts from studios, it is becoming imperative to
exploit the enormous bandwidth promised by the rapidly
growing wavelength-division-multiplexing (WDM)
technology. These applications require multicasting of
information from a source to several destination nodes
which should be performed judiciously to conserve
expensive network resources. In this study, we
investigate two switch architectures to support
multicasting in a WDM network: one using an opaque
(optical-electronic-optical) approach and the other
using a transparent (all-optical) approach. For both
these switch architectures, we present mathematical
formulations for routing and wavelength assignment of
several light-tree-based multicast sessions on a given
network topology at a globally optimal cost. We expand
our work to also accommodate: (1) fractional-capacity
sessions (where a session's capacity is a fraction of a
wavelength channel's bandwidth, thereby leading to
`traffic-groomed' multicast sessions) and (2) sparse
splitting constraints, i.e., limited fanout of optical
splitters and limited number of such splitters at each
node. We illustrate the solutions obtained on different
networks by solving these optimization problems, which
turn out to be mixed integer linear programs (MILPs).
Because the MILP is computationally intensive and does
not scale well for large problem sizes, we also propose
fast heuristics for establishing a set of multicast
sessions in a network with or without wavelength
converters and with fractional-capacity sessions. We
find that, for all scenarios, the heuristics which
arrange the sessions in ascending order with respect to
destination set size and/or cost perform better in
terms of network resource usage than the heuristics
which arrange the sessions in descending order.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "grooming; light-tree; lightpath; mesh network; mixed
integer linear program (MILP); multicasting; optical
crossconnect; optical crossconnect (OXC); optical
network; optimization; splitter fanout;
wavelength-division multiplexing (WDM)",
}
@Article{Rosberg:2006:AON,
author = "Zvi Rosberg and Andrew Zalesky and Hai L. Vu and Moshe
Zukerman",
title = "Analysis of {OBS} networks with limited wavelength
conversion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1118--1127",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Presented herein is a scalable framework for
estimating path blocking probabilities in optical burst
switched (OBS) networks where limited wavelength
conversion is possible. Although presented under the
guise of OBS, it is pertinent to a broader class of
optical networks based on the principle of bufferless
unacknowledged switching. By applying the framework to
the NSFNET topology, it is shown that even the most
limited conversion range may reduce path blocking
probabilities by several orders of magnitude, compared
with no wavelength conversion. Moreover, contrary to
previous results derived for all-optical non-OBS
networks with acknowledgement, OBS with full wavelength
conversion achieves significantly lower blocking
probabilities than OBS with limited wavelength
conversion when the conversion range is small.
Underpinning the framework is a generalization of the
classical reduced load approximation. Assuming links
evolve independently of each other allows decoupling of
the network into its constituent links. A set of
fixed-point equations describing the evolution of each
conversion range are then solved by successive
substitution to estimate link blocking probabilities.
Having these link blocking probabilities, path blocking
probabilities are evaluated. The complexity of the
framework is dominated by the wavelength conversion
range and is independent of the number of wavelengths
per link under certain symmetry conditions. Both
just-in-time (JIT) and just-enough-time (JET)
scheduling are considered. Simulations are implemented
to corroborate the accuracy of the framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical network; blocking probability; limited
wavelength conversion; optical burst switching; reduced
load approximation",
}
@Article{Mao:2006:JDJ,
author = "Yinian Mao and Yan Sun and Min Wu and K. J. Ray Liu",
title = "{JET}: dynamic join-exit-tree amortization and
scheduling for contributory key management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1128--1140",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In secure group communications, the time cost
associated with key updates in the events of member
join and departure is an important aspect of quality of
service, especially in large groups with highly dynamic
membership. To achieve better time efficiency, we
propose a join-exit-tree (JET) key management
framework. First, a special key tree topology with join
and exit subtrees is introduced to handle key updates
for dynamic membership. Then, optimization techniques
are employed to determine the capacities of join and
exit subtrees for achieving the best time efficiency,
and algorithms are designed to dynamically update the
join and exit trees. We show that, on average, the
asymptotic time cost for each member join\slash
departure event is reduced to $ O(\log (\log n)) $ from
the previous cost of $ O(\log n) $, where $n$ is the
group size. Our experimental results based on simulated
user activities as well as the real MBone data
demonstrate that the proposed JET scheme can
significantly improve the time efficiency, while
maintaining low communication and computation cost, of
tree-based contributory key management.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "contributory key management; dynamic tree topology;
secure group communications; time efficiency",
}
@Article{Hwang:2006:NRN,
author = "Frank K. Hwang and Wen-Dar Lin and Vadim Lioubimov",
title = "On noninterruptive rearrangeable networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1141--1149",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study a new class of nonblocking
networks called noninterruptive rearrangeable (NIR)
networks, which are rearrangeable under the additional
condition that existing connections are not interrupted
while their paths being possibly rerouted to
accommodate a new request. We give a complete
characterization of NIR Clos networks built of
switching elements of various nonblocking properties.
In particular, we propose a novel class of NIR Clos
networks that leads to recursive constructions of
various cost-efficient multistage NIR networks.
Finally, we present examples of such constructions and
compare them with the best previously known results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "clos network; doubled path; noninterruptive
rearrangeable (NIR); output (input)-divertability;
Paull's matrix; rearrangeably nonblocking (RNB);
strictly nonblocking (SNB); wide-sense nonblocking
(WSNB)",
}
@Article{Barrenetxea:2006:CLN,
author = "Guillermo Barrenetxea and Baltasar Beferull-Lozano and
Martin Vetterli",
title = "Correction to {`Lattice networks: Capacity limits,
optimal routing, and queueing behavior'}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "5",
pages = "1150--1150",
month = oct,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:52:20 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Barrenetxea:2006:LNC}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{LeBoudec:2006:RTM,
author = "Jean-Yves {Le Boudec} and Milan Vojnovic",
title = "The random trip model: stability, stationary regime,
and perfect simulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1153--1166",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We define `random trip', a generic mobility model for
random, independent node motions, which contains as
special cases: the random waypoint on convex or
nonconvex domains, random walk on torus, billiards,
city section, space graph, intercity and other models.
We show that, for this model, a necessary and
sufficient condition for a time-stationary regime to
exist is that the mean trip duration (sampled at trip
endpoints) is finite. When this holds, we show that the
distribution of node mobility state converges to the
time-stationary distribution, starting from the origin
of an arbitrary trip. For the special case of random
waypoint, we provide for the first time a proof and a
sufficient and necessary condition of the existence of
a stationary regime, thus closing a long standing
issue. We show that random walk on torus and billiards
belong to the random trip class of models, and
establish that the time-limit distribution of node
location for these two models is uniform, for any
initial distribution, even in cases where the speed
vector does not have circular symmetry. Using Palm
calculus, we establish properties of the
time-stationary regime, when the condition for its
existence holds. We provide an algorithm to sample the
simulation state from a time-stationary distribution at
time 0 (`perfect simulation'), without computing
geometric constants. For random waypoint on the sphere,
random walk on torus and billiards, we show that, in
the time-stationary regime, the node location is
uniform. Our perfect sampling algorithm is implemented
to use with ns-2, and is available to download from
\path=http://ica1www.epfl.ch/RandomTrip=.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobility models; random waypoint; simulation",
}
@Article{Konorski:2006:GTS,
author = "Jerzy Konorski",
title = "A game-theoretic study of {CSMA\slash CA} under a
backoff attack",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1167--1178",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "CSMA/CA, the contention mechanism of the IEEE 802.11
DCF medium access protocol, has recently been found
vulnerable to selfish backoff attacks consisting in
nonstandard configuration of the constituent backoff
scheme. Such attacks can greatly increase a selfish
station's bandwidth share at the expense of honest
stations applying a standard configuration. The paper
investigates the distribution of bandwidth among
anonymous network stations, some of which are selfish.
A station's obtained bandwidth share is regarded as a
payoff in a noncooperative CSMA/CA game. Regardless of
the IEEE 802.11 parameter setting, the payoff function
is found similar to a multiplayer Prisoners' Dilemma;
moreover, the number (though not the identities) of
selfish stations can be inferred by observation of
successful transmission attempts. Further, a repeated
CSMA/CA game is defined, where a station can toggle
between standard and nonstandard backoff configurations
with a view of maximizing a long-term utility. It is
argued that a desirable station strategy should yield a
fair, Pareto efficient, and subgame perfect Nash
equilibrium. One such strategy, called CRISP, is
described and evaluated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc LAN; game theory; MAC protocol; selfish
behavior",
}
@Article{Chou:2006:CBA,
author = "Chun-Ting Chou and Kang G. Shin and Sai Shankar N.",
title = "Contention-based airtime usage control in multirate
{IEEE} 802.11 wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1179--1192",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a multirate wireless LAN, wireless/mobile stations
usually adapt their transmission rates to the channel
condition. It is difficult to control each station's
usage of network resources since the shared channel can
be overused by low transmission-rate stations. To solve
this problem, we propose a distributed control of
stations' airtime usage which (1) always guarantees
each station to receive a specified share of airtime,
and (2) keeps service for individual stations
unaffected by other stations' transmission rates. Such
airtime control enables service differentiation or
quality of service (QoS) support. Moreover, it can
achieve a higher overall system throughput. The
proposed airtime usage control exploits the Enhanced
Distributed Channel Access (EDCA) of the IEEE 802.11e
standard [1]. Two control mechanisms are proposed: one
based on controlling the station's arbitration
inter-frame space (AIFS) and the other based on the
contention window size. We show how the stations'
airtime usage is related to the AIFS and contention
window size parameters. Using this relation, two
analytical models are developed to determine the
optimal control parameters. Unlike the other heuristic
controls or analytical models, our model provides
handles or parameters for quantitative control of
stations' airtime usage. Our evaluation results show
that a precise airtime usage control can be achieved in
a multirate wireless LAN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "medium access control; resource allocation; wireless
LAN",
}
@Article{Applegate:2006:MRR,
author = "David Applegate and Edith Cohen",
title = "Making routing robust to changing traffic demands:
algorithms and evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1193--1206",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Intra-domain traffic engineering can significantly
enhance the performance of large IP backbone networks.
Two important components of traffic engineering are
understanding the traffic demands and configuring the
routing protocols. These two components are
inter-linked, as it is widely believed that an accurate
view of traffic is important for optimizing the
configuration of routing protocols, and through that,
the utilization of the network. This basic premise,
however, seems never to have been quantified. How
important is accurate knowledge of traffic demands for
obtaining good utilization of the network? Since
traffic demand values are dynamic and illusive, is it
possible to obtain a routing that is `robust' to
variations in demands?We develop novel algorithms for
constructing optimal robust routings and for evaluating
the performance of any given routing on loosely
constrained rich sets of traffic demands. Armed with
these algorithms we explore these questions on a
diverse collection of ISP networks. We arrive at a
surprising conclusion: it is possible to obtain a
robust routing that guarantees a nearly optimal
utilization with a fairly limited knowledge of the
applicable traffic demands.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "oblivious routing; routing; traffic engineering",
}
@Article{Kohler:2006:OSA,
author = "Eddie Kohler and Jinyang Li and Vern Paxson and Scott
Shenker",
title = "Observed structure of addresses in {IP} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1207--1218",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the structure of addresses contained in
IPv4 traffic--specifically, the structural
characteristics of destination IP addresses seen on
Internet links, considered as a subset of the address
space. These characteristics have implications for
algorithms that deal with IP address aggregates, such
as routing lookups and aggregate-based congestion
control. Several example address structures are well
modeled by multifractal Cantor-like sets with two
parameters. This model may be useful for simulations
where realistic IP addresses are preferred. We also
develop concise characterizations of address
structures, including active aggregate counts and
discriminating prefixes. Our structural
characterizations are stable over short time scales at
a given site, and different sites have visibly
different characterizations, so that the
characterizations make useful `fingerprints' of the
traffic seen at a site. Also, changing traffic
conditions, such as worm propagation, significantly
alter these fingerprints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "address space; address structures; multifractals;
network measurement",
}
@Article{Gueye:2006:CBG,
author = "Bamba Gueye and Artur Ziviani and Mark Crovella and
Serge Fdida",
title = "Constraint-based geolocation of {Internet} hosts",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1219--1232",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Geolocation of Internet hosts enables a new class of
location-aware applications. Previous measurement-based
approaches use reference hosts, called landmarks, with
a well-known geographic location to provide the
location estimation of a target host. This leads to a
discrete space of answers, limiting the number of
possible location estimates to the number of adopted
landmarks. In contrast, we propose Constraint-Based
Geolocation (CBG), which infers the geographic location
of Internet hosts using multilateration with distance
constraints to establish a continuous space of answers
instead of a discrete one. However, to use
multilateration in the Internet, the geographic
distances from the landmarks to the target host have to
be estimated based on delay measurements between these
hosts. This is a challenging problem because the
relationship between network delay and geographic
distance in the Internet is perturbed by many factors,
including queueing delays and the absence of
great-circle paths between hosts. CBG accurately
transforms delay measurements to geographic distance
constraints, and then uses multilateration to infer the
geolocation of the target host. Our experimental
results show that CBG outperforms previous geolocation
techniques. Moreover, in contrast to previous
approaches, our method is able to assign a confidence
region to each given location estimate. This allows a
location-aware application to assess whether the
location estimate is sufficiently accurate for its
needs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay measurement; geolocation; Internet;
multilateration; position measurement",
}
@Article{Shakkottai:2006:ENP,
author = "Srinivas Shakkottai and R. Srikant",
title = "Economics of network pricing with multiple {ISPs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1233--1245",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we examine how transit and customer
prices and quality of service are set in a network
consisting of multiple ISPs. Some ISPs may face an
identical set of circumstances in terms of potential
customer pool and running costs. We examine the
existence of equilibrium strategies in this situation
and show how positive profit can be achieved using
threat strategies with multiple qualities of service.
It is shown that if the number of ISPs competing for
the same customers is large then it can lead to price
wars. ISPs that are not co-located may not directly
compete for users, but are nevertheless involved in a
non-cooperative game of setting access and transit
prices for each other. They are linked economically
through a sequence of providers forming a hierarchy,
and we study their interaction by considering a
multi-stage game. We also consider the economics of
private exchange points and show that their viability
depends on fundamental limits on the demand and cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet economics; peering and transit; quality of
service; repeated games; Stackelberg games",
}
@Article{Wei:2006:FTM,
author = "David X. Wei and Cheng Jin and Steven H. Low and
Sanjay Hegde",
title = "{FAST TCP}: motivation, architecture, algorithms,
performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1246--1259",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We describe FAST TCP, a new TCP congestion control
algorithm for high-speed long-latency networks, from
design to implementation. We highlight the approach
taken by FAST TCP to address the four difficulties
which the current TCP implementation has at large
windows. We describe the architecture and summarize
some of the algorithms implemented in our prototype. We
characterize its equilibrium and stability properties.
We evaluate it experimentally in terms of throughput,
fairness, stability, and responsiveness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "FAST TCP; implementation; Internet congestion control;
protocol design; stability analysis",
}
@Article{Han:2006:MPT,
author = "Huaizhong Han and Srinivas Shakkottai and C. V. Hollot
and R. Srikant and Don Towsley",
title = "Multi-path {TCP}: a joint congestion control and
routing scheme to exploit path diversity in the
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1260--1271",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of congestion-aware multi-path
routing in the Internet. Currently, Internet routing
protocols select only a single path between a source
and a destination. However, due to many policy routing
decisions, single-path routing may limit the achievable
throughput. In this paper, we envision a scenario where
multi-path routing is enabled in the Internet to take
advantage of path diversity. Using minimal congestion
feedback signals from the routers, we present a class
of algorithms that can be implemented at the sources to
stably and optimally split the flow between each
source-destination pair. We then show that the
connection-level throughput region of such multi-path
routing/congestion control algorithms can be larger
than that of a single-path congestion control scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; multipath routing; Nyquist
stability; overlay networks",
}
@Article{Nace:2006:COM,
author = "Dritan Nace and Nhat-Linh Doan and Eric Gourdin and
Bernard Liau",
title = "Computing optimal max-min fair resource allocation for
elastic flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1272--1281",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the max-min fair resource
allocation problem as applied to elastic flows. We are
interested in computing the optimal max-min fair rate
allocation. The proposed approach is a linear
programming based one and allows the computation of
optimal routing paths with regard to max-min fairness,
in stable and known traffic conditions. We consider
nonbounded access rates, but we show how the proposed
approach can handle the case of upper-bounded access
rates. A proof of optimality and some computational
results are also presented.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "elastic flows; linear programming; max-min fairness;
optimization; resource allocation",
}
@Article{Wang:2006:AOF,
author = "Wei-Hua Wang and Marimuthu Palaniswami and Steven H.
Low",
title = "Application-oriented flow control: fundamentals,
algorithms and fairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1282--1291",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper is concerned with flow control and resource
allocation problems in computer networks in which
real-time applications may have hard quality of service
(QoS) requirements. Recent optimal flow control
approaches are unable to deal with these problems since
QoS utility functions generally do not satisfy the
strict concavity condition in real-time applications.
For elastic traffic, we show that bandwidth allocations
using the existing optimal flow control strategy can be
quite unfair. If we consider different QoS requirements
among network users, it may be undesirable to allocate
bandwidth simply according to the traditional max-min
fairness or proportional fairness. Instead, a network
should have the ability to allocate bandwidth resources
to various users, addressing their real utility
requirements. For these reasons, this paper proposes a
new distributed flow control algorithm for multiservice
networks, where the application's utility is only
assumed to be continuously increasing over the
available bandwidth. In this, we show that the
algorithm converges, and that at convergence, the
utility achieved by each application is well balanced
in a proportionally (or max-min) fair manner.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; quality of service; real-time
application; resource allocation; utility max-min
fairness; utility proportional fairness",
}
@Article{Boucouvalas:2006:OIP,
author = "Anthony C. Boucouvalas and Pi Huang",
title = "{OBEX} over {IrDA}: performance analysis and
optimization by considering multiple applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1292--1301",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "OBEX (Object Exchange Protocol) is a session protocol
designed to exchange all kind of objects between
portable devices using different ad hoc wireless links
including IrDA and Bluetooth. This paper develops a
mathematical model for OBEX over the IrDA protocol
stack by considering multiple applications and presence
of bit errors. The model is also verified by simulation
results. We derive throughput equations and carry out
an optimization study focusing on four major
parameters: OBEX packet size, TinyTP (IrDA transport
layer) buffer size, IrLAP (IrDA link layer) frame and
window size. Equations are derived for the optimum
IrLAP window and frame sizes. Numerical results show
significant improvement on OBEX performance using the
optimized parameters. The major contribution of this
work is the modelling of OBEX including the low layer
protocols and optimization of the overall throughput by
appropriate parameter selection.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bluetooth; IrDA; OBEX; optimization",
}
@Article{Chakareski:2006:RER,
author = "Jacob Chakareski and Philip A. Chou",
title = "{RaDiO} edge: rate-distortion optimized proxy-driven
streaming from the network edge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1302--1312",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the problem of streaming
packetized media over a lossy packet network through an
intermediate proxy server to a client, in a
rate-distortion optimized way. The proxy, located at
the junction of the backbone network and the last hop
to the client, coordinates the communication between
the media server and the client using hybrid
receiver/sender-driven streaming in a rate-distortion
optimization framework. The framework enables the proxy
to determine at every instant which packets, if any, it
should either request from the media server or
(re)transmit directly to the client, in order to meet
constraints on the average transmission rates on the
backbone and the last hop while minimizing the average
end-to-end distortion. Performance gains are observed
over rate-distortion optimized sender-driven systems
for streaming packetized video content. The improvement
in performance depends on the quality of the network
path both in the backbone network and along the last
hop.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "audio coding; channel coding; edge-based streaming;
error control; Internet; Markov processes; multimedia
communication; optimal control; protocols; proxy
servers; rate-distortion; video coding",
}
@Article{Fan:2006:TTS,
author = "Xingzhe Fan and Kartikeya Chandrayana and Murat Arcak
and Shivkumar Kalyanaraman and John Ting-Yung Wen",
title = "A two-time-scale design for edge-based detection and
rectification of uncooperative flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1313--1322",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Existing Internet protocols rely on cooperative
behavior of end users. We present a control-theoretic
algorithm to counteract uncooperative users which
change their congestion control schemes to gain larger
bandwidth. This algorithm rectifies uncooperative
users; that is, forces them to comply with their fair
share, by adjusting the prices fed back to them. It is
to be implemented at the edge of the network (e.g., by
ISPs), and can be used with any congestion notification
policy deployed by the network. Our design achieves a
separation of time-scales between the network
congestion feedback loop and the price-adjustment loop,
thus recovering the fair allocation of bandwidth upon a
fast transient phase.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network congestion control; singular-perturbations;
uncooperative flow control",
}
@Article{Xie:2006:ILR,
author = "Feng Xie and Gang Feng and Chee Kheong Siew",
title = "The impact of loss recovery on congestion control for
reliable multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1323--1335",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most existing reliable multicast congestion control
(RMCC) mechanisms try to emulate TCP congestion control
behaviors for achieving TCP-compatibility. However,
different loss recovery mechanisms employed in reliable
multicast protocols, especially NAK-based
retransmission and local loss recovery mechanisms, may
lead to different behaviors and performance of
congestion control. As a result, reliable multicast
flows might be identified and treated as
non-TCP-friendly by routers in the network. It is
essential to understand those influences and take them
into account in the development and deployment of
reliable multicast services. In this paper, we study
the influences comprehensively through analysis,
modelling and simulations. We demonstrate that
NAK-based retransmission and/or local loss recovery
mechanisms are much more robust and efficient in
recovering from single or multiple packet losses within
a single round-trip time (RTT). For a better
understanding on the impact of loss recovery on RMCC,
we derive expressions for steady-state throughput of
NAK-based RMCC schemes, which clearly brings out the
throughput advantages of NAK-based RMCC over TCP Reno.
We also show that timeout effects have little impact on
shaping the performance of NAK-based RMCC schemes
except for extremely high loss rates (>0.2). Finally,
we use simulations to validate our findings and show
that local loss recovery may further increase the
throughput and deteriorate the fairness properties of
NAK-based RMCC schemes. These findings and insights
could provide useful recommendations for the design,
testing and deployment of reliable multicast protocols
and services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; loss recovery; modelling; reliable
multicast; TCP-friendly",
}
@Article{Lorenz:2006:EQP,
author = "Dean H. Lorenz and Ariel Orda and Danny Raz and Yuval
Shavitt",
title = "Efficient {QoS} partition and routing of unicast and
multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1336--1347",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study problems related to supporting
unicast and multicast connections with quality of
service (QoS) requirements. We investigate the problem
of optimal routing and resource allocation in the
context of performance dependent costs. In this
context, each network element can offer several QoS
guarantees, each associated with a different cost. This
is a natural extension to the commonly used bi-criteria
model, where each link is associated with a single
delay and a single cost. This framework is simple yet
strong enough to model many practical interesting
networking problems. An important problems in this
framework is finding a good path for a connection that
minimizes the cost while retaining the end-to-end delay
requirement. Once such a path (or a tree, in the
multicast case) is found, one needs to partition the
end-to-end QoS requirements among the links of the path
(tree). We consider the case of general integer cost
functions (where delays and cost are integers). As the
related problem is NP complete, we concentrate on
finding efficient $ \epsilon $-approximation solutions.
We improve on recent previous results by Erg{\"u}n et
al., Lorenz and Orda, and Raz and Shavitt, both in
terms of generality as well as in terms of complexity
of the solution. In particular, we present novel
approximation techniques that yield the best known
complexity for the unicast QoS routing problem, and the
first approximation algorithm for the QoS partition
problem on trees, both for the centralized and
distributed cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation; multicast; QoS; QoS-dependent costs;
resource allocation; routing",
}
@Article{Lin:2006:OBA,
author = "Xiaojun Lin and Ness B. Shroff",
title = "An optimization-based approach for {QoS} routing in
high-bandwidth networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1348--1361",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose an optimization-based
approach for Quality of Service (QoS) routing in
high-bandwidth networks. We view a network that employs
QoS routing as an entity that distributively optimizes
some global utility function. By solving the
optimization problem, the network is driven to an
efficient operating point. In earlier work, it has been
shown that when the capacity of the network is large,
this optimization takes on a simple form, and once the
solution to this optimization problem is found, simple
proportional QoS routing schemes will suffice. However,
this optimization problem requires global information.
We develop a distributed and adaptive algorithm that
can efficiently solve the optimization online. Compared
with existing QoS routing schemes, the proposed
optimization-based approach has the following
advantages: (1) the computation and communication
overhead can be greatly reduced without sacrificing
performance; (2) the operating characteristics of the
network can be analytically studied; and (3) the
desired operating point can be tuned by choosing
appropriate utility functions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "high-bandwidth networks; optimization-based approach;
QoS routing",
}
@Article{Ramabhadran:2006:SRR,
author = "Sriram Ramabhadran and Joseph Pasquale",
title = "The {Stratified Round Robin} scheduler: design,
analysis and implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1362--1373",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Stratified Round Robin is a fair-queueing packet
scheduler which has good fairness and delay properties,
and low quasi-$ O(1) $ o complexity. It is unique among
all other schedulers of comparable complexity in that
it provides a single packet delay bound that is
independent of the number of flows. Importantly, it is
also amenable to a simple hardware implementation, and
thus fills a current gap between scheduling algorithms
that have provably good performance and those that are
feasible and practical to implement in high-speed
routers. We present both analytical results and
simulations to demonstrate its performance
properties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "high-speed router design; packet scheduling; quality
of service",
}
@Article{Rosenblum:2006:AFS,
author = "Michael Rosenblum and Constantine Caramanis and Michel
X. Goemans and Vahid Tarokh",
title = "Approximating fluid schedules in crossbar
packet-switches and {Banyan} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1374--1387",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a problem motivated by the desire to
provide flexible, rate-based, quality of service
guarantees for packets sent over input queued switches
and switch networks. Our focus is solving a type of
online traffic scheduling problem, whose input at each
time step is a set of desired traffic rates through the
switch network. These traffic rates in general cannot
be exactly achieved since they assume arbitrarily small
fractions of packets can be transmitted at each time
step. The goal of the traffic scheduling problem is to
closely approximate the given sequence of traffic rates
by a sequence of transmissions in which only whole
packets are sent. We prove worst-case bounds on the
additional buffer use, which we call backlog, that
results from using such an approximation. We first
consider the $ N \times N $, input queued, crossbar
switch. Our main result is an online packet-scheduling
algorithm using no speedup that guarantees backlog at
most $ (N + 1)^2 / 4 $ packets at each input port and
each output port. Upper bounds on worst-case backlog
have been proved for the case of constant fluid
schedules, such as the $ N^2 - 2 N + 2 $ bound of
Chang, Chen, and Huang (INFOCOM, 2000). Our main result
for the crossbar switch is the first, to our knowledge,
to bound backlog in terms of switch size $N$ for
arbitrary, time-varying fluid schedules, without using
speedup. Our main result for Banyan networks is an
exact characterization of the speedup required to
maintain bounded backlog, in terms of polytopes derived
from the network topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "combinatorics; graph theory; network calculus;
packet-switching; scheduling",
}
@Article{Ali:2006:GSS,
author = "Maher Ali",
title = "Generalized sharing in survivable optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "6",
pages = "1388--1399",
month = dec,
year = "2006",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:08 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Shared path protection has been demonstrated to be a
very efficient survivability scheme for optical
networking. In this scheme, multiple backup paths can
share a given optical channel if their corresponding
primary routes are not expected to fail simultaneously.
The focus in this area has been the optimization of the
total channels (i.e., bandwidth) provisioned in the
network through the intelligent routing of primary and
backup routes. In this work, we extend the current path
protection sharing scheme and introduce the Generalized
Sharing Concept. In this concept, we allow for
additional sharing of important node devices. These
node devices (e.g., optical-electronic-optical
regenerators (OEOs), pure all-optical converters, etc.)
constitute the dominant cost factor in an optical
backbone network and the reduction of their number is
of paramount importance. For demonstration purposes, we
extend the concept of 1: $N$ shared path protection to
allow for the sharing of electronic regenerators needed
for coping with optical transmission impairments. Both
design and control plane issues are discussed through
numerical examples. Considerable cost reductions in
electronic budget are demonstrated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical networks; shared protection",
}
@Article{Baughman:2007:CPP,
author = "Nathaniel E. Baughman and Marc Liberatore and Brian
Neil Levine",
title = "Cheat-proof playout for centralized and peer-to-peer
gaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "1--13",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We explore exploits possible for cheating in
real-time, multiplayer games for both client-server and
serverless architectures. We offer the first
formalization of cheating in online games and propose
an initial set of strong solutions. We propose a
protocol that has provable anti-cheating guarantees, is
provably safe and live, but suffers a performance
penalty. We then develop an extended version of this
protocol, called asynchronous synchronization, which
avoids the penalty, is serverless, offers provable
anti-cheating guarantees, is robust in the presence of
packet loss, and provides for significantly increased
communication performance. This technique is applicable
to common game features as well as clustering and
cell-based techniques for massively multiplayer games.
Specifically, we provide a zero-knowledge proof
protocol so that players are within a specific range of
each other, and otherwise have no notion of their
distance. Our performance claims are backed by analysis
using a simulation based on real game traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "gaming; multimedia communication; peer-to-peer
networking; security",
}
@Article{Kompella:2007:SAD,
author = "Ramana Rao Kompella and Sumeet Singh and George
Varghese",
title = "On scalable attack detection in the network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "14--25",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current intrusion detection and prevention systems
seek to detect a wide class of network intrusions
(e.g., DoS attacks, worms, port scans) at network
vantage points. Unfortunately, even today, many IDS
systems we know of keep per-connection or per-flow
state to detect malicious TCP flows. Thus, it is hardly
surprising that these IDS systems have not scaled to
multigigabit speeds. By contrast, both router lookups
and fair queuing have scaled to high speeds using
aggregation via prefix lookups or DiffServ. Thus, in
this paper, we initiate research into the question as
to whether one can detect attacks without keeping
per-flow state. We will show that such aggregation,
while making fast implementations possible, immediately
causes two problems. First, aggregation can cause
behavioral aliasing where, for example, good behaviors
can aggregate to look like bad behaviors. Second,
aggregated schemes are susceptible to spoofing by which
the intruder sends attacks that have appropriate
aggregate behavior. We examine a wide variety of DoS
and scanning attacks and show that several categories
(bandwidth based, claim-and-hold, port-scanning) can be
scalably detected. In addition to existing approaches
for scalable attack detection, we propose a novel data
structure called partial completion filters (PCFs) that
can detect claim-and-hold attacks scalably in the
network. We analyze PCFs both analytically and using
experiments on real network traces to demonstrate how
we can tune PCFs to achieve extremely low false
positive and false negative probabilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data structures; denial of service; network attacks;
routers; scanning; streaming algorithms; syn flooding",
}
@Article{Ramaswamy:2007:HSP,
author = "Ramaswamy Ramaswamy and Tilman Wolf",
title = "High-speed prefix-preserving {IP} address
anonymization for passive measurement systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "26--39",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Passive network measurement and packet header trace
collection are vital tools for network operation and
research. To protect a user's privacy, it is necessary
to anonymize header fields, particularly IP addresses.
To preserve the correlation between IP addresses,
prefix-preserving anonymization has been proposed. The
limitations of this approach for a high-performance
measurement system are the need for complex
cryptographic computations and potentially large
amounts of memory. We propose a new prefix-preserving
anonymization algorithm, top-hash subtree-replicated
anonymization (TSA), that features three novel
improvements: precomputation, replicated subtrees, and
top hashing. TSA makes anonymization practical to be
implemented on network processors or dedicated logic at
Gigabit rates. The performance of TSA is compared with
a conventional cryptography based prefix-preserving
anonymization scheme which utilizes caching. TSA
performs better as it requires no online cryptographic
computation and a small number of memory lookups per
packet. Our analytic comparison of the susceptibility
to attacks between conventional anonymization and our
approach shows that TSA performs better for small scale
attacks and comparably for medium scale attacks. The
processing cost for TSA is reduced by two orders of
magnitude and the memory requirements are a few
Megabytes. The ability to tune the memory requirements
and security level makes TSA ideal for a broad range of
network systems with different capabilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anonymization; network measurement; privacy",
}
@Article{Wang:2007:DAS,
author = "Haining Wang and Cheng Jin and Kang G. Shin",
title = "Defense against spoofed {IP} traffic using hop-count
filtering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "40--53",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IP spoofing has often been exploited by Distributed
Denial of Service (DDoS) attacks to: (1) conceal
flooding sources and dilute localities in flooding
traffic, and (2) coax legitimate hosts into becoming
reflectors, redirecting and amplifying flooding
traffic. Thus, the ability to filter spoofed IP packets
near victim servers is essential to their own
protection and prevention of becoming involuntary DoS
reflectors. Although an attacker can forge any field in
the IP header, he cannot falsify the number of hops an
IP packet takes to reach its destination. More
importantly, since the hop-count values are diverse, an
attacker cannot randomly spoof IP addresses while
maintaining consistent hop-counts. On the other hand,
an Internet server can easily infer the hop-count
information from the Time-to-Live (TTL) field of the IP
header. Using a mapping between IP addresses and their
hop-counts, the server can distinguish spoofed IP
packets from legitimate ones. Based on this
observation, we present a novel filtering technique,
called Hop-Count Filtering (HCF)--which builds an
accurate IP-to-hop-count (IP2HC) mapping table--to
detect and discard spoofed IP packets. HCF is easy to
deploy, as it does not require any support from the
underlying network. Through analysis using network
measurement data, we show that HCF can identify close
to 90\% of spoofed IP packets, and then discard them
with little collateral damage. We implement and
evaluate HCF in the Linux kernel, demonstrating its
effectiveness with experimental measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "DDoS attacks; hop-count; host-based; IP spoofing",
}
@Article{Jaiswal:2007:MCS,
author = "Sharad Jaiswal and Gianluca Iannaccone and Christophe
Diot and Jim Kurose and Don Towsley",
title = "Measurement and classification of out-of-sequence
packets in a {Tier-1} {IP} backbone",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "54--66",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a classification methodology and a
measurement study for out-of-sequence packets in TCP
connections going over the Sprint IP backbone.
Out-of-sequence packets can result from many events
including loss, looping, reordering, or duplication in
the network. It is important to quantify and understand
the causes of such out-of-sequence packets since it is
an indicator of the performance of a TCP connection,
and the quality of its end-end path. Our study is based
on passively observed packets from a point inside a
large backbone network--as opposed to actively sending
and measuring end-end probe traffic at the sender or
receiver. A new methodology is thus required to infer
the causes of a connection's out-of-sequence packets
using only measurements taken in the `middle' of the
connection's end-end path. We describe techniques that
classify observed out-of-sequence behavior based only
on the previously- and subsequently-observed packets
within a connection and knowledge of how TCP behaves.
We analyze numerous several-hour packet-level traces
from a set of OC-12 and OC-48 links for tens of
millions connections generated in nearly 7600 unique
ASes. We show that using our techniques, it is possible
to classify almost all out-of-sequence packets in our
traces and that we can quantify the uncertainty in our
classification. Our measurements show a relatively
consistent rate of out-of-sequence packets of
approximately 4\%. We observe that a majority of
out-of-sequence packets are retransmissions, with a
smaller percentage resulting from in-network
reordering.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet measurements; out-of-sequence packets;
passive measurements; TCP/IP performance",
}
@Article{Arifler:2007:FAA,
author = "Dogu Arifler and Gustavo {de Veciana} and Brian L.
Evans",
title = "A factor analytic approach to inferring congestion
sharing based on flow level measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "67--79",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet traffic primarily consists of packets from
elastic flows, i.e., Web transfers, file transfers, and
e-mail, whose transmissions are mediated via the
Transmission Control Protocol (TCP). In this paper, we
develop a methodology to process TCP flow measurements
in order to analyze throughput correlations among TCP
flow classes that can be used to infer congestion
sharing in the Internet. The primary contributions of
this paper are: (1) development of a technique for
processing flow records suitable for inferring
congested resource sharing; (2) evaluation of the use
of factor analysis on processed flow records to explore
which TCP flow classes might share congested resources;
and (3) validation of our inference methodology using
bootstrap methods and nonintrusive, flow level
measurements collected at a single network site. Our
proposal for using flow level measurements to infer
congestion sharing differs significantly from previous
research that has employed packet level measurements
for making inferences. Possible applications of our
method include network monitoring and root cause
analysis of poor performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "factor analysis; inference of congestion sharing;
network measurement",
}
@Article{Chi:2007:LFN,
author = "Caixia Chi and Dawei Huang and David Lee and XiaoRong
Sun",
title = "Lazy flooding: a new technique for information
dissemination in distributed network systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "80--92",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Flooding is a commonly used technique for network
resource and topology information dissemination in the
data communication networks. However, due to the
well-known $N$-squared problem it causes network delay
in response or even congestion. We propose a new
flooding technique, called Lazy Flooding; it floods
only when links reach a certain status. It
significantly cuts down the number of floods and thus
improves the data communication network response time.
On the other hand, it has negligible effect on the
network performance due to the selected flooding.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "flooding; link state advertisement; optical networks;
routing",
}
@Article{Baek:2007:SEB,
author = "Seung Jun Baek and Gustavo {De Veciana}",
title = "Spatial energy balancing through proactive multipath
routing in wireless multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "93--104",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the use of proactive
multipath routing to achieve energy-efficient operation
of ad hoc wireless networks. The focus is on optimizing
tradeoffs between the energy cost of spreading traffic
and the improved spatial balance of energy burdens. We
propose a simple scheme for multipath routing based on
spatial relationships among nodes. Then, combining
stochastic geometric and queueing models, we develop a
continuum model for such networks, permitting an
evaluation of different types of scenarios, i.e., with
and without energy replenishing and storage
capabilities. We propose a parameterized family of
energy balancing strategies and study the spatial
distributions of energy burdens based on their
associated second-order statistics. Our analysis and
simulations show the fundamental importance of the
tradeoff explored in this paper, and how its
optimization depends on the relative values of the
energy reserves/storage, replenishing rates, and
network load characteristics. For example, one of our
results shows that the degree of spreading should
roughly scale as the square root of the bits {\.c}
meters load offered by a session. Simulation results
confirm that proactive multipath routing decreases the
probability of energy depletion by orders of magnitude
versus that of a shortest path routing scheme when the
initial energy reserve is high.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Gaussian random field; M/GI/1 queue; sensor networks;
shot-noise process; stochastic geometry",
}
@Article{Paschalidis:2007:AOT,
author = "Ioannis Ch. Paschalidis and Wei Lai and David
Starobinski",
title = "Asymptotically optimal transmission policies for
large-scale low-power wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "105--118",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider wireless sensor networks with multiple
gateways and multiple classes of traffic carrying data
generated by different sensory inputs. The objective is
to devise joint routing, power control and transmission
scheduling policies in order to gather data in the most
efficient manner while respecting the needs of
different sensing tasks (fairness). We formulate the
problem as maximizing the utility of transmissions
subject to explicit fairness constraints and propose an
efficient decomposition algorithm drawing upon
large-scale decomposition ideas in mathematical
programming. We show that our algorithm terminates in a
finite number of iterations and produces a policy that
is asymptotically optimal at low transmission power
levels. Furthermore, we establish that the utility
maximization problem we consider can, in principle, be
solved in polynomial time. Numerical results show that
our policy is near-optimal, even at high power levels,
and far superior to the best known heuristics at low
power levels. We also demonstrate how to adapt our
algorithm to accommodate energy constraints and node
failures. The approach we introduce can efficiently
determine near-optimal transmission policies for
dramatically larger problem instances than an
alternative enumeration approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mathematical programming/optimization; routing;
transmission scheduling; wireless sensor networks",
}
@Article{Eriksson:2007:DDA,
author = "Jakob Eriksson and Michalis Faloutsos and Srikanth V.
Krishnamurthy",
title = "{DART}: dynamic address routing for scalable ad hoc
and mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "119--132",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is well known that the current ad hoc protocol
suites do not scale to work efficiently in networks of
more than a few hundred nodes. Most current ad hoc
routing architectures use flat static addressing and
thus, need to keep track of each node individually,
creating a massive overhead problem as the network
grows. Could dynamic addressing alleviate this problem?
In this paper, we argue that the use of dynamic
addressing can enable scalable routing in ad hoc
networks. We provide an initial design of a routing
layer based on dynamic addressing, and evaluate its
performance. Each node has a unique permanent
identifier and a transient routing address, which
indicates its location in the network at any given
time. The main challenge is dynamic address allocation
in the face of node mobility. We propose mechanisms to
implement dynamic addressing efficiently. Our initial
evaluation suggests that dynamic addressing is a
promising approach for achieving scalable routing in
large ad hoc and mesh networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; mesh networks; routing; scalability;
wireless networks",
}
@Article{Yi:2007:HHC,
author = "Yung Yi and Sanjay Shakkottai",
title = "Hop-by-hop congestion control over a wireless
multi-hop network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "133--144",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper focuses on congestion control over
multi-hop, wireless networks. In a wireless network, an
important constraint that arises is that due to the MAC
(Media Access Control) layer. Many wireless MACs use a
time-division strategy for channel access, where, at
any point in space, the physical channel can be
accessed by a single user at each instant of
time.\par
In this paper, we develop a fair hop-by-hop congestion
control algorithm with the MAC constraint being imposed
in the form of a channel access time constraint, using
an optimization-based framework. In the absence of
delay, we show that this algorithm are globally stable
using a Lyapunov-function-based approach. Next, in the
presence of delay, we show that the hop-by-hop control
algorithm has the property of spatial spreading. In
other words, focused loads at a particular spatial
location in the network get `smoothed' over space. We
derive bounds on the `peak load' at a node, both with
hop-by-hop control, as well as with end-to-end control,
show that significant gains are to be had with the
hop-by-hop scheme, and validate the analytical results
with simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "control theory; mathematical
programming/optimization",
}
@Article{Song:2007:CLA,
author = "Liang Song and Dimitrios Hatzinakos",
title = "A cross-layer architecture of wireless sensor networks
for target tracking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "145--158",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose the Low Energy Self-Organizing Protocol
(LESOP) for target tracking in dense wireless sensor
networks. A cross-layer design perspective is adopted
in LESOP for high protocol efficiency, where direct
interactions between the Application layer and the
Medium Access Control (MAC) layer are exploited. Unlike
the classical Open Systems Interconnect (OSI) paradigm
of communication networks, the Transport and Network
layers are excluded in LESOP to simplify the protocol
stack. A lightweight yet efficient target localization
algorithm is proposed and implemented, and a Quality of
Service (QoS) knob is found to control the tradeoff
between the tracking error and the network energy
consumption. Furthermore, LESOP serves as the first
example in demonstrating the migration from the OSI
paradigm to the Embedded Wireless Interconnect (EWI)
architecture platform, a two-layer efficient
architecture proposed here for wireless sensor
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "application layer; embedded wireless interconnect;
medium access control; open systems interconnect;
target tracking; wireless sensor networks",
}
@Article{Malone:2007:MDC,
author = "David Malone and Ken Duffy and Doug Leith",
title = "Modeling the 802.11 distributed coordination function
in nonsaturated heterogeneous conditions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "159--172",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Analysis of the 802.11 CSMA/CA mechanism has received
considerable attention recently. Bianchi presented an
analytic model under a saturated traffic assumption.
Bianchi's model is accurate, but typical network
conditions are nonsaturated and heterogeneous. We
present an extension of his model to a nonsaturated
environment. The model's predictions, validated against
simulation, accurately capture many interesting
features of nonsaturated operation. For example, the
model predicts that peak throughput occurs prior to
saturation. Our model allows stations to have different
traffic arrival rates, enabling us to address the
question of fairness between competing flows. Although
we use a specific arrival process, it encompasses a
wide range of interesting traffic types including, in
particular, VoIP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "802.11; CSMA/CA; heterogeneous network; nonsaturated
traffic",
}
@Article{Fei:2007:PTR,
author = "Zongming Fei and Mengkun Yang",
title = "A proactive tree recovery mechanism for resilient
overlay multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "173--186",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay multicast constructs a multicast delivery tree
among end hosts. Unlike traditional IP multicast, the
nonleaf nodes in the tree are normal end hosts, which
are potentially more susceptible to failures than
routers and may leave the multicast group voluntarily.
In these cases, all downstream nodes are affected.
Thus, an important problem for making overlay multicast
more dependable is how to recover from node departures
in order to minimize the disruption of service to those
affected nodes. In this paper, we propose a proactive
tree recovery mechanism to make the overlay multicast
resilient to these failures and unexpected events.
Rather than letting downstream nodes try to find a new
parent after a node departure, each non-leaf node
precalculates a parent-to-be for each of its children.
When this non-leaf node is gone, all its children can
find their respective new parents immediately. The
salient feature of the approach is that rescue plans
for multiple non-leaf nodes can work together for their
respective children when they fail or leave at the same
time. Extensive simulations demonstrate that our
proactive approach can recover from node departures
much faster than reactive methods, while the quality of
trees restored and the cost of recovery are
reasonable.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "failure recovery; overlay multicast; tree
restoration",
}
@Article{Kang:2007:MBE,
author = "Seong-Ryong Kang and Dmitri Loguinov",
title = "Modeling best-effort and {FEC} streaming of scalable
video in lossy network channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "187--200",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video applications that transport delay-sensitive
multimedia over best-effort networks usually require
special mechanisms that can overcome packet loss
without using retransmission. In response to this
demand, forward-error correction (FEC) is often used in
streaming applications to protect video and audio data
in lossy network paths; however, studies in the
literature report conflicting results on the benefits
of FEC over best-effort streaming. To address this
uncertainty, we start with a baseline case that
examines the impact of packet loss on scalable
(FGS-like) video in best-effort networks and derive a
closed-form expression for the loss penalty imposed on
embedded coding schemes under several simple loss
models. Through this analysis, we find that the utility
(i.e., usefulness to the user) of unprotected video
converges to zero as streaming rates become high. We
then study FEC-protected video streaming, re-derive the
same utility metric, and show that for all values of
loss rate inclusion of FEC overhead substantially
improves the utility of video compared to the
best-effort case. We finish the paper by constructing a
dynamic controller on the amount of FEC that maximizes
the utility of scalable video and show that the
resulting system achieves a significantly better PSNR
quality than alternative fixed-overhead methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "FEC rate control; Markov-chain loss; MPEG-4 FGS;
utility of video; video streaming",
}
@Article{Xue:2007:FPS,
author = "Guoliang Xue and Arunabha Sen and Weiyi Zhang and Jian
Tang and Krishnaiya Thulasiraman",
title = "Finding a path subject to many additive {QoS}
constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "201--211",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A fundamental problem in quality-of-service (QoS)
routing is to find a path between a source-destination
node pair that satisfies two or more end-to-end QoS
constraints. We model this problem using a graph with
$n$ vertices and $m$ edges with $K$ additive QoS
parameters associated with each edge, for any constant
$ K \geq 2$. This problem is known to be NP-hard. Fully
polynomial time approximation schemes (FPTAS) for the
case of $ K = 2$ have been reported in the literature.
We concentrate on the general case and make the
following contributions. (1) We present a very simple $
O(K m + n \log n)$ time $K$-approximation algorithm
that can be used in hop-by-hop routing protocols. (2)
We present an FPTAS for one optimization version of the
QoS routing problem with a time complexity of $ O(m(n /
\epsilon)^{K - 1})$. (3) We present an FPTAS for
another optimization version of the QoS routing problem
with a time complexity of $ O(n \log n + m (H /
\epsilon)^{K - 1})$ when there exists an $H$-hop path
satisfying all QoS constraints. When $K$ is reduced to
2, our results compare favorably with existing
algorithms. The results of this paper hold for both
directed and undirected graphs. For ease of
presentation, undirected graph is used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "efficient approximation algorithms; multiple additive
constraints; QoS routing",
}
@Article{Lee:2007:EPS,
author = "Yong Lee and Jianyu Lou and Junzhou Luo and Xiaojun
Shen",
title = "An efficient packet scheduling algorithm with deadline
guarantees for input-queued switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "212--225",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Input-queued (IQ) switches overcome the scalability
problem suffered by output-queued switches. In order to
provide differential quality of services (QoS), we need
to efficiently schedule a set of incoming packets so
that every packet can be transferred to its destined
output port before its deadline. If no such a schedule
exists, we wish to find one that allows a maximum
number of packets to meet their deadlines. Recently,
this problem has been proved to be NP-complete if three
or more distinct deadlines (classes) are present in the
set. In this paper, we propose a novel algorithm named
Flow-based Iterative Packet Scheduling (FIPS) for this
scheduling problem. A key component in FIPS is a
non-trivial algorithm that solves the problem for the
case where two classes are present in the packet set.
By repeatedly applying the algorithm for two classes,
we solve the general case of an arbitrary number of
classes more efficiently. Applying FIPS to a
frame-based model effectively achieves differential QoS
provision in IQ switches. Using simulations, we have
compared FIPS performance with five well-known existing
heuristic algorithms including Earliest-Deadline-First
(EDF), Minimum-Laxity-First (MLF) and their variants.
The simulation results demonstrate that our new
algorithm solves the deadline guaranteed packet
scheduling problem with a much higher success rate and
a much lower packet drop ratio than all other
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "input-queued switch; network flow; packet scheduling;
quality of service; real time scheduling",
}
@Article{Fayoumi:2007:SMB,
author = "Ayman G. Fayoumi and Anura P. Jayasumana",
title = "A surjective-mapping based model for optical
shared-buffer cross-connect",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "226--233",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A Surjective-Mapping based Model (SMM) is developed to
evaluate the performance of a slotted optical
shared-buffer cross-connect. The model is simple,
accurate, and yet provides comprehensive performance
characteristics of the switch. The model also overcomes
the limitations of traditional Markovian based models
in evaluating moderate to large switches, associated
with the explosion of number of states. The model is
verified using simulation results for different switch
sizes and different numbers of delay lines. The model
enables dimensioning the switch architecture to meet
the target performance. Performance of optical
shared-buffer cross-connect is analyzed in detail, in
terms of blocking probability, delay distribution, and
delay line utilization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "combinatorics; optical communication; packet
switching; shared memory; simulations",
}
@Article{Zhang:2007:LOW,
author = "Zhenghao Zhang and Yuanyuan Yang",
title = "On-line optimal wavelength assignment in {WDM}
networks with shared wavelength converter pool",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "234--245",
month = feb,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study on-line wavelength assignment
in wavelength-routed WDM networks under both unicast
and multicast traffic where nodes in the networks have
wavelength conversion ability. Since wavelength
converters are still expensive and difficult to
implement, we consider the case where nodes in networks
have only a limited number of converters that are
shared by all input channels. We study the problem of
setting up connections in such networks using minimum
number of wavelength converters. For unicast traffic,
we first study the problem of setting up a lightpath on
a given link-path with minimum number of conversions.
We give a simple algorithm that solves it in $ O(t k) $
time where $t$ is the number of links on the path and
$k$ is the number of wavelengths per fiber, as compared
to the best known existing method that needs to
construct an auxiliary graph and apply the Dijkstra's
algorithm. We also consider the problem of setting up a
lightpath while using wavelength converters at nodes
with fewer available converters only when necessary,
and give an $ O(t k)$ time algorithm. We then
generalize this technique to WDM networks with
arbitrary topologies and give an algorithm that sets up
an optimal lightpath network-wide in $ O(N k + L k)$
time, where $N$ and $L$ are the number of nodes and
links in the network, respectively. We also consider
multicast traffic in this paper. Finding an optimal
multicast light-tree is known to be NP-hard and is
usually solved by first finding a link-tree then
finding a light-tree on the link-tree. Finding an
optimal link-tree is also NP-hard and has been
extensively studied. Thus, we focus on the second
problem which is to set up a light-tree on a given
link-tree with minimum number of conversions. We
propose a new multicast conversion model with which the
output of the wavelength converter is split-table to
save the usage of converters. We show that under this
model the problem of setting up an optimal light-tree
is NP-hard and then give efficient heuristics to solve
it approximately.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multicast; on-line algorithms; optical networks;
routing; shared wavelength converter pool; unicast;
wavelength assignment; wavelength conversion;
wavelength division multiplexing (WDM)",
}
@Article{Feamster:2007:NWP,
author = "Nick Feamster and Jennifer Rexford",
title = "Network-wide prediction of {BGP} routes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "253--266",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents provably correct algorithms for
computing the outcome of the BGP route-selection
process for each router in a network, without
simulating the complex details of BGP message passing.
The algorithms require only static inputs that can be
easily obtained from the routers: the BGP routes
learned from neighboring domains, the import policies
configured on the BGP sessions, and the internal
topology. Solving the problem would be easy if the
route-selection process were deterministic and every
router received all candidate BGP routes. However, two
important features of BGP--the Multiple Exit
Discriminator (MED) attribute and route
reflectors--violate these properties. After presenting
a simple route-prediction algorithm for networks that
do not use these features, we present algorithms that
capture the effects of the MED attribute and route
reflectors in isolation. Then, we explain why the
interaction between these two features precludes
efficient route prediction. These two features also
create difficulties for the operation of BGP itself,
leading us to suggest improvements to BGP that achieve
the same goals as MED and route reflection without
introducing the negative side effects.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "networks; protocols; routing",
}
@Article{DiBattista:2007:CTR,
author = "Giuseppe {Di Battista} and Thomas Erlebach and
Alexander Hall and Maurizio Patrignani and Maurizio
Pizzonia and Thomas Schank",
title = "Computing the types of the relationships between
autonomous systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "267--280",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the problem of computing the types of
the relationships between Internet Autonomous Systems.
We refer to the model introduced by Gao [IEEE/ACM
TRANSACTIONS ON NETWORKING, 9(6):733-645, 2001] and
Subramanian et al. (IEEE Infocom, 2002) that bases the
discovery of such relationships on the analysis of the
AS paths extracted from the BGP routing tables. We
characterize the time complexity of the above problem,
showing both NP-completeness results and efficient
algorithms for solving specific cases. Motivated by the
hardness of the general problem, we propose
approximation algorithms and heuristics based on a
novel paradigm and show their effectiveness against
publicly available data sets. The experiments provide
evidence that our algorithms perform significantly
better than state-of-the-art heuristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; Internet; routing",
}
@Article{Ji:2007:CHS,
author = "Ping Ji and Zihui Ge and Jim Kurose and Don Towsley",
title = "A comparison of hard-state and soft-state signaling
protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "281--294",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the key infrastructure components in all
telecommunication networks, ranging from the telephone
network to VC-oriented data networks to the Internet,
is its signaling system. Two broad approaches towards
signaling can be identified: so-called hard-state and
soft-state approaches. Despite the fundamental
importance of signaling, our understanding of these
approaches--their pros and cons and the circumstances
in which they might best be employed--is mostly
anecdotal (and, occasionally, religious). In this
paper, we compare and contrast a variety of signaling
approaches ranging from `pure' soft state to soft-state
approaches augmented with explicit state removal and/or
reliable signaling, to a `pure' hard state approach. We
develop an analytic model that allows us to quantify
state inconsistency in single- and multiple-hop
signaling scenarios, and the `cost' (both in terms of
signaling overhead and application-specific costs
resulting from state inconsistency) associated with a
given signaling approach and its parameters (e.g.,
state refresh and removal timers). Among the class of
soft-state approaches, we find that a soft-state
approach coupled with explicit removal substantially
improves the degree of state consistency while
introducing little additional signaling message
overhead. The addition of reliable explicit
setup/update/removal allows the soft-state approach to
achieve comparable (and sometimes better) consistency
than that of the hard-state approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication system signaling; hard-state;
performance evaluation; soft-state",
}
@Article{Jelenkovic:2007:SWN,
author = "Predrag R. Jelenkovi{\'c} and Petar
Mom{\v{c}}ilovi{\'c} and Mark S. Squillante",
title = "Scalability of wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "295--308",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the existence of scalable
protocols that can achieve the capacity limit of $ c
\sqrt {N} $ per source-destination pair in a large
wireless network of $N$ nodes when the buffer space of
each node does not grow with the size of the network
$N$. It is shown that there is no end-to-end protocol
capable of carrying out the limiting throughput of $ c
\sqrt {N}$ with nodes that have constant buffer space.
In other words, this limit is achievable only with
devices whose buffers grow with the size of the
network. On the other hand, the paper establishes that
there exists a protocol which realizes a slightly
smaller throughput of $ c \sqrt {N \log N}$ when
devices have constant buffer space. Furthermore, it is
shown that the required buffer space can be very small,
capable of storing just a few packets. This is
particularly important for wireless sensor networks
where devices have limited resources. Finally, from a
mathematical perspective, the paper furthers our
understanding of the difficult problem of analyzing
large queueing networks with finite buffers for which,
in general, no explicit solutions are available.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc wireless networks; finite-buffer queueing
networks; large-scale networks; local cooperation;
scaling laws; wireless sensor networks",
}
@Article{Ng:2007:TAI,
author = "Ping Chung Ng and Soung Chang Liew",
title = "Throughput analysis of {IEEE802.11} multi-hop ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "309--322",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In multi-hop ad hoc networks, stations may pump more
traffic into the networks than can be supported,
resulting in high packet-loss rate, re-routing
instability and unfairness problems. This paper shows
that controlling the offered load at the sources can
eliminate these problems. To verify the simulation
results, we set up a real 6-node multi-hop network. The
experimental measurements confirm the existence of the
optimal offered load. In addition, we provide an
analysis to estimate the optimal offered load that
maximizes the throughput of a multi-hop traffic flow.
We believe this is a first paper in the literature to
provide a quantitative analysis (as opposed to
simulation) for the impact of hidden nodes and signal
capture on sustainable throughput. The analysis is
based on the observation that a large-scale 802.11
network with hidden nodes is a network in which the
carrier-sensing capability breaks down partially. Its
performance is therefore somewhere between that of a
carrier-sensing network and that of an Aloha network.
Indeed, our analytical closed-form solution has the
appearance of the throughput equation of the Aloha
network. Our approach allows one to identify whether
the performance of an 802.11 network is hidden-node
limited or spatial-reuse limited.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; capacity; IEEE 802.11; multi-hop
networks; performance analysis; wireless networks",
}
@Article{Boggia:2007:FBC,
author = "Gennaro Boggia and Pietro Camarda and Luigi Alfredo
Grieco and Saverio Mascolo",
title = "Feedback-based control for providing real-time
services with the 802.11e {MAC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "323--333",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The 802.11e working group has recently proposed the
hybrid coordination function (HCF) to provide service
differentiation for supporting real-time transmissions
over 802.11 WLANs. The HCF is made of a
contention-based channel access, known as enhanced
distributed coordination access, and of a HCF
controlled channel access (HCCA), which requires a
Hybrid Coordinator for bandwidth allocation to nodes
hosting applications with QoS requirements. The 802.11e
proposal includes a simple scheduler providing a
Constant Bit Rate service, which is not well suited for
bursty media flows. This paper proposes two
feedback-based bandwidth allocation algorithms to be
used within the HCCA, which have been referred to as
feedback based dynamic scheduler (FBDS) and
proportional-integral (PI)-FBDS. These algorithms have
been designed with the objective of providing services
with bounded delays. Given that the 802.11e standard
allows queue lengths to be fed back, a control
theoretic approach has been employed to design the
FBDS, which exploits a simple proportional controller,
and the PI-FBDS, which implements a
proportional-integral controller. Proposed algorithms
can be easily implemented since their computational
complexities scale linearly with the number of traffic
streams. Moreover, a call admission control scheme has
been proposed as an extension of the one described in
the 802.11e draft. Performance of the proposed
algorithms have been theoretically analyzed and
computer simulations, using the ns-2 simulator, have
been carried out to compare their behaviors in
realistic scenarios where video, voice, and FTP flows,
coexist at various network loads.\par
Simulation results have shown that, unlike the simple
scheduler of the 802.11e draft, both FBDS and PI-FBDS
are able to provide services with real-time
constraints. However, while the FBDS admits a smaller
quota of traffic streams than the simple scheduler,
PI-FBDS allows the same quota of traffic that would be
admitted using the simple scheduler, but still
providing delay bound guarantees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "qos; real-time applications; wireless networks",
}
@Article{Liu:2007:MLS,
author = "Hai Liu and Xiaohua Jia and Peng-Jun Wan and Chih-Wei
Yi and S. Kami Makki and Niki Pissinou",
title = "Maximizing lifetime of sensor surveillance systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "334--345",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the maximal lifetime scheduling
problem in sensor surveillance systems. Given a set of
sensors and targets in an area, a sensor can watch only
one target at a time, our task is to schedule sensors
to watch targets and forward the sensed data to the
base station, such that the lifetime of the
surveillance system is maximized, where the lifetime is
the duration that all targets are watched and all
active sensors are connected to the base station. We
propose an optimal solution to find the target-watching
schedule for sensors that achieves the maximal
lifetime. Our solution consists of three steps: (1)
computing the maximal lifetime of the surveillance
system and a workload matrix by using the linear
programming technique; (2) decomposing the workload
matrix into a sequence of schedule matrices that can
achieve the maximal lifetime; and (3) determining the
sensor surveillance trees based on the above obtained
schedule matrices, which specify the active sensors and
the routes to pass sensed data to the base station.
This is the first time in the literature that the
problem of maximizing lifetime of sensor surveillance
systems has been formulated and the optimal solution
has been found.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "energy efficiency; lifetime; scheduling; sensor
network; surveillance system",
}
@Article{Camtepe:2007:CDK,
author = "Seyit A. {\c{C}}amtepe and B{\"u}lent Yener",
title = "Combinatorial design of key distribution mechanisms
for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "346--358",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Secure communications in wireless sensor networks
operating under adversarial conditions require
providing pairwise (symmetric) keys to sensor nodes. In
large scale deployment scenarios, there is no priory
knowledge of post deployment network configuration
since nodes may be randomly scattered over a hostile
territory. Thus, shared keys must be distributed before
deployment to provide each node a key-chain. For large
sensor networks it is infeasible to store a unique key
for all other nodes in the key-chain of a sensor node.
Consequently, for secure communication either two nodes
have a key in common in their key-chains and they have
a wireless link between them, or there is a path,
called key-path, among these two nodes where each pair
of neighboring nodes on this path have a key in common.
Length of the key-path is the key factor for efficiency
of the design.\par
This paper presents novel deterministic and hybrid
approaches based on Combinatorial Design for deciding
how many and which keys to assign to each key-chain
before the sensor network deployment. In particular,
Balanced Incomplete Block Designs (BIBD) and
Generalized Quadrangles (GQ) are mapped to obtain
efficient key distribution schemes. Performance and
security properties of the proposed schemes are studied
both analytically and computationally.\par
Comparison to related work shows that the combinatorial
approach produces better connectivity with smaller
key-chain sizes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "combinatorial design theory; generalized quadrangles
(GQ); key management; key pre-distribution
(deterministic and hybrid); key-chains; security in
wireless sensor networks (WSN); symmetric balanced
incomplete block design (BIBD)",
}
@Article{Nelakuditi:2007:FLR,
author = "Srihari Nelakuditi and Sanghwan Lee and Yinzhe Yu and
Zhi-Li Zhang and Chen-Nee Chuah",
title = "Fast local rerouting for handling transient link
failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "359--372",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Link failures are part of the day-to-day operation of
a network due to many causes such as maintenance,
faulty interfaces, and accidental fiber cuts. Commonly
deployed link state routing protocols such as OSPF
react to link failures through global link state
advertisements and routing table recomputations causing
significant forwarding discontinuity after a failure.
Careful tuning of various parameters to accelerate
routing convergence may cause instability when the
majority of failures are transient. To enhance failure
resiliency without jeopardizing routing stability, we
propose a local rerouting based approach called failure
insensitive routing. The proposed approach prepares for
failures using interface-specific forwarding, and upon
a failure, suppresses the link state advertisement and
instead triggers local rerouting using a backwarding
table. With this approach, when no more than one link
failure notification is suppressed, a packet is
guaranteed to be forwarded along a loop-free path to
its destination if such a path exists. This paper
demonstrates the feasibility, reliability, and
stability of our approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fast rerouting; interface-specific forwarding;
transient failures",
}
@Article{Fahmy:2007:COM,
author = "Sonia Fahmy and Minseok Kwon",
title = "Characterizing overlay multicast networks and their
costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "373--386",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay networks among cooperating hosts have recently
emerged as a viable solution to several challenging
problems, including multicasting, routing, content
distribution, and peer-to-peer services.
Application-level overlays, however, incur a
performance penalty over router-level solutions. This
paper quantifies and explains this performance penalty
for overlay multicast trees via: (1) Internet
experimental data; (2) simulations; and (3) theoretical
models. We compare a number of overlay multicast
protocols with respect to overlay tree structure, and
underlying network characteristics. Experimental data
and simulations illustrate that the mean number of hops
and mean per-hop delay between parent and child hosts
in overlay trees generally decrease as the level of the
host in the overlay tree increases. Overlay multicast
routing strategies, overlay host distribution, and
Internet topology characteristics are identified as
three primary causes of the observed phenomenon. We
show that this phenomenon yields overlay tree cost
savings: Our results reveal that the normalized cost $
L(n) / U(n) $ is $ \infty n^{0.9} $ for small $n$,
where $ L(n)$ is the total number of hops in all
overlay links, $ U(n)$ is the average number of hops on
the source to receiver unicast paths, and $n$ is the
number of members in the overlay multicast session.
This can be compared to an IP multicast cost
proportional to $ n^{0.6}$ to $ n^{0.8}$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "economies of scale; group communication; Internet
multicast; overlay multicast; overlay networks",
}
@Article{Bozinovski:2007:MAS,
author = "Marjan Bozinovski and Hans P. Schwefel and Ramjee
Prasad",
title = "Maximum availability server selection policy for
efficient and reliable session control systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "387--399",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There has been a rapid growth of services based on
session control. Session-based services comprise
multimedia conferences, Internet telephone calls,
instant messaging, and similar applications consisting
of one or more media types such as audio and video.
Deployment examples include session control services as
part of the IP multimedia subsystem (IMS), in the
third-generation mobile networks. High service
dependability in session control systems is achieved by
introducing redundancy, e.g., through reliable server
pooling (RSerPool) or clustering. Namely, session
control servers are multiplied in server sets.
Performance of such replicated session control servers
is quantified by transaction control time. Thus,
reducing transaction control time enhances performance.
Server selection policies (SSP) are crucial in
achieving this goal. The maximum availability (MA) SSP
is proposed to improve session control performance in
scenarios with server and communication failures. Based
on a status vector, MA aims at maximizing the
probability of successful transaction with the current
transmission, thereby minimizing the average number of
attempted servers until success. MA is applicable in a
broad range of IP-based systems and services, and it is
independent of the fault-tolerant platform. A simple
protocol extension is proposed in order to integrate MA
into the RSerPool fault-tolerant architecture. In
addition, an analytic model is derived based on certain
system model assumptions. Analytic and simulation
results show that transaction control time is
considerably reduced with MA as opposed to when using
traditional round robin.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fault-tolerance; performance; server selection
policies (SSP); session control",
}
@Article{Alicherry:2007:SPP,
author = "Mansoor Alicherry and Randeep Bhatia",
title = "Simple pre-provisioning scheme to enable fast
restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "400--412",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Supporting fast restoration for general mesh
topologies with minimal network over-build is a
technically challenging problem. Traditionally,
ring-based SONET networks have offered close to 50 ms
restoration at the cost of requiring 100\% over-build.
Recently, fast (local) reroute has gained momentum in
the context of MPLS networks. Fast reroute, when
combined with pre-provisioning of protection capacities
and bypass tunnels, enables faster restoration times in
mesh networks. Pre-provisioning has the additional
advantage of greatly simplifying network routing and
signaling. Thus, even for protected connections, online
routing can now be oblivious to the offered protection,
and may only involve single shortest path
computations.\par
In this paper, we are interested in the problem of
reserving the least amount of the network capacity for
protection, while guaranteeing fast (local)
reroute-based restoration for all the supported
connections. We show that the problem is NP-complete,
and we present efficient approximation algorithms for
the problem. The solution output by our algorithms is
guaranteed to use at most twice the protection
capacity, compared to any optimal solution. These
guarantees are provided even when the protection is for
multiple link failures. In addition, the total amount
of protection capacity reserved by these algorithms is
just a small fraction of the amount reserved by
existing ring-based schemes (e.g., SONET), especially
on dense networks. The presented algorithms are
computationally efficient, and can even be implemented
on the network elements. Our simulation, on some
standard core networks, show that our algorithms work
well in practice as well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; fast shared restoration;
local reroute; MPLS; optical; pre-provisioning",
}
@Article{Banner:2007:MRA,
author = "Ron Banner and Ariel Orda",
title = "Multipath routing algorithms for congestion
minimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "413--424",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Unlike traditional routing schemes that route all
traffic along a single path, multipath routing
strategies split the traffic among several paths in
order to ease congestion. It has been widely recognized
that multipath routing can be fundamentally more
efficient than the traditional approach of routing
along single paths. Yet, in contrast to the single-path
routing approach, most studies in the context of
multipath routing focused on heuristic methods. We
demonstrate the significant advantage of optimal (or
near optimal) solutions. Hence, we investigate
multipath routing adopting a rigorous (theoretical)
approach. We formalize problems that incorporate two
major requirements of multipath routing. Then, we
establish the intractability of these problems in terms
of computational complexity. Finally, we establish
efficient solutions with proven performance
guarantees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "computer networks; congestion avoidance; routing
protocols",
}
@Article{Stauffer:2007:PHD,
author = "Alexandre O. Stauffer and Valmir C. Barbosa",
title = "Probabilistic heuristics for disseminating information
in networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "425--435",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of disseminating a piece of
information through all the nodes of a network, given
that it is known originally only to a single node. In
the absence of any structural knowledge on the network,
other than the nodes' neighborhoods, this problem is
traditionally solved by flooding all the network's
edges. We analyze a recently introduced probabilistic
algorithm for flooding and give an alternative
probabilistic heuristic that can lead to some
cost-effective improvements, like better trade-offs
between the message and time complexities involved. We
analyze the two algorithms, both mathematically and by
means of simulations, always within a random-graph
framework and considering relevant node-degree
distributions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "heuristic flooding; probabilistic flooding; random
networks",
}
@Article{Chang:2007:CFS,
author = "Nicholas B. Chang and Mingyan Liu",
title = "Controlled flooding search in a large network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "436--449",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of searching
for a node or an object (i.e., piece of data, file,
etc.) in a large network. Applications of this problem
include searching for a destination node in a mobile ad
hoc network, querying for a piece of desired data in a
wireless sensor network, and searching for a shared
file in an unstructured peer-to-peer network. We
consider the class of controlled flooding search
strategies where query/search packets are broadcast and
propagated in the network until a preset time-to-live
(TTL) value carried in the packet expires. Every
unsuccessful search attempt, signified by a timeout at
the origin of the search, results in an increased TTL
value (i.e., larger search area) and the same process
is repeated until the object is found. The primary goal
of this study is to find search strategies (i.e.,
sequences of TTL values) that will minimize the cost of
such searches associated with packet transmissions.
Assuming that the probability distribution the object
location is not known a priori, we derive search
strategies that minimize the search cost in the
worst-case, via a performance measure in the form of
the competitive ratio between the average search cost
of a strategy and that of an omniscient observer. This
ratio is shown in prior work to be asymptotically (as
the network size grows to infinity) lower bounded by 4
among all deterministic search strategies. In this
paper, we show that by using randomized strategies
(i.e., successive TTL values are chosen from certain
probability distributions rather than deterministic
values), this ratio is asymptotically lower bounded by
e. We derive an optimal strategy that achieves this
lower bound, and discuss its performance under other
criteria. We further introduce a class of randomized
strategies that are sub-optimal but potentially more
useful in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "best worst-case performance; competitive ratio;
controlled flooding search; query and search;
randomized strategy; time-to-live (TTL); wireless
networks",
}
@Article{Ioannou:2007:PHP,
author = "Aggelos Ioannou and Manolis G. H. Katevenis",
title = "Pipelined heap (priority queue) management for
advanced scheduling in high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "450--461",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Per-flow queueing with sophisticated scheduling is one
of the methods for providing advanced quality of
service (QoS) guarantees. The hardest and most
interesting scheduling algorithms rely on a common
computational primitive, implemented via priority
queues. To support such scheduling for a large number
of flows at OC-192 (10 Gb/s) rates and beyond,
pipelined management of the priority queue is needed.
Large priority queues can be built using either
calendar queues or heap data structures; heaps feature
smaller silicon area than calendar queues. We present
heap management algorithms that can be gracefully
pipelined; they constitute modifications of the
traditional ones. We discuss how to use pipelined heap
managers in switches and routers and their
cost-performance tradeoffs. The design can be
configured to any heap size, and, using 2-port 4-wide
SRAMs, it can support initiating a new operation on
every clock cycle, except that an insert operation or
one idle (bubble) cycle is needed between two
successive delete operations. We present a pipelined
heap manager implemented in synthesizable Verilog form,
as a core integratable into ASICs, along with cost and
performance analysis information. For a 16K entry
example in 0.13-$ \mu $ m CMOS technology, silicon area
is below 10 mm$^2$ (less than 8\% of a typical ASIC
chip) and performance is a few hundred million
operations per second. We have verified our design by
simulating it against three heap models of varying
abstraction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "high-speed network scheduling; pipelined hard-ware
heap; priority queue; synthesizable core; weighted fair
queueing; weighted round robin",
}
@Article{Lu:2007:MPC,
author = "Haibin Lu and Sartaj Sahni",
title = "{$ O(\log W) $} multidimensional packet
classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "462--472",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We use a collection of hash tables to represent a
multidimensional packet classification table. These
hash tables are derived from a trie-representation of
the multidimensional classifier. The height of this
trie is $ O(W) $, where $W$ is the sum of the maximum
possible length, in bits, of each of the fields of a
filter. The leaves at level $i$ of the trie together
with markers for some of the leaves at levels $j$ such
that $ j > i$ are stored in a hash table $ H_i$. The
placement of markers is such that a binary search of
the $ H_i$'s successfully locates the highest-priority
filter that matches any given packet. The number of
hash tables equals the trie height, $ O(W)$. Hence, a
packet may be classified by performing $ O(\log W)$
hash-table lookups. So the expected lookup-complexity
of our data structure for multidimensional packet
classification is $ O(\log W)$. Our proposed scheme
affords a memory advantage over the $ O(\log W)$ 1-D
scheme of Waldvogel et al. For multidimensional packet
classification, our proposed scheme provides both a
time and memory advantage over the extended
grid-of-tries scheme of Baboescu et al.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "binary search on levels; expected complexity;
multidimensional packet classification",
}
@Article{Brosh:2007:AHA,
author = "Eli Brosh and Asaf Levin and Yuval Shavitt",
title = "Approximation and heuristic algorithms for
minimum-delay application-layer multicast trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "2",
pages = "473--484",
month = apr,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:54:43 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper we investigate the problem of finding
minimum-delay application-layer multicast trees, such
as the trees constructed in overlay networks. It is
accepted that shortest path trees are not a good
solution for the problem since such trees can have
nodes with very large degree, termed high-load nodes.
The load on these nodes makes them a bottleneck in the
distribution tree, due to computation load and access
link bandwidth constraints. Many previous solutions
limited the maximum degree of the nodes by introducing
arbitrary constraints. In this work, we show how to
directly map the node load to the delay penalty at the
application host, and create a new model that captures
the trade offs between the desire to select shortest
path trees and the need to constrain the load on the
hosts. In this model the problem is shown to be
NP-hard. We therefore present an approximation
algorithm and an alternative heuristic algorithm. Our
heuristic algorithm is shown by simulations to be
scalable for large group sizes, and produces results
that are very close to optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; overlay networks;
peer-to-peer communications",
}
@Article{Soule:2007:EDT,
author = "Augustin Soule and Antonio Nucci and Rene L. Cruz and
Emilio Leonardi and Nina Taft",
title = "Estimating dynamic traffic matrices by using viable
routing changes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "485--498",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper we propose a new approach for dealing
with the ill-posed nature of traffic matrix estimation.
We present three solution enhancers: an algorithm for
deliberately changing link weights to obtain additional
information that can make the underlying linear system
full rank; a cyclo-stationary model to capture both
long-term and short-term traffic variability, and a
method for estimating the variance of
origin-destination (OD) flows. We show how these three
elements can be combined into a comprehensive traffic
matrix estimation procedure that dramatically reduces
the errors compared to existing methods. We demonstrate
that our variance estimates can be used to identify the
elephant OD flows, and we thus propose a variant of our
algorithm that addresses the problem of estimating only
the heavy flows in a traffic matrix. One of our key
findings is that by focusing only on heavy flows, we
can simplify the measurement and estimation procedure
so as to render it more practical. Although there is a
tradeoff between practicality and accuracy, we find
that increasing the rank is so helpful that we can
nevertheless keep the average errors consistently below
the 10\% carrier target error rate. We validate the
effectiveness of our methodology and the intuition
behind it using commercial traffic matrix data from
Sprint's Tier-1 backbone.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network tomography; SNMP; traffic engineering; traffic
matrix estimation",
}
@Article{Taylor:2007:CPC,
author = "David E. Taylor and Jonathan S. Turner",
title = "{ClassBench}: a packet classification benchmark",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "499--511",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is an enabling technology for
next generation network services and often a
performance bottleneck in high-performance routers. The
performance and capacity of many classification
algorithms and devices, including TCAMs, depend upon
properties of filter sets and query patterns. Despite
the pressing need, no standard performance evaluation
tools or filter sets are publicly available. In
response to this problem, we present ClassBench, a
suite of tools for benchmarking packet classification
algorithms and devices. ClassBench includes a Filter
Set Generator that produces synthetic filter sets that
accurately model the characteristics of real filter
sets. Along with varying the size of the filter sets,
we provide high-level control over the composition of
the filters in the resulting filter set. The tool suite
also includes a Trace Generator that produces a
sequence of packet headers to exercise packet
classification algorithms with respect to a given
filter set. Along with specifying the relative size of
the trace, we provide a simple mechanism for
controlling locality of reference. While we have
already found ClassBench to be very useful in our own
research, we seek to eliminate the significant access
barriers to realistic test vectors for researchers and
initiate a broader discussion to guide the refinement
of the tools and codification of a formal benchmarking
methodology. (The ClassBench tools are publicly
available at the following site:
\path=http://www.arl.wustl.edu/~det3/ClassBench/=.)",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication systems; computer network performance;
packet classification; packet switching",
}
@Article{Mehyar:2007:ADA,
author = "Mortada Mehyar and Demetri Spanos and John Pongsajapan
and Steven H. Low and Richard M. Murray",
title = "Asynchronous distributed averaging on communication
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "512--520",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See correction \cite{Kriegleder:2014:CAA}.",
abstract = "Distributed algorithms for averaging have attracted
interest in the control and sensing literature.
However, previous works have not addressed some
practical concerns that will arise in actual
implementations on packet-switched communication
networks such as the Internet. In this paper, we
present several implementable algorithms that are
robust to asynchronism and dynamic topology changes.
The algorithms are completely distributed and do not
require any global coordination. In addition, they can
be proven to converge under very general asynchronous
timing assumptions. Our results are verified by both
simulation and experiments on Planetlab, a real-world
TCP/IP network. We also present some extensions that
are likely to be useful in applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous computation; distributed averaging",
}
@Article{Koutsopoulos:2007:JOA,
author = "Iordanis Koutsopoulos and Leandros Tassiulas",
title = "Joint optimal access point selection and channel
assignment in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "521--532",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless cellular networks or in other networks
with single-hop communication, the fundamental access
control problem pertains to access point (AP) selection
and channel allocation for each user. For users in the
coverage area of one AP, this involves only channel
allocation. However, users that belong in the
intersection of coverage areas of more than one AP can
select the appropriate AP to establish connection and
implicitly affect the channel assignment procedure. We
address the joint problem of AP selection and channel
assignment with the objective to satisfy a given user
load vector with the minimum number of channels. Our
major finding is that the joint problem reduces to
plain channel allocation in a cellular network that
emerges from the original one after executing an
iterative and provably convergent clique load balancing
algorithm. For linear cellular networks, our approach
leads to minimum number of required channels to serve a
given load vector. For 2-D cellular networks, the same
approach leads to a heuristic algorithm with a
suboptimal solution due to the fact that clique loads
cannot be balanced. Numerical results demonstrate the
performance benefits of our approach in terms of
blocking probability in a dynamic scenario with
time-varying number of connection requests. The
presented approach constitutes the basis for addressing
more composite resource allocation problems in
different context.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access point (AP) assignment; channel allocation; load
balancing; wireless access",
}
@Article{Sabharwal:2007:OSU,
author = "Ashutosh Sabharwal and Ahmad Khoshnevis and Edward
Knightly",
title = "Opportunistic spectral usage: bounds and a multi-band
{CSMA\slash CA} protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "533--545",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the gains from opportunistic
spectrum usage when neither sender or receiver are
aware of the current channel conditions in different
frequency bands. Hence to select the best band for
sending data, nodes first need to measure the channel
in different bands which takes time away from sending
actual data. We analyze the gains from opportunistic
band selection by deriving an optimal skipping rule,
which balances the throughput gain from finding a good
quality band with the overhead of measuring multiple
bands. We show that opportunistic band skipping is most
beneficial in low signal to noise scenarios, which are
typically the cases when the node throughput in
single-band (no opportunism) system is the minimum. To
study the impact of opportunism on network throughput,
we devise a CSMA/CA protocol, Multi-band Opportunistic
Auto Rate (MOAR), which implements the proposed
skipping rule on a per node pair basis. The proposed
protocol exploits both time and frequency diversity,
and is shown to result in typical throughput gains of
20\% or more over a protocol which only exploits time
diversity, Opportunistic Auto Rate (OAR).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "802.11; capacity bounds; CSMA/CA; measurement
overhead; multi-channel; opportunistic access",
}
@Article{Sundaresan:2007:UML,
author = "Karthikeyan Sundaresan and Raghupathy Sivakumar",
title = "A unified {MAC} layer framework for ad-hoc networks
with smart antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "546--559",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Smart antennas represent a broad variety of antennas
that differ in their performance and transceiver
complexity. The superior capabilities of smart
antennas, however, can be leveraged only through
appropriately designed higher layer network protocols,
including at the medium access control (MAC) layer.
Although several related works have considered such
tailored protocols, they do so in the context of
specific antenna technologies. In this paper, we
explore the possibility for a unified approach to
medium access control in ad hoc networks with smart
antennas. We first present a unified representation of
the PHY layer capabilities of the different types of
smart antennas, and their relevance to MAC layer
design. We then define a unified MAC problem
formulation, and derive unified MAC algorithms (both
centralized and distributed) from the formulation.
Finally, using the algorithms developed, we investigate
the relative performance trade-offs of the different
technologies under varying network conditions. We also
analyze theoretically the performance bounds of the
different smart antenna technologies when the available
gains are exploited for rate increase and communication
range increase.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; medium access control; smart
antennas",
}
@Article{Bejerano:2007:FLB,
author = "Yigal Bejerano and Seung-Jae Han and Li Li",
title = "Fairness and load balancing in wireless {LANs} using
association control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "560--573",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The traffic load of wireless LANs is often unevenly
distributed among the access points (APs), which
results in unfair bandwidth allocation among users. We
argue that the load imbalance and consequent unfair
bandwidth allocation can be greatly reduced by
intelligent association control. In this paper, we
present an efficient solution to determine the user-AP
associations for max-min fair bandwidth allocation. We
show the strong correlation between fairness and load
balancing, which enables us to use load balancing
techniques for obtaining optimal max-min fair bandwidth
allocation. As this problem is NP-hard, we devise
algorithms that achieve constant-factor approximation.
In our algorithms, we first compute a fractional
association solution, in which users can be associated
with multiple APs simultaneously. This solution
guarantees the fairest bandwidth allocation in terms of
max-min fairness. Then, by utilizing a rounding method,
we obtain the integral solution from the fractional
solution. We also consider time fairness and present a
polynomial-time algorithm for optimal integral
solution. We further extend our schemes for the on-line
case where users may join and leave dynamically. Our
simulations demonstrate that the proposed algorithms
achieve close to optimal load balancing (i.e., max-min
fairness) and they outperform commonly used
heuristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; IEEE 802.11 WLANs; load
balancing; max-min fairness",
}
@Article{Vuran:2007:MAM,
author = "Mehmet C. Vuran and Ian F. Akyildiz",
title = "{A-MAC}: adaptive medium access control for next
generation wireless terminals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "574--587",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Next Generation (NG) wireless networks are envisioned
to provide high bandwidth to mobile users via bandwidth
aggregation over heterogeneous wireless architectures.
NG wireless networks, however, impose challenges due to
their architectural heterogeneity in terms of different
access schemes, resource allocation techniques as well
as diverse quality of service requirements. These
heterogeneities must be captured and handled
dynamically as mobile terminals roam between different
wireless architectures. However, to address these
challenges, the existing proposals require either a
significant modification in the network structure and
in base stations or a completely new architecture,
which lead to integration problems in terms of
implementation costs, scalability and backward
compatibility. Thus, the integration of the existing
medium access schemes, e.g., CSMA, TDMA and CDMA,
dictates an adaptive and seamless medium access control
(MAC) layer that can achieve high network utilization
and meet diverse Quality of Service (QoS)
requirements.\par
In this paper, an adaptive medium access control
(A-MAC) layer is proposed to address the
heterogeneities posed by the NG wireless networks.
A-MAC introduces a two-layered MAC framework that
accomplishes the adaptivity to both architectural
heterogeneities and diverse QoS requirements. A novel
virtual cube concept is introduced as a unified metric
to model heterogeneous access schemes and capture their
behavior. Based on the Virtual Cube concept, A-MAC
provides architecture-independent decision and QoS
based scheduling algorithms for efficient multinetwork
access. A-MAC performs seamless medium access to
multiple networks without requiring any additional
modifications in the existing network structures. It is
shown via extensive simulations that A-MAC provides
adaptivity to the heterogeneities in NG wireless
networks and achieves high performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "adaptive medium access control; heterogeneous
networks; heterogeneous QoS requirements; next
generation wireless networks; virtual cube concept",
}
@Article{Kumar:2007:NIF,
author = "Anurag Kumar and Eitan Altman and Daniele Miorandi and
Munish Goyal",
title = "New insights from a fixed-point analysis of single
cell {IEEE} 802.11 {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "588--601",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study a fixed-point formalization of the well-known
analysis of Bianchi. We provide a significant
simplification and generalization of the analysis. In
this more general framework, the fixed-point solution
and performance measures resulting from it are studied.
Uniqueness of the fixed point is established. Simple
and general throughput formulas are provided. It is
shown that the throughput of any flow will be bounded
by the one with the smallest transmission rate. The
aggregate throughput is bounded by the reciprocal of
the harmonic mean of the transmission rates. In an
asymptotic regime with a large number of nodes,
explicit formulas for the collision probability, the
aggregate attempt rate, and the aggregate throughput
are provided. The results from the analysis are
compared with ns 2 simulations and also with an exact
Markov model of the backoff process. It is shown how
the saturated network analysis can be used to obtain
TCP transfer throughputs in some cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CSMA/CA; performance of MAC protocols; wireless
networks",
}
@Article{Alparslan:2007:GRM,
author = "Denizhan N. Alparslan and Khosrow Sohraby",
title = "A generalized random mobility model for wireless ad
hoc networks and its analysis: one-dimensional case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "602--615",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless ad hoc networks, the ability to
analytically characterize the spatial distribution of
terminals plays a key role in understanding fundamental
network QoS measures such as throughput per source to
destination pair, probability of successful
transmission, and connectivity. Consequently, mobility
models that are general enough to capture the major
characteristics of a realistic movement profile, and
yet are simple enough to formulate its long-run
behavior, are highly desirable.\par
We propose a generalized random mobility model capable
of capturing several mobility scenarios and give a
mathematical framework for its exact analysis over
one-dimensional mobility terrains. The model provides
the flexibility to capture hotspots where mobiles
accumulate with higher probability and spend more time.
The selection process of hotspots is random and
correlations between the consecutive hotspot decisions
are successfully modeled. Furthermore, the times spent
at the destinations can be dependent on the location of
destination point, the speed of movement can be a
function of distance that is being traveled, and the
acceleration characteristics of vehicles can be
incorporated into the model. Our solution framework
formulates the model as a semi-Markov process using a
special discretization technique. We provide long-run
location and speed distributions by closed-form
expressions for one-dimensional regions (e.g., a
highway).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; long-run analysis; mobility modeling;
semi-Markov processes",
}
@Article{Alparslan:2007:TDM,
author = "Denizhan N. Alparslan and Khosrow Sohraby",
title = "Two-dimensional modeling and analysis of generalized
random mobility models for wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "616--629",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most important characteristics of wireless ad hoc
networks, such as link distance distribution,
connectivity, and network capacity are dependent on the
long-run properties of the mobility profiles of
communicating terminals. Therefore, the analysis of the
mobility models proposed for these networks becomes
crucial. The contribution of this paper is to provide
an analytical framework that is generalized enough to
perform the analysis of realistic random movement
models over two-dimensional regions. The synthetic
scenarios that can be captured include hotspots where
mobiles accumulate with higher probability and spend
more time, and take into consideration location and
displacement dependent speed distributions. By the
utilization of the framework to the random waypoint
mobility model, we derive an approximation to the
spatial distribution of terminals over rectangular
regions. We validate the accuracy of this approximation
via simulation, and by comparing the marginals with
proven results for one-dimensional regions, we find out
that the quality of the approximation is insensitive to
the proportion between dimensions of the terrain.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; long-run analysis; mobility modeling;
two-dimensional regions",
}
@Article{Lee:2007:MCN,
author = "Junsoo Lee and Stephan Bohacek and Jo{\~a}o P.
Hespanha and Katia Obraczka",
title = "Modeling communication networks with hybrid systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "630--643",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a general hybrid systems
framework to model the flow of traffic in communication
networks. The proposed models use averaging to
continuously approximate discrete variables such as
congestion window and queue size. Because averaging
occurs over short time intervals, discrete events such
as the occurrence of a drop and the consequent reaction
by congestion control can still be captured. This
modeling framework, thus, fills a gap between purely
packet-level and fluid-based models, faithfully
capturing the dynamics of transient phenomena and yet
providing significant flexibility in modeling various
congestion control mechanisms, different queueing
policies, multicast transmission, etc. The modeling
framework is validated by comparing simulations of the
hybrid models against packet-level simulations. It is
shown that the probability density functions produced
by the ns-2 network simulator match closely those
obtained with hybrid models. Moreover, a complexity
analysis supports the observation that in networks with
large per-flow bandwidths, simulations using hybrid
models require significantly less computational
resources than ns-2 simulations. Tools developed to
automate the generation and simulation of hybrid
systems models are also presented. Their use is
showcased in a study, which simulates TCP flows with
different roundtrip times over the Abilene backbone.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; data communication networks;
hybrid systems; simulation; TCP; UDP",
}
@Article{Leonard:2007:LBN,
author = "Derek Leonard and Zhongmei Yao and Vivek Rai and
Dmitri Loguinov",
title = "On lifetime-based node failure and stochastic
resilience of decentralized peer-to-peer networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "644--656",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To model P2P networks that are commonly faced with
high rates of churn and random departure decisions by
end-users, this paper investigates the resilience of
random graphs to lifetime-based node failure and
derives the expected delay before a user is forcefully
isolated from the graph and the probability that this
occurs within his/her lifetime. Using these metrics, we
show that systems with heavy-tailed lifetime
distributions are more resilient than those with
light-tailed (e.g., exponential) distributions and that
for a given average degree, $k$-regular graphs exhibit
the highest level of fault tolerance. As a practical
illustration of our results, each user in a system with
$ n = 100$ billion peers, 30-minute average lifetime,
and 1-minute node-replacement delay can stay connected
to the graph with probability $ 1 - 1 / n$ using only 9
neighbors. This is in contrast to 37 neighbors required
under previous modeling efforts. We finish the paper by
observing that many P2P networks are almost surely
(i.e., with probability $ 1 - o(1)$) connected if they
have no isolated nodes and derive a simple model for
the probability that a P2P system partitions under
churn.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "lifetime node failure; network disconnection;
peer-to-peer networks; stochastic resilience; user
isolation",
}
@Article{Neely:2007:LDT,
author = "Michael J. Neely and Eytan Modiano and Yuan-Sheng
Cheng",
title = "Logarithmic delay for {$ N \times N $} packet switches
under the crossbar constraint",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "657--668",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the fundamental delay bounds for
scheduling packets in an $ N \times N $ packet switch
operating under the crossbar constraint. Algorithms
that make scheduling decisions without considering
queue backlog are shown to incur an average delay of at
least $ O(N) $. We then prove that $ O(\log (N)) $
delay is achievable with a simple frame based algorithm
that uses queue backlog information. This is the best
known delay bound for packet switches, and is the first
analytical proof that sublinear delay is achievable in
a packet switch with random inputs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optimal control; scheduling; stochastic queueing
analysis",
}
@Article{Christin:2007:ECB,
author = "Nicolas Christin and J{\"o}rg Liebeherr and Tarek
Abdelzaher",
title = "Enhancing class-based service architectures with
adaptive rate allocation and dropping mechanisms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "669--682",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Class-based service differentiation can be realized
without resource reservation, admission control and
traffic policing. However, the resulting service
guarantees are only relative, in the sense that
guarantees given to a flow class at any time are
expressed with reference to the service given to other
flow classes. While it is, in principle, not feasible
to provision for absolute guarantees (i.e., to assure
lower bounds on service metrics at all times) without
admission control and/or traffic policing, we will show
in this paper that such a service can be reasonably
well emulated using adaptive rate allocation and
dropping mechanisms at the link schedulers of routers.
We name the resulting type of guarantees best-effort
bounds. We propose mechanisms for link schedulers of
routers that achieve these and other guarantees by
adjusting the drop rates and the service rate
allocations of traffic classes to current load
conditions. The mechanisms are rooted in control theory
and employ adaptive feedback loops. We demonstrate that
these mechanisms can realize many recently proposed
approaches to class-based service differentiation. The
effectiveness of the proposed mechanisms are evaluated
in measurement experiments of a kernel-level
implementation in FreeBSD PC-routers with multiple 100
Mbps Ethernet interfaces, complemented with simulations
of larger scale networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "best-effort bounds; buffer management; feedback
control; scheduling; service differentiation",
}
@Article{Krithikaivasan:2007:ABT,
author = "Balaji Krithikaivasan and Yong Zeng and Kaushik Deka
and Deep Medhi",
title = "{ARCH}-based traffic forecasting and dynamic bandwidth
provisioning for periodically measured nonstationary
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "683--696",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network providers are often interested in providing
dynamically provisioned bandwidth to customers based on
periodically measured nonstationary traffic while
meeting service level agreements (SLAs). In this paper,
we propose a dynamic bandwidth provisioning framework
for such a situation. In order to have a good sense of
nonstationary periodically measured traffic data,
measurements were first collected over a period of
three weeks excluding the weekends in three different
months from an Internet access link. To characterize
the traffic data rate dynamics of these data sets, we
develop a seasonal AutoRegressive Conditional
Heteroskedasticity (ARCH) based model with the
innovation process (disturbances) generalized to the
class of heavy-tailed distributions. We observed a
strong empirical evidence for the proposed model. Based
on the ARCH-model, we present a probability-hop
forecasting algorithm, an augmented forecast mechanism
using the confidence-bounds of the mean forecast value
from the conditional forecast distribution. For
bandwidth estimation, we present different bandwidth
provisioning schemes that allocate or deallocate the
bandwidth based on the traffic forecast generated by
our forecasting algorithm. These provisioning schemes
are developed to allow trade off between the
underprovisioning and the utilization, while addressing
the overhead cost of updating bandwidth. Based on
extensive studies with three different data sets, we
have found that our approach provides a robust dynamic
bandwidth provisioning framework for real-world
periodically measured nonstationary traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "autoregressive conditional heteroskedasticity;
bandwidth provisioning; heavy-tailedness; nonstationary
traffic; probability-hop forecasting",
}
@Article{Chen:2007:MFS,
author = "Cheng Chen and Zheng Guo Li and Yeng Chai Soh",
title = "{MRF}: a framework for source and destination based
bandwidth differentiation service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "697--708",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we shall generalize the concepts of
fairness, TCP-friendliness and TCP-compatibility such
that more source adaptation schemes can be designed to
support diverse applications over the Internet. A
simple but efficient framework, in the form of a
monotonic response function (MRF), is proposed for the
analysis and the design of memoryless window-based
source adaptation protocols by using these concepts. We
first derive a necessary and sufficient condition for
step-wise convergence to the weighted fairness. It is
then used to construct increase-decrease policies. The
requirements of our increase-decrease policy are less
conservative than those of the CYRF (Choose Your
Response Function) that was proposed in [1]. Our MRF is
suitable for transmission control protocol (TCP) and
user datagram protocol (UDP), and can be used to design
TCP-friendly and multimedia-friendly source adaptation
schemes. Meanwhile, our MRF can be applied to provide
bandwidth differentiation service without any change to
the router of the existing Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth differentiation service; convergence;
Lyapunov function; multimedia-friendliness; source
adaptation; switched control; TCP-friendliness;
weighted fairness",
}
@Article{Tornatore:2007:WND,
author = "Massimo Tornatore and Guido Maier and Achille
Pattavina",
title = "{WDM} network design by {ILP} models based on flow
aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "709--720",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Planning and optimization of WDM networks has raised
much interest among the research community in the last
years. Integer Linear Programming (ILP) is the most
used exact method to perform this task and many studies
have been published concerning this issue.
Unfortunately, many works have shown that, even for
small networks, the ILP formulations can easily
overwhelm the capabilities of today state-of-the-art
computing facilities. So in this paper we focus our
attention on ILP model computational efficiency in
order to provide a more effective tool in view of
direct planning or other benchmarking applications. Our
formulation exploits flow aggregation and consists in a
new ILP formulation that allows us to reach optimal
solutions with less computational effort compared to
other ILP approaches. This formulation applies to
multifiber mesh networks with or without wavelength
conversion. After presenting the formulation we discuss
the results obtained in the optimization of case-study
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "design methodology; integer programming; optical fiber
communication; wavelength division multiplexing",
}
@Article{Xin:2007:BAD,
author = "Chunsheng Xin",
title = "Blocking analysis of dynamic traffic grooming in mesh
{WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "3",
pages = "721--733",
month = jun,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:55:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic grooming in wavelength division multiplexing
(WDM) optical networks routes and consolidates
sub-wavelength connections onto lightpaths, to improve
network utilization and reduce cost. It can be
classified into static or dynamic, depending on whether
the connections are given in advance or randomly
arrive/ depart. In this paper, an analytical model is
developed for dynamic traffic grooming, allowing
heterogeneous data rates for sub-wavelength
connections, arbitrary alternate routing in both
logical and physical topologies, and arbitrary
wavelength conversion. The accuracy of the model has
been verified by numerical results from simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical network; performance analysis; reduced load
approximation; traffic grooming",
}
@Article{Banner:2007:PTN,
author = "Ron Banner and Ariel Orda",
title = "The power of tuning: a novel approach for the
efficient design of survivable networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "737--749",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current survivability schemes typically offer two
degrees of protection, namely full protection (from a
single failure) or no protection at all. Full
protection translates into rigid design constraints,
i.e., the employment of disjoint paths. We introduce
the concept of tunable survivability that bridges the
gap between full and no protection. First, we establish
several fundamental properties of connections with
tunable survivability. With that at hand, we devise
efficient polynomial (optimal) connection establishment
schemes for both $ 1 \colon 1 $ and $ 1 + 1 $
protection architectures. Then, we show that the
concept of tunable survivability gives rise to a novel
hybrid protection architecture, which offers improved
performance over the standard $ 1 \colon 1 $ and $ 1 +
1 $ architectures. Next, we investigate some related
QoS extensions. Finally, we demonstrate the advantage
of tunable survivability over full survivability. In
particular, we show that, by just slightly alleviating
the requirement of full survivability, we obtain major
improvements in terms of the `feasibility' as well as
the `quality' of the solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "path restoration/protection; routing; survivability",
}
@Article{Ho:2007:GSN,
author = "Kwok Shing Ho and Kwok Wai Cheung",
title = "Generalized survivable network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "750--760",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Two important requirements for future backbone
networks are full survivability against link failures
and dynamic bandwidth provisioning. We demonstrate how
these two requirements can be met by introducing a new
survivable network concept called the Generalized
Survivable Network (GSN), which has the special
property that it remains survivable no matter how
traffic is provisioned dynamically, as long as the
input and output constraints at the nodes are fixed. A
rigorous mathematical framework for designing the GSN
is presented. In particular, we focus on the GSN
Capacity Planning Problem, which finds the edge
capacities for a given physical network topology with
the input/output constraints at the nodes. We employ
fixed single-path routing which leads to wide-sense
nonblocking GSNs. We show how the initial, infeasible
formal mixed integer linear programming formulation can
be transformed into a more feasible problem using the
duality transformation. A procedure for finding the
realizable lower bound for the cost is also presented.
A two-phase approach is proposed for solving the
GSNCPP. We have carried out numerical computations for
ten networks with different topologies and found that
the cost of a GSN is only a fraction (from 39\% to
97\%) more than the average cost of a static survivable
network. The framework is applicable to survivable
network planning for ASTN/ASON, VPN, and IP networks as
well as bandwidth-on-demand resource allocation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ASON; ASTN; IP network; network design; nonblocking
network; survivable network; VPN",
}
@Article{Teixeira:2007:TBT,
author = "Renata Teixeira and Timothy G. Griffin and Mauricio G.
C. Resende and Jennifer Rexford",
title = "{TIE} breaking: tunable interdomain egress selection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "761--774",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a large backbone network, the routers often have
multiple egress points they could use to direct traffic
toward an external destination. Today's routers select
the `closest' egress point, based on the intradomain
routing configuration, in a practice known as
early-exit or hot-potato routing. In this paper, we
argue that hot-potato routing is restrictive,
disruptive, and convoluted and propose an alternative
called TIE (Tunable Interdomain Egress selection). TIE
is a flexible mechanism that allows routers to select
the egress point for each destination prefix based on
both the intradomain topology and the goals of the
network administrators. In fact, TIE is designed from
the start with optimization in mind, to satisfy diverse
requirements for traffic engineering and network
robustness. We present two example optimization
problems that use integer-programming and
multicommodity-flow techniques, respectively, to tune
the TIE mechanism to satisfy networkwide objectives.
Experiments with traffic, topology, and routing data
from two backbone networks demonstrate that our
solution is both simple (for the routers) and
expressive (for the network administrators).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BGP; egress-point selection; Internet routing; network
operations and management",
}
@Article{Yang:2007:NNI,
author = "Xiaowei Yang and David Clark and Arthur W. Berger",
title = "{NIRA}: a new inter-domain routing architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "775--788",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In today's Internet, users can choose their local
Internet service providers (ISPs), but once their
packets have entered the network, they have little
control over the overall routes their packets take.
Giving a user the ability to choose between
provider-level routes has the potential of fostering
ISP competition to offer enhanced service and improving
end-to-end performance and reliability. This paper
presents the design and evaluation of a new Internet
routing architecture (NIRA) that gives a user the
ability to choose the sequence of providers his packets
take. NIRA addresses a broad range of issues, including
practical provider compensation, scalable route
discovery, efficient route representation, fast route
fail-over, and security. NIRA supports user choice
without running a global link-state routing protocol.
It breaks an end-to-end route into a sender part and a
receiver part and uses address assignment to represent
each part. A user can specify a route with only a
source and a destination address, and switch routes by
switching addresses. We evaluate NIRA using a
combination of network measurement, simulation, and
analysis. Our evaluation shows that NIRA supports user
choice with low overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "inter-domain routing; Internet architecture; routing;
source routing; user-controlled routing",
}
@Article{Nucci:2007:ILW,
author = "Antonio Nucci and Supratik Bhattacharyya and Nina Taft
and Christophe Diot",
title = "{IGP} link weight assignment for operational {Tier-1}
backbones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "789--802",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Intradomain routing protocols, such as IS-IS or OSPF,
associate a weight (or cost) with each link to compute
traffic routes. Proposed methods for selecting link
weights largely ignore two practical issues, that of
service-level agreement (SLA) requirements and of
failures. Optimizing the routing configuration, without
bounding the SLA, could severely violate this
requirement, which is one of the most important
vehicles used by carriers to attract new customers.
Since most failures are short-lived, it is much more
practical not to have to change weight settings during
these episodes. In this paper we propose a Tabu-search
heuristic for choosing link weights that takes into
account both SLA requirements and link failures. Our
algorithm selects link weights that still perform well,
without having to be changed, even under failure
events. To validate the heuristic, we develop a lower
bound based on a formal integer linear program (ILP)
model, and show that our heuristic solution is within
10\% of the optimal ILP lower bound. We study the
performance of the heuristic using two operational
Tier-1 backbones. Our results illustrate two tradeoffs,
between link utilization and the SLA provided, and
between performance under failures versus performance
without failures. We find that performance under
transient failures can be dramatically improved at the
expense of a small degradation during normal network
operation (i.e., no failures), while simultaneously
satisfying SLA requirements. We use our algorithm
inside a prototype tool to conduct a case study and
illustrate how systematic link weight selection can
facilitate topology planning.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "failures; interior gateway protocol (IGP) routing;
intermediate system to intermediate system (IS-IS)
protocol; open shortest path first (OSPF) protocol;
optimization; robustness; tabu search; traffic
engineering",
}
@Article{Rai:2007:RMP,
author = "Smita Rai and Omkar Deshpande and Canhui Ou and
Charles U. Martel and Biswanath Mukherjee",
title = "Reliable multipath provisioning for high-capacity
backbone mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "803--812",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate reliable multipath provisioning of
traffic in high-capacity backbone mesh networks, e.g.,
next-generation SONET/SDH networks supporting virtual
concatenation (VCAT). VCAT enables a connection to be
inversely multiplexed on to multiple paths, a feature
that may lead to significantly improved performance
over conventional single-path provisioning. Other mesh
networks such as those employing optical
wavelength-division multiplexing (WDM) and
multiprotocol label switching (MPLS) can also benefit
from this multipath provisioning approach. We propose
effective multipath bandwidth as the metric to
provision a connection while satisfying its reliability
requirements (measured in terms of availability). We
demonstrate that effective multipath bandwidth provides
more flexibility and lower blocking probability without
the cost and the complexity associated with traditional
protection schemes developed for optical WDM and MPLS
networks. We also investigate the practical problem of
provisioning effective multipath bandwidth with cost
constraints. We analyze the tractability of the problem
and present a heuristic which results in significantly
reduced number of blocked connections due to cost
constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "degraded service; effective multipath bandwidth;
flexible provisioning; multiconstrained paths;
multipath provisioning; virtual concatenation (VCAT)",
}
@Article{Movsichoff:2007:EEO,
author = "Bernardo A. Movsichoff and Constantino M. Lagoa and
Hao Che",
title = "End-to-end optimal algorithms for integrated {QoS},
traffic engineering, and failure recovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "813--823",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the problem of optimal quality of
service (QoS), traffic engineering (TE) and failure
recovery (FR) in computer networks by introducing novel
algorithms that only use source inferrable information.
More precisely, optimal data rate adaptation and load
balancing laws are provided which are applicable to
networks where multiple paths are available and
multiple classes of service (CoS) are to be provided.
Different types of multiple paths are supported,
including point-to-point multiple paths,
point-to-multipoint multiple paths, and multicast
trees. In particular, it is shown that the algorithms
presented only need a minimal amount of information for
optimal control, i.e., whether a path is congested or
not. Hence, the control laws provided in this paper
allow source inferred congestion detection without the
need for explicit congestion feedback from the network.
The proposed approach is applicable to utility
functions of a very general form and endows the network
with the important property of robustness with respect
to node/link failures; i.e., upon the occurrence of
such a failure, the presented control laws reroute
traffic away from the inoperative node/link and
converge to the optimal allocation for the `reduced'
network. The proposed control laws set the foundation
for the development of highly scalable feature-rich
traffic control protocols at the IP, transport, or
higher layers with provable global stability and
convergence properties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed traffic control; failure recovery;
optimization; QoS; sliding mode control; traffic
engineering",
}
@Article{Tang:2007:EHC,
author = "Ao Tang and Jiantao Wang and Steven H. Low and Mung
Chiang",
title = "Equilibrium of heterogeneous congestion control:
existence and uniqueness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "824--837",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "When heterogeneous congestion control protocols that
react to different pricing signals share the same
network, the resulting equilibrium may no longer be
interpreted as a solution to the standard utility
maximization problem. We prove the existence of
equilibrium in general multiprotocol networks under
mild assumptions. For almost all networks, the
equilibria are locally unique, finite, and odd in
number. They cannot all be locally stable unless there
is a globally unique equilibrium. Finally, we show that
if the price mapping functions, which map link prices
to effective prices observed by the sources, are
sufficiently similar, then global uniqueness is
guaranteed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; equilibrium analysis;
heterogeneous protocols; optimization",
}
@Article{Zhang:2007:DIS,
author = "Yueping Zhang and Seong-Ryong Kang and Dmitri
Loguinov",
title = "Delay-independent stability and performance of
distributed congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "838--851",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent research efforts to design better Internet
transport protocols combined with scalable Active Queue
Management (AQM) have led to significant advances in
congestion control. One of the hottest topics in this
area is the design of discrete congestion control
algorithms that are asymptotically stable under
heterogeneous feedback delay and whose control
equations do not explicitly depend on the RTTs of
end-flows. In this paper, we first prove that
single-link congestion control methods with a stable
radial Jacobian remain stable under arbitrary feedback
delay (including heterogeneous directional delays) and
that the stability condition of such methods does not
involve any of the delays. We then extend this result
to generic networks with fixed consistent bottleneck
assignments and max-min network feedback. To
demonstrate the practicality of the obtained result, we
change the original controller in Kelly et al.'s work
['Rate Control for communication networks: Shadow
prices, proportional fairness and stability,' Journal
of the Operational Research Society, vol. 49, no. 3,
pp. 237-252, March 1998] to become robust under random
feedback delay and fixed constants of the control
equation. We call the resulting framework Max-min Kelly
Control (MKC) and show that it offers smooth sending
rate, exponential convergence to efficiency, and fast
convergence to fairness, all of which make it appealing
for future high-speed networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic stability; congestion control;
heterogeneous delay",
}
@Article{Rhee:2007:LEB,
author = "Injong Rhee and Lisong Xu",
title = "Limitations of equation-based congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "852--865",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study limitations of an equation-based congestion
control protocol, called TCP-Friendly Rate Control
(TFRC). It examines how the three main factors that
determine TFRC throughput, namely, the TCP-friendly
equation, loss event rate estimation, and delay
estimation, can influence the long-term throughput
imbalance between TFRC and TCP. Especially, we show
that different sending rates of competing flows cause
these flows to experience different loss event rates.
There are several fundamental reasons why TFRC and TCP
flows have different average sending rates, from the
first place. Earlier work shows that the convexity of
the TCP-friendly equation used in TFRC causes the
sending rate difference. We report two additional
reasons in this paper: (1) the convexity of $ 1 / x $
where $x$ is a loss event period and (2) different
retransmission timeout period (RTO) estimations of TCP
and TFRC. These factors can be the reasons for TCP and
TFRC to experience initially different sending rates.
But we find that the loss event rate difference due to
the differing sending rates greatly amplifies the
initial throughput difference; in some extreme cases,
TFRC uses around 20 times more, or sometimes 10 times
less, bandwidth than TCP. Despite these factors
influencing the throughput difference, we also find
that simple heuristics can greatly mitigate the
problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; equation-based rate control",
}
@Article{Shorten:2007:QPN,
author = "Robert N. Shorten and Douglas J. Leith",
title = "On queue provisioning, network efficiency and the
transmission control protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "866--877",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a sender side modification
to TCP to accommodate small network buffers. We exploit
the fact that the manner in which network buffers are
provisioned is intimately related to the manner in
which TCP operates. However, rather than designing
buffers to accommodate the TCP AIMD algorithm, as is
the traditional approach in network design, we suggest
simple modifications to the AIMD algorithm to
accommodate buffers of any size in the network. We
demonstrate that networks with small buffers can be
designed that transport TCP traffic in an efficient
manner while retaining fairness and friendliness with
standard TCP traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "AIMD; buffer sizing; TCP",
}
@Article{Zhao:2007:NBR,
author = "Yanping Zhao and Derek L. Eager and Mary K. Vernon",
title = "Network bandwidth requirements for scalable on-demand
streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "878--891",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Previously proposed streaming protocols using
broadcast or multicast are able to deliver multimedia
files on-demand with required server bandwidth that
grows much slower than linearly with request rate, or
with the inverse of client start-up delay. The same
efficiencies can be achieved for network bandwidth if
delivery is over a true broadcast channel. This paper
considers the required network bandwidth for on-demand
streaming over multicast delivery trees. We consider
both simple canonical delivery trees, and more complex
cases in which delivery trees are constructed using
both existing and new algorithms for randomly generated
network topologies and client site locations. Results
in this paper quantify the potential savings from use
of multicast trees that are configured to minimize
network bandwidth rather than the latency to the
content server. Further, we determine the network
bandwidth usage of particular immediate service and
periodic broadcast on-demand streaming protocols. The
periodic broadcast protocol is able to simultaneously
achieve close to the minimum possible network and
server bandwidth usage.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multicast; multimedia; on-demand streaming;
performance evaluation; periodic broadcast; scalable
delivery",
}
@Article{Wang:2007:LBP,
author = "Xiaoming Wang and Dmitri Loguinov",
title = "Load-balancing performance of consistent hashing:
asymptotic analysis of random node join",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "892--905",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Balancing of structured peer-to-peer graphs, including
their zone sizes, has recently become an important
topic of distributed hash table (DHT) research. To
bring analytical understanding into the various
peer-join mechanisms based on consistent hashing, we
study how zone-balancing decisions made during the
initial sampling of the peer space affect the resulting
zone sizes and derive several asymptotic bounds for the
maximum and minimum zone sizes that hold with high
probability. Several of our results contradict those of
prior work and shed new light on the theoretical
performance limitations of consistent hashing. We use
simulations to verify our models and compare the
performance of the various methods using the example of
recently proposed de Bruijn DHTs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic bounds; balls-into-bins; consistent
hashing; load balancing; peer-to-peer (P2P)",
}
@Article{Wang:2007:PIT,
author = "Pi-Chung Wang and Chun-Liang Lee and Chia-Tai Chan and
Hung-Yi Chang",
title = "Performance improvement of two-dimensional packet
classification by filter rephrasing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "906--917",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification categorizes incoming packets
into multiple forwarding classes in a router based on
predefined filters. It is important in fulfilling the
requirements of differentiated services. To achieve
fast packet classification, a new approach, namely
`filter rephrasing,' is proposed to encode the original
filters by exploiting the hierarchical property of the
filters. Filter rephrasing could dramatically reduce
the search and storage complexity incurred in packet
classification. We incorporate a well-known
scheme-rectangle search-with filter rephrasing to
improve the lookup speed by at least a factor of 2 and
decreases 70\% of the storage expenses. As compared
with other existing schemes, the proposed scheme
exhibits a better balance between speed, storage, and
computation complexity. Consequently, the scalable
effect of filter rephrasing is suitable for backbone
routers with a great number of filters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "firewalls; forwarding; packet classification; quality
of service (QoS)",
}
@Article{Liu:2007:QTF,
author = "Xiliang Liu and Kaliappa Ravindran and Dmitri
Loguinov",
title = "A queueing-theoretic foundation of available bandwidth
estimation: single-hop analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "918--931",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most existing available-bandwidth measurement
techniques are justified using a constant-rate fluid
cross-traffic model. To achieve a better understanding
of the performance of current bandwidth measurement
techniques in general traffic conditions, this paper
presents a queueing-theoretic foundation of single-hop
packet-train bandwidth estimation under bursty arrivals
of discrete cross-traffic packets. We analyze the
statistical mean of the packet-train output dispersion
and its mathematical relationship to the input
dispersion, which we call the probing-response curve.
This analysis allows us to prove that the single-hop
response curve in bursty cross-traffic deviates from
that obtained under fluid cross traffic of the same
average intensity and to demonstrate that this may lead
to significant measurement bias in certain estimation
techniques based on fluid models. We conclude the paper
by showing, both analytically and experimentally, that
the response-curve deviation vanishes as the
packet-train length or probing packet size increases,
where the vanishing rate is decided by the burstiness
of cross-traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "active measurement; bandwidth estimation; packet-pair
sampling",
}
@Article{Cohen:2007:GQA,
author = "Reuven Cohen and Liran Katzir",
title = "A generic quantitative approach to the scheduling of
synchronous packets in a shared uplink wireless
channel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "932--943",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The scheduling logic at the base station of a shared
wireless medium supports time-dependent (synchronous)
applications by allocating timely transmission grants.
To this end, it must take into account not only the
deadlines of the pending packets, but also the channel
conditions for each potential sender, the requirements
of nonsynchronous applications, and the packet
retransmission strategy. With respect to these factors,
we identify three scheduling scenarios and show that
the scheduler logic faces a different challenge in
addressing each of them. We then present a generic
scheduling algorithm that translates all the factors
relevant to each scenario into a common profit
parameter, and selects the most profitable transmission
instances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile communications; scheduling; wireless",
}
@Article{Fodor:2007:BBP,
author = "G{\'a}bor Fodor and Mikl{\'o}s Telek",
title = "Bounding the blocking probabilities in multirate
{CDMA} networks supporting elastic services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "944--956",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Several previous contributions have proposed
calculation methods that can be used to determine the
steady state (and from it the blocking probabilities)
of code-division multiple-access (CDMA) systems. This
present work extends the classical Kaufman-Roberts
formula such that it becomes applicable in CDMA systems
in which elastic services with state-dependent
instantaneous bit rate and average-bit-rate-dependent
residency time are supported. Our model captures the
effect of soft blocking, that is, an arriving session
may be blocked in virtually all system states but with
a state dependent probability. The core of this method
is to approximate the original irreversible Markov
chain with a reversible one and to give lower and upper
bounds on the so-called partially blocking macro states
of the state space. We employ this extended formula to
establish lower and upper bounds on the steady state
and the classwise blocking probabilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CDMA networks; elastic traffic; Kaufman-Roberts
formula; reversible Markov chains; soft blocking",
}
@Article{Cao:2007:WSD,
author = "Xiaojun Cao and Vishal Anand and Chunming Qiao",
title = "Waveband switching for dynamic traffic demands in
multigranular optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "957--968",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Waveband switching (WBS) in conjunction with
multigranular optical cross-connect (MG-OXC)
architectures can reduce the cost and complexity of
OXCs. In this paper, we study the performance of
different MG-OXC architectures under dynamic traffic.
In the case with online incremental traffic, we compare
two MG-OXC architectures in terms of the blocking
probability of new lightpath requests and study the
impact of port counts and traffic loads. We develop an
online Integer Linear Programming model (On-ILP), which
minimizes the number of used ports and the request
blocking probability, given a fixed number of
wavelengths and MG-OXC architecture. The On-ILP
optimizes the routing of new lightpaths so as to
maximize lightpath grouping and reduce the port count
given that existing traffic cannot be rearranged. We
also propose a new efficient heuristic algorithm,
called Maximum Overlap Ratio (MOR) to satisfy
incremental traffic and compare it with the On-ILP,
first-fit, and random-fit algorithms. Our results and
analysis indicate that using WBS with MG-OXCs can
reduce the size (and, hence, the cost) of switching
fabrics compared to using ordinary OXCs. Based on the
results and observations in the incremental traffic
case, we further study the performance of a particular
MG-OXC architecture under fully dynamic or fluctuating
traffic. Our simulations show that the proposed
heuristic algorithm waveband assignment with path
graph, which groups wavelengths to bands and uses
wavelength converters efficiently under fluctuating
traffic, significantly out-performs other heuristic
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "integer linear programming (ILP); multigranular (MG);
optical cross-connects; waveband switching; wavelength
division multiplexing (WDM)",
}
@Article{Ngo:2007:OSN,
author = "Hung Q. Ngo and Dazhen Pan and Yuanyuan Yang",
title = "Optical switching networks with minimum number of
limited-range wavelength converters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "4",
pages = "969--979",
month = aug,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:56:37 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of determining the minimum number
of limited-range wavelength converters needed to
construct strictly, wide-sense, and rearrangeably
nonblocking optical cross-connects for both unicast and
multicast traffic patterns. We give the exact formula
to compute this number for rearrangeably and wide-sense
nonblocking cross-connects under both the unicast and
multicast cases. We also give optimal cross-connect
constructions with respect to the number of
limited-range wavelength converters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-connects; limited-range wavelength conversion;
optical switching networks;
wavelength-division-multiplexing (WDM)",
}
@Article{Sharma:2007:DCT,
author = "Gaurav Sharma and Ravi Mazumdar and Ness B. Shroff",
title = "Delay and capacity trade-offs in mobile ad hoc
networks: a global perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "981--992",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Since the original work of Grossglauser and Tse, which
showed that mobility can increase the capacity of an ad
hoc network, there has been a lot of interest in
characterizing the delay-capacity relationship in ad
hoc networks. Various mobility models have been studied
in the literature, and the delay-capacity relationships
under those models have been characterized. The results
indicate that there are trade-offs between the delay
and capacity, and that the nature of these trade-offs
is strongly influenced by the choice of the mobility
model. Some questions that arise are: (i) How
representative are these mobility models studied in the
literature? (ii) Can the delay-capacity relationship be
significantly different under some other `reasonable'
mobility model? (iii) What sort of delay-capacity
trade-off are we likely to see in a real world
scenario? In this paper, we take the first step toward
answering some of these questions. In particular, we
analyze, among others, the mobility models studied in
recent related works, under a unified framework. We
relate the nature of delay-capacity trade-off to the
nature of node motion, thereby providing a better
understanding of the delay-capacity relationship in ad
hoc networks in comparison to earlier works.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad-hoc networks; capacity; delay; mobility;
throughput; trade-offs; wireless",
}
@Article{La:2007:DPD,
author = "Richard J. La and Yijie Han",
title = "Distribution of path durations in mobile ad hoc
networks and path selection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "993--1006",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the issue of path selection in multihop
wireless networks with the goal of identifying a scheme
that can select a path with the largest expected
duration. To this end, we first study the distribution
of path duration. We show that, under a set of mild
conditions, when the hop count along a path is large,
the distribution of path duration can be well
approximated by an exponential distribution even when
the distributions of link durations are dependent and
heterogeneous. Second, we investigate the statistical
relation between a path duration and the durations of
the links along the path. We prove that the parameter
of the exponential distribution, which determines the
expected duration of the path, is related to the link
durations only through their means and is given by the
sum of the inverses of the expected link durations.
Based on our analytical results, we propose a scheme
that can be implemented with existing routing protocols
and select the paths with the largest expected
durations. We evaluate the performance of the proposed
scheme using ns-2 simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile ad hoc networks; routing control; stochastic
analysis",
}
@Article{Qiao:2007:IAT,
author = "Daji Qiao and Sunghyun Choi and Kang G. Shin",
title = "Interference analysis and transmit power control in
{IEEE 802.11a/h} wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1007--1020",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reducing the energy consumption by wireless
communication devices is perhaps the most important
issue in the widely deployed and dramatically growing
IEEE 802.11 WLANs (wireless local area networks). TPC
(transmit power control) has been recognized as one of
the effective ways to achieve this goal. In this paper,
we study the emerging 802.11a/h systems that provide a
structured means to support intelligent TPC. Based on a
rigorous analysis of the relationship among different
radio ranges and TPC's effects on the interference, we
present an optimal low-energy transmission strategy,
called MiSer, which is deployed in the format of
RTS-CTS(strong)-Data(MiSer)-Ack. The key idea of MiSer
is to combine TPC with PHY (physical layer) rate
adaptation and compute offline an optimal rate-power
combination table, then at runtime, a wireless station
determines the most energy-efficient transmission
strategy for each data frame transmission by a simple
table lookup. Simulation results show MiSer's clear
superiority to other two-way or four-way frame exchange
mechanisms in terms of energy conservation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IEEE 802.11a/h; interference analysis; MiSer; PHY rate
adaptation; TPC; transmit power control",
}
@Article{Lin:2007:AOE,
author = "Longbi Lin and Ness B. Shroff and R. Srikant",
title = "Asymptotically optimal energy-aware routing for
multihop wireless networks with renewable energy
sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1021--1034",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we develop a model to characterize the
performance of multihop radio networks in the presence
of energy constraints and design routing algorithms to
optimally utilize the available energy. The energy
model allows us to consider different types of energy
sources in heterogeneous environments. The proposed
algorithm is shown to achieve a competitive ratio
(i.e., the ratio of the performance of any offline
algorithm that has knowledge of all past and future
packet arrivals to the performance of our online
algorithm) that is asymptotically optimal with respect
to the number of nodes in the network. The algorithm
assumes no statistical information on packet arrivals
and can easily be incorporated into existing routing
schemes (e.g., proactive or on-demand methodologies) in
a distributed fashion. Simulation results confirm that
the algorithm performs very well in terms of maximizing
the throughput of an energy-constrained network.
Further, a new threshold-based scheme is proposed to
reduce the routing overhead while incurring only
minimum performance degradation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "competitive analysis; energy-aware routing;
mathematical programming/optimization; simulations",
}
@Article{Karnik:2007:DOS,
author = "Aditya Karnik and Anurag Kumar",
title = "Distributed optimal self-organization in ad hoc
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1035--1045",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This work is motivated by the idea of using randomly
deployed wireless networks of miniature smart sensors
to serve as distributed instrumentation. In such
applications, often the objective of the sensor network
is to repeatedly compute and, if required, deliver to
an observer some result based on the values measured at
the sensors. We argue that in such applications it is
important for the sensors to self-organize in a way
that optimizes network throughput. We identify and
discuss two main problems of optimal self-organization:
(1) building an optimal topology, and (2) tuning
network access parameters, such as the transmission
attempt rate. We consider a simple random access model
for sensor networks and formulate these problems as
optimization problems. We then present centralized as
well as distributed algorithms for solving them.
Results show that the performance improvement is
substantial and implementation of such optimal
self-organization techniques may be worth the
additional complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed stochastic algorithms; self-organization;
wireless sensor networks",
}
@Article{Patil:2007:MRQ,
author = "Shailesh Patil and Gustavo {De Veciana}",
title = "Managing resources and quality of service in
heterogeneous wireless systems exploiting opportunism",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1046--1058",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a novel class of opportunistic scheduling
disciplines to handle mixes of real-time and
best-effort traffic at a wireless access point. The
objective is to support probabilistic service rate
guarantees to real-time sessions while still achieving
opportunistic throughput gains across users and traffic
types. We are able to show a `tight' stochastic lower
bound on the service a real-time session would receive
assuming that the users possibly heterogeneous capacity
variations are known or estimated, and are fast fading
across slots. Such bounds are critical to enabling
predictable quality of service and thus the development
of complementary resource management and admission
control strategies. Idealized simulation results show
that the scheme can achieve 80\%-90\% of the maximum
system throughput capacity while satisfying the quality
of service (QoS) requirements for real-time traffic,
and that the degradation in system throughput is slow
in the number of real-time users, i.e., inter- and
intra-class opportunism are being properly exploited.
We note however, that there is a tradeoff between
strictness of QoS requirements and the overall system
throughput one can achieve. Thus if QoS requirements on
real-time traffic are very tight, one would need to
simply give priority to real-time traffic, and in the
process lose the throughput gains of opportunism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multi-user diversity; quality of service; scheduling",
}
@Article{Schweller:2007:RSE,
author = "Robert Schweller and Zhichun Li and Yan Chen and Yan
Gao and Ashish Gupta and Yin Zhang and Peter A. Dinda
and Ming-Yang Kao and Gokhan Memik",
title = "Reversible sketches: enabling monitoring and analysis
over high-speed data streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1059--1072",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A key function for network traffic monitoring and
analysis is the ability to perform aggregate queries
over multiple data streams. Change detection is an
important primitive which can be extended to construct
many aggregate queries. The recently proposed sketches
are among the very few that can detect heavy changes
online for high speed links, and thus support various
aggregate queries in both temporal and spatial domains.
However, it does not preserve the keys (e.g., source IP
address) of flows, making it difficult to reconstruct
the desired set of anomalous keys.\par
To address this challenge, we propose the reversible
sketch data structure along with reverse hashing
algorithms to infer the keys of culprit flows. There
are two phases. The first operates online, recording
the packet stream in a compact representation with
negligible extra memory and few extra memory accesses.
Our prototype single FPGA board implementation can
achieve a throughput of over 16 Gb/s for 40-byte packet
streams (the worst case). The second phase identifies
heavy changes and their keys from the representation in
nearly real time. We evaluate our scheme using traces
from large edge routers with OC-12 or higher links.
Both the analytical and experimental results show that
we are able to achieve online traffic monitoring and
accurate change/intrusion detection over massive data
streams on high speed links, all in a manner that
scales to large key space size. To the best of our
knowledge, our system is the first to achieve these
properties simultaneously.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Radunovic:2007:UFM,
author = "Bozidar Radunovi{\'c} and Jean-Yves {Le Boudec}",
title = "A unified framework for max-min and min-max fairness
with applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1073--1083",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Max-min fairness is widely used in various areas of
networking. In every case where it is used, there is a
proof of existence and one or several algorithms for
computing it; in most, but not all cases, they are
based on the notion of bottlenecks. In spite of this
wide applicability, there are still examples, arising
in the context of wireless or peer-to-peer networks,
where the existing theories do not seem to apply
directly. In this paper, we give a unifying treatment
of max-min fairness, which encompasses all existing
results in a simplifying framework, and extend its
applicability to new examples. First, we observe that
the existence of max-min fairness is actually a
geometric property of the set of feasible allocations.
There exist sets on which max-min fairness does not
exist, and we describe a large class of sets on which a
max-min fair allocation does exist. This class
contains, but is not limited to the compact, convex
sets of R$^N$. Second, we give a general purpose
centralized algorithm, called Max-min Programming, for
computing the max-min fair allocation in all cases
where it exists (whether the set of feasible
allocations is in our class or not). Its complexity is
of the order of $N$ linear programming steps in R$^N$,
in the case where the feasible set is defined by linear
constraints. We show that, if the set of feasible
allocations has the free disposal property, then
Max-min Programming reduces to a simpler algorithm,
called Water Filling, whose complexity is much lower.
Free disposal corresponds to the cases where a
bottleneck argument can be made, and Water Filling is
the general form of all previously known centralized
algorithms for such cases. All our results apply
mutatis mutandis to min-max fairness. Our results apply
to weighted, unweighted and util-max-min and min-max
fairness. Distributed algorithms for the computation of
max-min fair allocations are outside the scope of this
paper.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "best-effort traffic; elastic traffic; mathematical
programming/optimization; max-min fairness; system
design",
}
@Article{Chen:2007:ABS,
author = "Yan Chen and David Bindel and Han Hee Song and Randy
H. Katz",
title = "Algebra-based scalable overlay network monitoring:
algorithms, evaluation, and applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1084--1097",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay network monitoring enables distributed
Internet applications to detect and recover from path
outages and periods of degraded performance within
seconds. For an overlay network with $n$ end hosts,
existing systems either require $ O(n^2)$ measurements,
and thus lack scalability, or can only estimate the
latency but not congestion or failures. Our earlier
extended abstract [Y. Chen, D. Bindel, and R. H. Katz,
`Tomography-based overlay network monitoring,'
Proceedings of the ACM SIGCOMM Internet Measurement
Conference (IMC), 2003] briefly proposes an algebraic
approach that selectively monitors $k$ linearly
independent paths that can fully describe all the $
O(n^2)$ paths. The loss rates and latency of these $k$
paths can be used to estimate the loss rates and
latency of all other paths. Our scheme only assumes
knowledge of the underlying IP topology, with links
dynamically varying between lossy and normal. In this
paper, we improve, implement, and extensively evaluate
such a monitoring system. We further make the following
contributions: (i) scalability analysis indicating that
for reasonably large $n$ (e.g., 100), the growth of $k$
is bounded as $ O(n \log n)$, (ii) efficient adaptation
algorithms for topology changes, such as the addition
or removal of end hosts and routing changes, (iii)
measurement load balancing schemes, (iv) topology
measurement error handling, and (v) design and
implementation of an adaptive streaming media system as
a representative application. Both simulation and
Internet experiments demonstrate we obtain highly
accurate path loss rate estimation while adapting to
topology changes within seconds and handling topology
errors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamics; load balancing; network measurement and
monitoring; numerical linear algebra; overlay;
scalability",
}
@Article{Jin:2007:PPC,
author = "Yasong Jin and Soshant Bali and Tyrone E. Duncan and
Victor S. Frost",
title = "Predicting properties of congestion events for a
queueing system with {fBm} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1098--1108",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In packet networks, congestion events tend to persist,
producing large delays and long bursts of consecutive
packet loss resulting in perceived performance
degradations. The length and rate of these events have
a significant effect on network quality of service
(QoS). The packet delay resulting from these congestion
events also influences QoS. In this paper a technique
for predicting these properties of congestion events in
the presence of fractional Brownian motion (fBm)
traffic is developed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Internet; network congestion; networks; quality of
service",
}
@Article{Li:2007:EET,
author = "Yee-Ting Li and Douglas Leith and Robert N. Shorten",
title = "Experimental evaluation of {TCP} protocols for
high-speed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1109--1122",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present experimental results
evaluating the performance of the scalable-TCP, HS-TCP,
BIC-TCP, FAST-TCP, and H-TCP proposals in a series of
benchmark tests. In summary, we find that both
Scalable-TCP and FAST-TCP consistently exhibit
substantial unfairness, even when competing flows share
identical network path characteristics. Scalable-TCP,
HS-TCP, FAST-TCP, and BIC-TCP all exhibit much greater
RTT unfairness than does standard TCP, to the extent
that long RTT flows may be completely starved of
bandwidth. Scalable-TCP, HS-TCP, and BIC-TCP all
exhibit slow convergence and sustained unfairness
following changes in network conditions such as the
start-up of a new flow. FAST-TCP exhibits complex
convergence behavior.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "evaluation of TCP protocols; high-speed networks; TCP
congestion control",
}
@Article{Bonaventure:2007:ASM,
author = "Olivier Bonaventure and Clarence Filsfils and Pierre
Fran{\c{c}}ois",
title = "Achieving sub-50 milliseconds recovery upon {BGP}
peering link failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1123--1135",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent measurements show that BGP peering links can
fail as frequently as intradomain links and usually for
short periods of time. We propose a new fast-reroute
technique where routers are prepared to react quickly
to interdomain link failures. For each of its
interdomain links, a router precomputes a protection
tunnel, i.e., an IP tunnel to an alternate nexthop
which can reach the same destinations as via the
protected link. We propose a BGP-based auto-discovery
technique that allows each router to learn the
candidate protection tunnels for its links. Each router
selects the best protection tunnels for its links and
when it detects an interdomain link failure, it
immediately encapsulates the packets to send them
through the protection tunnel. Our solution is
applicable for the links between large transit ISPs and
also for the links between multi-homed stub networks
and their providers. Furthermore, we show that
transient forwarding loops (and thus the corresponding
packet losses) can be avoided during the routing
convergence that follows the deactivation of a
protection tunnel in BGP/MPLS VPNs and in IP networks
using encapsulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BGP; computer network reliability; fast recovery;
routing",
}
@Article{Riedl:2007:ROI,
author = "Anton Riedl and Dominic A. Schupke",
title = "Routing optimization in {IP} networks utilizing
additive and concave link metrics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1136--1148",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Routing optimization provides network operators with a
powerful method for traffic engineering. Its general
objective is to distribute traffic flows evenly across
available network resources in order to avoid network
congestion and quality of service degradation.\par
In this paper we consider routing optimization based on
conventional routing protocols where packets are
forwarded hop-by-hop in a destination-based manner.
Unlike other work in this area, we consider routing
protocols, which are able to take into account concave
routing metrics in addition to additive ones. The
concave link metric introduces an additional degree of
freedom for routing optimization, thus, increasing its
optimization potential. We present and evaluate a
mixed-integer programming model, which works on these
metrics. This model unifies the optimization for
single-metric and dual-metric routing concepts and also
includes the consideration of multipath routing.
Furthermore, we propose a heuristic algorithm usable
for larger network instances.\par
Numerical results indicate that employment of both the
dual-metric concept and multipath routing can achieve
considerably better utilization results than
default-configured single-metric routing. A significant
finding is that metric-based routing optimization with
two link metrics often comes close to the results
obtainable by optimization of arbitrarily configurable
routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "genetic algorithm; Internet; mixed integer
programming; routing optimization; traffic
engineering",
}
@Article{Zhao:2007:SDS,
author = "Yanping Zhao and Derek L. Eager and Mary K. Vernon",
title = "Scalable on-demand streaming of nonlinear media",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1149--1162",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A conventional video file contains a single
temporally-ordered sequence of video frames. Clients
requesting on-demand streaming of such a file receive
(all or intervals of) the same content. For popular
files that receive many requests during a file playback
time, scalable streaming protocols based on multicast
or broadcast have been devised. Such protocols require
server and network bandwidth that grow much slower than
linearly with the file request rate.\par
This paper considers `nonlinear' video content in which
there are parallel sequences of frames. Clients
dynamically select which branch of the video they wish
to follow, sufficiently ahead of each branch point so
as to allow the video to be delivered without jitter.
An example might be `choose-your-own-ending' movies.
With traditional scalable delivery architectures such
as movie theaters or TV broadcasting, such
personalization of the delivered video content is very
difficult or impossible. It becomes feasible, in
principle at least, when the video is streamed to
individual clients over a network. For on-demand
streaming of nonlinear media, this paper analyzes the
minimal server bandwidth requirements, and proposes and
evaluates practical scalable delivery protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hierarchical stream merging; nonlinear media;
on-demand streaming; performance evaluation; periodic
broadcast",
}
@Article{Li:2007:MTO,
author = "Jikai Li and Chunming Qiao and Jinhui Xu and Dahai
Xu",
title = "Maximizing throughput for optical burst switching
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1163--1176",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In optical burst switching (OBS) networks, a key
problem is to schedule as many bursts as possible on
wavelength channels so that the throughput is maximized
and the burst loss is minimized. Most of the current
research on OBS has been concentrated on reducing burst
loss in an `average-case' sense, and little effort has
been devoted to understanding the worst case
performance. Since OBS itself is an open-loop control
system, it may exhibit a worst case behavior when
adversely synchronized. On the other hand, most
commercial systems require an acceptable worst case
performance.\par
In this paper, we use competitive analysis to analyze
the worst case performance of a large set of scheduling
algorithms, called best-effort online scheduling
algorithms, for OBS networks and establish a number of
interesting upper and lower bounds on the performance
of such algorithms. Our analysis shows that the
performance of any best-effort online algorithm is
closely related to a few factors, such as the range of
offset time, maximum-to-minimum burst-length ratio, and
the number of data channels. A surprising discovery is
that the worst case performance of any best-effort
online scheduling algorithm is primarily determined by
the maximum-to-minimum burst-length ratio, followed by
the range of offset time. Furthermore, if all bursts
have the same burst length and offset time, all
best-effort online scheduling algorithms generate the
same optimal solution, regardless of how different they
may look. Our analysis can also be extended to some
non-best-effort online scheduling algorithms, such as
the well-known Horizon algorithm, and establish similar
bounds. Based on the analytic results, we give
guidelines for several widely discussed OBS problems,
including burst assembly, offset time setting, and
scheduling algorithm design, and propose a new channel
reservation protocol called virtual fixed offset-time
(VFO) to improve the worst case performance. Our
simulation shows that VFO can also reduce the average
burst loss rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "OBS; scheduling; worst case",
}
@Article{Zhang:2007:AAP,
author = "Jing Zhang and Keyao Zhu and Hui Zang and Norman S.
Matloff and Biswanath Mukherjee",
title = "Availability-aware provisioning strategies for
differentiated protection services in
wavelength-convertible {WDM} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1177--1190",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In an optical WDM mesh network, different protection
schemes (such as dedicated or shared protection) can be
used to improve the service availability against
network failures. However, in order to satisfy a
connection's service-availability requirement in a
cost-effective and resource-efficient manner, we need a
systematic mechanism to select a proper protection
scheme for each connection request while provisioning
the connection. In this paper, we propose to use
connection availability as a metric to provide
differentiated protection services in a
wavelength-convertible WDM mesh network.\par
We develop a mathematical model to analyze the
availabilities of connections with different protection
modes (i.e., unprotected, dedicated protected, or
shared protected). In the shared-protection case, we
investigate how a connection's availability is affected
by backup resource sharing. The sharing might cause
backup resource contention between several connections
when multiple simultaneous (or overlapping) failures
occur in the network. Using a continuous-time Markov
model, we derive the conditional probability for a
connection to acquire backup resources in the presence
of backup resource contention. Through this model, we
show how the availability of a shared-protected
connection can be quantitatively computed.\par
Based on the analytical model, we develop provisioning
strategies for a given set of connection demands in
which an appropriate, possibly different, level of
protection is provided to each connection according to
its predefined availability requirement, e.g., 0.999,
0.997. We propose integer linear programming (ILP) and
heuristic approaches to provision the connections cost
effectively while satisfying the connections'
availability requirements. The effectiveness of our
provisioning approaches is demonstrated through
numerical examples. The proposed provisioning
strategies inherently facilitate the service
differentiation in optical WDM mesh networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "availability; connection provisioning; differentiated
services; optical mesh network; protection; service
reliability; WDM",
}
@Article{Zhang:2007:NAM,
author = "Zhenghao Zhang and Yuanyuan Yang",
title = "A novel analytical model for switches with shared
buffer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1191--1203",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Switches with a shared buffer have lower packet loss
probabilities than other types of switches when the
sizes of the buffers are the same. In the past, the
performance of shared buffer switches has been studied
extensively. However, due to the strong dependencies of
the output queues in the buffer, it is very difficult
to find a good analytical model. Existing models are
either accurate but have exponential complexities or
not very accurate. In this paper, we propose a novel
analytical model called the Aggregation model for
switches with shared buffer. The model is based on the
idea of induction: first find the behavior of two
queues, then aggregate them into one block; then find
the behavior of three queues while regarding two of the
queues as one block, then aggregate the three queues
into one block; then aggregate four queues, and so on.
When all queues have been aggregated, the behavior of
the entire switch will be found. This model has perfect
accuracies under all tested conditions and has
polynomial complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "aggregation; analytical model; Markov chain; shared
buffer; switches",
}
@Article{Huang:2007:MPK,
author = "Dijiang Huang and Manish Mehta and Appie van de
Liefvoort and Deep Medhi",
title = "Modeling pairwise key establishment for random key
predistribution in large-scale sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1204--1215",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sensor networks are composed of a large number of low
power sensor devices. For secure communication among
sensors, secret keys are required to be established
between them. Considering the storage limitations and
the lack of post-deployment configuration information
of sensors, RandomKey Predistribution schemes have been
proposed. Due to limited number of keys, sensors can
only share keys with a subset of the neighboring
sensors. Sensors then use these neighbors to establish
pairwise keys with the remaining neighbors. In order to
study the communication overhead incurred due to
pairwise key establishment, we derive probability
models to design and analyze pairwise key establishment
schemes for large-scale sensor networks. Our model
applies the binomial distribution and a modified
binomial distribution and analyzes the key path length
in a hop-by-hop fashion. We also validate our models
through a systematic validation procedure. We then show
the robustness of our results and illustrate how our
models can be used for addressing sensor network design
problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "random key distributions; security; sensor networks",
}
@Article{Le:2007:EAQ,
author = "Long Le and Jay Aikat and Kevin Jeffay and F. Donelson
Smith",
title = "The effects of active queue management and explicit
congestion notification on {Web} performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1217--1230",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present an empirical study of the effects of active
queue management (AQM) and explicit congestion
notification (ECN) on the distribution of response
times experienced by users browsing the Web. Three
prominent AQM designs are considered: the Proportional
Integral (PI) controller, the Random Exponential
Marking (REM) controller, and Adaptive Random Early
Detection (ARED). The effects of these AQM designs were
studied with and without ECN. Our primary measure of
performance is the end-to-end response time for HTTP
request-response exchanges. Our major results are as
follows.\par
\item If ECN is not supported, ARED operating in
byte-mode was the best performing design, providing
better response time performance than drop-tail
queueing at offered loads above 90\% of link capacity.
However, ARED operating in packet-mode (with or without
ECN) was the worst performing design, performing worse
than drop-tail queueing.\par
\item ECN support is beneficial to PI and REM. With
ECN, PI and REM were the best performing designs,
providing significant improvement over ARED operating
in byte-mode. In the case of REM, the benefit of ECN
was dramatic. Without ECN, response time performance
with REM was worse than drop-tail queueing at all loads
considered.\par
\item ECN was not beneficial to ARED. Under current ECN
implementation guidelines, ECN had no effect on ARED
performance. However, ARED performance with ECN
improved significantly after re versing a guideline
that was intended to police unresponsive flows.
Overall, the best ARED performance was achieved without
ECN.\par
\item Whether or not the improvement in response times
with AQM is significant, depends heavily on the range
of round-trip times (RTTs) experienced by flows. As the
variation in flows' RTT increases, the impact of AQM
and ECN on response-time performance is reduced.\par
We conclude that AQM can improve application and
network performance for Web or Web-like workloads. In
particular, it appears likely that with AQM and ECN,
provider links may be operated at near saturation
levels without significant degradation in
user-perceived performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Voice:2007:SMP,
author = "Thomas Voice",
title = "Stability of multi-path dual congestion control
algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1231--1239",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates fair, scalable, stable
congestion controls which achieve high bandwidth
utilization over networks operating multi-path routing.
It aims to take advantage of path diversity to achieve
efficient bandwidth allocation without causing
instability.\par
We develop a multi-path extension to the dual
algorithm, which takes into consideration path
diversity when evaluating fairness. This algorithm is
shown to be globally stable in the absence of
propagation delays and a sufficient condition for local
stability, for the case when heterogeneous propagation
delays are present, is found. The sufficient condition
we present is decentralized in the following sense: the
gain parameter for each dynamic variable is restricted
by the average round-trip time of packets passing
through the link or source it represents, but not by
the round-trip times of any other packets. This leads
to a highly scalable parameter choice scheme. Gain
parameters are calculated from local information which
is independent of the state of the algorithm, and our
delay stability condition is satisfied.\par
The models considered apply to networks consisting of
arbitrary interconnections of sources and links with
arbitrary heterogeneous propagation delays.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic routing; flow control; resource allocation;
stability",
}
@Article{Hande:2007:DRA,
author = "Prashanth Hande and Shengyu Zhang and Mung Chiang",
title = "Distributed rate allocation for inelastic flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1240--1253",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A common assumption behind most of the recent research
on network rate allocation is that traffic flows are
elastic, which means that their utility functions are
concave and continuous and that there is no hard limit
on the rate allocated to each flow. These critical
assumptions lead to the tractability of the analytic
models for rate allocation based on network utility
maximization, but also limit the applicability of the
resulting rate allocation protocols. This paper focuses
on inelastic flows and removes these restrictive and
often invalid assumptions.\par
First, we consider nonconcave utility functions, which
turn utility maximization into difficult, nonconvex
optimization problems. We present conditions under
which the standard price-based distributed algorithm
can still converge to the globally optimal rate
allocation despite nonconcavity of utility functions.
In particular, continuity of price-based rate
allocation at all the optimal prices is a sufficient
condition for global convergence of rate allocation by
the standard algorithm, and continuity at at least one
optimal price is a necessary condition. We then show
how to provision link capacity to guarantee convergence
of the standard distributed algorithm. Second, we model
real-time flow utilities as discontinuous functions. We
show how link capacity can be provisioned to allow
admission of all real-time flows, then propose a
price-based admission control heuristics when such link
capacity provisioning is impossible, and finally
develop an optimal distributed algorithm to allocate
rates between elastic and real-time flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity provisioning; congestion control; inelastic
flow; network control by pricing; network utility
maximization; optimization; resource allocation",
}
@Article{Bridges:2007:CET,
author = "Patrick G. Bridges and Gary T. Wong and Matti Hiltunen
and Richard D. Schlichting and Matthew J. Barrick",
title = "A configurable and extensible transport protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1254--1265",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The ability to configure transport protocols from
collections of smaller software modules allows the
characteristics of the protocol to be customized for a
specific application or network technology. This paper
describes a configurable transport protocol system
called CTP in which microprotocols implementing
individual attributes of transport can be combined into
a composite protocol that realizes the desired overall
functionality. In addition to describing the overall
architecture of CTP and its microprotocols, this paper
also presents experiments on both local area and wide
area platforms that illustrate the flexibility of CTP
and how its ability to match more closely application
needs can result in better application performance. The
prototype implementation of CTP has been built using
the C version of the Cactus microprotocol composition
framework running on Linux.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "configuration; customization; extensibility; transport
protocol",
}
@Article{Feamster:2007:IAE,
author = "Nick Feamster and Ramesh Johari and Hari
Balakrishnan",
title = "Implications of autonomy for the expressiveness of
policy routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1266--1279",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Thousands of competing autonomous systems must
cooperate with each other to provide global Internet
connectivity. Each autonomous system (AS) encodes
various economic, business, and performance decisions
in its routing policy. The current interdomain routing
system enables each AS to express policy using rankings
that determine how each router in the AS chooses among
different routes to a destination, and filters that
determine which routes are hidden from each neighboring
AS. Because the Internet is composed of many
independent, competing networks, the interdomain
routing system should provide autonomy, allowing
network operators to set their rankings independently,
and to have no constraints on allowed filters. This
paper studies routing protocol stability under these
conditions. We first demonstrate that `next-hop
rankings,' commonly used in practice, may not ensure
routing stability. We then prove that, when providers
can set rankings and filters autonomously, guaranteeing
that the routing system will converge to a stable path
assignment imposes strong restrictions on the rankings
ASes are allowed to choose. We discuss the implications
of these results for the future of interdomain
routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "automony; BGP; interdomain routing; policy; safety",
}
@Article{Francois:2007:ATL,
author = "Pierre Fran{\c{c}}ois and Olivier Bonaventure",
title = "Avoiding transient loops during the convergence of
link-state routing protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1280--1292",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "When using link-state protocols such as OSPF or IS-IS,
forwarding loops can occur transiently when the routers
adapt their forwarding tables as a response to a
topological change. In this paper, we present a
mechanism that lets the network converge to its optimal
forwarding state without risking any transient loops
and the related packet loss. The mechanism is based on
an ordering of the updates of the forwarding tables of
the routers. Our solution can be used in the case of a
planned change in the state of a set of links and in
the case of unpredictable changes when combined with a
local protection scheme. The supported topology changes
are link transitions from up to down, down to up, and
updates of link metrics. Finally, we show by
simulations that sub-second loop-free convergence is
possible on a large Tier-1 ISP network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "link-state routing protocols; loop avoidance; network
reliability; routing; routing convergence",
}
@Article{Retvari:2007:SPR,
author = "G{\'a}bor R{\'e}tv{\'a}ri and J{\'o}zsef J.
B{\'\i}r{\'o} and Tibor Cinkler",
title = "On shortest path representation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1293--1306",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Lately, it has been proposed to use shortest path
first routing to implement Traffic Engineering in IP
networks. The idea is to set the link weights so that
the shortest paths, and the traffic thereof, follow the
paths designated by the operator. Clearly, only certain
shortest path representable path sets can be used in
this setting, that is, paths which become shortest
paths over some appropriately chosen positive,
integer-valued link weights. Our main objective in this
paper is to distill and unify the theory of shortest
path representability under the umbrella of a novel
flow-theoretic framework. In the first part of the
paper, we introduce our framework and state a
descriptive necessary and sufficient condition to
characterize shortest path representable paths.
Unfortunately, traditional methods to calculate the
corresponding link weights usually produce a bunch of
superfluous shortest paths, often leading to congestion
along the unconsidered paths. Thus, the second part of
the paper is devoted to reducing the number of paths in
a representation to the bare minimum. To the best of
our knowledge, this is the first time that an algorithm
is proposed, which is not only able to find a minimal
representation in polynomial time, but also assures
link weight integrality. Moreover, we give a necessary
and sufficient condition to the existence of a
one-to-one mapping between a path set and its shortest
path representation. However, as revealed by our
simulation studies, this condition seems overly
restrictive and instead, minimal representations prove
much more beneficial",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "linear programming; shortest path routing; traffic
engineering",
}
@Article{Xiao:2007:ANS,
author = "Jin Xiao and Raouf Boutaba",
title = "Assessing network service profitability: modeling from
market science perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1307--1320",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network service providers regularly conduct network
planning and upgrade processes to keep their businesses
profitable. The effectiveness of a network
upgrade/planning decision is intrinsically tied to the
ability of a provider to retain and grow its customer
population. This paper examines the crucial linkage
between network performance, customer satisfaction and
profitability of network service, and presents an
analytical modeling approach from market science
perspective. We derive a generalized forecasting model
that projects service profitability from the underlying
network service infrastructure and the subscriber
population. Through simulation studies and analysis, we
show how such approach captures key factors and trends
influencing service profitability and how it can
significantly improve current network planning and
upgrade processes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "economics; network applications and services; network
design and planning",
}
@Article{Beimel:2007:ROE,
author = "Amos Beimel and Shlomi Dolev and Noam Singer",
title = "{RT} oblivious erasure correcting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1321--1332",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An erasure correcting scheme is rateless if it is
designed to tolerate any pattern of packet loss and
reveal the transmitted information after a certain
number of packets is received. On the one hand,
transmission schemes that use rateless erasure
correcting schemes do not usually use a feedback
channel. However, they may require significant amount
of additional processing by both the sender and the
receiver. On the other hand, automatic repeated request
protocols use a feedback channel to assist the sender,
and do not usually require information processing. In
this work we present a combined approach, where a lean
feedback channel is used to assist the sender to
efficiently transmit the information. Our Real-Time
oblivious approach minimizes the processing time and
the memory requirements of the receiver and, therefore,
fits a variety of receiving devices. In addition, the
transmission is real-time where the expected number of
original packets revealed when a packet is received is
approximately the same throughout the entire
transmission process. We use our end-to-end scheme as a
base for broadcast (and multicast) schemes. An overlay
tree structure is used to convey the information to a
large number of receivers. Moreover, the receivers may
download the information from a number of senders or
even migrate from one sender to another.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ARQ; combinatorics; data-link; information theory;
stochastic processes; transport layer",
}
@Article{Eryilmaz:2007:FRA,
author = "Atilla Eryilmaz and R. Srikant",
title = "Fair resource allocation in wireless networks using
queue-length-based scheduling and congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1333--1344",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of allocating resources (time
slots, frequency, power, etc.) at a base station to
many competing flows, where each flow is intended for a
different receiver. The channel conditions may be
time-varying and different for different receivers. It
is well-known that appropriately chosen queue-length
based policies are throughput-optimal while other
policies based on the estimation of channel statistics
can be used to allocate resources fairly (such as
proportional fairness) among competing users. In this
paper, we show that a combination of queue-length-based
scheduling at the base station and congestion control
implemented either at the base station or at the end
users can lead to fair resource allocation and
queue-length stability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; m-weighted fairness; proportional
fairness; throughput-optimal scheduling; wireless
networks",
}
@Article{Hajiaghayi:2007:POF,
author = "Mohammad Taghi Hajiaghayi and Nicole Immorlica and
Vahab S. Mirrokni",
title = "Power optimization in fault-tolerant topology control
algorithms for wireless multi-hop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1345--1358",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In ad hoc wireless networks, it is crucial to minimize
power consumption while maintaining key network
properties. This work studies power assignments of
wireless devices that minimize power while maintaining
$k$-fault tolerance. Specifically, we require all links
established by this power setting be symmetric and form
a $k$-vertex connected subgraph of the network graph.
This problem is known to be NP-hard. We show current
heuristic approaches can use arbitrarily more power
than the optimal solution. Hence, we seek approximation
algorithms for this problem. We present three
approximation algorithms. The first algorithm gives an
$ O(k \alpha)$-approximation where $ \alpha $ is the
best approximation factor for the related problem in
wired networks (the best $ \alpha $ so far is $ O(\log
k)$.) With a more careful analysis, we show our second
(slightly more complicated) algorithm is an $
O(k)$-approximation. Our third algorithm assumes that
the edge lengths of the network graph form a metric. In
this case, we present simple and practical distributed
algorithms for the cases of 2- and 3-connectivity with
constant approximation factors. We generalize this
algorithm to obtain an $ O(k^{2c + 2})$-approximation
for general $k$-connectivity ($ 2 \leq c \leq 4$ is the
power attenuation exponent). Finally, we show that
these approximation algorithms compare favorably with
existing heuristics. We note that all algorithms
presented in this paper can be used to minimize power
while maintaining $k$-edge connectivity with guaranteed
approximation factors. Recently, different set of
authors used the notion of $k$-connectivity and the
results of this paper to deal with the fault-tolerance
issues for static wireless network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc networks; approximation algorithms; graph
model; graph properties; power conservation; topology
control",
}
@Article{Madan:2007:MOT,
author = "Ritesh Madan and Shuguang Cui and Sanjay Lall and
Andrea J. Goldsmith",
title = "Modeling and optimization of transmission schemes in
energy-constrained wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1359--1372",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a wireless sensor network with energy
constraints. We model the energy consumption in the
transmitter circuit along with that for data
transmission. We model the bottom three layers of the
traditional networking stack--the link layer, the
medium access control (MAC) layer, and the routing
layer. Using these models, we consider the optimization
of transmission schemes to maximize the network
lifetime. We first consider the optimization of a
single layer at a time, while keeping the other layers
fixed. We make certain simplifying assumptions to
decouple the layers and formulate optimization problems
to compute a strategy that maximizes the network
lifetime. We then extend this approach to cross-layer
optimization of time division multiple access (TDMA)
wireless sensor networks. In this case, we construct
optimization problems to compute the optimal
transmission schemes to an arbitrary degree of accuracy
and efficiently. We then consider networks with
interference, and propose methods to compute
approximate solutions to the resulting optimization
problems. We give numerical examples that illustrate
the computational approaches as well as the benefits of
cross-layer design in wireless sensor networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-layer design; energy efficiency; network
lifetime; optimization; wireless sensor networks",
}
@Article{Yang:2007:DOC,
author = "Yaling Yang and Jun Wang and Robin Kravets",
title = "Distributed optimal contention window control for
elastic traffic in single-cell wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1373--1386",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a theoretical study on distributed
contention window control algorithms for achieving
arbitrary bandwidth allocation policies and efficient
channel utilization. By modeling different bandwidth
allocation policies as an optimal contention window
assignment problem, we design a general and fully
distributed contention window control algorithm, called
General Contention window Adaptation (GCA), and prove
that it converges to the solution of the contention
window assignment problem. By examining the stability
of GCA, we identify the optimal stable point that
maximizes channel utilization and provide solutions to
control the stable point near the optimal point. Due to
the generality of GCA, our work provides a theoretical
foundation to analyze existing and design new
contention window control algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic bandwidth allocation; fairness; LAN;
wireless",
}
@Article{Yang:2007:IMC,
author = "Xiangying Yang and Gustavo {De Veciana}",
title = "Inducing multiscale clustering using multistage {MAC}
contention in {CDMA} ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1387--1400",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a new principle for designing MAC
protocols for CDMA-based ad hoc networks-inducing
spatial clustering in contending
transmitters/receivers. We first highlight the
advantages of CDMA in handling quality of service (QoS)
requirements, enhancing energy efficiency, and enabling
spatial multiplexing of bursty traffic. Then, based on
stochastic geometric models and simulation, we show how
idealized contention resolution among randomly
distributed nodes results in clustering of successful
transmitters and receivers, in turn leading to
efficient spatial reuse. This motivates the central
idea of the paper which is to explicitly induce
clustering among contending nodes to achieve even
better spatial reuse. We propose two distributed
mechanisms to realize such clustering and show
substantial capacity gains over simple random
access/ALOHA-like and even RTS/CTS-based protocols. We
examine under what regimes such gains can be achieved,
and how clustering and contention resolution mechanisms
should be optimized to do so. We propose the design of
ad hoc networks supporting hop-by-hop relaying on
different spatial scales. By allowing nodes to relay
beyond the set of nearest neighbors using varying
transmission distances (scales), one can reduce the
number of hops between a source and destination so as
to meet end-to-end delay requirements. To that end we
propose a multi-scale MAC clustering and power control
mechanism to support transmissions with different
ranges while achieving high spatial reuse. The
considerations, analysis and simulations included in
this paper suggest that the principle of inducing
spatial clustering in contention has substantial
promise towards achieving high spatial reuse, QoS, and
energy efficiency in CDMA ad hoc networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc network; CDMA; clustering; contention; MAC",
}
@Article{Luo:2007:DRS,
author = "Huiyu Luo and Gregory J. Pottie",
title = "Designing routes for source coding with explicit side
information in sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1401--1413",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of designing
routes for source coding with explicit side information
(i.e., with side information at both the encoder and
the decoder) in sensor networks. Two difficulties in
constructing such data-centric routes are the lack of
reasonably practical data aggregation models and the
high computational complexity resulting from the
coupling of routing and in-network data fusion. Our
data aggregation model is built upon the observation
that in many physical situations the side information
providing the most coding gain comes from a small
number of nearby sensors. Based on this model, we
formulate an optimization problem to minimize the
communication cost, and show that finding the exact
solution of this problem is NP-hard. Subsequently, two
suboptimal algorithms are proposed. One is inspired by
the balanced trees that have small total weights and
reasonable distance from each sensor to the fusion
center [6]. The other separately routes the explicit
side information to achieve cost minimization. Bounds
on the worst-case performance ratios of two methods to
the optimal solution are derived for a special class of
rate models, and simulations are conducted to shed
light on their average behaviors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data-centric routing; maximum weight branching;
NP-hardness; shortest path tree; source coding; Steiner
tree",
}
@Article{Bosio:2007:RPW,
author = "Sandro Bosio and Antonio Capone and Matteo Cesana",
title = "Radio planning of wireless local area networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1414--1427",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper we propose mathematical models to tackle
the WLAN planning problem. Our approach aims at
maximizing network efficiency by taking into account
the inter-AP domain interference and the access
mechanism. Both the single-channel and the
multiple-channel WLAN planning problems are considered.
We give different formulations which capture at
different levels of detail the effect of interference
on the network efficiency. In order to evaluate the
quality of the proposed models, we obtain the optimal
solutions for synthetic network instances, and propose
heuristics to get suboptimal solutions in a reasonable
computing time. We show that the networks planned
according to our approach feature higher efficiency
than the ones planned using classical models, like the
minimum-cardinality set covering problem (SCP), by
privileging network solutions with low-power APs
installed. The achieved gain reaches 167\% in
particular network scenarios. Moreover, we test the
obtained solutions through simulation and real-life
testbed implementation; both analyses show that the
networks planned with the proposed approaches are the
ones with the highest saturation throughput with
respect to those configurations obtained with SCP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "local search; mathematical programming; radio
planning; wireless local area networks (WLANs)",
}
@Article{Raghunath:2007:MBC,
author = "Satish Raghunath and K. K. Ramakrishnan and Shivkumar
Kalyanaraman",
title = "Measurement-based characterization of {IP VPNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1428--1441",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Virtual Private Networks (VPNs) provide secure and
reliable communication between customer sites. With the
increase in number and size of VPNs, providers need
efficient provisioning techniques that adapt to
customer demand by leveraging a good understanding of
VPN properties.\par
In this paper, we analyze two important properties of
VPNs that impact provisioning: (1) structure of
customer endpoint (CE) interactions and (2) temporal
characteristics of CE-CE traffic. We deduce these
properties by computing traffic matrices from SNMP
measurements. We find that existing traffic matrix
estimation techniques are not readily applicable to the
VPN scenario due to the scale of the problem and
limited measurement information. We begin by
formulating a scalable technique that makes the most
out of existing measurement information and provides
good estimates for common VPN structures. We then use
this technique to analyze SNMP measurement information
from a large IP VPN service provider.\par
We find that even with limited measurement information
(no per-VPN data for the core) we can estimate traffic
matrices for a significant fraction of VPNs, namely,
those constituting the `Hub-and-Spoke' category. In
addition, the ability to infer the structure of VPNs
holds special significance for provisioning tasks
arising from topology changes, link failures and
maintenance. We are able to provide a classification of
VPNs by structure and identify CEs that act as hubs of
communication and hence require prioritized treatment
during restoration and provisioning.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "estimation; provisioning; traffic engineering; traffic
matrix; virtual private network (VPN)",
}
@Article{Li:2007:NCE,
author = "Chengzhi Li and Almut Burchard and J{\"o}rg
Liebeherr",
title = "A network calculus with effective bandwidth",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1442--1453",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper establishes a link between two principal
tools for the analysis of network traffic, namely,
effective bandwidth and network calculus. It is shown
that a general version of effective bandwidth can be
expressed within the framework of a probabilistic
version of the network calculus, where both arrivals
and service are specified in terms of probabilistic
bounds. By formulating well-known effective bandwidth
expressions in terms of probabilistic envelope
functions, the developed network calculus can be
applied to a wide range of traffic types, including
traffic that has self-similar characteristics. As
applications, probabilistic lower bounds are presented
on the service given by three different scheduling
algorithms: Static Priority, Earliest Deadline First,
and Generalized Processor Sharing. Numerical examples
show the impact of specific traffic models and
scheduling algorithms on the multiplexing gain in a
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "effective bandwidth; network calculus; QoS;
statistical multiplexing",
}
@Article{Valente:2007:EGS,
author = "Paolo Valente",
title = "Exact {GPS} simulation and optimal fair scheduling
with logarithmic complexity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1454--1466",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Generalized Processor Sharing (GPS) is a fluid
scheduling policy providing perfect fairness over both
constant-rate and variable-rate links. The minimum
deviation (lead\slash lag) with respect to the GPS
service achievable by a packet scheduler is one maximum
packet size. To the best of our knowledge, the only
packet scheduler guaranteeing the minimum deviation is
Worst-case Fair Weighted Fair Queueing (WF$^2$ Q),
which requires on-line GPS simulation. Existing
algorithms to perform GPS simulation have $ O(N)$
worst-case computational complexity per packet
transmission ($N$ being the number of competing flows).
Hence, WF$^2$ Q has been charged for $ O(N)$ complexity
too. However it has been proven that the lower bound
complexity to guarantee $ O(1)$ deviation is $ \Omega
(\log N)$, yet a scheduler achieving such a result has
remained elusive so far.\par
In this paper, we present L-GPS, an algorithm that
performs exact GPS simulation with $ O(\log N)$
worst-case complexity and small constants. As such it
improves the complexity of all the packet schedulers
based on GPS simulation. We also present L-WF$^2$ Q, an
implementation of WF$^2$ Q based on L-GPS. L-WF$^2$ Q
has $ O(\log N)$ complexity with small constants, and,
since it achieves the minimum possible deviation, it
does match the aforementioned complexity lower bound.
Furthermore, both L-GPS and L-WF$^2$ Q comply with
constant-rate as well as variable-rate links. We assess
the effectiveness of both algorithms by simulating
real-world scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "complexity theory; scheduling; tree data structures",
}
@Article{Hao:2007:FME,
author = "Fang Hao and Murali Kodialam and T. V. Lakshman and
Shantidev Mohanty",
title = "Fast, memory efficient flow rate estimation using
runs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1467--1477",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Per-flow network traffic measurements are needed for
effective network traffic management, network
performance assessment, and detection of anomalous
network events such as incipient denial-of-service
(DoS) attacks. Explicit measurement of per-flow traffic
statistics is difficult in backbone networks because
tracking the possibly hundreds of thousands of flows
needs correspondingly large high-speed memories. To
reduce the measurement overhead, many previous papers
have proposed the use of random sampling and this is
also used in commercial routers (Cisco's NetFlow). Our
goal is to develop a new scheme that has very low
memory requirements and has quick convergence to within
a pre-specified accuracy. We achieve this by use of a
novel approach based on sampling two-runs to estimate
per-flow traffic. (A flow has a two-run when two
consecutive samples belong to the same flow). Sampling
two-runs automatically biases the samples towards the
larger flows thereby making the estimation of these
sources more accurate. This biased sampling leads to
significantly smaller memory requirement compared to
random sampling schemes. The scheme is very simple to
implement and performs extremely well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IP flow statistics; traffic measurement; two run",
}
@Article{Lian:2007:FEP,
author = "Jie Lian and Kshirasagar Naik and Gordon B. Agnew",
title = "A framework for evaluating the performance of cluster
algorithms for hierarchical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1478--1489",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Table-driven routing algorithms in flat networks have
the scalability problem due to the need for global
topology updates. To reduce update cost, networks are
hierarchically organized. Clustering algorithms
organize flat networks into hierarchical networks. One
important problem, which has not been adequately
addressed so far, is to evaluate how good a clustering
algorithm is. In other words, it is useful to know what
the desired properties of hierarchical networks are. In
this paper, we address this issue by considering the
routing update cost, which can be measured by the total
routing table size and the variance of cluster size
distribution. We provide a set of desired properties of
clustering algorithms. Applying these properties to the
cluster structure generated by an algorithm, we can
determine how good a clustering algorithm is.
Specifically, we discuss how to choose appropriate
number of hierarchy levels, number of clusters, and
cluster size distribution, such that the topology
update cost is minimized. The desired properties
obtained from the analysis can be used as guidelines in
the design of clustering algorithms for table-driven
hierarchical networks. We apply the idea developed in
this paper to evaluate three routing algorithms, namely
the lowest ID algorithm, the maximum degree algorithm,
and the variable degree clustering algorithm. We show
how the variable degree clustering algorithm, which
takes into account these desired properties, improves
routing performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "clustering algorithm; hierarchical network; network
performance; peer-to-peer (P2P) network; routing",
}
@Article{Lee:2007:DAS,
author = "Patrick P. C. Lee and Vishal Misra and Dan
Rubenstein",
title = "Distributed algorithms for secure multipath routing in
attack-resistant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1490--1501",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To proactively defend against intruders from readily
jeopardizing single-path data sessions, we propose a
distributed secure multipath solution to route data
across multiple paths so that intruders require much
more resources to mount successful attacks. Our work
exhibits several important properties that include: (1)
routing decisions are made locally by network nodes
without the centralized information of the entire
network topology; (2) routing decisions minimize
throughput loss under a single-link attack with respect
to different session models; and (3) routing decisions
address multiple link attacks via lexicographic
optimization. We devise two algorithms termed the
Bound-Control algorithm and the Lex-Control algorithm,
both of which provide provably optimal solutions.
Experiments show that the Bound-Control algorithm is
more effective to prevent the worst-case single-link
attack when compared to the single-path approach, and
that the Lex-Control algorithm further enhances the
Bound-Control algorithm by countering severe
single-link attacks and various types of multi-link
attacks. Moreover, the Lex-Control algorithm offers
prominent protection after only a few execution rounds,
implying that we can sacrifice minimal routing
protection for significantly improved algorithm
performance. Finally, we examine the applicability of
our proposed algorithms in a specialized defensive
network architecture called the attack-resistant
network and analyze how the algorithms address
resiliency and security in different network
settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "attack-resistant networks; maximum-flow problems;
multipath routing; optimization; preflow-push;
resilience; security",
}
@Article{Yin:2007:BAA,
author = "Heng Yin and Haining Wang",
title = "Building an application-aware {IPsec} policy system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1502--1513",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As a security mechanism at the network-layer, the IP
security protocol (IPsec) has been available for years,
but its usage is limited to Virtual Private Networks
(VPNs). The end-to-end security services provided by
IPsec have not been widely used. To bring the IPsec
services into wide usage, a standard IPsec API is a
potential solution. However, the realization of a
user-friendly IPsec API involves many modifications on
the current IPsec and Internet Key Exchange (IKE)
implementations. An alternative approach is to
configure application-specific IPsec policies, but the
current IPsec policy system lacks the knowledge of the
context of applications running at upper layers, making
it infeasible to configure application-specific
policies in practice.\par
In this paper, we propose an application-aware IPsec
policy system on the existing IPsec/IKE infrastructure,
in which a socket monitor running in the application
context reports the socket activities to the
application policy engine. In turn, the engine
translates the application policies into the underlying
security policies, and then writes them into the IPsec
Security Policy Data-base (SPD) via the existing IPsec
policy management interface. We implement a prototype
in Linux (Kernel 2.6) and evaluate it in our testbed.
The experimental results show that the overhead of
policy translation is insignificant, and the overall
system performance of the enhanced IPsec is comparable
to those of security mechanisms at upper layers.
Configured with the application-aware IPsec policies,
both secured applications at upper layers and legacy
applications can transparently obtain IP security
enhancements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication system security; computer network
security",
}
@Article{Sun:2007:HGA,
author = "Yan Sun and K. J. Ray Liu",
title = "Hierarchical group access control for secure multicast
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1514--1526",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many group communications require a security
infrastructure that ensures multiple levels of access
control for group members. While most existing group
key management schemes are designed for single level
access control, we present a multi-group key management
scheme that achieves hierarchical group access control.
Particularly, we design an integrated key graph that
maintains keying material for all members with
different access privileges. It also incorporates new
functionalities that are not present in conventional
multicast key management, such as user relocation on
the key graph. Analysis is performed to evaluate the
storage and communication overhead associated key
management. Comprehensive simulations are performed for
various application scenarios where users statistical
behavior is modelled using a discrete Markov chain.
Compared with applying existing key management schemes
directly to the hierarchical access control problem,
the proposed scheme significantly reduces the overhead
associated with key management and achieves better
scalability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access control; communication system privacy; system
design",
}
@Article{Salido:2007:EBE,
author = "Javier Salido and Loukas Lazos and Radha Poovendran",
title = "Energy and bandwidth-efficient key distribution in
wireless ad hoc networks: a cross-layer approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1527--1540",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the problem of resource-efficient access
control for group communications in wireless ad hoc
networks. Restricting the access to group data can be
reduced to the problem of securely distributing
cryptographic keys to group members, known as the key
distribution problem (KDP). We examine the KDP under
four metrics: (a) member key storage, (b) group
controller (GC) transmissions, (c) multicast group (MG)
update messages, and (d) average update energy. For
each metric, we formulate an optimization problem and
show that the KDP has unique solutions for metrics (a)
and (b), while is NP-complete for (c) and (d). We
propose a cross-layer heuristic algorithm called VP3
that bounds member key storage, and GC transmissions,
while significantly reducing the energy and bandwidth
consumption of the network. We define the notion of
path divergence as a measure of bandwidth efficiency of
multicasting, and establish an analytical worst-case
bound for it. Finally, we propose On-line VP3, which
dynamically updates the key assignment structure
according to the dynamics of the communication group in
a resource-efficient way.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc; key distribution; key management; multicast;
secure group communication; security",
}
@Article{Leonardi:2007:OSR,
author = "Emilio Leonardi and Marco Mellia and Marco Ajmone
Marsan and Fabio Neri",
title = "Optimal scheduling and routing for maximum network
throughput",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1541--1554",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper we consider packet networks loaded by
admissible traffic patterns, i.e., by traffic patterns
that, if optimally routed, do not overload network
resources. We prove that simple distributed dynamic
routing and scheduling algorithms based upon link state
information can achieve the same network throughput as
optimal centralized routing and scheduling algorithms
with complete traffic information.\par
Our proofs apply the stochastic Lyapunov function
methodology to a flow-level abstract model of the
network, and consider elastic traffic, i.e., we assume
that flows can adapt their transmission rates to
network conditions, thus resembling traffic engineering
and quality-of-service approaches being currently
proposed for IP networks.\par
Although the paper mainly brings a theoretical
contribution, such dynamic routing and scheduling
algorithms can be implemented in a distributed way.
Moreover we prove that maximum throughput is achieved
also in case of temporary mismatches between the actual
links state and the link state information used by the
routing algorithm. This is a particularly relevant
aspect, since any distributed implementation of a
routing algorithm requires a periodic exchange of link
state information among nodes, and this implies delays,
and thus time periods in which the current link costs
are not known.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic stability; computer network performance;
Lyapunov methods",
}
@Article{Komolafe:2007:HFR,
author = "Olufemi Komolafe and David Harle",
title = "An holistic framework for regular virtual topology
design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1555--1564",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A bifurcated approach is typically adopted to the
regular virtual topology design problem. By exploiting
key metrics that affect optimization solutions, it is
shown that easily computed parameters, pertaining to
the spread in inter-nodal distances and the spread in
inter-nodal traffic, are descriptive and appropriate
means to characterize problem inputs, the physical
topology and the traffic matrix. The juxtaposition
between these parameters and the optimization results
is explored, culminating in the development of a novel
holistic framework for regular virtual topology design.
This framework offers the possibility of simplifying
regular virtual topology design by presenting the
different traditional design approaches as being
nuances of a single overarching problem and suggesting
criteria for choosing the most expedient design
approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "combinatorial optimization; graph theory;
multi-processor interconnection architectures; regular
virtual topology design; WDM networks",
}
@Article{Hamza:2007:WOI,
author = "Haitham S. Hamza and Jitender S. Deogun",
title = "{WDM} optical interconnects: a balanced design
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1565--1578",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we develop a new design approach to
wavelength division multiplexing (WDM) optical
interconnects with the objective of designing
cost-effective and scalable interconnects. Our design
philosophy strikes a balance between switching and
conversion costs, and requires wavelength conversion
only between two fixed and predefined wavelengths. The
proposed design approach exploits the potential of the
wavelength exchange optical crossbar (WOC)--a device
that can switch signals simultaneously and seamlessly
both in space and wavelength domains. We propose a
novel crossbar switch that minimizes hardware and
control complexity and use it as a building block for
developing a new class of three-stage Clos-like WDM
optical interconnects. The design space of the proposed
interconnect is characterized and its hardware
complexity is analyzed. We also show that the proposed
crossbar switch and the new class of WDM interconnects
admit most existing routing algorithms with simple
modifications. In addition, we show that our design
approach can be generalized to develop a class of
$k$-stage $ N \times N$ interconnects, $ 3 k \leq 2
\log 2 N - 1$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Clos network; crossbar switch; optical interconnects;
wavelength converter; wavelength division multiplexing
(WDM); wavelength exchange optical crossbar (WOC)",
}
@Article{Cholda:2007:RAO,
author = "Piotr Cho{\l}da and Andrzej Jajszczyk",
title = "Reliability assessment of optical p-cycles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1579--1592",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Two recovery techniques suited for the Next Generation
Internet are studied: traditional protection rings
(BLSRs) and a novel, preconfigured protection cycles
($p$-cycles) technique. Theoretical formulas describing
the reliability function as well as Mean Time to
Failure are derived. On the basis of our analysis, we
show that $p$-cycles should not be used in wide-area
networks since their reliability performance is outside
the desired bounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "availability; mean time to failure; p-cycles;
reliability",
}
@Article{Shalom:2007:EAM,
author = "Mordechai Shalom and Shmuel Zaks",
title = "A $ 10 / 7 + \epsilon $ approximation for minimizing
the number of {ADMs} in {SONET} rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1593--1602",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "SONET add/drop multiplexers (ADMs) are dominant cost
factors in WDM SONET rings. Whereas most previous
papers on the topic concentrated on the number of
wavelengths assigned to a given set of lightpaths, more
recent papers argue that the number of ADMs is a more
realistic cost measure. Some of these works discuss
various heuristic algorithms for this problem, and the
best known result is a 3/2 approximation in Calinescu
and Wan, 2002. Through the study of the relation
between this problem and the problem of finding maximum
disjoint rings in a given set of lightpaths we manage
to shed more light onto this problem and to develop a
10/7 + $ \epsilon $ approximation for it.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "add-drop multiplexer (ADM); optical networks;
wavelength assignment; wavelength division multiplexing
(WDM)",
}
@Article{Abel:2007:DIN,
author = "Fran{\c{c}}ois Abel and Cyriel Minkenberg and Ilias
Iliadis and Ton Engbersen and Mitchell Gusat and
Ferdinand Gramsamer and Ronald P. Luijten",
title = "Design issues in next-generation merchant switch
fabrics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1603--1615",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet-switch fabrics with widely varying
characteristics are currently deployed in the domains
of both communications and computer interconnection
networks. For economical reasons, it would be highly
desirable that a single switch fabric could accommodate
the needs of a variety of heterogeneous services and
applications from both domains. In this paper, we
consider the current requirements, technological
trends, and their implications on the design of an ASIC
chipset for a merchant switch fabric. We then identify
the architecture upon which such a suitable and generic
switch fabric could be based, and we present the
general characteristics of an implementation of this
switching fabric within the bounds of current
state-of-the-art technology. To our knowledge, this is
the first attempt to design a chipset that can be used
for both communications and computer interconnection
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "buffered crossbar; combined Input and crosspoint
Queueing (CICQ); interconnection networks; packet
switching",
}
@Article{Luo:2007:CSS,
author = "Hongbin Luo and Hongfang Yu and Lemin Li",
title = "Comments on {`Segment shared protection in mesh
communication networks with bandwidth guaranteed
tunnels'}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1616--1616",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Ho:2004:SSP}.",
abstract = "In this Comment, two typos in Ho et al., 2004,
`Segment Shared Protection in Mesh Communication
Networks With Bandwidth Guaranteed Tunnels', are
pointed out. These typos may puzzle readers or prevent
them from correctly understand this paper. In the
second part of this Comment, we present corrections to
the typos.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "segment shared protection (SSP); survivable routing;
working and protection paths",
}
@Article{Keralapura:2008:RCC,
author = "Ram Keralapura and Chen-Nee Chuah and Nina Taft and
Gianluca Iannaccone",
title = "Race conditions in coexisting overlay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "1--14",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "By allowing end hosts to make independent routing
decisions at the application level, different overlay
networks may unintentionally interfere with each other.
This paper describes how multiple similar or dissimilar
overlay networks could experience race conditions,
resulting in oscillations (in both route selection and
network load) and cascading reactions. We pinpoint the
causes for synchronization and derive an analytic
formulation for the synchronization probability of two
overlays. Our model indicates that the probability of
synchronization is non-negligible across a wide range
of parameter settings, thus implying that the ill
effects of synchronization should not be ignored. Using
the analytical model, we find an upper bound on the
duration of traffic oscillations. We also show that the
model can be easily extended to include a large number
of co-existing overlays. We validate our model through
simulations that are designed to capture the transient
routing behavior of both the IP- and overlay-layers. We
use our model to study the effects of factors such as
path diversity (measured in round trip times) and
probing aggressiveness on these race conditions.
Finally, we discuss the implications of our study on
the design of path probing process in overlay networks
and examine strategies to reduce the impact of race
conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "interaction between multiple overlay networks; race
conditions; synchronization; traffic oscillations",
}
@Article{Goodrich:2008:PPM,
author = "Michael T. Goodrich",
title = "Probabilistic packet marking for large-scale {IP}
traceback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "15--24",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents an approach to IP traceback based
on the probabilistic packet marking paradigm. Our
approach, which we call randomize-and-link, uses large
checksum cords to `link' message fragments in a way
that is highly scalable, for the checksums serve both
as associative addresses and data integrity verifiers.
The main advantage of these checksum cords is that they
spread the addresses of possible router messages across
a spectrum that is too large for the attacker to easily
create messages that collide with legitimate
messages.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "associate addresses; checksum cords; denial of service
(DDOS); distributed; IP; probabilistic packet marking;
traceback",
}
@Article{Shavitt:2008:HEI,
author = "Yuval Shavitt and Tomer Tankel",
title = "Hyperbolic embedding of {Internet} graph for distance
estimation and overlay construction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "25--36",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Estimating distances in the Internet has been studied
in the recent years due to its ability to improve the
performance of many applications, e.g., in the
peer-to-peer realm. One scalable approach to estimate
distances between nodes is to embed the nodes in some
$d$ dimensional geometric space and to use the pair
distances in this space as the estimate for the real
distances. Several algorithms were suggested in the
past to do this in low dimensional Euclidean
spaces.\par
It was noted in recent years that the Internet
structure has a highly connected core and long
stretched tendrils, and that most of the routing paths
between nodes in the tendrils pass through the core.
Therefore, we suggest in this work, to embed the
Internet distance metric in a hyperbolic space where
routes are bent toward the center. We found that if the
curvature, that defines the extend of the bending, is
selected in the adequate range, the accuracy of
Internet distance embedding can be improved.\par
We demonstrate the strength of our hyperbolic embedding
with two applications: selecting the closest server and
building an application level multicast tree. For the
latter, we present a distributed algorithm for building
geometric multicast trees that achieve good trade-offs
between delay (stretch) and load (stress). We also
present a new efficient centralized embedding algorithm
that enables the accurate embedding of short distances,
something that have never been done before.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffield:2008:TSU,
author = "Nick Duffield and Matthias Grossglauser",
title = "Trajectory sampling with unreliable reporting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "37--50",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We define and evaluate methods to perform robust
network monitoring using trajectory sampling in the
presence of report loss. The first challenge is to
reconstruct an unambiguous set of packet trajectories
from the reports on sampled packets received at a
collector. In this paper we extend the reporting
paradigm of trajectory sampling to enable the
elimination of ambiguous groups of reports, but without
introducing bias into any characterization of traffic
based on the surviving reports.\par
Even after the elimination, a proportion of
trajectories are incomplete due to report loss. A
second challenge is to adapt measurement based
applications (including network engineering, path
tracing, and passive performance measurement) to
incomplete trajectories. To achieve this, we propose a
method to join multiple incomplete trajectories for
inference, and analyze its performance. We also show
how applications can distinguish between packet and
report loss at the statistical level.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Bloom filters; network traffic measurement; packet
loss; packet sampling",
}
@Article{Kuhn:2008:AAG,
author = "Fabian Kuhn and Roger Wattenhofer and Aaron
Zollinger",
title = "An algorithmic approach to geographic routing in ad
hoc and sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "51--62",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The one type of routing in ad hoc and sensor networks
that currently appears to be most amenable to
algorithmic analysis is geographic routing. This paper
contains an introduction to the problem field of
geographic routing, presents a specific routing
algorithm based on a synthesis of the greedy forwarding
and face routing approaches, and provides an
algorithmic analysis of the presented algorithm from
both a worst-case and an average-case perspective.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithmic analysis; networks; routing; stretch;
wireless",
}
@Article{Spyropoulos:2008:ERIa,
author = "Thrasyvoulos Spyropoulos and Konstantinos Psounis and
Cauligi S. Raghavendra",
title = "Efficient routing in intermittently connected mobile
networks: the single-copy case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "63--76",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Intermittently connected mobile networks are wireless
networks where most of the time there does not exist a
complete path from the source to the destination. There
are many real networks that follow this model, for
example, wildlife tracking sensor networks, military
networks, vehicular ad hoc networks (VANETs), etc. In
this context, conventional routing schemes would fail,
because they try to establish complete end-to-end
paths, before any data is sent.\par
To deal with such networks researchers have suggested
to use flooding-based routing schemes. While
flooding-based schemes have a high probability of
delivery, they waste a lot of energy and suffer from
severe contention which can significantly degrade their
performance. With this in mind, we look into a number
of `single-copy' routing schemes that use only one copy
per message, and hence significantly reduce the
resource requirements of flooding-based algorithms. We
perform a detailed exploration of the single-copy
routing space in order to identify efficient
single-copy solutions that (i) can be employed when low
resource usage is critical, and (ii) can help improve
the design of general routing schemes that use multiple
copies. We also propose a theoretical framework that we
use to analyze the performance of all single-copy
schemes presented, and to derive upper and lower bounds
on the delay of any scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc networks; delay tolerant networks; intermittent
connectivity; routing",
}
@Article{Spyropoulos:2008:ERIb,
author = "Thrasyvoulos Spyropoulos and Konstantinos Psounis and
Cauligi S. Raghavendra",
title = "Efficient routing in intermittently connected mobile
networks: the multiple-copy case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "77--90",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Intermittently connected mobile networks are wireless
networks where most of the time there does not exist a
complete path from the source to the destination. There
are many real networks that follow this model, for
example, wildlife tracking sensor networks, military
networks, vehicular ad hoc networks, etc. In this
context, conventional routing schemes fail, because
they try to establish complete end-to-end paths, before
any data is sent.\par
To deal with such networks researchers have suggested
to use flooding-based routing schemes. While
flooding-based schemes have a high probability of
delivery, they waste a lot of energy and suffer from
severe contention which can significantly degrade their
performance. Furthermore, proposed efforts to reduce
the overhead of flooding-based schemes have often been
plagued by large delays. With this in mind, we
introduce a new family routing schemes that `spray' a
few message copies into the network, and then route
each copy independently towards the destination. We
show that, if carefully designed, spray routing not
only performs significantly fewer transmissions per
message, but also has lower average delivery delays
than existing schemes; furthermore, it is highly
scalable and retains good performance under a large
range of scenarios.\par
Finally, we use our theoretical framework proposed in
our 2004 paper to analyze the performance of spray
routing. We also use this theory to show how to choose
the number of copies to be sprayed and how to optimally
distribute these copies to relays.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc networks; delay tolerant networks; intermittent
connectivity; routing",
}
@Article{Akella:2008:PBM,
author = "Aditya Akella and Bruce Maggs and Srinivasan Seshan
and Anees Shaikh",
title = "On the performance benefits of multihoming route
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "91--104",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See corrections \cite{Akella:2008:CPB}.",
abstract = "Multihoming is increasingly being employed by large
enterprises and data centers to extract good
performance and reliability from their ISP connections.
Multihomed end networks today can employ a variety of
route control products to optimize their Internet
access performance and reliability. However, little is
known about the tangible benefits that such products
can offer, the mechanisms they employ and their
trade-offs. This paper makes two important
contributions. First, we present a study of the
potential improvements in Internet round-trip times
(RTTs) and transfer speeds from employing multihoming
route control. Our analysis shows that multihoming to
three or more ISPs and cleverly scheduling traffic
across the ISPs can improve Internet RTTs and
throughputs by up to 25\% and 20\%, respectively.
However, a careful selection of ISPs is important to
realize the performance improvements. Second, focusing
on large enterprises, we propose and evaluate a
wide-range of route control mechanisms and evaluate
their design trade-offs. We implement the proposed
schemes on a Linux-based Web proxy and perform a
trace-based evaluation of their performance. We show
that both passive and active measurement-based
techniques are equally effective and could improve the
Web response times of enterprise networks by up to 25\%
on average, compared to using a single ISP. We also
outline several `best common practices' for the design
of route control products.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multihoming; performance; reliability",
}
@Article{Chen:2008:TTF,
author = "Shigang Chen and Meongchul Song and Sartaj Sahni",
title = "Two techniques for fast computation of constrained
shortest paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "105--115",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Computing constrained shortest paths is fundamental to
some important network functions such as QoS routing,
MPLS path selection, ATM circuit routing, and traffic
engineering. The problem is to find the cheapest path
that satisfies certain constraints. In particular,
finding the cheapest delay-constrained path is critical
for real-time data flows such as voice/video calls.
Because it is NP-complete, much research has been
designing heuristic algorithms that solve the $
\epsilon $-approximation of the problem with an
adjustable accuracy. A common approach is to discretize
(i.e., scale and round) the link delay or link cost,
which transforms the original problem to a simpler one
solvable in polynomial time. The efficiency of the
algorithms directly relates to the magnitude of the
errors introduced during discretization. In this paper,
we propose two techniques that reduce the
discretization errors, which allows faster algorithms
to be designed. Reducing the overhead of computing
constrained shortest paths is practically important for
the successful design of a high-throughput QoS router,
which is limited at both processing power and memory
space. Our simulations show that the new algorithms
reduce the execution time by an order of magnitude on
power-law topologies with 1000 nodes. The reduction in
memory space is similar.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; constrained shortest paths;
QoS routing",
}
@Article{Ramasubramanian:2008:BBR,
author = "Venugopalan Ramasubramanian and Daniel Moss{\'e}",
title = "{BRA}: a bidirectional routing abstraction for
asymmetric mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "116--129",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless links are often asymmetric due to
heterogeneity in the transmission power of devices,
non-uniform environmental noise, and other signal
propagation phenomena. Unfortunately, routing protocols
for mobile ad hoc networks typically work well only in
bidirectional networks. This paper first presents a
simulation study quantifying the impact of asymmetric
links on network connectivity and routing performance.
It then presents a framework called BRA that provides a
bidirectional abstraction of the asymmetric network to
routing protocols. BRA works by maintaining multi-hop
reverse routes for unidirectional links and provides
three new abilities: improved connectivity by taking
advantage of the unidirectional links, reverse route
forwarding of control packets to enable off-the-shelf
routing protocols, and detection packet loss on
unidirectional links. Extensive simulations of AODV
layered on BRA show that packet delivery increases
substantially (two-fold in some instances) in
asymmetric networks compared to regular AODV, which
only routes on bidirectional links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc network; asymmetry; routing; unidirectional",
}
@Article{Liu:2008:SFA,
author = "Xiliang Liu and Kaliappa Ravindran and Dmitri
Loguinov",
title = "A stochastic foundation of available bandwidth
estimation: multi-hop analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "130--143",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper analyzes the asymptotic behavior of
packet-train probing over a multi-hop network path $P$
carrying arbitrarily routed bursty cross-traffic flows.
We examine the statistical mean of the packet-train
output dispersions and its relationship to the input
dispersion. We call this relationship the response
curve of path $P$. We show that the real response curve
$Z$ is tightly lower-bounded by its multi-hop fluid
counterpart $F$, obtained when every cross-traffic flow
on $P$ is hypothetically replaced with a constant-rate
fluid flow of the same average intensity and routing
pattern. The real curve $Z$ asymptotically approaches
its fluid counterpart $F$ as probing packet size or
packet train length increases. Most existing
measurement techniques are based upon the single-hop
fluid curve $S$ associated with the bottleneck link in
$P$. We note that the curve $S$ coincides with $F$ in a
certain large-dispersion input range, but falls below
$F$ in the remaining small-dispersion input ranges. As
an implication of these findings, we show that bursty
cross-traffic in multi-hop paths causes negative bias
(asymptotic underestimation) to most existing
techniques. This bias can be mitigated by reducing the
deviation of $Z$ from $S$ using large packet size or
long packet-trains. However, the bias is not completely
removable for the techniques that use the portion of
$S$ that falls below $F$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Patel:2008:IQP,
author = "Maulin Patel and R. Chandrasekaran and S. Venkatesan",
title = "Improved quasi-path restoration in mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "144--156",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Restoration of disrupted traffic is critical in
today's high-speed self-healing telecommunication
networks. A restoration scheme dynamically discovers
alternate paths bypassing the failed component. This
paper presents an (online) improved quasi-path
restoration (IQPR) scheme. IQPR is derived from the
two-commodity max-flow algorithm. The running time
complexity of IQPR is $ O(|V|^3) $. Therefore, IQPR is
computationally more efficient and more scalable than
path restoration (PR). IQPR is faster (in restoration
speed) and less complex than PR, and more economical
(in spare capacity requirement) than link restoration
(LR). Thus, it provides a good alternative to PR when
quick restoration of disrupted traffic is
desired.\par
The (offline) spare capacity planning problem deals
with the allocation of spare capacity to each link in
the network, such that the spare capacity requirement
is minimized, while guaranteeing the desired level of
restoration in the event of a link failure. The spare
capacity allocation problems for LR, original
quasi-path restoration (OQPR), IQPR, link-disjoint path
restoration (LDPR) and PR are formulated as integer
linear programming problems. Numerical results
illustrate that the restoration schemes studied can be
sorted from the least efficient to the most efficient
(in the spare capacity requirement) in the following
order: LR, OQPR, IQPR, LDPR and PR.\par
The experimental analysis shows that network topology
and demand patterns have a significant impact on the
spare capacity savings offered by one scheme over the
other. Merits and demerits of these schemes are also
discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "integer linear programming; link restoration; network
survivability; path restoration; quasi-path
restoration; self-healing networks; spare capacity
allocation",
}
@Article{Ramasubramanian:2008:DLF,
author = "Srinivasan Ramasubramanian and Amit Chandak",
title = "Dual-link failure resiliency through backup link
mutual exclusion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "157--169",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Networks employ link protection to achieve fast
recovery from link failures. While the first link
failure can be protected using link protection, there
are several alternatives for protecting against the
second failure. This paper formally classifies the
approaches to dual-link failure resiliency. One of the
strategies to recover from dual-link failures is to
employ link protection for the two failed links
independently, which requires that two links may not
use each other in their backup paths if they may fail
simultaneously. Such a requirement is referred to as
backup link mutual exclusion (BLME) constraint and the
problem of identifying a backup path for every link
that satisfies the above requirement is referred to as
the BLME problem. This paper develops the necessary
theory to establish the sufficient conditions for
existence of a solution to the BLME problem. Solution
methodologies for the BLME problem is developed using
two approaches by: (1) formulating the backup path
selection as an integer linear program; (2) developing
a polynomial time heuristic based on minimum cost path
routing. The ILP formulation and heuristic are applied
to six networks and their performance is compared with
approaches that assume precise knowledge of dual-link
failure. It is observed that a solution exists for all
of the six networks considered. The heuristic approach
is shown to obtain feasible solutions that are
resilient to most dual-link failures, although the
backup path lengths may be significantly higher than
optimal. In addition, the paper illustrates the
significance of the knowledge of failure location by
illustrating that network with higher connectivity may
require lesser capacity than one with a lower
connectivity to recover from dual-link failures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "backup link mutual exclusion; dual-link failures; link
protection; optical networks",
}
@Article{Smiljanic:2008:RDG,
author = "Aleksandra Smiljanic",
title = "Rate and delay guarantees provided by {Clos} packet
switches with load balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "170--181",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The size of a single-hop cross-bar fabric is still
limited by the technology, and the fabrics available on
the market do not exceed the terabit capacity. A
multihop fabric such as Clos network provides the
higher capacity by using the smaller switching elements
(SE). When the traffic load is balanced over the
switches in a middle stage, all the traffic would get
through the fabric, as long as the switch outputs are
not overloaded. However, the delay that packets
experience through the Clos switch depends on the
granularity of flows that are balanced. We examine the
maximum fabric utilization under which a tolerable
delay is provided for various load balancing
algorithms, and derive the general formula for this
utilization in terms of the number of flows that are
balanced. We show that the algorithms which balance
flows with sufficiently coarse granularity provide both
high fabric utilization and delay guarantees to the
most sensitive applications. Since no admission control
should be performed within the switch, the fast
traffic-pattern changes can be accommodated in the
proposed scalable architecture.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay guarantees; Internet routers; non-blocking;
packet switches; performance analysis; scalability",
}
@Article{Iliadis:2008:PST,
author = "Ilias Iliadis and Cyriel Minkenberg",
title = "Performance of a speculative transmission scheme for
scheduling-latency reduction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "182--195",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Low latency is a critical requirement in some
switching applications, specifically in parallel
computer interconnection networks. The minimum latency
in switches with centralized scheduling comprises two
components, namely, the control-path latency and the
data-path latency, which in a practical high-capacity,
distributed switch implementation can be far greater
than the cell duration. We introduce a speculative
transmission scheme to significantly reduce the average
control-path latency by allowing cells to proceed
without waiting for a grant, under certain conditions.
It operates in conjunction with any centralized
matching algorithm to achieve a high maximum
utilization and incorporates a reliable delivery
mechanism to deal with failed speculations. An
analytical model is presented to investigate the
efficiency of the speculative transmission scheme
employed in a non-blocking $ N \times N R $
input-queued crossbar switch with $R$ receivers per
output. Using this model, performance measures such as
the mean delay and the rate of successful speculative
transmissions are derived. The results demonstrate that
the control-path latency can be almost entirely
eliminated for loads up to 50\%. Our simulations
confirm the analytical results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "arbiters; electrooptic switches; modeling; packet
switching; scheduling",
}
@Article{Cruz:2008:SCF,
author = "R. L. Cruz and Saleh Al-Harthi",
title = "A service-curve framework for packet scheduling with
switch configuration delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "196--205",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In modern packet switches, technology limitations may
introduce switch configuration delays that are
nonnegligible compared with the time required to
transmit a single packet. In this paper, we propose a
methodology for scheduling of packets, in the context
of these technology limitations. If the total tolerable
delay through a packet switch is at least on the order
of the switch configuration delay, we show that a near
100\% utilization of the communication links is
possible, while providing strict quality of service
guarantees. The main idea is to increase the quantum
with which data is scheduled and switched to beyond
that of a single packet. This also decreases the rate
at which scheduling need to be made, and hence
decreases the implementation complexity. The quality of
service guarantees we consider are in terms of a
service curve. Specifically, we present a framework for
the provision of service curves while coping with
non-negligible switch configuration delays.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ballast packet; convoy; convoy buffer; MEMS; network
calculus; optical packet switching; quality of service
(QoS); scheduling",
}
@Article{Mneimneh:2008:MFI,
author = "Saad Mneimneh",
title = "Matching from the first iteration: an iterative
switching algorithm for an input queued switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "206--217",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An iterative switching algorithm for an input queued
switch consists of a number of iterations in every time
step, where each iteration computes a disjoint
matching. If input $i$ is matched to output $j$ in a
given iteration, a packet (if any) is forwarded from
$i$ to $j$ in the corresponding time step. Most of the
iterative switching algorithms use a Request Grant
Accept (RGA) arbitration type (e.g. iSLIP).
Unfortunately, due to this particular type of
arbitration, the matching computed in one iteration is
not necessarily maximal (more input and output ports
can still be matched). This is exactly why multiple
iterations are needed. However, multiple iterations
make the time step larger and reduce the speed of the
switch.\par
We present a new iterative switching algorithm (based
on the RGA arbitration) called $ \pi $-RGA with the
underlying assumption that the number of iterations is
possibly limited to one, hence reducing the time step
and allowing the switch to run at a higher speed. We
prove that $ \pi $-RGA achieves throughput and delay
guarantees with a speedup of 2 and one iteration under
a constant burst traffic model, which makes $ \pi $-RGA
as good as any maximal matching algorithm in the
theoretical sense. We also show by simulation that $
\pi $-RGA achieves relatively high throughput in
practice under uniform and non-uniform traffic patterns
with one iteration and no speedup.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "input queued switch; iterative switching algorithms;
matching algorithms; number of iterations; speedup",
}
@Article{Kirsch:2008:SSH,
author = "Adam Kirsch and Michael Mitzenmacher",
title = "Simple summaries for hashing with choices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "218--231",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a multiple-choice hashing scheme, each item is
stored in one of $ \geq 2 $ possible hash table
buckets. The availability of these multiple choices
allows for a substantial reduction in the maximum load
of the buckets. However, a lookup may now require
examining each of the $d$ locations. For applications
where this cost is undesirable, Song et al. propose
keeping a summary that allows one to determine which of
the $d$ locations is appropriate for each item, where
the summary may allow false positives for items not in
hash table. We propose alternative, simple
constructions of such summaries that use less space for
both the summary and the underlying hash table.
Moreover, our constructions are easily analyzable and
tunable.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hash tables; router architecture; table lookup",
}
@Article{Wang:2008:MAL,
author = "Xin Wang and Henning Schulzrinne and Dilip Kandlur and
Dinesh Verma",
title = "Measurement and analysis of {LDAP} performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "232--243",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Lightweight Directory Access Protocol (LDAP) is
being used for an increasing number of distributed
directory applications. We describe a tool to analyze
the performance of LDAP directories, and study the
performance of a LDAP directory under a variety of
access patterns. In the experiments, we use a LDAP
schema proposed for the administration of Service Level
Specifications (SLSs) in a differentiated services
network. Individual modules in the server and client
code are instrumented to obtain a detailed profile of
their contributions to the overall system latency and
throughput. We first study the performance under our
default experiment setup. We then study the importance
of the factors in determining scalability, namely
front-end versus back-end processes, CPU capability,
and available memory. At high loads, the connection
management latency increases sharply to dominate the
response in most cases. The TCP Nagle algorithm is
found to introduce a very large additional latency, and
it appears beneficial to disable it in the LDAP server.
The CPU capability is found to be significant in
limiting the performance of the LDAP server, and for
larger directories, which cannot be kept in memory,
data transfer from the disk also plays a major role.
The scaling of server performance with the number of
directory entries is determined by the increase in
back-end search latency, and scaling with directory
entry size is limited by the front-end encoding of
search results, and, for out-of-memory directories, by
the disk access latency. We investigate different
mechanisms to improve the server performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "benchmark; diffServ; directory service; LDAP;
measurement; performance; policy",
}
@Article{Lau:2008:CDR,
author = "William Lau and Gustav Filip Rosenbaum and Sanjay
Jha",
title = "Comments on {`Dynamic routing of restorable
bandwidth-guaranteed tunnels using aggregated network
resource usage information'}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "1",
pages = "244--245",
month = feb,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:59:54 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Kodialam:2003:DRR}.",
abstract = "This paper identifies and corrects two flaws in the
paper `Dynamic routing of restorable
bandwidth-guaranteed tunnels using aggregate network
resource usage information', Kodialam and Lakshman,
IEEE/ACM Trans. Networking, 2003.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiu:2008:MFD,
author = "Yuh-Ming Chiu and Do Young Eun",
title = "Minimizing file download time in stochastic
peer-to-peer networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "253--266",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The peer-to-peer (P2P) file-sharing applications are
becoming increasingly popular and account for more than
70\% of the Internet's bandwidth usage. Measurement
studies show that a typical download of a file can take
from minutes up to several hours depending on the level
of network congestion or the service capacity
fluctuation. In this paper, we consider two major
factors that have significant impact on average
download time, namely, the spatial heterogeneity of
service capacities in different source peers and the
temporal fluctuation in service capacity of a single
source peer. We point out that the common approach of
analyzing the average download time based on average
service capacity is fundamentally flawed. We rigorously
prove that both spatial heterogeneity and temporal
correlations in service capacity increase the average
download time in P2P networks and then analyze a
simple, distributed algorithm to effectively remove
these negative factors, thus minimizing the average
download time. We show through analysis and simulations
that it outperforms most of other algorithms currently
used in practice under various network
configurations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network performance; peer selection strategy;
peer-to-peer network",
}
@Article{Stutzbach:2008:CUO,
author = "Daniel Stutzbach and Reza Rejaie and Subhabrata Sen",
title = "Characterizing unstructured overlay topologies in
modern {P2P} file-sharing systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "267--280",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In recent years, peer-to-peer (P2P) file-sharing
systems have evolved to accommodate growing numbers of
participating peers. In particular, new features have
changed the properties of the unstructured overlay
topologies formed by these peers. Little is known about
the characteristics of these topologies and their
dynamics in modern file-sharing applications, despite
their importance. This paper presents a detailed
characterization of P2P overlay topologies and their
dynamics, focusing on the modern Gnutella network. We
present Cruiser, a fast and accurate P2P crawler, which
can capture a complete snapshot of the Gnutella network
of more than one million peers in just a few minutes,
and show how inaccuracy in snapshots can lead to
erroneous conclusions--such as a power-law degree
distribution. Leveraging recent overlay snapshots
captured with Cruiser, we characterize the
graph-related properties of individual overlay
snapshots and overlay dynamics across slices of
back-to-back snapshots. Our results reveal that while
the Gnutella network has dramatically grown and changed
in many ways, it still exhibits the clustering and
short path lengths of a small world network.
Furthermore, its overlay topology is highly resilient
to random peer departure and even systematic attacks.
More interestingly, overlay dynamics lead to an
`onion-like' biased connectivity among peers where each
peer is more likely connected to peers with higher
uptime. Therefore, long-lived peers form a stable core
that ensures reachability among peers despite overlay
dynamics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "file sharing; Gnutella; measurement; overlay topology;
peer-to-peer",
}
@Article{Kwong:2008:BHP,
author = "Kin-Wah Kwong and H. K. Tsang",
title = "Building heterogeneous peer-to-peer networks: protocol
and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "281--292",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a simple protocol for
building heterogeneous unstructured peer-to-peer (P2P)
networks. The protocol consists of two parts--the
joining process and the rebuilding process. The basic
idea for the joining process is to use a random walk to
assist new incoming peers in selecting their suitable
neighbors in terms of capacity and connectivity to
achieve load-balancing. The rebuilding process
specifies how the nodes should react when they lose
links. In particular, we examine two representative
schemes, namely the probabilistic-rebuilding scheme and
the adaptive-rebuilding scheme. Furthermore, we provide
a detailed analysis to investigate our proposed
protocol under any heterogeneous P2P environment. We
prove that the topology structure of the P2P network
depends heavily on the node heterogeneity. The
analytical results are validated by the simulations.
Our framework provides a guideline to engineer and
optimize a P2P network in different respects under a
heterogeneous environment. The ultimate goal of this
paper is to stimulate further research to explore the
fundamental issues in heterogeneous P2P networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity; heterogeneity; random walk; topology;
unstructured P2P network",
}
@Article{Kencl:2008:ALS,
author = "Lukas Kencl and Jean-Yves {Le Boudec}",
title = "Adaptive load sharing for network processors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "293--306",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A novel scheme for processing packets in a router is
presented that provides load sharing among multiple
network processors distributed within the router. It is
complemented by a feedback control mechanism designed
to prevent processor overload. Incoming traffic is
scheduled to multiple processors based on a
deterministic mapping. The mapping formula is derived
from the robust hash routing (also known as the highest
random weight--HRW) scheme, introduced in K. W. Ross,
IEEE Network, 11(6), 1997, and D. G. Thaler et al.,
IEEE Trans. Networking, 6(1), 1998. No state
information on individual flow mapping has to be
stored, but for each packet, a mapping function is
computed over an identifier vector, a predefined set of
fields in the packet. An adaptive extension to the HRW
scheme is provided to cope with biased traffic
patterns. We prove that our adaptation possesses the
minimal disruption property with respect to the mapping
and exploit that property to minimize the probability
of flow reordering. Simulation results indicate that
the scheme achieves significant improvements in
processor utilization. A higher number of router
interfaces can thus be supported with the same amount
of processing power.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "computer networks; feedback control; load balancing;
load sharing; packet processing; router architecture",
}
@Article{Sommers:2008:GAI,
author = "Joel Sommers and Paul Barford and Nick Duffield and
Amos Ron",
title = "A geometric approach to improving active packet loss
measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "307--320",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Measurement and estimation of packet loss
characteristics are challenging due to the relatively
rare occurrence and typically short duration of packet
loss episodes. While active probe tools are commonly
used to measure packet loss on end-to-end paths, there
has been little analysis of the accuracy of these tools
or their impact on the network. The objective of our
study is to understand how to measure packet loss
episodes accurately with end-to-end probes. We begin by
testing the capability of standard Poisson-modulated
end-to-end measurements of loss in a controlled
laboratory environment using IP routers and commodity
end hosts. Our tests show that loss characteristics
reported from such Poisson-modulated probe tools can be
quite inaccurate over a range of traffic conditions.
Motivated by these observations, we introduce a new
algorithm for packet loss measurement that is designed
to overcome the deficiencies in standard Poisson-based
tools. Specifically, our method entails probe
experiments that follow a geometric distribution to (1)
enable an explicit trade-off between accuracy and
impact on the network, and (2) enable more accurate
measurements than standard Poisson probing at the same
rate. We evaluate the capabilities of our methodology
experimentally by developing and implementing a
prototype tool, called BADABING. The experiments
demonstrate the trade-offs between impact on the
network and measurement accuracy. We show that BADABING
reports loss characteristics far more accurately than
traditional loss measurement tools.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "active measurement; BADABING; network congestion;
network probes; packet loss",
}
@Article{Hou:2008:RAN,
author = "Y. Thomas Hou and Yi Shi and Hanif D. Sherali",
title = "Rate allocation and network lifetime problems for
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "321--334",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An important performance consideration for wireless
sensor networks is the amount of information collected
by all the nodes in the network over the course of
network lifetime. Since the objective of maximizing the
sum of rates of all the nodes in the network can lead
to a severe bias in rate allocation among the nodes, we
advocate the use of lexicographical max-min (LMM) rate
allocation. To calculate the LMM rate allocation
vector, we develop a polynomial-time algorithm by
exploiting the parametric analysis (PA) technique from
linear program (LP), which we call serial LP with
Parametric Analysis (SLP-PA). We show that the SLP-PA
can be also employed to address the LMM node lifetime
problem much more efficiently than a state-of-the-art
algorithm proposed in the literature. More important,
we show that there exists an elegant duality
relationship between the LMM rate allocation problem
and the LMM node lifetime problem. Therefore, it is
sufficient to solve only one of the two problems.
Important insights can be obtained by inferring duality
results for the other problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "energy constraint; flow routing; lexicographic
max-min; linear programming; network capacity; node
lifetime; parametric analysis; rate allocation; sensor
networks; theory",
}
@Article{Sarshar:2008:LLW,
author = "Nima Sarshar and Behnam A. Rezaei and Vwani P.
Roychowdhury",
title = "Low latency wireless ad hoc networking: power and
bandwidth challenges and a solution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "335--346",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper is concerned with the scaling of the number
of relay nodes (i.e., hops) individual messages have to
transit through in a large-scale wireless ad hoc
network (WANET); we call this hop-count as network
latency (NL). A large network latency affects all
aspects of data communication in a WANET, including an
increase in delay, packet loss, and the power needed to
process and store messages in nodes lying on the relay
path. We consider network management and data routing
challenges in WANETs with scalable network latency,
e.g., when NL increases only polylogarithmically in the
network size. On the physical side, reducing network
latency imposes a significantly higher power and
bandwidth demand on nodes, and are captured in a set of
new bounds derived in this paper. On the protocol
front, designing distributed routing protocols that can
guarantee the delivery of data packets within a
scalable number of hops is a challenging task. To solve
this, we introduce multiresolution randomized hierarchy
(MRRH), a novel power and bandwidth efficient WANET
protocol with scalable network latency. MRRH uses a
randomized algorithm for building and maintaining a
random hierarchical network topology, which together
with the proposed routing algorithm, can guarantee
efficient delivery of data packets in the wireless
network. For a network of size $N$, MRRH can provide an
average latency of only $ O(\log^3 N)$. The power
consumption and bandwidth requirements of MRRH are
shown to be nearly optimal for the latency it provides.
Therefore, MRRH is a provably efficient candidate for
truly large-scale wireless ad hoc networking.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multi-resolution randomized hierarchy; network
latency; scalable routing; wireless ad hoc networks",
}
@Article{Zhang:2008:ACT,
author = "Honghai Zhang and Jennifer C. Hou",
title = "Asymptotic critical total power for $k$-connectivity
of wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "347--358",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An important issue in wireless ad hoc networks is to
reduce the transmission power subject to certain
connectivity requirement. In this paper, we study the
fundamental scaling law of the minimum total power
(termed as critical total power) required to ensure
$k$-connectivity in wireless networks. Contrary to
several previous results that assume all nodes use a
(minimum) common power, we allow nodes to choose
different levels of transmission power. We show that
under the assumption that wireless nodes form a
homogeneous Poisson point process with density $
\lambda $ in a unit square region $ [0, 1]^2$, the
critical total power required to maintain
$k$-connectivity is $ \Theta ((\Gamma (c / 2 + k) / (k
- 1)!) \lambda^{1 - c / 2})$ with probability
approaching one as $ \lambda $ goes to infinity, where
$c$ is the path loss exponent. If $k$ also goes to
infinity, the expected critical total power is of the
order of $ k^{c / 2} \lambda^{1 - c / 2}$. Compared
with the results that all nodes use a common critical
transmission power for maintaining $k$-connectivity, we
show that the critical total power can be reduced by an
order of $ (\log \lambda)^{c / 2}$ by allowing nodes to
optimally choose different levels of transmission
power. This result is not subject to any specific
power/topology control algorithm, but rather a
fundamental property of wireless networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "connectivity; critical power; power control; wireless
networks",
}
@Article{Gungor:2008:RTR,
author = "Vehbi Cagri Gungor and {\"O}zg{\"u}r B. Akan and Ian
F. Akyildiz",
title = "A real-time and reliable transport {(RT)$^2$} protocol
for wireless sensor and actor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "359--370",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless Sensor and Actor Networks (WSANs) are
characterized by the collective effort of heterogeneous
nodes called sensors and actors. Sensor nodes collect
information about the physical world, while actor nodes
take action decisions and perform appropriate actions
upon the environment. The collaborative operation of
sensors and actors brings significant advantages over
traditional sensing, including improved accuracy,
larger coverage area and timely actions upon the sensed
phenomena. However, to realize these potential gains,
there is a need for an efficient transport layer
protocol that can address the unique communication
challenges introduced by the coexistence of sensors and
actors. In this paper, a Real-Time and Reliable
Transport (RT)$^2$ protocol is presented for WSANs. The
objective of the (RT)$^2$ protocol is to reliably and
collaboratively transport event features from the
sensor field to the actor nodes with minimum energy
dissipation and to timely react to sensor information
with a right action. In this respect, the (RT)$^2$
protocol simultaneously addresses congestion control
and timely event transport reliability objectives in
WSANs. To the best of our knowledge, this is the first
research effort focusing on real-time and reliable
transport protocol for WSANs. Performance evaluations
via simulation experiments show that the (RT)$^2$
protocol achieves high performance in terms of reliable
event detection, communication latency and energy
consumption in WSANs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion detection and control; energy efficiency;
real-time and reliable transport protocol; wireless
sensor and actor networks",
}
@Article{Cerutti:2008:DMS,
author = "Isabella Cerutti and Andrea Fumagalli and Puja Gupta",
title = "Delay models of single-source single-relay cooperative
{ARQ} protocols in slotted radio networks with
{Poisson} frame arrivals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "371--382",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In conventional (noncooperative) automatic repeat
request (ARQ) protocols for radio networks, the
corrupted data frames that cannot be correctly decoded
at the destination are retransmitted by the source. In
cooperative ARQ protocols, data frame retransmissions
may be performed by a neighboring node (the relay) that
has successfully overheard the source's frame
transmission. One advantage of the latter group of ARQ
protocols is the spatial diversity provided by the
relay.\par
The first delay model for cooperative ARQ protocols is
derived in this paper. The model is analytically
derived for a simple set of retransmission rules that
make use of both uncoded and coded cooperative
communications in slotted radio networks. The model
estimates the delay experienced by Poisson arriving
frames, whose retransmissions (when required) are
performed also by a single relay. Saturation
throughput, data frame latency, and buffer occupancy at
both the source and relay are quantified and compared
against two noncooperative ARQ protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cooperative ARQ; queueing model; radio network",
}
@Article{Boche:2008:SGC,
author = "Holger Boche and Martin Schubert",
title = "A superlinearly and globally convergent algorithm for
power control and resource allocation with general
interference functions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "383--395",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless networks, users are typically coupled by
interference. Hence, resource allocation can strongly
depend on receive strategies, such as beamforming, CDMA
receivers, etc. We study the problem of minimizing the
total transmission power while maintaining individual
quality-of-service (QoS) values for all users. This
problem can be solved by the fixed-point iteration
proposed by Yates (1995) as well as by a recently
proposed matrix-based iteration (Schubert and Boche,
2007). It was observed by numerical simulations that
the matrix-based iteration has interesting numerical
properties, and achieves the global optimum in only a
few steps. However, an analytical investigation of the
convergence behavior has been an open problem so far.
In this paper, we show that the matrix-based iteration
can be reformulated as a Newton-type iteration of a
convex function, which is not guaranteed to be
continuously differentiable. Such a behavior can be
caused by ambiguous representations of the interference
functions, depending on the choice of the receive
strategy. Nevertheless, superlinear convergence can be
shown by exploiting the special structure of the
problem. Namely, the function is convex, locally
Lipschitz continuous, and an invertible directional
derivative exists for all points of interest.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "interference suppression; multi-user channels; power
control; resource allocation",
}
@Article{Neely:2008:FOS,
author = "Michael J. Neely and Eytan Modiano and Chih-Ping Li",
title = "Fairness and optimal stochastic control for
heterogeneous networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "396--409",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider optimal control for general networks with
both wireless and wireline components and time varying
channels. A dynamic strategy is developed to support
all traffic whenever possible, and to make optimally
fair decisions about which data to serve when inputs
exceed network capacity. The strategy is decoupled into
separate algorithms for flow control, routing, and
resource allocation, and allows each user to make
decisions independent of the actions of others. The
combined strategy is shown to yield data rates that are
arbitrarily close to the optimal operating point
achieved when all network controllers are coordinated
and have perfect knowledge of future events. The cost
of approaching this fair operating point is an
end-to-end delay increase for data that is served by
the network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed computing; flow control; queueing
analysis; satellite networks; stochastic optimization;
wireless networks",
}
@Article{Nam:2008:MBA,
author = "Seung Yeob Nam and Sunggon Kim and Dan Keun Sung",
title = "Measurement-based admission control at edge routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "410--423",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is very important to allocate and manage resources
for multimedia traffic flows with real-time performance
requirements in order to guarantee quality of service
(QoS). In this paper, we develop a scalable
architecture and an algorithm for admission control of
real-time flows. Since individual management of each
traffic flow on each transit router can cause a
fundamental scalability problem in both data and
control planes, we consider that each flow is
classified at the ingress router and data traffic is
aggregated according to the class inside the core
network as in a DiffServ framework. In our approach,
admission decision is made for each flow at the edge
(ingress) routers, but it is scalable because per-flow
states are not maintained and the admission algorithm
is simple. In the proposed admission control scheme, an
admissible bandwidth, which is defined as the maximum
rate of a flow that can be accommodated additionally
while satisfying the delay performance requirements for
both existing and new flows, is calculated based on the
available bandwidth measured by edge routers. The
admissible bandwidth is a threshold for admission
control, and thus, it is very important to accurately
estimate the admissible bandwidth. The performance of
the proposed algorithm is evaluated by taking a set of
simulation experiments using bursty traffic flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "admissible bandwidth; admission control; available
bandwidth; measurement; quality of service (QoS)",
}
@Article{Ali:2008:SCA,
author = "Zafar Ali and Waseem Sheikh and Edwin K. P. Chong and
Arif Ghafoor",
title = "A scalable call admission control algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "424--434",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a scalable algorithm for
connection admission control (CAC). The algorithm
applies to a Multiprotocol Label Switching (MPLS) ATM
switch with a FIFO buffer. The switch carries data from
statistically independent variable bit rate (VBR)
sources that asynchronously alternate between ON and
OFF states with exponentially distributed periods. The
sources may be heterogeneous both in terms of their
statistical characteristics (peak cell rate, sustained
cell rate, and burst size attributes) as well as their
Quality of Service (QoS) requirements.\par
The performance of the proposed CAC scheme is evaluated
using known performance bounds and simulation results.
For the purpose of comparison, we also present
scalability analyses for some of the previously
proposed CAC schemes. Our results show that the
proposed CAC scheme consistently performs better and
operates the link close to the highest possible
utilization level. Furthermore, the scheme scales well
with increasing amount of resources (link capacity and
buffer size) and accommodates intelligently the mix of
traffic offered by sources of diversed burstiness
characteristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "call admission control (CAC); multiprotocol label
switching (MPLS); traffic management",
}
@Article{Shin:2008:DRT,
author = "Minsu Shin and Song Chong and Injong Rhee",
title = "Dual-resource {TCP\slash AQM} for
processing-constrained networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "435--449",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper examines congestion control issues for TCP
flows that require in-network processing on the fly in
network elements such as gateways, proxies, firewalls
and even routers. Applications of these flows are
increasingly abundant in the future as the Internet
evolves. Since these flows require use of CPUs in
network elements, both bandwidth and CPU resources can
be a bottleneck and thus congestion control must deal
with `congestion' on both of these resources. In this
paper, we show that conventional TCP/AQM schemes can
significantly lose throughput and suffer harmful
unfairness in this environment, particularly when CPU
cycles become more scarce (which is likely the trend
given the recent explosive growth rate of bandwidth).
As a solution to this problem, we establish a notion of
dual-resource proportional fairness and propose an AQM
scheme, called Dual-Resource Queue (DRQ), that can
closely approximate proportional fairness for TCP Reno
sources with in-network processing requirements. DRQ is
scalable because it does not maintain per-flow states
while minimizing communication among different resource
queues, and is also incrementally deployable because of
no required change in TCP stacks. The simulation study
shows that DRQ approximates proportional fairness
without much implementation cost and even an
incremental deployment of DRQ at the edge of the
Internet improves the fairness and throughput of these
TCP flows. Our work is at its early stage and might
lead to an interesting development in congestion
control research.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CPU capacity; efficiency; fairness; proportional;
TCP-AQM; transmission link capacity",
}
@Article{Fragouli:2008:EBU,
author = "Christina Fragouli and J{\"o}rg Widmer and Jean-Yves
{Le Boudec}",
title = "Efficient broadcasting using network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "450--463",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of broadcasting in an ad hoc
wireless network, where all nodes of the network are
sources that want to transmit information to all other
nodes. Our figure of merit is energy efficiency, a
critical design parameter for wireless networks since
it directly affects battery life and thus network
lifetime. We prove that applying ideas from network
coding allows to realize significant benefits in terms
of energy efficiency for the problem of broadcasting,
and propose very simple algorithms that allow to
realize these benefits in practice. In particular, our
theoretical analysis shows that network coding improves
performance by a constant factor in fixed networks. We
calculate this factor exactly for some canonical
configurations. We then show that in networks where the
topology dynamically changes, for example due to
mobility, and where operations are restricted to simple
distributed algorithms, network coding can offer
improvements of a factor of $ \log n $, where $n$ is
the number of nodes in the network. We use the insights
gained from the theoretical analysis to propose
low-complexity distributed algorithms for realistic
wireless ad hoc scenarios, discuss a number of
practical considerations, and evaluate our algorithms
through packet level simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network coding; wireless broadcast",
}
@Article{Syrotiuk:2008:RFE,
author = "Violet R. Syrotiuk and Charles J. Colbourn and Sruthi
Yellamraju",
title = "Rateless forward error correction for
topology-transparent scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "464--472",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Topology-transparent scheduling for mobile wireless ad
hoc networks has been treated as a theoretical
curiosity. This paper makes two contributions towards
its practical deployment: (1) We generalize the
combinatorial requirement on the schedules and show
that the solution is a cover-free family. As a result,
a much wider number and variety of constructions for
schedules exist to match network conditions. (2) In
simulation, we closely match the theoretical bound on
expected throughput. The bound was derived assuming
acknowledgments are available immediately. We use
rateless forward error correction (RFEC) as an
acknowledgment scheme with minimal computational
overhead. Since the wireless medium is inherently
unreliable, RFEC also offers some measure of automatic
adaptation to channel load. These contributions renew
interest in topology-transparent scheduling when delay
is a principal objective.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile ad hoc networks; rateless forward error
correction; topology-transparent scheduling",
}
@Article{Ramasubramanian:2008:MFC,
author = "Srinivasan Ramasubramanian and Arun K. Somani",
title = "{MICRON}: a framework for connection establishment in
optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "473--485",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic grooming in optical networks has gained
significance due to the prevailing sub-wavelength
requirement of end users. Optical networks get upgraded
to the latest technology slowly with time with only a
subset of nodes being upgraded to the latest
technology. The networks are thus comprised of nodes
employing heterogeneous switching architectures. In
this paper, we develop a framework called Methodology
for Information Collection and Routing in Optical
Networks (MICRON) for connection establishment in
optical grooming networks with heterogeneous switching
architectures. We illustrate with examples the
information that may be collected from the links, and
operators that may be used to obtain information along
a path. The information can be used to select a path
dynamically depending on the network status. We
complete the MICRON framework by providing a generic
channel assignment procedure that could be employed to
implement different channel assignment schemes. Various
routing and channel assignment algorithms can be
developed from the proposed framework. The framework
may be easily implemented with simple traffic
engineering extensions to the already existing routing
protocols in the wide-area networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity and connection management framework; channel
assignment; path selection; traffic grooming;
wavelength division multiplexing; wavelength routing",
}
@Article{Wang:2008:EDB,
author = "Dongmei Wang and Guangzhi Li",
title = "Efficient distributed bandwidth management for {MPLS}
fast reroute",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "486--495",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As service providers move more applications to their
IP/MPLS (Multiple Protocol Label Switching [1])
backbone networks, rapid restoration upon failure
becomes more and more crucial. Recently MPLS fast
reroute has attracted lots of attention as it was
designed to meet the needs of real-time applications,
such as voice over IP. MPLS fast reroute achieves rapid
restoration by computing and signaling backup label
switched path (LSP) tunnels in advance and re-directing
traffic as close to failure point as possible. To
provide a guarantee of bandwidth protection, extra
bandwidth has to be reserved on backup paths. Using
path merging technique as described in IETF RFC 4090
only, the network is able to share some bandwidth on
common links among backup paths of the same service
LSP, i.e., so-called intra-sharing. But no solution is
provided on how to share bandwidth among backup paths
of different service LSPs, i.e., so-called
inter-sharing. In this paper, we provide an efficient
distributed bandwidth management solution. This
solution allows bandwidth sharing among backup paths of
the same and different service LSPs, i.e., both
intra-sharing and inter-sharing, with a guarantee of
bandwidth protection for any single node/link failure.
We also propose an efficient algorithm for backup path
selection with the associated signaling extensions for
additional information distribution and collection. To
evaluate our schemes, we compare them via simulation
with the basic MPLS fast reroute proposal, IETF RFC
4090, on two networks. Our simulation results show that
using our bandwidth management scheme can significantly
reduce restoration overbuild from about 250\% to about
100\%, and our optimized backup path selection can
further reduce restoration overbuild to about 60\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MPLS fast reroute; protocol; restoration; simulation",
}
@Article{Akella:2008:CPB,
author = "Aditya Akella and Bruce Maggs and Srinivasan Seshan
and Anees Shaikh and Ramesh K. Sitaraman",
title = "Corrections to {`On the performance benefits of
multihoming route control'}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "2",
pages = "496--496",
month = apr,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 10:00:46 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Akella:2008:PBM}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Katti:2008:XAP,
author = "Sachin Katti and Hariharan Rahul and Wenjun Hu and
Dina Katabi and Muriel M{\'e}dard and Jon Crowcroft",
title = "{XORs} in the air: practical wireless network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "497--510",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.923722",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes COPE, a new architecture for
wireless mesh networks. In addition to forwarding
packets, routers mix (i.e., code) packets from
different sources to increase the information content
of each transmission. We show that intelligently mixing
packets increases network throughput. Our design is
rooted in the theory of network coding. Prior work on
network coding is mainly theoretical and focuses on
multicast traffic. This paper aims to bridge theory
with practice; it addresses the common case of unicast
traffic, dynamic and potentially bursty flows, and
practical issues facing the integration of network
coding in the current network stack. We evaluate our
design on a 20-node wireless network, and discuss the
results of the first testbed deployment of wireless
network coding. The results show that using COPE at the
forwarding layer, without modifying routing and higher
layers, increases network throughput. The gains vary
from a few percent to several folds depending on the
traffic pattern, congestion level, and transport
protocol.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; design; network coding; performance;
theory; wireless networks",
}
@Article{Rhee:2008:ZMH,
author = "Injong Rhee and Ajit Warrier and Mahesh Aia and
Jeongki Min and Mihail L. Sichitiu",
title = "{Z-MAC}: a hybrid {MAC} for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "511--524",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900704",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents the design, implementation and
performance evaluation of a hybrid MAC protocol, called
Z-MAC, for wireless sensor networks that combines the
strengths of TDMA and CSMA while offsetting their
weaknesses. Like CSMA, ZMAC achieves high channel
utilization and low latency under low contention and
like TDMA, achieves high channel utilization under high
contention and reduces collision among two-hop
neighbors at a low cost. A distinctive feature of Z-MAC
is that its performance is robust to synchronization
errors, slot assignment failures, and time-varying
channel conditions; in the worst case, its performance
always falls back to that of CSMA. Z-MAC is implemented
in TinyOS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CSMA; MAC; TDMA; wireless sensor networks",
}
@Article{Misra:2008:ITB,
author = "Archan Misra and Abhishek Roy and Sajal K. Das",
title = "Information-theory based optimal location management
schemes for integrated multi-system wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "525--538",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.901067",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a multi-system environment where a mobile node can
utilize multiple interfaces and simultaneously connect
to multiple providers, new opportunities exist for
efficient location management strategies spanning
heterogeneous cellular wireless networks. In this
paper, an integrated framework is developed for
location management in such a multi-system, fourth
generation (4G) wireless networks. This
information-theoretic framework allows each individual
sub-system to operate fairly independently, and does
not require the knowledge of individual sub-network
topologies. An efficient location management in such a
loosely coupled network is designed by having a mobile
node view its movement as a vector-valued sequence, and
then transmit this sequence in an entropy coded form to
the network. We demonstrate how an intelligent,
integrated paging strategy must consider the joint
residence probability distribution of a mobile node in
multiple sub-networks. We prove that the determination
of an optimal paging sequence is {\em NP\/}-complete,
and also propose an efficient greedy heuristic to
compute the paging sequence, both without and with
bounds on the paging delay. Three different location
tracking strategies are proposed and evaluated; they
differ in their degrees of centralized control and
provide tradeoff between the location update and paging
costs. Simulation experiments demonstrate that our
proposed schemes can result in more than 50\% savings
in both update and paging costs, in comparison with the
basic movement-based, multi-system location management
strategy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cellular networks; information theory; location
management; LZ compression; multi-system; paging",
}
@Article{Sarikaya:2008:SPT,
author = "Behcet Sarikaya and Xiao Zheng",
title = "{SIP} paging and tracking of wireless {LAN} hosts for
{VoIP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "539--548",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900408",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a new paging technique to track
and wake up a mobile node (MN) attached to an access
point (AP) in a wireless LAN network after a session
initiation protocol (SIP) INVITE message is initiated
by a caller. A tracking agent (TA) keeps track of the
mobiles' handoffs between the APs. A paging agent (PA)
triggers the TA to page the mobile when a SIP INVITE is
received for one of its users. The context transfer
feature of our paging protocol allows the paging
messages to deliver the station context in order to
enable faster session reestablishment. The AP then does
onlink paging in a wireless link. SIP extensions are
needed to trigger the PA to start paging MNs to notify
their dormant status using an extended SIP REGISTER
method. Tracking protocol is analyzed to compare soft-
and hard-state approaches for state inconsistency
ratio, message rate, and the overall cost. The
simulation model we developed enables us to evaluate
the traffic introduced by the tracking protocol and the
cache (state) size. Paging protocol is analyzed for CPU
processing times and the transmission delays in the SIP
session setup with paging. Simulation of the paging
with context transfer is used to show the gains in
reauthentication.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "context transfer; fluid flow and random walk mobility
model; onlink paging; paging agent (PA); session
initiation protocol (SIP); tracking agent (TA)",
}
@Article{Lakshminarayanan:2008:SUC,
author = "Karthik Lakshminarayanan and Daniel Adkins and Adrian
Perrig and Ion Stoica",
title = "Securing user-controlled routing infrastructures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "549--561",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.903980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designing infrastructures that give untrusted third
parties (such as end-hosts) control over routing is a
promising research direction for achieving flexible and
efficient communication. However, serious concerns
remain over the deployment of such infrastructures,
particularly the new security vulnerabilities they
introduce. The flexible control plane of these
infrastructures can be exploited to launch many types
of powerful attacks with little effort. In this paper,
we make several contributions towards studying security
issues in forwarding infrastructures (FIs). We present
a general model for an FI, analyze potential security
vulnerabilities, and present techniques to address
these vulnerabilities. The main technique that we
introduce in this paper is the use of simple
lightweight cryptographic constraints on forwarding
entries. We show that it is possible to prevent a large
class of attacks on end-hosts and bound the flooding
attacks that can be launched on the infrastructure
nodes to a small constant value. Our mechanisms are
general and apply to a variety of earlier proposals
such as $i$ 3, DataRouter, and Network Pointers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet architecture; overlay networks; security",
}
@Article{Kim:2008:STD,
author = "Seong Soo Kim and A. L. Narasimha Reddy",
title = "Statistical techniques for detecting traffic anomalies
through packet header data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "562--575",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.902685",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a traffic anomaly detector,
operated in postmortem and in real-time, by passively
monitoring packet headers of traffic. The frequent
attacks on network infrastructure, using various forms
of denial of service attacks, have led to an increased
need for developing techniques for analyzing network
traffic. If efficient analysis tools were available, it
could become possible to detect the attacks, anomalies
and to take action to contain the attacks appropriately
before they have had time to propagate across the
network. In this paper, we suggest a technique for
traffic anomaly detection based on analyzing
correlation of destination IP addresses in outgoing
traffic at an egress router. This address correlation
data are transformed using discrete wavelet transform
for effective detection of anomalies through
statistical analysis. Results from trace-driven
evaluation suggest that proposed approach could provide
an effective means of detecting anomalies close to the
source. We also present a multidimensional indicator
using the correlation of port numbers and the number of
flows as a means of detecting anomalies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "egress filtering; network attack; packet header;
real-time network anomaly detection; statistical
analysis of network traffic; time series of address
correlation; wavelet-based transform",
}
@Article{Yu:2008:SDA,
author = "Haifeng Yu and Michael Kaminsky and Phillip B. Gibbons
and Abraham D. Flaxman",
title = "{SybilGuard}: defending against sybil attacks via
social networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "576--589",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.923723",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer and other decentralized, distributed
systems are known to be particularly vulnerable to
sybil attacks. In a sybil attack, a malicious user
obtains multiple fake identities and pretends to be
multiple, distinct nodes in the system. By controlling
a large fraction of the nodes in the system, the
malicious user is able to 'out vote' the honest users
in collaborative tasks such as Byzantine failure
defenses. This paper presents SybilGuard, a novel
protocol for limiting the corruptive influences of
sybil attacks. Our protocol is based on the 'social
network' among user identities, where an edge between
two identities indicates a human-established trust
relationship. Malicious users can create many
identities but few trust relationships. Thus, there is
a disproportionately small 'cut' in the graph between
the sybil nodes and the honest nodes. SybilGuard
exploits this property to bound the number of
identities a malicious user can create. We show the
effectiveness of SybilGuard both analytically and
experimentally.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "social networks; sybil attack; sybil identity;
SybilGuard",
}
@Article{Li:2008:ASE,
author = "Yung-Ming Li and Yong Tan and Yong-Pin Zhou",
title = "Analysis of scale effects in peer-to-peer networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "590--602",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.901081",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study both positive and negative
scale effects on the operations of peer-to-peer (P2P)
file sharing networks and propose the optimal sizing
(number of peers) and grouping (number of directory
intermediary) decisions. Using analytical models and
simulation, we evaluate various performance metrics to
investigate the characteristics of a P2P network. Our
results show that increasing network scale has a
positive effect on the expected content availability
and transmission cost, but a negative effect on the
expected provision and search costs. We propose an
explicit expression for the overall utility of a
content sharing P2P community that incorporates
tradeoffs among all of the performance measures. This
utility function is maximized numerically to obtain the
optimal network size (or scale). We also investigate
the impact of various P2P network parameters on the
performance measures as well as optimal scaling
decisions. Furthermore, we extend the model to examine
the grouping decision in networks with symmetric
interconnection structures and compare the performance
between random- and location-based grouping policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network operations and management; peer-to peer (P2P)
networks; performance evaluation; queueing analysis",
}
@Article{Massoulie:2008:CRS,
author = "Laurent Massouli{\'e} and Milan Vojnovic",
title = "Coupon replication systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "603--616",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.903992",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by the study of peer-to-peer file swarming
systems {\`a} la BitTorrent, we introduce a
probabilistic model of coupon replication systems.
These systems consist of users aiming to complete a
collection of distinct coupons. Users enter the system
with an initial coupon provided by a bootstrap server,
acquire other coupons from other users, and leave once
they complete their coupon collection. For open
systems, with exogenous user arrivals, we derive
stability condition for a layered scenario, where
encounters are between users holding the same number of
coupons. We also consider a system where encounters are
between users chosen uniformly at random from the whole
population. We show that sojourn time in both systems
is asymptotically optimal as the number of coupon types
becomes large. We also consider closed systems with no
exogenous user arrivals. In a special scenario where
users have only one missing coupon, we evaluate the
size of the population ultimately remaining in the
system, as the initial number of users $N$ goes to
infinity. We show that this size decreases
geometrically with the number of coupons $K$. In
particular, when the ratio $ K / \log (N)$ is above a
critical threshold, we prove that this number of
leftovers is of order $ \log (\log (N))$. These results
suggest that, under the assumption that the bootstrap
server is not a bottleneck, the performance does not
depend critically on either altruistic user behavior or
on load-balancing strategies such as rarest first.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "content distribution; file dissemination; file
swarming; peer-to-peer",
}
@Article{Bustamante:2008:DLS,
author = "Fabi{\'a}n E. Bustamante and Yi Qiao",
title = "Designing less-structured {P2P} systems for the
expected high churn",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "617--627",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.903986",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the problem of highly transient populations
in unstructured and loosely structured peer-to-peer
(P2P) systems. We propose a number of illustrative
query-related strategies and organizational protocols
that, by taking into consideration the expected session
times of peers (their lifespans), yield systems with
performance characteristics more resilient to the
natural instability of their environments. We first
demonstrate the benefits of lifespan-based
organizational protocols in terms of end-application
performance and in the context of dynamic and
heterogeneous Internet environments. We do this using a
number of currently adopted and proposed query-related
strategies, including methods for query distribution,
caching, and replication. We then show, through
trace-driven simulation and wide-area experimentation,
the performance advantages of lifespan-based,
query-related strategies when layered over currently
employed and lifespan-based organizational protocols.
While merely illustrative, the evaluated strategies and
protocols clearly demonstrate the advantages of
considering peers' session time in designing
widely-deployed P2P systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "lifespan; peer-to-peer (P2P); resilience; session
time",
}
@Article{Yu:2008:MBA,
author = "Xunqi Yu and James W. Modestino and Ragip Kurceren and
Yee Sin Chan",
title = "A model-based approach to evaluation of the efficacy
of {FEC} coding in combating network packet losses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "628--641",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900416",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a model-based analytic approach for
evaluating the overall efficacy of FEC coding combined
with interleaving in combating packet losses in IP
networks. In particular, by modeling the network path
in terms of a single bottleneck node, described as a
G/M/1/K queue, we develop a recursive procedure for the
exact evaluation of the packet-loss statistics for
general arrival processes, based on the framework
originally introduced by Cidon et al., 1993. To include
the effects of interleaving, we incorporate a
discrete-time Markov chain (DTMC) into our analytic
framework. We study both single-session and
multiple-session scenarios, and provide a simple
algorithm for the more complicated multiple-session
scenario. We show that the unified approach provides an
integrated framework for exploring the tradeoffs
between the key coding parameters; specifically,
interleaving depths, channel coding rates and block
lengths. The approach facilitates the selection of
optimal coding strategies for different multimedia
applications with various user quality-of-service (QoS)
requirements and system constraints. We also provide an
information-theoretic bound on the performance
achievable with FEC coding in IP networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "autocorrelation function; FEC coding; interleaving;
packet-loss processes; residual packet-loss rates;
single-multiplexer model",
}
@Article{Zhang:2008:FAC,
author = "Weiyi Zhang and Guoliang Xue and Jian Tang and
Krishnaiyan Thulasiraman",
title = "Faster algorithms for construction of recovery trees
enhancing {QoP} and {QoS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "642--655",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900705",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "M{\'e}dard et al. proposed an elegant recovery scheme
(known as the MFBG scheme) using red/blue recovery
trees for multicast path protection against single link
or node failures. Xue et al. extended the MFBG scheme
and introduced the concept of quality of protection
(QoP) as a metric for multifailure recovery
capabilities of single failure recovery schemes. They
also presented polynomial time algorithms to construct
recovery trees with good QoP and quality of service
(QoS). In this paper, we present faster algorithms for
constructing recovery trees with good QoP and QoS
performance. For QoP enhancement, our $ O(n + m) $ time
algorithm has comparable performance with the
previously best $ O(n^2 (n + m)) $ time algorithm,
where and denote the number of nodes and the number of
links in the network, respectively. For cost reduction,
our $ O(n + m) $ time algorithms have comparable
performance with the previously best $ O(n^2 (n + m)) $
time algorithms. For bottleneck bandwidth maximization,
our $ O(m \log n) $ time algorithms improve the
previously best $ O(n m) $ time algorithms. Simulation
results show that our algorithms significantly
outperform previously known algorithms in terms of
running time, with comparable QoP or QoS performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bottleneck bandwidth; protection and restoration;
quality of protection (QoP); quality of service (QoS);
redundant trees",
}
@Article{Xue:2008:PTA,
author = "Guoliang Xue and Weiyi Zhang and Jian Tang and
Krishnaiyan Thulasiraman",
title = "Polynomial time approximation algorithms for
multi-constrained {QoS} routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "656--669",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900712",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the multi-constrained quality-of-service
(QoS) routing problem where one seeks to find a path
from a source to a destination in the presence of $ K
\geq 2 $ additive end-to-end QoS constraints. This
problem is NP-hard and is commonly modeled using a
graph with $n$ vertices and $m$ edges with $K$ additive
QoS parameters associated with each edge. For the case
of $ K = 2$, the problem has been well studied, with
several provably good polynomial time-approximation
algorithms reported in the literature, which enforce
one constraint while approximating the other. We first
focus on an optimization version of the problem where
we enforce the first constraint and approximate the
other $ K - 1$ constraints. We present an $ O(m n \log
\log n + m n / \epsilon)$ time $ (1 + \epsilon) (K -
1)$-approximation algorithm and an $ O(m n \log \log n
+ m(n / \epsilon)^{K - 1})$ time $ (1 +
\epsilon)$-approximation algorithm, for any $ \epsilon
> 0$. When $K$ is reduced to 2, both algorithms produce
an $ (1 + \epsilon)$-approximation with a time
complexity better than that of the best-known algorithm
designed for this special case. We then study the
decision version of the problem and present an $ O(m(n
/ \epsilon)^{K - 1})$ time algorithm which either finds
a feasible solution or confirms that there does not
exist a source-destination path whose first weight is
bounded by the first constraint and whose every other
weight is bounded by $ (1 - \epsilon)$ times the
corresponding constraint. If there exists an $H$-hop
source-destination path whose first weight is bounded
by the first constraint and whose every other weight is
bounded by $ (1 - \epsilon)$ times the corresponding
constraint, our algorithm finds a feasible path in $
O(m(H / \epsilon)^{K - 1})$ time. This algorithm
improves previous best-known algorithms with $ O((m + n
\log n) n / \epsilon)$ time for $ K = 2$ and $ O(m n(n
/ \epsilon)^{K - 1})$ time for $ K \geq 2$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "efficient approximation algorithms; multiple additive
constraints; quality-of-service (QoS) routing",
}
@Article{Chu:2008:NAA,
author = "Jian Chu and Chin-Tau Lea",
title = "New architecture and algorithms for fast construction
of hose-model {VPNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "670--679",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900711",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Hose-model virtual private networks (VPNs) provide
customers with more flexibility in specifying bandwidth
requirements than pipe-model VPNs. Many hose-model VPN
provisioning algorithms have been proposed, and they
focus on the bandwidth efficiency in the construction
of a single hose-model VPN. In practice, however, VPNs
come and go and the dynamics will affect the
performance of these VPN provisioning algorithms. If
the frequency of adding and deleting VPNs is high,
these algorithms will have a scalability problem. We
propose in this paper a new network architecture for
dynamic VPN construction. In the proposed architecture,
adding a new VPN is much simpler and faster, and all
that is required is to check if the edge routers have
enough bandwidth. There is no need to check the
bandwidth left on each internal link because the
architecture guarantees that as long as the edge
routers have enough capacities to accept the VPN, the
internal links will never experience overflow caused by
adding the new VPN. We present a linear programming
formulation for finding the optimal routing that
maximizes the amount of admissible VPN traffic in the
network. We then exploit the underlying network flow
structure and convert the linear programming problem
into a subgradient iterative search problem. The
resulting solution is significantly faster than the
linear programming approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hose model; MPLS VPN; network routing",
}
@Article{Wang:2008:IGA,
author = "Chen-Shu Wang and Ching-Ter Chang",
title = "Integrated genetic algorithm and goal programming for
network topology design problem with multiple
objectives and multiple criteria",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "680--690",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.903996",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network topology design (NTD) with multiple objectives
has been presented by many researchers. However, no
work in the literature has addressed this issue with
both multiple objectives and multiple criteria. In
order to suit real-world situations, this paper
presents a new idea integrating genetic algorithm and
goal programming to establish a model for solving the
NTD problem with multiple objectives and multiple
criteria taken into consideration. In addition, the
proposed model can also solve both construct and extend
network topology problems under shared risk link group
(SRLG) constraints. Finally, illustrative examples are
included to demonstrate the superiority and usefulness
of the proposed method.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "genetic algorithm (GA); goal programming; network
topology design (NTD)",
}
@Article{Cohen:2008:CCE,
author = "Reuven Cohen and Gabi Nakibly",
title = "On the computational complexity and effectiveness of
{$N$}-hub shortest-path routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "691--704",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900702",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the computational complexity
and effectiveness of a concept we term 'N-hub
Shortest-Path Routing' in IP networks. N-hub
Shortest-Path Routing allows the ingress node of a
routing domain to determine up to N intermediate nodes
('hubs') through which a packet will pass before
reaching its final destination. This facilitates better
utilization of the network resources, while allowing
the network routers to continue to employ the simple
and well-known shortest-path routing paradigm. Although
this concept has been proposed in the past, this paper
is the first to investigate it in depth. We apply N-hub
Shortest-Path Routing to the problem of minimizing the
maximum load in the network. We show that the resulting
routing problem is NP-complete and hard to approximate.
However, we propose efficient algorithms for solving it
both in the online and the offline contexts. Our
results show that N-hub Shortest-Path Routing can
increase network utilization significantly even for $ N
= 1 $. Hence, this routing paradigm should be
considered as a powerful mechanism for future datagram
routing in the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "load balancing; routing",
}
@Article{Iyer:2008:DPB,
author = "Sundar Iyer and Ramana Rao Kompella and Nick McKeown",
title = "Designing packet buffers for router linecards",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "705--717",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.923720",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet routers and Ethernet switches contain packet
buffers to hold packets during times of congestion.
Packet buffers are at the heart of every packet switch
and router, which have a combined annual market of tens
of billions of dollars, and equipment vendors spend
hundreds of millions of dollars on memory each year.
Designing packet buffers used to be easy: DRAM was
cheap, low power and widely used. But something
happened at 10 Gb/s when packets started to arrive and
depart faster than the access time of a DRAM.
Alternative memories were needed, but SRAM is too
expensive and power-hungry. A caching solution is
appealing, with a hierarchy of SRAM and DRAM, as used
by the computer industry. However, in switches and
routers it is not acceptable to have a 'miss-rate' as
it reduces throughput and breaks pipelines. In this
paper we describe how to build caches with 100\%
hit-rate under all conditions, by exploiting the fact
that switches and routers always store data in FIFO
queues. We describe a number of different ways to do
it, with and without pipelining, with static or dynamic
allocation of memory. In each case, we prove a lower
bound on how big the cache needs to be, and propose an
algorithm that meets, or comes close, to the lower
bound. These techniques are practical and have been
implemented in fast silicon; as a result, we expect the
techniques to fundamentally change the way switches and
routers use external memory.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cache; hit-rate; line-card; memory hierarchy; packet
buffer; router; switches",
}
@Article{He:2008:GSS,
author = "Si-Min He and Shu-Tao Sun and Hong-Tao Guan and Qiang
Zheng and You-Jian Zhao and Wen Gao",
title = "On guaranteed smooth switching for buffered crossbar
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "718--731",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Scalability considerations drive the evolution of
switch design from output queueing to input queueing
and further to combined input and crosspoint queueing
(CICQ). However, CICQ switches with credit-based flow
control face new challenges of scalability and
predictability. In this paper, we propose a novel
approach of rate-based smoothed switching, and design a
CICQ switch called the smoothed buffered crossbar or
sBUX. First, the concept of smoothness is developed
from two complementary perspectives of covering and
spacing, which, commonly known as fairness and jitter,
are unified in the same model. Second, a smoothed
multiplexer sMUX is designed that allocates bandwidth
among competing flows sharing a link and guarantees
almost ideal smoothness for each flow. Third, the
buffered crossbar sBUX is designed that uses the
scheduler sMUX at each input and output, and a two-cell
buffer at each crosspoint. It is proved that sBUX
guarantees 100\% throughput for real-time services and
almost ideal smoothness for each flow. Fourth, an
on-line bandwidth regulator is designed that
periodically estimates bandwidth demand and generates
admissible allocations, which enables sBUX to support
best-effort services. Simulation shows almost 100\%
throughput and multi-microsecond average delay. In
particular, neither credit-based flow control nor
speedup is used, and arbitrary fabric-internal latency
is allowed between line cards and the switch core,
simplifying the switch implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "buffered crossbar; scheduling; smoothness; switches",
}
@Article{Jiang:2008:SNC,
author = "Xiaohong Jiang and Achille Pattavina and Susumu
Horiguchi",
title = "Strictly nonblocking $f$-cast photonic networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "732--745",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The multicast capability and crosstalk issue need to
be deliberately considered in the design of future high
performance photonic switching networks. In this paper,
we focus on the photonic switching networks built on
the banyan-based architecture and directional coupler
technology. We explore the capability of these networks
to support general $f$-cast traffic, which covers the
unicast traffic ($ f = 1$) and multicast traffic ($ f =
N$) as special cases, and determine the conditions for
these networks to be $f$-cast strictly nonblocking
under various crosstalk constraints. In particular, we
propose an optimization framework to determine the
nonblocking condition of an $f$-cast photonic network
when a general crosstalk constraint is imposed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "banyan networks; crosstalk; f-cast; multicast;
photonic switches; strictly nonblocking",
}
@Article{Markopoulou:2008:CFO,
author = "Athina Markopoulou and Gianluca Iannaccone and
Supratik Bhattacharyya and Chen-Nee Chuah and Yashar
Ganjali and Christophe Diot",
title = "Characterization of failures in an operational {IP}
backbone network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "749--762",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.892851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the Internet evolves into a ubiquitous
communication infrastructure and supports increasingly
important services, its dependability in the presence
of various failures becomes critical. In this paper, we
analyze IS-IS routing updates from the Sprint IP
backbone network to characterize failures that affect
IP connectivity. Failures are first classified based on
patterns observed at the IP-layer; in some cases, it is
possible to further infer their probable causes, such
as maintenance activities, router-related and optical
layer problems. Key temporal and spatial
characteristics of each class are analyzed and, when
appropriate, parameterized using well-known
distributions. Our results indicate that 20\% of all
failures happen during a period of scheduled
maintenance activities. Of the unplanned failures,
almost 30\% are shared by multiple links and are most
likely due to router-related and optical
equipment-related problems, respectively, while 70\%
affect a single link at a time. Our classification of
failures reveals the nature and extent of failures in
the Sprint IP backbone. Furthermore, our
characterization of the different classes provides a
probabilistic failure model, which can be used to
generate realistic failure scenarios, as input to
various network design and traffic engineering
problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "failure analysis; intermediate system to intermediate
system (IS-IS) protocol; link failures; modeling;
routing",
}
@Article{Kim:2008:WBA,
author = "Min Sik Kim and Taekhyun Kim and Yong-June Shin and
Simon S. Lam and Edward J. Powers",
title = "A wavelet-based approach to detect shared congestion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "763--776",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2002.1012369",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Per-flow congestion control helps endpoints fairly and
efficiently share network resources. Better utilization
of network resources can be achieved, however, if
congestion management algorithms can determine when two
different flows share a congested link. Such knowledge
can be used to implement cooperative congestion control
or improve the overlay topology of a P2P system.
Previous techniques to detect shared congestion either
assume a common source or destination node, drop-tail
queueing, or a single point of congestion. We propose
in this paper a novel technique, applicable to any pair
of paths on the Internet, without such limitations. Our
technique employs a signal processing method, wavelet
denoising, to separate queueing delay caused by network
congestion from various other delay variations. Our
wavelet-based technique is evaluated through both
simulations and Internet experiments. We show that,
when detecting shared congestion of paths with a common
endpoint, our technique provides faster convergence and
higher accuracy while using fewer packets than previous
techniques, and that it also accurately determines when
there is no shared congestion. Furthermore, we show
that our technique is robust and accurate for paths
without a common endpoint or synchronized clocks; more
specifically, it can tolerate a synchronization offset
of up to one second between two packet flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2008:LSN,
author = "Tao Ye and Hema T. Kaur and Shivkumar Kalyanaraman and
Murat Yuksel",
title = "Large-scale network parameter configuration using an
on-line simulation framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "777--790",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.282603",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the Internet infrastructure grows to support a
variety of services, its legacy protocols are being
overloaded with new functions such as traffic
engineering. Today, operators engineer such
capabilities through clever, but manual parameter
tuning. In this paper, we propose a back-end support
tool for large-scale parameter configuration that is
based on efficient parameter state space search
techniques and on-line simulation. The framework is
useful when the network protocol performance is
sensitive to its parameter settings, and its
performance can be reasonably modeled in simulation. In
particular, our system imports the network topology,
relevant protocol models and latest monitored traffic
patterns into a simulation that runs on-line in a
network operations center (NOC). Each simulation
evaluates the network performance for a particular
setting of protocol parameters. We propose an efficient
large-dimensional parameter state space search
technique called 'recursive random search (RRS).' Each
sample point chosen by RRS results in a single
simulation. An important feature of this framework is
its flexibility: it allows arbitrary choices in terms
of the simulation engines used (e.g., ns-2, SSFnet),
network protocols to be simulated (e.g., OSPF, BGP),
and in the specification of the optimization
objectives. We demonstrate the flexibility and
relevance of this framework in three scenarios: joint
tuning of the RED buffer management parameters at
multiple bottlenecks, traffic engineering using OSPF
link weight tuning, and outbound load-balancing of
traffic at peering/transit points using BGP LOCAL\_PREF
parameter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "black-box optimization; network performance
management; network protocol configuration; on-line
simulation",
}
@Article{Aad:2008:IDS,
author = "Imad Aad and Jean-Pierre Hubaux and Edward W.
Knightly",
title = "Impact of denial of service attacks on ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "791--802",
month = aug,
year = "2008",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Significant progress has been made towards making ad
hoc networks secure and DoS resilient. However, little
attention has been focused on quantifying DoS
resilience: Do ad hoc networks have sufficiently
redundant paths and counter-DoS mechanisms to make DoS
attacks largely ineffective? Or are there attack and
system factors that can lead to devastating effects? In
this paper, we design and study DoS attacks in order to
assess the damage that difficult-to-detect attackers
can cause. The first attack we study, called the
JellyFish attack, is targeted against closed-loop flows
such as TCP; although protocol compliant, it has
devastating effects. The second is the Black Hole
attack, which has effects similar to the JellyFish, but
on open-loop flows. We quantify via simulations and
analytical modeling the scalability of DoS attacks as a
function of key performance parameters such as
mobility, system size, node density, and counter-DoS
strategy. One perhaps surprising result is that such
DoS attacks can increase the capacity of ad hoc
networks, as they starve multi-hop flows and only allow
one-hop communication, a capacity-maximizing, yet
clearly undesirable situation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; black hole attacks; DoS attacks",
}
@Article{Micciancio:2008:OCC,
author = "Daniele Micciancio and Saurabh Panjwani",
title = "Optimal communication complexity of generic multicast
key distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "803--813",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1137/0213053",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We prove a tight lower bound on the communication
complexity of secure multicast key distribution
protocols in which rekey messages are built using
symmetric-key encryption, pseudo-random generators, and
secret sharing schemes. Our lower bound shows that the
amortized cost of updating the group key for each group
membership change (as a function of the current group
size) is at least $ \log_2 (n) - o(1) $ basic rekey
messages. This lower bound matches, up to a subconstant
additive term, the upper bound due to Canetti et al.
[Proc. INFOCOM 1999], who showed that $ \log_2 (n) $
basic rekey messages (each time a user joins and/or
leaves the group) are sufficient. Our lower bound is,
thus, optimal up to a small subconstant additive term.
The result of this paper considerably strengthens
previous lower bounds by Canetti et al. [Proc.
Eurocrypt 1999] and Snoeyink et al. [Computer Networks,
47(3):2005], which allowed for neither the use of
pseudorandom generators and secret sharing schemes nor
the iterated (nested) application of the encryption
function. Our model (which allows for arbitrarily
nested combinations of encryption, pseudorandom
generators and secret sharing schemes) is much more
general and, in particular, encompasses essentially all
known multicast key distribution protocols of practical
interest.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "key distribution; lower bounds; multicast; nested
encryption; secret sharing; security",
}
@Article{Krishnamurthy:2008:ASS,
author = "Supriya Krishnamurthy and Sameh El-Ansary and Erik
Aurell and Seif Haridi",
title = "An analytical study of a structured overlay in the
presence of dynamic membership",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "814--825",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TKDE.2004.1318567",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present an analytical study of
dynamic membership (aka churn) in structured
peer-to-peer networks. We use a fluid model approach to
describe steady-state or transient phenomena and apply
it to the Chord system. For any rate of churn and
stabilization rates and any system size, we accurately
account for the functional form of the probability of
network disconnection as well as the fraction of failed
or incorrect successor and finger pointers. We show how
we can use these quantities to predict both the
performance and consistency of lookups under churn. All
theoretical predictions match simulation results. The
analysis includes both features that are generic to
structured overlays deploying a ring as well as
Chord-specific details and opens the door to a
systematic comparative analysis of, at least,
ring-based structured overlay systems under churn.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "peer-to-peer networks; performance analysis;
stochastic systems",
}
@Article{Bui:2008:ACC,
author = "Loc Bui and Atilla Eryilmaz and R. Srikant and Xinzhou
Wu",
title = "Asynchronous congestion control in multi-hop wireless
networks with maximal matching-based scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "826--839",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2004.842226",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a multi-hop wireless network shared by
many users. For an interference model that constrains a
node to either transmit to or receive from only one
other node at a time, and not to do both, we propose an
architecture for fair resource allocation that consists
of a distributed scheduling algorithm operating in
conjunction with an asynchronous congestion control
algorithm. We show that the proposed joint congestion
control and scheduling algorithm supports at least
one-third of the throughput supportable by any other
algorithm, including centralized algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; distributed scheduling; fair
resource allocation; totally asynchronous algorithm;
wireless networks",
}
@Article{Gandhi:2008:MBL,
author = "Rajiv Gandhi and Arunesh Mishra and Srinivasan
Parthasarathy",
title = "Minimizing broadcast latency and redundancy in ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "840--851",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1023/A:1019045801829",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network wide broadcasting is a fundamental operation
in ad hoc networks. In broadcasting, a source node
sends a message to all the other nodes in the network.
In this paper, we consider the problem of
collision-free broadcasting in ad hoc networks. Our
objective is to minimize the latency and the number of
transmissions in the broadcast. We show that minimum
latency broadcasting is NP-complete for ad hoc
networks. We also present a simple distributed
collision-free broadcasting algorithm for broadcasting
a message. For networks with bounded node transmission
ranges, our algorithm simultaneously guarantees that
the latency and the number of transmissions are within
$ O(1) $ times their respective optimal values. Our
algorithm and analysis extend to the case when multiple
messages are broadcast from multiple sources.
Experimental studies indicate that our algorithms
perform much better in practice than the analytical
guarantees provided for the worst case.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networking; approximation algorithms; broadcast
algorithms; wireless scheduling",
}
@Article{Lenders:2008:DBA,
author = "Vincent Lenders and Martin May and Bernhard Plattner",
title = "Density-based anycast: a robust routing strategy for
wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "852--863",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TMC.2003.1233531",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Existing anycast routing protocols solely route
packets to the closest group member. In this paper, we
introduce density-based anycast routing, a new anycast
routing paradigm particularly suitable for wireless ad
hoc networks. Instead of routing packets merely on
proximity information to the closest member,
density-based anycast routing considers the number of
available anycast group members for its routing
decision. We present a unified model based on potential
fields that allows for instantiation of pure
proximity-based, pure density-based, as well as hybrid
routing strategies. We implement anycast using this
model and simulate the performance of the different
approaches for mobile as well as static ad hoc networks
with frequent link failures. Our results show that the
best performance lies in a tradeoff between proximity
and density. In this combined routing strategy, the
packet delivery ratio is considerably higher and the
path length remains almost as low than with traditional
shortest-path anycast routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anycast; mobile communication; protocols; routing;
wireless communication",
}
@Article{Garetto:2008:MPF,
author = "Michele Garetto and Theodoros Salonidis and Edward W.
Knightly",
title = "Modeling per-flow throughput and capturing starvation
in {CSMA} multi-hop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "864--877",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.893874",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multi-hop wireless networks employing random access
protocols have been shown to incur large discrepancies
in the throughputs achieved by the flows sharing the
network. Indeed, flow throughputs can span orders of
magnitude from near starvation to many times greater
than the mean. In this paper, we address the
foundations of this disparity. We show that the
fundamental cause is not merely differences in the
number of contending neighbors, but a generic
coordination problem of CSMA-based random access in a
multi-hop environment. We develop a new analytical
model that incorporates this lack of coordination,
identifies dominating and starving flows and accurately
predicts per-flow throughput in a large-scale network.
We then propose metrics that quantify throughput
imbalances due to the MAC protocol operation. Our model
and metrics provide a deeper understanding of the
behavior of CSMA protocols in arbitrary topologies and
can aid the design of effective protocol solutions to
the starvation problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CSMA; CSMA/CA; fairness; wireless networks",
}
@Article{Tickoo:2008:MQC,
author = "Omesh Tickoo and Biplab Sikdar",
title = "Modeling queueing and channel access delay in
unsaturated {IEEE 802.11} random access {MAC} based
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "878--891",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1023/A:1019109301754",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present an analytic model for
evaluating the queueing delays and channel access times
at nodes in wireless networks using the IEEE 802.11
Distributed Coordination Function (DCF) as the MAC
protocol. The model can account for arbitrary arrival
patterns, packet size distributions and number of
nodes. Our model gives closed form expressions for
obtaining the delay and queue length characteristics
and models each node as a discrete time G/G/1fs queue.
The service time distribution for the queues is derived
by accounting for a number of factors including the
channel access delay due to the shared medium, impact
of packet collisions, the resulting backoffs as well as
the packet size distribution. The model is also
extended for ongoing proposals under consideration for
802.11e wherein a number of packets may be transmitted
in a burst once the channel is accessed. Our analytical
results are verified through extensive simulations. The
results of our model can also be used for providing
probabilistic quality of service guarantees and
determining the number of nodes that can be
accommodated while satisfying a given delay
constraint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay modeling; IEEE 802.11; queueing analysis",
}
@Article{Hua:2008:ORD,
author = "Cunqing Hua and Tak-Shing Peter Yum",
title = "Optimal routing and data aggregation for maximizing
lifetime of wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "892--903",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/QSHINE.2005.4",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An optimal routing and data aggregation scheme for
wireless sensor networks is proposed in this paper. The
objective is to maximize the network lifetime by
jointly optimizing data aggregation and routing. We
adopt a model to integrate data aggregation with the
underlying routing scheme and present a smoothing
approximation function for the optimization problem.
The necessary and sufficient conditions for achieving
the optimality are derived and a distributed gradient
algorithm is designed accordingly. We show that the
proposed scheme can significantly reduce the data
traffic and improve the network lifetime. The
distributed algorithm can converge to the optimal value
efficiently under all network configurations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data aggregation; maximum lifetime routing; network
lifetime; smoothing methods; wireless sensor networks",
}
@Article{Tang:2008:OLC,
author = "Xueyan Tang and Jianliang Xu",
title = "Optimizing lifetime for continuous data aggregation
with precision guarantees in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "904--917",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2002.808417",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper exploits the tradeoff between data quality
and energy consumption to extend the lifetime of
wireless sensor networks. To obtain an aggregate form
of sensor data with precision guarantees, the precision
constraint is partitioned and allocated to individual
sensor nodes in a coordinated fashion. Our key idea is
to differentiate the precisions of data collected from
different sensor nodes to balance their energy
consumption. Three factors affecting the lifetime of
sensor nodes are identified: (1) the changing pattern
of sensor readings; (2) the residual energy of sensor
nodes; and (3) the communication cost between the
sensor nodes and the base station. We analyze the
optimal precision allocation in terms of network
lifetime and propose an adaptive scheme that
dynamically adjusts the precision constraints at the
sensor nodes. The adaptive scheme also takes into
consideration the topological relations among sensor
nodes and the effect of in-network aggregation.
Experimental results using real data traces show that
the proposed scheme significantly improves network
lifetime compared to existing methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data accuracy; data aggregation; energy efficiency;
network lifetime; sensor network",
}
@Article{Langar:2008:CAM,
author = "Rami Langar and Nizar Bouabdallah and Raouf Boutaba",
title = "A comprehensive analysis of mobility management in
{MPLS}-based wireless access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "918--931",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2002.1012370",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient mobility management is one of the major
challenges for next-generation mobile systems. Indeed,
a mobile node (MN) within an access network may cause
excessive signaling traffic and service disruption due
to frequent handoffs. The two latter effects need to be
minimized to support quality-of-service (QoS)
requirements of emerging multimedia applications. In
this perspective, we propose in this paper a new
mobility management scheme designed to track host
mobility efficiently so as to minimize both handoff
latency and signaling cost. Building on and enhancing
Mobile IP and taking advantage of MPLS traffic
engineering capability, three mechanisms (FH-, FC- and
MFC-Micro Mobile MPLS) are introduced. In order to
assess the efficiency of our proposals, all protocols
are compared. To achieve this, we develop analytical
models to evaluate the signaling cost and link usage
for both two-dimensional and one-dimensional mobility
models. Additional mathematical models are also
provided to derive handoff latency and packet loss
rate. Numerical and simulation results show that the
proposed mechanisms can significantly reduce the
registration updates cost and provide low handoff
latency and packet loss rate under various scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fast handoff; forwarding chain; micro-mobility; mobile
IP; mobility models; multiprotocol label switching
(MPLS); performance analysis; residing area",
}
@Article{Xing:2008:SLS,
author = "Yiping Xing and R. Chandramouli",
title = "Stochastic learning solution for distributed discrete
power control game in wireless data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "932--944",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1023/A:1019108223561",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed power control is an important issue in
wireless networks. Recently, noncooperative game theory
has been applied to investigate interesting solutions
to this problem. The majority of these studies assumes
that the transmitter power level can take values in a
continuous domain. However, recent trends such as the
GSM standard and Qualcomm's proposal to the IS-95
standard use a finite number of discretized power
levels. This motivates the need to investigate
solutions for distributed discrete power control which
is the primary objective of this paper. We first note
that, by simply discretizing, the previously proposed
continuous power adaptation techniques will not
suffice. This is because a simple discretization does
not guarantee convergence and uniqueness. We propose
two probabilistic power adaptation algorithms and
analyze their theoretical properties along with the
numerical behavior. The distributed discrete power
control problem is formulated as an $N$-person, nonzero
sum game. In this game, each user evaluates a power
strategy by computing a utility value. This evaluation
is performed using a stochastic iterative procedures.
We approximate the discrete power control iterations by
an equivalent ordinary differential equation to prove
that the proposed stochastic learning power control
algorithm converges to a stable Nash equilibrium.
Conditions when more than one stable Nash equilibrium
or even only mixed equilibrium may exist are also
studied. Experimental results are presented for several
cases and compared with the continuous power level
adaptation solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "game theory; power control; stochastic learning;
wireless networking",
}
@Article{Eun:2008:ATT,
author = "Do Young Eun and Xinbing Wang",
title = "Achieving 100\% throughput in {TCP\slash AQM} under
aggressive packet marking with small buffer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "945--956",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1016/S1389-1286(03)00304-9",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a TCP/AQM system with large link capacity
({\em NC\/}) shared by many flows. The traditional
rule-of-thumb suggests that the buffer size be chosen
in proportion to the number of flows ($N$) for full
link utilization, while recent research outcomes show
that $ O(\sqrt N)$ buffer sizing is sufficient for high
utilization and $ O (1)$ buffer sizing makes the system
stable at the cost of reduced link utilization. In this
paper, we consider a system where the Active Queue
Management (AQM) is scaled as $ O(N^{\alpha })$ with a
buffer of size $ O(N^\beta)$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "router buffer sizing; small buffer; stochastic
modeling; transmission control protocol",
}
@Article{Spitler:2008:IEE,
author = "Stephen L. Spitler and Daniel C. Lee",
title = "Integration of explicit effective-bandwidth-based
{QoS} routing with best-effort routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "957--969",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.251894",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a methodology for protecting
low-priority best-effort (BE) traffic in a network
domain that provides both virtual-circuit routing with
bandwidth reservation for QoS traffic and datagram
routing for BE traffic. When a QoS virtual circuit is
established, bandwidths amounting to the traffic's
effective bandwidths are reserved along the links. We
formulate a new QoS-virtual-circuit admission control
and routing policy that sustains a minimum level of BE
performance. In response to a QoS connection request,
the policy executes a two-stage optimization. The first
stage seeks a minimum-net-effective-bandwidth
reservation path that satisfies a BE protecting
constraint; the second stage is a tie-breaking rule,
selecting from tied paths one that least disturbs BE
traffic. Our novel policy implementation efficiently
executes both optimization stages simultaneously by a
single run of Dijkstra's algorithm. According to
simulation results, within a practical operating range,
the consideration that our proposed policy gives to the
BE service does not increase the blocking probability
of a QoS connection request.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "best-effort (BE) traffic; constraint-based routing;
dynamic routing; effective bandwidth; quality of
service (QoS)",
}
@Article{Brzezinski:2008:ATR,
author = "Andrew Brzezinski and Eytan Modiano",
title = "Achieving 100\% throughput in reconfigurable optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "970--983",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.811449",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the maximum throughput properties of
dynamically reconfigurable optical network
architectures having wavelength and port constraints.
Using stability as the throughput performance metric,
we outline the single-hop and multi-hop stability
regions of the network. Our analysis of the stability
regions is a generalization of the BvN decomposition
technique that has been so effective at expressing any
stabilizable rate matrix for input-queued switches as a
convex combination of service configurations. We
consider generalized decompositions for physical
topologies with wavelength and port constraints. For
the case of a single wavelength per optical fiber, we
link the decomposition problem to a corresponding
Routing and Wavelength Assignment (RWA) problem. We
characterize the stability region of the reconfigurable
network, employing both single-hop and multi-hop
routing, in terms of the RWA problem applied to the
same physical topology. We derive expressions for two
geometric properties of the stability region: maximum
stabilizable uniform arrival rate and maximum scaled
doubly substochastic region. These geometric properties
provide a measure of the performance gap between a
network having a single wavelength per optical fiber
and its wavelength-unconstrained version. They also
provide a measure of the performance gap between
algorithms employing single-hop versus multi-hop
electronic routing in coordination with WDM
reconfiguration.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Birkhoff-von Neumann (BvN); input-queueing;
IP-over-WDM; matrix decomposition; performance
evaluation; queueing network; wavelength division
multiplexing (WDM); WDM reconfiguration",
}
@Article{Benson:2008:CAO,
author = "Karyn Benson and Benjamin Birnbaum and Esteban
Molina-Estolano and Ran Libeskind-Hadas",
title = "Competitive analysis of online traffic grooming in
{WDM} rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "984--997",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/BROADNETS.2004.37",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the problem of traffic grooming
in wavelength-division multiplexing (WDM) rings where
connection requests arrive online. Each request
specifies a pair of nodes that wish to communicate and
also the desired bandwidth of this connection. If the
request is to be satisfied, it must be allocated to one
or more wavelengths with sufficient remaining capacity.
We consider three distinct profit models specifying the
profit associated with satisfying a connection request.
We give results on offline and online algorithms for
each of the three profit models. We use the paradigm of
competitive analysis to theoretically analyze the
quality of our online algorithms. Finally, experimental
results are given to provide insight into the
performance of these algorithms in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "competitive analysis; online algorithms; optical
networks; wavelength-division multiplexing (WDM)
rings",
}
@Article{Jin:2008:FDC,
author = "Nan Jin and Scott Jordan",
title = "On the feasibility of dynamic congestion-based pricing
in differentiated services networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1001--1014",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.908163",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Differentiated services can ensure that traffic on
some codepoints receives higher quality of service
(QoS) than traffic on other codepoints, but without
additional mechanisms it cannot target any particular
QoS. Congestion-based pricing has been suggested as a
method to target QoS in other network architectures.
Here, we investigate whether congestion-based pricing
can be used to control aggregate traffic into each
codepoint by motivating users to choose the codepoints
appropriate for each application. We first ask what
information needs to be exchanged; we assert that both
price and QoS information must be available for users
to make decisions. We then ask how effective
congestion-based pricing in diffServ can be; we find
that it is feasible only for networks with sufficiently
high bandwidth to guarantee that QoS can be quickly
measured.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "differentiated services; pricing; quality of service
(QoS)",
}
@Article{Allalouf:2008:CDA,
author = "Miriam Allalouf and Yuval Shavitt",
title = "Centralized and distributed algorithms for routing and
weighted max-min fair bandwidth allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1015--1024",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.905605",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Given a set of demands between pairs of nodes, we
examine the traffic engineering problem of flow routing
and fair bandwidth allocation where flows can be split
to multiple paths (e.g., MPLS tunnels). This paper
presents an algorithm for finding an optimal and global
per-commodity max-min fair rate vector in a polynomial
number of steps. In addition, we present a fast and
novel distributed algorithm where each source router
can find the routing and the fair rate allocation for
its commodities while keeping the locally optimal
max-min fair allocation criteria. The distributed
algorithm is a fully polynomial epsilon-approximation
(FPTAS) algorithm and is based on a primal-dual
alternation technique. We implemented these algorithms
to demonstrate its correctness, efficiency, and
accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth allocation; distributed algorithm; maximum
concurrent multi-commodity flow problem; maxmin
fairness criteria",
}
@Article{Menache:2008:CME,
author = "Ishai Menache and Nahum Shimkin",
title = "Capacity management and equilibrium for proportional
{QoS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1025--1037",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Differentiated services architectures are scalable
solutions for providing class-based Quality of Service
(QoS) over packet switched networks. While qualitative
attributes of the offered service classes are often
well defined, the actual differentiation between
classes is left as an open issue. We address here the
proportional QoS model, which aims at maintaining
pre-defined ratios between the service class delays (or
related congestion measures). In particular, we
consider capacity assignment among service classes as
the means for attaining this design
objective.\par
Starting with a detailed analysis for the single hop
model, we first obtain the required capacity assignment
for fixed flow rates. We then analyze the scheme under
a reactive scenario, in which self-optimizing users may
choose their service class in response to capacity
modifications. We demonstrate the existence and
uniqueness of the equilibrium in which the required
ratios are maintained, and address the efficient
computation of the optimal capacities. We further
provide dynamic schemes for capacity adjustment, and
consider the incorporation of pricing and congestion
control to enforce absolute performance bounds on top
of the proportional ones. Finally, we extend our basic
results to networks with general topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity allocation; differentiated services; Nash
equilibrium; proportional QoS; selfish routing",
}
@Article{Guven:2008:UFM,
author = "Tuna G{\"u}ven and Richard J. La and Mark A. Shayman
and Bobby Bhattacharjee",
title = "A unified framework for multipath routing for unicast
and multicast traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1038--1051",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909686",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of load balancing the traffic
from a set of unicast and multicast sessions. The
problem is formulated as an optimization problem.
However, we assume that the gradient of the network
cost function is not available and needs to be
estimated. Multiple paths are provided between a source
and a destination using application-layer overlay. We
propose a novel algorithm that is based on what is
known as simultaneous perturbation stochastic
approximation and utilizes only noisy measurements
collected and reported to the sources, using an overlay
architecture. We consider three network models that
reflect different sets of assumptions regarding
multicast capabilities of the network. Using an
analytical model we first prove the almost sure
convergence of the algorithm to a corresponding optimal
solution under each network model considered in this
paper with decreasing step sizes. Then, we establish
the weak convergence (or convergence in distribution)
with a fixed step size. In addition, we investigate the
benefits acquired from implementing additional
multicast capabilities by studying the relative
performance of our algorithm under the three network
models.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mathematical programming/optimization; multipath
routing; network measurements",
}
@Article{Tao:2008:RTM,
author = "Shu Tao and John Apostolopoulos and Roch Gu{\'e}rin",
title = "Real-time monitoring of video quality in {IP}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1052--1065",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.910617",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the problem of assessing the
quality of video transmitted over IP networks. Our goal
is to develop a methodology that is both reasonably
accurate and simple enough to support the large-scale
deployments that the increasing use of video over IP
are likely to demand. For that purpose, we focus on
developing an approach that is capable of mapping
network statistics, e.g., packet losses, available from
simple measurements, to the quality of video sequences
reconstructed by receivers. A first step in that
direction is a loss-distortion model that accounts for
the impact of network losses on video quality, as a
function of application-specific parameters such as
video codec, loss recovery technique, coded bit rate,
packetization, video characteristics, etc. The model,
although accurate, is poorly suited to large-scale,
on-line monitoring, because of its dependency on
parameters that are difficult to estimate in real-time.
As a result, we introduce a 'relative quality' metric
(rPSNR) that bypasses this problem by measuring video
quality against a quality benchmark that the network is
expected to provide. The approach offers a lightweight
video quality monitoring solution that is suitable for
large-scale deployments. We assess its feasibility and
accuracy through extensive simulations and
experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IP networks; PSNR; relative video quality; video
quality",
}
@Article{Vojnovic:2008:RWA,
author = "Milan Vojnovic and Ayalvadi J. Ganesh",
title = "On the race of worms, alerts, and patches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1066--1079",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909678",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We provide an analytical framework for evaluating the
performance of automatic patching systems. We use it to
quantify the speed of patch or alert dissemination
required for worm containment. Motivated by scalability
and trust issues, we consider a hierarchical system
where network hosts are organized into subnets, each
containing a patch server (termed superhost). Patches
are disseminated to superhosts through an overlay
connecting them and, after verification, to end hosts
within subnets. The analytical framework accommodates a
variety of overlays through the novel abstraction of a
minimum broadcast curve. It also accommodates filtering
of scans across subnets. The framework provides
quantitative estimates that can guide system designers
in dimensioning automatic patching systems. The results
are obtained mathematically and verified by
simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "automatic updates; epidemic; minimum broadcast curve;
patching; software updates; virus; worm",
}
@Article{Ramaiyan:2008:FPA,
author = "Venkatesh Ramaiyan and Anurag Kumar and Eitan Altman",
title = "Fixed point analysis of single cell {IEEE 802.11e}
{WLANs}: uniqueness and multistability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1080--1093",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911429",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the vector fixed point equations arising
out of the analysis of the saturation throughput of a
single cell IEEE 802.11e (EDCA) wireless local area
network with nodes that have different backoff
parameters, including different Arbitration InterFrame
Space (AIFS) values. We consider balanced and
unbalanced solutions of the fixed point equations
arising in homogeneous (i.e., one with the same backoff
parameters) and nonhomogeneous networks. By a balanced
fixed point, we mean one where all coordinates are
equal. We are concerned, in particular, with (1)
whether the fixed point is balanced within a class, and
(2) whether the fixed point is unique. Our simulations
show that when multiple unbalanced fixed points exist
in a homogeneous system then the time behavior of the
system demonstrates severe short term unfairness (or
multistability). We provide a condition for the fixed
point solution to be balanced, and also a condition for
uniqueness. We then extend our general fixed point
analysis to capture AIFS based differentiation and the
concept of virtual collision when there are multiple
queues per station; again a condition for uniqueness is
established. For the case of multiple queues per node,
we find that a model with as many nodes as there are
queues, with one queue per node, provides an excellent
approximation. Implications for the use of the fixed
point formulation for performance analysis are also
discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "performance of wireless LANs; saturation throughput
analysis of EDCA; short term unfairness",
}
@Article{Inaltekin:2008:ANE,
author = "Hazer Inaltekin and Stephen B. Wicker",
title = "The analysis of {Nash} equilibria of the one-shot
random-access game for wireless networks and the
behavior of selfish nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1094--1107",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909668",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the fundamental question of whether or not
there exist stable operating points in a network in
which selfish nodes share a common channel, and if they
exist, how the nodes behave at these stable operating
points. We begin with a wireless communication network
in which $n$ nodes (agents), which might have different
utility functions, contend for access on a common,
wireless communication channel. We characterize this
distributed multiple-access problem in terms of a
one-shot random-access game, and then analyze the
behavior of the nodes using the tools of game theory.
We give necessary and sufficient conditions on nodes
for the complete characterization of the Nash
equilibria of this game for all $ n \geq 2$. We show
that all centrally controlled optimal solutions are a
subset of this game theoretic solution, and almost all
(w.r.t. Lebesgue measure) transmission probability
assignments chosen by a central authority are supported
by the game theoretic solution. We analyze the behavior
of the network throughput at Nash equilibria as a
function of the costs of the transmitters incurred by
failed transmissions. Finally, we conclude the paper
with the asymptotic analysis of the system as the
number of transmitters goes to infinity. We show that
the asymptotic distribution of the packet arrivals
converges in distribution to a Poisson random variable,
and the channel throughput converges to $ - (c / (1 +
c))$ in $ (c / (1 + c))$ with $ c > 0$ being the cost
of failed transmissions. We also give the best possible
bounds on the rates of convergence of the packet
arrival distribution and the channel throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "channel throughput; game theory; Nash equilibrium;
random access control; slotted ALOHA",
}
@Article{Wang:2008:ELW,
author = "Wei Wang and Vikram Srinivasan and Kee-Chaing Chua",
title = "Extending the lifetime of wireless sensor networks
through mobile relays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1108--1120",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.906663",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the benefits of a heterogeneous
architecture for wireless sensor networks (WSNs)
composed of a few resource rich mobile relay nodes and
a large number of simple static nodes. The mobile
relays have more energy than the static sensors. They
can dynamically move around the network and help
relieve sensors that are heavily burdened by high
network traffic, thus extending the latter's lifetime.
We first study the performance of a large dense network
with one mobile relay and show that network lifetime
improves over that of a purely static network by up to
a factor of four. Also, the mobile relay needs to stay
only within a two-hop radius of the sink. We then
construct a joint mobility and routing algorithm which
can yield a network lifetime close to the upper bound.
The advantage of this algorithm is that it only
requires a limited number of nodes in the network to be
aware of the location of the mobile relay. Our
simulation results show that one mobile relay can at
least double the network lifetime in a randomly
deployed WSN. By comparing the mobile relay approach
with various static energy-provisioning methods, we
demonstrate the importance of node mobility for
resource provisioning in a WSN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile relay; network lifetime; sensor networks",
}
@Article{Sharma:2008:CHS,
author = "Gaurav Sharma and Ravi R. Mazumdar",
title = "A case for hybrid sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1121--1132",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.910666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the use of limited
infrastructure, in the form of wires, for improving the
energy efficiency of a wireless sensor network. We call
such a sensor network--a wireless sensor network with a
limited infrastructural support--a hybrid sensor
network. The wires act as short cuts to bring down the
average hop count of the network, resulting in a
reduced energy dissipation per node. Our results
indicate that adding a few wires to a wireless sensor
network can not only reduce the average energy
expenditure per sensor node, but also the nonuniformity
in the energy expenditure across the sensor nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "energy dissipation; graph theory; lifetime; routing;
sensor networks; small world networks; system design;
trade-offs",
}
@Article{Subramanian:2008:BSN,
author = "Sundar Subramanian and Sanjay Shakkottai and Ari
Arapostathis",
title = "Broadcasting in sensor networks: the role of local
information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1133--1146",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.912034",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Flooding based querying and broadcasting schemes have
low hop-delays of $ \Theta (1 / R(n)) $ to reach any
node that is a unit distance away, where $ R(n) $ is
the transmission range of any sensor node. However, in
sensor networks with large radio ranges, flooding based
broadcasting schemes cause many redundant transmissions
leading to a broadcast storm problem. In this paper, we
study the role of geographic information and state
information (i.e., memory of previous messages or
transmissions) in reducing the redundant transmissions
in the network.\par
We consider three broadcasting schemes with varying
levels of local information where nodes have: (i) no
geographic or state information, (ii) coarse geographic
information about the origin of the broadcast, and
(iii) no geographic information, but remember
previously received messages. For each of these network
models, we demonstrate localized forwarding algorithms
for broadcast (based on geography or state information)
that achieve significant reductions in the transmission
overheads while maintaining hop-delays comparable to
flooding based schemes. We also consider the related
problem of broadcasting to a set of 'spatially uniform'
points in the network (lattice points) in the regime
where all nodes have only a local sense of direction
and demonstrate an efficient 'sparse broadcast' scheme
based on a branching random walk that has a low number
of packet transmissions. Thus, our results show that
even with very little local information, it is possible
to make broadcast schemes significantly more
efficient.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadcasting; stochastic models; wireless networks",
}
@Article{Bader:2008:POI,
author = "Ahmed Bader and Eylem Ekici",
title = "Performance optimization of interference-limited
multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1147--1160",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.905596",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The performance of a multihop wireless network is
typically affected by the interference caused by
transmissions in the same network. In a statistical
fading environment, the interference effects become
harder to predict. Information sources in a multihop
wireless network can improve throughput and delay
performance of data streams by implementing
interference-aware packet injection mechanisms. Forcing
packets to wait at the head of queues and coordinating
packet injections among different sources enable
effective control of copacket interference. In this
paper, throughput and delay performance in
interference-limited multihop networks is analyzed.
Using nonlinear probabilistic hopping models, waiting
times which jointly optimize throughput and delay
performances are derived. Optimal coordinated injection
strategies are also investigated as functions of the
number of information sources and their separations.
The resulting analysis demonstrates the interaction of
performance constraints and achievable capacity in a
wireless multihop network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hopping dynamics; interference-limited; multihop
networks; performance optimization; Rayleigh fading",
}
@Article{Karnik:2008:TOC,
author = "Aditya Karnik and Aravind Iyer and Catherine
Rosenberg",
title = "Throughput-optimal configuration of fixed wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1161--1174",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909717",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we address the following two questions
concerning the capacity and configuration of fixed
wireless networks: (i) given a set of wireless nodes
with arbitrary but fixed locations, and a set of data
flows, what is the max-min achievable throughput? and
(ii) how should the network be configured to achieve
the optimum? We consider these questions from a
networking standpoint assuming point-to-point links,
and employ a rigorous physical layer model to model
conflict relationships between them. Since we seek
capacity results, we assume that the network is
operated using an appropriate schedule of conflict-free
link activations. We develop and investigate a novel
optimization framework to determine the optimal
throughput and configuration, i.e., flow routes, link
activation schedules and physical layer parameters.
Determining the optimal throughput is a computationally
hard problem, in general. However, using a smart
enumerative technique we obtain numerical results for
several different scenarios of interest. We obtain
several important insights into the structure of the
optimal routes, schedules and physical layer
parameters. Besides determining the achievable
throughput, we believe that our optimization-based
framework can also be used as a tool, for configuring
scheduled wireless networks, such as those based on
IEEE 802.16.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity; fixed wireless networks; IEEE 802.16; mesh
networks; optimal scheduling and routing",
}
@Article{Zhang:2008:AMT,
author = "Honghai Zhang and Jennifer C. Hou",
title = "On the asymptotic minimum transporting energy and its
implication on the wireless network capacity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1175--1187",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.910631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper we study the asymptotic minimum energy
(which is defined as the minimum transporting energy)
required to transport (via multiple hops) data packets
from a source to a destination. Under the assumptions
that nodes are distributed according to a Poisson point
process with node density $n$ in a unit-area square and
the distance between a source and a destination is of
constant order, we prove that the minimum transporting
energy is $ \Theta (n^{(1 - \alpha) / 2})$ with
probability approaching one as the node density goes to
infinity, where $ \alpha $ is the path loss
exponent.\par
We demonstrate use of the derived results to obtain the
bounds of the capacity of wireless networks that
operate in UWB. In particular, we prove the transport
capacity of UWB-operated networks is $ \Theta
(n^{(\alpha - 1) / 2})$ with high probability. We also
carry out simulations to validate the derived results
and to estimate the constant factor associated with the
bounds on the minimum energy. The simulation results
indicate that the constant associated with the minimum
energy converges to the source-destination distance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic analysis; capacity; ultra wide band (UWB);
wireless network",
}
@Article{Neely:2008:OOD,
author = "Michael J. Neely",
title = "Order optimal delay for opportunistic scheduling in
multi-user wireless uplinks and downlinks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1188--1199",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909682",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a one-hop wireless network with
independent time varying ON/OFF channels and $n$ users,
such as a multi-user uplink or downlink. We first show
that general classes of scheduling algorithms that do
not consider queue backlog must incur average delay
that grows at least linearly with $N$. We then
construct a dynamic queue-length aware algorithm that
maximizes throughput and achieves an average delay that
is independent of $N$. This is the first order-optimal
delay result for opportunistic scheduling with
asymmetric links. The delay bounds are achieved via a
technique of queue grouping together with Lyapunov
drift and statistical multiplexing concepts.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "queueing analysis; stability; stochastic control",
}
@Article{Elayoubi:2008:PEA,
author = "Salah-Eddine Elayoubi and Beno{\^\i}t Fouresti{\'e}",
title = "Performance evaluation of admission control and
adaptive modulation in {OFDMA WiMax} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1200--1211",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911426",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the performance of multi-cell
OFDMA WiMAX systems, in both downlink and uplink. We
calculate analytically the number of collisions when
the number of users in each cell is known. We then
calculate the QoS indicators (e.g., blocking rates,
download time and bit error rates) taking into account
the physical layer conditions (modulation, propagation
and MIMO), the MAC layer techniques (HARQ and radio
resource management algorithms) and the traffic
characteristics, in a cross-layer approach. We finally
evaluate the impact of using adaptive modulation and
coding on the overall performance of the system. This
analysis allows us to calculate the Erlang capacity of
a WiMAX system. Our numerical applications then show
how to choose the best admission control and modulation
schemes that extend the Erlang capacity region.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "inter-cell interference; OFDMA; performance
evaluation; WiMAX",
}
@Article{Jaramillo:2008:PFN,
author = "Juan Jos{\'e} Jaramillo and Fabio Milan and R.
Srikant",
title = "Padded frames: a novel algorithm for stable scheduling
in load-balanced switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1212--1225",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.906654",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The load-balanced Birkhoff-von Neumann switching
architecture consists of two stages: a load balancer
and a deterministic input-queued crossbar switch. The
advantages of this architecture are its simplicity and
scalability, while its main drawback is the possible
out-of-sequence reception of packets belonging to the
same flow. Several solutions have been proposed to
overcome this problem; among the most promising are the
Uniform Frame Spreading (UFS) and the Full Ordered
Frames First (FOFF) algorithms. In this paper, we
present a new algorithm called Padded Frames (PF),
which eliminates the packet reordering problem,
achieves 100\% throughput, and improves the delay
performance of previously known algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Birkhoff-von Neumann switch; load-balanced switch;
scheduling",
}
@Article{Chen:2008:HTG,
author = "Bensong Chen and George N. Rouskas and Rudra Dutta",
title = "On hierarchical traffic grooming in {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "5",
pages = "1226--1238",
month = oct,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.906655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:01 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The traffic grooming problem is of high practical
importance in emerging wide-area wavelength division
multiplexing (WDM) optical networks, yet it is
intractable for any but trivial network topologies. In
this work, we present an effective and efficient
hierarchical traffic grooming framework for WDM
networks of general topology, with the objective of
minimizing the total number of electronic ports. At the
first level of hierarchy, we decompose the network into
clusters and designate one node in each cluster as the
hub for grooming traffic. At the second level, the hubs
form another cluster for grooming intercluster traffic.
We view each (first-or second-level) cluster as a
virtual star, and we present an efficient near-optimal
algorithm for determining the logical topology of
lightpaths to carry the traffic within each cluster.
Routing and wavelength assignment is then performed
directly on the underlying physical topology. We
demonstrate the effectiveness of our approach by
applying it to two networks of realistic size, a
32-node, 53-link topology and a 47-node, 96-link
network. Comparisons to lower bounds indicate that
hierarchical grooming is efficient in its use of the
network resources of interest, namely, electronic ports
and wavelengths. In addition to scaling to large
network sizes, our hierarchical approach also
facilitates the control and management of multigranular
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hierarchical traffic grooming; k-center; optical
networks; wavelength division multiplexing (WDM)",
}
@Article{Xu:2008:ITB,
author = "Kuai Xu and Zhi-Li Zhang and Supratik Bhattacharyya",
title = "{Internet} traffic behavior profiling for network
security monitoring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1241--1252",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911438",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent spates of cyber-attacks and frequent emergence
of applications affecting Internet traffic dynamics
have made it imperative to develop effective techniques
that can extract, and make sense of, significant
communication patterns from Internet traffic data for
use in network operations and security management. In
this paper, we present a general methodology for
building comprehensive behavior profiles of Internet
backbone traffic in terms of communication patterns of
end-hosts and services. Relying on data mining and
entropy-based techniques, the methodology consists of
significant cluster extraction, automatic behavior
classification and structural modeling for in-depth
interpretive analyses. We validate the methodology
using data sets from the core of the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anomaly behavior; monitoring; traffic profiling",
}
@Article{Sung:2008:LSI,
author = "Minho Sung and Jun Xu and Jun Li and Li Li",
title = "Large-scale {IP} traceback in high-speed {Internet}:
practical techniques and information-theoretic
foundation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1253--1266",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911427",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Tracing attack packets to their sources, known as IP
traceback, is an important step to counter distributed
denial-of-service (DDoS) attacks. In this paper, we
propose a novel packet logging based (i.e., hash-based)
traceback scheme that requires an order of magnitude
smaller processing and storage cost than the hash-based
scheme proposed by Snoeren et al. [1], thereby being
able to scalable to much higher link speed (e.g.,
OC-768). The base-line idea of our approach is to
sample and log a small percentage (e.g., 3.3\%) of
packets. The challenge of this low sampling rate is
that much more sophisticated techniques need to be used
for traceback. Our solution is to construct the attack
tree using the correlation between the attack packets
sampled by neighboring routers. The scheme using naive
independent random sampling does not perform well due
to the low correlation between the packets sampled by
neighboring routers. We invent a sampling scheme that
improves this correlation and the overall efficiency
significantly. Another major contribution of this work
is that we introduce a novel information-theoretic
framework for our traceback scheme to answer important
questions on system parameter tuning and the
fundamental tradeoff between the resource used for
traceback and the traceback accuracy. Simulation
results based on real-world network topologies (e.g.,
Skitter) match very well with results from the
information-theoretic analysis. The simulation results
also demonstrate that our traceback scheme can achieve
high accuracy, and scale very well to a large number of
attackers (e.g., 5000+).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed denial-of-service attacks; information
theory; IP traceback; network security",
}
@Article{Yang:2008:TLN,
author = "Xiaowei Yang and David Wetherall and Thomas Anderson",
title = "{TVA}: a {DoS}-limiting network architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1267--1280",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.914506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We motivate the capability approach to network
denial-of-service (DoS) attacks, and evaluate the
Traffic Validation Architecture (TVA) architecture
which builds on capabilities. With our approach, rather
than send packets to any destination at any time,
senders must first obtain 'permission to send' from the
receiver, which provides the permission in the form of
capabilities to those senders whose traffic it agrees
to accept. The senders then include these capabilities
in packets. This enables verification points
distributed around the network to check that traffic
has been authorized by the receiver and the path in
between, and hence to cleanly discard unauthorized
traffic. To evaluate this approach, and to understand
the detailed operation of capabilities, we developed a
network architecture called TVA. TVA addresses a wide
range of possible attacks against communication between
pairs of hosts, including spoofed packet floods,
network and host bottlenecks, and router state
exhaustion. We use simulations to show the
effectiveness of TVA at limiting DoS floods, and an
implementation on Click router to evaluate the
computational costs of TVA. We also discuss how to
incrementally deploy TVA into practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xia:2008:OMB,
author = "Yong Xia and Lakshminarayanan Subramanian and Ion
Stoica and Shivkumar Kalyanaraman",
title = "One more bit is enough",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1281--1294",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.912037",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Achieving efficient and fair bandwidth allocation
while minimizing packet loss and bottleneck queue in
high bandwidth-delay product networks has long been a
daunting challenge. Existing end-to-end congestion
control (e.g., TCP) and traditional congestion
notification schemes (e.g., TCP+AQM/ECN) have
significant limitations in achieving this goal. While
the XCP protocol addresses this challenge, it requires
multiple bits to encode the congestion-related
information exchanged between routers and end-hosts.
Unfortunately, there is no space in the IP header for
these bits, and solving this problem involves a
non-trivial and time-consuming standardization
process.\par
In this paper, we design and implement a simple,
low-complexity protocol, called Variable-structure
congestion Control Protocol (VCP), that leverages only
the existing two ECN bits for network congestion
feedback, and yet achieves comparable performance to
XCP, i.e., high utilization, negligible packet loss
rate, low persistent queue length, and reasonable
fairness. On the downside, VCP converges significantly
slower to a fair allocation than XCP. We evaluate the
performance of VCP using extensive ns2 simulations over
a wide range of network scenarios and find that it
significantly outperforms many recently-proposed TCP
variants, such as HSTCP, FAST, CUBIC, etc. To gain
insight into the behavior of VCP, we analyze a
simplified fluid model and prove its global stability
for the case of a single bottleneck shared by
synchronous flows with identical round-trip times.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "AQM; congestion control; ECN; stability; TCP",
}
@Article{Teixeira:2008:IHP,
author = "Renata Teixeira and Aman Shaikh and Timothy G. Griffin
and Jennifer Rexford",
title = "Impact of hot-potato routing changes in {IP}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1295--1307",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.919333",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Despite the architectural separation between
intradomain and interdomain routing in the Internet,
intradomain protocols do influence the path-selection
process in the Border Gateway Protocol (BGP). When
choosing between multiple equally-good BGP routes, a
router selects the one with the closest egress point,
based on the intradomain path cost. Under such
hot-potato routing, an intradomain event can trigger
BGP routing changes. To characterize the influence of
hot-potato routing, we propose a technique for
associating BGP routing changes with events visible in
the intradomain protocol, and apply our algorithm to a
tier-1 ISP backbone network. We show that (i) BGP
updates can lag 60 seconds or more behind the
intradomain event; (ii) the number of BGP path changes
triggered by hot-potato routing has a nearly uniform
distribution across destination prefixes; and (iii) the
fraction of BGP messages triggered by intradomain
changes varies significantly across time and router
locations. We show that hot-potato routing changes lead
to longer delays in forwarding-plane convergence,
shifts in the flow of traffic to neighboring domains,
extra externally-visible BGP update messages, and
inaccuracies in Internet performance measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Solano:2008:LSR,
author = "Fernando Solano and Thomas Stidsen and Ramon Fabregat
and Jose Luis Marzo",
title = "Label space reduction in {MPLS} networks: how much can
a single stacked label do?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1308--1320",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.912382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most network operators have considered reducing LSR
label spaces (number of labels used) as a way of
simplifying management of underlying Virtual Private
Networks (VPNs) and therefore reducing operational
expenditure (OPEX). The IETF outlined the label merging
feature in MPLS-allowing the configuration of
MultiPoint-to-Point connections (MP2P)-as a means of
reducing label space in LSRs. We found two main
drawbacks in this label space reduction scheme: (a) it
should be separately applied to a set of LSPs with the
same egress LSR--which decreases the options for better
reductions, and (b) LSRs close to the edge of the
network experience a greater label space reduction than
those close to the core. The later implies that MP2P
connections reduce the number of labels
asymmetrically.\par
In this article we propose a solution to these
drawbacks achieved by stacking an additional label onto
the packet header. We call this type of reduction
Asymmetric Merged Tunnels (AMT). A fast framework for
computing the optimal reduction using AMTs is proposed.
Our simulations show that the label space can be
reduced by up to 20\% more than when label merging is
used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "label merging; label space reduction; label stacking;
MPLS; multipoint-to-point",
}
@Article{Bhatia:2008:BGR,
author = "Randeep S. Bhatia and Murali Kodialam and T. V.
Lakshman and Sudipta Sengupta",
title = "Bandwidth guaranteed routing with fast restoration
against link and node failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1321--1330",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.919325",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An important feature of MPLS networks is local
restoration where detour paths are set-up a priori. The
detour is such that failed links or nodes can be
bypassed locally from the first node that is upstream
from the failures. This local bypass activation from
the first detection point for failures permits much
faster recovery than end-to-end path based mechanisms
that require failure information to propagate to the
network edges. However, local restoration of bandwidth
guaranteed connections can be expensive in the
additional network capacity needed. Hence, it is
important to minimize and share restoration capacity.
The problem of routing with local restoration
requirements has been studied previously in a dynamic
on-line setting. However, there are no satisfactory
algorithms for the problem of preprovisioning fast
restorable connections when the aggregate traffic
demands are known (as would be the case when a set of
routers are to be interconnected over an optical
network or for pre-provisioned ATM over MPLS overlays).
The contribution of this paper is a fast combinatorial
approximation algorithm for maximizing throughput when
the routed traffic is required to be locally
restorable. To the best of our knowledge, this is the
first combinatorial algorithm for the problem with a
performance guarantee. Our algorithm is a Fully
Polynomial Time Approximation Scheme (FPTAS), i.e., for
any given $ E > 0 $, it guarantees $ (1 + E)$-factor
closeness to the optimal solution, and runs in time
polynomial in the network size and $ 1 / E$. We compare
the throughput of locally restorable routing with that
of unprotected routing and $ 1 + 1$-dedicated path
protection on actual US/European ISP topologies taken
from the Rocketfuel project [14].",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fast restoration; MPLS; optical networks; protection;
routing; traffic engineering",
}
@Article{Stefanakos:2008:RRN,
author = "Stamatis Stefanakos",
title = "Reliable routings in networks with generalized link
failure events",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1331--1339",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911435",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study routing problems in networks that require
guaranteed reliability against multiple correlated link
failures. We consider two different routing objectives:
The first ensures 'local reliability,' i.e., the goal
is to route so that each connection in the network is
as reliable as possible. The second ensures 'global
reliability,' i.e., the goal is to route so that as few
as possible connections are affected by any possible
failure. We exhibit a trade-off between the two
objectives and resolve their complexity and
approximability for several classes of networks.
Furthermore, we propose approximation algorithms and
heuristics. We perform experiments to evaluate the
heuristics against optimal solutions that are obtained
using an integer linear programming solver. We also
investigate up to what degree the routing trade-offs
occur in randomly generated instances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; network reliability; routing",
}
@Article{Georgakopoulos:2008:BCB,
author = "George F. Georgakopoulos",
title = "Buffered cross-bar switches, revisited: design steps,
proofs and simulations towards optimal rate and minimum
buffer memory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1340--1351",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Regarding the packet-switching problem, we prove that
the weighed max-min fair service rates comprise the
unique Nash equilibrium point of a strategic game,
specifically a throughput auction based on a
'least-demanding first-served' principle. We prove that
a buffered crossbar switch can converge to this
equilibrium with no pre-computation or internal
acceleration, with either randomized or deterministic
schedulers, (the latter with a minimum buffering of a
single-packet per crosspoint). Finally, we present
various simulation results that corroborate and extend
our analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "buffered crossbar switches; packet switching;
strategic games",
}
@Article{Ramasubramanian:2008:SMP,
author = "Srinivasan Ramasubramanian",
title = "Supporting multiple protection strategies in optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1352--1365",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.919335",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper develops a framework to support multiple
protection strategies in optical networks, which is in
general applicable to any connection-oriented network.
The capacity available on a link for routing primary
and backup connections are computed depending on the
protection strategy. The paper also develops a model
for computing service outage and failure recovery times
for a connection where notifications of failure
location are broadcast in the network. The
effectiveness of employing multiple protection
strategies is established by studying the performance
of three networks for traffic with four types of
protection requirement.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic routing; link protection; multiple protection
strategies; optical networks; path protection",
}
@Article{Song:2008:CSB,
author = "Lei Song and Jing Zhang and Biswanath Mukherjee",
title = "A comprehensive study on backup-bandwidth
reprovisioning after network-state updates in
survivable telecom mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1366--1377",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The capacity of a telecom fiber is very high and
continues to increase, due to the advances in
wavelength-division multiplexing (WDM) technology.
Thus, a fiber-link failure may cause huge data (and
revenue) loss. Reprovisioning (or re-optimization) of
backup (or protection) bandwidth is an effective
approach to improve network survivability while
preventing existing services from unnecessary
interruption. Most research works to date focus on
applying backup-resource reprovisioning when a network
failure occurs, or at some particular intervals over a
certain time period.\par
A network's state changes when any one of the following
four events occurs: (1) a new connection arrives; (2)
an existing connection departs; (3) a network failure
occurs (e.g., a fiber cut); or (4) a failed network
component (e.g., a fiber cut) is repaired. Moreover,
backup-bandwidth rearrangement can also be triggered
when resource overbuild (RO) [1] exceeds a predefined
threshold or blocking occurs. In this study, we
investigate the benefits of performing backup
reprovisioning for part of (or all) the existing
connections after network-state updates to improve
network robustness as well as backup-bandwidth
utilization in survivable telecom mesh networks. We
study the effect of different backup reprovisioning
periods (assuming no failure occurrence), which
represents a tradeoff between capacity optimization and
computation/reconfiguration overhead. We also examine
the performance of an RO-threshold-triggered
backup-reprovisioning approach.\par
A wavelength-convertible network model and
shared-path-protected routing strategy are assumed in
this study. We consider a link-vector model in which a
vector is associated with each link in the network,
indicating the amount of backup bandwidth to be
reserved on the link to protect against possible
failures on other links. Our simulation results
demonstrate that our approaches achieve better
backup-capacity utilization and network robustness,
compared to a conventional scheme which reprovisions
backup paths for connections only when a network
failure occurs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "backup reprovisioning; mesh; multiple concurrent
failures; optical; protection; restoration;
survivability; telecom network; WDM",
}
@Article{Zhao:2008:LMC,
author = "Qun Zhao and Mohan Gurusamy",
title = "Lifetime maximization for connected target coverage in
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1378--1391",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911432",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the connected target
coverage (CTC) problem with the objective of maximizing
the network lifetime by scheduling sensors into
multiple sets, each of which can maintain both target
coverage and connectivity among all the active sensors
and the sink. We model the CTC problem as a maximum
cover tree (MCT) problem and prove that the MCT problem
is NP-Complete. We determine an upper bound on the
network lifetime for the MCT problem and then develop a
$ (1 + w) H(M) $ approximation algorithm to solve it,
where is an arbitrarily small number, $ H(M) = \sum_{1
\leq i \leq M} (1 / i) $ and $M$ is the maximum number
of targets in the sensing area of any sensor. As the
protocol cost of the approximation algorithm may be
high in practice, we develop a faster heuristic
algorithm based on the approximation algorithm called
Communication Weighted Greedy Cover (CWGC) algorithm
and present a distributed implementation of the
heuristic algorithm. We study the performance of the
approximation algorithm and CWGC algorithm by comparing
them with the lifetime upper bound and other basic
algorithms that consider the coverage and connectivity
problems independently. Simulation results show that
the approximation algorithm and CWGC algorithm perform
much better than others in terms of the network
lifetime and the performance improvement can be up to
45\% than the best-known basic algorithm. The lifetime
obtained by our algorithms is close to the upper bound.
Compared with the approximation algorithm, the CWGC
algorithm can achieve a similar performance in terms of
the network lifetime with a lower protocol cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; coverage; network lifetime;
NP-complete; sensor activity scheduling; wireless
sensor networks",
}
@Article{Papandriopoulos:2008:ODP,
author = "John Papandriopoulos and Subhrakanti Dey and Jamie
Evans",
title = "Optimal and distributed protocols for cross-layer
design of physical and transport layers in {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1392--1405",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918099",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We seek distributed protocols that attain the global
optimum allocation of link transmitter powers and
source rates in a cross-layer design of a mobile ad hoc
network. Although the underlying network utility
maximization is nonconvex, convexity plays a major role
in our development. We provide new convexity results
surrounding the Shannon capacity formula, allowing us
to abandon suboptimal high-SIR approximations that have
almost become entrenched in the literature. More
broadly, these new results can be back-substituted into
many existing problems for similar benefit.\par
Three protocols are developed. The first is based on a
convexification of the underlying problem, relying
heavily on our new convexity results. We provide
conditions under which it produces a globally optimum
resource allocation. We show how it may be distributed
through message passing for both rate- and
power-allocation. Our second protocol relaxes this
requirement and involves a novel sequence of convex
approximations, each exploiting existing TCP protocols
for source rate allocation. Message passing is only
used for power control. Our convexity results again
provide sufficient conditions for global optimality.
Our last protocol, motivated by a desire of power
control devoid of message passing, is a near optimal
scheme that makes use of noise measurements and enjoys
a convergence rate that is orders of magnitude faster
than existing methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; cross-layer optimization; mobile
ad hoc network; network utility maximization; outage
probability; power control; Rayleigh fading",
}
@Article{Brzezinski:2008:DTM,
author = "Andrew Brzezinski and Gil Zussman and Eytan Modiano",
title = "Distributed throughput maximization in wireless mesh
networks via pre-partitioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1406--1419",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918109",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the interaction between channel
assignment and distributed scheduling in multi-channel
multi-radio Wireless Mesh Networks (WMNs). Recently, a
number of distributed scheduling algorithms for
wireless networks have emerged. Due to their
distributed operation, these algorithms can achieve
only a fraction of the maximum possible throughput. As
an alternative to increasing the throughput fraction by
designing new algorithms, we present a novel approach
that takes advantage of the inherent multi-radio
capability of WMNs. We show that this capability can
enable partitioning of the network into subnetworks in
which simple distributed scheduling algorithms can
achieve 100\% throughput. The partitioning is based on
the notion of Local Pooling. Using this notion, we
characterize topologies in which 100\% throughput can
be achieved distributedly. These topologies are used in
order to develop a number of centralized channel
assignment algorithms that are based on a matroid
intersection algorithm. These algorithms pre-partition
a network in a manner that not only expands the
capacity regions of the subnetworks but also allows
distributed algorithms to achieve these capacity
regions. We evaluate the performance of the algorithms
via simulation and show that they significantly
increase the distributedly achievable capacity region.
We note that while the identified topologies are of
general interference graphs, the partitioning
algorithms are designed for networks with primary
interference constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "channel assignment; distributed algorithms; local
pooling; matroid intersection; scheduling; stability",
}
@Article{Hande:2008:DUP,
author = "Prashanth Hande and Sundeep Rangan and Mung Chiang and
Xinzhou Wu",
title = "Distributed uplink power control for optimal {SIR}
assignment in cellular data networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1420--1433",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918070",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper solves the joint power control and SIR
assignment problem through distributed algorithms in
the uplink of multi-cellular wireless networks. The
1993 Foschini--Miljanic distributed power control can
attain a given fixed and feasible SIR target. In data
networks, however, SIR needs to be jointly optimized
with transmit powers in wireless data networks. In the
vast research literature since the mid-1990s, solutions
to this joint optimization problem are either
distributed but suboptimal, or optimal but centralized.
For convex formulations of this problem, we report a
distributed and optimal algorithm.\par
The main issue that has been the research bottleneck is
the complicated, coupled constraint set, and we resolve
it through a re-parametrization via the left Perron
Frobenius eigenvectors, followed by development of a
locally computable ascent direction. A key step is a
new characterization of the feasible SIR region in
terms of the loads on the base stations, and an
indication of the potential interference from mobile
stations, which we term spillage. Based on this
load-spillage characterization, we first develop a
distributed algorithm that can achieve any
Pareto-optimal SIR assignment, then a distributed
algorithm that picks out a particular Pareto-optimal
SIR assignment and the associated powers through
utility maximization. Extensions to power-constrained
and interference-constrained cases are carried out. The
algorithms are theoretically sound and practically
implementable: we present convergence and optimality
proofs as well as simulations using 3GPP network and
path loss models.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cellular networks; distributed algorithm;
optimization; power control; wireless networks",
}
@Article{Walters:2008:FMA,
author = "Aaron Walters and David Zage and Cristina Nita
Rotaru",
title = "A framework for mitigating attacks against
measurement-based adaptation mechanisms in unstructured
multicast overlay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1434--1446",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.912394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many multicast overlay networks maintain
application-specific performance goals by dynamically
adapting the overlay structure when the monitored
performance becomes inadequate. This adaptation results
in an unstructured overlay where no neighbor selection
constraints are imposed. Although such networks provide
resilience to benign failures, they are susceptible to
attacks conducted by adversaries that compromise
overlay nodes. Previous defense solutions proposed to
address attacks against overlay networks rely on strong
organizational constraints and are not effective for
unstructured overlays. In this work, we identify,
demonstrate and mitigate insider attacks against
measurement-based adaptation mechanisms in unstructured
multicast overlay networks. We propose techniques to
decrease the number of incorrect adaptations by using
outlier detection and limit the impact of malicious
nodes by aggregating local information to derive global
reputation for each node. We demonstrate the attacks
and mitigation techniques through real-life deployments
of a mature overlay multicast system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "adaptivity; insider attacks; overlay networks;
security",
}
@Article{Hefeeda:2008:TMP,
author = "Mohamed Hefeeda and Osama Saleh",
title = "Traffic modeling and proportional partial caching for
peer-to-peer systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1447--1460",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918081",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer (P2P) file sharing systems generate a
major portion of the Internet traffic, and this portion
is expected to increase in the future. We explore the
potential of deploying proxy caches in different
Autonomous Systems (ASes) with the goal of reducing the
cost incurred by Internet service providers and
alleviating the load on the Internet backbone. We
conduct an eight-month measurement study to analyze the
P2P traffic characteristics that are relevant to
caching, such as object popularity, popularity
dynamics, and object size. Our study shows that the
popularity of P2P objects can be modeled by a
Mandelbrot-Zipf distribution, and that several
workloads exist in P2P traffic. Guided by our findings,
we develop a novel caching algorithm for P2P traffic
that is based on object segmentation, and proportional
partial admission and eviction of objects. Our
trace-based simulations show that with a relatively
small cache size, a byte hit rate of up to 35\% can be
achieved by our algorithm, which is close to the byte
hit rate achieved by an off-line optimal algorithm with
complete knowledge of future requests. Our results also
show that our algorithm achieves a byte hit rate that
is at least 40\% more, and at most triple, the byte hit
rate of the common web caching algorithms. Furthermore,
our algorithm is robust in face of aborted downloads,
which is a common case in P2P systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet measurement; network protocols; peer-to-peer
systems; traffic analysis; traffic modeling",
}
@Article{Wu:2008:CAS,
author = "Tao Wu and David Starobinski",
title = "A comparative analysis of server selection in content
replication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1461--1474",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.909752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Server selection plays an essential role in content
replication networks, such as peer-to-peer (P2P) and
content delivery networks (CDNs). In this paper, we
perform an analytical investigation of the strengths
and weaknesses of existing server selection policies,
based initially on an M/G/1 Processor Sharing (PS)
queueing-theoretic model. We develop a theoretical
benchmark to evaluate the performance of two general
server selection policies, referred to as EQ\_DELAY and
EQ\_LOAD, which characterize a wide range of existing
server selection algorithms. We find that EQ\_LOAD
achieves an average delay always higher than or equal
to that of EQ\_DELAY. A key theoretical result of this
paper is that in an $n$-server system, the worst case
ratio between the average delay of EQ\_DELAY or
EQ\_LOAD and the minimal average delay (obtained from
the benchmark) is precisely $N$. We constructively show
how this worst case scenario can arise in highly
heterogeneous systems. This result, when interpreted in
the context of selfish routing, means that the price of
anarchy in unbounded delay networks depends on the
topology, and can potentially be very large. Our
analytical findings are extended in asymptotic regimes
to the G/G/1 First-Come First-Serve and multi-class
M/G/1-PS models and supported by simulations run for
various arrival and service processes, scheduling
disciplines, and workload exhibiting temporal locality.
These results indicate that our analysis is applicable
to realistic scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "content delivery networks; distributed systems; game
theory; load balancing; peer-to-peer networks; price of
anarchy",
}
@Article{Leonard:2008:SDP,
author = "Derek Leonard and Zhongmei Yao and Xiaoming Wang and
Dmitri Loguinov",
title = "On static and dynamic partitioning behavior of
large-scale {P2P} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "6",
pages = "1475--1488",
month = dec,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.911433",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:04 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we analyze the problem of network
disconnection in the context of large-scale P2P
networks and understand how both static and dynamic
patterns of node failure affect the resilience of such
graphs. We start by applying classical results from
random graph theory to show that a large variety of
deterministic and random P2P graphs almost surely
(i.e., with probability $ 1 - O(1)$) remain connected
under random failure if and only if they have no
isolated nodes. This simple, yet powerful, result
subsequently allows us to derive in closed-form the
probability that a P2P network develops isolated nodes,
and therefore partitions, under both types of node
failure. We finish the paper by demonstrating that our
models match simulations very well and that dynamic P2P
systems are extremely resilient under node churn as
long as the neighbor replacement delay is much smaller
than the average user lifetime.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "churn; dynamic resilience; graph disconnection; P2P",
}
@Article{VanMieghem:2009:VSN,
author = "Piet {Van Mieghem} and Jasmina Omic and Robert Kooij",
title = "Virus spread in networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "1--14",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925623",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The influence of the network characteristics on the
virus spread is analyzed in a new--the $n$-intertwined
Markov chain--model, whose only approximation lies in
the application of mean field theory. The mean field
approximation is quantified in detail. The $n$
intertwined model has been compared with the exact $
2^n$-state Markov model and with previously proposed
homogeneous' or 'local' models. The sharp epidemic
threshold $ \tau c$, which is a consequence of mean
field theory, is rigorously shown to be equal to $ \tau
c = 1 / (\lambda \max (A))$, where $ \lambda \max (A)$
is the largest eigenvalue--the spectral radius--of the
adjacency matrix $A$. A continued fraction expansion of
the steady-state infection probability at node $j$ is
presented as well as several upper bounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "epidemic threshold; Markov theory; mean field theory;
spectral radius; virus spread",
}
@Article{Xie:2009:MAL,
author = "Yi Xie and Shun-Zheng Yu",
title = "Monitoring the application-layer {DDoS} attacks for
popular websites",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "15--25",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925628",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed denial of service (DDoS) attack is a
continuous critical threat to the Internet. Derived
from the low layers, new application-layer-based DDoS
attacks utilizing legitimate HTTP requests to overwhelm
victim resources are more undetectable. The case may be
more serious when such attacks mimic or occur during
the flash crowd event of a popular Website. Focusing on
the detection for such new DDoS attacks, a scheme based
on document popularity is introduced. An Access Matrix
is defined to capture the spatial-temporal patterns of
a normal flash crowd. Principal component analysis and
independent component analysis are applied to abstract
the multidimensional Access Matrix. A novel anomaly
detector based on hidden semi-Markov model is proposed
to describe the dynamics of Access Matrix and to detect
the attacks. The entropy of document popularity fitting
to the model is used to detect the potential
application-layer DDoS attacks. Numerical results based
on real Web traffic data are presented to demonstrate
the effectiveness of the proposed method.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "application-layer; distributed denial of service
(DDoS); popular Website",
}
@Article{Ranjan:2009:DSD,
author = "Supranamaya Ranjan and Ram Swaminathan and Mustafa
Uysal and Antonio Nucci and Edward Knightly",
title = "{DDoS-shield}: {DDoS}-resilient scheduling to counter
application layer attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "26--39",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926503",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Countering distributed denial of service (DDoS)
attacks is becoming ever more challenging with the vast
resources and techniques increasingly available to
attackers. In this paper, we consider sophisticated
attacks that are protocol-compliant, non-intrusive, and
utilize legitimate application-layer requests to
overwhelm system resources. We characterize
application-layer resource attacks as either request
flooding, asymmetric, or repeated one-shot, on the
basis of the application workload parameters that they
exploit. To protect servers from these attacks, we
propose a counter-mechanism namely DDoS Shield that
consists of a suspicion assignment mechanism and a
DDoS-resilient scheduler. In contrast to prior work,
our suspicion mechanism assigns a continuous value as
opposed to a binary measure to each client session, and
the scheduler utilizes these values to determine if and
when to schedule a session's requests. Using testbed
experiments on a web application, we demonstrate the
potency of these resource attacks and evaluate the
efficacy of our counter-mechanism. For instance, we
mount an asymmetric attack which overwhelms the server
resources, increasing the response time of legitimate
clients from 0.3 seconds to 40 seconds. Under the same
attack scenario, DDoS Shield improves the victims'
performance to 1.5 seconds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anomaly detection; application layer attacks;
denial-of-service attacks; information entropy; site
security monitoring",
}
@Article{Traynor:2009:MAO,
author = "Patrick Traynor and William Enck and Patrick McDaniel
and Thomas {La Porta}",
title = "Mitigating attacks on open functionality in
{SMS}-capable cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "40--53",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The transformation of telecommunications networks from
homogeneous closed systems providing only voice
services to Internet-connected open networks that
provide voice and data services presents significant
security challenges. For example, recent research
illustrated that a carefully crafted DoS attack via
text messaging could incapacitate all voice
communications in a metropolitan area with little more
than a cable modem. This attack highlights a growing
threat to these systems; namely, cellular networks are
increasingly exposed to adversaries both in and outside
the network. In this paper, we use a combination of
modeling and simulation to demonstrate the feasibility
of targeted text messaging attacks. Under realistic
network conditions, we show that adversaries can
achieve blocking rates of more than 70\% with only
limited resources. We then develop and characterize
five techniques from within two broad classes of
countermeasures--queue management and resource
provisioning. Our analysis demonstrates that these
techniques can eliminate or extensively mitigate even
the most intense targeted text messaging attacks. We
conclude by considering the tradeoffs inherent to the
application of these techniques in current and next
generation telecommunications networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "denial-of-service; open-functionality; SMS;
telecommunications",
}
@Article{Xie:2009:LSH,
author = "Yi Xie and Shun-Zheng Yu",
title = "A large-scale hidden semi-{Markov} model for anomaly
detection on user browsing behaviors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "54--65",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.923716",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many methods designed to create defenses against
distributed denial of service (DDoS) attacks are
focused on the IP and TCP layers instead of the high
layer. They are not suitable for handling the new type
of attack which is based on the application layer. In
this paper, we introduce a new scheme to achieve early
attack detection and filtering for the
application-layer-based DDoS attack. An extended hidden
semi-Markov model is proposed to describe the browsing
behaviors of web surfers. In order to reduce the
computational amount introduced by the model's large
state space, a novel forward algorithm is derived for
the online implementation of the model based on the
M-algorithm. Entropy of the user's HTTP request
sequence fitting to the model is used as a criterion to
measure the user's normality. Finally, experiments are
conducted to validate our model and algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anomaly detection; browsing behaviors; DDoS; hidden
semi-Markov model; M-algorithm",
}
@Article{Le:2009:DNW,
author = "Franck Le and Sihyung Lee and Tina Wong and Hyong S.
Kim and Darrell Newcomb",
title = "Detecting network-wide and router-specific
misconfigurations through data mining",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "66--79",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent studies have shown that router
misconfigurations are common and can have dramatic
consequences to the operations of a network.
Misconfigurations can compromise the security of an
entire network or even cause global disruptions to
Internet connectivity. Several solutions have been
proposed. They can detect a number of problems in real
configuration files. However, these solutions share a
common limitation: they are based on rules which need
to be known beforehand. Violations of these rules are
deemed misconfigurations. As policies typically differ
among networks, these approaches are limited in the
scope of mistakes they can detect. In this paper, we
address the problem of router misconfigurations using
data mining. We apply association rules mining to the
configuration files of routers across an administrative
domain to discover local, network-specific policies.
Deviations from these local policies are potential
misconfigurations. We have evaluated our scheme on
configuration files from a large state-wide network
provider, a large university campus and a
high-performance research network. In this evaluation,
we focused on three aspects of the configurations: user
accounts, interfaces and BGP sessions. User accounts
specify the users that can access the router and define
the authorized commands. Interfaces are the ports used
by routers to connect to different networks. Each
interface may support a number of services and run
various routing protocols. BGP sessions are the
connections with neighboring autonomous systems (AS).
BGP sessions implement the routing policies which
select the routes that are filtered and the ones that
are advertised to the BGP neighbors. We included the
routing policies in our study. The results are
promising. We discovered a number of errors that were
confirmed and corrected by the network administrators.
These errors would have been difficult to detect with
current predefined rule-based approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "association rules mining; error detection; network
management; static analysis",
}
@Article{Harfoush:2009:MCB,
author = "Khaled Harfoush and Azer Bestavros and John Byers",
title = "Measuring capacity bandwidth of targeted path
segments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "80--92",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008702",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Accurate measurement of network bandwidth is important
for network management applications as well as flexible
Internet applications and protocols which actively
manage and dynamically adapt to changing utilization of
network resources. Extensive work has focused on two
approaches to measuring bandwidth: measuring it
hop-by-hop, and measuring it end-to-end along a path.
Unfortunately, best-practice techniques for the former
are inefficient and techniques for the latter are only
able to observe bottlenecks visible at end-to-end
scope. In this paper, we develop end-to-end probing
methods which can measure bottleneck capacity bandwidth
along arbitrary, targeted subpaths of a path in the
network, including subpaths shared by a set of flows.
We evaluate our technique through ns simulations, then
provide a comparative Internet performance evaluation
against hop-by-hop and end-to-end techniques. We also
describe a number of applications which we foresee as
standing to benefit from solutions to this problem,
ranging from network troubleshooting and capacity
provisioning to optimizing the layout of
application-level overlay networks, to optimized
replica placement.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bottleneck bandwidth; content distribution; end-to-end
measurement; overlay networks; packet-pair",
}
@Article{VanMieghem:2009:OPN,
author = "Piet {Van Mieghem} and Huijuan Wang",
title = "The observable part of a network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "93--105",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925089",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The union of all shortest path trees $ G_{\rm Uspt} $
is the maximally observable part of a network when
traffic follows shortest paths. Overlay networks such
as peer to peer networks or virtual private networks
can be regarded as a subgraph of $ G_{\rm Uspt} $. We
investigate properties of $ G_{\rm Uspt} $ in different
underlying topologies with regular i.i.d. link weights.
In particular, we show that the overlay $ G_{\rm Uspt}
$ in an Erd{\H{o}}s--R{\'e}nyi random graph $ G p(n) $
is a connected $ G_{\rm Pc}(n) $ where $ P_c \sim \log
n / n $ is the critical link density, an observation
with potential for ad-hoc networks.
Shortest paths and, thus also the overlay $ G_{\rm
Uspt} $, can be controlled by link weights. By tuning
the power exponent $ \alpha $ of polynomial link
weights in different underlying graphs, the phase
transitions in the structure of $ G_{\rm Uspt} $ are
shown by simulations to follow a same universal curve $
F T(\alpha) = P r[{\rm G Uspt is a tree}] $. The
existence of a controllable phase transition in
networks may allow network operators to steer and
balance flows in their network. The structure of $
G_{\rm Uspt} $ in terms of the extreme value index $
\alpha $ is further examined together with its
spectrum, the eigenvalues of the corresponding
adjacency matrix of $ G_{\rm Uspt} $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "observability; overlay; union of shortest paths",
}
@Article{Song:2009:NFF,
author = "Han Hee Song and Lili Qiu and Yin Zhang",
title = "{NetQuest}: a flexible framework for large-scale
network measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "106--119",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925635",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present NetQuest, a flexible
framework for large-scale network measurement. We apply
Bayesian experimental design to select active
measurements that maximize the amount of information we
gain about the network path properties subject to given
resource constraints. We then apply network inference
techniques to reconstruct the properties of interest
based on the partial, indirect observations we get
through these measurements.\par
By casting network measurement in a general Bayesian
decision theoretic framework, we achieve flexibility.
Our framework can support a variety of design
requirements, including (i) differentiated design for
providing better resolution to certain parts of the
network; (ii) augmented design for conducting
additional measurements given existing observations;
and (iii) joint design for supporting multiple users
who are interested in different parts of the network.
Our framework is also scalable and can design
measurement experiments that span thousands of routers
and end hosts.\par
We develop a toolkit that realizes the framework on
PlanetLab. We conduct extensive evaluation using both
real traces and synthetic data. Our results show that
the approach can accurately estimate network-wide and
individual path properties by only monitoring within
2\%--10\% of paths. We also demonstrate its
effectiveness in providing differentiated monitoring,
supporting continuous monitoring, and satisfying the
requirements of multiple users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Bayesian experimental design; network inference;
network measurement; network tomography",
}
@Article{Terdik:2009:LFF,
author = "Gy{\"o}rgy Terdik and Tibor Gyires",
title = "{L{\'e}vy} flights and fractal modeling of {Internet}
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "120--129",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925630",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The relation between burstiness and self-similarity of
network traffic was identified in numerous papers in
the past decade. These papers suggested that the widely
used Poisson based models were not suitable for
modeling bursty, local-area and wide-area network
traffic. Poisson models were abandoned as unrealistic
and simplistic characterizations of network traffic.
Recent papers have challenged the accuracy of these
results in today's networks. Authors of these papers
believe that it is time to reexamine the Poisson
traffic assumption. The explanation is that as the
amount of Internet traffic grows dramatically, any
irregularity of the network traffic, such as
burstiness, might cancel out because of the huge number
of different multiplexed flows. Some of these results
are based on analyses of particular OC48 Internet
backbone connections and other historical traffic
traces. We analyzed the same traffic traces and applied
new methods to characterize them in terms of packet
interarrival times and packet lengths. The major
contribution of the paper is the application of two new
analytical methods. We apply the theory of smoothly
truncated Levy flights and the linear fractal model in
examining the variability of Internet traffic from
self-similar to Poisson. The paper demonstrates that
the series of interarrival times is still close to a
self-similar process, but the burstiness of the packet
lengths decreases significantly compared to earlier
traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "burstiness; fractal modelling; L{\'e} long-range
dependence; network traffic; vy flights",
}
@Article{Ahmed:2009:PSP,
author = "Reaz Ahmed and Raouf Boutaba",
title = "{Plexus}: a scalable peer-to-peer protocol enabling
efficient subset search",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "130--143",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001466",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient discovery of information, based on partial
knowledge, is a challenging problem faced by many large
scale distributed systems. This paper presents Plexus,
a peer-to-peer search protocol that provides an
efficient mechanism for advertising a bit-sequence
(pattern), and discovering it using any subset of its
1-bits. A pattern (e.g., Bloom filter) summarizes the
properties (e.g., key-words, service description)
associated with a shared object (e.g., document,
service).\par
Plexus has a partially decentralized architecture
involving super-peers. It adopts a novel structured
routing mechanism derived from the theory of Error
Correcting Codes (ECC). Plexus achieves better
resilience to peer failure by utilizing replication and
redundant routing paths. Routing efficiency in Plexus
scales logarithmically with the number of superpeers.
The concept presented in this paper is supported with
theoretical analysis, and simulation results obtained
from the application of Plexus to partial keyword
search utilizing the extended Golay code.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bloom filter; distributed pattern matching; error
correcting codes; peer-to-peer search; structured
overlay network",
}
@Article{Yao:2009:NIM,
author = "Zhongmei Yao and Xiaoming Wang and Derek Leonard and
Dmitri Loguinov",
title = "Node isolation model and age-based neighbor selection
in unstructured {P2P} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "144--157",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925626",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Previous analytical studies of unstructured P2P
resilience have assumed exponential user lifetimes and
only considered age-independent neighbor replacement.
In this paper, we overcome these limitations by
introducing a general node-isolation model for
heavy-tailed user lifetimes and arbitrary
neighbor-selection algorithms. Using this model, we
analyze two age-biased neighbor-selection strategies
and show that they significantly improve the residual
lifetimes of chosen users, which dramatically reduces
the probability of user isolation and graph
partitioning compared with uniform selection of
neighbors. In fact, the second strategy based on random
walks on age-proportional graphs demonstrates that, for
lifetimes with infinite variance, the system
monotonically increases its resilience as its age and
size grow. Specifically, we show that the probability
of isolation converges to zero as these two metrics
tend to infinity. We finish the paper with simulations
in finite-size graphs that demonstrate the effect of
this result in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "age-based selection; heavy-tailed lifetimes; node
isolation; peer-to-peer networks; user churn",
}
@Article{Fu:2009:OPS,
author = "Xiaoming Fu and Henning Schulzrinne and Hannes
Tschofenig and Christian Dickmann and Dieter Hogrefe",
title = "Overhead and performance study of the {General
Internet Signaling Transport (GIST)} protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "158--171",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926502",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The General Internet Signaling Transport (GIST)
protocol is currently being developed as the base
protocol compo-nent in the IETF Next Steps In Signaling
(NSIS) protocol stack to support a variety of signaling
applications. We present our study on the protocol
overhead and performance aspects of GIST. We quantify
network-layer protocol overhead and observe the effects
of enhanced modularity and security in GIST. We
developed a first open source GIST implementation at
the University of G{\"o}ttingen, and study its
performance in a Linux testbed. A GIST node serving
45,000 signaling sessions is found to consume average
only 1.1 ms for processing a signaling message and 2.4
KB of memory for managing a session. Individual
routines in the GIST code are instrumented to obtain a
detailed profile of their contributions to the overall
system processing. Important factors in determining
performance, such as the number of sessions, state
management, refresh frequency, timer management and
signaling message size are further discussed. We
investigate several mechanisms to improve GIST
performance so that it is comparable to an RSVP
implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{vonRickenbach:2009:AMI,
author = "Pascal von Rickenbach and Roger Wattenhofer and Aaron
Zollinger",
title = "Algorithmic models of interference in wireless ad hoc
and sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "172--185",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Among the most critical issues of wireless ad hoc and
sensor networks are energy consumption in general and
interference in particular. The reduction of
interference is consequently considered one of the
foremost goals of topology control. Almost all of the
related work however considers this issue implicitly:
Low interference is often claimed to be a consequence
of sparseness or low degree of the constructed
topologies. This paper, in contrast, studies explicit
definitions of interference. Various models of
interference---both from a sender-centric and a
receiver-centric perspective---are proposed, compared,
and analyzed with respect to their algorithmic
properties and complexities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithmic analysis; interference; modeling; network
connectivity; network spanners; topology control",
}
@Article{Elmeleegy:2009:UME,
author = "Khaled Elmeleegy and Alan L. Cox and T. S. Eugene Ng",
title = "Understanding and mitigating the effects of count to
infinity in {Ethernet} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "186--199",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.920874",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ethernet's high performance, low cost, and ubiquity
have made it the dominant networking technology for
many application domains. Unfortunately, its
distributed forwarding topology computation
protocol---the Rapid Spanning Tree Protocol (RSTP)---is
known to suffer from a classic count-to-infinity
problem. However, the cause and implications of this
problem are neither documented nor understood. This
paper has three main contributions. First, we identify
the exact conditions under which the count-to-infinity
problem manifests itself, and we characterize its
effect on forwarding topology convergence. Second, we
have discovered that a forwarding loop can form during
count to infinity, and we provide a detailed
explanation. Third, we propose a simple and effective
solution called RSTP with Epochs. This solution
guarantees that the forwarding topology converges in at
most one round-trip time across the network and
eliminates the possibility of a count-to-infinity
induced forwarding loop.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ethernet; reliability; spanning tree protocols",
}
@Article{Lian:2009:VSF,
author = "Jie Lian and Yunhao Liu and Kshirasagar Naik and Lei
Chen",
title = "Virtual surrounding face geocasting in wireless ad hoc
and sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "200--211",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Geocasting in wireless sensor and ad hoc networks
means delivering a message from a source node to all
the nodes in a given geographical region. The
objectives of a geocasting protocol are two-fold:
guaranteed message delivery and low transmission cost.
Most of the existing protocols do not guarantee message
de-livery, and those that do, incur high transmission
costs.\par
In this study, we propose the concept of Virtual
Surrounding Face (VSF), and design a VSF-based
geocasting protocol (VSFG). We also design a SKIP
method and a local dominating set (DS) based restricted
flooding technique to further reduce the cost of VSFG.
Through mathematical analysis and comprehensive
simulations, we show that VSFG, together with SKIP and
local DS based restricted flooding, guarantees message
delivery and has a much lower transmission cost than
the previous approaches. The reduction of cost can be
up to 65\% compared with the most efficient existing
approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; geocasting; virtual surrounding face;
wireless sensor networks",
}
@Article{Kompella:2009:PSR,
author = "Sastry Kompella and Shiwen Mao and Y. Thomas Hou and
Hanif D. Sherali",
title = "On path selection and rate allocation for video in
wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "212--224",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925942",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multi-path transport is an important mechanism for
supporting video communications in multihop wireless
networks. In this paper, we investigate the joint
problem of optimal path selection and rate allocation
for multiple video sessions in a wire-less mesh
network. We present a mathematical formulation to
optimize the application level performance (i.e., video
distortion) in the context of path selection and rate
allocation. For this complex optimization problem, we
propose a branch-and-bound based solution procedure,
embedded with the Reformulation-Linearization Technique
(RLT) that can produce $ (1 - E)$-optimal solutions for
any small $E$. This result is significant as it not
only provides theoretical understanding of this
problem, but also offers a performance benchmark for
any future proposed distributed algorithm and protocol
for this problem. Simulation results are also provided
to demonstrate the efficacy of the solution
procedure.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-layer design; optimization; path selection; rate
allocation; video communications; wireless mesh
network",
}
@Article{Issariyakul:2009:AFC,
author = "Teerawat Issariyakul and Vikram Krishnamurthy",
title = "Amplify-and-forward cooperative diversity wireless
networks: model, analysis, and monotonicity
properties",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "225--238",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925090",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper models and analyzes the performance of an
amplify-and-forward cooperative diversity wireless
network. We propose a Markov-based model, which
encompasses the following aspects: (1) the transmission
using amplify-and-forward cooperative diversity at the
physical layer; (2) a flow control protocol, finite and
infinite transmitting buffers, and an ARQ-based error
recovery mechanism at the radio link layer; and (3) a
bursty traffic pattern at the application layer. We
derive expressions for packet delivery probability and
distribution of packet delivery delay. We numerically
quantify improvement in terms of packet delivery
probability and packet delivery delay for increasing
SNR and/or cooperative nodes. For an additional
cooperative node, we quantify the amount of SNR which
can be reduced (i.e., SNR saving) without degrading the
system performance. Also, the minimum SNR and
cooperative nodes which satisfy a probabilistic delay
bound are computed. We then derive a sufficient
condition that ensures an increase in packet delivery
probability. Unlike numerical evaluation of the model,
this sufficient condition does not require computation
of stationary distribution of the Markov chain. It only
involves parameter adjustment at physical, radio link,
and application layers, hence substantially reducing
the computation effort. Based on the developed model,
we design a power allocation algorithm, which computes
the minimum transmission power under a packet delivery
probability constraint. We then use the derived
sufficient condition to reduce complexity of the power
allocation algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "amplify-and-forward (AF); cooperative diversity (CD);
Markov chain; monotonicity; stochastic dominance",
}
@Article{Luo:2009:RCD,
author = "Hongbin Luo and Lemin Li and Hongfang Yu",
title = "Routing connections with differentiated reliability
requirements in {WDM} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "253--266",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925087",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reliability has been well recognized as an important
design objective in the design of modern high-speed
networks. While traditional approaches offer either
100\% protection in the presence of single link failure
or no protection at all, connections in real networks
may have multiple reliability requirements. The concept
of differentiated reliability (DiR) has been introduced
in the literature to provide multiple reliability
requirements in protection schemes that provision spare
resources.\par
In this paper, we consider the problem of routing
connections with differentiated reliability in
wavelength-division multiplexing (WDM) mesh networks
when backup sharing is not allowed. Our objective is to
route connections with minimum network cost (e.g.,
network resources) while meeting their required
reliability. We assume connections arrive dynamically
one-at-a-time and a decision as to accept or reject a
connection has to be made without a priori knowledge of
future arrivals. Since sharing cannot be used for
achieving efficiency, the goal is to achieve efficiency
by improved path selection. In this paper, we first
present an integer linear programming (ILP) formulation
for the problem. By solving the ILP formulation, we can
obtain an optimal solution with respect to the current
network state for each dynamic arrival. To solve the
ILP formulation, however, is time consuming for large
networks. We thus propose two approximation algorithms
for the problem. The first one, called
Shortest-Path-Pair-based Auxiliary graph (SPPA), can
obtain an $ \epsilon $-approximation solution whose
cost is at most $ 1 + \epsilon $ times the optimum in $
O((n^2 (n + 1) + 2 m n)(\log \log (2 n) + 1 /
\epsilon))$ time, where $n$ and $m$ are the number of
nodes and links in a network, respectively. To reduce
the computational complexity of the first algorithm,
the second algorithm, called Auxiliary graph-based
Two-Step Approach (ATSA), is proposed and can obtain a
near optimal solution with cost at most $ 2 + \epsilon
$ times that of the optimal solution in $ O(m n(\log
\log n + 1 / \epsilon))$ time. Results from extensive
simulations conducted on two typical carrier mesh
networks show the efficiency of the two algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "differentiated reliability; mesh networks;
reliability; routing algorithm; wavelength-division
multiplexing (WDM)",
}
@Article{Avallone:2009:CRA,
author = "Stefano Avallone and Ian F. Akyildiz and Giorgio
Ventre",
title = "A channel and rate assignment algorithm and a
layer-2.5 forwarding paradigm for multi-radio wireless
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "267--280",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.918091",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The availability of cost-effective wireless network
interface cards makes it practical to design network
devices with multiple radios which can be exploited to
simultaneously transmit/receive over different
frequency channels. It has been shown that using
multiple radios per node increases the throughput of
multi-hop wireless mesh networks. However, multi-radios
create several research challenges. A fundamental
problem is the joint channel assignment and routing
problem, i.e., how the channels can be assigned to
radios and how a set of flow rates can be determined
for every network link in order to achieve an
anticipated objective. This joint problem is
NP-complete. Thus, an approximate solution is developed
by solving the channel assignment and the routing
problems separately. The channel assignment problem
turns out to be the problem to assign channels such
that a given set of flow rates are schedulable and
itself is shown to be also NP-complete. This paper
shows that not only the channels but also the
transmission rates of the links have to be properly
selected to make a given set of flow rates schedulable.
Thus, a greedy heuristic for the channel and rate
assignment problem is developed. Algorithms to schedule
the resulting set of flow rates have been proposed in
the literature, which require synchronization among
nodes and hence modified coordination functions. Unlike
previous work, in this paper a forwarding paradigm is
developed to achieve the resulting set of flow rates
while using a standard MAC. A bi-dimensional Markov
chain model of the proposed forwarding paradigm is
presented to analyze its behavior. Thorough performance
studies are conducted to: (a) compare the proposed
greedy heuristic to other channel assignment
algorithms; (b) analyze the behavior of the forwarding
paradigm through numerical simulations based on the
Markov chain model; (c) simulate the operations of the
forwarding paradigm and evaluate the achieved network
throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "channel assignment; layer-2.5 forwarding paradigm;
multi-radio wireless mesh networks; physical model of
interference",
}
@Article{Tabatabaee:2009:MCN,
author = "Vahid Tabatabaee and Leandros Tassiulas",
title = "{MNCM}: a critical node matching approach to
scheduling for input buffered switches with no
speedup",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "294--304",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925091",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we use fluid model techniques to
establish new results for the throughput of
input-buffered switches. Dai and Prabhakar have shown
that any maximal size matching algorithm with speedup
of 2 achieves 100\% throughput. We introduce the
maximum node containing matching (MNCM), which is a new
class of matching algorithms that achieve 100\%
throughput with no speedup. The only assumption on the
arrival processes is they satisfy the strong law of
large numbers (SLLN). The MNCM policies only need to
include ports whose weight (backlog) are above a
threshold in the matching rather than finding a
matching with maximum total weight. This simplified
requirement enables us to introduce a new matching
algorithm, maximum first matching (MFM), with
O(N$^{2.5}$) complexity. We show that MFM is a
low-complexity algorithm with good delay performance.
We also provide a deterministic upper bound for the
buffering requirement of a switch with an MNCM
scheduler, when the ports incoming traffic are
admissible and ($ \sigma $, $ \rho $) regulated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "input-queued switch fabrics; scheduling; stability
analysis",
}
@Article{Zalesky:2009:BCS,
author = "Andrew Zalesky",
title = "To burst or circuit switch?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "305--318",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.923718",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop, analyze and then numerically compare
performance models of a fast-adapting and centrally
controlled form of optical circuit switching (OCS) with
a conservative form of optical burst switching (OBS).
For the first time, we consider a unified model
comprising both: edge buffers at which arriving packets
are aggregated and enqueued according to a
vacation-type service discipline with nondeterministic
set-up times, together with a core network comprising
switches arbitrarily interconnected via fibers to allow
transmission of packets from an edge buffer to their
desired egress point through use of a dynamic signaling
process to establish a lightpath, and in the case of
OCS, also acknowledge its establishment. As such, edge
buffers dynamically issue requests for wavelength
capacity via a two or one-way reservation signaling
process. Previously analyzed models of OCS and OBS have
either been for a stand-alone edge buffer or a core
network without edge buffering. We compare OCS with OBS
in terms of packet blocking probability due to edge
buffer overflow and blocking at switches in the case of
OBS; mean packet queueing delay at edge buffers; and,
wavelength capacity utilization. Also for the first
time, we derive the exact blocking probability for a
multi-hop stand-alone OBS route, assuming Kleinrock's
independence, which is not simply a matter of summing
the stationary distribution of an appropriate Markov
process over all blocking states, as shown to be the
case for an OCS route.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical switching; blocking probability; optical
burst switching; optical circuit switching; path
decomposition; stochastic performance modeling;
vacation queue",
}
@Article{Liu:2009:SNF,
author = "Guanglei Liu and Chuanyi Ji",
title = "Scalability of network-failure resilience: analysis
using multi-layer probabilistic graphical models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "319--331",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925944",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this work, we quantify scalability of network
resilience upon failures. We characterize resilience as
the percentage of lost traffic upon failures and define
scalability as the growth rate of the percentage of
lost traffic with respect to network size, link failure
probability, and network traffic for given failure
protection schemes. We apply probabilistic graphical
models to characterize statistical dependence between
physical-layer failures and the net-work-layer traffic,
and analyze the scalability for large networks of
different topologies.\par
We first focus on the scalability of resilience for
regular topologies under uniform deterministic traffic
with independent and dependent link failures, with and
without protection. For large net-works with small
probabilities of failures and without protection, we
show that the scalability of network resilience grows
linearly with the average route length and with the
'effective' link failure probability. For large
networks with $ 1 + 1 $ protection, we obtain lower and
upper bound of the percentage of lost traffic. We
derive approximations of the scalability for arbitrary
topologies, and attain close-form analytical results
for ring, star, and mesh-torus topologies. We then
study network resilience under random traffic with
Poisson arrivals. We find that when the network is
under light load, the network resilience is reduced to
that under uniform deterministic traffic. When the
network load is under heavy load, the percentage of
lost traffic approaches the marginal probability of
link failure. Our scalability analysis shows explicitly
how network resilience varies with different factors
and provides insights for resilient network design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dependent failures; Erlang fixed point approximation;
network resilience; probabilistic graphical models;
scalability",
}
@Article{Jayavelu:2009:MCT,
author = "Giridhar Jayavelu and Srinivasan Ramasubramanian and
Ossama Younis",
title = "Maintaining colored trees for disjoint multipath
routing under node failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "1",
pages = "346--359",
month = feb,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.919323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Mar 6 16:31:07 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Colored Trees (CTs) is an efficient approach to route
packets along link-or node-disjoint paths in
packet-switched networks. In this approach, two trees,
namely red and blue, are constructed rooted at a drain
such that the path from any node to the drain are
link-or node-disjoint. For applications where both the
trees are used simultaneously, it is critical to
maintain the trees after link or node failures. To this
end, this paper develops an algorithm, referred to as
SimCT, that efficiently constructs and maintains
colored trees under failures using only local
information. Even when the entire tree needs to be
recomputed, the SimCT algorithm requires 40\% lesser
messages than previous techniques. The convergence time
of the SimCT algorithm is linear in the number of
nodes. We show through extensive simulations that the
average length of the disjoint paths obtained using the
SimCT algorithm is lesser compared to the previously
known techniques. The above-mentioned improvements are
obtained by exploiting the relationship between DFS
numbering, lowpoint values, and the potentials employed
for maintaining partial ordering of nodes. The SimCT
algorithm is also extended to obtain colored trees in
multi-drain networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "colored trees; IP fast rerouting; multipath routing",
}
@Article{Fan:2009:DTO,
author = "Bin Fan and John C. S. Lui and Dah-Ming Chiu",
title = "The design trade-offs of {BitTorrent}-like file
sharing protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "365--376",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2002553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The BitTorrent (BT) file sharing protocol is very
popular due to its scalability property and the
built-in incentive mechanism to reduce free-riding.
However, in designing such P2P file sharing protocols,
there is a fundamental trade-off between keeping
fairness and providing good performance. In particular,
the system can either keep peers (especially those
resourceful ones) in the system for as long as possible
so as to help the system to achieve better performance,
or allow more resourceful peers to finish their
download as quickly as possible so as to achieve
fairness. The current BT protocol represents only one
possible implementation in this whole design space. The
objective of this paper is to characterize the design
space of BT-like protocols. The rationale for
considering fairness in the P2P file sharing context is
to use it as a measure of willingness to provide
service. We show that there is a wide range of design
choices, ranging from optimizing the performance of
file download time, to optimizing the overall fairness
measure. More importantly, we show that there is a
simple and easily implementable design knob so that the
system can operate at a particular point in the design
space. We also discuss different algorithms, ranging
from centralized to distributed, in realizing the
design knob. Performance evaluations are carried out,
both via simulation and network measurement, to
quantify the merits and properties of the BT-like file
sharing protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BitTorrent; fairness; file sharing protocol; incentive
mechanism; performance",
}
@Article{Stutzbach:2009:USU,
author = "Daniel Stutzbach and Reza Rejaie and Nick Duffield and
Subhabrata Sen and Walter Willinger",
title = "On unbiased sampling for unstructured peer-to-peer
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "377--390",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001730",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a detailed examination of how the
dynamic and heterogeneous nature of real-world
peer-to-peer systems can introduce bias into the
selection of representative samples of peer properties
(e.g., degree, link bandwidth, number of files shared).
We propose the Metropolized Random Walk with
Backtracking (MRWB) as a viable and promising technique
for collecting nearly unbiased samples and conduct an
extensive simulation study to demonstrate that our
technique works well for a wide variety of
commonly-encountered peer-to-peer network conditions.
We have implemented the MRWB algorithm for selecting
peer addresses uniformly at random into a tool called
ion-sampler. Using the Gnutella network, we empirically
show that ion-sampler yields more accurate samples than
tools that rely on commonly-used sampling techniques
and results in dramatic improvements in efficiency and
scalability compared to performing a full crawl.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "peer-to-peer; sampling",
}
@Article{He:2009:LLF,
author = "Yihua He and Georgos Siganos and Michalis Faloutsos
and Srikanth Krishnamurthy",
title = "Lord of the links: a framework for discovering missing
links in the {Internet} topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "391--404",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926512",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The topology of the Internet at the Autonomous System
(AS) level is not yet fully discovered despite
significant research activity. The community still does
not know how many links are missing, where these links
are and finally, whether the missing links will change
our conceptual model of the Internet topology. An
accurate and complete model of the topology would be
important for protocol design, performance evaluation
and analyses. The goal of our work is to develop
methodologies and tools to identify and validate such
missing links between ASes. In this work, we develop
several methods and identify a significant number of
missing links, particularly of the peer-to-peer type.
Interestingly, most of the missing AS links that we
find exist as peer-to-peer links at the Internet
Exchange Points (IXPs). First, in more detail, we
provide a large-scale comprehensive synthesis of the
available sources of information. We cross-validate and
compare BGP routing tables, Internet Routing
Registries, and traceroute data, while we extract
significant new information from the less-studied
Internet Exchange Points (IXPs). We identify 40\% more
edges and approximately 300\% more peer-to-peer edges
compared to commonly used data sets. All of these edges
have been verified by either BGP tables or traceroute.
Second, we identify properties of the new edges and
quantify their effects on important topological
properties. Given the new peer-to-peer edges, we find
that for some ASes more than 50\% of their paths stop
going through their ISPs assuming policy-aware routing.
A surprising observation is that the degree of an AS
may be a poor indicator of which ASes it will peer
with.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BGP; inter-domain; Internet; measurement; missing
links; routing; topology",
}
@Article{Bianco:2009:WUS,
author = "Andrea Bianco and Gianluca Mardente and Marco Mellia
and Maurizio Munaf{\`o} and Luca Muscariello",
title = "{Web} user-session inference by means of clustering
techniques",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "405--416",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927009",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper focuses on the definition and
identification of 'Web user-sessions', aggregations of
several TCP connections generated by the same source
host. The identification of a user-session is non
trivial. Traditional approaches rely on threshold based
mechanisms. However, these techniques are very
sensitive to the value chosen for the threshold, which
may be difficult to set correctly. By applying
clustering techniques, we define a novel methodology to
identify Web user-sessions without requiring an a
priori definition of threshold values. We define a
clustering based approach, we discuss pros and cons of
this approach, and we apply it to real traffic traces.
The proposed methodology is applied to artificially
generated traces to evaluate its benefits against
traditional threshold based approaches. We also analyze
the characteristics of user-sessions extracted by the
clustering methodology from real traces and study their
statistical properties. Web user-sessions tend to be
Poisson, but correlation may arise during periods of
network/hosts anomalous behavior.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "clustering methods; traffic measurement; web traffic
characterization",
}
@Article{Veitch:2009:RSA,
author = "Darryl Veitch and Julien Ridoux and Satish Babu
Korada",
title = "Robust synchronization of absolute and difference
clocks over networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "417--430",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926505",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a detailed re-examination of the problem of
inexpensive yet accurate clock synchronization for
networked devices. Based on an empirically validated,
parsimonious abstraction of the CPU oscillator as a
timing source, accessible via the TSC register in
popular PC architectures, we build on the key
observation that the measurement of time differences,
and absolute time, requires separate clocks, both at a
conceptual level and practically, with distinct
algorithmic, robustness, and accuracy characteristics.
Combined with round-trip time based filtering of
network delays between the host and the remote time
server, we define robust algorithms for the
synchronization of the absolute and difference
TSCclocks over a network. We demonstrate the
effectiveness of the principles, and algorithms using
months of real data collected using multiple servers.
We give detailed performance results for a full
implementation running live and unsupervised under
numerous scenarios, which show very high reliability,
and accuracy approaching fundamental limits due to host
system noise. Our synchronization algorithms are
inherently robust to many factors including packet
loss, server outages, route changes, and network
congestion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "GPS; network measurement; NTP; round-trip time;
software clock; synchronization; timing; TSC",
}
@Article{Scheuermann:2009:TSD,
author = "Bj{\"o}rn Scheuermann and Wolfgang Kiess and Magnus
Roos and Florian Jarre and Martin Mauve",
title = "On the time synchronization of distributed log files
in networks with local broadcast media",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "431--444",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925946",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Real-world experiments in computer networks typically
result in a set of log files, one for each system
involved in the experiment. Each log file contains
event timestamps based on the local clock of the
respective system. These clocks are not perfectly
accurate, and deviate from each other. For a thorough
analysis, however, a common time basis is necessary. In
this paper, we tackle the fundamental problem of
creating such a common time base for experiments in
networks with local broadcast media, where
transmissions can be received by more than one node. We
show how clock deviations and event times can be
estimated with very high accuracy, without introducing
any additional traffic in the network. The proposed
method is applied after the experiment is completed,
using just the set of local log files as its input. It
leads to a large linear program with a very specific
structure. We exploit the structure to solve the
synchronization problem quickly and efficiently, and
present an implementation of a specialized solver.
Furthermore, we give analytical and numerical
evaluation results and present real-world experiments,
all underlining the performance and accuracy of the
method.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadcast channels; experiments; offline time
synchronization; synchronization; timestamps",
}
@Article{Oliveira:2009:QPE,
author = "Ricardo Oliveira and Beichuan Zhang and Dan Pei and
Lixia Zhang",
title = "Quantifying path exploration in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "445--458",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2016390",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Previous measurement studies have shown the existence
of path exploration and slow convergence in the global
Internet routing system, and a number of protocol
enhancements have been proposed to remedy the problem.
However, existing measurements were conducted only over
a small number of testing prefixes. There has been no
systematic study to quantify the pervasiveness of
Border Gateway Protocol (BGP) slow convergence in the
operational Internet, nor any known effort to deploy
any of the proposed solutions.\par
In this paper, we present our measurement results that
identify BGP slow convergence events across the entire
global routing table. Our data shows that the severity
of path exploration and slow convergence varies
depending on where prefixes are originated and where
the observations are made in the Internet routing
hierarchy. In general, routers in tier-1 Internet
service providers (ISPs) observe less path exploration,
hence they experience shorter convergence delays than
routers in edge ASs; prefixes originated from tier-1
ISPs also experience less path exploration than those
originated from edge ASs. Furthermore, our data show
that the convergence time of route fail-over events is
similar to that of new route announcements and is
significantly shorter than that of route failures. This
observation is contrary to the widely held view from
previous experiments but confirms our earlier
analytical results. Our effort also led to the
development of a path-preference inference method based
on the path usage time, which can be used by future
studies of BGP dynamics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "AS topology completeness; border gateway protocol
(BGP); inter-domain routing; Internet topology",
}
@Article{Kodialam:2009:ORH,
author = "Murali Kodialam and T. V. Lakshman and James B. Orlin
and Sudipta Sengupta",
title = "Oblivious routing of highly variable traffic in
service overlays and {IP} backbones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "459--472",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927257",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The emergence of new applications on the Internet like
voice-over-IP, peer-to-peer, and video-on-demand has
created highly dynamic and changing traffic patterns.
In order to route such traffic with quality-of-service
(QoS) guarantees without requiring detection of traffic
changes in real-time or reconfiguring the network in
response to it, a routing and bandwidth allocation
scheme has been recently proposed that allows
preconfiguration of the network such that all traffic
patterns permissible within the network's natural
ingress-egress capacity constraints can be handled in a
capacity efficient manner. The scheme routes traffic in
two phases. In the first phase, incoming traffic is
sent from the source to a set of intermediate nodes and
then, in the second phase, from the intermediate nodes
to the final destination. The traffic in the first
phase is distributed to the intermediate nodes in
predetermined proportions that depend on the
intermediate nodes. In this paper, we develop linear
programming formulations and a fast combinatorial
algorithm for routing under the scheme so as to
maximize throughput (or, minimize maximum link
utilization). We compare the throughput performance of
the scheme with that of the optimal scheme among the
class of all schemes that are allowed to even make the
routing dependent on the traffic matrix. For our
evaluations, we use actual Internet Service Provider
topologies collected for the Rocketfuel project. We
also bring out the versatility of the scheme in not
only handling widely fluctuating traffic but also
accommodating applicability to several widely differing
networking scenarios, including (i) economical Virtual
Private Networks (VPNs); (ii) supporting indirection in
specialized service overlay models like Internet
Indirection Infrastructure (i3); (iii) adding QoS
guarantees to services that require routing through a
network-based middlebox; and (iv) reducing IP layer
transit traffic and handling extreme traffic
variability in IP-over-optical networks without dynamic
reconfiguration of the optical layer. The two desirable
properties of supporting indirection in specialized
service overlay models and static optical layer
provisioning in IP-over-optical networks are not
present in other approaches for routing variable
traffic, such as direct source-destination routing
along fixed paths.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hose traffic model; IP-over-optical; IP/MPLS;
oblivious routing; service overlays; two-phase routing;
valiant load balancing; variable traffic",
}
@Article{Kvalbein:2009:MRC,
author = "Amund Kvalbein and Audun Fosselie Hansen and Tarik
{\v{C}}i{\v{c}}ic and Stein Gjessing and Olav Lysne",
title = "Multiple routing configurations for fast {IP} network
recovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "473--486",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926507",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the Internet takes an increasingly central role in
our communications infrastructure, the slow convergence
of routing protocols after a network failure becomes a
growing problem. To assure fast recovery from link and
node failures in IP networks, we present a new recovery
scheme called Multiple Routing Configurations (MRC).
Our proposed scheme guarantees recovery in all single
failure scenarios, using a single mechanism to handle
both link and node failures, and without knowing the
root cause of the failure. MRC is strictly
connectionless, and assumes only destination based
hop-by-hop forwarding. MRC is based on keeping
additional routing information in the routers, and
allows packet forwarding to continue on an alternative
output link immediately after the detection of a
failure. It can be implemented with only minor changes
to existing solutions. In this paper we present MRC,
and analyze its performance with respect to
scalability, backup path lengths, and load distribution
after a failure. We also show how an estimate of the
traffic demands in the network can be used to improve
the distribution of the recovered traffic, and thus
reduce the chances of congestion when MRC is used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "availability; communication system fault tolerance;
communication system routing; computer network
reliability; protection",
}
@Article{Cohen:2009:TEA,
author = "Reuven Cohen and Gabi Nakibly",
title = "A traffic engineering approach for placement and
selection of network services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "487--500",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014652",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network services are provided by means of dedicated
service gateways, through which traffic flows are
directed. Existing work on service gateway placement
has been primarily focused on minimizing the length of
the routes through these gateways. Only limited
attention has been paid to the effect these routes have
on overall network performance. We propose a novel
approach for the service placement problem, which takes
into account traffic engineering considerations. Rather
than trying to minimize the length of the traffic flow
routes, we take advantage of these routes in order to
enhance the overall network performance. We divide the
problem into two subproblems: finding the best location
for each service gateway, and selecting the best
service gateway for each flow. We propose efficient
algorithms for both problems and study their
performance. Our main contribution is showing that
placement and selection of network services can be used
as effective tools for traffic engineering.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "load balancing; network services; routing; traffic
engineering",
}
@Article{Goodell:2009:DSP,
author = "Geoffrey Goodell and Mema Roussopoulos and Scott
Bradner",
title = "A directory service for perspective access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "501--514",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2016389",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network fragmentation occurs when the accessibility of
a network-based resource to an observer is a function
of how the observer is connected to the network. In the
context of the Internet, network fragmentation is well
known and occurs in many situations, including an
increasing preponderance of network address
translation, firewalls, and virtual private networks.
Recently, however, new threats to Internet consistency
have received media attention. Alternative namespaces
have emerged as the result of formal objections to the
process by which Internet names and addresses are
provisioned. In addition, various governments and
service providers around the world have deployed
network technology that (accidentally or intentionally)
restricts access to certain Internet content. Combined
with the aforementioned sources of fragmentation, these
new concerns provide ample motivation for a network
that allows users the ability to specify not only the
network location of Internet resources they want to
view but also the perspectives from which they want to
view them. Our vision of a perspective access network
(PAN) is a peer-to-peer overlay network that
incorporates routing and directory services that allow
network perspective-sharing and nonhierarchical
organization of the Internet. In this paper, we present
the design, implementation, and evaluation of a
directory service for such networks. We demonstrate its
feasibility and efficacy using measurements from a test
deployment on PlanetLab.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network neutrality; overlay networks; peer-to-peer",
}
@Article{Kyasanur:2009:CMW,
author = "Pradeep Kyasanur and Nitin H. Vaidya",
title = "Capacity of multichannel wireless networks under the
protocol model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "515--527",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926504",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the capacity of $n$ a node static
wireless network with $c$ channels and $m$ radio
interfaces per node under the protocol model of
interference. In their seminal work, Gupta and Kumar
have determined the capacity of a single channel
network $ (c = 1, m = 1) $. Their results are also
applicable to multichannel networks provided each node
has one interface per channel $ (m = c) $. However, in
practice, it is often infeasible to equip each node
with one interface per channel. Motivated by this
observation, we establish the capacity of general
multichannel networks $ (m \leq c) $. Equipping each
node with fewer interfaces than channels in general
reduces network capacity. However, we show that one
important exception is a random network with up to {$
O(\log n) $} channels, where there is no capacity
degradation even if each node has only one interface.
Our initial analysis assumes that the interfaces are
capable of switching channels instantaneously, but we
later extend our analysis to account for interface
switching delays seen in practice. Furthermore, some
multichannel protocols proposed so far rarely require
interfaces to switch, and therefore, we briefly study
the capacity with fixed interfaces as well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multihop wireless networks; multiple channels;
multiple radios; network capacity",
}
@Article{Raman:2009:FLA,
author = "Bhaskaran Raman and Kameswari Chebrolu and Dattatraya
Gokhale and Sayandeep Sen",
title = "On the feasibility of the link abstraction in wireless
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "528--541",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2013706",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Outdoor community mesh networks based on IEEE 802.11
have seen tremendous growth in the recent past. The
current understanding is that wireless link performance
in these settings is inherently unpredictable, due to
multipath delay spread. Consequently, researchers have
focused on developing intelligent routing techniques to
achieve the best possible performance. In this paper,
we are specifically interested in mesh networks in
rural locations. We first present detailed measurements
to show that the PHY layer in these settings is indeed
stable and predictable. There is a strong correlation
between the error rate and the received signal
strength. We show that interference, and not multipath
fading, is the primary cause of unpredictable
performance. This is in sharp contrast with current
widespread knowledge from prior studies. Furthermore,
we corroborate our view with a fresh analysis of data
presented in these prior studies. While our initial
measurements focus on 802.11b, we then use two
different PHY technologies as well, operating in the
2.4-GHz ISM band: 802.11g and 802.15.4. These show
similar results too. Based on our results, we argue
that outdoor rural mesh networks can indeed be built
with the link abstraction being valid. This has several
design implications, including at the MAC and routing
layers, and opens up a fresh perspective on a wide
range of technical issues in this domain.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IEEE 802.11; IEEE 802.15.4; interference; link
abstraction; link-level measurements; rural networks;
WiFi; wireless mesh networks",
}
@Article{Cheng:2009:ORR,
author = "Bow-Nan Cheng and Murat Yuksel and Shivkumar
Kalyanaraman",
title = "Orthogonal rendezvous routing protocol for wireless
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "542--555",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926511",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Routing in multi-hop wireless networks involves the
indirection from a persistent name (or ID) to a
locator. Concepts such as coordinate space embedding
help reduce the number and dynamism complexity of
bindings and state needed for this indirection. Routing
protocols which do not use such concepts often tend to
flood packets during route discovery or dissemination,
and hence have limited scalability. In this paper, we
introduce Orthogonal Rendezvous Routing Protocol (ORRP)
for meshed wireless networks. ORRP is a
lightweight-but-scalable routing protocol utilizing
directional communications (such as directional
antennas or free-space-optical transceivers) to relax
information requirements such as coordinate space
embedding and node localization. The ORRP source and
ORRP destination send route discovery and route
dissemination packets respectively in locally-chosen
orthogonal directions. Connectivity happens when these
paths intersect (i.e., rendezvous). We show that ORRP
achieves connectivity with high probability even in
sparse networks with voids. ORRP scales well without
imposing DHT-like graph structures (eg: trees, rings,
torus etc). The total state information required is $
O(N^{3 / 2}) $ for N-node networks, and the state is
uniformly distributed. ORRP does not resort to flooding
either in route discovery or dissemination. The price
paid by ORRP is suboptimality in terms of path stretch
compared to the shortest path; however we characterize
the average penalty and find that it is not severe.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "directional antennas; free-space-optics; wireless
mesh; wireless routing protocol",
}
@Article{Rasti:2009:PEG,
author = "Mehdi Rasti and Ahmad R. Sharafat and Babak Seyfe",
title = "{Pareto}-efficient and goal-driven power control in
wireless networks: a game-theoretic approach with a
novel pricing scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "556--569",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A Pareto-efficient, goal-driven, and distributed power
control scheme for wireless networks is presented. We
use a non-cooperative game-theoretic approach to
propose a novel pricing scheme that is linearly
proportional to the signal-to-interference ratio (SIR)
and analytically show that with a proper choice of
prices (proportionality constants), the outcome of the
noncooperative power control game is a unique and
Pareto-efficient Nash equilibrium (NE). This can be
utilized for constrained-power control to satisfy
specific goals (such as fairness, aggregate throughput
optimization, or trading off between these two goals).
For each one of the above goals, the dynamic price for
each user is also analytically obtained. In a
centralized (base station) price setting, users should
inform the base station of their path gains and their
maximum transmit-powers. In a distributed price
setting, for each goal, an algorithm for users to
update their transmit-powers is also presented that
converges to a unique fixed-point in which the
corresponding goal is satisfied. Simulation results
confirm our analytical developments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed and goal-driven power control; game
theory; Pareto efficiency; wireless networks",
}
@Article{Cohen:2009:OWS,
author = "Reuven Cohen and Boris Kapchits",
title = "An optimal wake-up scheduling algorithm for minimizing
energy consumption while limiting maximum delay in a
mesh sensor network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "570--581",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014656",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents an algorithm for maximizing the
lifetime of a sensor network while guaranteeing an
upper bound on the end-to-end delay. We prove that the
proposed algorithm is optimal and requires simple
computing operations that can be implemented by simple
devices. To the best of our knowledge, this is the
first paper to propose a sensor wake-up frequency that
depends on the sensor's location in the routing paths.
Using simulations, we show that the proposed algorithm
significantly increases the lifetime of the network
while guaranteeing a maximum on the end-to-end delay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "scheduling in wireless networks; sensor networks",
}
@Article{Shpungin:2009:LEF,
author = "Hanan Shpungin and Michael Segal",
title = "Low-energy fault-tolerant bounded-hop broadcast in
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "582--590",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014653",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies asymmetric power assignments in
wireless ad hoc networks. The temporary, unfixed
physical topology of wireless ad hoc networks is
determined by the distribution of the wireless nodes as
well as the transmission power (range) assignment of
each node. We consider the problem of bounded-hop
broadcast under $k$-fault resilience criterion for
linear and planar layout of nodes. The topology that
results from our power assignment allows a broadcast
operation from a wireless node $r$ to any other node in
at most $h$ hops and is $k$-fault resistant. We develop
simple approximation algorithms for the two cases and
obtain the following approximation ratios: linear
case-- $ O(k)$; planar case--we first prove a factor of
$ O(k^3)$, which is later decreased to $ O(k^2)$ by a
finer analysis. Finally, we show a trivial power
assignment with a cost $ O(h)$ times the optimum. To
the best of our knowledge, these are the first
nontrivial results for this problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation methods; fault tolerance; minimum-energy
control; radio broadcasting; wireless networks",
}
@Article{Li:2009:AFR,
author = "Tianji Li and Qiang Ni and David Malone and Douglas
Leith and Yang Xiao and Thierry Turletti",
title = "Aggregation with fragment retransmission for very
high-speed {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "591--604",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014654",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In upcoming very high-speed wireless LANs (WLANs), the
physical (PHY) layer rate may reach 600 Mbps. To
achieve high efficiency at the medium access control
(MAC) layer, we identify fundamental properties that
must be satisfied by any CSMA-/CA-based MAC layers and
develop a novel scheme called aggregation with fragment
retransmission (AFR) that exhibits these properties. In
the AFR scheme, multiple packets are aggregated into
and transmitted in a single large frame. If errors
happen during the transmission, only the corrupted
fragments of the large frame are retransmitted. An
analytic model is developed to evaluate the throughput
and delay performance of AFR over noisy channels and to
compare AFR with similar schemes in the literature.
Optimal frame and fragment sizes are calculated using
this model. Transmission delays are minimized by using
a zero-waiting mechanism where frames are transmitted
immediately once the MAC wins a transmission
opportunity. We prove that zero-waiting can achieve
maximum throughput. As a complement to the theoretical
analysis, we investigate the impact of AFR on the
performance of realistic application traffic with
diverse requirements by simulations. We have
implemented the AFR scheme in the {\em NS-2\/}
simulator and present detailed results for TCP, VoIP,
and HDTV traffic.\par
The AFR scheme described was developed as part of the
IEEE 802.11n working group work. The analysis presented
here is general enough to be extended to proposed
schemes in the upcoming 802.11n standard. Trends
indicated in this paper should extend to any
well-designed aggregation schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IEEE 802.11; IEEE 802.11n; medium access control
(MAC); wireless LAN (WLAN)",
}
@Article{Cardenas:2009:EDA,
author = "Alvaro A. C{\'a}rdenas and Svetlana Radosavac and John
S. Baras",
title = "Evaluation of detection algorithms for {MAC} layer
misbehavior: theory and experiments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "605--617",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926510",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We revisit the problem of detecting greedy behavior in
the IEEE 802.11 MAC protocol by evaluating the
performance of two previously proposed schemes: DOMINO
and the Sequential Probability Ratio Test (SPRT). Our
evaluation is carried out in four steps. We first
derive a new analytical formulation of the SPRT that
considers access to the wireless medium in discrete
time slots. Then, we introduce an analytical model for
DOMINO. As a third step, we evaluate the theoretical
performance of SPRT and DOMINO with newly introduced
metrics that take into account the repeated nature of
the tests. This theoretical comparison provides two
major insights into the problem: it confirms the
optimality of SPRT, and motivates us to define yet
another test: a nonparametric CUSUM statistic that
shares the same intuition as DOMINO but gives better
performance. We finalize the paper with experimental
results, confirming the correctness of our theoretical
analysis and validating the introduction of the new
nonparametric CUSUM statistic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "CUSUM; DOMINO; IEEE 802.11 MAC; intrusion detection;
misbehavior; SPRT",
}
@Article{Chen:2009:NQD,
author = "Mingyu Chen and Xingzhe Fan and Manohar N. Murthi and
T. Dilusha Wickramarathna and Kamal Premaratne",
title = "Normalized queueing delay: congestion control jointly
utilizing delay and marking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "618--631",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926508",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Depending upon the type of feedback that is primarily
used as a congestion measure, congestion control
methods can be generally classified into two
categories: marking/loss-based or delay-based. While
both marking and queueing delay provide information
about the congestion state of a network, they have been
largely treated with separate control strategies. In
this paper, we propose the notion of the normalized
queueing delay, which serves as a congestion measure by
combining both delay and marking information. Utilizing
normalized queueing delay (NQD), we propose an approach
to congestion control that allows a source to scale its
rate dynamically to prevailing network conditions
through the use of a time-variant set-point. In ns-2
simulation studies, an NQD-enabled FAST TCP
demonstrates a significant link utilization improvement
over FAST TCP under certain conditions. In addition, we
propose another NQD-based controller D + M TCP
(Delay+Marking TCP) that achieves quick convergence to
fair and stable rates with nearly full link
utilization. Therefore, NQD is a suitable candidate as
a congestion measure for practical congestion
control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; explicit congestion notification
(ECN); high-speed networks; TCP; transport protocols;
window flow control",
}
@Article{Wu:2009:MIS,
author = "Bin Wu and Kwan L. Yeung and Mounir Hamdi and Xin Li",
title = "Minimizing internal speedup for performance guaranteed
switches with optical fabrics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "632--645",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.926501",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider traffic scheduling in an $ N \times N $
packet switch with an optical switch fabric, where the
fabric requires a reconfiguration overhead to change
its switch configurations. To provide 100\% throughput
with bounded packet delay, a speedup in the switch
fabric is necessary to compensate for both the
reconfiguration overhead and the inefficiency of the
scheduling algorithm. In order to reduce the
implementation cost of the switch, we aim at minimizing
the required speedup for a given packet delay bound.
Conventional Birkhoff-von Neumann traffic matrix
decomposition requires $ N^2 - 2 N + 2 $ configurations
in the schedule, which lead to a very large packet
delay bound. The existing DOUBLE algorithm requires a
fixed number of only $ 2 N $ configurations, but it
cannot adjust its schedule according to different
switch parameters. In this paper, we first design a
generic approach to decompose a traffic matrix into an
arbitrary number of $ N s (N^2 - 2 N + 2) > N s > N $
configurations. Then, by taking the reconfiguration
overhead into account, we formulate a speedup function.
Minimizing the speedup function results in an efficient
scheduling algorithm ADAPT. We further observe that the
algorithmic efficiency of ADAPT can be improved by
better utilizing the switch bandwidth. This leads to a
more efficient algorithm SRF (Scheduling Residue
First). ADAPT and SRF can automatically adjust the
number of configurations in a schedule according to
different switch parameters. We show that both
algorithms outperform the existing DOUBLE algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical switch fabric; performance guaranteed
switching; reconfiguration overhead; scheduling;
speedup",
}
@Article{Andrews:2009:CWA,
author = "Matthew Andrews and Lisa Zhang",
title = "Complexity of wavelength assignment in optical network
optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "646--657",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2014226",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the complexity of a set of design problems
for optical networks. Under wavelength division
multiplexing (WDM) technology, demands sharing a common
fiber are transported on distinct wavelengths. Multiple
fibers may be deployed on a physical link.\par
Our basic goal is to design networks of minimum cost,
minimum congestion and maximum throughput. This
translates to three variants in the design objectives:
(1) MIN-SUMFIBER: minimizing the total cost of fibers
deployed to carry all demands; (2) MIN-MAXFIBER:
minimizing the maximum number of fibers per link to
carry all demands; and (3) MAX-THROUGHPUT: maximizing
the carried demands using a given set of fibers.\par
We also have two variants in the design constraints:
(1) CHOOSEROUTE: Here we need to specify both a routing
path and a wavelength for each demand; (2) FIXEDROUTE:
Here we are given demand routes and we need to specify
wavelengths only. The FIXEDROUTE variant allows us to
study wavelength assignment in isolation.\par
Combining these variants, we have six design problems.
Previously we have shown that general instances of the
problems MIN-SUMFIBER-CHOOSEROUTE and
MIN-MAXFIBER-FIXEDROUTE have no constant-approximation
algorithms. In this paper, we prove that a similar
statement holds for all four other problems. Our main
result shows that MIN-SUMFIBER-FIXEDROUTE cannot be
approximated within any constant factor unless NP-hard
problems have efficient algorithms. This, together with
the previous hardness result of
MIN-MAXFIBER-FIXEDROUTE, shows that the problem of
wavelength assignment is inherently hard by
itself.\par
We also study the complexity of problems that arise
when multiple demands can be time-multiplexed onto a
single wavelength (as in time-domain wavelength
interleaved networking (TWIN) networks) and when
wavelength converters can be placed along the path of a
demand.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; hardness of approximation;
optical networking; routing and wavelength assignment",
}
@Article{Kuppuswamy:2009:AAE,
author = "Kalyan Kuppuswamy and Daniel C. Lee",
title = "An analytic approach to efficiently computing call
blocking probabilities for multiclass {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "658--670",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001465",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For all-optical WDM networks that provide multiple
classes of service, we present a methodology for
computing approximate blocking probabilities of dynamic
routing and wavelength assignment policies. Each
service class is characterized by its resource
requirements (number of wavelengths needed for a call)
and expected call holding time (or subscription
period). Under the wavelength continuity constraint on
lightpaths and loss network formulation, we develop
fixed-point approximation algorithms that compute
approximate blocking probabilities of all classes. We
then apply them to the random wavelength assignment
policy for the following wavelength routing policies:
Fixed Routing (FR), Least Loaded Routing (LLR) and
Fixed Alternate Routing (FAR). Simulation results on
different network topologies and routing policies
considered demonstrate that the simulation results
match closely with the blocking probabilities computed
by our methods for different multiclass call traffic
loading scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "blocking probability; knapsack approximation; loss
networks; multiclass fixed-point approximation; optical
WDM networks; performance evaluation",
}
@Article{Eshoul:2009:SAU,
author = "Abdelhamid E. Eshoul and Hussein T. Mouftah",
title = "Survivability approaches using $p$-cycles in {WDM}
mesh networks under static traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "2",
pages = "671--683",
month = apr,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001467",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jun 6 20:21:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The major challenge in survivable mesh networks is the
design of resource allocation algorithms that allocate
network resources efficiently while at the same time
are able to recover from a failure quickly. This issue
is particularly more challenging in optical networks
operating under wavelength continuity constraint, where
the same wavelength must be assigned on all links in
the selected path. This paper proposes two approaches
to solve the survivable routing and wavelength
assignment RWA problem under static traffic using
$p$-cycles techniques. The first is a nonjointly
approach, where the minimum backup capacity against any
single span failure is set up first. Then the working
lightpaths problem is solved by first generating the
most likely candidate routes for each source and
destination {\em s-d\/} pair. These candidate routes
are then used to formulate the overall problem as an
ILP problem. Alternatively, for a more optimum
solution, the problem can be solved jointly, where the
working routes and the backup $p$-cycles are jointly
formulated as an ILP problem to minimize the total
capacity required. Furthermore, only a subset of high
merit cycles that are most likely able to protect the
proposed working paths is used in the formulation.
Reducing the number of candidate cycles in the final
formulation plays a significant role in reducing the
number of variables required to solve the problem. To
reduce the number of candidate cycles in the
formulation, a new metric called Route Sensitive
Efficiency (RSE)--has been introduced to pre-select a
reduced number of high merit cycle candidates. The RSE
ranks each cycle based on the number of links of the
primary candidate routes that it can protect. The two
approaches were tested and their performances were
compared.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "$p$-cycles; optical networks; routing and wave-length
assignment; survivability",
}
@Article{Paschalidis:2009:STN,
author = "Ioannis Ch. Paschalidis and Georgios Smaragdakis",
title = "Spatio-temporal network anomaly detection by assessing
deviations of empirical measures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "685--697",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001468",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce an Internet traffic anomaly detection
mechanism based on large deviations results for
empirical measures. Using past traffic traces we
characterize network traffic during various time-of-day
intervals, assuming that it is anomaly-free. We present
two different approaches to characterize traffic: (i) a
model-free approach based on the method of types and
Sanov's theorem, and (ii) a model-based approach
modeling traffic using a Markov modulated process.
Using these characterizations as a reference we
continuously monitor traffic and employ large
deviations and decision theory results to 'compare' the
empirical measure of the monitored traffic with the
corresponding reference characterization, thus,
identifying traffic anomalies in real-time. Our
experimental results show that applying our methodology
(even short-lived) anomalies are identified within a
small number of observations. Throughout, we compare
the two approaches presenting their advantages and
disadvantages to identify and classify temporal network
anomalies. We also demonstrate how our framework can be
used to monitor traffic from multiple network elements
in order to identify both spatial and temporal
anomalies. We validate our techniques by analyzing real
traffic traces with time-stamped anomalies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "large deviations; Markov processes; method of types;
network security; statistical anomaly detection",
}
@Article{Hu:2009:EBA,
author = "Yan Hu and Dah-Ming Chiu and John C. S. Lui",
title = "Entropy based adaptive flow aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "698--711",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2002560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet traffic flow measurement is vitally important
for network management, accounting and performance
studies. Cisco's NetFlow is a widely deployed flow
measurement solution that uses a configurable static
sampling rate to control processor and memory usage on
the router and the amount of reporting flow records
generated. But during flooding attacks the memory and
network bandwidth consumed by flow records can increase
beyond what is available. Currently available
countermeasures have their own problems: (1) reject new
flows when the cache is full--some legitimate new flows
will not be counted; (2) export not-terminated flows to
make room for new ones--this will exhaust the export
bandwidth; and (3) adapt the sampling rate to traffic
rate--this will reduce the overall accuracy of
accounting, including legitimate flows. In this paper,
we propose an entropy based adaptive flow aggregation
algorithm. Relying on information-theoretic techniques,
the algorithm efficiently identifies the clusters of
attack flows in real time and aggregates those large
number of short attack flows into a few metaflows.
Compared to currently available solutions, our solution
not only alleviates the problem in memory and export
bandwidth, but also significantly improves the accuracy
of legitimate flows. Finally, we evaluate our system
using both synthetic trace file and real trace files
from the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data summarization; information theory; network
monitoring; traffic measurement",
}
@Article{Vishwanath:2009:SRR,
author = "Kashi Venkatesh Vishwanath and Amin Vahdat",
title = "{Swing}: realistic and responsive network traffic
generation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "712--725",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020830",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents Swing, a closed-loop,
network-responsive traffic generator that accurately
captures the packet interactions of a range of
applications using a simple structural model. Starting
from observed traffic at a single point in the network,
Swing automatically extracts distributions for user,
application, and network behavior. It then generates
live traffic corresponding to the underlying models in
a network emulation environment running commodity
network protocol stacks. We find that the generated
traffic is statistically similar to the original
traffic. Furthermore, to the best of our knowledge, we
are the first to reproduce burstiness in traffic across
a range of time-scales using a model applicable to a
variety of network settings. An initial sensitivity
analysis reveals the importance of our individual model
parameters to accurately reproduce such burstiness.
Finally, we explore Swing's ability to vary user
characteristics, application properties, and wide-area
network conditions to project traffic characteristics
into alternate scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "burstiness; modeling; structural model; traffic
generator; wavelet scaling",
}
@Article{Wang:2009:RBE,
author = "Xiaoming Wang and Zhongmei Yao and Dmitri Loguinov",
title = "Residual-based estimation of peer and link lifetimes
in {P2P} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "726--739",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001727",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Existing methods of measuring lifetimes in P2P systems
usually rely on the so-called Create-Based Method
(CBM), which divides a given observation window into
two halves and samples users 'created' in the first
half every $ \Delta $ time units until they die or the
observation period ends. Despite its frequent use, this
approach has no rigorous accuracy or overhead analysis
in the literature. To shed more light on its
performance, we first derive a model for CBM and show
that small window size or large $ \Delta $ may lead to
highly inaccurate lifetime distributions. We then show
that create-based sampling exhibits an inherent
tradeoff between overhead and accuracy, which does not
allow any fundamental improvement to the method.
Instead, we propose a completely different approach for
sampling user dynamics that keeps track of only
residual lifetimes of peers and uses a simple
renewal-process model to recover the actual lifetimes
from the observed residuals. Our analysis indicates
that for reasonably large systems, the proposed method
can reduce bandwidth consumption by several orders of
magnitude compared to prior approaches while
simultaneously achieving higher accuracy. We finish the
paper by implementing a two-tier Gnutella network
crawler equipped with the proposed sampling method and
obtain the distribution of ultrapeer lifetimes in a
network of 6.4 million users and 60 million links. Our
experimental results show that ultrapeer lifetimes are
Pareto with shape $ \alpha \approx 1.1 $; however, link
lifetimes exhibit much lighter tails with $ \alpha
\approx 1.8 $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Gnutella networks; lifetime estimation; peer-to-peer;
residual sampling",
}
@Article{Wang:2009:UTI,
author = "Feng Wang and Jian Qiu and Lixin Gao and Jia Wang",
title = "On understanding transient interdomain routing
failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "740--751",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001952",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The convergence time of the interdomain routing
protocol, BGP, can last as long as 30 minutes. Yet,
routing behavior during BGP route convergence is poorly
understood. During route convergence, an end-to-end
Internet path can experience a transient loss of
reachability. We refer to this loss of reachability as
transient routing failure. Transient routing failures
can lead to packet losses, and prolonged packet loss
bursts can make the performance of applications such as
Voice-over-IP and interactive games unacceptable. In
this paper, we study how routing failures can occur in
the Internet. With the aid of a formal model that
captures transient failures of the interdomain routing
protocol, we derive the sufficient conditions that
transient routing failures could occur. We further
study transient routing failures in typical BGP systems
where commonly used routing policies are applied.
Network administrators can apply our analysis to
improve their network performance and stability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BGP; border gateway protocol; interdomain routing;
transient routing failure",
}
@Article{Kodialam:2009:LRR,
author = "Murali Kodialam and T. V. Lakshman and Sudipta
Sengupta",
title = "Locally restorable routing of highly variable
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "752--763",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007432",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Two-phase routing, where traffic is first distributed
to intermediate nodes before being routed to the final
destination, has been recently proposed for handling
widely fluctuating traffic without the need to adapt
network routing to changing traffic. Preconfiguring the
network in a traffic independent manner using two-phase
routing simplifies network operation
considerably.\par
In this paper, we extend this routing scheme by
providing resiliency against link failures through fast
restoration along link backup detours. We view this as
important progress towards adding carrier-class
reliability to the robustness of the scheme so as to
facilitate its future deployment in Internet Service
Provider (ISP) networks. On the theoretical side, the
main contribution of the paper is the development of
linear programming based and fast combinatorial
algorithms for two-phase routing with link restoration
so as to minimize the maximum utilization of any link
in the network, or equivalently, maximize the
throughput. The algorithms developed are Fully
Polynomial Time Approximation Schemes (FPTAS)--for any
given $ \epsilon > 0 $, an FPTAS guarantees a solution
that is within a $ (1 + \epsilon)$-factor of the
optimum and runs in time polynomial in the input size
and $ 1 / \epsilon $. To the best of our knowledge,
this is the first work in the literature that considers
making the scheme resilient to link failures through
preprovisioned fast restoration mechanisms. We evaluate
the performance of link restoration (in terms of
throughput) and compare it with that of unprotected
routing. For our experiments, we use actual ISP network
topologies collected for the Rocketfuel project and
three research network topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "fast restoration; hose traffic model; link
restoration; oblivious routing; two-phase routing;
valiant load balancing; variable traffic",
}
@Article{Raghavan:2009:SPC,
author = "Barath Raghavan and Patric Verkaik and Alex C.
Snoeren",
title = "Secure and policy-compliant source routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "764--777",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007949",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In today's Internet, inter-domain route control
remains elusive; nevertheless, such control could
improve the performance, reliability, and utility of
the network for end users and ISPs alike. While
researchers have proposed a number of source routing
techniques to combat this limitation, there has thus
far been no way for independent ASes to ensure that
such traffic does not circumvent local traffic
policies, nor to accurately determine the correct party
to charge for forwarding the traffic.\par
We present Platypus, an authenticated source routing
system built around the concept of network
capabilities, which allow for accountable, fine-grained
path selection by cryptographically attesting to policy
compliance at each hop along a source route.
Capabilities can be composed to construct routes
through multiple ASes and can be delegated to third
parties. Platypus caters to the needs of both end users
and ISPs: users gain the ability to pool their
resources and select routes other than the default,
while ISPs maintain control over where, when, and whose
packets traverse their networks. We describe the design
and implementation of an extensive Platypus policy
framework that can be used to address several issues in
wide-area routing at both the edge and the core, and
evaluate its performance and security. Our results show
that incremental deployment of Platypus can achieve
immediate gains.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "authentication; capabilities; overlay networks; source
routing",
}
@Article{Chu:2009:OLW,
author = "Jian Chu and Chin-Tau Lea",
title = "Optimal link weights for {IP}-based networks
supporting hose-model {VPNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "778--788",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006219",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "From traffic engineering point of view, hose-model
VPNs are much easier to use for customers than
pipe-model VPNs. In this paper we explore the optimal
weight setting to support hose-model VPN traffic in an
IP-based hop-by-hop routing network. We try to answer
the following questions: (1) What is the maximum amount
of hose-model VPN traffic with bandwidth guarantees
that can be admitted to an IP-based hop-by-hop routing
network (as opposed to an MPLS-based network), and (2)
what is the optimal link weight setting that can
achieve that? We first present a mixed-integer
programming formulation to compute the optimal link
weights that can maximize the ingress and egress VPN
traffic admissible to a hop-by-hop routing network. We
also present a heuristic algorithm for solving the link
weight searching problem for large networks. We show
simulation results to demonstrate the effectiveness of
the search algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hose model; IP-based VPN; link weight optimization",
}
@Article{Hohn:2009:CRC,
author = "Nicolas Hohn and Konstantina Papagiannaki and Darryl
Veitch",
title = "Capturing router congestion and delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "789--802",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927258",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Using a unique monitoring experiment, we capture all
packets crossing a (lightly utilized) operational
access router from a Tier-1 provider, and use them to
provide a detailed examination of router congestion and
packet delays. The complete capture enables not just
statistics as seen from outside the router, but also an
accurate physical router model to be identified. This
enables a comprehensive examination of congestion and
delay from three points of view: the understanding of
origins, measurement, and reporting. Our study defines
new methodologies and metrics. In particular, the
traffic reporting enables a rich description of the
diversity of microcongestion behavior, without model
assumptions, and at achievable computational cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "busy period; congestion; delay; modelling; router;
utilization",
}
@Article{Lu:2009:SRS,
author = "Wencheng Lu and Sartaj Sahni",
title = "Succinct representation of static packet classifiers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "803--816",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2010594",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop algorithms for the compact representation
of the 1- and 2-dimensional tries that are used for
Internet packet classification. Our compact
representations are experimentally compared with
competing compact representations for 1- and
multi-dimensional packet classifiers and found to
simultaneously reduce the number of memory accesses
required for a lookup as well as the memory required to
store the classifier.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic programming; one- and two-dimensional tries;
packet classification; succinct representation",
}
@Article{Li:2009:RAS,
author = "Jun Li and Yiqiang Q. Zhao",
title = "Resequencing analysis of stop-and-wait {ARQ} for
parallel multichannel communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "817--830",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020820",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider a multichannel data
communication system in which the stop-and-wait
automatic-repeat-request protocol for parallel channels
with an in-sequence delivery guarantee (MSW-ARQ-inS) is
used for error control. We evaluate the resequencing
delay and the resequencing buffer occupancy,
respectively. Under the assumption that all channels
have the same transmission rate but possibly different
time-invariant error rates, we derive the probability
generating function of the resequencing buffer
occupancy and the probability mass function of the
resequencing delay. Then, by assuming the
Gilbert--Elliott model for each channel, we extend our
analysis to time-varying channels. Through examples, we
compute the probability mass functions of the
resequencing buffer occupancy and the resequencing
delay for time-invariant channels. From numerical and
simulation results, we analyze trends in the mean
resequencing buffer occupancy and the mean resequencing
delay as functions of system parameters. We expect that
the modeling technique and analytical approach used in
this paper can be applied to the performance evaluation
of other ARQ protocols (e.g., the selective-repeat ARQ)
over multiple time-varying channels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "in-sequence delivery; modeling and performance;
multichannel data communications; resequencing buffer
occupancy; resequencing delay; SW-ARQ",
}
@Article{Borrel:2009:SUS,
author = "Vincent Borrel and Franck Legendre and Marcelo {Dias
De Amorim} and Serge Fdida",
title = "{SIMPS}: using sociology for personal mobility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "831--842",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2003337",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Assessing mobility in a thorough fashion is a crucial
step toward more efficient mobile network design.
Recent research on mobility has focused on two main
points: analyzing models and studying their impact on
data transport. These works investigate the
consequences of mobility. In this paper, instead, we
focus on the causes of mobility. Starting from
established research in sociology, we propose SIMPS, a
mobility model of human crowds with pedestrian motion.
This model defines a process called sociostation,
rendered by two complimentary behaviors, namely
socialize and isolate, that regulate an individual with
regard to her/his own sociability level. SIMPS leads to
results that agree with scaling laws observed both in
small-scale and large-scale human motion. Although our
model defines only two simple individual behaviors, we
observe many emerging collective behaviors (group
formation/splitting, path formation, and evolution).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobility modeling; self-organized networks; social
networks; sociology",
}
@Article{Ganeriwal:2009:ECU,
author = "Saurabh Ganeriwal and Ilias Tsigkogiannis and Hohyun
Shim and Vlassios Tsiatsis and Mani B. Srivastava and
Deepak Ganesan",
title = "Estimating clock uncertainty for efficient
duty-cycling in sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "843--856",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001953",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio duty cycling has received significant attention
in sensor networking literature, particularly in the
form of protocols for medium access control and
topology management. While many protocols have claimed
to achieve significant duty-cycling benefits in theory
and simulation, these benefits have often not
translated into practice. The dominant factor that
prevents the optimal usage of the radio in real
deployment settings is time uncertainty between sensor
nodes which results in overhead in the form of long
packet preambles, guard bands, and excessive control
packets for synchronization. This paper proposes an
uncertainty-driven approach to duty-cycling, where a
model of long-term clock drift is used to minimize the
duty-cycling overhead. First, we use long-term
empirical measurements to evaluate and analyze in-depth
the interplay between three key parameters that
influence long-term synchronization: synchronization
rate, history of past synchronization beacons, and the
estimation scheme. Second, we use this
measurement-based study to design a rate-adaptive,
energy-efficient long-term time synchronization
algorithm that can adapt to changing clock drift and
environmental conditions, while achieving
application-specific precision with very high
probability. Finally, we integrate our
uncertainty-driven time synchronization scheme with the
BMAC medium access control protocol, and demonstrate
one to two orders of magnitude reduction in
transmission energy consumption with negligible impact
on packet loss rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "medium access control; time synchronization; wireless
sensor networks",
}
@Article{Kwon:2009:ASP,
author = "Sungoh Kwon and Ness B. Shroff",
title = "Analysis of shortest path routing for large multi-hop
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "857--869",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2002222",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we analyze the impact of straight line
routing in large homogeneous multi-hop wireless
networks. We estimate the nodal load, which is defined
as the number of packets served at a node, induced by
straight line routing. For a given total offered load
on the network, our analysis shows that the nodal load
at each node is a function of the node's Voronoi cell,
the node's location in the network, and the traffic
pattern specified by the source and destination
randomness and straight line routing. In the asymptotic
regime, we show that each node's probability that the
node serves a packet arriving to the network approaches
the products of half the length of the Voronoi cell
perimeter and the load density function that a packet
goes through the node's location. The density function
depends on the traffic pattern generated by straight
line routing, and determines where the hot spot is
created in the network. Hence, contrary to conventional
wisdom, straight line routing can balance the load over
the network, depending on the traffic patterns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "analysis; geometric probability; multi-hop wireless
network; routing; simulations",
}
@Article{Djukic:2009:DAL,
author = "Petar Djukic and Shahrokh Valaee",
title = "Delay aware link scheduling for multi-hop {TDMA}
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "870--883",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2005219",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Time division multiple access (TDMA) based medium
access control (MAC) protocols can provide QoS with
guaranteed access to the wireless channel. However, in
multi-hop wireless networks, these protocols may
introduce scheduling delay if, on the same path, an
outbound link on a router is scheduled to transmit
before an inbound link on that router. The total
scheduling delay can be quite large since it
accumulates at every hop on a path. This paper presents
a method that finds conflict-free TDMA schedules with
minimum scheduling delay.\par
We show that the scheduling delay can be interpreted as
a cost, in terms of transmission order of the links,
collected over a cycle in the conflict graph. We use
this observation to formulate an optimization, which
finds a transmission order with the min-max delay
across a set of multiple paths. The min-max delay
optimization is NP-complete since the transmission
order of links is a vector of binary integer variables.
We devise an algorithm that finds the transmission
order with the minimum delay on overlay tree topologies
and use it with a modified Bellman-Ford algorithm, to
find minimum delay schedules in polynomial time. The
simulation results in 802.16 mesh networks confirm that
the proposed algorithm can find effective min-max delay
schedules.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "scheduling delay; stop-and-go queueing; TDMA
scheduling algorithms",
}
@Article{Cicconetti:2009:FBA,
author = "Claudio Cicconetti and Ian F. Akyildiz and Luciano
Lenzini",
title = "{FEBA}: a bandwidth allocation algorithm for service
differentiation in {IEEE 802.16} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "884--897",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2005221",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless mesh networks, the end-to-end throughput
of traffic flows depends on the path length, i.e., the
higher the number of hops, the lower becomes the
throughput. In this paper, a fair end-to-end bandwidth
allocation (FEBA) algorithm is introduced to solve this
problem. FEBA is implemented at the medium access
control (MAC) layer of single-radio, multiple channels
IEEE 802.16 mesh nodes, operated in a distributed
coordinated scheduling mode. FEBA negotiates bandwidth
among neighbors to assign a fair share proportional to
a specified weight to each end-to-end traffic flow.
This way traffic flows are served in a differentiated
manner, with higher priority traffic flows being
allocated more bandwidth on the average than the lower
priority traffic flows. In fact, a node requests/grants
bandwidth from/to its neighbors in a round-robin
fashion where the amount of service depends on both the
load on its different links and the priority of
currently active traffic flows. If multiple channels
are available, they are all shared evenly in order to
increase the network capacity due to frequency reuse.
The performance of FEBA is evaluated by extensive
simulations. It is shown that wireless resources are
shared fairly among best-effort traffic flows, while
multimedia streams are provided with a differentiated
service that enables quality of service.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access protocols; packet reservation multiaccess;
scheduling; wireless LAN",
}
@Article{Zafer:2009:CAE,
author = "Murtaza A. Zafer and Eytan Modiano",
title = "A calculus approach to energy-efficient data
transmission with quality-of-service constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "898--911",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020831",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Transmission rate adaptation in wireless devices
provides a unique opportunity to trade off data service
rate with energy consumption. In this paper, we study
optimal rate control to minimize transmission energy
expenditure subject to strict deadline or other
quality-of-service (QoS) constraints. Specifically, the
system consists of a wireless transmitter with
controllable transmission rate and with strict QoS
constraints on data transmission. The goal is to obtain
a rate-control policy that minimizes the total
transmission energy expenditure while ensuring that the
QoS constraints are met. Using a novel formulation
based on cumulative curves methodology, we obtain the
optimal transmission policy and show that it has a
simple and appealing graphical visualization. Utilizing
the optimal 'offline' results, we then develop an
online transmission policy for an arbitrary stream of
packet arrivals and deadline constraints, and show, via
simulations, that it is significantly more
energy-efficient than a simple head-of-line drain
policy. Finally, we generalize the optimal policy
results to the case of time-varying power-rate
functions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay; energy; network calculus; quality of service
(QoS); rate control; wireless",
}
@Article{Tan:2009:ERT,
author = "Chee Wei Tan and Daniel P. Palomar and Mung Chiang",
title = "Energy-robustness tradeoff in cellular network power
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "912--925",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2003336",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the seminal paper by Foschini and Miljanic in 1993,
a distributed power control algorithm was developed to
meet SIR targets with minimal powers in cellular
network uplinks. Since the SIR on an active link may
dip below the SIR target during the transient after a
new user enters the cell, Bambos et al. proposed an
active link protection algorithm to provide robustness,
at the expense of higher energy consumption. This paper
examines the tradeoff between energy and robustness. An
optimization problem is formulated where robustness is
captured in the constraint and the price of robustness
penalized in the objective function. A distributed
algorithm is developed to solve this problem. Local
convergence and optimality of equilibrium are proved
for the algorithm. The objective function modulates the
tradeoff between energy and robustness, and between
energy and speed of admission, as illustrated through a
series of numerical experiments. A parameterized family
of objective functions is constructed to control the
transient and equilibrium properties of robust
distributed power control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed optimization; duality; power control;
wireless networks",
}
@Article{Choi:2009:RAO,
author = "Kae Won Choi and Wha Sook Jeon and Dong Geun Jeong",
title = "Resource allocation in {OFDMA} wireless communications
systems supporting multimedia services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "926--935",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001470",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We design a resource allocation algorithm for
down-link of orthogonal frequency division multiple
access (OFDMA) systems supporting real-time (RT) and
best-effort (BE) services simultaneously over a
time-varying wireless channel. The proposed algorithm
aims at maximizing system throughput while satisfying
quality of service (QoS) requirements of the RT and BE
services. We take two kinds of QoS requirements into
account. One is the required average transmission rate
for both RT and BE services. The other is the tolerable
average absolute deviation of transmission rate (AADTR)
just for the RT services, which is used to control the
fluctuation in transmission rates and to limit the RT
packet delay to a moderate level. We formulate the
optimization problem representing the resource
allocation under consideration and solve it by using
the dual optimization technique and the projection
stochastic subgradient method. Simulation results show
that the proposed algorithm well meets the QoS
requirements with the high throughput and outperforms
the modified largest weighted delay first (M-LWDF)
algorithm that supports similar QoS requirements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multimedia communications; orthogonal frequency
division multiple access (OFDMA); quality of service
(QoS); radio resource allocation; wireless network",
}
@Article{Ma:2009:AGS,
author = "Richard T. B. Ma and Vishal Misra and Dan Rubenstein",
title = "An analysis of generalized slotted-{Aloha} protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "936--949",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.925633",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Aloha and its slotted variation are commonly deployed
Medium Access Control (MAC) protocols in environments
where multiple transmitting devices compete for a
medium, yet may have difficulty sensing each other's
presence (the 'hidden terminal problem'). Competing
802.11 gateways, as well as most modern digital
cellular systems, like GSM, are examples. This paper
models and evaluates the throughput that can be
achieved in a system where nodes compete for bandwidth
using a generalized version of slotted-Aloha protocols.
The protocol is implemented as a two-state system,
where the probability that a node transmits in a given
slot depends on whether the node's prior transmission
attempt was successful. Using Markov Models, we
evaluate the channel utilization and fairness of this
class of protocols for a variety of node objectives,
including maximizing aggregate throughput of the
channel, each node selfishly maximizing its own
throughput, and attacker nodes attempting to jam the
channel. If all nodes are selfish and strategically
attempt to maximize their own throughput, a situation
similar to the traditional Prisoner's Dilemma arises.
Our results reveal that under heavy loads, a greedy
strategy reduces the utilization, and that attackers
cannot do much better than attacking during randomly
selected slots.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MAC protocols; Markovian decision; Prisoner's Dilemma;
short-term fairness; slotted-Aloha; Stackelberg game",
}
@Article{Li:2009:MCW,
author = "Xiang-Yang Li",
title = "Multicast capacity of wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "950--961",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927256",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Assume that $n$ wireless nodes are uniformly randomly
deployed in a square region with side-length $a$ and
all nodes have the uniform transmission range $r$ and
uniform interference range $ R > r$. We further assume
that each wireless node can transmit (or receive) at
$W$ bits/second over a common wireless channel. For
each node $ v_i$, we randomly and independently pick $
k 1$ points $ p_{i, j} (1 \leq j \leq k - 1)$ from the
square, and then multicast data to the nearest node for
each $ p_{i, j}$. We derive matching asymptotic upper
bounds and lower bounds on multicast capacity of random
wireless networks. Under protocol interference model,
when $ a^2 / r^2 = O (n / \log (n))$, we show that the
total multicast capacity is $ \Theta (\sqrt n / \log n
c (W / \sqrt k))$ when $ k = O(n / \log n)$; the total
multicast capacity is $ \Theta (W)$ when $ k = \Omega
(n / \log n)$. We also study the capacity of
group-multicast for wireless networks where for each
source node, we randomly select $ k - 1$ groups of
nodes as receivers and the nodes in each group are
within a constant hops from the group leader. The same
asymptotic upper bounds and lower bounds still hold. We
also extend our capacity bounds to $d$-dimensional
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadcast; capacity; multicast; optimization;
scheduling; unicast; VC-dimension; wireless ad hoc
networks",
}
@Article{Lai:2009:TBA,
author = "Yuan-Cheng Lai and Chih-Chung Lin",
title = "Two blocking algorithms on adaptive binary splitting:
single and pair resolutions for {RFID} tag
identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "962--975",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2002558",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In radio frequency identification (RFID) systems, the
reader identifies tags through communication over a
shared wireless channel. When multiple tags transmit
their IDs simultaneously, their signals collide,
increasing the identification delay. Therefore, many
previous anti-collision algorithms, including an
adaptive query splitting algorithm (AQS) and an
adaptive binary splitting algorithm (ABS), focused on
solving this problem. This paper proposes two blocking
algorithms, a single resolution blocking ABS algorithm
(SRB) and a pair resolution blocking ABS algorithm
(PRB), based on ABS. SRB not only inherits the essence
of ABS which uses the information of recognized tags
obtained from the last process of tag identification,
but also adopts a blocking technique which prevents
recognized tags from being collided by unrecognized
tags. PRB further adopts a pair resolution technique
which couples recognized tags and thus only needs half
time for next identifying these recognized tags. We
formally analyze the performance of SRB and PRB.
Finally, the analytic and simulation results show that
SRB slightly outperforms ABS and PRB significantly
surpasses ABS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anti-collision; blocking algorithm; RFID; tag
identification",
}
@Article{Ross:2009:PCS,
author = "Kevin Ross and Nicholas Bambos",
title = "Projective cone scheduling {(PCS)} algorithms for
packet switches of maximal throughput",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "976--989",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2002557",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the (generalized) packet switch scheduling
problem, where service configurations are dynamically
chosen in response to queue backlogs, so as to maximize
the throughput without any knowledge of the long term
traffic load. Service configurations and traffic traces
are arbitrary.\par
First, we identify a rich class of throughput-optimal
linear controls, which choose the service configuration
$S$ maximizing the projection $ \langle S, B X \rangle
$ when the backlog is $X$. The matrix $B$ is
arbitrarily fixed in the class of positive-definite,
symmetric matrices with negative or zero off-diagonal
elements. In contrast, positive off-diagonal elements
may drive the system unstable, even for subcritical
loads. The associated rich Euclidian geometry of
projective cones is explored (hence the name projective
cone scheduling PCS). The maximum-weight-matching (MWM)
rule is seen to be a special case, where $B$ is the
identity matrix.\par
Second, we extend the class of throughput maximizing
controls by identifying a tracking condition which
allows applying PCS with any bounded time-lag without
compromising throughput. It enables asynchronous or
delayed PCS implementations and various examples are
discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cone scheduling; maximal throughput; packet switch;
queueing network; stability",
}
@Article{Ngo:2009:RNW,
author = "Hung Q. Ngo and Yang Wang and Dazhen Pan",
title = "Rearrangeable and nonblocking $ [w, f]$-distributors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "990--1001",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2001728",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We formulate a graph model called $ [w,
f]$-distributors which is useful in analyzing the
structures and comparing the quantitative complexities
and qualitative features of optical multicast
cross-connects. Using the formulation we show that two
strictly nonblocking multicast optical cross-connects
under two different request models are equivalent
topologically, even though one request model is much
less restrictive than the other. We then investigate
the tradeoff between the depth and the complexity of an
optical multicast cross-connect using the graph model.
Upper and lower complexity bounds are proved. In the
process, we also give a generic recursive construction
that can be used to construct optimal and near-optimal
$ [w, f]$-distributors. The recursive construction can
also be used to construct cost-effective optical
multicast cross-connects. Another important result that
follows is the exact asymptotic behavior of the size of
optimal $ [w, f]$-connectors, the unicast version of $
[w, f]$-distributors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "complexity; distributors; multicast; optimal
connectors; WDM optical cross-connects",
}
@Article{VanMeter:2009:SDL,
author = "Rodney {Van Meter} and Thaddeus D. Ladd and W. J.
Munro and Kae Nemoto",
title = "System design for a long-line quantum repeater",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "1002--1013",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.927260",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a new control algorithm and system design
for a network of quantum repeaters, and outline the
end-to-end protocol architecture. Such a network will
create long-distance quantum states, supporting quantum
key distribution as well as distributed quantum
computation. Quantum repeaters improve the reduction of
quantum-communication throughput with distance from
exponential to polynomial. Because a quantum state
cannot be copied, a quantum repeater is not a signal
amplifier. Rather, it executes algorithms for quantum
teleportation in conjunction with a specialized type of
quantum error correction called purification to raise
the fidelity of the quantum states. We introduce our
banded purification scheme, which is especially
effective when the fidelity of coupled qubits is low,
improving the prospects for experimental realization of
such systems. The resulting throughput is calculated
via detailed simulations of a long line composed of
shorter hops. Our algorithmic improvements increase
throughput by a factor of up to 50 compared to earlier
approaches, for a broad range of physical
characteristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "purification; quantum information; quantum networking;
quantum repeaters; resource scheduling",
}
@Article{Turner:2009:SPG,
author = "Jonathan S. Turner",
title = "Strong performance guarantees for asynchronous
buffered crossbar scheduler",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1017--1028",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006221",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Crossbar-based switches are commonly used to implement
routers with throughputs up to about 1 Tb/s. The advent
of crossbar scheduling algorithms that provide strong
performance guarantees now makes it possible to
engineer systems that perform well, even under extreme
traffic conditions. Until recently, such performance
guarantees have only been developed for crossbars that
switch cells rather than variable length packets.
Cell-based crossbars incur a worst-case bandwidth
penalty of up to a factor of two, since they must
fragment variable length packets into fixed length
cells. In addition, schedulers for cell-based crossbars
may fail to deliver the expected performance guarantees
when used in routers that forward packets. We show how
to obtain performance guarantees for asynchronous
crossbars that are directly comparable to those
previously developed for synchronous, cell-based
crossbars. In particular we define derivatives of the
Group by Virtual Output Queue (GVOQ) scheduler of
Chuang et al. and the Least Occupied Output First
Scheduler of Krishna et al. and show that both can
provide strong performance guarantees in systems with
speedup 2. Specifically, we show that these schedulers
are work-conserving and that they can emulate an
output-queued switch using any queueing discipline in
the class of restricted Push-In, First-Out queueing
disciplines. We also show that there are schedulers for
segment-based crossbars, (introduced recently by
Katevenis and Passas) that can deliver strong
performance guarantees with small buffer requirements
and no bandwidth fragmentation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asynchronous crossbars; crossbar schedulers;
performance guarantees; routers; switches",
}
@Article{Agrawal:2009:HBN,
author = "Banit Agrawal and Timothy Sherwood",
title = "High-bandwidth network memory system through virtual
pipelines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1029--1041",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008646",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As network bandwidth increases, designing an effective
memory system for network processors becomes a
significant challenge. The size of the routing tables,
the complexity of the packet classification rules, and
the amount of packet buffering required all continue to
grow at a staggering rate. Simply relying on large,
fast SRAMs alone is not likely to be scalable or
cost-effective. Instead, trends point to the use of
low-cost commodity DRAM devices as a means to deliver
the worst-case memory performance that network
data-plane algorithms demand. While DRAMs can deliver a
great deal of throughput, the problem is that memory
banking significantly complicates the worst-case
analysis, and specialized algorithms are needed to
ensure that specific types of access patterns are
conflict-free.\par
We introduce virtually pipelined memory, an
architectural technique that efficiently supports high
bandwidth, uniform latency memory accesses, and
high-confidence throughput even under adversarial
conditions. Virtual pipelining provides a
simple-to-analyze programming model of a deep pipeline
(deterministic latencies) with a completely different
physical implementation (a memory system with banks and
probabilistic mapping). This allows designers to
effectively decouple the analysis of their algorithms
and data structures from the analysis of the memory
buses and banks. Unlike specialized hardware customized
for a specific data-plane algorithm, our system makes
no assumption about the memory access patterns. We
present a mathematical argument for our system's
ability to provably provide bandwidth with high
confidence and demonstrate its functionality and area
overhead through a synthesizable design. We further
show that, even though our scheme is general purpose to
support new applications such as packet reassembly, it
outperforms the state-of-the-art in specialized packet
buffering architectures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bank conflicts; DRAM; mean time to stall; memory;
memory controller; MTS; network; packet buffering;
packet reassembly; universal hashing; virtual pipeline;
VPNM",
}
@Article{Menth:2009:SMS,
author = "Michael Menth and Andreas Binzenh{\"o}fer and Stefan
M{\"u}hleck",
title = "Source models for speech traffic revisited",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1042--1051",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006222",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we analyze packet traces of widely used
voice codecs and present analytical source models which
describe their output by stochastic processes. Both the
G.711 and the G.729.1 codec yield periodic packet
streams with a fixed packet size, the G.723.1 as well
as the iLBC codec use silence detection leading to an
on/off process, and the GSM AMR and the iSAC codec
produce periodic packet streams with variable packet
sizes. We apply all codecs to a large set of typical
speech samples and analyze the output of the codecs
statistically. Based on these evaluations we provide
quantitative models using standard and modified on/off
processes as well as memory Markov chains. Our models
are simple and easy to use. They are in good accordance
with the original traces as they capture not only the
complementary cumulative distribution function (CCDF)
of the on/off phase durations and the packet sizes, but
also the autocorrelation function (ACF) of consecutive
packet sizes as well as the queueing properties of the
original traces. In contrast, voice traffic models used
in most of today's simulations or analytical studies
fail to reproduce the ACF and the queueing properties
of original traces. This possibly leads to
underestimation of performance measures like the
waiting time or loss probabilities. The models proposed
in this paper do not suffer from this shortcoming and
present an attractive alternative for use in future
performance studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "correlation; queueing behavior; traffic models; voice
codecs",
}
@Article{Magharei:2009:PPP,
author = "Nazanin Magharei and Reza Rejaie",
title = "{PRIME}: peer-to-peer receiver-driven mesh-based
streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1052--1065",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007434",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The success of file swarming mechanisms such as
BitTorrent has motivated a new approach for scalable
streaming of live content that we call mesh-based
Peer-to-Peer (P2P) streaming. In this approach,
participating end-systems (or peers) form a randomly
connected mesh and incorporate swarming content
delivery to stream live content. Despite the growing
popularity of this approach, neither the fundamental
design tradeoffs nor the basic performance bottlenecks
in mesh-based P2P streaming are well understood.\par
In this paper, we follow a performance-driven approach
to design PRIME, a scalable mesh-based P2P streaming
mechanism for live content. The main design goal of
PRIME is to minimize two performance bottlenecks,
namely bandwidth bottleneck and content bottleneck. We
show that the global pattern of delivery for each
segment of live content should consist of a diffusion
phase which is followed by a swarming phase. This leads
to effective utilization of available resources to
accommodate scalability and also minimizes content
bottleneck. Using packet level simulations, we
carefully examine the impact of overlay connectivity,
packet scheduling scheme at individual peers and source
behavior on the overall performance of the system. Our
results reveal fundamental design tradeoffs of
mesh-based P2P streaming for live content.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "communication systems; computer networks; Internet;
multimedia communication; multimedia systems",
}
@Article{Sivaraman:2009:PPS,
author = "Vijay Sivaraman and Hossam Elgindy and David Moreland
and Diethelm Ostry",
title = "Packet pacing in small buffer optical packet switched
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1066--1079",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2005622",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the absence of a cost-effective technology for
storing optical signals, emerging optical packet
switched (OPS) networks are expected to have severely
limited buffering capability. To mitigate the
performance degradation resulting from small buffers,
this paper proposes that optical edge nodes 'pace' the
injection of traffic into the OPS core. Our
contributions relating to pacing in OPS networks are
three-fold: first, we develop real-time pacing
algorithms of poly-logarithmic complexity that are
feasible for practical implementation in emerging
high-speed OPS networks. Second, we provide an
analytical quantification of the benefits of pacing in
reducing traffic burstiness and traffic loss at a link
with very small buffers. Third, we show via simulations
of realistic network topologies that pacing can
significantly reduce network losses at the expense of a
small and bounded increase in end-to-end delay for
real-time traffic flows. We argue that the loss-delay
tradeoff mechanism provided by pacing can be
instrumental in overcoming the performance hurdle
arising from the scarcity of buffers in OPS networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "optical packet switch; small buffers; traffic
burstiness; traffic pacing",
}
@Article{Ahuja:2009:SLF,
author = "Satyajeet S. Ahuja and Srinivasan Ramasubramanian and
Marwan M. Krunz",
title = "Single-link failure detection in all-optical networks
using monitoring cycles and paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1080--1093",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008000",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of fault
localization in all-optical networks. We introduce the
concept of monitoring cycles (MCs) and monitoring paths
(MPs) for unique identification of single-link
failures. MCs and MPs are required to pass through one
or more monitoring locations. They are constructed such
that any single-link failure results in the failure of
a unique combination of MCs and MPs that pass through
the monitoring location(s). For a network with only one
monitoring location, we prove that three-edge
connectivity is a necessary and sufficient condition
for constructing MCs that uniquely identify any
single-link failure in the network. For this case, we
formulate the problem of constructing MCs as an integer
linear program (ILP). We also develop heuristic
approaches for constructing MCs in the presence of one
or more monitoring locations. For an arbitrary network
(not necessarily three-edge connected), we describe a
fault localization technique that uses both MPs and MCs
and that employs multiple monitoring locations. We also
provide a linear-time algorithm to compute the minimum
number of required monitoring locations. Through
extensive simulations, we demonstrate the effectiveness
of the proposed monitoring technique.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "all-optical networks; fault localization",
}
@Article{Sarkar:2009:HWO,
author = "Suman Sarkar and Hong-Hsu Yen and Sudhir Dixit and
Biswanath Mukherjee",
title = "Hybrid wireless-optical broadband access network
{(WOBAN)}: network planning using {Lagrangean}
relaxation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1094--1105",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008692",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The concept of a hybrid wireless-optical broadband
access network (WOBAN) is a very attractive one. This
is because it may be costly in several situations to
run fiber to every home (or equivalent end-user
premises) from the telecom central office (CO); also,
providing wireless access from the CO to every end user
may not be possible because of limited spectrum. Thus,
running fiber as far as possible from the CO toward the
end user and then having wireless access technologies
take over may be an excellent compromise. How far
should fiber penetrate before wireless takes over is an
interesting engineering design and optimization
problem, which we address in this paper. We propose and
investigate the characteristics of an analytical model
for network planning, namely optimum placements of base
stations (BSs) and optical network units (ONUs) in
aWOBAN (called the primal model, or PM). We develop
several constraints to be satisfied: BS and ONU
installation constraints, user assignment constraints,
channel assignment constraints, capacity constraints,
and signal-quality and interference constraints. To
solve this PM with reasonable accuracy, we use
'Lagrangean relaxation' to obtain the corresponding
'Lagrangean dual' model. We solve this dual problem to
obtain a lower bound (LB) of the primal problem. We
also develop an algorithm (called the primal algorithm)
to solve the PM to obtain an upper bound (UB). Via
simulation, we compare this PM to a placement heuristic
(called the cellular heuristic) and verify that the
placement problem is quite sensitive to a set of chosen
metrics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadband access; duality gap; Lagrangean relaxation;
network planning; optical network; primal model (PM);
wireless network",
}
@Article{Li:2009:ACW,
author = "Pan Li and Chi Zhang and Yuguang Fang",
title = "Asymptotic connectivity in wireless ad hoc networks
using directional antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1106--1117",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006224",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Connectivity is a crucial issue in wireless ad hoc
networks (WANETs). Gupta and Kumar have shown that in
WANETs using omnidirectional antennas, the critical
transmission range to achieve asymptotic connectivity
is $ O(\sqrt {\log n} / n) $ if $n$ nodes are uniformly
and independently distributed in a disk of unit area.
In this paper, we investigate the connectivity problem
when directional antennas are used. We first assume
that each node in the network randomly beamforms in one
beam direction. We find that there also exists a
critical transmission range for a WANET to achieve
asymptotic connectivity, which corresponds to a
critical transmission power (CTP). Since CTP is
dependent on the directional antenna pattern, the
number of beams, and the propagation environment, we
then formulate a non-linear programming problem to
minimize the CTP. We show that when directional
antennas use the optimal antenna pattern, the CTP in a
WANET using directional antennas at both transmitter
and receiver is smaller than that when either
transmitter or receiver uses directional antenna and is
further smaller than that when only omnidirectional
antennas are used. Moreover, we revisit the
connectivity problem assuming that two neighboring
nodes using directional antennas can be guaranteed to
beamform to each other to carry out the transmission. A
smaller critical transmission range than that in the
previous case is found, which implies smaller CTP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "asymptotic connectivity; critical transmission power;
critical transmission range; directional antenna;
wireless ad hoc networks",
}
@Article{Jindal:2009:ARR,
author = "Apoorva Jindal and Konstantinos Psounis",
title = "The achievable rate region of 802.11-scheduled
multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1118--1131",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007844",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we characterize the achievable rate
region for any IEEE 802.11-scheduled static multihop
network. To do so, we first characterize the achievable
edge-rate region, that is, the set of edge rates that
are achievable on the given topology. This requires a
careful consideration of the interdependence among
edges since neighboring edges collide with and affect
the idle time perceived by the edge under study. We
approach this problem in two steps. First, we consider
two-edge topologies and study the fundamental ways they
interact. Then, we consider arbitrary multihop
topologies, compute the effect that each neighboring
edge has on the edge under study in isolation, and
combine to get the aggregate effect. We then use the
characterization of the achievable edge-rate region to
characterize the achievable rate region. We verify the
accuracy of our analysis by comparing the achievable
rate region derived from simulations with the one
derived analytically. We make a couple of interesting
and somewhat surprising observations while deriving the
rate regions. First, the achievable rate region with
802.11 scheduling is not necessarily convex. Second,
the performance of 802.11 is surprisingly good. For
example, in all the topologies used for model
verification, the max-min allocation under 802.11 is at
least 64\% of the max-min allocation under a perfect
scheduler.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity region; IEEE 802.11; multihop networks",
}
@Article{Joo:2009:UCR,
author = "Changhee Joo and Xiaojun Lin and Ness B. Shroff",
title = "Understanding the capacity region of the {Greedy}
maximal scheduling algorithm in multihop wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1132--1145",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026276",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we characterize the performance of an
important class of scheduling schemes, called greedy
maximal scheduling (GMS), for multihop wireless
networks. While a lower bound on the throughput
performance of GMS has been well known, empirical
observations suggest that it is quite loose and that
the performance of GMS is often close to optimal. In
this paper, we provide a number of new analytic results
characterizing the performance limits of GMS. We first
provide an equivalent characterization of the
efficiency ratio of GMS through a topological property
called the local-pooling factor of the network graph.
We then develop an iterative procedure to estimate the
local-pooling factor under a large class of network
topologies and interference models. We use these
results to study the worst-case efficiency ratio of GMS
on two classes of network topologies. We show how these
results can be applied to tree networks to prove that
GMS achieves the full capacity region in tree networks
under the $K$-hop interference model. Then, we show
that the worst-case efficiency ratio of GMS in
geometric unit-disk graphs is between 1/6 and 1/3.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity region; communication systems; greedy maximal
scheduling (GMS); longest queue first; multihop
wireless networks",
}
@Article{Neely:2009:DAM,
author = "Michael J. Neely",
title = "Delay analysis for maximal scheduling with flow
control in wireless networks with bursty traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1146--1159",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008232",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the delay properties of one-hop networks
with general interference constraints and multiple
traffic streams with time-correlated arrivals. We first
treat the case when arrivals are modulated by
independent finite state Markov chains. We show that
the well known maximal scheduling algorithm achieves
average delay that grows at most logarithmically in the
largest number of interferers at any link. Further, in
the important special case when each Markov process has
at most two states (such as bursty ON/OFF sources), we
prove that average delay is independent of the number
of nodes and links in the network, and hence is
order-optimal. We provide tight delay bounds in terms
of the individual auto-correlation parameters of the
traffic sources. These are perhaps the first
order-optimal delay results for controlled queueing
networks that explicitly account for such statistical
information. Our analysis treats cases both with and
without flow control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "flow control; Markov chains; queueing analysis",
}
@Article{Bahl:2009:OUC,
author = "Paramvir Bahl and Ranveer Chandra and Patrick P. C.
Lee and Vishal Misra and Jitendra Padhye and Dan
Rubenstein and Yan Yu",
title = "Opportunistic use of client repeaters to improve
performance of {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1160--1171",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026414",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Currently deployed IEEE 802.11 WLANs (Wi-Fi networks)
share access point (AP) bandwidth on a per-packet
basis. However, various stations communicating with the
AP often have different signal qualities, resulting in
different transmission rates. This induces a phenomenon
known as the rate anomaly problem, in which stations
with lower signal quality transmit at lower rates and
consume a significant majority of airtime, thereby
dramatically reducing the throughput of stations
transmitting at higher rates.\par
We propose SoftRepeater, a practical, deployable system
in which stations cooperatively address the rate
anomaly problem. Specifically, higher rate Wi-Fi
stations opportunistically transform themselves into
repeaters for lower rate stations when transmitting
data to/from the AP. The key challenge is to determine
when it is beneficial to enable the repeater
functionality. In view of this, we propose an
initiation protocol that ensures that repeater
functionality is enabled only when appropriate. Also,
our system can run directly on top of today's 802.11
infrastructure networks. In addition, we describe a
novel, zero-overhead network coding scheme that further
alleviates undesirable symptoms of the rate anomaly
problem. Using simulation and testbed implementation,
we find that SoftRepeater can improve cumulative
throughput by up to 200\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "IEEE 802.11; rate anomaly; wireless",
}
@Article{Kim:2009:AAA,
author = "Kyu-Han Kim and Kang G. Shin",
title = "On accurate and asymmetry-aware measurement of link
quality in wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1172--1185",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008001",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a highly efficient and accurate
link-quality measurement framework, called Efficient
and Accurate link-quality monitoR (EAR), for multihop
wireless mesh networks (WMNs) that has several salient
features. First, it exploits three complementary
measurement schemes: passive, cooperative, and active
monitoring. By adopting one of these schemes
dynamically and adaptively, EAR maximizes the
measurement accuracy, and its opportunistic use of the
unicast application traffic present in the network
minimizes the measurement overhead. Second, EAR
effectively identifies the existence of wireless link
asymmetry by measuring the quality of each link in both
directions of the link, thus improving the utilization
of network capacity by up to 114\%. Finally, its
cross-layer architecture across both the network layer
and the IEEE 802.11-based device driver makes EAR
easily deployable in existing multihop wireless mesh
networks without system recompilation or MAC firmware
modification. EAR has been evaluated extensively via
both ns-2-based simulation and experimentation on our
Linux-based implementation in a real-life testbed. Both
simulation and experimentation results have shown EAR
to provide highly accurate link-quality measurements
with minimum overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed systems; link asymmetry; measurement;
wireless link quality; wireless mesh networks (WMNs)",
}
@Article{Vuran:2009:ECW,
author = "Mehmet C. Vuran and Ian F. Akyildiz",
title = "Error control in wireless sensor networks: a cross
layer analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1186--1199",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2009971",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Error control is of significant importance for
Wireless Sensor Networks (WSNs) because of their severe
energy constraints and the low power communication
requirements. In this paper, a cross-layer methodology
for the analysis of error control schemes in WSNs is
presented such that the effects of multi-hop routing
and the broadcast nature of the wireless channel are
investigated. More specifically, the cross-layer
effects of routing, medium access, and physical layers
are considered. This analysis enables a comprehensive
comparison of forward error correction (FEC) codes,
automatic repeat request (ARQ), and hybrid ARQ schemes
in WSNs. The validation results show that the developed
framework closely follows simulation
results.\par
Hybrid ARQ and FEC schemes improve the error resiliency
of communication compared to ARQ. In a multi-hop
network, this improvement can be exploited by
constructing longer hops (hop length extension), which
can be achieved through channel-aware routing
protocols, or by reducing the transmit power (transmit
power control). The results of our analysis reveal that
for hybrid ARQ schemes and certain FEC codes, the hop
length extension decreases both the energy consumption
and the end-to-end latency subject to a target packet
error rate (PER) compared to ARQ. This decrease in
end-to-end latency is crucial for delay sensitive,
real-time applications, where both hybrid ARQ and FEC
codes are strong candidates. We also show that the
advantages of FEC codes are even more pronounced as the
network density increases. On the other hand, transmit
power control results in significant savings in energy
consumption at the cost of increased latency for
certain FEC codes. The results of our analysis also
indicate the cases where ARQ outperforms FEC codes for
various end-to-end distance and target PER values.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "automatic repeat request; cross layer analysis; energy
consumption; forward error correction; hybrid ARQ;
latency; wireless sensor networks",
}
@Article{Sengupta:2009:EFD,
author = "Shamik Sengupta and Mainak Chatterjee",
title = "An economic framework for dynamic spectrum access and
service pricing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1200--1213",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007758",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The concept of dynamic spectrum access will allow the
radio spectrum to be traded in a market like scenario
allowing wireless service providers (WSPs) to lease
chunks of spectrum on a short-term basis. Such market
mechanisms will lead to competition among WSPs where
they not only compete to acquire spectrum but also
attract and retain users. Currently, there is little
understanding on how such a dynamic trading system will
operate so as to make the system feasible under
economic terms.\par
In this paper, we propose an economic framework that
can be used to guide (i) the dynamic spectrum
allocation process and (ii) the service pricing
mechanisms that the providers can use. We propose a
knapsack based auction model that dynamically allocates
spectrum to the WSPs such that revenue and spectrum
usage are maximized. We borrow techniques from game
theory to capture the conflict of interest between WSPs
and end users. A dynamic pricing strategy for the
providers is also proposed. We show that even in a
greedy and non-cooperative behavioral game model, it is
in the best interest of the WSPs to adhere to a price
and channel threshold which is a direct consequence of
price equilibrium. Through simulation results, we show
that the proposed auction model entices WSPs to
participate in the auction, makes optimal use of the
spectrum, and avoids collusion among WSPs. We
demonstrate how pricing can be used as an effective
tool for providing incentives to the WSPs to upgrade
their network resources and offer better services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "auction theory; dynamic spectrum access; game theory;
pricing",
}
@Article{Froc:2009:DPW,
author = "Gwillerm Froc and Issam Mabrouki and Xavier Lagrange",
title = "Design and performance of wireless data gathering
networks based on unicast random walk routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1214--1227",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006223",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless environment monitoring applications with
significantly relaxed quality-of-service constraints
are emerging. Hence, the possibility to use rough low
knowledge routing in sensor networks to reduce hardware
resource and software complexity is questionable.
Moreover, low knowledge handling allows better
genericity, which is of interest, for instance, for
basic operation enabling system set-up. In this
framework, this paper revisits stateless unicast random
walk routing in wireless sensor networks. Based on
random walk theory, original closed-form expressions of
the delay, the power consumption and related spatial
behaviors are provided according to the scale of the
system. Basic properties of such a random routing are
discussed. Exploiting its properties, data gathering
schemes that fulfill the requirements of the
application with rather good energy efficiency are then
identified.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data gathering; quality of service (QoS); random walk;
routing; wireless sensor networks",
}
@Article{Tsai:2009:VCB,
author = "Ming-Jer Tsai and Hong-Yen Yang and Bing-Hong Liu and
Wen-Qian Huang",
title = "Virtual-coordinate-based delivery-guaranteed routing
protocol in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1228--1241",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we first propose a method, ABVCap, to
construct a virtual coordinate system in a wireless
sensor network. ABVCap assigns each node multiple
5-tuple virtual coordinates. Subsequently, we introduce
a protocol, ABVCap routing, to route packets based on
the ABVCap virtual coordinate system. ABVCap routing
guarantees packet delivery without the computation and
storage of the global topological features. Finally, we
demonstrate an approach, ABVCap maintenance, to
reconstruct an ABVCap virtual coordinate system in a
network with node failures. Simulations show ABVCap
routing ensures moderate routing path length, as
compared to virtual-coordinate-based routing, GLIDER,
Hop ID, GLDR, and VCap.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delivery-guaranteed routing; GPS-free routing; virtual
coordinate assignment; wireless sensor network",
}
@Article{Ahn:2009:SLD,
author = "Joon Ahn and Bhaskar Krishnamachari",
title = "Scaling laws for data-centric storage and querying in
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1242--1255",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2009220",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We use a constrained optimization framework to derive
scaling laws for data-centric storage and querying in
wireless sensor networks. We consider both unstructured
sensor networks, which use blind sequential search for
querying, and structured sensor networks, which use
efficient hash-based querying. We find that the
scalability of a sensor network's performance depends
upon whether the increase in energy and storage
resources with more nodes is outweighed by the
concomitant application-specific increase in event and
query loads. We derive conditions that determine: (1)
whether the energy requirement per node grows without
bound with the network size for a fixed-duration
deployment, (2) whether there exists a maximum network
size that can be operated for a specified duration on a
fixed energy budget, and (3) whether the network
lifetime increases or decreases with the size of the
network for a fixed energy budget. An interesting
finding of this work is that three-dimensional (3D)
uniform deployments are inherently more scalable than
two-dimensional (2D) uniform deployments, which in turn
are more scalable than one-dimensional (1D) uniform
deployments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "energy efficiency; modeling; performance analysis;
querying; scalability; wireless sensor networks",
}
@Article{Li:2009:PFD,
author = "Ming Li and Deepak Ganesan and Prashant Shenoy",
title = "{PRESTO}: feedback-driven data management in sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1256--1269",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2006818",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents PRESTO, a novel two-tier sensor
data management architecture comprising proxies and
sensors that cooperate with one another for acquiring
data and processing queries. PRESTO proxies construct
time-series models of observed trends in the sensor
data and transmit the parameters of the model to
sensors. Sensors check sensed data with model-predicted
values and transmit only deviations from the
predictions back to the proxy. Such a model-driven push
approach is energy-efficient, while ensuring that
anomalous data trends are never missed. In addition to
supporting queries on current data, PRESTO also
supports queries on historical data using interpolation
and local archival at sensors. PRESTO can adapt model
and system parameters to data and query dynamics to
further extract energy savings. We have implemented
PRESTO on a sensor testbed comprising Intel Stargates
and Telos Motes. Our experiments show that in a
temperature monitoring application, PRESTO yields one
to two orders of magnitude reduction in energy
requirements over on-demand, proactive or model-driven
pull approaches. PRESTO also results in an order of
magnitude reduction in query latency in a 1\%
duty-cycled five hop sensor network over a system that
forwards all queries to remote sensor nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data management; model-driven push; sensor networks;
time-series models",
}
@Article{Casado:2009:REN,
author = "Mart{\'\i}n Casado and Michael J. Freedman and Justin
Pettit and Jianying Luo and Natasha Gude and Nick
McKeown and Scott Shenker",
title = "Rethinking enterprise network control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1270--1283",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026415",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents Ethane, a new network architecture
for the enterprise. Ethane allows managers to define a
single network-wide fine-grain policy and then enforces
it directly. Ethane couples extremely simple flow-based
Ethernet switches with a centralized controller that
manages the admittance and routing of flows. While
radical, this design is backwards-compatible with
existing hosts and switches. We have implemented Ethane
in both hardware and software, supporting both wired
and wireless hosts. We also show that it is compatible
with existing high-fanout switches by porting it to
popular commodity switching chipsets. We have deployed
and managed two operational Ethane networks, one in the
Stanford University Computer Science Department
supporting over 300 hosts, and another within a small
business of 30 hosts. Our deployment experiences have
significantly affected Ethane's design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "architecture; management; network; security",
}
@Article{Argyraki:2009:SNL,
author = "Katerina Argyraki and David R. Cheriton",
title = "Scalable network-layer defense against {Internet}
bandwidth-flooding attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1284--1297",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a bandwidth-flooding attack, compromised sources
send high-volume traffic to the target with the purpose
of causing congestion in its tail circuit and
disrupting its legitimate communications. In this
paper, we present Active Internet Traffic Filtering
(AITF), a network-layer defense mechanism against such
attacks. AITF enables a receiver to contact misbehaving
sources and ask them to stop sending it traffic; each
source that has been asked to stop is policed by its
own Internet service provider (ISP), which ensures its
compliance. An ISP that hosts misbehaving sources
either supports AITF (and accepts to police its
misbehaving clients), or risks losing all access to the
complaining receiver--this is a strong incentive to
cooperate, especially when the receiver is a popular
public-access site. We show that AITF preserves a
significant fraction of a receiver's bandwidth in the
face of bandwidth flooding, and does so at a per-client
cost that is already affordable for today's ISPs; this
per-client cost is not expected to increase, as long as
botnet-size growth does not outpace Moore's law. We
also show that even the first two networks that deploy
AITF can maintain their connectivity to each other in
the face of bandwidth flooding. We conclude that the
network-layer of the Internet can provide an effective,
scalable, and incrementally deployable solution against
bandwidth-flooding attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "denial-of-service defenses; network-level security and
protection; traffic filtering",
}
@Article{Roy:2009:PIO,
author = "Sabyasachi Roy and Himabindu Pucha and Zheng Zhang and
Y. Charlie Hu and Lili Qiu",
title = "On the placement of infrastructure overlay nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1298--1311",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007433",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay routing has emerged as a promising approach to
improving performance and reliability of Internet
paths. To fully realize the potential of overlay
routing under the constraints of deployment costs in
terms of hardware, network connectivity and human
effort, it is critical to carefully place
infrastructure overlay nodes to balance the tradeoff
between performance and resource constraints. In this
paper, we investigate approaches to perform intelligent
placement of overlay nodes to facilitate (i) resilient
routing and (ii) TCP performance improvement. We
formulate objective functions to capture application
behavior: reliability and TCP performance, and develop
several placement algorithms, which offer a wide range
of tradeoffs in complexity and required knowledge of
the client-server location and traffic load. Using
simulations on synthetic and real Internet topologies,
and PlanetLab experiments, we demonstrate the
effectiveness of the placement algorithms and objective
functions developed, respectively. We conclude that a
hybrid approach combining greedy and random approaches
provides the best tradeoff between computational
efficiency and accuracy. We also uncover the
fundamental challenge in simultaneously optimizing for
reliability and TCP performance, and propose a simple
unified algorithm to achieve both.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "NP-completeness; overlay networks; placement;
reliability; TCP",
}
@Article{Nair:2009:DIO,
author = "Jayakrishnan Nair and D. Manjunath",
title = "Distributed iterative optimal resource allocation with
concurrent updates of routing and flow control
variables",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1312--1325",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Consider a set of active elastic sessions over a
network. Session traffic is routed at each hop
(potentially through multiple network paths) based only
on its destination. Each session is associated with a
concave increasing utility function of its transfer
rate. The transfer rates of all sessions and the
routing policy define the operating point of the
network. We construct a metric $f$ of the goodness of
this operating point. $f$ is an increasing function of
the session utilities and a decreasing function of the
extent of congestion in the network. We define 'good'
operating points as those that maximize $f$, subject to
the capacity constraints in the network. This paper
presents a distributed, iterative algorithm for
adapting the session rates and the routing policy
across the network so as to converge asymptotically to
the set of 'good' operating points. The algorithm
updates session rates and routing variables
concurrently and is, therefore, amenable to distributed
online implementation. The convergence of the
concurrent update scheme is proved rigorously.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "multipath routing; optimal rate control; optimal
routing; two timescale iterations",
}
@Article{Okamura:2009:MAP,
author = "Hiroyuki Okamura and Tadashi Dohi and Kishor S.
Trivedi",
title = "{Markovian} arrival process parameter estimation with
group data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1326--1339",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2008750",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses a parameter estimation problem of
Markovian arrival process (MAP). In network traffic
measurement experiments, one often encounters the group
data where arrival times for a group are collected as
one bin. Although the group data are observed in many
situations, nearly all existing estimation methods for
MAP are based on nongroup data. This paper proposes a
numerical procedure for fitting a MAP and a
Markov-modulated Poisson process (MMPP) to group data.
The proposed algorithm is based on the
expectation-maximization (EM) approach and is a natural
but significant extension of the existing EM algorithms
to estimate parameters of the MAP and MMPP.
Specifically for the MMPP estimation, we provide an
efficient approximation based on the proposed EM
algorithm. We examine the performance of proposed
algorithms via numerical experiments and present an
example of traffic analysis with real traffic data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "expectation-maximization (EM) algorithm; group data;
Markov-modulated Poisson process (MMPP); Markovian
arrival process (MAP); maximum-likelihood (ML)
estimation; network traffic",
}
@Article{Baccelli:2009:RPN,
author = "Fran{\c{c}}is Baccelli and Sridhar Machiraju and
Darryl Veitch and Jean Bolot",
title = "The role of {PASTA} in network measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "4",
pages = "1340--1353",
month = aug,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2011129",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Sep 22 12:40:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Poisson Arrivals SeeTimeAverages (PASTA) is a
well-known property applicable to many stochastic
systems. In active probing, PASTA is invoked to justify
the sending of probe packets (or trains) at Poisson
times in a variety of contexts. However, due to the
diversity of aims and analysis techniques used in
active probing, the benefits of Poisson-based
measurement, and the utility and role of PASTA, are
unclear. Using a combination of rigorous results and
carefully constructed examples and counterexamples, we
map out the issues involved and argue that PASTA is of
very limited use in active probing. In particular,
Poisson probes are not unique in their ability to
sample without bias. Furthermore, PASTA ignores the
issue of estimation variance and the central need for
an inversion phase to estimate the quantity of interest
based on what is directly observable. We give concrete
examples of when Poisson probes should not be used,
explain why, and offer initial guidelines on suitable
alternative sending processes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "active probing; network measurement; Nonintrusive
Mixing Arrivals See Time Averages (NIMASTA); Poisson
Arrivals See Time Averages (PASTA)",
}
@Article{Cha:2009:AVP,
author = "Meeyoung Cha and Haewoon Kwak and Pablo Rodriguez and
Yong-Yeol Ahn and Sue Moon",
title = "Analyzing the video popularity characteristics of
large-scale user generated content systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1357--1370",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Steiner:2009:LTS,
author = "Moritz Steiner and Taoufik En-Najjary and Ernst W.
Biersack",
title = "Long term study of peer behavior in the {KAD DHT}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1371--1384",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2009:TSC,
author = "Yigal Bejerano",
title = "Taking the skeletons out of the closets: a simple and
efficient topology discovery scheme for large {Ethernet
LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1385--1398",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Srivatsa:2009:SKM,
author = "Mudhakar Srivatsa and Arun Iyengar and Jian Yin and
Ling Liu",
title = "Scalable key management algorithms for location-based
services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1399--1412",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paganini:2009:UAC,
author = "Fernando Paganini and Enrique Mallada",
title = "A unified approach to congestion control and
node-based multipath routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1413--1426",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2009:GPR,
author = "Murali Kodialam and T. V. Lakshman and Sudipta
Sengupta",
title = "Guaranteed performance routing of unpredictable
traffic with fast path restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1427--1438",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2009:ORF,
author = "Xin Yuan and Wickus Nienaber and Zhenhai Duan and Rami
Melhem",
title = "Oblivious routing in fat-tree based system area
networks with uncertain traffic demands",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1439--1452",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Boche:2009:NBP,
author = "Holger Boche and Martin Schubert",
title = "{Nash} bargaining and proportional fairness for
wireless systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1453--1466",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bui:2009:DLS,
author = "Loc X. Bui and Sujay Sanghavi and R. Srikant",
title = "Distributed link scheduling with constant overhead",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1467--1480",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joo:2009:PRA,
author = "Changhee Joo and Ness B. Shroff",
title = "Performance of random access scheduling schemes in
multi-hop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1481--1493",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2009:OSP,
author = "Zhenzhen Ye and Alhussein A. Abouzeid and Jing Ai",
title = "Optimal stochastic policies for distributed data
aggregation in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1494--1507",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2009:OSW,
author = "Yan Wu and Sonia Fahmy and Ness B. Shroff",
title = "Optimal sleep\slash wake scheduling for
time-synchronized sensor networks with {QoS}
guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1508--1521",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garetto:2009:CSAa,
author = "Michele Garetto and Paolo Giaccone and Emilio
Leonardi",
title = "Capacity scaling in ad hoc networks with heterogeneous
mobile nodes: the super-critical regime",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1522--1535",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2009:SPE,
author = "Suli Zhao and Dipankar Raychaudhuri",
title = "Scalability and performance evaluation of hierarchical
hybrid wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1536--1549",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2009:OWM,
author = "Hui Ma and Rajiv Vijayakumar and Sumit Roy and Jing
Zhu",
title = "Optimizing 802.11 wireless mesh networks based on
physical carrier sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1550--1563",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hsu:2009:MST,
author = "Wei-Jen Hsu and Thrasyvoulos Spyropoulos and
Konstantinos Psounis and Ahmed Helmy",
title = "Modeling spatial and temporal dependencies of user
mobility in wireless mobile networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1564--1577",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2009:CBD,
author = "Han Cai and Do Young Eun",
title = "Crossing over the bounded domain: from exponential to
power-law intermeeting time in mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1578--1591",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2009:OEE,
author = "Wei Wang and Mehul Motani and Vikram Srinivasan",
title = "Opportunistic energy-efficient contact probing in
delay-tolerant applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1592--1605",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liew:2009:BMD,
author = "Soung Chang Liew and Ying Jun Zhang and Da Rui Chen",
title = "Bounded-mean-delay throughput and nonstarvation
conditions in {Aloha} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1606--1618",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pascu:2009:CFA,
author = "Stefan Alexandru Pascu and Ahmed A. El-Amawy",
title = "On conflict-free all-to-all broadcast in one-hop
optical networks of arbitrary topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1619--1630",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mandjes:2009:RDT,
author = "Michel Mandjes and Remco {Van De Meent}",
title = "Resource dimensioning through buffer sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1631--1644",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Prasad:2009:RBS,
author = "Ravi S. Prasad and Constantine Dovrolis and Marina
Thottan",
title = "Router buffer sizing for {TCP} traffic and the role of
the output\slash input capacity ratio",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1645--1658",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2009:CSL,
author = "Chao-Lin Yu and Cheng-Shang Chang and Duan-Shin Lee",
title = "{CR} switch: a load-balanced switch with contention
and reservation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1659--1671",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lazarou:2009:DNT,
author = "Georgios Y. Lazarou and Julie Baca and Victor S. Frost
and Joseph B. Evans",
title = "Describing network traffic using the index of
variability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1672--1683",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2009:PSG,
author = "Reuven Cohen and Niloofar Fazlollahi and David
Starobinski",
title = "Path switching and grading algorithms for advance
channel reservation architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "5",
pages = "1684--1695",
month = oct,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Andrew:2009:UXE,
author = "Lachlan L. H. Andrew and Steven H. Low and Bartek P.
Wydrowski",
title = "Understanding {XCP}: equilibrium and fairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1697--1710",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chou:2009:PSP,
author = "Jerry Chi-Yuan Chou and Bill Lin and Subhabrata Sen
and Oliver Spatscheck",
title = "Proactive surge protection: a defense mechanism for
bandwidth-based attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1711--1723",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2009:TUE,
author = "Yao Zhao and Yan Chen and David Bindel",
title = "Towards unbiased end-to-end network diagnosis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1724--1737",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gunes:2009:RIA,
author = "Mehmet H. Gunes and Kamil Sarac",
title = "Resolving {IP} aliases in building traceroute-based
{Internet} maps",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1738--1751",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Su:2009:DBA,
author = "Ao-Jan Su and David R. Choffnes and Aleksandar
Kuzmanovic and Fabi{\'a}n E. Bustamante",
title = "Drafting behind {Akamai}: inferring network conditions
based on {CDN} redirections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1752--1765",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sirivianos:2009:REI,
author = "Michael Sirivianos and Xiaowei Yang and Stanislaw
Jarecki",
title = "Robust and efficient incentives for cooperative
content distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1766--1779",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rouskas:2009:BTS,
author = "George N. Rouskas and Nikhil Baradwaj",
title = "On bandwidth tiered service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1780--1793",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mutlu:2009:SPS,
author = "Huseyin Mutlu and Murat Alanyali and David
Starobinski",
title = "Spot pricing of secondary spectrum access in wireless
cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1794--1804",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2009:OCP,
author = "Nicholas B. Chang and Mingyan Liu",
title = "Optimal channel probing and transmission scheduling
for opportunistic spectrum access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1805--1818",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sharma:2009:EBD,
author = "Shrutivandana Sharma and Demosthenis Teneketzis",
title = "An externalities-based decentralized optimal power
allocation algorithm for wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1819--1831",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gurewitz:2009:MMO,
author = "Omer Gurewitz and Vincenzo Mancuso and Jingpu Shi and
Edward W. Knightly",
title = "Measurement and modeling of the origins of starvation
of congestion-controlled flows in wireless mesh
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1832--1845",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gupta:2009:LCD,
author = "Abhinav Gupta and Xiaojun Lin and R. Srikant",
title = "Low-complexity distributed scheduling algorithms for
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1846--1859",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See comments and corrections \cite{Zhang:2015:CCN}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lotfinezhad:2009:SRD,
author = "Mahdi Lotfinezhad and Ben Liang and Elvino S. Sousa",
title = "On stability region and delay performance of
linear-memory randomized scheduling for time-varying
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1860--1873",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2009:DPE,
author = "Xiaojun Lin and Shahzada B. Rasool",
title = "Distributed and provably efficient algorithms for
joint channel-assignment, scheduling, and routing in
multichannel ad hoc wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1874--1887",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garetto:2009:CSAb,
author = "Michele Garetto and Paolo Giaccone and Emilio
Leonardi",
title = "Capacity scaling in ad hoc networks with heterogeneous
mobile nodes: the subcritical regime",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1888--1901",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarkar:2009:DRI,
author = "Rik Sarkar and Xianjin Zhu and Jie Gao",
title = "Double rulings for information brokerage in sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1902--1915",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Martinez:2009:DFN,
author = "Christopher J. Martinez and Devang K. Pandya and
Wei-Ming Lin",
title = "On designing fast nonuniformly distributed {IP}
address lookup hashing algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1916--1925",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Choi:2009:SPC,
author = "Lynn Choi and Hyogon Kim and Sunil Kim and Moon Hae
Kim",
title = "Scalable packet classification through rulebase
partitioning using the maximum entropy hashing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1926--1935",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baldi:2009:PFP,
author = "Mario Baldi and Guido Marchetto",
title = "Pipeline forwarding of packets based on a low-accuracy
network-distributed common time reference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1936--1949",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Menth:2009:RAP,
author = "Michael Menth and Michael Duelli and Ruediger Martin
and Jens Milbrandt",
title = "Resilience analysis of packet-switched communication
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1950--1963",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Seetharaman:2009:RCL,
author = "Srini Seetharaman and Volker Hilt and Markus Hofmann
and Mostafa Ammar",
title = "Resolving cross-layer conflict between overlay routing
and traffic engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1964--1977",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gourgy:2009:TBO,
author = "Amir Gourgy and Ted H. Szymanski and Douglas G. Down",
title = "On tracking the behavior of an output-queued switch
using an input-queued switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1978--1988",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rai:2009:PAO,
author = "Smita Rai and Ching-Fong Su and Biswanath Mukherjee",
title = "On provisioning in all-optical networks: an
impairment-aware approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "1989--2001",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Turkcu:2009:PON,
author = "Onur Turkcu and Suresh Subramaniam",
title = "Performance of optical networks with limited
reconfigurability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "2002--2013",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2009:CLC,
author = "Yi-Ting Chen and Jay Cheng and Duan-Shin Lee",
title = "Constructions of linear compressors, nonovertaking
delay lines, and flexible delay lines for optical
packet switching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "6",
pages = "2014--2027",
month = dec,
year = "2009",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 15 18:25:46 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2010:PUL,
author = "Guohan Lu and Yan Chen and Stefan Birrer and
Fabi{\'a}n E. Bustamante and Xing Li",
title = "{POPI}: a user-level tool for inferring router packet
forwarding priority",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "1--14",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020799",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet forwarding prioritization (PFP) in routers is
one of the mechanisms commonly available to network
operators. PFP can have a significant impact on the
accuracy of network measurements, the performance of
applications and the effectiveness of network
troubleshooting procedures. Despite its potential
impacts, no information on PFP settings is readily
available to end users. In this paper, we present an
end-to-end approach for PFP inference and its
associated tool, POPI. This is the first attempt to
infer router packet forwarding priority through
end-to-end measurement. POPI enables users to discover
such network policies through measurements of packet
losses of different packet types. We evaluated our
approach via statistical analysis, simulation and
wide-area experimentation in PlanetLab. We employed
POPI to analyze 156 paths among 162 PlanetLab sites.
POPI flagged 15 paths with multiple priorities, 13 of
which were further validated through hop-by-hop loss
rates measurements. In addition, we surveyed all
related network operators and received responses for
about half of them all confirming our inferences.
Besides, we compared POPI with the inference mechanisms
through other metrics such as packet reordering [called
out-of-order (OOO)]. OOO is unable to find many
priority paths such as those implemented via traffic
policing. On the other hand, interestingly, we found it
can detect existence of the mechanisms which induce
delay differences among packet types such as slow
processing path in the router and port-based load
sharing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network inference; network neutrality; packet
forwarding priority",
}
@Article{Cohen:2010:CAE,
author = "Reuven Cohen and Liran Katzir",
title = "Computational analysis and efficient algorithms for
micro and macro {OFDMA} downlink scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "15--26",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022937",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Orthogonal frequency-division multiple access (OFDMA)
is one of the most important modulation and access
methods for the future mobile networks. Before
transmitting a frame on the downlink, an OFDMA base
station has to invoke an algorithm that determines
which of the pending packets will be transmitted, what
modulation should be used for each of them, and how to
construct the complex OFDMA frame matrix as a
collection of rectangles that fit into a single matrix
with fixed dimensions. We propose efficient algorithms,
with performance guarantee, that solve this intricate
OFDMA scheduling problem by breaking it down into two
subproblems, referred to as macro and micro scheduling.
We analyze the computational complexity of these
subproblems and develop efficient algorithms for
solving them.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "orthogonal frequency-division multiple access (OFDMA);
scheduling; wireless",
}
@Article{Lee:2010:SEE,
author = "Sanghwan Lee and Zhi-Li Zhang and Sambit Sahu and
Debanjan Saha",
title = "On suitability of {Euclidean} embedding for host-based
network coordinate systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "27--40",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2023322",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the suitability of
embedding Internet hosts into a Euclidean space given
their pairwise distances (as measured by round-trip
time). Using the classical scaling and matrix
perturbation theories, we first establish the (sum of
the) magnitude of negative eigenvalues of the (doubly
centered, squared) distance matrix as a measure of
suitability of Euclidean embedding. We then show that
the distance matrix among Internet hosts contains
negative eigenvalues of large magnitude, implying that
embedding the Internet hosts in a Euclidean space would
incur relatively large errors. Motivated by earlier
studies, we demonstrate that the inaccuracy of
Euclidean embedding is caused by a large degree of
triangle inequality violation (TIV) in the Internet
distances, which leads to negative eigenvalues of large
magnitude. Moreover, we show that the TIVs are likely
to occur locally; hence the distances among these
close-by hosts cannot be estimated accurately using a
global Euclidean embedding. In addition, increasing the
dimension of embedding does not reduce the embedding
errors. Based on these insights, we propose a new
hybrid model for embedding the network nodes using only
a two-dimensional Euclidean coordinate system and small
error adjustment terms. We show that the accuracy of
the proposed embedding technique is as good as, if not
better than, that of a seven-dimensional Euclidean
embedding.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Euclidean embedding; suitability; triangle
inequality",
}
@Article{Chin:2010:DIM,
author = "Jren-Chit Chin and Yu Dong and Wing-Kai Hon and Chris
Yu-Tak Ma and David K. Y. Yau",
title = "Detection of intelligent mobile target in a mobile
sensor network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "41--52",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024309",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of a mobile target (the mouse)
trying to evade detection by one or more mobile sensors
(we call such a sensor a cat) in a closed network area.
We view our problem as a game between two players: the
mouse, and the collection of cats forming a single
(meta-)player. The game ends when the mouse falls
within the sensing range of one or more cats. A cat
tries to determine its optimal strategy to minimize the
worst case expected detection time of the mouse. The
mouse tries to determine an optimal counter movement
strategy to maximize the expected detection time. We
divide the problem into two cases based on the relative
sensing capabilities of the cats and the mouse. When
the mouse has a sensing range smaller than or equal to
the cats', we develop a dynamic programming solution
for the mouse's optimal strategy, assuming high level
information about the cats' movement model. We discuss
how the cats' chosen movement model will affect its
presence matrix in the network, and hence its payoff in
the game. When the mouse has a larger sensing range
than the cats, we show how the mouse can determine its
optimal movement strategy based on local observations
of the cats' movements. We further present a
coordination protocol for the cats to collaboratively
catch the mouse by: (1) forming opportunistically a
cohort to limit the mouse's degree of freedom in
escaping detection; and (2) minimizing the overlap in
the spatial coverage of the cohort's members. Extensive
experimental results verify and illustrate the
analytical results, and evaluate the game's payoffs as
a function of several important system parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "mobile sensor coverage; mobile target detection;
mobility control; sensor coordination",
}
@Article{Wang:2010:TZD,
author = "Lanjia Wang and Zhichun Li and Yan Chen and Zhi Fu and
Xing Li",
title = "Thwarting zero-day polymorphic worms with
network-level length-based signature generation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "53--66",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is crucial to detect zero-day polymorphic worms and
to generate signatures at network gateways or honeynets
so that we can prevent worms from propagating at their
early phase. However, most existing network-based
signatures are specific to exploit and can be easily
evaded. In this paper, we propose generating
vulnerability-driven signatures at network level
without any host-level analysis of worm execution or
vulnerable programs. As the first step, we design a
network-based length-based signature generator (LESG)
for the worms exploiting buffer overflow
vulnerabilities. The signatures generated are intrinsic
to buffer overflows, and are very difficult for
attackers to evade. We further prove the attack
resilience bounds even under worst-case attacks with
deliberate noise injection. Moreover, LESG is fast and
noise tolerant and has efficient signature matching.
Evaluation based on real-world vulnerabilities of
various protocols and real network traffic demonstrates
that LESG is promising in achieving these goals.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "length-based signature; polymorphic worm; worm
signature generation; zero-day vulnerability",
}
@Article{Kamal:2010:NPM,
author = "Ahmed E. Kamal",
title = "{$ 1 + N $} network protection for mesh networks:
network coding-based protection using $p$-cycles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "67--80",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020503",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "p-Cycles have been proposed for preprovisioned 1 + N
protection in optical mesh networks. Although the
protection circuits are preconfigured, the detection of
failures and the rerouting of traffic can be a time
consuming operation. Another survivable mode of
operation is the 1 + 1 protection mode, in which a
signal is transmitted to the destination on two link
disjoint circuits, hence recovery from failures is
expeditious. However, this requires a large number of
protection circuits. In this paper, we introduce a new
concept in protection: 1 + N protection, in which a
p-Cycle, similar to FIPP $p$-cycles, can be used to
protect a number of bidirectional connections, which
are mutually link disjoint, and also link disjoint from
all links of the p-Cycle. However, data units from
different circuits are combined using network coding,
which can be implemented in a number of technologies,
such as Next Generation SONET (NGS), MPLS/GMPLS, or
IP-over-WDM. The maximum outage time under this
protection scheme can be limited to no more than the
p-Cycle propagation delay. It is also shown how to
implement a hybrid 1 + N and 1 + N protection scheme,
in which on-cycle links are protected using 1 + N
protection, while straddling links, or paths, are
protected using 1 + N protection. Extensions of this
technique to protect multipoint connections are also
introduced. A performance study based on optimal
formulations of the 1 + 1, 1 + N and the hybrid scheme
is introduced. Although 1 + N speed of recovery is
comparable to that of 1 + N protection, numerical
results for small networks indicate that 1 + N is about
30\% more efficient than 1 + 1 protection, in terms of
the amount of protection resources, especially as the
network graph density increases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "$p$-cycles; 1 + N protection; network coding; optical
networks; protection; survivability",
}
@Article{Pong:2010:SSS,
author = "Fong Pong and Nian-Feng Tzeng",
title = "{SUSE}: superior storage-efficiency for routing tables
through prefix transformation and aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "81--94",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022085",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A novel storage design for IP routing table
construction is introduced on the basis of a single
set-associative hash table to support fast longest
prefix matching (LPM). The proposed design involves two
key techniques to lower table storage required
drastically: (1) storing transformed prefix
representations; and (2) accommodating multiple
prefixes per table entry via prefix aggregation,
achieving superior storage-efficiency (SUSE). With each
prefix ($ p(x)$) maneuvered as a polynomial, $ p(x) =
q(x) \times g(x) + r(x)$ based on a divisor $ g(x)$,
SUSE keeps only $ q(x)$ rather than full and long $
p(x)$ in an $ r(x)$-indexed table with $ 2^{\hbox
{degree}(g(x))}$ entries, because $ q(x)$ and $ r(x)$
uniquely identify $ p(x)$. Additionally, using $ r(x)$
as the hash index exhibits better distribution than do
original prefixes, reducing hash collisions, which can
be tolerated further by the set-associative design.
Given a set of chosen prefix lengths (called 'treads'),
all prefixes are rounded down to nearest treads under
SUSE before hashed to the table using their transformed
representations so that prefix aggregation
opportunities abound in hash entries. SUSE yields
significant table storage reduction and enjoys fast
lookups and speedy incremental updates not possible for
a typical trie-based design, with the worst-case lookup
time shown upper-bounded theoretically by the number of
treads $ \zeta $ but found experimentally to be 4
memory accesses when $ \zeta $ equals 8. SUSE makes it
possible to fit a large routing table with 256 K (or
even 1 M) prefixes in on-chip SRAM by today's ASIC
technology. It solves both the memory- and the
bandwidth-intensive problems faced by IP routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "hash tables; linear feedback shift registers; longest
prefix matching; prefix aggregation; prefix
transformation; routing tables; table storage; tries",
}
@Article{Ruhrup:2010:MEB,
author = "Stefan R{\"u}hrup and Hanna Kalosha and Amiya Nayak
and Ivan Stojmenovi{\'c}",
title = "Message-efficient beaconless georouting with
guaranteed delivery in wireless sensor, ad hoc, and
actuator networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "95--108",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022084",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Beaconless georouting algorithms are fully reactive
and work without prior knowledge of their neighbors.
However, existing approaches can either not guarantee
delivery or they require the exchange of complete
neighborhood information. We describe two general
methods for completely reactive face routing with
guaranteed delivery. The Beaconless Forwarder
Planarization (BFP) scheme determines correct edges of
a local planar subgraph without hearing from all
neighbors. Face routing then continues properly.
Angular Relaying determines directly the next hop of a
face traversal. Both schemes are based on the
Select-and-Protest principle. Neighbors respond
according to a delay function, but only if they do not
violate a planar subgraph condition. Protest messages
are used to remove falsely selected neighbors that are
not in the planar subgraph. We show that a correct
beaconless planar subgraph construction is not possible
without protests. We also show the impact of the chosen
planar subgraph on the message complexity. With the new
Circlunar Neighborhood Graph (CNG) we can bound the
worst case message complexity of BFP, which is not
possible when using the Gabriel graph (GG) for
planarization. Simulation results show similar message
complexities in the average case when using CNG and GG.
Angular Relaying uses a delay function that is based on
the angular distance to the previous hop. We develop a
theoretical framework for delay functions and show both
theoretically and in simulations that with a function
of angle and distance we can reduce the number of
protests by a factor of 2 compared to a simple
angle-based delay function.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "ad hoc networks; beaconless routing; contention-based
forwarding; geographic routing; wireless sensor
networks",
}
@Article{Oliveira:2010:COI,
author = "Ricardo Oliveira and Dan Pei and Walter Willinger and
Beichuan Zhang and Lixia Zhang",
title = "The (in)completeness of the observed {Internet}
{AS}-level structure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "109--122",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2020798",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Despite significant efforts to obtain an accurate
picture of the Internet's connectivity structure at the
level of individual autonomous systems (ASes), much has
remained unknown in terms of the quality of the
inferred AS maps that have been widely used by the
research community. In this paper, we assess the
quality of the inferred Internet maps through case
studies of a sample set of ASes. These case studies
allow us to establish the ground truth of connectivity
between this set of ASes and their directly connected
neighbors. A direct comparison between the ground truth
and inferred topology maps yield insights into
questions such as which parts of the actual topology
are adequately captured by the inferred maps, which
parts are missing and why, and what is the percentage
of missing links in these parts. This information is
critical in assessing, for each class of real-world
networking problems, whether the use of currently
inferred AS maps or proposed AS topology models is, or
is not, appropriate. More importantly, our newly gained
insights also point to new directions towards building
realistic and economically viable Internet topology
maps.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "border gateway protocol (BGP); interdomain routing;
Internet topology",
}
@Article{Ni:2010:EDR,
author = "Jian Ni and Haiyong Xie and Sekhar Tatikonda and Yang
Richard Yang",
title = "Efficient and dynamic routing topology inference from
end-to-end measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "123--135",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022538",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inferring the routing topology and link performance
from a node to a set of other nodes is an important
component in network monitoring and application design.
In this paper, we propose a general framework for
designing topology inference algorithms based on
additive metrics. The framework can flexibly fuse
information from multiple measurements to achieve
better estimation accuracy. We develop computationally
efficient (polynomial-time) topology inference
algorithms based on the framework. We prove that the
probability of correct topology inference of our
algorithms converges to one exponentially fast in the
number of probing packets. In particular, for
applications where nodes may join or leave frequently
such as overlay network construction, application-layer
multicast, and peer-to-peer file sharing/streaming, we
propose a novel sequential topology inference algorithm
that significantly reduces the probing overhead and can
efficiently handle node dynamics. We demonstrate the
effectiveness of the proposed inference algorithms via
Internet experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "network measurement; network monitoring; network
tomography; routing topology inference",
}
@Article{Chamberland:2010:GAN,
author = "Steven Chamberland",
title = "Global access network evolution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "136--149",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2021430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose to tackle the problem of
updating the access network in order to connect new
subscribers and to satisfy the new class of service
requirements for the existing subscribers to offer, for
instance, new services such as high-definition
television (HDTV) over the Internet protocol (IPTV).
Four important access network
architectures/technologies are considered: the digital
subscriber line (xDSL) technologies deployed directly
from the central office (CO), the fiber-to-the-node
(FTTN), the fiber-to-the-micro-node (FTTn) and the
fiber-to-the-premises (FTTP). An integer mathematical
programming model is proposed for this network planning
problem. Next, a heuristic algorithm based on the tabu
search principle is proposed to find 'good' feasible
solutions within a reasonable amount of computational
time. Finally, numerical results are presented and
analyzed. To assess the quality of the solutions found
with the proposed algorithm, they are compared to the
optimal solutions found using a commercial
implementation of the branch-and-bound algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "access network evolution problem; branch-and-bound;
digital subscriber line (xDSL) technologies;
fiber-to-the-micro-node (FTTn); fiber-to-the-node
(FTTN); fiber-to-the-premises (FTTP); integer
mathematical programming; tabu search; xDSL from the
central office (CO)",
}
@Article{Yu:2010:DRF,
author = "Zhen Yu and Yong Guan",
title = "A dynamic en-route filtering scheme for data reporting
in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "150--163",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless sensor networks, adversaries can inject
false data reports via compromised nodes and launch DoS
attacks against legitimate reports. Recently, a number
of filtering schemes against false reports have been
proposed. However, they either lack strong filtering
capacity or cannot support highly dynamic sensor
networks very well. Moreover, few of them can deal with
DoS attacks simultaneously. In this paper, we propose a
dynamic en-route filtering scheme that addresses both
false report injection and DoS attacks in wireless
sensor networks. In our scheme, each node has a hash
chain of authentication keys used to endorse reports;
meanwhile, a legitimate report should be authenticated
by a certain number of nodes. First, each node
disseminates its key to forwarding nodes. Then, after
sending reports, the sending nodes disclose their keys,
allowing the forwarding nodes to verify their reports.
We design the Hill Climbing key dissemination approach
that ensures the nodes closer to data sources have
stronger filtering capacity. Moreover, we exploit the
broadcast property of wireless communication to defeat
DoS attacks and adopt multipath routing to deal with
the topology changes of sensor networks. Simulation
results show that compared to existing solutions, our
scheme can drop false reports earlier with a lower
memory requirement, especially in highly dynamic sensor
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "data reporting; en-route filtering scheme; wireless
sensor networks",
}
@Article{Fay:2010:WSD,
author = "Damien Fay and Hamed Haddadi and Andrew Thomason and
Andrew W. Moore and Richard Mortier and Almerima
Jamakovic and Steve Uhlig and Miguel Rio",
title = "Weighted spectral distribution for {Internet} topology
analysis: theory and applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "164--176",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022369",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Comparing graphs to determine the level of underlying
structural similarity between them is a widely
encountered problem in computer science. It is
particularly relevant to the study of Internet
topologies, such as the generation of synthetic
topologies to represent the Internet's AS topology. We
derive a new metric that enables exactly such a
structural comparison: the weighted spectral
distribution. We then apply this metric to three
aspects of the study of the Internet's AS topology. (i)
We use it to quantify the effect of changing the mixing
properties of a simple synthetic network generator.
(ii) We use this quantitative understanding to examine
the evolution of the Internet's AS topology over
approximately seven years, finding that the distinction
between the Internet core and periphery has blurred
over time. (iii) We use the metric to derive optimal
parameterizations of several widely used AS topology
generators with respect to a large-scale measurement of
the real AS topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "graph metrics; Internet topology; spectral graph
theory; topology generation",
}
@Article{Ohsita:2010:GRV,
author = "Yuichi Ohsita and Takashi Miyamura and Shin'ichi
Arakawa and Shingo Ata and Eiji Oki and Kohei Shiomoto
and Masayuki Murata",
title = "Gradually reconfiguring virtual network topologies
based on estimated traffic matrices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "177--189",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022263",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic matrix is essential to traffic engineering
(TE) methods. Because it is difficult to monitor
traffic matrices directly, several methods for
estimating them from link loads have been proposed.
However, estimated traffic matrix includes estimation
errors which degrade the performance of TE
significantly. In this paper, we propose a method that
reduces estimation errors while reconfiguring the
virtual network topology (VNT) by cooperating with the
VNT reconfiguration. In our method, the VNT
reconfiguration is divided into multiple stages instead
of reconfiguring the suitable VNT at once. By dividing
the VNT reconfiguration into multiple stages, our
traffic matrix estimation method calibrates and reduces
the estimation errors in each stage by using
information monitored in prior stages. We also
investigate the effectiveness of our proposal using
simulations. The results show that our method can
improve the accuracy of the traffic matrix estimation
and achieve an adequate VNT as is the case with the
reconfiguration using the actual traffic matrices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "GMPLS; traffic engineering; traffic matrix estimation;
virtual network topology (VNT)",
}
@Article{Rezaei:2010:DRS,
author = "Behnam A. Rezaei and Nima Sarshar and Vwani P.
Roychowdhury",
title = "Distributed resource sharing in low-latency wireless
ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "190--201",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2025928",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the growing abundance of portable wireless
communication devices, a challenging question that
arises is whether one can efficiently harness the
collective communication and computation power of these
devices. In this paper, we investigate this question by
studying a streaming application. Consider a network of
$N$ wireless nodes, each of power $P$, in which one or
more nodes are interested in receiving a data stream
from a fixed server node $S$. We ask whether
distributed communication mechanisms exist to route
media packets from $S$ to the arbitrary but fixed
receiver, such that (1) the average communication delay
$L$ is short, (2) the load is balanced, i.e., all nodes
in the ensemble spend roughly the same amount of
average power, and, more importantly, (3) power
resources of all nodes are optimally shared, i.e., the
lifetime of the network is comparable to an optimally
designed network with $L$ nodes whose total power is $
N \times P$.\par
We develop a theoretical framework for incorporation of
random long range routes into wireless ad hoc
networking protocols that can achieve such performance.
Surprisingly, we show that wireless ad hoc routing
algorithms, based on this framework, exist that can
deliver this performance. The proposed solution is a
randomized network structuring and packet routing
framework whose communication latency is only $ L =
O(\log^2 N)$ hops, on average, compared to $ O(\sqrt
N)$ in nearest neighbor communications while
distributing the power requirement almost equally over
all nodes. Interestingly, all network formation and
routing algorithms are completely decentralized, and
the packets arriving at a node are routed randomly and
independently, based only on the source and destination
locations. The distributed nature of the algorithm
allows it to be implemented within standard wireless ad
hoc communication protocols and makes the proposed
framework a compelling candidate for harnessing
collective network resources in a truly large-scale
wireless ad hoc networking environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "low latency; multipath routing; resource sharing;
scalability; small world; wireless ad hoc networks",
}
@Article{Shu:2010:CTO,
author = "Tao Shu and Marwan Krunz",
title = "Coverage-time optimization for clustered wireless
sensor networks: a power-balancing approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "202--215",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2022936",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the maximization of the
coverage time for a clustered wireless sensor network
by optimal balancing of power consumption among cluster
heads (CHs). Clustering significantly reduces the
energy consumption of individual sensors, but it also
increases the communication burden on CHs. To
investigate this tradeoff, our analytical model
incorporates both intra- and intercluster traffic.
Depending on whether location information is available
or not, we consider optimization formulations under
both deterministic and stochastic setups, using a
Rayleigh fading model for intercluster communications.
For the deterministic setup, sensor nodes and CHs are
arbitrarily placed, but their locations are known. Each
CH routes its traffic directly to the sink or relays it
through other CHs. We present a coverage-time-optimal
joint clustering/routing algorithm, in which the
optimal clustering and routing parameters are computed
using a linear program. For the stochastic setup, we
consider a cone-like sensing region with uniformly
distributed sensors and provide optimal power
allocation strategies that guarantee (in a
probabilistic sense) an upper bound on the end-to-end
(inter-CH) path reliability. Two mechanisms are
proposed for achieving balanced power consumption in
the stochastic case: a routing-aware optimal cluster
planning and a clustering-aware optimal random relay.
For the first mechanism, the problem is formulated as a
signomial optimization, which is efficiently solved
using generalized geometric programming. For the second
mechanism, we show that the problem is solvable in
linear time. Numerical examples and simulations are
used to validate our analysis and study the performance
of the proposed schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "clustering; coverage time; generalized geometric
programming; linear programming; sensor networks;
signomial optimization; topology control",
}
@Article{Bredin:2010:DSN,
author = "Jonathan L. Bredin and Erik D. Demaine and Mohammad
Taghi Hajiaghayi and Daniela Rus",
title = "Deploying sensor networks with guaranteed fault
tolerance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "216--228",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024941",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of deploying or repairing a
sensor network to guarantee a specified level of
multipath connectivity ($k$-connectivity) between all
nodes. Such a guarantee simultaneously provides fault
tolerance against node failures and high overall
network capacity (by the max-flow min-cut theorem). We
design and analyze the first algorithms that place an
almost-minimum number of additional sensors to augment
an existing network into a $k$-connected network, for
any desired parameter $k$. Our algorithms have provable
guarantees on the quality of the solution.
Specifically, we prove that the number of additional
sensors is within a constant factor of the absolute
minimum, for any fixed $k$. We have implemented greedy
and distributed versions of this algorithm, and
demonstrate in simulation that they produce
high-quality placements for the additional sensors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; augmentation; graph
algorithms; sensor networks",
}
@Article{Zhang:2010:MBA,
author = "Bo Zhang and Tze Sing Eugene Ng and Animesh Nandi and
Rudolf H. Riedi and Peter Druschel and Guohui Wang",
title = "Measurement-based analysis, modeling, and synthesis of
the {Internet} delay space",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "229--242",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Understanding the characteristics of the Internet
delay space (i.e., the all-pairs set of static
round-trip propagation delays among edge networks in
the Internet) is important for the design of
global-scale distributed systems. For instance,
algorithms used in overlay networks are often sensitive
to violations of the triangle inequality and to the
growth properties within the Internet delay space.
Since designers of distributed systems often rely on
simulation and emulation to study design alternatives,
they need a realistic model of the Internet delay
space. In this paper, we analyze measured delay spaces
among thousands of Internet edge networks and quantify
key properties that are important for distributed
system design. Our analysis shows that existing delay
space models do not adequately capture these important
properties of the Internet delay space. Furthermore, we
derive a simple model of the Internet delay space based
on our analytical findings. This model preserves the
relevant metrics far better than existing models,
allows for a compact representation, and can be used to
synthesize delay data for simulations and emulations at
a scale where direct measurement and storage are
impractical. We present the design of a publicly
available delay space synthesizer tool called DS$^2$
and demonstrate its effectiveness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "analysis; distributed system; Internet delay space;
measurement; modeling; simulation; synthesis",
}
@Article{Law:2010:DCH,
author = "Lap Kong Law and Konstantinos Pelechrinis and Srikanth
V. Krishnamurthy and Michalis Faloutsos",
title = "Downlink capacity of hybrid cellular ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "243--256",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2023651",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Augmenting cellular networks with shorter multihop
wireless links that carry traffic to/from a base
station can be expected to facilitate higher rates and
improved spatial reuse, therefore potentially yielding
increased wireless capacity. The resulting network is
referred to as a hybrid network. However, while this
approach can result in shorter range higher rate links
and improved spatial reuse, which together favor a
capacity increase, it relies on multihop forwarding,
which is detrimental to the overall capacity. In this
paper, our objective is to evaluate the impact of these
conflicting factors on the overall capacity of the
hybrid network. We formally define the capacity of the
network as the maximum possible downlink throughput
under the constraint of max-min fairness. We
analytically compute the capacity of both one- and
two-dimensional hybrid networks with regular placement
of base stations and users. While almost no capacity
benefits are possible with linear networks due to poor
spatial reuse, significant capacity improvements with
two-dimensional networks are possible in certain
parametric regimes. Our simulations also demonstrate
that in both cases, if the users are placed randomly,
the behavioral results are similar to those with
regular placement of users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "capacity; hybrid networks",
}
@Article{Wang:2010:UMI,
author = "Xiaoming Wang and Dmitri Loguinov",
title = "Understanding and modeling the {Internet} topology:
economics and evolution perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "257--270",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024145",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we seek to understand the intrinsic
reasons for the well-known phenomenon of heavy-tailed
degree in the Internet AS graph and argue that in
contrast to traditional models based on preferential
attachment and centralized optimization, the Pareto
degree of the Internet can be explained by the
evolution of wealth associated with each ISP. The
proposed topology model utilizes a simple
multiplicative stochastic process that determines each
ISP's wealth at different points in time and several
'maintenance' rules that keep the degree of each node
proportional to its wealth. Actual link formation is
determined in a decentralized fashion based on random
walks, where each ISP individually decides when and how
to increase its degree. Simulations show that the
proposed model, which we call Wealth-based Internet
Topology (WIT), produces scale-free random graphs with
tunable exponent $ \alpha $ and high clustering
coefficients (between 0.35 and 0.5) that stay invariant
as the size of the graph increases. This evolution
closely mimics that of the Internet observed since
1997.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "autonomous systems; clustering coefficient; degree
distribution; random walk; wealth evolution; {Internet}
topology",
}
@Article{Bathula:2010:QBM,
author = "Balagangadhar G. Bathula and Vinod M. Vokkarane",
title = "{QoS}-based manycasting over optical burst-switched
{(OBS)} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "271--283",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024498",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many distributed applications require a group of
destinations to be coordinated with a single source.
Multicasting is a communication paradigm to implement
these distributed applications. However in
multicasting, if at least one of the members in the
group cannot satisfy the service requirement of the
application, the multicast request is said to be
blocked. On the contrary in manycasting, destinations
can join or leave the group, depending on whether it
satisfies the service requirement or not. This dynamic
membership based destination group decreases request
blocking. We study the behavior of manycasting over
optical burst-switched networks (OBS) based on multiple
quality of service (QoS) constraints. These multiple
constraints can be in the form of physical-layer
impairments, transmission delay, and reliability of the
link. Each application requires its own QoS threshold
attributes. Destinations qualify only if they satisfy
the required QoS constraints set up by the application.
We have developed a mathematical model based on lattice
algebra for this multiconstraint problem. Due to
multiple constraints, burst blocking could be high. We
propose two algorithms to minimize request blocking for
the multiconstrained manycast (MCM) problem. Using
extensive simulation results, we have calculated the
average request blocking for the proposed algorithms.
Our simulation results show that MCM-shortest path tree
(MCM-SPT) algorithm performs better than MCM-dynamic
membership (MCM-DM) for delay constrained services and
realtime service, where as data services can be better
provisioned using MCM-DM algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "BER; constraint-based routing (CBR); manycast; optical
burst-switched networks (OBS); QoS routing; quality of
service (QoS); WDM",
}
@Article{Wu:2010:IFC,
author = "Bin Wu and Kwan L. Yeung and Pin-Han Ho",
title = "{ILP} formulations for $p$-cycle design without
candidate cycle enumeration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "284--295",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2025769",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The concept of $p$-cycle (preconfigured protection
cycle) allows fast and efficient span protection in
wavelength division multiplexing (WDM) mesh networks.
To design $p$-cycles for a given network, conventional
algorithms need to enumerate cycles in the network to
form a candidate set, and then use an integer linear
program (ILP) to find a set of $p$-cycles from the
candidate set. Because the size of the candidate set
increases exponentially with the network size,
candidate cycle enumeration introduces a huge number of
ILP variables and slows down the optimization process.
In this paper, we focus on $p$-cycle design without
candidate cycle enumeration. Three ILPs for solving the
problem of spare capacity placement (SCP) are first
formulated. They are based on recursion, flow
conservation, and cycle exclusion, respectively. We
show that the number of ILP variables/constraints in
our cycle exclusion approach only increases linearly
with the network size. Then, based on cycle exclusion,
we formulate an ILP for solving the joint capacity
placement (JCP) problem. Numerical results show that
our ILPs are very efficient in generating $p$-cycle
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "$p$-cycle (pre-configured protection cycle); integer
linear program (ILP); protection; wavelength division
multiplexing (WDM) mesh networks",
}
@Article{Kannan:2010:AAM,
author = "Rajgopal Kannan and Shuangqing Wei and Vasu
Chakravarthy and Muralidhar Rangaswamy",
title = "Approximation algorithms for minimum energy
transmission scheduling in rate and duty-cycle
constrained wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "296--306",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026900",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a constrained energy optimization called
Minimum Energy Scheduling Problem (MESP) for a wireless
network of users transmitting over time slots, where
the constraints arise because of interference between
wireless nodes that limits their transmission rates
along with load and duty-cycle (ON-OFF) restrictions.
Since traditional optimization methods using Lagrange
multipliers do not work well and are computationally
expensive given the nonconvex constraints, we consider
approximation schemes for finding the optimal (minimum
energy) transmission schedule by discretizing power
levels over the interference channel. First, we show
the toughness of approximating MESP for an arbitrary
number of users $N$ even with a fixed $M$. For any $
r_0$, we develop an algorithm for computing the optimal
number of discrete power levels per time slot $ (o(1 /
\epsilon))$, and use this to design a $ (1, 1 +
\epsilon)$-FPAS that consumes no more energy than the
optimal while violating each rate constraint by at most
a $ 1 + \epsilon $-factor. For wireless networks with
low-cost transmitters, where nodes are restricted to
transmitting at a fixed power over active time slots,
we develop a two-factor approximation for finding the
optimal fixed transmission power value $ P_{\hbox
{opt}}$ that results in the minimum energy schedule.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; duty cycle constraints;
interference channels; minimum energy scheduling
problem (MESP); wireless networks",
}
@Article{Ray:2010:AAD,
author = "Saikat Ray and Roch Gu{\'e}rin and Kin-Wah Kwong and
Rute Sofia",
title = "Always acyclic distributed path computation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "307--319",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2025374",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed routing algorithms may give rise to
transient loops during path recomputation, which can
pose significant stability problems in high-speed
networks. We present a new algorithm, Distributed Path
Computation with Intermediate Variables (DIV), which
can be combined with any distributed routing algorithm
to guarantee that the directed graph induced by the
routing decisions remains acyclic at all times. The key
contribution of DIV, besides its ability to operate
with any routing algorithm, is an update mechanism
using simple message exchanges between neighboring
nodes that guarantees loop-freedom at all times. DIV
provably outperforms existing loop-prevention
algorithms in several key metrics such as frequency of
synchronous updates and the ability to maintain paths
during transitions. Simulation results quantifying
these gains in the context of shortest path routing are
presented. In addition, DIV's universal applicability
is illustrated by studying its use with a routing that
operates according to a nonshortest path objective.
Specifically, the routing seeks robustness against
failures by maximizing the number of next-hops
available at each node for each destination.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distance-vector routing; loop-free routing",
}
@Article{Li:2010:RPR,
author = "Mo Li and Yunhao Liu",
title = "Rendered path: range-free localization in anisotropic
sensor networks with holes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "1",
pages = "320--332",
month = feb,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2024940",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:16:03 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sensor positioning is a crucial part of many
location-dependent applications that utilize wireless
sensor networks (WSNs). Current localization approaches
can be divided into two groups: range-based and
range-free. Due to the high costs and critical
assumptions, the range-based schemes are often
impractical for WSNs. The existing range-free schemes,
on the other hand, suffer from poor accuracy and low
scalability. Without the help of a large number of
uniformly deployed seed nodes, those schemes fail in
anisotropic WSNs with possible holes. To address this
issue, we propose the Rendered Path (REP) protocol. To
the best of our knowledge, REP is the only range-free
protocol for locating sensors with constant number of
seeds in anisotropic sensor networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "distributed algorithms; distributed computing;
multisensor systems; position measurement",
}
@Article{Shrimali:2010:CIT,
author = "Gireesh Shrimali and Aditya Akella and Almir
Mutapcic",
title = "Cooperative interdomain traffic engineering using
{Nash} bargaining and decomposition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "341--352",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026748",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a novel approach to interdomain traffic
engineering based on the concepts of Nash bargaining
and dual decomposition. Under this scheme, ISPs use an
iterative procedure to jointly optimize a social cost
function, referred to as the Nash product. We show that
the global optimization problem can be separated into
subproblems by introducing appropriate shadow prices on
the interdomain flows. These subproblems can then be
solved independently and in a decentralized manner by
the individual ISPs. Our approach does not require the
ISPs to share any sensitive internal information, such
as network topology or link weights. More importantly,
our approach is provably Pareto-efficient and fair.
Therefore, we believe that our approach is highly
amenable to adoption by ISPs when compared to past
approaches. We also conduct simulation studies of our
approach over several real ISP topologies. Our
evaluation shows that the approach converges quickly,
offers equitable performance improvements to ISPs, is
significantly better than unilateral approaches (e.g.,
hot-potato routing) and offers the same performance as
a centralized solution with full knowledge.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cooperative game theory; dual decomposition;
hot-potato routing; interdomain traffic engineering
(TE); ISP peering; Nash bargaining; Nash equilibrium",
}
@Article{Andrei:2010:PDD,
author = "Dragos Andrei and Massimo Tornatore and Marwan
Batayneh and Charles U. Martel and Biswanath
Mukherjee",
title = "Provisioning of deadline-driven requests with flexible
transmission rates in {WDM} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "353--366",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026576",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing diversity of applications
supported over optical networks, new service guarantees
must be offered to network customers. Among the
emerging data-intensive applications are those which
require their data to be transferred before a
predefined deadline. We call these deadline-driven
requests (DDRs). In such applications, data-transfer
finish time (which must be accomplished before the
deadline) is the key service guarantee that the
customer wants. In fact, the amount of bandwidth
allocated to transfer a request is not a concern for
the customer as long as its service deadline is met.
Hence, the service provider can choose the bandwidth
(transmission rate) to provision the request. In this
case, even though DDRs impose a deadline constraint,
they provide scheduling flexibility for the service
provider since it can choose the transmission rate
while achieving two objectives: (1) satisfying the
guaranteed deadline; and (2) optimizing the network's
resource utilization. We investigate the problem of
provisioning DDRs with flexible transmission rates in
wavelength-division multiplexing (WDM) mesh networks,
although this approach is generalizable to other
networks also. We investigate several (fixed and
adaptive to network state) bandwidth-allocation
policies and study the benefit of allowing dynamic
bandwidth adjustment, which is found to generally
improve network performance. We show that the
performance of the bandwidth-allocation algorithms
depends on the DDR traffic distribution and on the node
architecture and its parameters. In addition, we
develop a mathematical formulation for our problem as a
mixed integer linear program (MILP), which allows
choosing flexible transmission rates and provides a
lower bound for our provisioning algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "bandwidth-on-demand; deadline-driven request (DDR);
flexible transmission rate; large data transfers;
wavelength-division multiplexing (WDM) network",
}
@Article{Mondal:2010:UME,
author = "Amit Mondal and Aleksandar Kuzmanovic",
title = "Upgrading mice to elephants: effects and end-point
solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "367--378",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2025927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Short TCP flows may suffer significant response-time
performance degradations during network congestion.
Unfortunately, this creates an incentive for
misbehavior by clients of interactive applications
(e.g., gaming, telnet, web): to send 'dummy' packets
into the network at a TCP-fair rate even when they have
no data to send, thus improving their performance in
moments when they do have data to send. Even though no
'law' is violated in this way, a large-scale deployment
of such an approach has the potential to seriously
jeopardize one of the core Internet's principles--
statistical multiplexing. We quantify, by means of
analytical modeling and simulation, gains achievable by
the above misbehavior. Our research indicates that
easy-to-implement application-level techniques are
capable of dramatically reducing incentives for
conducting the above transgressions, still without
compromising the idea of statistical multiplexing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "interactive application; retransmission timeout;
statistical multiplexing; TCP",
}
@Article{Xi:2010:DAM,
author = "Yufang Xi and Edmund M. Yeh",
title = "Distributed algorithms for minimum cost multicast with
network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "379--392",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2026275",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding techniques are used to find the
minimum-cost transmission scheme for multicast sessions
with or without elastic rate demand. It is shown that
in wireline networks, solving for the optimal coding
subgraphs in network coding is equivalent to finding
the optimal routing scheme in a multicommodity flow
problem. A set of node-based distributed gradient
projection algorithms are designed to jointly implement
congestion control/routing at the source node and
'virtual' routing at intermediate nodes. The analytical
framework and distributed algorithms are further
extended to interference-limited wireless networks
where link capacities are functions of the
signal-to-interference-plus-noise ratio (SINR). To
achieve minimum-cost multicast in this setting, the
transmission powers of links must be jointly optimized
with coding subgraphs and multicast input rates.
Node-based power allocation and power control
algorithms are developed for the power optimization.
The power algorithms, when iterated in conjunction with
the congestion control and routing algorithms, converge
to the jointly optimal multicast configuration. The
scaling matrices required in the gradient projection
algorithms are explicitly derived and are shown to
guarantee fast convergence to the optimum from any
initial condition.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-layer optimization; distributed algorithms;
network coding; wireless networks",
}
@Article{Gupta:2010:DAW,
author = "Gagan Raj Gupta and Ness B. Shroff",
title = "Delay analysis for wireless networks with single hop
traffic and general interference constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "393--405",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032181",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a class of wireless networks with general
interference constraints on the set of links that can
be served simultaneously at any given time. We restrict
the traffic to be single-hop, but allow for
simultaneous transmissions as long as they satisfy the
underlying interference constraints. We begin by
proving a lower bound on the delay performance of any
scheduling scheme for this system. We then analyze a
large class of throughput optimal policies which have
been studied extensively in the literature. The delay
analysis of these systems has been limited to
asymptotic behavior in the heavy traffic regime and
order results. We obtain a tighter upper bound on the
delay performance for these systems. We use the
insights gained by the upper and lower bound analysis
to develop an estimate for the expected delay of
wireless networks with mutually independent arrival
streams operating under the well-known maximum weighted
matching (MWM) scheduling policy. We show via
simulations that the delay performance of the MWM
policy is often close to the lower bound, which means
that it is not only throughput optimal, but also
provides excellent delay performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "delay analysis; interference; Lyapunov function;
scheduling; wireless networks",
}
@Article{Huang:2010:OTP,
author = "Longbo Huang and Michael J. Neely",
title = "The optimality of two prices: maximizing revenue in a
stochastic communication system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "406--419",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2028423",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the problem of pricing and
transmission scheduling for an access point (AP) in a
wireless network, where the AP provides service to a
set of mobile users. The goal of the AP is to maximize
its own time-average profit. We first obtain the
optimum time-average profit of the AP and prove the
'Optimality of Two Prices' theorem. We then develop an
online scheme that jointly solves the pricing and
transmission scheduling problem in a dynamic
environment. The scheme uses an admission price and a
business decision as tools to regulate the incoming
traffic and to maximize revenue. We show the scheme can
achieve any average profit that is arbitrarily close to
the optimum, with a tradeoff in average delay. This
holds for general Markovian dynamics for channel and
user state variation, and does not require a priori
knowledge of the Markov model. The model and
methodology developed in this paper are general and
apply to other stochastic settings where a single party
tries to maximize its time-average profit.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic control; Lyapunov analysis; optimization;
pricing; queueing; wireless mesh network",
}
@Article{Radunovic:2010:TPO,
author = "Bo{\v{z}}idar Radunovi{\'c} and Christos Gkantsidis
and Peter Key and Pablo Rodriguez",
title = "Toward practical opportunistic routing with
intra-session network coding for mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "420--433",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030682",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider opportunistic routing in wireless mesh
networks. We exploit the inherent diversity of the
broadcast nature of wireless by making use of multipath
routing. We present a novel optimization framework for
opportunistic routing based on network utility
maximization (NUM) that enables us to derive optimal
flow control, routing, scheduling, and rate adaptation
schemes, where we use network coding to ease the
routing problem. All previous work on NUM assumed
unicast transmissions; however, the wireless medium is
by its nature broadcast and a transmission will be
received by multiple nodes. The structure of our design
is fundamentally different; this is due to the fact
that our link rate constraints are defined per
broadcast region instead of links in isolation. We
prove optimality and derive a primal-dual algorithm
that lays the basis for a practical protocol. Optimal
MAC scheduling is difficult to implement, and we use
802.11-like random scheduling rather than optimal in
our comparisons. Under random scheduling, our protocol
becomes fully decentralized (we assume ideal
signaling). The use of network coding introduces
additional constraints on scheduling, and we propose a
novel scheme to avoid starvation. We simulate realistic
topologies and show that we can achieve 20\%-200\%
throughput improvement compared to single path routing,
and several times compared to a recent related
opportunistic protocol (MORE).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "broadcast; fairness; flow control; multipath routing;
network coding; opportunistic routing; rate adaptation;
wireless mesh networks",
}
@Article{Misra:2010:CRN,
author = "Satyajayant Misra and Seung Don Hong and Guoliang Xue
and Jian Tang",
title = "Constrained relay node placement in wireless sensor
networks: formulation and approximations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "434--447",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033273",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One approach to prolong the lifetime of a wireless
sensor network (WSN) is to deploy some relay nodes to
communicate with the sensor nodes, other relay nodes,
and the base stations. The relay node placement problem
for wireless sensor networks is concerned with placing
a minimum number of relay nodes into a wireless sensor
network to meet certain connectivity or survivability
requirements. Previous studies have concentrated on the
unconstrained version of the problem in the sense that
relay nodes can be placed anywhere. In practice, there
may be some physical constraints on the placement of
relay nodes. To address this issue, we study
constrained versions of the relay node placement
problem, where relay nodes can only be placed at a set
of candidate locations. In the connected relay node
placement problem, we want to place a minimum number of
relay nodes to ensure that each sensor node is
connected with a base station through a bidirectional
path. In the survivable relay node placement problem,
we want to place a minimum number of relay nodes to
ensure that each sensor node is connected with two base
stations (or the only base station in case there is
only one base station) through two node-disjoint
bidirectional paths. For each of the two problems, we
discuss its computational complexity and present a
framework of polynomial time $ O(1)$-approximation
algorithms with small approximation ratios. Extensive
numerical results show that our approximation
algorithms can produce solutions very close to optimal
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "approximation algorithms; connectivity and
survivability; relay node placement; wireless sensor
networks (WSNs)",
}
@Article{Parvez:2010:ATM,
author = "Nadim Parvez and Anirban Mahanti and Carey
Williamson",
title = "An analytic throughput model for {TCP} {NewReno}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "448--461",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030889",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper develops a simple and accurate stochastic
model for the steady-state throughput of a TCP NewReno
bulk data transfer as a function of round-trip time and
loss behavior. Our model builds upon extensive prior
work on TCP Reno throughput models but differs from
these prior works in three key aspects. First, our
model introduces an analytical characterization of the
TCP NewReno fast recovery algorithm. Second, our model
incorporates an accurate formulation of NewReno's
timeout behavior. Third, our model is formulated using
a flexible two-parameter loss model that can better
represent the diverse packet loss scenarios encountered
by TCP on the Internet. We validated our model by
conducting a large number of simulations using the {\em
ns-2\/} simulator and by conducting emulation and
Internet experiments using a NewReno implementation in
the BSD TCP/IP protocol stack. The main findings from
the experiments are: (1) the proposed model accurately
predicts the steady-state throughput for TCP NewReno
bulk data transfers under a wide range of network
conditions; (2) TCP NewReno significantly outperforms
TCP Reno in many of the scenarios considered; and (3)
using existing TCP Reno models to estimate TCP NewReno
throughput may introduce significant errors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "analytical modeling; ns-2; simulation; transmission
control protocol (TCP)",
}
@Article{AlDaoud:2010:PSS,
author = "Ashraf {Al Daoud} and Murat Alanyali and David
Starobinski",
title = "Pricing strategies for spectrum lease in secondary
markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "462--475",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031176",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop analytical models to characterize pricing
of spectrum rights in cellular CDMA networks.
Specifically, we consider a primary license holder that
aims to lease its spectrum within a certain geographic
subregion of its network. Such a transaction has two
contrasting economic implications: On the one hand the
lessor obtains a revenue due to the exercised price of
the region. On the other hand, it incurs a cost due to:
(1) reduced spatial coverage of its network; and (2)
possible interference from the leased region into the
retained portion of its network, leading to increased
call blocking. We formulate this tradeoff as an
optimization problem, with the objective of profit
maximization. We consider a range of pricing
philosophies and derive near-optimal solutions that are
based on a reduced load approximation (RLA) for
estimating blocking probabilities. The form of these
prices suggests charging the lessee in proportion to
the fraction of admitted calls. We also exploit the
special structure of the solutions to devise an
efficient iterative procedure for computing prices. We
present numerical results that demonstrate superiority
of the proposed strategy over several alternative
strategies. The results emphasize importance of
effective pricing strategies in bringing secondary
markets to full realization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cellular CDMA networks; network economics; reduced
load approximation (RLA); traffic modeling",
}
@Article{Shakkottai:2010:DAC,
author = "Srinivas Shakkottai and Ramesh Johari",
title = "Demand-aware content distribution on the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "476--489",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2035047",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The rapid growth of media content distribution on the
Internet in the past few years has brought with it
commensurate increases in the costs of distributing
that content. Can the content distributor defray these
costs through a more innovative approach to
distribution? In this paper, we evaluate the benefits
of a hybrid system that combines peer-to-peer and a
centralized client-server approach against each method
acting alone. A key element of our approach is to
explicitly model the temporal evolution of demand. In
particular, we employ a word-of-mouth demand evolution
model due to Bass [2] to represent the evolution of
interest in a piece of content. Our analysis is carried
out in an order scaling depending on the total
potential mass of customers in the market. Using this
approach, we study the relative performance of
peer-to-peer and centralized client-server schemes, as
well as a hybrid of the two--both from the point of
view of consumers as well as the content distributor.
We show how awareness of demand can be used to attain a
given average delay target with lowest possible
utilization of the central server by using the hybrid
scheme. We also show how such awareness can be used to
take provisioning decisions. Our insights are obtained
in a fluid model and supported by stochastic
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Bass diffusion; content distribution; delay
guarantees; peer-to-peer (P2P)",
}
@Article{Liu:2010:TRS,
author = "Alex X. Liu and Chad R. Meiners and Eric Torng",
title = "{TCAM} Razor: a systematic approach towards minimizing
packet classifiers in {TCAMs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "490--500",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030188",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is the core mechanism that
enables many networking services on the Internet such
as firewall packet filtering and traffic accounting.
Using ternary content addressable memories (TCAMs) to
perform high-speed packet classification has become the
de facto standard in industry. TCAMs classify packets
in constant time by comparing a packet with all
classification rules of ternary encoding in parallel.
Despite their high speed, TCAMs suffer from the
well-known range expansion problem. As packet
classification rules usually have fields specified as
ranges, converting such rules to TCAM-compatible rules
may result in an explosive increase in the number of
rules. This is not a problem if TCAMs have large
capacities. Unfortunately, TCAMs have very limited
capacity, and more rules mean more power consumption
and more heat generation for TCAMs. Even worse, the
number of rules in packet classifiers has been
increasing rapidly with the growing number of services
deployed on the Internet. In this paper, we consider
the following problem: given a packet classifier, how
can we generate another semantically equivalent packet
classifier that requires the least number of TCAM
entries? In this paper, we propose a systematic
approach, the TCAM Razor, that is effective, efficient,
and practical. In terms of effectiveness, TCAM Razor
achieves a total compression ratio of 29.0\%, which is
significantly better than the previously published best
result of 54\%. In terms of efficiency, our TCAM Razor
prototype runs in seconds, even for large packet
classifiers. Finally, in terms of practicality, our
TCAM Razor approach can be easily deployed as it does
not require any modification to existing packet
classification systems, unlike many previous range
encoding schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithm; packet classification; router design;
ternary content addressable memory (TCAM)
optimization",
}
@Article{Lin:2010:LCD,
author = "Longbi Lin and Xiaojun Lin and Ness B. Shroff",
title = "Low-complexity and distributed energy minimization in
multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "501--514",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this work, we study the problem of minimizing the
total power consumption in a multihop wireless network
subject to a given offered load. It is well-known that
the total power consumption of multihop wireless
networks can be substantially reduced by jointly
optimizing power control, link scheduling, and routing.
However, the known optimal cross-layer solution to this
problem is centralized and with high computational
complexity. In this paper, we develop a low-complexity
and distributed algorithm that is provably
power-efficient. In particular, under the
node-exclusive interference model and with suitable
assumptions on the power-rate function, we can show
that the total power consumption of our algorithm is at
most $ (2 + \epsilon) $ times as large as the power
consumption of the optimal (but centralized and
complex) algorithm, where is an arbitrarily small
positive constant. Our algorithm is not only the first
such distributed solution with provable performance
bound, but its power-efficiency ratio is also tighter
than that of another suboptimal centralized algorithm
in the literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "cross-layer optimization; duality; energy-aware
routing; mathematical programming/optimization",
}
@Article{Kim:2010:MDM,
author = "Joohwan Kim and Xiaojun Lin and Ness B. Shroff and
Prasun Sinha",
title = "Minimizing delay and maximizing lifetime for wireless
sensor networks with anycast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "515--528",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032294",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we are interested in minimizing the
delay and maximizing the lifetime of event-driven
wireless sensor networks for which events occur
infrequently. In such systems, most of the energy is
consumed when the radios are on, waiting for a packet
to arrive. Sleep-wake scheduling is an effective
mechanism to prolong the lifetime of these
energy-constrained wireless sensor networks. However,
sleep-wake scheduling could result in substantial
delays because a transmitting node needs to wait for
its next-hop relay node to wake up. An interesting line
of work attempts to reduce these delays by developing
'anycast'-based packet forwarding schemes, where each
node opportunistically forwards a packet to the first
neighboring node that wakes up among multiple candidate
nodes. In this paper, we first study how to optimize
the anycast forwarding schemes for minimizing the
expected packet-delivery delays from the sensor nodes
to the sink. Based on this result, we then provide a
solution to the joint control problem of how to
optimally control the system parameters of the
sleep-wake scheduling protocol and the anycast
packet-forwarding protocol to maximize the network
lifetime, subject to a constraint on the expected
end-to-end packet-delivery delay. Our numerical results
indicate that the proposed solution can outperform
prior heuristic solutions in the literature, especially
under practical scenarios where there are obstructions,
e.g., a lake or a mountain, in the coverage area of the
wireless sensor network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anycast; delay; energy-efficiency; sensor network;
sleep-wake scheduling",
}
@Article{Zheng:2010:PSR,
author = "Si Qing Zheng and Ashwin Gumaste and Hong Shen",
title = "A parallel self-routing rearrangeable nonblocking
multi-{$ \log_2 N $} photonic switching network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "529--539",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A new rearrangeable nonblocking photonic multi-log 2
$N$ network $ D M(N)$ is introduced. It is shown that $
D M(N)$ network possesses many good properties
simultaneously. These good properties include all those
of existing rearrangeable nonblocking photonic
multi-log2 $N$ networks and new ones such as $ O(\log
N)$-time fast parallel self-routing, nonblocking
multiple-multicast, and cost-effective crosstalk-free
wavelength dilation, which existing rearrangeable
nonblocking multi-log2 $N$ networks do not have. The
advantages of $ D M(N)$ over existing multi-log2 $N$
networks, especially $ \log_2 (N, 0, 2^{\lfloor \log_2
N / 2 \rfloor })$, are achieved by employing a
two-level load balancing scheme--a combination of
static load balancing and dynamic load balancing. $ D
M(N)$ and $ \log_2 (N, 0, 2^{\lfloor \log_2 N / 2
\rfloor })$ are about the same in structure. The
additional cost is for the intraplane routing
preprocessing circuits. Considering the extended
capabilities of $ D M(N)$ and current mature and cheap
electronic technology, this extra cost is well
justified.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Banyan network; crosstalk reduction; directional
coupler; multicast; parallel processing; permutation
routing; photonic switching systems; rearrangeable
nonblocking; self-routing; switch control",
}
@Article{Tinnirello:2010:RIE,
author = "Ilenia Tinnirello and Giuseppe Bianchi",
title = "Rethinking the {IEEE} 802.11e {EDCA} performance
modeling methodology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "540--553",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2029101",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Analytical modeling of the 802.11e enhanced
distributed channel access (EDCA) mechanism is today a
fairly mature research area, considering the very large
number of papers that have appeared in the literature.
However, most work in this area models the EDCA
operation through per-slot statistics, namely
probability of transmission and collisions referred to
'slots.' In so doing, they still share a methodology
originally proposed for the 802.11 Distributed
Coordination Function (DCF), although they do extend it
by considering differentiated transmission/ collision
probabilities over different slots. We aim to show that
it is possible to devise 802.11e models that do not
rely on per-slot statistics. To this purpose, we
introduce and describe a novel modeling methodology
that does not use per-slot transmission/collision
probabilities, but relies on the fixed-point
computation of the whole (residual) backoff counter
distribution occurring after a generic transmission
attempt. The proposed approach achieves high accuracy
in describing the channel access operations, not only
in terms of throughput and delay performance, but also
in terms of low-level performance metrics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MAC model; quality of service; WLAN",
}
@Article{Banerjee:2010:DFE,
author = "Nilanjan Banerjee and Mark D. Corner and Brian Neil
Levine",
title = "Design and field experimentation of an
energy-efficient architecture for {DTN} throwboxes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "554--567",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039491",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Disruption-tolerant networks (DTNs) rely on
intermittent contacts between mobile nodes to deliver
packets using a store-carry-and-forward paradigm. We
earlier proposed the use of throwbox nodes, which are
stationary, battery-powered nodes with storage and
processing, to enhance the capacity of DTNs. However,
the use of throwboxes without efficient power
management is minimally effective. If the nodes are too
liberal with their energy consumption, they will fail
prematurely. However, if they are too conservative,
they may miss important transfer opportunities, hence
increasing lifetime without improving performance. In
this paper, we present a hardware and software
architecture for energy-efficient throwboxes in DTNs.
We propose a hardware platform that uses a multitiered,
multiradio, scalable, solar-powered platform. The
throwbox employs an approximate heuristic for solving
the NP-hard problem of meeting an average power
constraint while maximizing the number of bytes
forwarded by the throwbox. We built and deployed
prototype throwboxes in UMass DieselNet, a bus-based
DTN testbed. Through extensive trace-driven simulations
and prototype deployment, we show that a single
throwbox with a 270-cm$^2$ solar panel can run
perpetually while improving packet delivery by 37\% and
reducing message delivery latency by at least 10\% in
the network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "disruption-tolerant networks; energy management;
mobility; solar-powered systems",
}
@Article{Cohen:2010:MRT,
author = "Reuven Cohen and Gabi Nakibly",
title = "Maximizing restorable throughput in {MPLS} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "568--581",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031064",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "MPLS recovery mechanisms are increasing in popularity
because they can guarantee fast restoration and high
QoS assurance. Their main advantage is that their
backup paths are established in advance, before a
failure event takes place. Most research on the
establishment of primary and backup paths has focused
on minimizing the added capacity required by the backup
paths in the network. However, this so-called Spare
Capacity Allocation (SCA) metric is less practical for
network operators who have a fixed capacitated network
and want to maximize their revenues. In this paper, we
present a comprehensive study on restorable throughput
maximization in MPLS networks. We present the first
polynomial-time algorithms for the splittable version
of the problem. For the unsplittable version, we
provide a lower bound for the approximation ratio and
propose an approximation algorithm with an almost
identical bound. We present an efficient heuristic
which is shown to have excellent performance. One of
our most important conclusions is that when one seeks
to maximize revenue, local recovery should be the
recovery scheme of choice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "MPLS; optimization; restoration",
}
@Article{Zhong:2010:CRR,
author = "Sheng Zhong and Fan Wu",
title = "A collusion-resistant routing scheme for
noncooperative wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "582--595",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030325",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless ad hoc networks, routing needs cooperation
of nodes. Since nodes often belong to different users,
it is highly important to provide incentives for them
to cooperate. However, most existing studies of the
incentive-compatible routing problem focus on
individual nodes' incentives, assuming that no subset
of them would collude. Clearly, this assumption is not
always valid. In this paper, we present a systematic
study of collusion-resistant routing in noncooperative
wireless ad hoc networks. In particular, we consider
two standard solution concepts for collusion resistance
in game theory, namely Group Strategyproofness and
Strong Nash Equilibrium. We show that achieving Group
Strategyproofness is impossible, while achieving Strong
Nash Equilibrium is possible. More specifically, we
design a scheme that is guaranteed to converge to a
Strong Nash Equilibrium and prove that the total
payment needed is bounded. In addition, we propose a
cryptographic method that prevents profit transfer
among colluding nodes, as long as they do not fully
trust each other unconditionally. This method makes our
scheme widely applicable in practice. Experiments show
that our solution is collusion-resistant and has good
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "collusion; routing; wireless ad hoc networks",
}
@Article{Balasubramanian:2010:RRD,
author = "Aruna Balasubramanian and Brian Neil Levine and Arun
Venkataramani",
title = "Replication routing in {DTNs}: a resource allocation
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "596--609",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Routing protocols for disruption-tolerant networks
(DTNs) use a variety of mechanisms, including
discovering the meeting probabilities among nodes,
packet replication, and network coding. The primary
focus of these mechanisms is to increase the likelihood
of finding a path with limited information, and so
these approaches have only an incidental effect on such
routing metrics as maximum or average delivery delay.
In this paper, we present RAPID, an intentional DTN
routing protocol that can optimize a specific routing
metric such as the worst-case delivery delay or the
fraction of packets that are delivered within a
deadline. The key insight is to treat DTN routing as a
resource allocation problem that translates the routing
metric into per-packet utilities that determine how
packets should be replicated in the system. We evaluate
RAPID rigorously through a prototype deployed over a
vehicular DTN testbed of 40 buses and simulations based
on real traces. To our knowledge, this is the first
paper to report on a routing protocol deployed on a
real outdoor DTN. Our results suggest that RAPID
significantly outperforms existing routing protocols
for several metrics. We also show empirically that for
small loads, RAPID is within 10\% of the optimal
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "deployment; design; DTN; mobility; performance;
routing; utility",
}
@Article{Hefeeda:2010:BTS,
author = "Mohamed Hefeeda and Cheng-Hsin Hsu",
title = "On burst transmission scheduling in mobile {TV}
broadcast networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "610--623",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030326",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In mobile TV broadcast networks, the base station
broadcasts TV channels in bursts such that mobile
devices can receive a burst of traffic and then turn
off their radio frequency circuits till the next burst
in order to save energy. To achieve this energy saving
without scarifying streaming quality, the base station
must carefully construct the burst schedule for all TV
channels. This is called the burst scheduling problem.
In this paper, we prove that the burst scheduling
problem for TV channels with arbitrary bit rates is
NP-complete. We then propose a practical simplification
of the general problem, which allows TV channels to be
classified into multiple classes, and the bit rates of
the classes have power of two increments, e.g., 100,
200, and 400 kbps. Using this practical simplification,
we propose an optimal and efficient burst scheduling
algorithm. We present theoretical analysis, simulation,
and actual implementation in a mobile TV testbed to
demonstrate the optimality, practicality, and
efficiency of the proposed algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "burst scheduling; digital video broadcast-hand-held
(DVB-H); energy saving; mobile multimedia; mobile TV;
video broadcast networks; wireless video streaming",
}
@Article{Sue:2010:FRP,
author = "Chuan-Ching Sue and Hsaing-Wen Cheng",
title = "A fitting report position scheme for the gated {IPACT}
dynamic bandwidth algorithm in {EPONs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "624--637",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030189",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In EPONs using the gated Interleaved Polling with
Adaptive Cycle Time (IPACT) scheme, the position of the
report message within the granted transmission window
has a direct effect on the average packet delay within
the network. In this paper, this delay is minimized by
using a fitting report position (FRP) scheme to
adaptively adjust the position of the report message
within the transmission window in accordance with the
current network load. In the proposed approach, the
optimal position of the report message is determined
analytically for various system loads. The optical line
terminal (OLT) then uses a heuristic algorithm to
estimate the load of the optical network units (ONUs)
in accordance with their report messages and determines
the report message position that minimizes the average
packet delay within the network. Finally, the OLT
informs the ONUs of the optimal report position through
an optional field in the gate message. The performance
of the proposed FRP scheme is evaluated for three
different network models, namely Poisson traffic with a
uniform ONU load, Poisson traffic with a nonuniform ONU
load, and self-similar traffic, respectively. The
simulation results show that the FRP scheme achieves a
lower average packet delay than fixed-report-position
schemes such as fixed-report-front (FRF) or
fixed-report-end (FRE) for both Poisson and
self-similar traffic. The performance improvement is
particularly apparent in networks with a nonuniform ONU
load distribution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "dynamic bandwidth allocation (DBA); Ethernet passive
optical networks (EPONs); interleaved polling with
adaptive cycle time (IPACT); time division multiplexing
(TDM)",
}
@Article{Eryilmaz:2010:DCL,
author = "Atilla Eryilmaz and Asuman Ozdaglar and Devavrat Shah
and Eytan Modiano",
title = "Distributed cross-layer algorithms for the optimal
control of multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "638--651",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2030681",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we provide and study a general
framework that facilitates the development of
distributed mechanisms to achieve full utilization of
multihop wireless networks. In particular, we describe
a generic randomized routing, scheduling, and flow
control scheme that allows for a set of imperfections
in the operation of the randomized scheduler to account
for potential errors in its operation. These
imperfections enable the design of a large class of
low-complexity and distributed implementations for
different interference models. We study the effect of
such imperfections on the stability and fairness
characteristics of the system and explicitly
characterize the degree of fairness achieved as a
function of the level of imperfections. Our results
reveal the relative importance of different types of
errors on the overall system performance and provide
valuable insight to the design of distributed
controllers with favorable fairness characteristics. In
the second part of the paper, we focus on a specific
interference model, namely the secondary interference
model, and develop distributed algorithms with
polynomial communication and computation complexity in
the network size. This is an important result given
that earlier centralized throughput-optimal algorithms
developed for such a model relies on the solution to an
NP-hard problem at every decision. This results in a
polynomial complexity cross-layer algorithm that
achieves throughput optimality and fair allocation of
network resources among the users. We further show that
our algorithmic approach enables us to efficiently
approximate the capacity region of a multihop wireless
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "congestion control; dynamic routing; fair allocation;
multihop wireless networks; network optimization;
randomized algorithms; throughout-optimal scheduling",
}
@Article{Sommers:2010:MMS,
author = "Joel Sommers and Paul Barford and Nick Duffield and
Amos Ron",
title = "Multiobjective monitoring for {SLA} compliance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "652--665",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031974",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Service level agreements (SLAs) define performance
guarantees made by service providers, e.g., in terms of
packet loss, delay, delay variation, and network
availability. In this paper, we describe a new active
measurement methodology to accurately monitor whether
measured network path characteristics are in compliance
with performance targets specified in SLAs.
Specifically, we: (1) introduce a new methodology for
measuring mean delay along a path that improves
accuracy over existing methodologies, and a method for
obtaining confidence intervals on quantiles of the
empirical delay distribution without making any
assumption about the true distribution of delay; (2)
introduce a new methodology for measuring delay
variation that is more robust than prior techniques;
(3) describe a new methodology for estimating packet
loss rate that significantly improves accuracy over
existing approaches; and (4) extend existing work in
network performance tomography to infer lower bounds on
the quantiles of a distribution of performance measures
along an unmeasured path given measurements from a
subset of paths. Active measurements for these metrics
are unified in a discrete time-based tool called SLAM.
The unified probe stream from SLAM consumes lower
overall bandwidth than if individual streams are used
to measure path properties. We demonstrate the accuracy
and convergence properties of SLAM in a controlled
laboratory environment using a range of background
traffic scenarios and in one- and two-hop settings, and
examine its accuracy improvements over existing
standard techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "active measurement; network congestion; network delay;
network jitter; packet loss; service level agreements
(SLAs); SLAM",
}
@Article{Trestian:2010:GIP,
author = "Ionut Trestian and Supranamaya Ranjan and Aleksandar
Kuzmanovic and Antonio Nucci",
title = "{Googling} the {Internet}: profiling {Internet}
endpoints via the {World Wide Web}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "2",
pages = "666--679",
month = apr,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031175",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 21 18:17:02 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Understanding Internet access trends at a global
scale, i.e., how people use the Internet, is a
challenging problem that is typically addressed by
analyzing network traces. However, obtaining such
traces presents its own set of challenges owing to
either privacy concerns or to other operational
difficulties. The key hypothesis of our work here is
that most of the information needed to profile the
Internet endpoints is already available around us--on
the Web. In this paper, we introduce a novel approach
for profiling and classifying endpoints. We implement
and deploy a Google-based profiling tool, that
accurately characterizes endpoint behavior by
collecting and strategically combining information
freely available on the Web. Our Web-based
'unconstrained endpoint profiling' (UEP) approach shows
advances in the following scenarios: (1) even when no
packet traces are available, it can accurately infer
application and protocol usage trends at arbitrary
networks; (2) when network traces are available, it
outperforms state-of-the-art classification tools such
as BLINC; (3) when sampled flow-level traces are
available, it retains high classification capabilities.
We explore other complementary UEP approaches, such as
p2p- and reverse-DNS-lookup-based schemes, and show
that they can further improve the results of the
Web-based UEP. Using this approach, we perform
unconstrained endpoint profiling at a global scale: for
clients in four different world regions (Asia, South
and North America, and Europe). We provide the
first-of-its-kind endpoint analysis that reveals
fascinating similarities and differences among these
regions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "clustering; endpoint profiling; Google; traffic
classification; traffic locality",
}
@Article{Hsu:2010:BVS,
author = "Cheng-Hsin Hsu and Mohamed M. Hefeeda",
title = "Broadcasting video streams encoded with arbitrary bit
rates in energy-constrained mobile {TV} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "681--694",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033058",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Starobinski:2010:AOD,
author = "David Starobinski and Weiyao Xiao",
title = "Asymptotically optimal data dissemination in
multichannel wireless sensor networks: single radios
suffice",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "695--707",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karsten:2010:AGP,
author = "Martin Karsten",
title = "Approximation of generalized processor sharing with
interleaved stratified timer wheels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "708--721",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033059",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Broustis:2010:MDG,
author = "Ioannis Broustis and Konstantina Papagiannaki and
Srikanth V. Krishnamurthy and Michalis Faloutsos and
Vivek P. Mhatre",
title = "Measurement-driven guidelines for 802.11 {WLAN}
design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "722--735",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031971",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ozdemir:2010:IFD,
author = "Suat Ozdemir and Hasan {\c{C}}am",
title = "Integration of false data detection with data
aggregation and confidential transmission in wireless
sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "736--749",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032910",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Skorin-Kapov:2010:NAO,
author = "Nina Skorin-Kapov and Jiajia Chen and Lena Wosinska",
title = "A new approach to optical networks security:
attack-aware routing and wavelength assignment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "750--760",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2031555",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mao:2010:SSS,
author = "Yun Mao and Feng Wang and Lili Qiu and Simon Lam and
Jonathan Smith",
title = "{S4}: small state and small stretch compact routing
protocol for large static wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "761--774",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2046645",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2010:IEU,
author = "Richard T. B. Ma and Dah Ming Chiu and John C. S. Lui
and Vishal Misra and Dan Rubenstein",
title = "{Internet} economics: the use of {Shapley} value for
{ISP} settlement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "775--787",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049205",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Venkataramanan:2010:WSA,
author = "V. J. Venkataramanan and Xiaojun Lin",
title = "On wireless scheduling algorithms for minimizing the
queue-overflow probability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "788--801",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2010:LDS,
author = "Hongseok Kim and Gustavo {De Veciana}",
title = "Leveraging dynamic spare capacity in wireless systems
to conserve mobile terminals' energy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "802--815",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032238",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khreishah:2010:RCP,
author = "Abdallah Khreishah and Chih-Chun Wang and Ness B.
Shroff",
title = "Rate control with pairwise intersession network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "816--829",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2032353",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Campos-Nanez:2010:DAA,
author = "Enrique Campos-N{\'a}{\~n}ez",
title = "Decentralized algorithms for adaptive pricing in
multiclass loss networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "830--843",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033182",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2010:EHC,
author = "Ao Tang and Xiaoliang Wei and Steven H. Low and Mung
Chiang",
title = "Equilibrium of heterogeneous congestion control:
optimality and stability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "844--857",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034963",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Manna:2010:IPS,
author = "Parbati Kumar Manna and Shigang Chen and Sanjay
Ranka",
title = "Inside the permutation-scanning worms: propagation
modeling and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "858--870",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2010:JSM,
author = "Jun Luo and Jean-Pierre Hubaux",
title = "Joint sink mobility and routing to maximize the
lifetime of wireless sensor networks: the case of
constrained mobility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "871--884",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033472",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2010:SNO,
author = "Haifeng Yu and Phillip B. Gibbons and Michael Kaminsky
and Feng Xiao",
title = "{SybilLimit}: a near-optimal social network defense
against {Sybil} attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "885--898",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034047",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chambers:2010:COG,
author = "Chris Chambers and Wu-Chang Feng and Sambit Sahu and
Debanjan Saha and David Brandt",
title = "Characterizing online games",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "899--910",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034371",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Roseti:2010:APE,
author = "Cesare Roseti and Michele Luglio and Francesco
Zampognaro",
title = "Analysis and performance evaluation of a burst-based
{TCP} for satellite {DVB RCS} links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "911--921",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2033272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{She:2010:HRC,
author = "Qingya She and Xiaodong Huang and Jason P. Jue",
title = "How reliable can two-path protection be?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "922--933",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036911",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2010:ODP,
author = "Ziqiu Yun and Xiaole Bai and Dong Xuan and Ten H. Lai
and Weijia Jia",
title = "Optimal deployment patterns for full coverage and
$k$-connectivity ($ k <= 6$) wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "934--947",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2040191",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2010:LPT,
author = "Wencheng Lu and Sartaj Sahni",
title = "Low-power {TCAMs} for very large forwarding tables",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "948--959",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034143",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2010:DCA,
author = "Libin Jiang and Jean Walrand",
title = "A distributed {CSMA} algorithm for throughput and
utility maximization in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "960--972",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2035046",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Madan:2010:FAR,
author = "Ritesh Madan and Stephen P. Boyd and Sanjay Lall",
title = "Fast algorithms for resource allocation in wireless
cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "973--984",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2034850",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gerstel:2010:GFS,
author = "Ori Gerstel and G. Sasaki",
title = "A general framework for service availability for
bandwidth-efficient connection-oriented networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "985--995",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2046746",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fan:2010:PSN,
author = "Chun-I Fan and Pei-Hsiu Ho and Ruei-Hau Hsu",
title = "Provably secure nested one-time secret mechanisms for
fast mutual authentication and key exchange in mobile
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "996--1009",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vojnovic:2010:SSE,
author = "Milan Vojnovi{\'c} and Varun Gupta and Thomas
Karagiannis and Christos Gkantsidis",
title = "Sampling strategies for epidemic-style information
dissemination",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1013--1025",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051233",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mirza:2010:MLA,
author = "Mariyam Mirza and Joel Sommers and Paul Barford and
Xiaojin Zhu",
title = "A machine learning approach to {TCP} throughput
prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1026--1039",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037812",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liebeherr:2010:STA,
author = "J{\"o}rg Liebeherr and Markus Fidler and Shahrokh
Valaee",
title = "A system-theoretic approach to bandwidth estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1040--1053",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2035115",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xi:2010:TOD,
author = "Yufang Xi and Edmund M. Yeh",
title = "Throughput optimal distributed power control of
stochastic wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1054--1066",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2035919",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2010:DAM,
author = "Song Guo and Victor C. M. Leung",
title = "A distributed algorithm for min-max tree and max-min
cut problems in communication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1067--1076",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2038998",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2010:FBS,
author = "Bing Hu and Kwan L. Yeung",
title = "Feedback-based scheduling for load-balanced two-stage
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1077--1090",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037318",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2010:PMS,
author = "Ming Yu and Mengchu Zhou",
title = "A performance modeling scheme for multistage switch
networks with phase-type and bursty traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1091--1104",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036437",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lakshmanan:2010:APS,
author = "Sriram Lakshmanan and Cheng-Lin Tsao and Raghupathy
Sivakumar",
title = "{Aegis}: physical space security for wireless networks
with smart antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1105--1118",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037621",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2010:SPT,
author = "Yanming Shen and Shivendra S. Panwar and H. Jonathan
Chao",
title = "{SQUID}: a practical 100\% throughput scheduler for
crosspoint buffered switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1119--1131",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2042460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2010:PDW,
author = "Yunhao Liu and Kebin Liu and Mo Li",
title = "Passive diagnosis for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1132--1144",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037497",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2010:MCW,
author = "Xiang-Yang Li and Yunhao Liu and Shi Li and ShaoJie
Tang",
title = "Multicast capacity of wireless ad hoc networks under
{Gaussian} channel model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1145--1157",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2037431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sengupta:2010:NCA,
author = "Sudipta Sengupta and Shravan Rayanchu and Suman
Banerjee",
title = "Network coding-aware routing in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1158--1170",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2042727",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zafer:2010:TPE,
author = "Murtaza Zafer and Bong Jun Ko and Ivan Wang-Hei Ho",
title = "Transmit power estimation using spatially diverse
measurements under wireless fading",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1171--1180",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Salameh:2010:CAS,
author = "Haythem A. Bany Salameh and Marwan Krunz and Ossama
Younis",
title = "Cooperative adaptive spectrum sharing in cognitive
radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1181--1194",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039490",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2010:DBC,
author = "Yong Liu",
title = "Delay bounds of chunk-based peer-to-peer video
streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1195--1206",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2038155",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koksal:2010:RQS,
author = "Can Emre Koksal",
title = "Rate quantization and the speedup required to achieve
100\% throughput for multicast over crossbar switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1207--1219",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2038582",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gobjuka:2010:ETD,
author = "Hassan Gobjuka and Yuri J. Breitbart",
title = "{Ethernet} topology discovery for networks with
incomplete information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1220--1233",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039757",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fadlullah:2010:DCA,
author = "Zubair M. Fadlullah and Tarik Taleb and Athanasios V.
Vasilakos and Mohsen Guizani and Nei Kato",
title = "{DTRAB}: combating against attacks on encrypted
protocols through traffic-feature analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1234--1247",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039492",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2010:MAM,
author = "Di Wu and Yong Liu and Keith W. Ross",
title = "Modeling and analysis of multichannel {P2P} live video
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1248--1260",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2038910",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Loiseau:2010:ISS,
author = "Patrick Loiseau and Paulo Gon{\c{c}}alves and
Guillaume Dewaele and Pierre Borgnat and Patrice Abry
and Pascale Vicat-Blanc Primet",
title = "Investigating self-similarity and heavy-tailed
distributions on a large-scale experimental facility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1261--1274",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2042726",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barbera:2010:QSA,
author = "Mario Barbera and Alfio Lombardo and Carla Panarello
and Giovanni Schembra",
title = "Queue stability analysis and performance evaluation of
a {TCP}-compliant window management mechanism",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1275--1288",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2040628",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramachandran:2010:SST,
author = "Kishore Ramachandran and Ravi Kokku and Honghai Zhang
and Marco Gruteser",
title = "{Symphony}: synchronous two-phase rate and power
control in 802.11 {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1289--1302",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2040036",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2010:RAG,
author = "Lijun Chen and Steven H. Low and John C. Doyle",
title = "Random access game and medium access control design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1303--1316",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2041066",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yin:2010:SLO,
author = "Changchuan Yin and Long Gao and Shuguang Cui",
title = "Scaling laws for overlaid wireless networks: a
cognitive radio network versus a primary network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1317--1329",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2041467",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2010:CMS,
author = "Bill Lin and Isaac Keslassy",
title = "The concurrent matching switch architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1330--1343",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2040289",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2010:ASI,
author = "Xiaolong Li and Homayoun Yousefi'zadeh",
title = "Analysis, simulation, and implementation of {VCP}: a
wireless profiling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1345--1358",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2041249",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Afanasyev:2010:UPU,
author = "Mikhail Afanasyev and Tsuwei Chen and Geoffrey M.
Voelker and Alex C. Snoeren",
title = "Usage patterns in an urban {WiFi} network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1359--1372",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2040087",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fashandi:2010:PDP,
author = "Shervan Fashandi and Shahab Oveis Gharan and Amir K.
Khandani",
title = "Path diversity over packet switched networks:
performance analysis and rate allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1373--1386",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043368",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2010:EWM,
author = "Jun Luo and Catherine Rosenberg and Andr{\'e} Girard",
title = "Engineering wireless mesh networks: joint scheduling,
routing, power control, and rate adaptation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1387--1400",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2041788",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Grokop:2010:SSB,
author = "Leonard H. Grokop and David N. C. Tse",
title = "Spectrum sharing between wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1401--1412",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2010:RNO,
author = "Irene Y. Chen and Li-Da Tong and Yi-Ming Huang",
title = "Rearrangeable nonblocking optical interconnection
network fabrics with crosstalk constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1413--1421",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2044515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2010:QDW,
author = "Ao Tang and Lachlan L. H. Andrew and Krister Jacobsson
and Karl H. Johansson and H{\aa}kan Hjalmarsson and
Steven H. Low",
title = "Queue dynamics with window flow control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1422--1435",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2047951",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2010:MCM,
author = "S. Q. Zheng and Jianping Wang and Bing Yang and Mei
Yang",
title = "Minimum-cost multiple paths subject to minimum link
and node sharing in a network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1436--1449",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2044514",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Acer:2010:WSR,
author = "Utku G{\"u}nay Acer and Shivkumar Kalyanaraman and
Alhussein A. Abouzeid",
title = "Weak state routing for large-scale dynamic networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1450--1463",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043113",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Thejaswi:2010:DOS,
author = "P. S. Chandrashekhar Thejaswi and Junshan Zhang and
Man-On Pun and H. Vincent Poor and Dong Zheng",
title = "Distributed opportunistic scheduling with two-level
probing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1464--1477",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2042610",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Brosh:2010:DFT,
author = "Eli Brosh and Salman Abdul Baset and Vishal Misra and
Dan Rubenstein and Henning Schulzrinne",
title = "The delay-friendliness of {TCP} for real-time
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1478--1491",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050780",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramachandran:2010:PCA,
author = "Madanagopal Ramachandran and N. Usha Rani and Timothy
A. Gonsalves",
title = "Path computation algorithms for dynamic service
provisioning with protection and inverse multiplexing
in {SDH\slash SONET} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1492--1504",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043538",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Finamore:2010:KSP,
author = "Alessandro Finamore and Marco Mellia and Michela Meo
and Dario Rossi",
title = "{KISS}: stochastic packet inspection classifier for
{UDP} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1505--1515",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2044046",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Giustiniano:2010:MTO,
author = "Domenico Giustiniano and David Malone and Douglas J.
Leith and Konstantina Papagiannaki",
title = "Measuring transmission opportunities in 802.11 links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1516--1529",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bulut:2010:CEM,
author = "Eyuphan Bulut and Zijian Wang and Boleslaw Karol
Szymanski",
title = "Cost-effective multiperiod spraying for routing in
delay-tolerant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1530--1543",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043744",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bateni:2010:MVO,
author = "MohammadHossein Bateni and Alexandre Gerber and
MohammadTaghi Hajiaghayi and Subhabrata Sen",
title = "Multi-{VPN} optimization for scalable routing via
relaying",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1544--1556",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2043743",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Christodoulopoulos:2010:ORW,
author = "Konstantinos Christodoulopoulos and Konstantinos
Manousakis and Emmanouel Varvarigos",
title = "Offline routing and wavelength assignment in
transparent {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1557--1570",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2044585",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2010:CML,
author = "Yan Wu and Zhoujia Mao and Sonia Fahmy and Ness B.
Shroff",
title = "Constructing maximum-lifetime data gathering forests
in sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1571--1584",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2045896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2010:OSA,
author = "Tianxiong Ji and Eleftheria Athanasopoulou and R.
Srikant",
title = "On optimal scheduling algorithms for small generalized
switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1585--1598",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2045394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Beheshti:2010:OPB,
author = "Neda Beheshti and Emily Burmeister and Yashar Ganjali
and John E. Bowers and Daniel J. Blumenthal and Nick
McKeown",
title = "Optical packet buffers for backbone {Internet}
routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1599--1609",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048924",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chu:2010:OCS,
author = "Shan Chu and Xin Wang",
title = "Opportunistic and cooperative spatial multiplexing in
{MIMO} ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1610--1623",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049027",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alfano:2010:CSW,
author = "Giusi Alfano and Michele Garetto and Emilio Leonardi
and Valentina Martina",
title = "Capacity scaling of wireless networks with
inhomogeneous node density: lower bounds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1624--1636",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048719",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yi:2010:MSL,
author = "Yung Yi and Gustavo {De Veciana} and Sanjay
Shakkottai",
title = "{MAC} scheduling with low overheads by learning
neighborhood contention patterns",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1637--1650",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050903",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Forestiero:2010:SCB,
author = "Agostino Forestiero and Emilio Leonardi and Carlo
Mastroianni and Michela Meo",
title = "Self-chord: a bio-inspired {P2P} framework for
self-organizing distributed systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1651--1664",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2046745",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bremler-Barr:2010:PPE,
author = "Anat Bremler-Barr and David Hay and Danny Hendler and
Ron M. Roth",
title = "{PEDS}: a parallel error detection scheme for {TCAM}
devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "5",
pages = "1665--1675",
month = oct,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2047730",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:14 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bouabdallah:2010:DAM,
author = "Nizar Bouabdallah and Rami Langar and Raouf Boutaba",
title = "Design and analysis of mobility-aware clustering
algorithms for wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1677--1690",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049579",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shakkottai:2010:MCL,
author = "Srinivas Shakkottai and Xin Liu and R. Srikant",
title = "The multicast capacity of large multihop wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1691--1700",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Blough:2010:AAW,
author = "Douglas M. Blough and G. Resta and P. Santi",
title = "Approximation algorithms for wireless link scheduling
with {SINR}-based interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1701--1712",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2047511",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kompella:2010:OSB,
author = "Sastry Kompella and Jeffrey E. Wieselthier and Anthony
Ephremides and Hanif D. Sherali and Gam D. Nguyen",
title = "On optimal {SINR}-based scheduling in multihop
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1713--1724",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shetty:2010:IQR,
author = "Nikhil Shetty and Galina Schwartz and Jean Walrand",
title = "{Internet} {QoS} and regulations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1725--1737",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048757",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ko:2010:EBI,
author = "Young Myoung Ko and Natarajan Gautam",
title = "Epidemic-based information dissemination in wireless
mobile sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1738--1751",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048122",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kirsch:2010:POM,
author = "Adam Kirsch and Michael Mitzenmacher",
title = "The power of one move: hashing schemes for hardware",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1752--1765",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2047868",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tajer:2010:MDG,
author = "Ali Tajer and Xiaodong Wang",
title = "Multiuser diversity gain in cognitive networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1766--1779",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gupta:2010:SPS,
author = "Ashima Gupta and Debalina Ghosh and Prasant
Mohapatra",
title = "Scheduling prioritized services in multihop {OFDMA}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1780--1792",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049657",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sen:2010:MDN,
author = "Soumya Sen and Youngmi Jin and Roch Gu{\'e}rin and
Kartik Hosanagar",
title = "Modeling the dynamics of network technology adoption
and the role of converters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1793--1805",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2048923",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2010:BTL,
author = "Zheng Yang and Yunhao Liu and Xiang-Yang Li",
title = "Beyond trilateration: on the localizability of
wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1806--1814",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049578",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The proliferation of wireless and mobile devices has
fostered the demand of context-aware applications, in
which location is often viewed as one of the most
significant contexts. Classically, trilateration is
widely employed for testing network localizability;
even in many cases, it wrongly recognizes a localizable
graph as nonlocalizable. In this study, we analyze the
limitation of trilateration-based approaches and
propose a novel approach that inherits the simplicity
and efficiency of trilateration and, at the same time,
improves the performance by identifying more
localizable nodes. We prove the correctness and
optimality of this design by showing that it is able to
locally recognize all one-hop localizable nodes. To
validate this approach, a prototype system with 60
wireless sensors is deployed. Intensive and large-scale
simulations are further conducted to evaluate the
scalability and efficiency of our design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2010:IDI,
author = "Zheng Zhang and Ying Zhang and Y. Charlie Hu and Z.
Morley Mao and Randy Bush",
title = "{iSPY}: detecting {IP} prefix hijacking on my own",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1815--1828",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2066284",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IP prefix hijacking remains a major threat to the
security of the Internet routing system due to a lack
of authoritative prefix ownership information. Despite
many efforts in designing IP prefix hijack detection
schemes, no existing design can satisfy all the
critical requirements of a truly effective system:
real-time, accurate, lightweight, easily and
incrementally deployable, as well as robust in victim
notification. In this paper, we present a novel
approach that fulfills all these goals by monitoring
network reachability from key external transit networks
to one's own network through lightweight
prefix-owner-based active probing. Using the
prefix-owner's view of reachability, our detection
system, iSPY, can differentiate between IP prefix
hijacking and network failures based on the observation
that hijacking is likely to result in topologically
more diverse polluted networks and unreachability.
Through detailed simulations of Internet routing,
25-day deployment in 88 autonomous systems (ASs) (108
prefixes), and experiments with hijacking events of our
own prefix from multiple locations, we demonstrate that
iSPY is accurate with false negative ratio below 0.45\%
and false positive ratio below 0.17\%. Furthermore,
iSPY is truly real-time; it can detect hijacking events
within a few minutes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liao:2010:SIR,
author = "Yong Liao and Lixin Gao and Roch Gu{\'e}rin and Zhi-Li
Zhang",
title = "Safe interdomain routing under diverse commercial
agreements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1829--1840",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2049858",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kasbekar:2010:SAF,
author = "Gaurav S. Kasbekar and Saswati Sarkar",
title = "Spectrum auction framework for access allocation in
cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1841--1854",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051453",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Berbecaru:2010:FSM,
author = "Diana Berbecaru and Luca Albertalli and Antonio Lioy",
title = "The {ForwardDiffsig} scheme for multicast
authentication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1855--1868",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2052927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saleh:2010:DPW,
author = "Mohammad A. Saleh and Ahmed E. Kamal",
title = "Design and provisioning of {WDM} networks with
many-to-many traffic grooming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1869--1882",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051234",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See erratum \cite{Saleh:2011:EDP}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lucerna:2010:AMB,
author = "Diego Lucerna and Massimo Tornatore and Achille
Pattavina",
title = "Algorithms and models for backup reprovisioning in
{WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1883--1894",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2081684",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2010:DRN,
author = "Hyang-Won Lee and Eytan Modiano and Kayi Lee",
title = "Diverse routing in networks with probabilistic
failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1895--1907",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050490",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2010:CLH,
author = "Reuven Cohen and Guy Grebla and Liran Katzir",
title = "Cross-layer hybrid {FEC\slash ARQ} reliable multicast
with adaptive modulation and coding in broadband
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1908--1920",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050902",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Park:2010:MAC,
author = "Jaeok Park and Mihaela {Van Der Schaar}",
title = "Medium access control protocols with memory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1921--1934",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2050699",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2010:VIM,
author = "Kaidi Huang and Ken R. Duffy and David Malone",
title = "On the validity of {IEEE 802.11 MAC} modeling
hypotheses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1935--1948",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051335",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Camp:2010:MRA,
author = "Joseph Camp and Edward Knightly",
title = "Modulation rate adaptation in urban and vehicular
environments: cross-layer implementation and
experimental evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1949--1962",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2051454",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shpungin:2010:NOM,
author = "Hanan Shpungin and Michael Segal",
title = "Near-optimal multicriteria spanner constructions in
wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1963--1976",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2053381",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ficara:2010:ECB,
author = "Domenico Ficara and Andrea {Di Pietro} and Stefano
Giordano and Gregorio Procissi and Fabio Vitucci",
title = "Enhancing counting bloom filters through
{Huffman}-coded multilayer structures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1977--1987",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2055243",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kini:2010:FRD,
author = "Shrinivasa Kini and Srinivasan Ramasubramanian and
Amund Kvalbein and Audun Fosselie Hansen",
title = "Fast recovery from dual-link or single-node failures
in {IP} networks using tunneling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1988--1999",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2055887",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altman:2011:FCF,
author = "Eitan Altman and Francesco {De Pellegrini}",
title = "Forward correction and fountain codes in
delay-tolerant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "1--13",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091968",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Delay-tolerant ad hoc networks leverage the mobility
of relay nodes to compensate for lack of permanent
connectivity and thus enable communication between
nodes that are out of range of each other. To decrease
delivery delay, the information to be delivered is
replicated in the network. Our objective in this paper
is to study a class of replication mechanisms that
include coding in order to improve the probability of
successful delivery within a given time limit. We
propose an analytical approach that allows to quantify
tradeoffs between resources and performance measures
(energy and delay). We study the effect of coding on
the performance of the network while optimizing
parameters that govern routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rolando:2011:SSF,
author = "Pierluigi Rolando and Riccardo Sisto and Fulvio
Risso",
title = "{SPAF}: stateless {FSA}-based packet filters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "14--27",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2056698",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a stateless packet filtering technique
based on finite-state automata (FSA). FSAs provide a
comprehensive framework with well-defined composition
operations that enable the generation of stateless
filters from high-level specifications and their
compilation into efficient executable code without
resorting to various opportunistic optimization
algorithms. In contrast with most traditional
approaches, memory safety and termination can be
enforced with minimal run-time overhead even in cyclic
filters, thus enabling full parsing of complex
protocols and supporting recursive encapsulation
relationships.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2011:EMC,
author = "Zhong Zhou and Zheng Peng and Jun-Hong Cui and Zhijie
Shi",
title = "Efficient multipath communication for time-critical
applications in underwater acoustic sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "28--41",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2055886",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the long propagation delay and high error rate
of acoustic channels, it is very challenging to provide
reliable data transfer for time-critical applications
in an energy-efficient way. On the one hand,
traditional retransmission upon failure usually
introduces very large end-to-end delay and is thus not
proper for time-critical services. On the other hand,
common approaches without retransmission consume lots
of energy. In this paper, we propose a new multipath
power-control transmission (MPT) scheme, which can
guarantee certain end-to-end packet error rate while
achieving a good balance between the overall energy
efficiency and the end-to-end packet delay. MPT smartly
combines power control with multipath routing and
packet combining at the destination.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2011:SMC,
author = "Yipeng Zhou and Dah-Ming Chiu and John C. S. Lui",
title = "A simple model for chunk-scheduling strategies in
{P2P} streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "42--54",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2065237",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer (P2P) streaming tries to achieve
scalability (like P2P file distribution) and at the
same time meet real-time playback requirements. It is a
challenging problem still not well understood. In this
paper, we describe a simple stochastic model that can
be used to compare different downloading strategies to
random peer selection. Based on this model, we study
the tradeoffs between supported peer population, buffer
size, and playback continuity. We first study two
simple strategies: Rarest First (RF) and Greedy. The
former is a well-known strategy for P2P file sharing
that gives good scalability by trying to propagate the
chunks of a file to as many peers as quickly as
possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2011:LSR,
author = "Hyunseok Chang and Sugih Jamin and Wenjie Wang",
title = "Live streaming with receiver-based peer-division
multiplexing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "55--68",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2056382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A number of commercial peer-to-peer (P2P) systems for
live streaming have been introduced in recent years.
The behavior of these popular systems has been
extensively studied in several measurement papers. Due
to the proprietary nature of these commercial systems,
however, these studies have to rely on a ``black-box''
approach, where packet traces are collected from a
single or a limited number of measurement points, to
infer various properties of traffic on the control and
data planes. Although such studies are useful to
compare different systems from the end-user's
perspective, it is difficult to intuitively understand
the observed properties without fully
reverse-engineering the underlying systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2011:CND,
author = "Reuven Cohen and Boris Kapchits",
title = "Continuous neighbor discovery in asynchronous sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "69--79",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2053943",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In most sensor networks, the nodes are static.
Nevertheless, node connectivity is subject to changes
because of disruptions in wireless communication,
transmission power changes, or loss of synchronization
between neighboring nodes. Hence, even after a sensor
is aware of its immediate neighbors, it must
continuously maintain its view, a process we call
continuous neighbor discovery. In this work, we
distinguish between neighbor discovery during sensor
network initialization and continuous neighbor
discovery. We focus on the latter and view it as a
joint task of all the nodes in every connected
segment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Varvello:2011:ESL,
author = "Matteo Varvello and Stefano Ferrari and Ernst Biersack
and Christophe Diot",
title = "Exploring second life",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "80--91",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2060351",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Social virtual worlds such as Second Life (SL) are
digital representations of the real world where
human-controlled avatars evolve and interact through
social activities. Understanding the characteristics of
virtual worlds can be extremely valuable in order to
optimize their design. In this paper, we perform an
extensive analysis of SL. We exploit standard avatar
capabilities to monitor the virtual world, and we
emulate avatar behaviors in order to evaluate user
experience. We make several surprising observations. We
find that 30\% of the regions are never visited during
the six-day monitoring period, whereas less than 1\% of
the regions have large peak populations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Conway:2011:FSS,
author = "Adrian E. Conway",
title = "Fast simulation of service availability in mesh
networks with dynamic path restoration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "92--101",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2053382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A fast simulation technique based on importance
sampling is developed for the analysis of path service
availability in mesh networks with dynamic path
restoration. The method combines the simulation of the
path rerouting algorithm with a ``dynamic path failure
importance sampling'' (DPFS) scheme to estimate path
availabilities efficiently. In DPFS, the failure rates
of network elements are biased at increased rates until
path failures are observed under rerouting. The
simulated model uses ``failure equivalence groups,''
with finite/infinite sources of failure events and
finite/infinite pools of repair personnel, to
facilitate the modeling of bidirectional link failures,
multiple in-series link cuts, optical amplifier
failures along links, node failures, and more general
geographically distributed failure scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:SCE,
author = "Dan Li and Chuanxiong Guo and Haitao Wu and Kun Tan
and Yongguang Zhang and Songwu Lu and Jianping Wu",
title = "Scalable and cost-effective interconnection of
data-center servers using dual server ports",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "102--114",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2053718",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The goal of data-center networking is to interconnect
a large number of server machines with low equipment
cost while providing high network capacity and high
bisection width. It is well understood that the current
practice where servers are connected by a tree
hierarchy of network switches cannot meet these
requirements. In this paper, we explore a new
server-interconnection structure. We observe that the
commodity server machines used in today's data centers
usually come with two built-in Ethernet ports, one for
network connection and the other left for backup
purposes. We believe that if both ports are actively
used in network connections, we can build a scalable,
cost-effective interconnection structure without either
the expensive higher-level large switches or any
additional hardware on servers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2011:PTP,
author = "Lihua Yuan and Chen-Nee Chuah and Prasant Mohapatra",
title = "{ProgME}: towards programmable network measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "115--128",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2066987",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic measurements provide critical input for a wide
range of network management applications, including
traffic engineering, accounting, and security analysis.
Existing measurement tools collect traffic statistics
based on some predetermined, inflexible concept of
``flows.'' They do not have sufficient built-in
intelligence to understand the application requirements
or adapt to the traffic conditions. Consequently, they
have limited scalability with respect to the number of
flows and the heterogeneity of monitoring applications.
We present ProgME, a Programmable MEasurement
architecture based on a novel concept of flowset--an
arbitrary set of flows defined according to application
requirements and/or traffic conditions. Through a
simple flowset composition language, ProgME can
incorporate application requirements, adapt itself to
circumvent the scalability challenges posed by the
large number of flows, and achieve a better
application-perceived accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gupta:2011:DAO,
author = "Gagan Raj Gupta and Ness B. Shroff",
title = "Delay analysis and optimality of scheduling policies
for multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "129--141",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2095506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We analyze the delay performance of a multihop
wireless network with a fixed route between each
source-destination pair. We develop a new queue
grouping technique to handle the complex correlations
of the service process resulting from the multihop
nature of the flows. A general set-based interference
model is assumed that imposes constraints on links that
can be served simultaneously at any given time. These
interference constraints are used to obtain a
fundamental lower bound on the delay performance of any
scheduling policy for the system. We present a
systematic methodology to derive such lower bounds. For
a special wireless system, namely the clique, we design
a policy that is sample-path delay-optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bianco:2011:CPS,
author = "Andrea Bianco and David Hay and Fabio Neri",
title = "Crosstalk-preventing scheduling in single-and
two-stage {AWG}-based cell switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "142--155",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2054105",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Array waveguide grating (AWG)-based optical switching
fabrics are receiving increasing attention due to their
simplicity and good performance. However, AWGs are
affected by coherent crosstalk that can significantly
impair system operation when the same wavelength is
used simultaneously on several input ports. To permit
large port counts in a $ N \times N $ AWG, a possible
solution is to schedule data transmissions across the
AWG preventing switch configurations that generate
large crosstalk. We study the properties and the
existence conditions of switch configurations able to
control coherent crosstalk.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:BSB,
author = "Tianji Li and Douglas Leith and David Malone",
title = "Buffer sizing for 802.11-based networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "156--169",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089992",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the sizing of network buffers in IEEE
802.11-based networks. Wireless networks face a number
of fundamental issues that do not arise in wired
networks. We demonstrate that the use of fixed-size
buffers in 802.11 networks inevitably leads to either
undesirable channel underutilization or unnecessary
high delays. We present two novel dynamic buffer-sizing
algorithms that achieve high throughput while
maintaining low delay across a wide range of network
conditions. Experimental measurements demonstrate the
utility of the proposed algorithms in a production WLAN
and a lab test bed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Canberk:2011:PUA,
author = "Berk Canberk and Ian F. Akyildiz and Sema Oktug",
title = "Primary user activity modeling using first-difference
filter clustering and correlation in cognitive radio
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "170--183",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2065031",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In many recent studies on cognitive radio (CR)
networks, the primary user activity is assumed to
follow the Poisson traffic model with exponentially
distributed interarrivals. The Poisson modeling may
lead to cases where primary user activities are modeled
as smooth and burst-free traffic. As a result, this may
cause the cognitive radio users to miss some available
but unutilized spectrum, leading to lower throughput
and high false-alarm probabilities. The main
contribution of this paper is to propose a novel model
to parametrize the primary user traffic in a more
efficient and accurate way in order to overcome the
drawbacks of the Poisson modeling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tague:2011:JAT,
author = "Patrick Tague and Sidharth Nabar and James A. Ritcey
and Radha Poovendran",
title = "Jamming-aware traffic allocation for multiple-path
routing using portfolio selection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "184--194",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2057515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multiple-path source routing protocols allow a data
source node to distribute the total traffic among
available paths. In this paper, we consider the problem
of jamming-aware source routing in which the source
node performs traffic allocation based on empirical
jamming statistics at individual network nodes. We
formulate this traffic allocation as a lossy network
flow optimization problem using portfolio selection
theory from financial statistics. We show that in
multisource networks, this centralized optimization
problem can be solved using a distributed algorithm
based on decomposition in network utility maximization
(NUM). We demonstrate the network's ability to estimate
the impact of jamming and incorporate these estimates
into the traffic allocation problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ho:2011:SMC,
author = "Ivan Wang-Hei Ho and Kin K. Leung and John W. Polak",
title = "Stochastic model and connectivity dynamics for
{VANETs} in signalized road systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "195--208",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2057257",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The space and time dynamics of moving vehicles
regulated by traffic signals governs the node
connectivity and communication capability of vehicular
ad hoc networks (VANETs) in urban environments.
However, none of the previous studies on node
connectivity has considered such dynamics with the
presence of traffic lights and vehicle interactions. In
fact, most of them assume that vehicles are distributed
homogeneously throughout the geographic area, which is
unrealistic. We introduce in this paper a stochastic
traffic model for VANETs in signalized urban road
systems. The proposed model is a composite of the fluid
model and stochastic model. The former characterizes
the general flow and evolution of the traffic stream so
that the average density of vehicles is readily
computable, while the latter takes into account the
random behavior of individual vehicles.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2011:LIP,
author = "Yi Xu and Wenye Wang",
title = "The limit of information propagation speed in
large-scale multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "209--222",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2057444",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the speed limit of information
propagation in large-scale multihop wireless networks,
which provides fundamental understanding of the fastest
information transportation and delivery that a wireless
network is able to accommodate. We show that there
exists a unified speed upper bound for broadcast and
unicast communications in large-scale wireless
networks. When network connectivity is considered, this
speed bound is a function of node density. If the
network noise is constant, the bound is a constant when
node density exceeds a threshold; if the network noise
is an increasing function of node density, the bound
decreases to zero when node density approaches
infinity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:UAO,
author = "Ruogu Li and Atilla Eryilmaz and Lei Ying and Ness B.
Shroff",
title = "A unified approach to optimizing performance in
networks serving heterogeneous flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "223--236",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2059038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the optimal control of communication networks
in the presence of heterogeneous traffic requirements.
Specifically, we distinguish the flows into two crucial
classes: inelastic for modeling high-priority,
delay-sensitive, and fixed-throughput applications; and
elastic for modeling low-priority, delay-tolerant, and
throughput-greedy applications. We note that the
coexistence of such diverse flows creates complex
interactions at multiple levels (e.g., flow and packet
levels), which prevent the use of earlier design
approaches that dominantly assume homogeneous traffic.
In this work, we develop the mathematical framework and
novel design methodologies needed to support such
heterogeneous requirements and propose provably optimal
network algorithms that account for the multilevel
interactions between the flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Meiners:2011:TTA,
author = "Chad R. Meiners and Alex X. Liu and Eric Torng",
title = "Topological transformation approaches to {TCAM}-based
packet classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "237--250",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2061864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Several range reencoding schemes have been proposed to
mitigate the effect of range expansion and the
limitations of small capacity, large power consumption,
and high heat generation of ternary content addressable
memory (TCAM)-based packet classification systems.
However, they all disregard the semantics of
classifiers and therefore miss significant
opportunities for space compression. In this paper, we
propose new approaches to range reencoding by taking
into account classifier semantics. Fundamentally
different from prior work, we view reencoding as a
topological transformation process from one colored
hyperrectangle to another, where the color is the
decision associated with a given packet. Stated another
way, we reencode the entire classifier by considering
the classifier's decisions rather than reencode only
ranges in the classifier ignoring the classifier's
decisions as prior work does.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Younis:2011:RRO,
author = "Ossama Mohamed Younis and Marwan M. Krunz and
Srinivasan Ramasubramanian",
title = "{ROC}: resilient online coverage for surveillance
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "251--264",
month = feb,
year = "2011",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider surveillance applications in which sensors
are deployed in large numbers to improve coverage
fidelity. Previous research has studied how to select
active sensor covers (subsets of nodes that cover the
field) to efficiently exploit redundant node deployment
and tolerate unexpected node failures. Little attention
was given to studying the tradeoff between fault
tolerance and energy efficiency in sensor coverage. In
this work, our objectives are twofold. First, we aim at
rapidly restoring field coverage under unexpected
sensor failures in an energy-efficient manner. Second,
we want to flexibly support different degrees of
redundancy in the field without needing centralized
control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xuan:2011:NCM,
author = "Yuanzhe Xuan and Chin-Tau Lea",
title = "Network-coding multicast networks with {QoS}
guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "265--274",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2062533",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is well known that without admission control,
network congestion is bound to occur. However, to
implement admission control is difficult in IP-based
networks, which are constructed out of the end-to-end
principle, and semantics of most major signaling
protocols can only be interpreted at the edge of the
network. Even if routers can perform admission control
internally, the path computation and the state updating
activities required for setting up and tearing down
each flow will overwhelm the network. A new QoS
architecture, called a nonblocking network, has been
proposed recently, and it requires no internal
admission control and can still offer hard QoS
guarantees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tapolcai:2011:NAF,
author = "J{\'a}nos Tapolcai and Bin Wu and Pin-Han Ho and Lajos
R{\'o}nyai",
title = "A novel approach for failure localization in
all-optical mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "275--285",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2068057",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Achieving fast and precise failure localization has
long been a highly desired feature in all-optical mesh
networks. Monitoring trail (m-trail) has been proposed
as the most general monitoring structure for achieving
unambiguous failure localization (UFL) of any single
link failure while effectively reducing the amount of
alarm signals flooding the networks. However, it is
critical to come up with a fast and intelligent m-trail
design approach for minimizing the number of m-trails
and the total bandwidth consumed, which ubiquitously
determines the length of the alarm code and bandwidth
overhead for the m-trail deployment, respectively. In
this paper, the m-trail design problem is
investigated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiang:2011:CLJ,
author = "Jerry T. Chiang and Yih-Chun Hu",
title = "Cross-layer jamming detection and mitigation in
wireless broadcast networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "286--298",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2068576",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless communication systems are often susceptible
to the jamming attack where adversaries attempt to
overpower transmitted signals by injecting a high level
of noise. Jamming is difficult to mitigate in broadcast
networks because transmitting and receiving are
inherently symmetric operations: A user that possesses
the key to decode a transmission can also use that key
to jam the transmission. We describe a code tree system
that provides input to the physical layer and helps the
physical layer circumvent jammers. In our system, the
transmitter has more information than any proper subset
of receivers. Each receiver cooperates with the
transmitter to detect any jamming that affects that
receiver.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saleh:2011:EDP,
author = "Mohammad A. Saleh and Ahmed E. Kamal",
title = "Erratum to {{\em Design and Provisioning of WDM
Networks With Many-to-Many Traffic Grooming}}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "1",
pages = "299--299",
month = feb,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2110910",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 08:56:22 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Saleh:2010:DPW}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:PCO,
author = "Peng Wang and Stephan Bohacek",
title = "Practical computation of optimal schedules in multihop
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "305--318",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2111462",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2011:PSL,
author = "Chi Zhang and Yang Song and Yuguang Fang and Yanchao
Zhang",
title = "On the price of security in large-scale wireless ad
hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "319--332",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2106162",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dubois-Ferriere:2011:VDL,
author = "Henri Dubois-Ferri{\`e}re and Matthias Grossglauser
and Martin Vetterli",
title = "Valuable detours: least-cost anypath routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "333--346",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2070844",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lakshmikantha:2011:IFA,
author = "Ashvin Lakshmikantha and Carolyn Beck and R. Srikant",
title = "Impact of file arrivals and departures on buffer
sizing in core routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "347--358",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2114365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:LTP,
author = "Ruhai Wang and Scott C. Burleigh and Paavan Parikh and
Che-Jen Lin and Bo Sun",
title = "{Licklider} transmission protocol ({LTP})-based {DTN}
for cislunar communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "359--368",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2060733",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2011:PRC,
author = "Cong Liu and Jie Wu",
title = "Practical routing in a cyclic {MobiSpace}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "369--382",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2079944",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liaskos:2011:TRL,
author = "Christos K. Liaskos and Sophia G. Petridou and
Georgios I. Papadimitriou",
title = "Towards realizable, low-cost broadcast systems for
dynamic environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "383--392",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2062534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2011:SRW,
author = "Kyu-Han Kim and Kang G. Shin",
title = "Self-reconfigurable wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "393--404",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2096431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sadiq:2011:DOO,
author = "Bilal Sadiq and Seung Jun Baek and Gustavo {De
Veciana}",
title = "Delay-optimal opportunistic scheduling and
approximations: the log rule",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "405--418",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2068308",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Secci:2011:PEM,
author = "Stefano Secci and Jean-Louis Rougier and Achille
Pattavina and Fioravante Patrone and Guido Maier",
title = "Peering equilibrium multipath routing: a game theory
framework for {Internet} peering settlements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "419--432",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2062535",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2011:TST,
author = "Ping Xu and Xiang-Yang Li",
title = "{TOFU}: semi-truthful online frequency allocation
mechanism for wireless network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "433--446",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2067223",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Andrews:2011:SAM,
author = "Matthew Andrews and Lisa Zhang",
title = "Scheduling algorithms for multicarrier wireless data
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "447--455",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2064175",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wei:2011:MBI,
author = "Wei Wei and Bing Wang and Don Towsley and Jim Kurose",
title = "Model-based identification of dominant congested
links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "456--469",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2068058",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kasbekar:2011:LCG,
author = "Gaurav S. Kasbekar and Yigal Bejerano and Saswati
Sarkar",
title = "Lifetime and coverage guarantees through distributed
coordinate-free sensor activation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "470--483",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2077648",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2011:OAT,
author = "Joohwan Kim and Xiaojun Lin and Ness B. Shroff",
title = "Optimal anycast technique for delay-sensitive
energy-constrained asynchronous sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "484--497",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2072515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Flammini:2011:CRP,
author = "Michele Flammini and Alberto Marchetti-Spaccamela and
Gianpiero Monaco and Luca Moscardelli and Shmuel Zaks",
title = "On the complexity of the regenerator placement problem
in optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "498--511",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2068309",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Thatte:2011:PMA,
author = "Gautam Thatte and Urbashi Mitra and John Heidemann",
title = "Parametric methods for anomaly detection in aggregate
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "512--525",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2070845",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:SBD,
author = "Jung-Shian Li and Ching-Fang Yang and Jian-Hong Chen",
title = "Star-block design in two-level survivable optical
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "526--539",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2069571",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:CBL,
author = "Xiaoping Wang and Jun Luo and Yunhao Liu and Shanshan
Li and Dezun Dong",
title = "Component-based localization in sparse wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "540--548",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2072965",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2011:HBS,
author = "Libin Jiang and Venkat Anantharam and Jean Walrand",
title = "How bad are selfish investments in network security?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "549--560",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2071397",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Elhawary:2011:EEP,
author = "Mohamed Elhawary and Zygmunt J. Haas",
title = "Energy-efficient protocol for cooperative networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "561--574",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089803",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ni:2011:CSP,
author = "Jian Ni and R. Srikant and Xinzhou Wu",
title = "Coloring spatial point processes with applications to
peer discovery in large wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "575--588",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2090172",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Boche:2011:PBU,
author = "Holger Boche and Siddharth Naik and Martin Schubert",
title = "{Pareto} boundary of utility sets for multiuser
wireless systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "589--601",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2083683",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2011:LRM,
author = "Jian Qiu and Mohan Gurusamy and Kee Chaing Chua and
Yong Liu",
title = "Local restoration with multiple spanning trees in
metro {Ethernet} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "2",
pages = "602--614",
month = apr,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2079945",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:50 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Balakrishnan:2011:MTE,
author = "Mahesh Balakrishnan and Tudor Marian and Kenneth P.
Birman and Hakim Weatherspoon and Lakshmi Ganesh",
title = "{Maelstrom}: transparent error correction for
communication between data centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "617--629",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2144616",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rhee:2011:LWN,
author = "Injong Rhee and Minsu Shin and Seongik Hong and
Kyunghan Lee and Seong Joon Kim and Song Chong",
title = "On the {Levy}-walk nature of human mobility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "630--643",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2120618",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{ElRouayheb:2011:RNC,
author = "Salim {El Rouayheb} and Alex Sprintson and Costas
Georghiades",
title = "Robust network codes for unicast connections: a case
study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "644--656",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091424",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2011:SMP,
author = "Sheng Huang and Charles U. Martel and Biswanath
Mukherjee",
title = "Survivable multipath provisioning with differential
delay constraint in telecom mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "657--669",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2082560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hua:2011:BNE,
author = "Nan Hua and Jun Xu and Bill Lin and Haiquan Zhao",
title = "{BRICK}: a novel exact active statistics counter
architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "670--682",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2111461",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ficara:2011:DED,
author = "Domenico Ficara and Andrea {Di Pietro} and Stefano
Giordano and Gregorio Procissi and Fabio Vitucci and
Gianni Antichi",
title = "Differential encoding of {DFAs} for fast regular
expression matching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "683--694",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089639",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sung:2011:TSD,
author = "Yu-Wei Eric Sung and Xin Sun and Sanjay G. Rao and
Geoffrey G. Xie and David A. Maltz",
title = "Towards systematic design of enterprise networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "695--708",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089640",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leconte:2011:IBT,
author = "Mathieu Leconte and Jian Ni and R. Srikant",
title = "Improved bounds on the throughput efficiency of greedy
maximal scheduling in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "709--720",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rengarajan:2011:AAE,
author = "Balaji Rengarajan and Gustavo {De Veciana}",
title = "Architecture and abstractions for environment and
traffic-aware system-level coordination of wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "721--734",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2098043",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Katrinis:2011:DWO,
author = "Kostas M. Katrinis and Anna Tzanakaki",
title = "On the dimensioning of {WDM} optical networks with
impairment-aware regeneration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "735--746",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2090540",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2011:OCA,
author = "Xiaolan Joy Zhang and Sun-Il Kim and Steven S.
Lumetta",
title = "Opportunity cost analysis for dynamic wavelength
routed mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "747--759",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2087353",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Das:2011:SPS,
author = "Saumitra Das and Konstantina Papagiannaki and Suman
Banerjee and Y. C. Tay",
title = "{SWARM}: the power of structure in community wireless
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "760--773",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089061",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2011:TOR,
author = "Murali Kodialam and T. V. Lakshman and Sudipta
Sengupta",
title = "Traffic-oblivious routing in the hose model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "774--787",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2099666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barlet-Ros:2011:PRM,
author = "Pere Barlet-Ros and Gianluca Iannaccone and Josep
Sanju{\`a}s-Cuxart and Josep Sol{\'e}-Pareta",
title = "Predictive resource management of multiple monitoring
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "788--801",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089469",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2011:CSB,
author = "Richard T. B. Ma and Dah Ming Chiu and John C. S. Lui
and Vishal Misra and Dan Rubenstein",
title = "On cooperative settlement between content, transit,
and eyeball {Internet} service providers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "802--815",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089533",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2011:ATO,
author = "Libin Jiang and Jean Walrand",
title = "Approaching throughput-optimality in distributed
{CSMA} scheduling algorithms with collisions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "816--829",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2089804",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Augustin:2011:MMR,
author = "Brice Augustin and Timur Friedman and Renata
Teixeira",
title = "Measuring multipath routing in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "830--840",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2096232",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ying:2011:CSP,
author = "Lei Ying and Sanjay Shakkottai and Aneesh Reddy and
Shihuan Liu",
title = "On combining shortest-path and back-pressure routing
over multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "841--854",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2094204",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2011:ULG,
author = "Shuyi Chen and Kaustubh R. Joshi and Matti A. Hiltunen
and Richard D. Schlichting and William H. Sanders",
title = "Using link gradients to predict the impact of network
latency on multitier applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "855--868",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2098044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sorour:2011:ANC,
author = "Sameh Sorour and Shahrokh Valaee",
title = "An adaptive network coded retransmission scheme for
single-hop wireless multicast broadcast services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "869--878",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091652",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sharma:2011:OAR,
author = "Sushant Sharma and Yi Shi and Y. Thomas Hou and Sastry
Kompella",
title = "An optimal algorithm for relay node assignment in
cooperative ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "879--892",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091148",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chau:2011:CLS,
author = "Chi-Kin Chau and Minghua Chen and Soung Chang Liew",
title = "Capacity of large-scale {CSMA} wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "893--906",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2095880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Babarczi:2011:ALF,
author = "P{\'e}ter Babarczi and J{\'a}nos Tapolcai and Pin-Han
Ho",
title = "Adjacent link failure localization with monitoring
trails in all-optical mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "907--920",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2096429",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xia:2011:RAP,
author = "Ming Xia and Massimo Tornatore and Charles U. Martel
and Biswanath Mukherjee",
title = "Risk-aware provisioning for optical {WDM} mesh
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "3",
pages = "921--931",
month = jun,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2095037",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:51 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vishwanath:2011:ALP,
author = "Arun Vishwanath and Vijay Sivaraman and George N.
Rouskas",
title = "Anomalous loss performance for mixed real-time and
{TCP} traffic in routers with very small buffers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "933--946",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the past few years there has been vigorous debate
regarding the size of buffers required at core Internet
routers. Recent arguments supported by theory and
experimentation show that under certain conditions,
core router buffer sizes of a few tens of packets
suffice for realizing acceptable end-to-end TCP
throughputs. This is a significant step toward the
realization of optical packet switched (OPS) networks,
which are inherently limited in their ability to buffer
optical signals. However, prior studies have largely
ignored the presence of real-time traffic, which is
increasing in importance as a source of revenue for
Internet service providers. In this paper, we study the
interaction that happens between real-time (open-loop)
and TCP (closed-loop) traffic when they multiplex at
buffers of very small size (few tens of packets) and
make a significant discovery--namely that in a specific
range of buffer size, real-time traffic losses increase
as buffer size becomes larger.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2011:PFD,
author = "Ren-Shiou Liu and Kai-Wei Fan and Zizhan Zheng and
Prasun Sinha",
title = "Perpetual and fair data collection for environmental
energy harvesting sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "947--960",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091280",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Renewable energy enables sensor networks with the
capability to recharge and provide perpetual data
services. Due to low recharging rates and the dynamics
of renewable energy such as solar and wind power,
providing services without interruptions caused by
battery runouts is nontrivial. Most environment
monitoring applications require data collection from
all nodes at a steady rate. The objective of this paper
is to design a solution for fair and high throughput
data extraction from all nodes in the presence of
renewable energy sources. Specifically, we seek to
compute the lexicographically maximum data collection
rate and routing paths for each node such that no node
will ever run out of energy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2011:FFI,
author = "Zhipeng Yang and Hongyi Wu",
title = "{FINDERS}: a featherlight information network with
delay-endurable {RFID} support",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "961--974",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091425",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the use of radio
frequency identification (RFID) gear for wireless
sensor network construction, aiming to find events of
interest and gather aggregate information. In
particular, we develop a featherlight information
network with delay-endurable RFID support (FINDERS),
composed of passive RFID tags that are ultralight,
durable, and flexible, without power supply for
long-lasting applications. FINDERS faces unprecedented
challenges in communication and networking due to its
sporadic wireless links, unique asymmetric
communication paradigm, intermittent computation
capability, and extremely small memory of tags. Several
effective techniques are proposed to address these
challenges, arriving at an efficient communication
protocol for FINDERS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{ElRakabawy:2011:PAP,
author = "Sherif M. ElRakabawy and Christoph Lindemann",
title = "A practical adaptive pacing scheme for {TCP} in
multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "975--988",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2095038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce and evaluate a feasible end-to-end
congestion control algorithm for overcoming the severe
deficiencies of TCP in IEEE 802.11 multihop wireless
networks. Our approach, which we denote as TCP with
Adaptive Pacing (TCP-AP), implements rate-based
scheduling of transmissions within the TCP congestion
window. The TCP source adaptively sets its transmission
rate using an estimate of the current
out-of-interference delay and the coefficient of
variation of recently measured round-trip times. TCP-AP
retains the end-to-end semantics of TCP and neither
relies on modifications at the routing or the link
layer nor requires cross-layer information from
intermediate nodes along the path. As opposed to
previous proposals that build on network simulators, we
implement and evaluate our approach in a real wireless
mesh test-bed comprising 20 nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahuja:2011:SFL,
author = "Satyajeet S. Ahuja and Srinivasan Ramasubramanian and
Marwan Krunz",
title = "{SRLG} failure localization in optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "989--999",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2103402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce the concepts of monitoring paths (MPs)
and monitoring cycles (MCs) for unique localization of
shared risk linked group (SRLG) failures in all-optical
networks. An SRLG failure causes multiple links to
break simultaneously due to the failure of a common
resource. MCs (MPs) start and end at the same
(distinct) monitoring location(s). They are constructed
such that any SRLG failure results in the failure of a
unique combination of paths and cycles. We derive
necessary and sufficient conditions on the set of MCs
and MPs needed for localizing any single SRLG failure
in an arbitrary graph. When a single monitoring
location is employed, we show that a network must be (k
+ 2)-edge connected for localizing all SRLG failures,
each involving up to k links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2011:CLS,
author = "Kayi Lee and Eytan Modiano and Hyang-Won Lee",
title = "Cross-layer survivability in {WDM}-based networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1000--1013",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2091426",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In layered networks, a single failure at a lower layer
may cause multiple failures in the upper layers. As a
result, traditional schemes that protect against single
failures may not be effective in multilayer networks.
In this paper, we introduce the problem of maximizing
the connectivity of layered networks. We show that
connectivity metrics in layered networks have
significantly different meaning than their single-layer
counterparts. Results that are fundamental to
survivable single-layer network design, such as the
Max-Flow Min-Cut Theorem, are no longer applicable to
the layered setting. We propose new metrics to measure
connectivity in layered networks and analyze their
properties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2011:SHW,
author = "Jingjing Zhang and Nirwan Ansari",
title = "Scheduling hybrid {WDM\slash TDM} passive optical
networks with nonzero laser tuning time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1014--1027",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2093150",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Owing to the high bandwidth provisioning, hybrid
wavelength division multiplexing/time division
multiplexing (WDM/TDM) passive optical network (PON) is
becoming an attractive future-proof access network
solution. In hybrid WDM/TDM PON, tunable lasers are
potential candidate light sources attributed to their
multiwavelength provisioning capability and color-free
property. Currently, the laser tuning time ranges from
a few tens of nanoseconds to seconds, or even minutes,
depending on the adopted technology. Different laser
tuning time may introduce different network
performance. To achieve small packet delay and ensure
fairness, the schedule length for given optical network
unit (ONU) requests is desired to be as short as
possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hwang:2011:CLO,
author = "June Hwang and Seong-Lyun Kim",
title = "Cross-layer optimization and network coding in
{CSMA\slash CA}-based wireless multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1028--1042",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2096430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the CSMA/CA multihop
networks where the two end-nodes transmit their packets
to each other and each intermediate node adopts network
coding for delivering bidirectional flows. In addition,
the neighbor nodes are randomly uniformly deployed with
the Poisson Point Process. By varying the combination
of the physical carrier-sensing range of the
transmitter node and the target signal-to-interference
ratio (SIR) set by the receiver node, we can control
the interference level in the network and the degree of
spatial reuse of a frequency band. The larger the
carrier-sensing range is, the smaller the interference
level, while the smaller the opportunity of getting a
channel by a node.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Burchard:2011:SSN,
author = "Almut Burchard and J{\"o}rg Liebeherr and Florin
Ciucu",
title = "On superlinear scaling of network delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1043--1056",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2095505",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate scaling properties of end-to-end delays
in packet networks for a flow that traverses a sequence
of H nodes and that experiences cross traffic at each
node. When the traffic flow and the cross traffic do
not satisfy independence assumptions, we find that
delay bounds scale faster than linearly. More
precisely, for exponentially bounded packetized
traffic, we show that delays grow with $ \Theta (H \log
H) $ in the number of nodes on the network path.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2011:TOO,
author = "Shihuan Liu and Lei Ying and R. Srikant",
title = "Throughput-optimal opportunistic scheduling in the
presence of flow-level dynamics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1057--1070",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2100826",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider multiuser scheduling in wireless networks
with channel variations and flow-level dynamics.
Recently, it has been shown that the MaxWeight
algorithm, which is throughput-optimal in networks with
a fixed number of users, fails to achieve the maximum
throughput in the presence of flow-level dynamics. In
this paper, we propose a new algorithm,
calledWorkload-based Scheduling with Learning, which is
provably throughput-optimal, requires no prior
knowledge of channels and user demands, and performs
significantly better than previously suggested
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kamal:2011:OPA,
author = "Ahmed E. Kamal and Aditya Ramamoorthy and Long Long
and Shizheng Li",
title = "Overlay protection against link failures using network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1071--1084",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2098418",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a network coding-based
protection scheme against single- and multiple-link
failures. The proposed strategy ensures that in a
connection, each node receives two copies of the same
data unit: one copy on the working circuit and a second
copy that can be extracted from linear combinations of
data units transmitted on a shared protection path.
This guarantees instantaneous recovery of data units
upon the failure of a working circuit. The strategy can
be implemented at an overlay layer, which makes its
deployment simple and scalable. While the proposed
strategy is similar in spirit to the work of Kamal in
2007 2010, there are significant differences.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cittadini:2011:WRR,
author = "Luca Cittadini and Giuseppe {Di Battista} and Massimo
Rimondini and Stefano Vissicchio",
title = "Wheel $+$ ring $=$ reel: the impact of route filtering
on the stability of policy routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1085--1096",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2106798",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Border Gateway Protocol (BGP) allows providers to
express complex routing policies preserving high
degrees of autonomy. However, unrestricted routing
policies can adversely impact routing stability. A key
concept to understand the interplay between autonomy
and expressiveness on one side, and stability on the
other side, is safety under filtering, i.e., guaranteed
stability under autonomous usage of route filters. BGP
route filters are used to selectively advertise
specific routes to specific neighbors. In this paper,
we provide a characterization of safety under
filtering, filling the large gap between previously
known necessary and sufficient conditions. Our
characterization is based on the absence of a
particular kind of dispute wheel, a structure involving
circular dependencies among routing preferences.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raza:2011:GNS,
author = "Saqib Raza and Yuanbo Zhu and Chen-Nee Chuah",
title = "Graceful network state migrations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1097--1110",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2097604",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A significant fraction of network events (such as
topology or route changes) and the resulting
performance degradation stem from premeditated network
management and operational tasks. This paper introduces
a general class of Graceful Network State Migration
(GNSM) problems, where the goal is to discover the
optimal sequence of operations that progressively
transition the network from its initial to a desired
final state while minimizing the overall performance
disruption. We investigate two specific GNSM problems:
(1) Link Weight Reassignment Scheduling (LWRS) studies
the optimal ordering of link weight updates to migrate
from an existing to a new link weight assignment; and
(2) Link Maintenance Scheduling (LMS) looks at how to
schedule link deactivations and subsequent
reactivations for maintenance purposes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chau:2011:ALS,
author = "Chi-Kin Chau and Prithwish Basu",
title = "Analysis of latency of stateless opportunistic
forwarding in intermittently connected networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1111--1124",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2103321",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Stateless opportunistic forwarding is a simple
fault-tolerant distributed scheme for packet delivery,
data gathering, and information querying in
intermittently connected networks by which packets are
forwarded to the next available neighbors in a ``random
walk'' fashion until they reach their intended
destinations or expire. It has been employed in diverse
situations, for instance, when: (1) the global network
topology is not known or is highly dynamic; (2) the
availability of the next-hop neighbors is not easily
controllable; or (3) the relaying nodes are
computationally constrained. Data delivery in sensor
networks, ad hoc networks, and delay-tolerant networks
are well-known applications besides searching in
peer-to-peer networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jaramillo:2011:OSF,
author = "Juan Jos{\'e} Jaramillo and R. Srikant",
title = "Optimal scheduling for fair resource allocation in ad
hoc networks with elastic and inelastic traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1125--1136",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2100083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of congestion control
and scheduling in ad hoc wireless networks that have to
support a mixture of best-effort and real-time traffic.
Optimization and stochastic network theory have been
successful in designing architectures for fair resource
allocation to meet long-term throughput demands.
However, to the best of our knowledge, strict packet
delay deadlines were not considered in this framework
previously. In this paper, we propose a model for
incorporating the quality-of-service (QoS) requirements
of packets with deadlines in the optimization
framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Urgaonkar:2011:NCR,
author = "Rahul Urgaonkar and Michael J. Neely",
title = "Network capacity region and minimum energy function
for a delay-tolerant mobile ad hoc network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1137--1150",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2103367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate two quantities of interest in a
delay-tolerant mobile ad hoc network: the network
capacity region and the minimum energy function. The
network capacity region is defined as the set of all
input rates that the network can stably support
considering all possible scheduling and routing
algorithms. Given any input rate vector in this region,
the minimum energy function establishes the minimum
time-average power required to support it. In this
paper, we consider a cell-partitioned model of a
delay-tolerant mobile ad hoc network with general
Markovian mobility. This simple model incorporates the
essential features of locality of wireless
transmissions as well as node mobility and enables us
to exactly compute the corresponding network capacity
and minimum energy function.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Giacomelli:2011:OPG,
author = "Riccardo Giacomelli and Radha Krishna Ganti and Martin
Haenggi",
title = "Outage probability of general ad hoc networks in the
high-reliability regime",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1151--1163",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2100099",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Outage probabilities in wireless networks depend on
various factors: the node distribution, the MAC scheme,
and the models for path loss, fading, and transmission
success. In prior work on outage characterization for
networks with randomly placed nodes, most of the
emphasis was put on networks whose nodes are
Poisson-distributed and where ALOHA is used as the MAC
protocol. In this paper, we provide a general framework
for the analysis of outage probabilities in the
high-reliability regime. The outage probability
characterization is based on two parameters: the
intrinsic spatial contention of the network, introduced
by Haenggi in a previous work, and the coordination
level achieved by the MAC as measured by the
interference scaling exponent introduced in this
paper.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:BBT,
author = "Shao-Cheng Wang and Ahmed Helmy",
title = "{BEWARE}: background traffic-aware rate adaptation for
{IEEE} 802.11",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1164--1177",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2106140",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IEEE 802.11-based devices employ rate adaptation
algorithms to dynamically switch data rates to
accommodate the fluctuating wireless channel
conditions. Many studies observed that when there are
other stations transmitting in the network, existing
rate adaptation performance degrades significantly due
to its inability to differentiate losses between
wireless noise and contention collisions. In this
paper, we first conduct a systematic evaluation on the
effectiveness of various rate adaptation protocols,
which try to address this issue by exploiting optional
RTS frames to isolate the wireless losses from
collision losses. We observe that these existing
schemes do not perform well in many background traffic
scenarios and can mislead the rate adaptation
algorithms to persist on using similar data rate
combinations regardless of background traffic level,
thus resulting in performance penalty in certain
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aziz:2011:UTR,
author = "Adel Aziz and David Starobinski and Patrick Thiran",
title = "Understanding and tackling the root causes of
instability in wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1178--1193",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2102771",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate, both theoretically and experimentally,
the stability of CSMA-based wireless mesh networks,
where a network is said to be stable if and only if the
queue of each relay node remains (almost surely)
finite. We identify two key factors that impact
stability: the network size and the so-called
``stealing effect,'' a consequence of the hidden-node
problem and nonzero transmission delays. We consider
the case of a greedy source and prove, by using
Foster's theorem, that three-hop networks are stable,
but only if the stealing effect is accounted for. We
also prove that four-hop networks are, on the contrary,
always unstable (even with the stealing effect) and
show by simulations that instability extends to more
complex linear and nonlinear topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lan:2011:SBS,
author = "Tian Lan and Xiaojun Lin and Mung Chiang and Ruby B.
Lee",
title = "Stability and benefits of suboptimal utility
maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1194--1207",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2144617",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network utility maximization has been widely used to
model resource allocation and network architectures.
However, in practice, often it cannot be solved
optimally due to complexity reasons. Thus motivated, we
address the following two questions in this paper: (1)
Can suboptimal utility maximization maintain queue
stability? (2) Can underoptimization of utility
objective function in fact benefit other network design
objectives? We quantify the following intuition: A
resource allocation that is suboptimal with respect to
a utility maximization formulation maintains maximum
flow-level stability when the utility gap is
sufficiently small and information delay is bounded,
and it can still provide a guaranteed size of stability
region otherwise.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pelechrinis:2011:MDA,
author = "Konstantinos Pelechrinis and Ioannis Broustis and
Srikanth V. Krishnamurthy and Christos Gkantsidis",
title = "A measurement-driven anti-jamming system for 802.11
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1208--1222",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2106139",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Dense, unmanaged IEEE 802.11 deployments tempt
saboteurs into launching jamming attacks by injecting
malicious interference. Nowadays, jammers can be
portable devices that transmit intermittently at low
power in order to conserve energy. In this paper, we
first conduct extensive experiments on an indoor 802.11
network to assess the ability of two physical-layer
functions, rate adaptation and power control, in
mitigating jamming. In the presence of a jammer, we
find that: (1) the use of popular rate adaptation
algorithms can significantly degrade network
performance; and (2) appropriate tuning of the carrier
sensing threshold allows a transmitter to send packets
even when being jammed and enables a receiver to
capture the desired signal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2011:EER,
author = "M. Kodialam and T. V. Lakshman and James B. Orlin and
Sudipta Sengupta",
title = "End-to-end restorable oblivious routing of hose model
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1223--1236",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2121918",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Two-phase routing, where traffic is first distributed
to intermediate nodes before being routed to the final
destination, has been recently proposed for handling
widely fluctuating traffic without the need to adapt
network routing to changing traffic. Preconfiguring the
network in a traffic-independent manner using two-phase
routing simplifies network operation considerably. In
this paper, we extend this routing scheme by providing
resiliency against link failures through end-to-end
shared backup path restoration. We view this as
important progress toward adding carrier-class
reliability to the robustness of the scheme so as to
facilitate its future deployment in Internet service
provider (ISP) networks. In shared backup path
restoration, each connection consists of a
link-disjoint primary and backup path pair; two backup
paths can share bandwidth on their common links if
their primary paths are link-disjoint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2011:PCM,
author = "Minsik Lee and Youngjip Kim and Chong-Ho Choi",
title = "Period-controlled {MAC} for high performance in
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "4",
pages = "1237--1250",
month = aug,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2107332",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sun Nov 6 07:43:52 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose Period-Controlled Medium
Access Control (PC-MAC), which can operate in
pseudo-TDMA manner and achieves high throughput and
fairness in simple networks. PC-MAC works like CSMA/CA
initially and becomes a pseudo-TDMA scheme in a few
seconds due to the periodic backoff mechanism along
with the contention control that tries to maintain the
number of idle slots to an optimal level. Simulation
results show 10\%-50\% higher throughput than
distributed coordination function (DCF), depending on
the number of nodes, while maintaining nearly perfect
fairness. Furthermore, we also show how PC-MAC can
successfully be applied to complex networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yoon:2011:FCS,
author = "MyungKeun Yoon and Tao Li and Shigang Chen and
Jih-Kwon Peir",
title = "Fit a compact spread estimator in small high-speed
memory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1253--1264",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2080285",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The spread of a source host is the number of distinct
destinations that it has sent packets to during a
measurement period. A spread estimator is a
software/hardware module on a router that inspects the
arrival packets and estimates the spread of each
source. It has important applications in detecting port
scans and distributed denial-of-service (DDoS) attacks,
measuring the infection rate of a worm, assisting
resource allocation in a server farm, determining
popular Web contents for caching, to name a few. The
main technical challenge is to fit a spread estimator
in a fast but small memory (such as SRAM) in order to
operate it at the line speed in a high-speed network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2011:TCA,
author = "Reuven Cohen and Niloofar Fazlollahi and David
Starobinski",
title = "Throughput-competitive advance reservation with
bounded path dispersion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1265--1275",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2104367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In response to the high throughput needs of grid and
cloud computing applications, several production
networks have recently started to support advance
reservation of dedicated circuits. An important open
problem within this context is to devise advance
reservation algorithms that can provide provable
throughput performance guarantees independently of the
specific network topology and arrival pattern of
reservation requests. In this paper, we first show that
the throughput performance of greedy approaches, which
return the earliest possible completion time for each
incoming request, can be arbitrarily worse than
optimal. Next, we introduce two new online,
polynomial-time algorithms for advance reservation,
called BatchAll and BatchLim.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rajawat:2011:CLD,
author = "Ketan Rajawat and Nikolaos Gatsis and Georgios B.
Giannakis",
title = "Cross-layer designs in coded wireless fading networks
with multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1276--1289",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2109010",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A cross-layer design along with an optimal resource
allocation framework is formulated for wireless fading
networks, where the nodes are allowed to perform
network coding. The aim is to jointly optimize
end-to-end transport-layer rates, network code design
variables, broadcast link flows, link capacities,
average power consumption, and short-term power
allocation policies. As in the routing paradigm where
nodes simply forward packets, the cross-layer
optimization problem with network coding is nonconvex
in general. It is proved, however, that with network
coding, dual decomposition for multicast is optimal so
long as the fading at each wireless link is a
continuous random variable. This lends itself to
provably convergent subgradient algorithms, which not
only admit a layered-architecture interpretation, but
also optimally integrate network coding in the protocol
stack.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aperjis:2011:BME,
author = "Christina Aperjis and Ramesh Johari and Michael J.
Freedman",
title = "Bilateral and multilateral exchanges for peer-assisted
content distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1290--1303",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2114898",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Users of the BitTorrent file-sharing protocol and its
variants are incentivized to contribute their upload
capacity in a bilateral manner: Downloading is possible
in return for uploading to the same user. An
alternative is to use multilateral exchange to match
user demand for content to available supply at other
users in the system. We provide a formal comparison of
peer-to-peer system designs based on bilateral exchange
with those that enable multilateral exchange via a
price-based market mechanism to match supply and
demand. First, we compare the two types of exchange in
terms of the equilibria that arise. A multilateral
equilibrium allocation is Pareto-efficient, while we
demonstrate that bilateral equilibrium allocations are
not Pareto-efficient in general.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Batayneh:2011:RTR,
author = "Marwan Batayneh and Dominic A. Schupke and Marco
Hoffmann and Andreas Kirstaedter and Biswanath
Mukherjee",
title = "On routing and transmission-range determination of
multi-bit-rate signals over mixed-line-rate {WDM}
optical networks for carrier {Ethernet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1304--1316",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2107748",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ethernet's success in local area networks (LANs) is
fueling the efforts to extend its reach to cover metro
and long-haul networks. This new Ethernet is refereed
to as Carrier Ethernet. Among the various transport
infrastructures for realizing Carrier Ethernet,
wavelength-division multiplexing (WDM) optical network
is a strong candidate for this purpose. Optical
transmission rates per channel are increasing from 10
to 40 Gb/s and even 100 Gb/s, and they can also coexist
in the same fiber. Along with the flexibility
associated with such a network with mixed-line rates
(MLR), signal-related constraints at high rates become
a challenge for cost-efficient routing. Among these
issues is the maximum nonregenerated optical distance
that a signal can travel before its quality degrades or
maximum transmission range (TR).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2011:DSP,
author = "Chuan Wu and Baochun Li and Shuqiao Zhao",
title = "On dynamic server provisioning in multichannel {P2P}
live streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1317--1330",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2107563",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To guarantee the streaming quality in live
peer-to-peer (P2P) streaming channels, it is preferable
to provision adequate levels of upload capacities at
dedicated streaming servers, compensating for peer
instability and time-varying peer upload bandwidth
availability. Most commercial P2P streaming systems
have resorted to the practice of overprovisioning a
fixed amount of upload capacity on streaming servers.
In this paper, we have performed a detailed analysis on
10 months of run-time traces from UUSee, a commercial
P2P streaming system, and observed that available
server capacities are not able to keep up with the
increasing demand by hundreds of channels. We propose a
novel online server capacity provisioning algorithm
that proactively adjusts server capacities available to
each of the concurrent channels, such that the supply
of server bandwidth in each channel dynamically adapts
to the forecasted demand, taking into account the
number of peers, the streaming quality, and the channel
priority.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Onus:2011:MMD,
author = "Melih Onus and Andr{\'e}a W. Richa",
title = "Minimum maximum-degree publish-subscribe overlay
network design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1331--1343",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2144999",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designing an overlay network for publish/subscribe
communication in a system where nodes may subscribe to
many different topics of interest is of fundamental
importance. For scalability and efficiency, it is
important to keep the degree of the nodes in the
publish/subscribe system low. It is only natural then
to formalize the following problem: Given a collection
of nodes and their topic subscriptions, connect the
nodes into a graph that has least possible maximum
degree in such a way that for each topic t, the graph
induced by the nodes interested in t is connected. We
present the first polynomial-time logarithmic
approximation algorithm for this problem and prove an
almost tight lower bound on the approximation ratio.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2011:MDL,
author = "Donghyun Kim and Wei Wang and Nassim Sohaee and
Changcun Ma and Weili Wu and Wonjun Lee and Ding-Zhu
Du",
title = "Minimum data-latency-bound $k$-sink placement problem
in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1344--1353",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2109394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a new multiple-sink
positioning problem in wireless sensor networks to best
support real-time applications. We formally define this
problem as the k-Sink Placement Problem (k-SPP) and
prove that it is APX-complete. We show that an existing
approximation algorithm for the well-known-center
problem is a constant factor approximation of k-SPP.
Furthermore, we introduce a new greedy algorithm for
k-SPP and prove its approximation ratio is very near to
the best achievable, 2. Via simulations, we show our
algorithm outperforms its competitor on average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:DCT,
author = "Xinbing Wang and Wentao Huang and Shangxing Wang and
Jinbei Zhang and Chenhui Hu",
title = "Delay and capacity tradeoff analysis for motioncast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1354--1367",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2109042",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we define multicast for an ad hoc
network through nodes' mobility as MotionCast and study
the delay and capacity tradeoffs for it. Assuming nodes
move according to an independently and identically
distributed (i.i.d.) pattern and each desires to send
packets to k distinctive destinations, we compare the
delay and capacity in two transmission protocols: one
uses 2-hop relay algorithm without redundancy; the
other adopts the scheme of redundant packets
transmissions to improve delay while at the expense of
the capacity. In addition, we obtain the maximum
capacity and the minimum delay under certain
constraints. We find that the per-node delay and
capacity for the 2-hop algorithm without redundancy are
$ \Theta (1 / k) $ and $ \Theta (n \log k) $,
respectively; for the 2-hop algorithm with redundancy,
they are $ \Omega (1 / k \root n \log k) $ and $ \Theta
(\root n \log k) $, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koutsonikolas:2011:ENC,
author = "Dimitrios Koutsonikolas and Chih-Chun Wang and Y.
Charlie Hu",
title = "Efficient network-coding-based opportunistic routing
through cumulative coded acknowledgments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1368--1381",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2111382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The use of random linear network coding (NC) has
significantly simplified the design of opportunistic
routing (OR) protocols by removing the need of
coordination among forwarding nodes for avoiding
duplicate transmissions. However, NC-based OR protocols
face a new challenge: How many coded packets should
each forwarder transmit? To avoid the overhead of
feedback exchange, most practical existing NC-based OR
protocols compute offline the expected number of
transmissions for each forwarder using heuristics based
on periodic measurements of the average link loss rates
and the ETX metric. Although attractive due to their
minimal coordination overhead, these approaches may
suffer significant performance degradation in dynamic
wireless environments with continuously changing levels
of channel gains, interference, and background
traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:RPC,
author = "Bo Li and Cem Boyaci and Ye Xia",
title = "A refined performance characterization of
longest-queue-first policy in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1382--1395",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2108314",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the major challenges in wireless networking is
how to optimize the link scheduling decisions under
interference constraints. Recently, a few algorithms
have been introduced to address the problem. However,
solving the problem to optimality for general wireless
interference models is known to be NP-hard. The
research community is currently focusing on finding
simpler suboptimal scheduling algorithms and on
characterizing the algorithm performance. In this
paper, we address the performance of a specific
scheduling policy called Longest Queue First (LQF),
which has gained significant recognition lately due to
its simplicity and high efficiency in empirical
studies. There has been a sequence of studies
characterizing the guaranteed performance of the LQF
schedule, culminating at the construction of the $
\sigma $-local pooling concept by Joo et al.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Treurniet:2011:NAC,
author = "Joanne Treurniet",
title = "A network activity classification schema and its
application to scan detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1396--1404",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2109009",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet traffic is neither well-behaved nor
well-understood, which makes it difficult to detect
malicious activities such as scanning. A large portion
of scanning activity is of a slow scan type and is not
currently detectable by security appliances. In this
proof-of-concept study, a new scan detection technique
is demonstrated that also improves our understanding of
Internet traffic. Sessions are created using models of
the behavior of packet-level data between host pairs,
and activities are identified by grouping sessions
based on patterns in the type of session, the IP
addresses, and the ports. In a 24-h data set of nearly
10 million incoming sessions, a prodigious 78\% were
identified as scan probes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2011:DIF,
author = "Zhenyu Wu and Mengjun Xie and Haining Wang",
title = "Design and implementation of a fast dynamic packet
filter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1405--1419",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2111381",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents Swift, a packet filter for
high-performance packet capture on commercial
off-the-shelf hardware. The key features of the Swift
include: (1) extremely lowfilter update latency for
dynamic packet filtering, and (2) gigabits-per-second
high-speed packet processing. Based on complex
instruction set computer (CISC) instruction set
architecture (ISA), Swift achieves the former with an
instruction set design that avoids the need for
compilation and security checking, and the latter by
mainly utilizing single instruction, multiple data
(SIMD). We implement Swift in the Linux 2.6 kernel for
both i386 and x86-64 architectures and extensively
evaluate its dynamic and static filtering performance
on multiple machines with different hardware setups.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dhamdhere:2011:TYE,
author = "Amogh Dhamdhere and Constantine Dovrolis",
title = "Twelve years in the evolution of the {Internet}
ecosystem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1420--1433",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2119327",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Our goal is to understand the evolution of the
autonomous system (AS) ecosystem over the last 12
years. Instead of focusing on abstract topological
properties, we classify ASs into a number of types
depending on their function and business type.
Furthermore, we consider the semantics of inter-AS
links: customer-provider versus peering relations. We
find that the available historic datasets from
RouteViews and RIPE are not sufficient to infer the
evolution of peering links, and so we restrict our
focus to customer-provider links. Our findings
highlight some important trends in the evolution of the
Internet over the last 12 years and hint at what the
Internet is heading toward.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Drugan:2011:DCS,
author = "Ovidiu Valentin Drugan and Thomas Plagemann and Ellen
Munthe-Kaas",
title = "Detecting communities in sparse {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1434--1447",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2112376",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In sparse mobile ad hoc networks, placement of
services and data is crucial to assure their
availability to all nodes because sparse population of
nodes can lead to (frequent) network partitions. If
these dynamic networks display a fairly stable cluster
structure, it is possible to utilize this structure to
improve service and data availability. However,
clustering in a dynamic network is a very challenging
task due to the ever-changing topology and irregular
density of such a network. In this paper, we
investigate clustering of dynamic networks with the
help of community detection mechanisms, using only
topology information from the local routing table.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2011:DAD,
author = "Dan Li and Jianping Wu and Jiangchuan Liu and Yong Cui
and Ke Xu",
title = "Defending against distance cheating in link-weighted
application-layer multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1448--1457",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2118230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Application-layer multicast (ALM) has recently emerged
as a promising solution for diverse group-oriented
applications. Unlike dedicated routers in IP multicast,
the autonomous end-hosts are generally unreliable and
even selfish. A strategic host might cheat about its
private information to affect protocol execution and,
in turn, to improve its individual benefit.
Specifically, in a link-weighted ALM protocol where the
hosts measure the distances from their neighbors and
accordingly construct the ALM topology, a selfish
end-host can easily intercept the measurement message
and exaggerate the distances to other nodes, so as to
reduce the probability of being a relay. Such distance
cheating, rarely happening in IP multicast, can
significantly impact the efficiency and stability of
the ALM topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baccelli:2011:DDP,
author = "Fran{\c{c}}ois Baccelli and Nicholas Bambos and
Nicolas Gast",
title = "Distributed delay-power control algorithms for
bandwidth sharing in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1458--1471",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2163079",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we formulate a delay-power control
(DPC) scheme for wireless networking, which efficiently
balances delay against transmitter power on each
wireless link. The DPC scheme is scalable, as each link
autonomously updates its power based on the
interference observed at its receiver; no cross-link
communication is required. It is shown that DPC
converges to a unique equilibrium power and several key
properties are established, concerning the nature of
channel bandwidth sharing achieved by the links. The
DPC scheme is contrasted to the well-known
Foschini-Miljanic (FM) formulation for transmitter
power control in wireless networks, and some key
advantages are established.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jian:2011:AML,
author = "Ying Jian and Ming Zhang and Shigang Chen",
title = "Achieving {MAC}-layer fairness in {CSMA\slash CA}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1472--1484",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2116124",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We demonstrate that CSMA/CA networks, including IEEE
802.11 networks, exhibit severe fairness problem in
many scenarios, where some hosts obtain most of the
channel's bandwidth while others starve. Most existing
solutions require nodes to overhear transmissions made
by contending nodes and, based on the overheard
information, adjust local rates to achieve fairness
among all contending links. Their underlying assumption
is that transmissions made by contending nodes can be
overheard. However, this assumption holds only when the
transmission range is equal to the interference range,
which is not true in reality. As our study reveals, the
overhearing-based solutions, as well as several
nonoverhearing AIMD solutions, cannot achieve MAC-layer
fairness in various settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2011:SCL,
author = "Qinglin Zhao and Danny H. K. Tsang and Taka Sakurai",
title = "A simple critical-load-based {CAC} scheme for {IEEE
802.11 DCF} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1485--1498",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2116801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a simple and practical call
admission control (CAC) scheme for one-hop IEEE 802.11
distributed coordination function (DCF) networks in
heterogeneous environments. The proposed scheme is the
first CAC scheme derived from an asymptotic analysis of
the critical traffic load, where the critical traffic
load represents the threshold for queue stability. The
salient feature of our CAC scheme is that it can be
performed quickly and easily without the need for
network performance measurements and complex
calculations. Using the proposed scheme, we
specifically investigate the voice capacity of 802.11
DCF networks with unbalanced traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lestas:2011:NES,
author = "Marios Lestas and Andreas Pitsillides and Petros
Ioannou and George Hadjipollas",
title = "A new estimation scheme for the effective number of
users in {Internet} congestion control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1499--1512",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2149540",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many congestion control protocols have been recently
proposed in order to alleviate the problems encountered
by TCP in high-speed networks and wireless links.
Protocols utilizing an architecture that is in the same
spirit as the ABR service in ATM networks require
estimates of the effective number of users utilizing
each link in the network to maintain stability in the
presence of delays. In this paper, we propose a novel
estimation algorithm that is based on online parameter
identification techniques and is shown through analysis
and simulations to converge to the effective number of
users utilizing each link. The algorithm does not
require maintenance of per-flow states within the
network or additional fields in the packet header, and
it is shown to outperform previous proposals that were
based on pointwise division in time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2011:IAH,
author = "Sumit Singh and Raghuraman Mudumbai and Upamanyu
Madhow",
title = "Interference analysis for highly directional {60-GHz}
mesh networks: the case for rethinking medium access
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1513--1527",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2122343",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate spatial interference statistics for
multigigabit outdoor mesh networks operating in the
unlicensed 60-GHz ``millimeter (mm) wave'' band. The
links in such networks are highly directional: Because
of the small carrier wavelength (an order of magnitude
smaller than those for existing cellular and wireless
local area networks), narrow beams are essential for
overcoming higher path loss and can be implemented
using compact electronically steerable antenna arrays.
Directionality drastically reduces interference, but it
also leads to ``deafness,'' making implicit
coordination using carrier sense infeasible. In this
paper, we make a quantitative case for rethinking
medium access control (MAC) design in such settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2011:PCC,
author = "Chandramani Singh and Saswati Sarkar and Alireza
Aram",
title = "Provider-customer coalitional games",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1528--1542",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2135863",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficacy of commercial wireless networks can be
substantially enhanced through large-scale cooperation
among involved entities such as providers and
customers. The success of such cooperation is
contingent upon the design of judicious resource
allocation strategies that ensure that the individuals'
pay-offs are commensurate to the resources they offer
to the coalition. The resource allocation strategies
depend on which entities are decision-makers and
whether and how they share their aggregate payoffs.
Initially, we consider the scenario where the providers
are the only decision-makers and they do not share
their payoffs. We formulate the resource allocation
problem as a nontransferable payoff coalitional game
and show that there exists a cooperation strategy that
leaves no incentive for any subset of providers to
split from the grand coalition, i.e., the core of the
game is nonempty.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kwong:2011:FEP,
author = "Kin-Wah Kwong and Lixin Gao and Roch Gu{\'e}rin and
Zhi-Li Zhang",
title = "On the feasibility and efficacy of protection routing
in {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1543--1556",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2123916",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With network components increasingly reliable, routing
is playing an ever greater role in determining network
reliability. This has spurred much activity in
improving routing stability and reaction to failures
and rekindled interest in centralized routing
solutions, at least within a single routing domain.
Centralizing decisions eliminates uncertainty and many
inconsistencies and offers added flexibility in
computing routes that meet different criteria. However,
it also introduces new challenges, especially in
reacting to failures where centralization can increase
latency. This paper leverages the flexibility afforded
by centralized routing to address these challenges.
Specifically, we explore when and how standby backup
forwarding options can be activated while waiting for
an update from the centralized server after the failure
of an individual component (link or node).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gianvecchio:2011:HBI,
author = "Steven Gianvecchio and Mengjun Xie and Zhenyu Wu and
Haining Wang",
title = "Humans and bots in {Internet} chat: measurement,
analysis, and automated classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "5",
pages = "1557--1571",
month = oct,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2126591",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 24 16:24:19 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The abuse of chat services by automated programs,
known as chat bots, poses a serious threat to Internet
users. Chat bots target popular chat networks to
distribute spam and malware. In this paper, we first
conduct a series of measurements on a large commercial
chat network. Our measurements capture a total of 16
different types of chat bots ranging from simple to
advanced. Moreover, we observe that human behavior is
more complex than bot behavior. Based on the
measurement study, we propose a classification system
to accurately distinguish chat bots from human users.
The proposed classification system consists of two
components: (1) an entropy-based classifier; and (2) a
Bayesian-based classifier.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garcia-Luna-Aceves:2011:PID,
author = "J. J. Garcia-Luna-Aceves and Rolando Menchaca-Mendez",
title = "{PRIME}: an interest-driven approach to integrated
unicast and multicast routing in {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1573--1586",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2119402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A framework for integrated multicast and unicast
routing in mobile ad hoc networks (MANETs) is
introduced. It is based on interest-defined mesh
enclaves that are connected components of a MANET
spanning the sources and receivers of unicast or
multicast flows. The Protocol for Routing in
Interest-defined Mesh Enclaves (PRIME) is presented to
implement the proposed framework for integrated routing
in MANETs. PRIME establishes meshes that are activated
and deactivated by the presence or absence of interest
in individual destination nodes and groups and confines
most of the signaling overhead within regions of
interest (enclaves) in such meshes. The routes
established in PRIME are shown to be free of permanent
loops. Experimental results based on extensive
simulations show that PRIME attains similar or better
data delivery and end-to-end delays than traditional
unicast and multicast routing schemes for MANETs (AODV,
OLSR, ODMRP). The experiments also show that signaling
in PRIME is far more scalable than the one used by
traditional multicast and unicast routing protocols
such as AODV, OLSR, or ODMRP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oggier:2011:ACA,
author = "Fr{\'e}d{\'e}rique Oggier and Hanane Fathi",
title = "An authentication code against pollution attacks in
network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1587--1596",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2126592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Systems exploiting network coding to increase their
throughput suffer greatly from pollution attacks, which
consist of injecting malicious packets in the network.
The pollution attacks are amplified by the network
coding process, resulting in a greater damage than
under traditional routing. In this paper, we address
this issue by designing an unconditionally secure
authentication code (that is, which does not rely on
computational assumptions) suitable for multicast
network coding, where the keying material is initially
computed and distributed by a trusted authority to the
destinations and intermediate nodes. The proposed
scheme allows not only destinations, but also
intermediate nodes, to verify the integrity and origin
of the packets received without having to decode, and
thus detect and discard the malicious messages in
transit that fail the verification. This way, the
pollution is canceled out before reaching the
destinations. The proposed scheme is robust against
pollution attacks from outsiders, as well as coalitions
of malicious insider nodes, which have the ability to
perform the integrity check, but instead get corrupted
and use their knowledge to themselves attack the
network. We analyze the performance of the scheme in
terms of both throughput and goodput and show that the
price to pay for tolerating inside attackers is a high
decrease in throughput (it is inversely proportional to
the number of insider attackers that can collude). We
finally discuss applications to file distribution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bui:2011:NAR,
author = "Loc X. Bui and R. Srikant and Alexander Stolyar",
title = "A novel architecture for reduction of delay and
queueing structure complexity in the back-pressure
algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1597--1609",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2126593",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The back-pressure algorithm is a well-known
throughput-optimal algorithm. However, its
implementation requires that each node has to maintain
a separate queue for each commodity in the network, and
only one queue is served at a time. This fact may lead
to a poor delay performance even when the traffic load
is not close to network capacity. Also, since the
number of commodities in the network is usually very
large, the queueing data structure that has to be
maintained at each node is respectively complex. In
this paper, we present a solution to address both of
these issues in the case of a fixed-routing network
scenario where the route of each flow is chosen upon
arrival. Our proposed architecture allows each node to
maintain only per-neighbor queues and, moreover,
improves the delay performance of the back-pressure
algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neumayer:2011:AVF,
author = "Sebastian Neumayer and Gil Zussman and Reuven Cohen
and Eytan Modiano",
title = "Assessing the vulnerability of the fiber
infrastructure to disasters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1610--1623",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2128879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Communication networks are vulnerable to natural
disasters, such as earthquakes or floods, as well as to
physical attacks, such as an electromagnetic pulse
(EMP) attack. Such real-world events happen in specific
geographical locations and disrupt specific parts of
the network. Therefore, the geographical layout of the
network determines the impact of such events on the
network's connectivity. In this paper, we focus on
assessing the vulnerability of (geographical) networks
to such disasters. In particular, we aim to identify
the most vulnerable parts of the network. That is, the
locations of disasters that would have the maximum
disruptive effect on the network in terms of capacity
and connectivity. We consider graph models in which
nodes and links are geographically located on a plane.
First, we consider a simplistic bipartite graph model
and present a polynomial-time algorithm for finding a
worst-case vertical line segment cut. We then
generalize the network model to graphs with nodes at
arbitrary locations.We model the disaster event as a
line segment or a disk and develop polynomial-time
algorithms that find a worst-case line segment cut and
a worst-case circular cut. Finally, we obtain numerical
results for a specific backbone network, thereby
demonstrating the applicability of our algorithms to
real-world networks. Our novel approach provides a
promising new direction for network design to avert
geographical disasters or attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Smaragdakis:2011:SON,
author = "Georgios Smaragdakis and Nikolaos Laoutaris and
Vassilis Lekakis and Azer Bestavros and John W. Byers
and Mema Roussopoulos",
title = "Selfish overlay network creation and maintenance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1624--1637",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2129528",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A foundational issue underlying many overlay network
applications ranging from routing to peer-to-peer file
sharing is that of the network formation, i.e., folding
new arrivals into an existing overlay, and rewiring to
cope with changing network conditions. Previous work
has considered the problem from two perspectives:
devising practical heuristics for the case of
cooperative peers and performing game-theoretic
analysis for the case of selfish peers. In this paper,
we unify the aforementioned thrusts by defining and
studying the selfish neighbor selection (SNS) game and
its application to overlay routing. At the heart of SNS
stands the restriction that peers are allowed up to a
certain number of neighbors. This makes SNS
substantially different from existing network formation
games that impose no bounds on peer degrees. Having
bounded degrees has important practical consequences as
it permits the creation of overlay structures that
require O ( n ) instead of O ( n$^2$ ) link monitoring
overhead. We show that a node's ``best response''
wiring strategy amounts to solving a k -median problem
on asymmetric distance. Best-response wirings have
substantial practical utility as they permit selfish
nodes to reap substantial performance benefits when
connecting to overlays of nonselfish nodes. A more
intricate consequence is that even nonselfish nodes can
benefit from the existence of some selfish nodes since
the latter, via their local optimizations, create a
highly optimized backbone, upon which even simple
heuristic wirings yield good performance. To capitalize
on the above properties, we design, build, and deploy
EGOIST, an SNS-inspired prototype overlay routing
system for PlanetLab. We demonstrate that EGOIST
outperforms existing heuristic overlays on a variety of
performance metrics, including delay, available
bandwidth, and node utilization, while it remains
competitive with an optimal but unscalable full-mesh
overlay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Giorgetti:2011:ULR,
author = "Gianni Giorgetti and Sandeep Kumar S. Gupta and
Gianfranco Manes",
title = "Understanding the limits of {RF}-based collaborative
localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1638--1651",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2141681",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "RF-based localization has gained popularity as a
low-cost solution to support position awareness in ad
hoc networks. The received signal strength (RSS)
measured by pairs of nodes can be used to obtain either
range estimates or connectivity information. It is not
clear, however: (1) when a range-based scheme should be
used in favor of a connectivity-based one, and (2) how
to optimally convert the RSS into connectivity data.
This paper uses analysis of the Fisher information and
the Cram{\'e}r-Rao bound (CRB) to answer these
questions. Solutions are found by comparing the network
connectivity against two values: the critical
connectivity (CC) and the optimal connectivity (OC).
After discussing the properties of both values, we show
how their approximation can be used to improve the
performance of RF-based localization systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barghi:2011:MAM,
author = "Sanaz Barghi and Hamid Jafarkhani and Homayoun
Yousefi'zadeh",
title = "{MIMO}-assisted {MPR}-aware {MAC} design for
asynchronous {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1652--1665",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2130538",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The use of multiple-packet reception (MPR) in wireless
networks is known to improve throughput especially in
high-traffic conditions. The lack of synchronization
among the nodes in random access systems introduces
significant challenges toward the adoption of MPR in
the PHY and the MAC design for systems using MPR. In
this paper, we propose an asynchronous MPR method for
the PHY and also design a compatible random access MAC
for wireless local area networks (WLANs). Relying on
space-time coding techniques, our MPR method detects
multiple asynchronous packets while providing diversity
and low bit error rates at the PHY layer. Extending the
design of IEEE 802.11, our MPR MAC design encourages
simultaneous packet transmissions and handles multiple
packet receptions. Simulation results show that the
throughput of a WLAN significantly improves in many
scenarios of operation using our proposed PHY/MAC MPR
framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kalafut:2011:TDO,
author = "Andrew J. Kalafut and Craig A. Shue and Minaxi Gupta",
title = "Touring {DNS} open houses for trends and
configurations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1666--1675",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2130537",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Domain Name System (DNS) is a critical component
of the Internet. It maps domain names to IP addresses
and serves as a distributed database for various other
applications, including mail, Web, and spam filtering.
This paper examines DNS zones in the Internet for
diversity, adoption rates of new technologies, and
prevalence of configuration issues. To gather data, we
sweep 60\% of the Internet's domains in June-August
2007 for zone transfers. Of them, 6.6\% allow us to
transfer their complete information. Surprisingly, this
includes a large fraction of the domains deploying DNS
security extensions (DNSSEC). We find that DNS zones
vary significantly in size and some span many
autonomous systems. Also, while anti-spam technologies
appear to be getting deployed, the adoption rates of
DNSSEC and IPv6 continue to be low. Finally, we also
find that carelessness in handing DNS records can lead
to reduced availability of name servers, e-mail, and
Web servers. This also undermines anti-spam efforts and
the efforts to shut down phishing sites or to contain
malware infections.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Damjanovic:2011:ETS,
author = "Dragana Damjanovic and Michael Welzl",
title = "An extension of the {TCP} steady-state throughput
equation for parallel flows and its application in
{MulTFRC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1676--1689",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2142008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the first part of this paper, we present a simple
extension of the well-known TCP steady-state throughput
equation that can be used to calculate the throughput
of several flows that share an end-to-end path. The
value of this extension, which we show to work well
with simulations as well as real-life measurements, is
its practical applicability. Thus, in the second part
of this paper, we present its application in MulTFRC, a
TCP-friendly rate control (TFRC)-based congestion
control mechanism that is fair to a number of parallel
TCP flows while maintaining a smoother sending rate
than multiple real TFRC flows do. MulTFRC enables its
users to prioritize transfers by controlling the
fairness among them in an almost arbitrary fashion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rengarajan:2011:PAU,
author = "Balaji Rengarajan and Gustavo {De Veciana}",
title = "Practical adaptive user association policies for
wireless systems with dynamic interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1690--1703",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2158655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the impact of user association policies on
flow-level performance in interference-limited wireless
networks. Most research in this area has used static
interference models (neighboring base stations are
always active) and resorted to intuitive objectives
such as load balancing. In this paper, we show that
this can be counterproductive in the presence of
dynamic interference that couples the transmission
rates to users at various base stations. We propose a
methodology to optimize the performance of a class of
coupled systems and apply it to study the user
association problem. We show that by properly inducing
load asymmetries, substantial performance gains can be
achieved relative to a load-balancing policy (e.g., 15
times reduction in mean delay). We present a practical,
measurement based, interference-aware association
policy that infers the degree of interference-induced
coupling and adapts to it. Systematic simulations
establish that both our optimized static and adaptive
association policies substantially outperform various
dynamic policies that can, in extreme cases, even be
susceptible to Braess's paradox-like phenomena, i.e.,
an increase in the number of base stations can lead to
worse performance under greedy association policies.
Furthermore, these results are robust to changes in
file-size distributions, large-scale propagation
parameters, and spatial load distributions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2011:OBS,
author = "Chao Liang and Miao Zhao and Yong Liu",
title = "Optimal bandwidth sharing in multiswarm multiparty
{P2P} video-conferencing systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1704--1716",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2141680",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a multiparty video conference, multiple users
simultaneously distribute video streams to their
receivers. As the traditional server-based solutions
incur high infrastructure and bandwidth cost,
conventional peer-to-peer (P2P) solutions only
leveraging end-users' upload bandwidth are normally not
self-sustainable: The video streaming workload
increases quadratically with the number of users as
each user could generate and distribute video streams,
while the user upload bandwidth only increases
linearly. Recently, hybrid solutions have been proposed
that employ helpers to address the bandwidth deficiency
in P2P video-conferencing swarms. It is also noticed
that a system hosting multiple parallel conferencing
swarms can benefit from cross-swarm bandwidth sharing.
However, how to optimally share bandwidth in such
systems has not been explored so far. In this paper, we
study the optimal bandwidth sharing in multiswarm
multiparty P2P video-conferencing systems with helpers
and investigate two cross-swarm bandwidth-sharing
scenarios: (1) swarms are independent and peers from
different swarms share a common pool of helpers; (2)
swarms are cooperative and peers in a bandwidth-rich
swarm can further share their bandwidth with peers in a
bandwidth-poor swarm. For each scenario, we develop
distributed algorithms for intraswarm and interswarm
bandwidth allocation under a utility-maximization
framework. Through analysis and simulation, we show
that the proposed algorithms are robust to peer
dynamics and can adaptively allocate peer and helper
bandwidth across swarms so as to achieve the
system-wide optimum.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2011:LSR,
author = "Dahai Xu and Mung Chiang and Jennifer Rexford",
title = "Link-state routing with hop-by-hop forwarding can
achieve optimal traffic engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1717--1730",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2134866",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See corrections \cite{Xu:2015:CLS}.",
abstract = "This paper settles an open question with a positive
answer: Optimal traffic engineering (or optimal
multicommodity flow) can be realized using just
link-state routing protocols with hop-by-hop
forwarding. Today's typical versions of these
protocols, Open Shortest Path First (OSPF) and
Intermediate System-Intermediate System (IS-IS), split
traffic evenly over shortest paths based on link
weights. However, optimizing the link weights for
OSPF/IS-IS to the offered traffic is a well-known
NP-hard problem, and even the best setting of the
weights can deviate significantly from an optimal
distribution of the traffic. In this paper, we propose
a new link-state routing protocol, PEFT, that splits
traffic over multiple paths with an exponential penalty
on longer paths. Unlike its predecessor, DEFT, our new
protocol provably achieves optimal traffic engineering
while retaining the simplicity of hop-by-hop
forwarding. The new protocol also leads to a
significant reduction in the time needed to compute the
best link weights. Both the protocol and the
computational methods are developed in a conceptual
framework, called Network Entropy Maximization, that is
used to identify the traffic distributions that are not
only optimal, but also realizable by link-state
routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghosh:2011:MSS,
author = "Amitabha Ghosh and {\"O}zlem Durmaz Incel and V. S.
Anil Kumar and Bhaskar Krishnamachari",
title = "Multichannel scheduling and spanning trees:
throughput-delay tradeoff for fast data collection in
sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1731--1744",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2146273",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the tradeoff between two mutually
conflicting performance objectives--throughput and
delay--for fast, periodic data collection in tree-based
sensor networks arbitrarily deployed in 2-D. Two
primary factors that affect the data collection rate
(throughput) and timeliness (delay) are: (1) efficiency
of the link scheduling protocol, and (2) structure of
the routing tree in terms of its node degrees and
radius. In this paper, we utilize multiple frequency
channels and design an efficient link scheduling
protocol that gives a constant factor approximation on
the optimal throughput in delivering aggregated data
from all the nodes to the sink. To minimize the maximum
delay subject to a given throughput bound, we also
design an $ (\alpha, \beta)$-bicriteria approximation
algorithm to construct a Bounded-Degree Minimum-Radius
Spanning Tree, with the radius of the tree at most $
\beta $ times the minimum possible radius for a given
degree bound $ \Delta^*$, and the degree of any node at
most $ \Delta^* + \alpha $, where $ \alpha $ and $
\beta $ are positive constants. Lastly, we evaluate the
efficiency of our algorithms on different types of
spanning trees and show that multichannel scheduling,
combined with optimal routing topologies, can achieve
the best of both worlds in terms of maximizing the
aggregated data collection rate and minimizing the
maximum packet delay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ciullo:2011:ICM,
author = "Delia Ciullo and Valentina Martina and Michele Garetto
and Emilio Leonardi",
title = "Impact of correlated mobility on delay-throughput
performance in mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1745--1758",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2140128",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We extend the analysis of the scaling laws of wireless
ad hoc networks to the case of correlated nodes
movements, which are commonly found in real mobility
processes. We consider a simple version of the
Reference Point Group Mobility model, in which nodes
belonging to the same group are constrained to lie in a
disc area, whose center moves uniformly across the
network according to the i.i.d. model. We assume fast
mobility conditions and take as a primary goal the
maximization of per-node throughput. We discover that
correlated node movements have a huge impact on
asymptotic throughput and delay and can sometimes lead
to better performance than the one achievable under
independent nodes movements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Christodoulopoulos:2011:IDM,
author = "Konstantinos Christodoulopoulos and Panagiotis
Kokkinos and Emmanouel Manos Varvarigos",
title = "Indirect and direct multicost algorithms for online
impairment-aware {RWA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1759--1772",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2138717",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the online impairment-aware routing and
wavelength assignment (IA-RWA) problem in transparent
WDM networks. To serve a new connection, the online
algorithm, in addition to finding a route and a free
wavelength (a lightpath), has to guarantee its
transmission quality, which is affected by
physical-layer impairments. Due to interference
effects, the establishment of the new lightpath affects
and is affected by the other lightpaths. We present two
multicost algorithms that account for the actual
current interference among lightpaths, as well as for
other physical effects, performing a cross-layer
optimization between the network and physical layers.
In multicost routing, a vector of cost parameters is
assigned to each link, from which the cost vectors of
the paths are calculated. The first algorithm utilizes
cost vectors consisting of impairment-generating source
parameters, so as to be generic and applicable to
different physical settings. These parameters are
combined into a scalar cost that indirectly evaluates
the quality of candidate lightpaths. The second
algorithm uses specific physical-layer models to define
noise variance-related cost parameters, so as to
directly calculate the Q -factor of candidate
lightpaths. The algorithms find a set of so-called
nondominated paths to serve the connection in the sense
that no path is better in the set with respect to all
cost parameters. To select the lightpath, we propose
various optimization functions that correspond to
different IA-RWA algorithms. The proposed algorithms
combine the strength of multicost optimization with low
execution times, making them appropriate for serving
online connections.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ying:2011:CBB,
author = "Lei Ying and R. Srikant and Don Towsley and Shihuan
Liu",
title = "Cluster-based back-pressure routing algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1773--1786",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2141682",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The back-pressure algorithm introduced in 1992 by
Tassiulas and Ephremides is a well-known distributed
and adaptive routing/scheduling algorithm where nodes
only need the queue-length information of neighboring
nodes to make routing decisions. Packets are adaptively
routed in the network according to congestion
information, which makes the algorithm resilient to
traffic and topology changes. However, the backpressure
algorithm requires routers to maintain a separate queue
for each destination, which precludes its
implementation in large-scale networks. In this paper,
we propose a distributed cluster-based back-pressure
routing algorithm that retains the adaptability of
back-pressure routing while significantly reducing the
number of queues that have to be maintained at each
node.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2011:TDW,
author = "Dezun Dong and Mo Li and Yunhao Liu and Xiang-Yang Li
and Xiangke Liao",
title = "Topological detection on wormholes in wireless ad hoc
and sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1787--1796",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2163730",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wormhole attack is a severe threat to wireless ad hoc
and sensor networks. Most existing countermeasures
either require specialized hardware devices or make
strong assumptions on the network in order to capture
the specific (partial) symptom induced by wormholes.
Those requirements and assumptions limit the
applicability of previous approaches. In this paper, we
present our attempt to understand the impact and
inevitable symptom of wormholes and develop distributed
detection methods by making as few restrictions and
assumptions as possible. We fundamentally analyze the
wormhole problem using a topology methodology and
propose an effective distributed approach, which relies
solely on network connectivity information, without any
requirements on special hardware devices or any
rigorous assumptions on network properties. We formally
prove the correctness of this design in continuous
geometric domains and extend it into discrete domains.
We evaluate its performance through extensive
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rangwala:2011:NCC,
author = "Sumit Rangwala and Apoorva Jindal and Ki-Young Jang
and Konstantinos Psounis and Ramesh Govindan",
title = "Neighborhood-centric congestion control for multihop
wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1797--1810",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2146272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Complex interference in static multihop wireless mesh
networks can adversely affect transport protocol
performance. Since TCP does not explicitly account for
this, starvation and unfairness can result from the use
of TCP over such networks. In this paper, we explore
mechanisms for achieving fair and efficient congestion
control for multihop wireless mesh networks. First, we
design an AIMD-based rate-control protocol called
Wireless Control Protocol (WCP), which recognizes that
wireless congestion is a neighborhood phenomenon, not a
node-local one, and appropriately reacts to such
congestion. Second, we design a distributed rate
controller that estimates the available capacity within
each neighborhood and divides this capacity to
contending flows, a scheme we call Wireless Control
Protocol with Capacity estimation (WCPCap). Using
analysis, simulations, and real deployments, we find
that our designs yield rates that are both fair and
efficient. WCP assigns rates inversely proportional to
the number of bottlenecks a flow passes through while
remaining extremely easy to implement. An idealized
version of WCPCap is max-min fair, whereas a practical
implementation of the scheme achieves rates within 15\%
of the max-min optimal rates while still being
distributed and amenable to real implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Budzisz:2011:FCL,
author = "Lukasz Budzisz and Rade Stanojevi{\'c} and Arieh
Schlote and Fred Baker and Robert Shorten",
title = "On the fair coexistence of loss- and delay-based
{TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1811--1824",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159736",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents and develops a novel delay-based
additive increase, multiplicative decrease (AIMD)
congestion control algorithm. The main features of the
proposed solution include: (1) low standing queues and
delay in homogeneous environments (with delay-based
flows only); (2) fair coexistence of delay- and
loss-based flows in heterogeneous environments; (3)
delay-based flows behave as loss-based flows when
loss-based flows are present in the network; otherwise
they revert to delay-based operation. It is also shown
that these properties can be achieved without any
appreciable increase in network loss rate over that
which would be present in a comparable network of
standard TCP flows (loss-based AIMD). To demonstrate
the potential of the presented algorithm, both
analytical and simulation results are provided in a
range of different network scenarios. These include
stability and convergence results in general
multiple-bottleneck networks and a number of simulation
scenarios to demonstrate the utility of the proposed
scheme. In particular, we show that networks employing
our algorithm have the features of networks in which
RED AQM's are deployed. Furthermore, in a wide range of
situations (including high-speed scenarios), we show
that low delay is achieved irrespective of the queueing
algorithm employed in the network, with only
sender-side modification to the basic AIMD algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kodialam:2011:OST,
author = "Murali Kodialam and T. V. Lakshman and Sarit Mukherjee
and Limin Wang",
title = "Online scheduling of targeted advertisements for
{IPTV}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1825--1834",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2143725",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Behavioral targeting of content to users is a huge and
lucrative business, valued as a \$20 billion industry
that is growing rapidly. So far, the dominant players
in this field like Google and Yahoo! examine the user
requests coming to their servers and place appropriate
ads based on the user's search keywords. Triple-play
service providers have access to all the traffic
generated by the users and can generate more
comprehensive profiles of users based on their TV,
broadband, and mobile usage. Using such multisource
profile information, they can generate new revenue
streams by smart targeting of ads to their users over
multiple screens (computer, TV, and mobile handset).
This paper proposes methods to place targeted ads to a
TV based on user's interests. It proposes an ad auction
model that can leverage multisource profile and can
handle dynamic profile-based targeting like Google's
AdWords vis-{\`a}-vis static demography-based targeting
of legacy TV. We then present a 0.502-competitive
revenue maximizing scheduling algorithm that chooses a
set of ads in each time slot and assigns users to one
of these selected ads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2011:RLN,
author = "Kayi Lee and Hyang-Won Lee and Eytan Modiano",
title = "Reliability in layered networks with random link
failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1835--1848",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2143425",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider network reliability in layered networks
where the lower layer experiences random link failures.
In layered networks, each failure at the lower layer
may lead to multiple failures at the upper layer. We
generalize the classical polynomial expression for
network reliability to the multilayer setting. Using
random sampling techniques, we develop polynomial-time
approximation algorithms for the failure polynomial.
Our approach gives an approximate expression for
reliability as a function of the link failure
probability, eliminating the need to resample for
different values of the failure probability.
Furthermore, it gives insight on how the routings of
the logical topology on the physical topology impact
network reliability. We show that maximizing the min
cut of the (layered) network maximizes reliability in
the low-failure-probability regime. Based on this
observation, we develop algorithms for routing the
logical topology to maximize reliability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:CSR,
author = "Meng Wang and Chee Wei Tan and Weiyu Xu and Ao Tang",
title = "Cost of not splitting in routing: characterization and
estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1849--1859",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2150761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the performance difference of joint
routing and congestion control when either single-path
routes or multipath routes are used. Our performance
metric is the total utility achieved by jointly
optimizing transmission rates using congestion control
and paths using source routing. In general, this
performance difference is strictly positive and hard to
determine--in fact an NP-hard problem. To better
estimate this performance gap, we develop analytical
bounds to this ``cost of not splitting'' in routing. We
prove that the number of paths needed for optimal
multipath routing differs from that of optimal
single-path routing by no more than the number of links
in the network. We provide a general bound on the
performance loss, which is independent of the number of
source-destination pairs when the latter is larger than
the number of links in a network. We also propose a
vertex projection method and combine it with a greedy
branch-and-bound algorithm to provide progressively
tighter bounds on the performance loss. Numerical
examples are used to show the effectiveness of our
approximation technique and estimation algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2011:SCM,
author = "Pu Wang and Ian F. Akyildiz",
title = "Spatial correlation and mobility-aware traffic
modeling for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1860--1873",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2162340",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, there has been a great deal of research on
using mobility in wireless sensor networks (WSNs) to
facilitate surveillance and reconnaissance in a wide
deployment area. Besides providing an extended sensing
coverage, node mobility along with spatial correlation
introduces new network dynamics, which could lead to
the traffic patterns fundamentally different from the
traditional (Markovian) models. In this paper, a novel
traffic modeling scheme for capturing these dynamics is
proposed that takes into account the statistical
patterns of node mobility and spatial correlation. The
contributions made in this paper are twofold. First, it
is shown that the joint effects of mobility and spatial
correlation can lead to bursty traffic. More
specifically, a high mobility variance and small
spatial correlation can give rise to
pseudo-long-range-dependent (LRD) traffic (high bursty
traffic), whose autocorrelation function decays slowly
and hyperbolically up to a certain cutoff time lag.
Second, due to the ad hoc nature of WSNs, certain relay
nodes may have several routes passing through them,
necessitating local traffic aggregations. At these
relay nodes, our model predicts that the aggregated
traffic also exhibits the bursty behavior characterized
by a scaled power-law decayed autocovariance function.
According to these findings, a novel traffic shaping
protocol using movement coordination is proposed to
facilitate effective and efficient resource
provisioning strategy. Finally, simulation results
reveal a close agreement between the traffic pattern
predicted by our theoretical model and the simulated
transmissions from multiple independent sources, under
specific bounds of the observation intervals.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Charbonneau:2012:SRW,
author = "Neal Charbonneau and Vinod M. Vokkarane",
title = "Static routing and wavelength assignment for multicast
advance reservation in all-optical wavelength-routed
{WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "1--14",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175007",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the static multicast
advance reservation (MCAR) problem for all-optical
wavelength-routed WDM networks. Under the advanced
reservation traffic model, connection requests specify
their start time to be some time in the future and also
specify their holding times. We investigate the static
MCAR problem where the set of advance reservation
requests is known ahead of time. We prove the MCAR
problem is NP-complete, formulate the problem
mathematically as an integer linear program (ILP), and
develop three efficient heuristics, seqRWA, ISH, and
SA, to solve the problem for practical size networks.
We also introduce a theoretical lower bound on the
number of wavelengths required. To evaluate our
heuristics, we first compare their performances to the
ILP for small networks, and then simulate them over
real-world, large-scale networks. We find the SA
heuristic provides close to optimal results compared to
the ILP for our smaller networks, and up to a 33\%
improvement over seqRWA and up to a 22\% improvement
over ISH on realistic networks. SA provides, on
average, solutions 1.5--1.8 times the cost given by our
conservative lower bound on large networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shpungin:2012:TEE,
author = "Hanan Shpungin and Zongpeng Li",
title = "Throughput and energy efficiency in wireless ad hoc
networks with {Gaussian} channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "15--28",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2158237",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the bottleneck link capacity under
the Gaussian channel model in strongly connected random
wireless ad hoc networks, with n nodes independently
and uniformly distributed in a unit square. We assume
that each node is equipped with two transceivers (one
for transmission and one for reception) and allow all
nodes to transmit simultaneously. We draw lower and
upper bounds, in terms of bottleneck link capacity, for
homogeneous networks (all nodes have the same
transmission power level) and propose an
energy-efficient power assignment algorithm (CBPA) for
heterogeneous networks (nodes may have different power
levels), with a provable bottleneck link capacity
guarantee of, $ \Omega (B \log (1 + 1 / \sqrt {n \log^2
n})) $, where $B$ is the channel bandwidth. In
addition, we develop a distributed implementation of
CBPA with $ O(n^2)$ message complexity and provide
extensive simulation results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2012:EEE,
author = "Binbin Chen and Ziling Zhou and Yuda Zhao and Haifeng
Yu",
title = "Efficient error estimating coding: feasibility and
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "29--44",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157357",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by recent emerging systems that can leverage
partially correct packets in wireless networks, this
paper proposes the novel concept of error estimating
coding (EEC). Without correcting the errors in the
packet, EEC enables the receiver of the packet to
estimate the packet's bit error rate, which is perhaps
the most important meta-information of a partially
correct packet. Our EEC design provides provable
estimation quality with rather low redundancy and
computational overhead. To demonstrate the utility of
EEC, we exploit and implement EEC in two wireless
network applications, Wi-Fi rate adaptation and
real-time video streaming. Our real-world experiments
show that these applications can significantly benefit
from EEC.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raza:2012:MFR,
author = "Saqib Raza and Guanyao Huang and Chen-Nee Chuah and
Srini Seetharaman and Jatinder Pal Singh",
title = "{MeasuRouting}: a framework for routing assisted
traffic monitoring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "45--56",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159991",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Monitoring transit traffic at one or more points in a
network is of interest to network operators for reasons
of traffic accounting, debugging or troubleshooting,
forensics, and traffic engineering. Previous research
in the area has focused on deriving a placement of
monitors across the network toward the end of
maximizing the monitoring utility of the network
operator for a given traffic routing. However, both
traffic characteristics and measurement objectives can
dynamically change over time, rendering a previously
optimal placement of monitors suboptimal. It is not
feasible to dynamically redeploy/reconfigure
measurement infrastructure to cater to such evolving
measurement requirements. We address this problem by
strategically routing traffic subpopulations over fixed
monitors. We refer to this approach as MeasuRouting.
The main challenge for MeasuRouting is to work within
the constraints of existing intradomain traffic
engineering operations that are geared for efficiently
utilizing bandwidth resources, or meeting
quality-of-service (QoS) constraints, or both. A
fundamental feature of intradomain routing, which makes
MeasuRouting feasible, is that intradomain routing is
often specified for aggregate flows. MeasuRouting can
therefore differentially route components of an
aggregate flow while ensuring that the aggregate
placement is compliant to original traffic engineering
objectives. In this paper, we present a theoretical
framework for MeasuRouting. Furthermore, as proofs of
concept, we present synthetic and practical monitoring
applications to showcase the utility enhancement
achieved with MeasuRouting.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:SVM,
author = "Peilong Li and Honghai Zhang and Baohua Zhao and
Sampath Rangarajan",
title = "Scalable video multicast with adaptive modulation and
coding in broadband wireless data systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "57--68",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157700",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Future mobile broadband networks are characterized
with high data rate and improved coverage, which will
enable real-time video multicast and broadcast
services. Scalable video coding (SVC), combined with
adaptive modulation and coding schemes (MCS) and
wireless multicast, provides an excellent solution for
streaming video to heterogeneous wireless devices. By
choosing different MCSs for different video layers, SVC
can provide good video quality to users in good channel
conditions while maintaining basic video quality for
users in bad channel conditions. A key issue to apply
SVC to wireless multicast streaming is to choose
appropriate MCS for each video layer and to determine
the optimal resource allocation among multiple video
sessions. We formulate this problem as total utility
maximization, subject to the constraint of available
radio resources. We prove that the formulated problem
is NP-hard and propose an optimal, two-step dynamic
programming solution with pseudo-polynomial time
complexity. Simulation results show that our algorithm
offers significant improvement on the video quality
over a naive algorithm and an adapted greedy algorithm,
especially in the scenarios with multiple real video
sequences and limited radio resources.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2012:CPS,
author = "Chandramani Singh and Saswati Sarkar and Alireza Aram
and Anurag Kumar",
title = "Cooperative profit sharing in coalition-based resource
allocation in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "69--83",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159735",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a network in which several service
providers offer wireless access to their respective
subscribed customers through potentially multihop
routes. If providers cooperate by jointly deploying and
pooling their resources, such as spectrum and
infrastructure (e.g., base stations) and agree to serve
each others' customers, their aggregate payoffs, and
individual shares, may substantially increase through
opportunistic utilization of resources. The potential
of such cooperation can, however, be realized only if
each provider intelligently determines with whom it
would cooperate, when it would cooperate, and how it
would deploy and share its resources during such
cooperation. Also, developing a rational basis for
sharing the aggregate payoffs is imperative for the
stability of the coalitions. We model such cooperation
using the theory of transferable payoff coalitional
games. We show that the optimum cooperation strategy,
which involves the acquisition, deployment, and
allocation of the channels and base stations (to
customers), can be computed as the solution of a
concave or an integer optimization. We next show that
the grand coalition is stable in many different
settings, i.e., if all providers cooperate, there is
always an operating point that maximizes the providers'
aggregate payoff, while offering each a share that
removes any incentive to split from the coalition. The
optimal cooperation strategy and the stabilizing payoff
shares can be obtained in polynomial time by
respectively solving the primals and the duals of the
above optimizations, using distributed computations and
limited exchange of confidential information among the
providers. Numerical evaluations reveal that
cooperation substantially enhances individual
providers' payoffs under the optimal cooperation
strategy and several different payoff sharing rules.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2012:DGA,
author = "Kai Chen and Chuanxiong Guo and Haitao Wu and Jing
Yuan and Zhenqian Feng and Yan Chen and Songwu Lu and
Wenfei Wu",
title = "{DAC}: generic and automatic address configuration for
data center networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "84--99",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157520",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data center networks encode locality and topology
information into their server and switch addresses for
performance and routing purposes. For this reason, the
traditional address configuration protocols such as
DHCP require a huge amount of manual input, leaving
them error-prone. In this paper, we present DAC, a
generic and automatic Data center Address Configuration
system. With an automatically generated blueprint that
defines the connections of servers and switches labeled
by logical IDs, e.g., IP addresses, DAC first learns
the physical topology labeled by device IDs, e.g., MAC
addresses. Then, at the core of DAC is its
device-to-logical ID mapping and malfunction detection.
DAC makes an innovation in abstracting the
device-to-logical ID mapping to the graph isomorphism
problem and solves it with low time complexity by
leveraging the attributes of data center network
topologies. Its malfunction detection scheme detects
errors such as device and link failures and miswirings,
including the most difficult case where miswirings do
not cause any node degree change.We have evaluated DAC
via simulation, implementation, and experiments. Our
simulation results show that DAC can accurately find
all the hardest-to-detect malfunctions and can
autoconfigure a large data center with 3.8 million
devices in 46 s. In our implementation, we successfully
autoconfigure a small 64-server BCube network within
300 ms and show that DAC is a viable solution for data
center autoconfiguration.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sridharan:2012:GLS,
author = "Arun Sridharan and C. Emre Koksal and Elif
Uysal-Biyikoglu",
title = "A greedy link scheduler for wireless networks with
{Gaussian} multiple-access and broadcast channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "100--113",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157356",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information-theoretic broadcast channels (BCs) and
multiple-access channels (MACs) enable a single node to
transmit data simultaneously to multiple nodes, and
multiple nodes to transmit data simultaneously to a
single node, respectively. In this paper, we address
the problem of link scheduling in multihop wireless
networks containing nodes with BC and MAC capabilities.
We first propose an interference model that extends
protocol interference models, originally designed for
point-to-point channels, to include the possibility of
BCs and MACs. Due to the high complexity of optimal
link schedulers, we introduce the Multiuser Greedy
Maximum Weight algorithm for link scheduling in
multihop wireless networks containing BCs and MACs.
Given a network graph, we develop new local pooling
conditions and show that the performance of our
algorithm can be fully characterized using the
associated parameter, the multiuser local pooling
factor. We provide examples of some network graphs, on
which we apply local pooling conditions and derive the
multiuser local pooling factor. We prove optimality of
our algorithm in tree networks and show that the
exploitation of BCs and MACs improve the throughput
performance considerably in multihop wireless
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dikbiyik:2012:EEC,
author = "Ferhat Dikbiyik and Laxman Sahasrabuddhe and Massimo
Tornatore and Biswanath Mukherjee",
title = "Exploiting excess capacity to improve robustness of
{WDM} mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "114--124",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Excess capacity (EC) is the unused capacity in a
network. We propose EC management techniques to improve
network performance. Our techniques exploit the EC in
two ways. First, a connection preprovisioning algorithm
is used to reduce the connection setup time. Second,
whenever possible, we use protection schemes that have
higher availability and shorter protection switching
time. Specifically, depending on the amount of EC
available in the network, our proposed EC management
techniques dynamically migrate connections between
high-availability, high-backup-capacity protection
schemes and low-availability, low-backup-capacity
protection schemes. Thus, multiple protection schemes
can coexist in the network. The four EC management
techniques studied in this paper differ in two
respects: when the connections are migrated from one
protection scheme to another, and which connections are
migrated. Specifically, Lazy techniques migrate
connections only when necessary, whereas Proactive
techniques migrate connections to free up capacity in
advance. Partial Backup Reprovisioning (PBR) techniques
try to migrate a minimal set of connections, whereas
Global Backup Reprovisioning (GBR) techniques migrate
all connections. We develop integer linear program
(ILP) formulations and heuristic algorithms for the EC
management techniques. We then present numerical
examples to illustrate how the EC management techniques
improve network performance by exploiting the EC in
wavelength-division-multiplexing (WDM) mesh networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2012:LEN,
author = "Minlan Yu and Marina Thottan and Li Li",
title = "Latency equalization as a new network service
primitive",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "125--138",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2155669",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multiparty interactive network applications such as
teleconferencing, network gaming, and online trading
are gaining popularity. In addition to end-to-end
latency bounds, these applications require that the
delay difference among multiple clients of the service
is minimized for a good interactive experience. We
propose a Latency EQualization (LEQ) service, which
equalizes the perceived latency for all clients
participating in an interactive network application. To
effectively implement the proposed LEQ service, network
support is essential. The LEQ architecture uses a few
routers in the network as hubs to redirect packets of
interactive applications along paths with similar
end-to-end delay. We first formulate the hub selection
problem, prove its NP-hardness, and provide a greedy
algorithm to solve it. Through extensive simulations,
we show that our LEQ architecture significantly reduces
delay difference under different optimization criteria
that allow or do not allow compromising the per-user
end-to-end delay. Our LEQ service is incrementally
deployable in today's networks, requiring just software
modifications to edge routers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2012:OFL,
author = "Myungjin Lee and Nick Duffield and Ramana Rao
Kompella",
title = "Opportunistic flow-level latency estimation using
consistent netflow",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "139--152",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157975",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The inherent measurement support in routers (SNMP
counters or NetFlow) is not sufficient to diagnose
performance problems in IP networks, especially for
flow-specific problems where the aggregate behavior
within a router appears normal. Tomographic approaches
to detect the location of such problems are not
feasible in such cases as active probes can only catch
aggregate characteristics. To address this problem, in
this paper, we propose a Consistent NetFlow (CNF)
architecture for measuring per-flow delay measurements
within routers. CNF utilizes the existing NetFlow
architecture that already reports the first and last
timestamps per flow, and it proposes hash-based
sampling to ensure that two adjacent routers record the
same flows. We devise a novel Multiflow estimator that
approximates the intermediate delay samples from other
background flows to significantly improve the per-flow
latency estimates compared to the naive estimator that
only uses actual flow samples. In our experiments using
real backbone traces and realistic delay models, we
show that the Multiflow estimator is accurate with a
median relative error of less than 20\% for flows of
size greater than 100 packets. We also show that
Multiflow estimator performs two to three times better
than a prior approach based on trajectory sampling at
an equivalent packet sampling rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cho:2012:IDA,
author = "Sangman Cho and Theodore Elhourani and Srinivasan
Ramasubramanian",
title = "Independent directed acyclic graphs for resilient
multipath routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "153--162",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2161329",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In order to achieve resilient multipath routing, we
introduce the concept of independent directed acyclic
graphs (IDAGs) in this paper. Link-independent
(node-independent) DAGs satisfy the property that any
path from a source to the root on one DAG is
link-disjoint (node-disjoint) with any path from the
source to the root on the other DAG. Given a network,
we develop polynomial-time algorithms to compute
link-independent and node-independent DAGs. The
algorithm developed in this paper: (1) provides
multipath routing; (2) utilizes all possible edges; (3)
guarantees recovery from single link failure; and (4)
achieves all these with at most one bit per packet as
overhead when routing is based on destination address
and incoming edge. We show the effectiveness of the
proposed IDAGs approach by comparing key performance
indices to that of the independent trees and multiple
pairs of independent trees techniques through extensive
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Birand:2012:APG,
author = "Berk Birand and Maria Chudnovsky and Bernard Ries and
Paul Seymour and Gil Zussman and Yori Zwols",
title = "Analyzing the performance of greedy maximal scheduling
via local pooling and graph theory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "163--176",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157831",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient operation of wireless networks and switches
requires using simple (and in some cases distributed)
scheduling algorithms. In general, simple greedy
algorithms (known as Greedy Maximal Scheduling, or GMS)
are guaranteed to achieve only a fraction of the
maximum possible throughput (e.g., 50\% throughput in
switches). However, it was recently shown that in
networks in which the Local Pooling conditions are
satisfied, GMS achieves 100\% throughput. Moreover, in
networks in which the $ \sigma $-Local Pooling
conditions hold, GMS achieves $ \sigma \% $ throughput.
In this paper, we focus on identifying the specific
network topologies that satisfy these conditions. In
particular, we provide the first characterization of
all the network graphs in which Local Pooling holds
under primary interference constraints (in these
networks, GMS achieves 100\% throughput). This leads to
a linear-time algorithm for identifying
Local-Pooling-satisfying graphs. Moreover, by using
similar graph-theoretical methods, we show that in all
bipartite graphs (i.e., input-queued switches) of size
up to $ 7 \times n$, GMS is guaranteed to achieve 66\%
throughput, thereby improving upon the previously known
50\% lower bound. Finally, we study the performance of
GMS in interference graphs and show that in certain
specific topologies, its performance could be very bad.
Overall, the paper demonstrates that using
graph-theoretical techniques can significantly
contribute to our understanding of greedy scheduling
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2012:DOU,
author = "Hongseok Kim and Gustavo {De Veciana} and Xiangying
Yang and Muthaiah Venkatachalam",
title = "Distributed $ \alpha $-optimal user association and
cell load balancing in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "177--190",
month = feb,
year = "2012",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we develop a framework for user
association in infrastructure-based wireless networks,
specifically focused on flow-level cell load balancing
under spatially inhomogeneous traffic distributions.
Our work encompasses several different user association
policies: rate-optimal, throughput-optimal,
delay-optimal, and load-equalizing, which we
collectively denote $ \alpha $-optimal user
association. We prove that the optimal load vector $
\rho *$ that minimizes a generalized system performance
function is the fixed point of a certain mapping. Based
on this mapping, we propose and analyze an iterative
distributed user association policy that adapts to
spatial traffic loads and converges to a globally
optimal allocation.We then address admission control
policies for the case where the system is overloaded.
For an appropriate systemlevel cost function, the
optimal admission control policy blocks all flows at
cells edges. However, providing a minimum level of
connectivity to all spatial locations might be
desirable. To this end, a location-dependent random
blocking and user association policy are proposed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Campobello:2012:IES,
author = "Giuseppe Campobello and Alessandro Leonardi and Sergio
Palazzo",
title = "Improving energy saving and reliability in wireless
sensor networks using a simple {CRT}-based
packet-forwarding solution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "191--205",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2158442",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper deals with a novel forwarding scheme for
wireless sensor networks aimed at combining low
computational complexity and high performance in terms
of energy efficiency and reliability. The proposed
approach relies on a packet-splitting algorithm based
on the Chinese Remainder Theorem (CRT) and is
characterized by a simple modular division between
integers. An analytical model for estimating the energy
efficiency of the scheme is presented, and several
practical issues such as the effect of unreliable
channels, topology changes, and MAC overhead are
discussed. The results obtained show that the proposed
algorithm outperforms traditional approaches in terms
of power saving, simplicity, and fair distribution of
energy consumption among all nodes in the network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chowdhury:2012:VVN,
author = "Mosharaf Chowdhury and Muntasir Raihan Rahman and
Raouf Boutaba",
title = "{ViNEYard}: virtual network embedding algorithms with
coordinated node and link mapping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "206--219",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159308",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network virtualization allows multiple heterogeneous
virtual networks (VNs) to coexist on a shared
infrastructure. Efficient mapping of virtual nodes and
virtual links of a VN request onto substrate network
resources, also known as the VN embedding problem, is
the first step toward enabling such multiplicity. Since
this problem is known to be hard, previous research
focused on designing heuristic-based algorithms that
had clear separation between the node mapping and the
link mapping phases. In this paper, we present
ViNEYard--a collection of VN embedding algorithms that
leverage better coordination between the two phases. We
formulate the VN embedding problem as a mixed integer
program through substrate network augmentation.We then
relax the integer constraints to obtain a linear
program and devise two online VN embedding algorithms
D-ViNE and R-ViNE using deterministic and randomized
rounding techniques, respectively. We also present a
generalized window-based VN embedding algorithm (WiNE)
to evaluate the effect of lookahead on VN embedding.
Our simulation experiments on a large mix of VN
requests show that the proposed algorithms increase the
acceptance ratio and the revenue while decreasing the
cost incurred by the substrate network in the long
run.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shue:2012:AMA,
author = "Craig A. Shue and Andrew J. Kalafut and Minaxi Gupta",
title = "Abnormally malicious autonomous systems and their
{Internet} connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "220--230",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2157699",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "While many attacks are distributed across botnets,
investigators and network operators have recently
identified malicious networks through high profile
autonomous system (AS) depeerings and network
shutdowns. In this paper, we explore whether some ASs
indeed are safe havens for malicious activity. We look
for ISPs and ASs that exhibit disproportionately high
malicious behavior using 10 popular blacklists, plus
local spam data, and extensive DNS resolutions based on
the contents of the blacklists. We find that some ASs
have over 80\% of their routable IP address space
blacklisted. Yet others account for large fractions of
blacklisted IP addresses. Several ASs regularly peer
with ASs associated with significant malicious
activity. We also find that malicious ASs as a whole
differ from benign ones in other properties not
obviously related to their malicious activities, such
as more frequent connectivity changes with their BGP
peers. Overall, we conclude that examining malicious
activity at AS granularity can unearth networks with
lax security or those that harbor cybercrime.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ridoux:2012:CFF,
author = "Julien Ridoux and Darryl Veitch and Timothy
Broomhead",
title = "The case for feed-forward clock synchronization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "231--242",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2158443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Variable latencies due to communication delays or
system noise is the central challenge faced by
timekeeping algorithms when synchronizing over the
network. Using extensive experiments, we explore the
robustness of synchronization in the face of both
normal and extreme latency variability and compare the
feedback approaches of ntpd and ptpd (a software
implementation of IEEE-1588) to the feed-forward
approach of the RADclock and advocate for the benefits
of a feed-forward approach. Noting the current lack of
kernel support, we present extensions to existing
mechanisms in the Linux and FreeBSD kernels giving full
access to all available raw counters, and then evaluate
the TSC, HPET, and ACPI counters' suitability as
hardware timing sources. We demonstrate how the
RADclock achieves the same microsecond accuracy with
each counter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhorkar:2012:AOR,
author = "Abhijeet A. Bhorkar and Mohammad Naghshvar and Tara
Javidi and Bhaskar D. Rao",
title = "Adaptive opportunistic routing for wireless ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "243--256",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159844",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A distributed adaptive opportunistic routing scheme
for multihop wireless ad hoc networks is proposed. The
proposed scheme utilizes a reinforcement learning
framework to opportunistically route the packets even
in the absence of reliable knowledge about channel
statistics and network model. This scheme is shown to
be optimal with respect to an expected average
per-packet reward criterion. The proposed routing
scheme jointly addresses the issues of learning and
routing in an opportunistic context, where the network
structure is characterized by the transmission success
probabilities. In particular, this learning framework
leads to a stochastic routing scheme that optimally
``explores'' and ``exploits'' the opportunities in the
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2012:TLP,
author = "Hayang Kim and Xiaoli Ma and Benjamin Russell
Hamilton",
title = "Tracking low-precision clocks with time-varying drifts
using {Kalman} filtering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "257--270",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2158656",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Clock synchronization is essential for a large number
of applications ranging from performance measurements
in wired networks to data fusion in sensor networks.
Existing techniques are either limited to undesirable
accuracy or rely on specific hardware characteristics
that may not be available in certain applications. In
this paper, we examine the clock synchronization
problem in networks where nodes lack the high-accuracy
oscillators or programmable network interfaces some
previous protocols depend on. This paper derives a
general model for clock offset and skew and
demonstrates its application to real clock oscillators.
We design an efficient algorithm based on this model to
achieve high synchronization accuracy. This algorithm
applies the Kalman filter to track the clock offset and
skew. We demonstrate the performance advantages of our
schemes through extensive simulations and real clock
oscillator measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2012:OPL,
author = "Yihua He and Michalis Faloutsos and Srikanth V.
Krishnamurthy and Marek Chrobak",
title = "Obtaining provably legitimate {Internet} topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "271--284",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Apr 9 17:46:48 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "What topologies should be used to evaluate protocols
for interdomain routing? Using the most current
Internet topology is not practical since its size is
prohibitive for detailed, packet-level interdomain
simulations. Besides being of moderate size, the
topology should be policy-aware, that is, it needs to
represent business relationships between adjacent nodes
(that represent autonomous systems). In this paper, we
address this issue by providing a framework to generate
small, realistic, and policy-aware topologies. We
propose HBR, a novel sampling method, which exploits
the inherent hierarchy of the policy-aware Internet
topology. We formally prove that our approach generates
connected and legitimate topologies, which are
compatible with the policy-based routing conventions
and rules. Using simulations, we show that HBR
generates topologies that: (1) maintain the graph
properties of the real topology; (2) provide reasonably
realistic interdomain simulation results while reducing
the computational complexity by several orders of
magnitude as compared to the initial topology. Our
approach provides a permanent solution to the problem
of interdomain routing evaluations: Given a more
accurate and complete topology, HBR can generate better
small topologies in the future.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Andrews:2012:RPM,
author = "Matthew Andrews and Antonio Fern{\'a}ndez Anta and
Lisa Zhang and Wenbo Zhao",
title = "Routing for power minimization in the speed scaling
model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "285--294",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:07:13 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study network optimization that considers power
minimization as an objective. Studies have shown that
mechanisms such as speed scaling can significantly
reduce the power consumption of telecommunication
networks by matching the consumption of each network
element to the amount of processing required for its
carried traffic. Most existing research on speed
scaling focuses on a single network element in
isolation. We aim for a network-wide optimization.
Specifically, we study a routing problem with the
objective of provisioning guaranteed speed/bandwidth
for a given demand matrix while minimizing power
consumption. Optimizing the routes critically relies on
the characteristic of the speed-power curve $ f(s) $,
which is how power is consumed as a function of the
processing speed $s$. If $f$ is superadditive, we show
that there is no bounded approximation in general for
integral routing, i.e., each traffic demand follows a
single path. This contrasts with the well-known
logarithmic approximation for subadditive functions.
However, for common speed-power curves such as
polynomials $ f(s) = \micro s^\alpha $, we are able to
show a constant approximation via a simple scheme of
randomized rounding. We also generalize this rounding
approach to handle the case in which a nonzero startup
cost $ \sigma $ appears in the speed-power curve, i.e.,
$ f(s) = 0 $, if $ s = 0 \sigma + \micro s^\alpha $, if
$ s > 0 $. We present an $ O((\sigma / \micro)^{1 /
\alpha }) $-approximation, and we discuss why coming up
with an approximation ratio independent of the startup
cost may be hard. Finally, we provide simulation
results to validate our algorithmic approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hao:2012:FDM,
author = "Fang Hao and Murali Kodialam and T. V. Lakshman and
Haoyu Song",
title = "Fast dynamic multiple-set membership testing using
combinatorial {Bloom} filters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "295--304",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2173351",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:07:13 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of designing a
data structure that can perform fast multiple-set
membership testing in deterministic time. Our primary
goal is to develop a hardware implementation of the
data structure that uses only embedded memory blocks.
Prior efforts to solve this problem involve hashing
into multiple Bloom filters. Such approach needs a
priori knowledge of the number of elements in each set
in order to size the Bloom filter. We use a
single-Bloom-filter-based approach and use multiple
sets of hash functions to code for the set (group) id.
Since a single Bloom filter is used, it does not need a
priori knowledge of the distribution of the elements
across the different sets. We show how to improve the
performance of the data structure by using
constant-weight error-correcting codes for coding the
group id. Using error-correcting codes improves the
performance of these data structures especially when
there are a large number of sets. We also outline an
efficient hardware-based approach to generate the large
number of hash functions that we need for this data
structure. The resulting data structure, COMB, is
amenable to a variety of time-critical network
applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2012:CLA,
author = "Yunbo Wang and Mehmet C. Vuran and Steve Goddard",
title = "Cross-layer analysis of the end-to-end delay
distribution in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "1",
pages = "305--318",
month = feb,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159845",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:07:13 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Emerging applications of wireless sensor networks
(WSNs) require real-time quality-of-service (QoS)
guarantees to be provided by the network. Due to the
nondeterministic impacts of the wireless channel and
queuing mechanisms, probabilistic analysis of QoS is
essential. One important metric of QoS in WSNs is the
probability distribution of the end-to-end delay.
Compared to other widely used delay performance metrics
such as the mean delay, delay variance, and worst-case
delay, the delay distribution can be used to obtain the
probability to meet a specific deadline for QoS-based
communication in WSNs. To investigate the end-to-end
delay distribution, in this paper, a comprehensive
cross-layer analysis framework, which employs a
stochastic queueing model in realistic channel
environments, is developed. This framework is generic
and can be parameterized for a wide variety of MAC
protocols and routing protocols. Case studies with the
CSMA/CAMAC protocol and an anycast protocol are
conducted to illustrate how the developed framework can
analytically predict the distribution of the end-to-end
delay. Extensive test-bed experiments and simulations
are performed to validate the accuracy of the framework
for both deterministic and random deployments.
Moreover, the effects of various network parameters on
the distribution of end-to-end delay are investigated
through the developed framework. To the best of our
knowledge, this is the first work that provides a
generic, probabilistic cross-layer analysis of
end-to-end delay in WSNs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wei:2012:ITP,
author = "Wei Wei and Sharad Jaiswal and Jim Kurose and Don
Towsley and Kyoungwon Suh and Bing Wang",
title = "Identifying 802.11 traffic from passive measurements
using iterative {Bayesian} inference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "325--338",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2159990",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a classification scheme that
differentiates Ethernet and WLAN TCP flows based on
measurements collected passively at the edge of a
network. This scheme computes two quantities, the
fraction of wireless TCP flows and the degree of belief
that a TCP flow traverses a WLAN inside the network,
using an iterative Bayesian inference algorithm that we
developed. We prove that this iterative Bayesian
inference algorithm converges to the unique maximum
likelihood estimate (MLE) of these two quantities.
Furthermore, it has the advantage that it can handle
any general-classification problem given the marginal
distributions of these classes. Numerical and
experimental evaluations demonstrate that our
classification scheme obtains accurate results. We
apply this scheme to two sets of traces collected from
two campus networks: one set collected from UMass in
mid 2005 and the other collected from UConn in late
2010. Our technique infers that 4\%--7\% and 52\%--55\%
of incoming TCP flows traverse an IEEE 802.11 wireless
link in these two networks, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2012:SLO,
author = "Sungho Yun and Constantine Caramanis",
title = "System-level optimization in wireless networks:
managing interference and uncertainty via robust
optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "339--352",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2185508",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a robust-optimization-driven systemlevel
approach to interference management in a cellular
broadband system operating in an interference-limited
and highly dynamic regime. Here, base stations in
neighboring cells (partially) coordinate their
transmission schedules in an attempt to avoid
simultaneous max-power transmission to their mutual
cell edge. Limits on communication overhead and use of
the backhaul require base station coordination to occur
at a slower timescale than the customer arrival
process. The central challenge is to properly structure
coordination decisions at the slow timescale, as these
subsequently restrict the actions of each base station
until the next coordination period. Moreover, because
coordination occurs at the slower timescale, the
statistics of the arriving customers, e.g., the load,
are typically only approximately known--thus, this
coordination must be done with only approximate
knowledge of statistics. We show that performance of
existing approaches that assume exact knowledge of
these statistics can degrade rapidly as the uncertainty
in the arrival process increases. We show that a
two-stage robust optimization framework is a natural
way to model two-timescale decision problems. We
provide tractable formulations for the base-station
coordination problem and show that our formulation is
robust to fluctuations (uncertainties) in the arriving
load. This tolerance to load fluctuation also serves to
reduce the need for frequent reoptimization across base
stations, thus helping minimize the communication
overhead required for system-level interference
reduction. Our robust optimization formulations are
flexible, allowing us to control the conservatism of
the solution. Our simulations show that we can build in
robustness without significant degradation of nominal
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Manweiler:2012:OMT,
author = "Justin Manweiler and Naveen Santhapuri and Souvik Sen
and Romit Roy Choudhury and Srihari Nelakuditi and
Kamesh Munagala",
title = "Order matters: transmission reordering in wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "353--366",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2164264",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern wireless interfaces support a physical-layer
capability called Message in Message (MIM). Briefly,
MIM allows a receiver to disengage from an ongoing
reception and engage onto a stronger incoming signal.
Links that otherwise conflict with each other can be
made concurrent with MIM. However, the concurrency is
not immediate and can be achieved only if conflicting
links begin transmission in a specific order. The
importance of link order is new in wireless research,
motivating MIM-aware revisions to link-scheduling
protocols. This paper identifies the opportunity in
MIM-aware reordering, characterizes the optimal
improvement in throughput, and designs a link-layer
protocol for enterprise wireless LANs to achieve it.
Testbed and simulation results confirm the performance
gains of the proposed system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2012:MFA,
author = "Bridge Qiao Zhao and John C. S. Lui and Dah-Ming
Chiu",
title = "A mathematical framework for analyzing adaptive
incentive protocols in {P2P} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "367--380",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2161770",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In peer-to-peer (P2P) networks, incentive protocol is
used to encourage cooperation among end-nodes so as to
deliver a scalable and robust service. However, the
design and analysis of incentive protocols have been ad
hoc and heuristic at best. The objective of this paper
is to provide a simple yet general framework to analyze
and design incentive protocols. We consider a class of
incentive protocols that can learn and adapt to other
end-nodes' strategies. Based on our analytical
framework, one can evaluate the expected performance
gain and, more importantly, the system robustness of a
given incentive protocol. To illustrate the framework,
we present two adaptive learning models and three
incentive policies and show the conditions in which the
P2P networks may collapse and the conditions in which
the P2P networks can guarantee a high degree of
cooperation. We also show the connection between
evaluating incentive protocol and evolutionary game
theory so one can easily identify robustness
characteristics of a given policy. Using our framework,
one can gain the understanding on the price of altruism
and system stability, as well as the correctness of the
adaptive incentive policy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Soldo:2012:OSB,
author = "Fabio Soldo and Katerina Argyraki and Athina
Markopoulou",
title = "Optimal source-based filtering of malicious traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "381--395",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2161615",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of blocking
malicious traffic on the Internet via source-based
filtering. In particular, we consider filtering via
access control lists (ACLs): These are already
available at the routers today, but are a scarce
resource because they are stored in the expensive
ternary content addressable memory (TCAM). Aggregation
(by filtering source prefixes instead of individual IP
addresses) helps reduce the number of filters, but
comes also at the cost of blocking legitimate traffic
originating from the filtered prefixes. We show how to
optimally choose which source prefixes to filter for a
variety of realistic attack scenarios and operators'
policies. In each scenario, we design optimal, yet
computationally efficient, algorithms. Using logs from
Dshield.org, we evaluate the algorithms and demonstrate
that they bring significant benefit in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Venkataraman:2012:QVQ,
author = "Mukundan Venkataraman and Mainak Chatterjee",
title = "Quantifying video-{QoE} degradations of {Internet}
links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "396--407",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2167684",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the proliferation of multimedia content on the
Internet, there is an increasing demand for video
streams with high perceptual quality. The capability of
present-day Internet links in delivering
high-perceptual-quality streaming services, however, is
not completely understood. Link-level degradations
caused by intradomain routing policies and inter-ISP
peering policies are hard to obtain, as Internet
service providers often consider such information
proprietary. Understanding link-level degradations will
enable us in designing future protocols, policies, and
architectures to meet the rising multimedia demands.
This paper presents a trace-driven study to understand
quality-of-experience (QoE) capabilities of present-day
Internet links using 51 diverse ISPs with a major
presence in the US, Europe, and Asia-Pacific. We study
their links from 38 vantage points in the Internet
using both passive tracing and active probing for six
days. We provide the first measurements of link-level
degradations and case studies of intra-ISP and
inter-ISP peering links from a multimedia standpoint.
Our study offers surprising insights into intradomain
traffic engineering, peering link loading, BGP, and the
inefficiencies of using autonomous system (AS)-path
lengths as a routing metric. Though our results
indicate that Internet routing policies are not
optimized for delivering high-perceptual-quality
streaming services, we argue that alternative
strategies such as overlay networks can help meet QoE
demands over the Internet. Streaming services apart,
our Internet measurement results can be used as an
input to a variety of research problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mao:2012:TBU,
author = "Guoqiang Mao and Brian D. O. Anderson",
title = "Towards a better understanding of large-scale network
models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "408--421",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2160650",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Connectivity and capacity are two fundamental
properties of wireless multihop networks. The
scalability of these properties has been a primary
concern for which asymptotic analysis is a useful tool.
Three related but logically distinct network models are
often considered in asymptotic analyses, viz. the dense
network model, the extended network model, and the
infinite network model, which consider respectively a
network deployed in a fixed finite area with a
sufficiently large node density, a network deployed in
a sufficiently large area with a fixed node density,
and a network deployed in R$^2$ with a sufficiently
large node density. The infinite network model
originated from continuum percolation theory and
asymptotic results obtained from the infinite network
model have often been applied to the dense and extended
networks. In this paper, through two case studies
related to network connectivity on the expected number
of isolated nodes and on the vanishing of components of
finite order k > 1 respectively, we demonstrate some
subtle but important differences between the infinite
network model and the dense and extended network
models. Therefore, extra scrutiny has to be used in
order for the results obtained from the infinite
network model to be applicable to the dense and
extended network models. Asymptotic results are also
obtained on the expected number of isolated nodes, the
vanishingly small impact of the boundary effect on the
number of isolated nodes, and the vanishing of
components of finite order k > 1 in the dense and
extended network models using a generic random
connection model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Menth:2012:PPB,
author = "Michael Menth and Frank Lehrieder",
title = "Performance of {PCN}-based admission control under
challenging conditions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "422--435",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2189415",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Precongestion notification (PCN) is a packet-marking
technique for IP networks to notify egress nodes of a
so-called PCN domain whether the traffic rate on some
links exceeds certain configurable bounds. This
feedback is used by decision points for admission
control (AC) to block new flows when the traffic load
is already high. PCN-based AC is simpler than other AC
methods because interior routers do not need to keep
per-flow states. Therefore, it is currently being
standardized by the IETF. We discuss various
realization options and analyze their performance in
the presence of flash crowds or with multipath routing
by means of simulation and mathematical modeling. Such
situations can be aggravated by insufficient flow
aggregation, long round-trip times, on/off traffic,
delayed media, inappropriate marker configuration, and
smoothed feedback.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Reiter:2012:CDP,
author = "Mikl{\'o}s Reiter and Richard Steinberg",
title = "Congestion-dependent pricing and forward contracts for
complementary segments of a communication network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "436--449",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2160997",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Congestion-dependent pricing is a form of traffic
management that ensures the efficient allocation of
bandwidth between users and applications. As the
unpredictability of congestion prices creates revenue
uncertainty for network providers and cost uncertainty
for users, it has been suggested that forward contracts
could be used to manage these risks. We develop a novel
game-theoretic model of a multiprovider communication
network with two complementary segments and investigate
whether forward contracts would be adopted by service
providers. Service on the upstream segment is provided
by a single Internet service provider (ISP) and priced
dynamically to maximize profit, while several smaller
ISPs sell connectivity on the downstream network
segment, with the advance possibility of entering into
forward contracts with their users for some of their
capacity. We show that the equilibrium forward
contracting volumes are necessarily asymmetric, with
one downstream provider entering into fewer forward
contracts than the other competitors, thus ensuring a
high subsequent downstream price level. In practice,
network providers will choose the extent of forward
contracting strategically based not only on their risk
tolerance, but also on the market structure in the
interprovider network and their peers' actions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2012:EDF,
author = "Rui Tan and Guoliang Xing and Benyuan Liu and Jianping
Wang and Xiaohua Jia",
title = "Exploiting data fusion to improve the coverage of
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "450--462",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2164620",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks (WSNs) have been increasingly
available for critical applications such as security
surveillance and environmental monitoring. An important
performance measure of such applications is sensing
coverage that characterizes how well a sensing field is
monitored by a network. Although advanced collaborative
signal processing algorithms have been adopted by many
existing WSNs, most previous analytical studies on
sensing coverage are conducted based on overly
simplistic sensing models (e.g., the disc model) that
do not capture the stochastic nature of sensing. In
this paper, we attempt to bridge this gap by exploring
the fundamental limits of coverage based on stochastic
data fusion models that fuse noisy measurements of
multiple sensors. We derive the scaling laws between
coverage, network density, and signal-to-noise ratio
(SNR). We show that data fusion can significantly
improve sensing coverage by exploiting the
collaboration among sensors when several physical
properties of the target signal are known. In
particular, for signal path loss exponent of k
(typically between 2.0 and 5.0), $ \rho f = O(\rho d^{1
1 / k}) $ where $ \rho f $ and $ \rho d $ are the
densities of uniformly deployed sensors that achieve
full coverage under the fusion and disc models,
respectively. Moreover, data fusion can also reduce
network density for regularly deployed networks and
mobile networks where mobile sensors can relocate to
fill coverage holes. Our results help understand the
limitations of the previous analytical results based on
the disc model and provide key insights into the design
of WSNs that adopt data fusion algorithms. Our analyses
are verified through extensive simulations based on
both synthetic data sets and data traces collected in a
real deployment for vehicle detection.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiaraviglio:2012:MIN,
author = "Luca Chiaraviglio and Marco Mellia and Fabio Neri",
title = "Minimizing {ISP} network energy cost: formulation and
solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "463--476",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2161487",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "According to several studies, the power consumption of
the Internet accounts for up to 10\% of the worldwide
energy consumption and is constantly increasing. The
global consciousness on this problem has also grown,
and several initiatives are being put into place to
reduce the power consumption of the ICT sector in
general. In this paper, we face the problem of
minimizing power consumption for Internet service
provider (ISP) networks. In particular, we propose and
assess strategies to concentrate network traffic on a
minimal subset of network resources. Given a
telecommunication infrastructure, our aim is to turn
off network nodes and links while still guaranteeing
full connectivity and maximum link utilization
constraints. We first derive a simple and complete
formulation, which results into an NP-hard problem that
can be solved only for trivial cases. We then derive
more complex formulations that can scale up to
middle-sized networks. Finally, we provide efficient
heuristics that can be used for large networks. We test
the effectiveness of our algorithms on both real and
synthetic topologies, considering the daily
fluctuations of Internet traffic and different classes
of users. Results show that the power savings can be
significant, e.g., larger than 35\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Buchbinder:2012:DPA,
author = "Niv Buchbinder and Liane Lewin-Eytan and Ishai Menache
and Joseph Naor and Ariel Orda",
title = "Dynamic power allocation under arbitrary varying
channels: an online approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "477--487",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2170092",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A major problem in wireless networks is coping with
limited resources, such as bandwidth and energy. These
issues become a major algorithmic challenge in view of
the dynamic nature of the wireless domain. We consider
in this paper the single-transmitter power assignment
problem under time-varying channels, with the objective
of maximizing the data throughput. It is assumed that
the transmitter has a limited power budget, to be
sequentially divided during the lifetime of the
battery. We deviate from the classic work in this area,
which leads to explicit ``water-filling'' solutions, by
considering a realistic scenario where the channel
state quality changes arbitrarily from one transmission
to the other. The problem is accordingly tackled within
the framework of competitive analysis, which allows for
worst-case performance guarantees in setups with
arbitrarily varying channel conditions. We address both
a ``discrete'' case, where the transmitter can transmit
only at a fixed power level, and a ``continuous'' case,
where the transmitter can choose any power level out of
a bounded interval. For both cases, we propose online
power-allocation algorithms with proven worst-case
performance bounds. In addition, we establish lower
bounds on the worst-case performance of any online
algorithm and show that our proposed algorithms are
optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Meiners:2012:BWN,
author = "Chad R. Meiners and Alex X. Liu and Eric Torng",
title = "Bit weaving: a non-prefix approach to compressing
packet classifiers in {TCAMs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "488--500",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ternary content addressable memories (TCAMs) have
become the de facto standard in industry for fast
packet classification. Unfortunately, TCAMs have
limitations of small capacity, high power consumption,
high heat generation, and high cost. The well-known
range expansion problem exacerbates these limitations
as each classifier rule typically has to be converted
to multiple TCAM rules. One method for coping with
these limitations is to use compression schemes to
reduce the number of TCAM rules required to represent a
classifier. Unfortunately, all existing compression
schemes only produce prefix classifiers. Thus, they all
miss the compression opportunities created by nonprefix
ternary classifiers. In this paper, we propose bit
weaving, the first non-prefix compression scheme. Bit
weaving is based on the observation that TCAM entries
that have the same decision and whose predicates differ
by only one bit can be merged into one entry by
replacing the bit in question with. Bit weaving
consists of two new techniques, bit swapping and bit
merging, to first identify and then merge such rules
together. The key advantages of bit weaving are that it
runs fast, it is effective, and it is composable with
other TCAM optimization methods as a
pre/post-processing routine. We implemented bit weaving
and conducted experiments on both real-world and
synthetic packet classifiers. Our experimental results
show the following: (1) bit weaving is an effective
standalone compression technique (it achieves an
average compression ratio of 23.6\%); (2) bit weaving
finds compression opportunities that other methods
miss. Specifically, bit weaving improves the prior TCAM
optimization techniques of TCAM Razor and Topological
Transformation by an average of 12.8\% and 36.5\%,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jung:2012:OSA,
author = "Eric Jung and Xin Liu",
title = "Opportunistic spectrum access in multiple-primary-user
environments under the packet collision constraint",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "501--514",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2164933",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio (CR) technology has great potential to
alleviate spectrum scarcity in wireless communications.
It allows secondary users (SUs) to opportunistically
access spectrum licensed by primary users (PUs) while
protecting PU activity. The protection of the PUs is
central to the adoption of this technology since no PU
would accommodate SU access to its own detriment. In
this paper, we consider an SUthat must protect multiple
PUs simultaneously. We focus on the PU packet collision
probability as the protection metric. The PUs are
unslotted and may have different idle/busy time
distributions and protection requirements. Under
general idle time distributions, we determine the form
of the SU optimal access policy and identify two
special cases for which the computation of the optimal
policy is significantly reduced. We also present a
simple algorithm to determine these policies using
principles of convex optimization theory. We then
derive the optimal policy for the same system when an
SU has extra ``side information'' on PU activity. We
evaluate the performance of these policies through
simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2012:SSS,
author = "Kyunghan Lee and Seongik Hong and Seong Joon Kim and
Injong Rhee and Song Chong",
title = "{SLAW}: self-similar least-action human walk",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "515--529",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2172984",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many empirical studies of human walks have reported
that there exist fundamental statistical features
commonly appearing in mobility traces taken in various
mobility settings. These include: (1) heavy-tail flight
and pause-time distributions; (2) heterogeneously
bounded mobility areas of individuals; and (3)
truncated power-law intercontact times. This paper
reports two additional such features: (a) The
destinations of people (or we say waypoints) are
dispersed in a self-similar manner; and (b) people are
more likely to choose a destination closer to its
current waypoint. These features are known to be
influential to the performance of human-assisted
mobility networks. The main contribution of this paper
is to present a mobility model called Self-similar
Least-Action Walk (SLAW) that can produce synthetic
mobility traces containing all the five statistical
features in various mobility settings including
user-created virtual ones for which no empirical
information is available. Creating synthetic traces for
virtual environments is important for the performance
evaluation of mobile networks as network designers test
their networks in many diverse network settings. A
performance study of mobile routing protocols on top of
synthetic traces created by SLAW shows that SLAW brings
out the unique performance features of various routing
protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shu:2012:FCR,
author = "Tao Shu and Marwan Krunz",
title = "Finding cheap routes in profit-driven opportunistic
spectrum access networks: a truthful mechanism design
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "530--543",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2166274",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we explore the economic aspects of
routing/relaying in a profit-driven opportunistic
spectrum access (OSA) network. In this network, primary
users lease their licensed spectrum to secondary radio
(SR) providers, who in turn provide opportunistic
routing/relaying service to end-users if this service
is profitable, i.e., if the payment offered by the
end-user (a.k.a. the price) exceeds the SR's relaying
spectrum cost. This cost is considered private
information known only to SRs. Therefore, the end-user
has to rely on costs reported by SRs to determine his
routing and payment strategy. The challenge comes from
the selfish nature of SRs; an SR may exaggerate his
cost to achieve greater profit. To give incentive to an
SR to report the true cost, the payment must typically
be higher than the actual cost. However, from the
end-user's perspective, ``overpayment'' should be
avoided as much as possible. Therefore, we are
interested in the ``optimal'' route selection and
payment determination mechanism that minimizes the
price of the selected route while simultaneously
guaranteeing truthful cost reporting by SRs. We
formulate this problem as finding the least-priced path
(LPP), and we investigate it without and with link
capacity constraints. In the former case,
polynomial-time algorithm is developed to find LPP and
calculate its truthful price. In the latter case, we
show that calculating the truthful price of the LPP is
in general computationally infeasible. Consequently, we
consider a suboptimal but computationally feasible
approximate solution, which we refer to as truthful
low-priced path (LOPP) routing. A polynomial-time
algorithm is proposed to find the LOPP and efficiently
calculate its truthful price. A payment materialization
algorithm is also developed to guarantee truthful
capacity reporting by SRs. The effectiveness of our
algorithms in terms of price saving is verified through
extensive simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sen:2012:CCC,
author = "Souvik Sen and Romit Roy Choudhury and Srihari
Nelakuditi",
title = "{CSMA\slash CN}: carrier sense multiple access with
collision notification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "544--556",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2174461",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A wireless transmitter learns of a packet loss and
infers collision only after completing the entire
transmission. If the transmitter could detect the
collision early [such as with carrier sense multiple
access with collision detection (CSMA/CD) in wired
networks], it could immediately abort its transmission,
freeing the channel for useful communication. There are
two main hurdles to realize CSMA/CD in wireless
networks. First, a wireless transmitter cannot
simultaneously transmit and listen for a collision.
Second, any channel activity around the transmitter may
not be an indicator of collision at the receiver. This
paper attempts to approximate CSMA/CD in wireless
networks with a novel scheme called CSMA/CN (collision
notification). Under CSMA/CN, the receiver uses
PHY-layer information to detect a collision and
immediately notifies the transmitter. The collision
notification consists of a unique signature, sent on
the same channel as the data. The transmitter employs a
listener antenna and performs signature correlation to
discern this notification. Once discerned, the
transmitter immediately aborts the transmission. We
show that the notification signature can be reliably
detected at the listener antenna, even in the presence
of a strong self-interference from the transmit
antenna. A prototype testbed of 10 USRP/GNU Radios
demonstrates the feasibility and effectiveness of
CSMA/CN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jang:2012:IST,
author = "Beakcheol Jang and Mihail L. Sichitiu",
title = "{IEEE 802.11} saturation throughput analysis in the
presence of hidden terminals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "557--570",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165322",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to its usefulness and wide deployment, IEEE 802.11
has been the subject of numerous studies, but still
lacks a complete analytical model. Hidden terminals are
common in IEEE 802.11 and cause the degradation of
throughput. Despite the importance of the hidden
terminal problem, there have been a relatively small
number of studies that consider the effect of hidden
terminals on IEEE 802.11 throughput, and many are not
accurate for a wide range of conditions. In this paper,
we present an accurate new analytical saturation
throughput model for the infrastructure case of IEEE
802.11 in the presence of hidden terminals. Simulation
results show that our model is accurate in a wide
variety of cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Elmokashfi:2012:BCE,
author = "Ahmed Elmokashfi and Amund Kvalbein and Constantine
Dovrolis",
title = "{BGP} churn evolution: a perspective from the core",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "571--584",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2168610",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The scalability limitations of BGP have been a major
concern lately. An important aspect of this issue is
the rate of routing updates (churn) that BGP routers
must process. This paper presents an analysis of the
evolution of churn in four networks at the backbone of
the Internet over a period of seven years and eight
months, using BGP update traces from the RouteViews
project. The churn rate varies widely over time and
between networks. Instead of descriptive ``black-box''
statistical analysis, we take an exploratory data
analysis approach attempting to understand the reasons
behind major observed characteristics of the churn time
series. We find that duplicate announcements are a
major churn contributor, responsible for most large
spikes. Remaining spikes are mostly caused by routing
incidents that affect a large number of prefixes
simultaneously. More long-term intense periods of
churn, on the other hand, are caused by
misconfigurations or other special events at or close
to the monitored autonomous system (AS). After
filtering pathologies and effects that are not related
to the long-term evolution of churn, we analyze the
remaining ``baseline'' churn and find that it is
increasing at a rate that is similar to the growth of
the number of ASs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kozica:2012:QTP,
author = "Ermin Kozica and W. Bastiaan Kleijn",
title = "A quantization theoretic perspective on simulcast and
layered multicast optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "585--593",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2169085",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider rate optimization in multicast systems
that use several multicast trees on a communication
network. The network is shared between different
applications. For that reason, we model the available
bandwidth for multicast as stochastic. For specific
network topologies, we show that the multicast rate
optimization problem is equivalent to the optimization
of scalar quantization. We use results from
rate-distortion theory to provide a bound on the
achievable performance for the multicast rate
optimization problem. A large number of receivers makes
the possibility of adaptation to changing network
conditions desirable in a practical system. To this
end, we derive an analytical solution to the problem
that is asymptotically optimal in the number of
multicast trees. We derive local optimality conditions,
which we use to describe a general class of iterative
algorithms that give locally optimal solutions to the
problem. Simulation results are provided for the
multicast of an i.i.d. Gaussian process, an i.i.d.
Laplacian process, and a video source.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Courcoubetis:2012:EIS,
author = "Costas Courcoubetis and Richard Weber",
title = "Economic issues in shared infrastructures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "594--608",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2163824",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In designing and managing a shared infrastructure, one
must take account of the fact that its participants
will make self-interested and strategic decisions about
the resources that they are willing to contribute to it
and/or the share of its cost that they are willing to
bear. Taking proper account of the incentive issues
that thereby arise, we design mechanisms that, by
eliciting appropriate information from the
participants, can obtain for them maximal social
welfare, subject to charging payments that are
sufficient to cover costs. We show that there are
incentivizing roles to be played both by the payments
that we ask from the participants and the specification
of how resources are to be shared. New in this paper is
our formulation of models for designing optimal
management policies, our analysis that demonstrates the
inadequacy of simple sharing policies, and our
proposals for some better ones. We learn that simple
policies may be far from optimal and that efficient
policy design is not trivial. However, we find that
optimal policies have simple forms in the limit as the
number of participants becomes large.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dinh:2012:NAA,
author = "Thang N. Dinh and Ying Xuan and My T. Thai and Panos
M. Pardalos and Taieb Znati",
title = "On new approaches of assessing network vulnerability:
hardness and approximation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "609--619",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2170849",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Society relies heavily on its networked physical
infrastructure and information systems. Accurately
assessing the vulnerability of these systems against
disruptive events is vital for planning and risk
management. Existing approaches to vulnerability
assessments of large-scale systems mainly focus on
investigating inhomogeneous properties of the
underlying graph elements. These measures and the
associated heuristic solutions are limited in
evaluating the vulnerability of large-scale network
topologies. Furthermore, these approaches often fail to
provide performance guarantees of the proposed
solutions. In this paper, we propose a vulnerability
measure, pairwise connectivity, and use it to formulate
network vulnerability assessment as a graph-theoretical
optimization problem, referred to as $ \beta
$-disruptor. The objective is to identify the minimum
set of critical network elements, namely nodes and
edges, whose removal results in a specific degradation
of the network global pairwise connectivity. We prove
the NP-completeness and inapproximability of this
problem and propose an $ O (\log n \log \log n)$
pseudo-approximation algorithm to computing the set of
critical nodes and an $ O(\log^{1.5}n)$
pseudo-approximation algorithm for computing the set of
critical edges. The results of an extensive
simulation-based experiment show the feasibility of our
proposed vulnerability assessment framework and the
efficiency of the proposed approximation algorithms in
comparison to other approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Carofiglio:2012:ITP,
author = "Giovanna Carofiglio and Luca Muscariello",
title = "On the impact of {TCP} and per-flow scheduling on
{Internet} performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "2",
pages = "620--633",
month = apr,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2164553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 26 17:47:12 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet performance is tightly related to the
properties of TCP and UDP protocols, jointly
responsible for the delivery of the great majority of
Internet traffic. It is well understood how these
protocols behave under first-in-first-out (FIFO)
queuing and what are the network congestion effects.
However, no comprehensive analysis is available when
flow-aware mechanisms such as per-flow scheduling and
dropping policies are deployed. Previous simulation and
experimental results leave a number of unanswered
questions. In this paper, we tackle this issue by
modeling via a set of fluid nonlinear ordinary
differential equations (ODEs) the instantaneous
throughput and the buffer occupancy of N long-lived TCP
sources under three per-flow scheduling disciplines
(Fair Queuing, Longest Queue First, Shortest Queue
First) and with longest queue drop buffer management.
We study the system evolution and analytically
characterize the stationary regime: Closed-form
expressions are derived for the stationary
throughput/sending rate and buffer occupancy, which
give a thorough understanding of short/ long-term
fairness for TCP traffic. Similarly, we provide the
characterization of the loss rate experienced by UDP
flows in the presence of TCP traffic. As a result, the
analysis allows to quantify benefits and drawbacks
related to the deployment of flow-aware scheduling
mechanisms in different networking contexts. The model
accuracy is confirmed by a set of ns 2 simulations and
by the evaluation of the three scheduling disciplines
in a real implementation in the Linux kernel.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Parvez:2012:IMS,
author = "Khandoker Nadim Parvez and Carey Williamson and
Anirban Mahanti and Niklas Carlsson",
title = "Insights on media streaming progress using
{BitTorrent}-like protocols for on-demand streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "637--650",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2166087",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper develops analytical models that
characterize the behavior of on-demand stored media
content delivery using BitTorrent-like protocols. The
models capture the effects of different piece selection
policies, including Rarest-First, two variants of
In-Order, and two probabilistic policies (Portion and
Zipf). Our models provide insight into system behavior
and help explain the sluggishness of the system with
In-Order streaming. We use the models to compare
different retrieval policies across a wide range of
system parameters, including peer arrival rate, upload/
download bandwidth, and seed residence time. We also
provide quantitative results on the startup delays and
retrieval times for streaming media delivery. Our
results provide insights into the design tradeoffs for
on-demand media streaming in peer-to-peer networks.
Finally, the models are validated using simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2012:BRU,
author = "Lili Cao and Haitao Zheng",
title = "Balancing reliability and utilization in dynamic
spectrum access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "651--661",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165966",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Future wireless networks will dynamically access
spectrum to maximize its utilization. Conventional
design of dynamic spectrum access focuses on maximizing
spectrum utilization, but faces the problem of degraded
reliability due to unregulated demands and access
behaviors. Without providing proper reliability
guarantee, dynamic spectrum access is unacceptable to
many infrastructure networks and services. In this
paper, we propose SPARTA, a new architecture for
dynamic spectrum access that balances access
reliability and spectrum utilization. SPARTA includes
two complementary techniques: proactive admission
control performed by a central entity to determine the
set of wireless nodes to be supported with only
statistical information of their spectrum demands, and
online adaptation performed by admitted wireless nodes
to adjust their instantaneous spectrum usage to
time-varying demand. Using both theoretical analysis
and simulation, we show that SPARTA fulfills the
reliability requirements while dynamically multiplexing
spectrum demands to improve utilization. Compared to
conventional solutions, SPARTA improves spectrum
utilization by 80\%-200\%. Finally, SPARTA also allows
service providers to explore the tradeoff between
utilization and reliability to make the best use of the
spectrum. To our best knowledge, our work is the first
to identify and address such a tradeoff.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Roughan:2012:STC,
author = "Matthew Roughan and Yin Zhang and Walter Willinger and
Lili Qiu",
title = "Spatio-temporal compressive sensing and {Internet}
traffic matrices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "662--676",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2169424",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Despite advances in measurement technology, it is
still challenging to reliably compile large-scale
network datasets. For example, because of flaws in the
measurement systems or difficulties posed by the
measurement problem itself, missing, ambiguous, or
indirect data are common. In the case where such data
have spatio-temporal structure, it is natural to try to
leverage this structure to deal with the challenges
posed by the problematic nature of the data. Our work
involving network datasets draws on ideas from the area
of compressive sensing and matrix completion, where
sparsity is exploited in estimating quantities of
interest. However, the standard results on compressive
sensing are: (1) reliant on conditions that generally
do not hold for network datasets; and (2) do not allow
us to exploit all we know about their spatio-temporal
structure. In this paper, we overcome these limitations
with an algorithm that has at its heart the same ideas
espoused in compressive sensing, but adapted to the
problem of network datasets. We show how this algorithm
can be used in a variety of ways, in particular on
traffic data, to solve problems such as simple
interpolation of missing values, traffic matrix
inference from link data, prediction, and anomaly
detection. The elegance of the approach lies in the
fact that it unifies all of these tasks and allows them
to be performed even when as much as 98\% of the data
is missing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sobrinho:2012:TCD,
author = "Jo{\~a}o Lu{\'\i}s Sobrinho and Tiago Quelhas",
title = "A theory for the connectivity discovered by routing
protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "677--689",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165080",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Route-vector protocols, such as the Border Gateway
Protocol (BGP), have nodes elect and exchange routes in
order to discover paths over which to send traffic. We
ask the following: What is the minimum number of links
whose failure prevents a route-vector protocol from
finding such paths? The answer is not obvious because
routing policies prohibit some paths from carrying
traffic and because, on top of that, a route-vector
protocol may hide paths the routing policies would
allow. We develop an algebraic theory to address the
above and related questions. In particular, we
characterize a broad class of routing policies for
which we can compute in polynomial time the minimum
number of links whose failure leaves a route-vector
protocol without a communication path from one given
node to another. The theory is applied to a publicly
available description of the Internet topology to
quantify how much of its intrinsic connectivity is lost
due to the traditional customer-provider, peer-peer
routing policies and how much can be regained with
simple alternative policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2012:ESP,
author = "XiaoHua Xu and Xiang-Yang Li and Peng-Jun Wan and
ShaoJie Tang",
title = "Efficient scheduling for periodic aggregation queries
in multihop sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "690--698",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2166165",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study periodic query scheduling for
data aggregation with minimum delay under various
wireless interference models. Given a set $Q$ of
periodic aggregation queries, each query $ Q_i \epsilon
Q$ has its own period $ p_i$ and the subset of source
nodes Si containing the data. We first propose a family
of efficient and effective real-time scheduling
protocols that can answer every job of each query task
$ Q_i \epsilon Q$ within a relative delay $ O(p_i)$
under resource constraints by addressing the following
tightly coupled tasks: routing, transmission plan
constructions, node activity scheduling, and packet
scheduling. Based on our protocol design, we further
propose schedulability test schemes to efficiently and
effectively test whether, for a set of queries, each
query job can be finished within a finite delay. Our
theoretical analysis shows that our methods achieve at
least a constant fraction of the maximum possible total
utilization for query tasks, where the constant depends
on wireless interference models. We also conduct
extensive simulations to validate the proposed protocol
and evaluate its practical performance. The simulations
corroborate our theoretical analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bando:2012:SLR,
author = "Masanori Bando and N. Sertac Artan and H. Jonathan
Chao",
title = "Scalable lookahead regular expression detection system
for deep packet inspection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "699--714",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2181411",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Regular expressions (RegExes) are widely used, yet
their inherent complexity often limits the total number
of RegExes that can be detected using a single chip for
a reasonable throughput. This limit on the number of
RegExes impairs the scalability of today's RegEx
detection systems. The scalability of existing schemes
is generally limited by the traditional detection
paradigm based on per-character-state processing and
state transition detection. The main focus of existing
schemes is on optimizing the number of states and the
required transitions, but not on optimizing the
suboptimal character-based detection method.
Furthermore, the potential benefits of allowing
out-of-sequence detection, instead of detecting
components of a RegEx in the order of appearance, have
not been explored. Lastly, the existing schemes do not
provide ways to adapt to the evolving RegExes. In this
paper, we propose Lookahead Finite Automata (LaFA) to
perform scalable RegEx detection. LaFA requires less
memory due to these three contributions: (1) providing
specialized and optimized detection modules to increase
resource utilization; (2) systematically reordering the
RegEx detection sequence to reduce the number of
concurrent operations; (3) sharing states among
automata for different RegExes to reduce resource
requirements. Here, we demonstrate that LaFA requires
an order of magnitude less memory compared to today's
state-of-the-art RegEx detection systems. Using LaFA, a
single-commodity field programmable gate array (FPGA)
chip can accommodate up to 25 000 (25 k) RegExes. Based
on the throughput of our LaFA prototype on FPGA, we
estimate that a 34-Gb/s throughput can be achieved.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khanna:2012:ASV,
author = "Sanjeev Khanna and Santosh S. Venkatesh and Omid
Fatemieh and Fariba Khan and Carl A. Gunter",
title = "Adaptive selective verification: an efficient adaptive
countermeasure to thwart {DoS} attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "715--728",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2171057",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Denial-of-service (DoS) attacks are considered within
the province of a shared channel model in which attack
rates may be large but are bounded and client request
rates vary within fixed bounds. In this setting, it is
shown that clients can adapt effectively to an attack
by increasing their request rate based on timeout
windows to estimate attack rates. The server will be
able to process client requests with high probability
while pruning out most of the attack by selective
random sampling. The protocol introduced here, called
Adaptive Selective Verification (ASV), is shown to use
bandwidth efficiently and does not require any server
state or assumptions about network congestion. The main
results of the paper are a formulation of optimal
performance and a proof that ASV is optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pong:2012:CLT,
author = "Fong Pong and Nian-Feng Tzeng",
title = "Concise lookup tables for {IPv4} and {IPv6} longest
prefix matching in scalable routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "729--741",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2167158",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a distinct longest prefix matching (LPM)
lookup scheme able to achieve exceedingly concise
lookup tables (CoLT), suitable for scalable routers.
Based on unified hash tables for handling both IPv4 and
IPv6 simultaneously, CoLT excels over previous
mechanisms in: (1) lower on-chip storage for lookup
tables; (2) simpler table formats to enjoy richer
prefix aggregation and easier implementation; and (3)
most importantly, deemed the only design able to
accommodate both IPv4 and IPv6 addresses uniformly and
effectively. As its hash tables permit multiple
possible buckets to hold each prefix (following a
migration rule to avoid false positives altogether),
CoLT exhibits the best memory efficiency and can launch
parallel search over tables during every LPM lookup,
involving fewer cycles per lookup when on-chip memory
is used to implement hash tables. With 16 (or 32)
on-chip SRAM blocks clocked at 500 MHz (achievable in
today's 65-nm technology), it takes 2 (or 1.6) cycles
on average to complete a lookup, yielding 250 (or 310
+) millions of packets per second (MPPS) mean
throughput. Being hash-oriented, CoLT well supports
incremental table updates, besides its high table
utilization and lookup throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Laufer:2012:PTA,
author = "Rafael Laufer and Henri Dubois-Ferri{\`e}re and
Leonard Kleinrock",
title = "Polynomial-time algorithms for multirate anypath
routing in wireless multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "742--755",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165852",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a new routing paradigm that
generalizes opportunistic routing for wireless multihop
networks. In multirate anypath routing, each node uses
both a set of next-hops and a selected transmission
rate to reach a destination. Using this rate, a packet
is broadcast to the nodes in the set, and one of them
forwards the packet on to the destination. To date,
there is no theory capable of jointly optimizing both
the set of next-hops and the transmission rate used by
each node. We solve this by introducing two
polynomial-time routing algorithms and provide the
proof of their optimality. The proposed algorithms have
roughly the same running time as regular shortest-path
algorithms and are therefore suitable for deployment in
routing protocols. We conducted measurements in an
802.11b testbed network, and our trace-driven analysis
shows that multirate anypath routing is on average 80\%
better than 11-Mbps anypath routing, with a factor of
6.4 improvement in the best case. If the rate is fixed
at 1 Mbps instead, performance improves by a factor of
5.4 on average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leith:2012:MMF,
author = "Douglas J. Leith and Qizhi Cao and Vijay G.
Subramanian",
title = "Max-min fairness in 802.11 mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "756--769",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165850",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we establish that the rate region of a
large class of IEEE 802.11 mesh networks is log-convex,
immediately allowing standard utility fairness methods
to be generalized to this class of networks. This
creates a solid theoretical underpinning for fairness
analysis and resource allocation in this practically
important class of networks. For the special case of
max-min fairness, we use this new insight to obtain an
almost complete characterization of the fair rate
allocation and a remarkably simple, practically
implementable method for achieving max-min fairness in
802.11 mesh networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2012:DPB,
author = "Changbin Liu and Ricardo Correa and Xiaozhou Li and
Prithwish Basu and Boon Thau Loo and Yun Mao",
title = "Declarative policy-based adaptive mobile ad hoc
networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "770--783",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2165851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents DAWN, a declarative platform that
creates highly adaptive policy-based mobile ad hoc
network (MANET) protocols. DAWN leverages declarative
networking techniques to achieve extensible routing and
forwarding using declarative languages. We make the
following contributions. First, we demonstrate that
traditional MANET protocols can be expressed in a
concise fashion as declarative networks and
policy-driven adaptation can be specified in the same
language to dictate the dynamic selection of different
protocols based on various network and traffic
conditions. Second, we propose interprotocol forwarding
techniques that ensure packets are able to seamlessly
traverse across clusters of nodes running different
protocols selected based on their respective policies.
Third, we have developed a full-fledged implementation
of DAWN using the RapidNet declarative networking
system. We experimentally validate a variety of
policy-based adaptive MANETs in various dynamic
settings using a combination of ns-3 simulations and
deployment on the ORBIT testbed. Our experimental
results demonstrate that hybrid protocols developed
using DAWN outperform traditional MANET routing
protocols and are able to flexibly and dynamically
adapt their routing mechanisms to achieve a good
tradeoff between bandwidth utilization and route
quality. We further demonstrate DAWN's capabilities to
achieve interprotocol forwarding across different
protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Amaldi:2012:DWS,
author = "Edoardo Amaldi and Antonio Capone and Matteo Cesana
and Ilario Filippini",
title = "Design of wireless sensor networks for mobile target
detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "784--797",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175746",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider surveillance applications through wireless
sensor networks (WSNs) where the areas to be monitored
are fully accessible and the WSN topology can be
planned a priori to maximize application efficiency. We
propose an optimization framework for selecting the
positions of wireless sensors to detect mobile targets
traversing a given area. By leveraging the concept of
path exposure as a measure of detection quality, we
propose two problem versions: the minimization of the
sensors installation cost while guaranteeing a minimum
exposure, and the maximization of the exposure of the
least-exposed path subject to a budget on the sensors
installation cost. We present compact mixed-integer
linear programming formulations for these problems that
can be solved to optimality for reasonable-sized
network instances. Moreover, we develop Tabu Search
heuristics that are able to provide near-optimal
solutions of the same instances in short computing time
and also tackle large size instances. The basic
versions are extended to account for constraints on the
wireless connectivity as well as heterogeneous devices
and nonuniform sensing. Finally, we analyze an enhanced
exposure definition based on mobile target detection
probability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sebbah:2012:DQR,
author = "Samir Sebbah and Brigitte Jaumard",
title = "Differentiated quality-of-recovery in survivable
optical mesh networks using $p$-structures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "798--810",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2166560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates design methods of protection
schemes in survivable WDM networks that use
preconfigured protection structures (p-structures) in
order to provide different quality-of-recovery (QoR)
classes within 100\% resilient single-link protection
schemes. QoR differentiation is a practical and
effective approach in order to strike different
balances among protection cost, recovery delay, and
management complexity. Based on the degree of pre-cross
connectivity of the protection structures, we develop
three design approaches of shared protection capacity
schemes based on the following: (1) fully
pre-cross-connected p-structures (fp-structures); (2)
partially pre-cross-connected p-structures
(pp-structures); and (3) dynamically reconfigured
p-structures (dp-structures). In order to identify the
optimal combinations of protection structures to meet
the requirements of the three QoR classes, we use a
column generation (CG) model that we solve using
large-scale optimization techniques. Our CG
decomposition approach is based on the separation
processes of the design and selection of the protection
structures. In the design process of the protection
structures, the shape and protection capability of each
p-structure is decided dynamically during the selection
process depending on the network topology and the
targeted QoR parameters. Extensive experiments are
carried out on several data instances with different
design constraints in order to measure the protection
capacity cost and the recovery delay for the three QoR
classes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kompella:2012:RSF,
author = "Ramana Rao Kompella and Kirill Levchenko and Alex C.
Snoeren and George Varghese",
title = "Router support for fine-grained latency measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "811--824",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188905",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An increasing number of datacenter network
applications, including automated trading and
high-performance computing, have stringent end-to-end
latency requirements where even microsecond variations
may be intolerable. The resulting fine-grained
measurement demands cannot be met effectively by
existing technologies, such as SNMP, NetFlow, or active
probing. We propose instrumenting routers with a
hash-based primitive that we call a Lossy Difference
Aggregator (LDA) to measure latencies down to tens of
microseconds even in the presence of packet loss.
Because LDA does not modify or encapsulate the packet,
it can be deployed incrementally without changes along
the forwarding path. When compared to Poisson-spaced
active probing with similar overheads, our LDA
mechanism delivers orders of magnitude smaller relative
error; active probing requires 50-60 times as much
bandwidth to deliver similar levels of accuracy.
Although ubiquitous deployment is ultimately desired,
it may be hard to achieve in the shorter term; we
discuss a partial deployment architecture called mPlane
using LDAs for intrarouter measurements and localized
segment measurements for interrouter measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ni:2012:QCQ,
author = "Jian Ni and Bo Tan and R. Srikant",
title = "{Q-CSMA}: queue-length-based {CSMA\slash CA}
algorithms for achieving maximum throughput and low
delay in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "825--836",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2177101",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, it has been shown that carrier-sense
multiple access (CSMA)-type random access algorithms
can achieve the maximum possible throughput in ad hoc
wireless networks. However, these algorithms assume an
idealized continuous-time CSMA protocol where
collisions can never occur. In addition, simulation
results indicate that the delay performance of these
algorithms can be quite bad. On the other hand,
although some simple heuristics (such as greedy maximal
scheduling) can yield much better delay performance for
a large set of arrival rates, in general they may only
achieve a fraction of the capacity region. In this
paper, we propose a discrete-time version of the CSMA
algorithm. Central to our results is a discrete-time
distributed randomized algorithm that is based on a
generalization of the so-called Glauber dynamics from
statistical physics, where multiple links are allowed
to update their states in a single timeslot. The
algorithm generates collision-free transmission
schedules while explicitly taking collisions into
account during the control phase of the protocol, thus
relaxing the perfect CSMA assumption. More importantly,
the algorithm allows us to incorporate heuristics that
lead to very good delay performance while retaining the
throughput-optimality property.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2012:DRA,
author = "Wei Wang and Kang G. Shin and Wenbo Wang",
title = "Distributed resource allocation based on queue
balancing in multihop cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "837--850",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2167983",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio (CR) allows unlicensed users to access
the licensed spectrum opportunistically (i.e., when the
spectrum is left unused by the licensed users) to
enhance the spectrum utilization efficiency. In this
paper, the problem of allocating resources (channels
and transmission power) in multihop CR networks is
modeled as a multicommodity flow problem with the
dynamic link capacity resulting from dynamic resource
allocation, which is in sharp contrast with existing
flow-control approaches that assume fixed link
capacity. Based on queue-balancing network flow control
that is ideally suited for handling dynamically
changing spectrum availability in CR networks, we
propose a distributed scheme (installed and operational
in each node) for optimal resource allocation without
exchanging spectrum dynamics information between remote
nodes. Considering the power masks, each node makes
resource-allocation decisions based on current or past
local information from neighboring nodes to satisfy the
throughput requirement of each flow. Parameters of
these proposed schemes are configured to maintain the
network stability. The performance of the proposed
scheme for both asynchronous and synchronous scenarios
is analyzed comparatively. Both cases of sufficient and
insufficient network capacity are considered.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2012:RCC,
author = "Yi Zhu and Jason P. Jue",
title = "Reliable collective communications with weighted
{SRLGs} in optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "851--863",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2167157",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of reliable
collective communication (broadcast or gossip) with the
objective of maximizing the reliability of the
collective communication. The need for collective
communication arises in many problems of parallel and
distributed computing, including Grid or cloud
computing and database management. We describe the
network model, formulate the reliable collective
communication problem, prove that the maximum reliable
collective communication problem is NP-hard, and
provide an integer linear program (ILP) formulation for
the problem. We then provide a greedy approximation
algorithm to construct collective communication
(through a spanning tree) that achieves an
approximation ratio of $ 1 + \ln (|V| + \alpha |E| - 1)
$, where is the average number of shared link risk
groups (SRLGs) along links, and $ |V| $ and $ |E| $ are
the total number of vertices and edges of the network,
respectively. Simulations demonstrate that our
approximation algorithm achieves good performance in
both small and large networks and that, in almost 95\%
of total cases, our algorithm outperforms the modified
minimum spanning tree algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2012:GGR,
author = "Guang Tan and Anne-Marie Kermarrec",
title = "Greedy geographic routing in large-scale sensor
networks: a minimum network decomposition approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "864--877",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2167758",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In geographic (or geometric) routing, messages are by
default routed in a greedy manner: The current node
always forwards a message to its neighbor node that is
closest to the destination. Despite its simplicity and
general efficiency, this strategy alone does not
guarantee delivery due to the existence of local minima
(or dead ends). Overcoming local minima requires nodes
to maintain extra nonlocal state or to use auxiliary
mechanisms. We study how to facilitate greedy
forwarding by using a minimum amount of such nonlocal
states in topologically complex networks. Specifically,
we investigate the problem of decomposing a given
network into a minimum number of greedily routable
components (GRCs), where greedy routing is guaranteed
to work. We approach it by considering an approximate
version of the problem in a continuous domain, with a
central concept called the greedily routable region
(GRR). A full characterization of GRR is given
concerning its geometric properties and routing
capability. We then develop simple approximate
algorithms for the problem. These results lead to a
practical routing protocol that has a routing stretch
below 7 in a continuous domain, and close to 1 in
several realistic network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sorooshyari:2012:PCC,
author = "Siamak Sorooshyari and Chee Wei Tan and Mung Chiang",
title = "Power control for cognitive radio networks: axioms,
algorithms, and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "878--891",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2169986",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The deployment of cognitive radio networks enables
efficient spectrum sharing and opportunistic spectrum
access. It also presents new challenges to the
classical problem of interference management in
wireless networks. This paper develops an axiomatic
framework for power allocation in cognitive radio
networks based on four goals: QoS protection to primary
users, opportunism to secondary users, admissibility to
secondary users, and autonomous operation by individual
users. Two additional goals, licensing and versatility,
which are desirable rather than essential, are also
presented. A general class of Duo Priority Class Power
Control (DPCPC) policies that satisfy such goals is
introduced. Through theoretical analysis and
simulation, it is shown that a specific
interference-aware power-control algorithm reaches such
goals.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Venkitasubramaniam:2012:GTA,
author = "Parv Venkitasubramaniam and Lang Tong",
title = "A game-theoretic approach to anonymous networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "892--905",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2176511",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Anonymous wireless networking is studied when an
adversary monitors the transmission timing of an
unknown subset of the network nodes. For a desired
quality of service (QoS), as measured by network
throughput, the problem of maximizing anonymity is
investigated from a game-theoretic perspective.
Quantifying anonymity using conditional entropy of the
routes given the adversary's observation, the problem
of optimizing anonymity is posed as a two-player
zero-sum game between the network designer and the
adversary: The task of the adversary is to choose a
subset of nodes to monitor so that anonymity of routes
is minimum, whereas the task of the network designer is
to maximize anonymity by choosing a subset of nodes to
evade flow detection by generating independent
transmission schedules. In this two-player game, it is
shown that a unique saddle-point equilibrium exists for
a general category of finite networks. At the saddle
point, the strategy of the network designer is to
ensure that any subset of nodes monitored by the
adversary reveals an identical amount of information
about the routes. For a specific class of parallel
relay networks, the theory is applied to study the
optimal performance tradeoffs and equilibrium
strategies. In particular, when the nodes employ
transmitter-directed signaling, the tradeoff between
throughput and anonymity is characterized analytically
as a function of the network parameters and the
fraction of nodes monitored. The results are applied to
study the relationships between anonymity, the fraction
of monitored relays, and the fraction of hidden relays
in large networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gopalan:2012:IAL,
author = "Abishek Gopalan and Srinivasan Ramasubramanian",
title = "On identifying additive link metrics using linearly
independent cycles and paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "906--916",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2174648",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of identifying
constant additive link metrics using linearly
independent monitoring cycles and paths. A monitoring
cycle starts and ends at the same monitoring station,
while a monitoring path starts and ends at distinct
monitoring stations. We show that three-edge
connectivity is a necessary and sufficient condition to
identify link metrics using one monitoring station and
employing monitoring cycles. We develop a
polynomial-time algorithm to compute the set of
linearly independent cycles. For networks that are less
than three-edge-connected, we show how the minimum
number of monitors required and their placement may be
computed. For networks with symmetric directed links,
we show the relationship between the number of monitors
employed, the number of directed links for which metric
is known a priori, and the identifiability for the
remaining links. To the best of our knowledge, this is
the first work that derives the necessary and
sufficient conditions on the network topology for
identifying additive link metrics and develops a
polynomial-time algorithm to compute linearly
independent cycles and paths.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2012:MPH,
author = "Xinbing Wang and Luoyi Fu and Chenhui Hu",
title = "Multicast performance with hierarchical cooperation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "917--930",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2170584",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been shown in a previous version of this paper
that hierarchical cooperation achieves a linear
throughput scaling for unicast traffic, which is due to
the advantage of long-range concurrent transmissions
and the technique of distributed
multiple-input-multiple-output (MIMO). In this paper,
we investigate the scaling law for multicast traffic
with hierarchical cooperation, where each of the n
nodes communicates with k randomly chosen destination
nodes. Specifically, we propose a new class of
scheduling policies for multicast traffic. By utilizing
the hierarchical cooperative MIMO transmission, our new
policies can obtain an aggregate throughput of $ \Omega
((n / k)^{1 - \epsilon }) $ for any $ \epsilon \geq 0
$. This achieves a gain of nearly $ \sqrt {n} / k $
compared to the noncooperative scheme in Li et al.'s
work (Proc. ACM MobiCom, 2007, pp. 266-277). Among all
four cooperative strategies proposed in our paper, one
is superior in terms of the three performance metrics:
throughput, delay, and energy consumption. Two factors
contribute to the optimal performance: multihop MIMO
transmission and converge-based scheduling. Compared to
the single-hop MIMO transmission strategy, the multihop
strategy achieves a throughput gain of $ (n / k)^{h - 1
/ h (2 h - 1)} $ and meanwhile reduces the energy
consumption by $ k^{\alpha - 2 / 2} $ times
approximately, where $ h > 1 $ is the number of the
hierarchical layers, and $ \alpha \geq 2 $ is the
path-loss exponent. Moreover, to schedule the traffic
with the converge multicast instead of the pure
multicast strategy, we can dramatically reduce the
delay by a factor of about $ (n / k)^{h / 2} $. Our
optimal cooperative strategy achieves an approximate
delay-throughput tradeoff $ D(n, k) / T(n, k) = \Theta
(k) $ when $ h \to \infty $. This tradeoff ratio is
identical to that of noncooperative scheme, while the
throughput is greatly improved.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eriksson:2012:ENT,
author = "Brian Eriksson and Gautam Dasarathy and Paul Barford
and Robert Nowak",
title = "Efficient network tomography for {Internet} topology
discovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "931--943",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175747",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Accurate and timely identification of the router-level
topology of the Internet is one of the major unresolved
problems in Internet research. Topology recovery via
tomographic inference is potentially an attractive
complement to standard methods that use TTL-limited
probes. Unfortunately, limitations of prior tomographic
techniques make timely resolution of large-scale
topologies impossible due to the requirement of an
infeasible number of measurements. In this paper, we
describe new techniques that aim toward efficient
tomographic inference for accurate router-level
topology measurement. We introduce methodologies based
on Depth-First Search (DFS) ordering that clusters
end-hosts based on shared infrastructure and enables
the logical tree topology of a network to be recovered
accurately and efficiently. We evaluate the
capabilities of our algorithms in large-scale
simulation and find that our methods will reconstruct
topologies using less than 2\%of the measurements
required by exhaustive methods and less than 15\% of
the measurements needed by the current state-of-the-art
tomographic approach. We also present results from a
study of the live Internet where we show our DFS-based
methodologies can recover the logical router-level
topology more accurately and with fewer probes than
prior techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:EES,
author = "Dan Li and Yuanjie Li and Jianping Wu and Sen Su and
Jiangwei Yu",
title = "{ESM}: efficient and scalable data center multicast
routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "944--955",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2169985",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multicast benefits group communications in saving
network traffic and improving application throughput,
both of which are important for data center
applications. However, the technical trend of data
center design poses new challenges for efficient and
scalable multicast routing. First, the densely
connected networks make traditional receiver-driven
multicast routing protocols inefficient in multicast
tree formation. Second, it is quite difficult for the
low-end switches widely used in data centers to hold
the routing entries of massive multicast groups. In
this paper, we propose ESM, an efficient and scalable
multicast routing scheme for data center networks. ESM
addresses the challenges above by exploiting the
feature of modern data center networks. Based on the
regular topology of data centers, ESM uses a
source-to-receiver expansion approach to build
efficient multicast trees, excluding many unnecessary
intermediate switches used in receiver-driven multicast
routing. For scalable multicast routing, ESM combines
both in-packet Bloom Filters and in-switch entries to
make the tradeoff between the number of multicast
groups supported and the additional bandwidth overhead.
Simulations show that ESM saves 40\% --- 50\% network
traffic and doubles the application throughputs
compared to receiver-driven multicast routing, and the
combination routing scheme significantly reduces the
number of in-switch entries required. We implement ESM
on a Linux platform. The experimental results further
demonstrate that ESM can well support online tree
building for large-scale groups with churns, and the
overhead of the combination forwarding engine is
light-weighted.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2012:SWD,
author = "Zizhan Zheng and Prasun Sinha and Santosh Kumar",
title = "Sparse {WiFi} deployment for vehicular {Internet}
access with bounded interconnection gap",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "956--969",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2170218",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Vehicular Internet access via open WiFi access points
(APs) has been demonstrated to be a feasible solution
to provide opportunistic data service to moving
vehicles. Using an in situ deployment, however, such a
solution does not provide performance guarantees due to
unpredictable intermittent connectivity. On the other
hand, a solution that tries to cover every point in an
entire road network with APs (a full coverage) is not
very practical due to prohibitive deployment and
operational costs. In this paper, we introduce a new
notion of intermittent coverage for mobile users,
called Alpha Coverage, which provides worst-case
guarantees on the interconnection gap, i.e., the
distance or expected delay between two consecutive
mobile-AP contacts for a vehicle, while using
significantly fewer APs than needed for full coverage.
We propose efficient algorithms to verify whether a
given deployment provides Alpha Coverage. The problem
of finding an economic deployment that provides $
\alpha $-coverage turns out to be NP-hard. We hence
provide both approximation algorithms that have
provable guarantees on the performance as well as
efficient heuristics that perform well in practice. The
efficiency of our algorithms is demonstrated via
simulations using data from real-world road networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bremler-Barr:2012:AMM,
author = "Anat Bremler-Barr and Yaron Koral",
title = "Accelerating multipattern matching on compressed
{HTTP} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "3",
pages = "970--983",
month = jun,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2172456",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 11:13:33 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current security tools, using ``signature-based''
detection, do not handle compressed traffic, whose
market-share is constantly increasing. This paper
focuses on compressed HTTP traffic. HTTP uses GZIP
compression and requires some kind of decompression
phase before performing a string matching. We present a
novel algorithm, Aho--Corasick-based algorithm for
Compressed HTTP (ACCH), that takes advantage of
information gathered by the decompression phase in
order to accelerate the commonly used Aho--Corasick
pattern-matching algorithm. By analyzing real HTTP
traffic and real Web application firewall signatures,
we show that up to 84\% of the data can be skipped in
its scan. Surprisingly, we show that it is faster to
perform pattern matching on the compressed data, with
the penalty of decompression, than on regular traffic.
As far as we know, we are the first paper that analyzes
the problem of ``on-the-fly'' multipattern matching on
compressed HTTP traffic and suggest a solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basile:2012:NLA,
author = "Cataldo Basile and Alberto Cappadonia and Antonio
Lioy",
title = "Network-level access control policy analysis and
transformation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "985--998",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network-level access control policies are often
specified by various people (network, application, and
security administrators), and this may result in
conflicts or suboptimal policies. We have defined a new
formal model for policy representation that is
independent of the actual enforcement elements, along
with a procedure that allows the easy identification
and removal of inconsistencies and anomalies.
Additionally, the policy can be translated to the model
used by the target access control element to prepare it
for actual deployment. In particular, we show that
every policy can be translated into one that uses the
``First Matching Rule'' resolution strategy. Our policy
model and optimization procedure have been implemented
in a tool that experimentally demonstrates its
applicability to real-life cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Passos:2012:JAR,
author = "Diego Passos and Celio V. N. Albuquerque",
title = "A joint approach to routing metrics and rate
adaptation in wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "999--1009",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2170585",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents MARA, a joint mechanism for
automatic rate selection and route quality evaluation
in wireless mesh networks. This mechanism targets at
avoiding the problems of lack of synchronization
between metric and rate selection decisions and
inaccurate link quality estimates, common to main
existing proposals of multihop wireless routing metrics
and automatic rate adaptation. In this proposal, the
statistics collected by the routing protocol are used
by the rate adaptation algorithm to compute the best
rate for each wireless link. This coordinated decision
aims at providing better routing and rate choices. In
addition to the basic MARA algorithm, two variations
are proposed: MARA-P and MARA-RP. The first considers
the size of each packet in the transmission rate
decision. The second variation considers the packet
size also for the routing choices. For evaluation
purposes, experiments were conducted on both real and
simulated environments. In these experiments, MARA was
compared to a number of rate adaptation algorithms and
routing metrics. Results from both environments
indicate that MARA may lead to an overall network
performance improvement.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Trestian:2012:TMD,
author = "Ionut Trestian and Supranamaya Ranjan and Aleksandar
Kuzmanovic and Antonio Nucci",
title = "Taming the mobile data deluge with drop zones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1010--1023",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2172952",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Human communication has changed by the advent of
smartphones. Using commonplace mobile device features,
they started uploading large amounts of content that
increases. This increase in demand will overwhelm
capacity and limits the providers' ability to provide
the quality of service demanded by their users. In the
absence of technical solutions, cellular network
providers are considering changing billing plans to
address this. Our contributions are twofold. First, by
analyzing user content upload behavior, we find that
the user-generated content problem is a user behavioral
problem. Particularly, by analyzing user mobility and
data logs of 2 million users of one of the largest US
cellular providers, we find that: (1) users upload
content from a small number of locations; (2) because
such locations are different for users, we find that
the problem appears ubiquitous. However, we find that:
(3) there exists a significant lag between content
generation and uploading times, and (4) with respect to
users, it is always the same users to delay. Second, we
propose a cellular network architecture. Our approach
proposes capacity upgrades at a select number of
locations called Drop Zones. Although not particularly
popular for uploads originally, Drop Zones seamlessly
fall within the natural movement patterns of a large
number of users. They are therefore suited for
uploading larger quantities of content in a postponed
manner. We design infrastructure placement algorithms
and demonstrate that by upgrading infrastructure in
only 963 base stations across the entire US, it is
possible to deliver 50\% of content via Drop Zones.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sharma:2012:TPE,
author = "Vicky Sharma and Koushik Kar and K. K. Ramakrishnan
and Shivkumar Kalyanaraman",
title = "A transport protocol to exploit multipath diversity in
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1024--1039",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2181979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless networks (including wireless mesh networks)
provide opportunities for using multiple paths.
Multihoming of hosts, possibly using different
technologies and providers, also makes it attractive
for end-to-end transport connections to exploit
multiple paths. In this paper, we propose a multipath
transport protocol, based on a carefully crafted set of
enhancements to TCP, that effectively utilizes the
available bandwidth and diversity provided by
heterogeneous, lossy wireless paths. Our Multi-Path
LOss-Tolerant (MPLOT) transport protocol can be used to
obtain significant goodput gains in wireless networks,
subject to bursty, correlated losses with average loss
rates as high as 50\%. MPLOT is built around the
principle of separability of reliability and congestion
control functions in an end-to-end transport protocol.
Congestion control is performed separately on
individual paths, and the reliability mechanism works
over the aggregate set of paths available for an
end-to-end session. MPLOT distinguishes between
congestion and link losses through Explicit Congestion
Notification (ECN), and uses Forward Error Correction
(FEC) coding to recover from data losses. MPLOT uses a
dynamic packet mapping based on the current path
characteristics to choose a path for a packet. Use of
erasure codes and block-level recovery ensures that in
MPLOT the receiving transport entity can recover all
data as long as a necessary number of packets in the
block are received, irrespective of which packets are
lost. We present a theoretical analysis of the
different design choices of MPLOT and show that MPLOT
chooses its policies and parameters such that a
desirable tradeoff between goodput with data recovery
delay is attained. We evaluate MPLOT, through
simulations, under a variety of test scenarios and
demonstrate that it effectively exploits path diversity
in addition to efficiently aggregating path bandwidths
while remaining fair to a conventional TCP flow on each
path.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2012:DBS,
author = "Hao Wang and Haiquan Zhao and Bill Lin and Jun Xu",
title = "{DRAM}-based statistics counter array architecture
with performance guarantee",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1040--1053",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2171360",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of efficiently maintaining a large number
(say millions) of statistics counters that need to be
updated at very high speeds (e.g., 40 Gb/s) has
received considerable research attention in recent
years. This problem arises in a variety of router
management and data streaming applications where large
arrays of counters are used to track various network
statistics and implement various counting sketches. It
proves too costly to store such large counter arrays
entirely in SRAM, while DRAM is viewed as too slow for
providing wirespeed updates at such high line rates. In
particular, we propose a DRAM-based counter
architecture that can effectively maintain wirespeed
updates to large counter arrays. The proposed approach
is based on the observation that modern commodity DRAM
architectures, driven by aggressive performance
roadmaps for consumer applications, such as video
games, have advanced architecture features that can be
exploited to make a DRAM-based solution practical. In
particular, we propose a randomized DRAM architecture
that can harness the performance of modern commodity
DRAM offerings by interleaving counter updates to
multiple memory banks. The proposed architecture makes
use of a simple randomization scheme, a small cache,
and small request queues to statistically guarantee a
near-perfect load-balancing of counter updates to the
DRAM banks. The statistical guarantee of the proposed
randomized scheme is proven using a novel combination
of convex ordering and large deviation theory. Our
proposed counter scheme can support arbitrary
increments and decrements at wirespeed, and they can
support different number representations, including
both integer and floating point number
representations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2012:SFR,
author = "Yi Shi and Y. Thomas Hou",
title = "Some fundamental results on base station movement
problem for wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1054--1067",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2171990",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The benefits of using a mobile base station to prolong
sensor network lifetime have been well recognized.
However, due to the complexity of the problem
(time-dependent network topology and traffic routing),
theoretical performance limits and provably optimal
algorithms remain difficult to develop. This paper
fills this important gap by contributing some
theoretical results regarding the optimal movement of a
mobile base station. Our main result hinges upon two
key intermediate results. In the first result, we show
that a time-dependent joint base station movement and
flow routing problem can be transformed into a
location-dependent problem. In the second result, we
show that, for $ (1 - \epsilon) $ optimality, the
infinite possible locations for base station movement
can be reduced to a finite set of locations via several
constructive steps [i.e., discretization of energy cost
through a geometric sequence, division of a disk into a
finite number of subareas, and representation of each
subarea with a fictitious cost point (FCP)].
Subsequently, for each FCP, we can obtain the optimal
sojourn time for the base station (as well as the
corresponding location-dependent flow routing) via a
simple linear program. We prove that the proposed
solution can guarantee the achieved network lifetime is
at least $ (1 - \epsilon) $ of the maximum (unknown)
network lifetime, where $ \epsilon $ can be made
arbitrarily small depending on the required
precision.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kumar:2012:DME,
author = "Ashwini Kumar and Kang G. Shin",
title = "{DSASync}: managing end-to-end connections in dynamic
spectrum access wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1068--1081",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178264",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless LANs (WLANs) have been widely deployed as
edge access networks that provide the important service
of Internet access to wireless devices. Therefore,
performance of end-to-end connections to/from such
WLANs is of great importance. The advent of Dynamic
Spectrum Access (DSA) technology is expected to play a
key role in improving wireless communication. With DSA
capability, WLANs opportunistically access licensed
channels in order to improve spectrum-usage efficiency
and provide better network performance. In this paper,
we identify the key issues that impact end-to-end
connection performance when a DSA-enabled WLAN is
integrated with the wired cloud. We propose a new
network management framework, called DSASync, to
mitigate the identified performance issues. DSASync
achieves this objective by managing the connections at
the transport layer as a third-party supervisor and
targets both TCP streams and UDP flows. DSASync
requires no modifications to the network infrastructure
or the existing network stack and protocols while
ensuring transport protocol (TCP or UDP) semantics to
be obeyed. It mainly consists of a combination of
buffering and traffic-shaping algorithms to minimize
the adverse side-effects of DSA on active connections.
DSASync is evaluated using a prototype implementation
and deployment in a testbed. The results show
significant improvement in end-to-end connection
performance, with substantial gains on QoS metrics like
goodput, delay, and jitter. Thus, DSASync is a
promising step toward applying DSA technology in
consumer WLANs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eswaran:2012:CTU,
author = "Sharanya Eswaran and Archan Misra and Thomas F. {La
Porta}",
title = "Control-theoretic utility maximization in multihop
wireless networks under mission dynamics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1082--1095",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2176510",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Both bandwidth and energy become important resource
constraints when multihop wireless networks are used to
transport high-data-rate traffic for a moderately long
duration. In such networks, it is important to control
the traffic rates to not only conform to the link
capacity bounds, but also to ensure that the energy of
battery-powered forwarding nodes is utilized
judiciously to avoid premature exhaustion (i.e., the
network lasts as long as the applications require data
from the sources) without being unnecessarily
conservative (i.e., ensuring that the applications
derive the maximum utility possible). Unlike prior work
that focuses on the instantaneous distributed
optimization of such networks, we consider the more
challenging question of how such optimal usage of both
link capacity and node energy may be achieved over a
time horizon. Our key contributions are twofold. We
first show how the formalism of optimal control may be
used to derive optimal resource usage strategies over a
time horizon, under a variety of both deterministic and
statistically uncertain variations in various
parameters, such as the duration for which individual
applications are active or the time-varying recharge
characteristics of renewable energy sources (e.g.,
solar cell batteries). In parallel, we also demonstrate
that these optimal adaptations can be embedded, with
acceptably low signaling overhead, into a distributed,
utility-based rate adaptation protocol. Simulation
studies, based on a combination of synthetic and real
data traces, validate the close-to-optimal performance
characteristics of these practically realizable
protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jagannathan:2012:QLA,
author = "Krishna Jagannathan and Mihalis Markakis and Eytan
Modiano and John N. Tsitsiklis",
title = "Queue-length asymptotics for generalized max-weight
scheduling in the presence of heavy-tailed traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1096--1111",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2173553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the asymptotic behavior of the
steady-state queue-length distribution under
generalized max-weight scheduling in the presence of
heavy-tailed traffic. We consider a system consisting
of two parallel queues, served by a single server. One
of the queues receives heavy-tailed traffic, and the
other receives light-tailed traffic. We study the class
of throughput-optimal max-weight-$ \alpha $ scheduling
policies and derive an exact asymptotic
characterization of the steady-state queue-length
distributions. In particular, we show that the tail of
the light queue distribution is at least as heavy as a
power-law curve, whose tail coefficient we obtain
explicitly. Our asymptotic characterization also shows
that the celebrated max-weight scheduling policy leads
to the worst possible tail coefficient of the light
queue distribution, among all nonidling policies.
Motivated by the above negative result regarding the
max-weight-$ \alpha $ policy, we analyze a
log-max-weight (LMW) scheduling policy. We show that
the LMWpolicy guarantees an exponentially decaying
light queue tail while still being
throughput-optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:ETB,
author = "Bin Li and Atilla Eryilmaz",
title = "Exploring the throughput boundaries of randomized
schedulers in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1112--1124",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2172953",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Randomization is a powerful and pervasive strategy for
developing efficient and practical transmission
scheduling algorithms in interference-limited wireless
networks. Yet, despite the presence of a variety of
earlier works on the design and analysis of particular
randomized schedulers, there does not exist an
extensive study of the limitations of randomization on
the efficient scheduling in wireless networks. In this
paper, we aim to fill this gap by proposing a common
modeling framework and three functional forms of
randomized schedulers that utilize queue-length
information to probabilistically schedule
nonconflicting transmissions. This framework not only
models many existing schedulers operating under a
timescale separation assumption as special cases, but
it also contains a much wider class of potential
schedulers that have not been analyzed. We identify
some sufficient and some necessary conditions on the
network topology and on the functional forms used in
the randomization for throughput optimality. Our
analysis reveals an exponential and a subexponential
class of functions that exhibit differences in the
throughput optimality. Also, we observe the
significance of the network's scheduling diversity for
throughput optimality as measured by the number of
maximal schedules each link belongs to. We further
validate our theoretical results through numerical
studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bampas:2012:NMW,
author = "Evangelos Bampas and Aris Pagourtzis and George
Pierrakos and Katerina Potika",
title = "On a noncooperative model for wavelength assignment in
multifiber optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1125--1137",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2173948",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose and investigate SELFISH PATH MULTICOLORING
games as a natural model for noncooperative wavelength
assignment in multifiber optical networks. In this
setting, we view the wavelength assignment process as a
strategic game in which each communication request
selfishly chooses a wavelength in an effort to minimize
the maximum congestion that it encounters on the chosen
wavelength. We measure the cost of a certain wavelength
assignment as the maximum, among all physical links,
number of parallel fibers employed by this assignment.
We start by settling questions related to the existence
and computation of and convergence to pure Nash
equilibria in these games. Our main contribution is a
thorough analysis of the price of anarchy of such
games, that is, the worst-case ratio between the cost
of a Nash equilibrium and the optimal cost. We first
provide upper bounds on the price of anarchy for games
defined on general network topologies. Along the way,
we obtain an upper bound of 2 for games defined on star
networks. We next show that our bounds are tight even
in the case of tree networks of maximum degree 3,
leading to nonconstant price of anarchy for such
topologies. In contrast, for network topologies of
maximum degree 2, the quality of the solutions obtained
by selfish wavelength assignment is much more
satisfactory: We prove that the price of anarchy is
bounded by 4 for a large class of practically
interesting games defined on ring networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ryu:2012:TDR,
author = "Jung Ryu and Lei Ying and Sanjay Shakkottai",
title = "Timescale decoupled routing and rate control in
intermittently connected networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1138--1151",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2182360",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study an intermittently connected network (ICN)
composed of multiple clusters of wireless nodes. Within
each cluster, nodes can communicate directly using the
wireless links. However, these clusters are far away
from each other such that direct communication between
the clusters is impossible except through ``mobile''
contact nodes. These mobile contact nodes are data
carriers that shuffle between clusters and transport
data from the source to the destination clusters. There
are several applications of our network model, such as
clusters of mobile soldiers connected via unmanned
aerial vehicles. Our work here focuses on a queue-based
cross-layer technique known as the back-pressure
algorithm. The algorithm is known to be
throughput-optimal, as well as resilient to disruptions
in the network, making it an ideal candidate
communication protocol for our intermittently connected
network. In this paper, we design a back-pressure
routing/rate control algorithm for ICNs. Though it is
throughput-optimal, the back-pressure algorithm has
several drawbacks when used in ICNs, including long
end-to-end delays, large number of potential queues
needed, and loss in throughput due to intermittency. We
present a modified back-pressure algorithm that
addresses these issues. We implement our algorithm on a
16-node experimental testbed and present our
experimental results in this paper.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keung:2012:IDM,
author = "Gabriel Y. Keung and Bo Li and Qian Zhang",
title = "The intrusion detection in mobile sensor network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1152--1161",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186151",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Intrusion detection is an important problem in sensor
networks. Prior works in static sensor environments
show that constructing sensor barriers with random
sensor deployment can be effective for intrusion
detection. In response to the recent surge of interest
in mobile sensor applications, this paper studies the
intrusion detection problem in a mobile sensor network,
where it is believed that mobile sensors can improve
barrier coverage. Specifically, we focus on providing
$k$-barrier coverage against moving intruders. This
problem becomes particularly challenging given that the
trajectories of sensors and intruders need to be
captured. We first demonstrate that this problem is
similar to the classical kinetic theory of gas
molecules in physics. We then derive the inherent
relationship between barrier coverage performance and a
set of crucial system parameters including sensor
density, sensing range, and sensor and intruder
mobility. We examine the correlations and sensitivity
from the system parameters, and we derive the minimum
number of mobile sensors that needs to be deployed in
order to maintain the $k$-barrier coverage for a mobile
sensor network. Finally, we show that the coverage
performance can be improved by an order of magnitude
with the same number of sensors when compared to that
of the static sensor environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pujol:2012:LEC,
author = "Josep M. Pujol and Vijay Erramilli and Georgos Siganos
and Xiaoyuan Yang and Nikolaos Laoutaris and Parminder
Chhabra and Pablo Rodriguez",
title = "The little engine(s) that could: scaling online social
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1162--1175",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The difficulty of partitioning social graphs has
introduced new system design challenges for scaling of
online social networks (OSNs). Vertical scaling by
resorting to full replication can be a costly
proposition. Scaling horizontally by partitioning and
distributing data among multiple servers using, for
e.g., distributed hash tables (DHTs), can suffer from
expensive interserver communication. Such challenges
have often caused costly rearchitecting efforts for
popular OSNs like Twitter and Facebook. We design,
implement, and evaluate SPAR, a Social Partitioning and
Replication middleware that mediates transparently
between the application and the database layer of an
OSN. SPAR leverages the underlying social graph
structure in order to minimize the required replication
overhead for ensuring that users have their neighbors'
data colocated in the same machine. The gains from this
are multifold: Application developers can assume local
semantics, i.e., develop as they would for a single
machine; scalability is achieved by adding commodity
machines with low memory and network I/O requirements;
and N+K redundancy is achieved at a fraction of the
cost. We provide a complete system design, extensive
evaluation based on datasets from Twitter, Orkut, and
Facebook, and a working implementation. We show that
SPAR incurs minimum overhead, can help a well-known
Twitter clone reach Twitter's scale without changing a
line of its application logic, and achieves higher
throughput than Cassandra, a popular key-value store
database.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lehrieder:2012:CBL,
author = "Frank Lehrieder and Gy{\"o}rgy D{\'a}n and Tobias
Ho{\ss}feld and Simon Oechsner and Vlad Singeorzan",
title = "Caching for {BitTorrent}-like {P2P} systems: a simple
fluid model and its implications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1176--1189",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175246",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer file-sharing systems are responsible for
a significant share of the traffic between Internet
service providers (ISPs) in the Internet. In order to
decrease their peer-to-peer-related transit traffic
costs, many ISPs have deployed caches for peer-to-peer
traffic in recent years. We consider how the different
types of peer-to-peer caches--caches already available
on the market and caches expected to become available
in the future--can possibly affect the amount of
inter-ISP traffic. We develop a fluid model that
captures the effects of the caches on the system
dynamics of peer-to-peer networks and show that caches
can have adverse effects on the system dynamics
depending on the system parameters. We combine the
fluid model with a simple model of inter-ISP traffic
and show that the impact of caches cannot be accurately
assessed without considering the effects of the caches
on the system dynamics. We identify scenarios when
caching actually leads to increased transit traffic.
Motivated by our findings, we propose a proximity-aware
peer-selection mechanism that avoids the increase of
the transit traffic and improves the cache efficiency.
We support the analytical results by extensive
simulations and experiments with real BitTorrent
clients.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2012:DIP,
author = "Hongbo Jiang and Arun Iyengar and Erich Nahum and
Wolfgang Segmuller and Asser N. Tantawi and Charles P.
Wright",
title = "Design, implementation, and performance of a load
balancer for {SIP} server clusters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1190--1202",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2183612",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces several novel load-balancing
algorithms for distributing Session Initiation Protocol
(SIP) requests to a cluster of SIP servers. Our load
balancer improves both throughput and response time
versus a single node while exposing a single interface
to external clients. We present the design,
implementation, and evaluation of our system using a
cluster of Intel x86 machines running Linux. We compare
our algorithms to several well-known approaches and
present scalability results for up to 10 nodes. Our
best algorithm, Transaction Least-Work-Left (TLWL),
achieves its performance by integrating several
features: knowledge of the SIP protocol, dynamic
estimates of back-end server load, distinguishing
transactions from calls, recognizing variability in
call length, and exploiting differences in processing
costs for different SIP transactions. By combining
these features, our algorithm provides finer-grained
load balancing than standard approaches, resulting in
throughput improvements of up to 24\% and response-time
improvements of up to two orders of magnitude. We
present a detailed analysis of occupancy to show how
our algorithms significantly reduce response time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jindal:2012:NCW,
author = "Apoorva Jindal and Mingyan Liu",
title = "Networked computing in wireless sensor networks for
structural health monitoring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1203--1216",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175450",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of distributed
computation over a network of wireless sensors. While
this problem applies to many emerging applications, to
keep our discussion concrete, we will focus on sensor
networks used for structural health monitoring. Within
this context, the heaviest computation is to determine
the singular value decomposition (SVD) to extract mode
shapes (eigenvectors) of a structure. Compared to
collecting raw vibration data and performing SVD at a
central location, computing SVD within the network can
result in significantly lower energy consumption and
delay. Using recent results on decomposing SVD, a
well-known centralized operation, we seek to determine
a near-optimal communication structure that enables the
distribution of this computation and the reassembly of
the final results, with the objective of minimizing
energy consumption subject to a computational delay
constraint. We show that this reduces to a generalized
clustering problem and establish that it is NP-hard. By
relaxing the delay constraint, we derive a lower bound.
We then propose an integer linear program (ILP) to
solve the constrained problem exactly as well as an
approximate algorithm with a proven approximation
ratio. We further present a distributed version of the
approximate algorithm. We present both simulation and
experimentation results to demonstrate the
effectiveness of these algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2012:ITS,
author = "Charles Shen and Erich Nahum and Henning Schulzrinne
and Charles P. Wright",
title = "The impact of {TLS} on {SIP} server performance:
measurement and modeling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1217--1230",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2180922",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Securing Voice over IP (VoIP) is a crucial requirement
for its successful adoption. A key component of this is
securing the signaling path, which is performed by the
Session Initiation Protocol (SIP). Securing SIP can be
accomplished by using Transport Layer Security (TLS)
instead of UDP as the transport protocol. However,
using TLS for SIP is not yet widespread, perhaps due to
concerns about the performance overhead. This paper
studies the performance impact of using TLS as a
transport protocol for SIP servers. We evaluate the
cost of TLS experimentally using a testbed with
OpenSIPS, OpenSSL, and Linux running on an Intel-based
server. We analyze TLS costs using application,
library, and kernel profiling and use the profiles to
illustrate when and how different costs are incurred.
We show that using TLS can reduce performance by up to
a factor of 17 compared to the typical case of
SIP-over-UDP. The primary factor in determining
performance is whether and how TLS connection
establishment is performed due to the heavy costs of
RSA operations used for session negotiation. This
depends both on how the SIP proxy is deployed and what
TLS operation modes are used. The cost of symmetric key
operations such as AES, in contrast, tends to be small.
Network operators deploying SIP-over-TLS should attempt
to maximize the persistence of secure connections and
will need to assess the server resources required. To
aid them, we provide a measurement-driven cost model
for use in provisioning SIP servers using TLS. Our cost
model predicts performance within 15\% on average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Medina:2012:GRS,
author = "Daniel Medina and Felix Hoffmann and Francesco
Rossetto and Carl-Herbert Rokitansky",
title = "A geographic routing strategy for {North Atlantic}
in-flight {Internet} access via airborne mesh
networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1231--1244",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2175487",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Airborne Internet is a vision of a large-scale
multihop wireless mesh network consisting of commercial
passenger aircraft connected via long-range highly
directional air-to-air radio links. We propose a
geographic load sharing strategy to fully exploit the
total air-to-ground capacity available at any given
time. When forwarding packets for a given destination,
a node considers not one but a set of next-hop
candidates and spreads traffic among them based on
queue dynamics. In addition, load balancing is
performed among Internet Gateways by using a
congestion-aware handover strategy. Our simulations
using realistic North Atlantic air traffic demonstrate
the ability of such a load sharing mechanism to
approach the maximum theoretical throughput in the
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ling:2012:NCC,
author = "Zhen Ling and Junzhou Luo and Wei Yu and Xinwen Fu and
Dong Xuan and Weijia Jia",
title = "A new cell-counting-based attack against {Tor}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1245--1261",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178036",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Various low-latency anonymous communication systems
such as Tor and Anonymizer have been designed to
provide anonymity service for users. In order to hide
the communication of users, most of the anonymity
systems pack the application data into equal-sized
cells (e.g., 512 B for Tor, a known real-world,
circuit-based, low-latency anonymous communication
network). Via extensive experiments on Tor, we found
that the size of IP packets in the Tor network can be
very dynamic because a cell is an application concept
and the IP layer may repack cells. Based on this
finding, we investigate a new cell-counting-based
attack against Tor, which allows the attacker to
confirm anonymous communication relationship among
users very quickly. In this attack, by marginally
varying the number of cells in the target traffic at
the malicious exit onion router, the attacker can embed
a secret signal into the variation of cell counter of
the target traffic. The embedded signal will be carried
along with the target traffic and arrive at the
malicious entry onion router. Then, an accomplice of
the attacker at the malicious entry onion router will
detect the embedded signal based on the received cells
and confirm the communication relationship among users.
We have implemented this attack against Tor, and our
experimental data validate its feasibility and
effectiveness. There are several unique features of
this attack. First, this attack is highly efficient and
can confirm very short communication sessions with only
tens of cells. Second, this attack is effective, and
its detection rate approaches 100\% with a very low
false positive rate. Third, it is possible to implement
the attack in a way that appears to be very difficult
for honest participants to detect (e.g., using our
hopping-based signal embedding).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bando:2012:FBG,
author = "Masanori Bando and Yi-Li Lin and H. Jonathan Chao",
title = "{FlashTrie}: beyond {100-Gb/s} {IP} route lookup using
hash-based prefix-compressed trie",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1262--1275",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is becoming apparent that the next-generation IP
route lookup architecture needs to achieve speeds of
100 Gb/s and beyond while supporting IPv4 and IPv6 with
fast real-time updates to accommodate ever-growing
routing tables. Some of the proposed
multibit-trie-based schemes, such as TreeBitmap, have
been used in today's high-end routers. However, their
large data structures often require multiple external
memory accesses for each route lookup. A pipelining
technique is widely used to achieve high-speed lookup
with the cost of using many external memory chips.
Pipelining also often leads to poor memory
load-balancing. In this paper, we propose a new IP
route lookup architecture called FlashTrie that
overcomes the shortcomings of the multibit-trie-based
approaches. We use a hash-based membership query to
limit off-chip memory accesses per lookup and to
balance memory utilization among the memory modules. By
compacting the data structure size, the lookup depth of
each level can be increased. We also develop a new data
structure called Prefix-Compressed Trie that reduces
the size of a bitmap by more than 80\%. Our simulation
and implementation results show that FlashTrie can
achieve 80-Gb/s worst-case throughput while
simultaneously supporting 2 M prefixes for IPv4 and 318
k prefixes for IPv6 with one lookup engine and two
Double-Data-Rate (DDR3) SDRAM chips. When implementing
five lookup engines on a state-of-the-art field
programmable gate array (FPGA) chip and using 10 DDR3
memory chips, we expect FlashTrie to achieve 1-Gpps
(packet per second) throughput, equivalent to 400 Gb/s
for IPv4 and 600 Gb/s for IPv6. FlashTrie also supports
incremental real-time updates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kai:2012:ABP,
author = "Cai Hong Kai and Soung Chang Liew",
title = "Applications of belief propagation in {CSMA} wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1276--1289",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2177994",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "``Belief propagation'' (BP) is an efficient way to
solve ``inference'' problems in graphical models, such
as Bayesian networks and Markov random fields. It has
found great success in many application areas due to
its simplicity, high accuracy, and distributed nature.
This paper is a first attempt to apply BP algorithms in
CSMA wireless networks. Compared to prior CSMA
optimization algorithms such as ACSMA, which are
measurement-based, BP-based algorithms are proactive
and computational, without the need for network probing
and traffic measurement. Consequently, BP-based
algorithms are not affected by the temporal throughput
fluctuations and can converge faster. Specifically,
this paper explores three applications of BP. (1) We
show how BP can be used to compute the throughputs of
different links in the network given their access
intensities, defined as the mean packet transmission
time divided by the mean backoff countdown time. (2) We
propose an inverse-BP algorithm to solve the reverse
problem of how to set the access intensities of
different links to meet their target throughputs. (3)
We introduce a BP-adaptive CSMA algorithm to find the
link access intensities that can achieve optimal system
utility. The first two applications are NP-hard
problems, and BP provides good approximations to them.
The advantage of BP is that it can converge faster
compared to prior algorithms like ACSMA, especially in
CSMA networks with temporal throughput fluctuations.
Furthermore, this paper goes beyond BP and considers a
generalized version of it, GBP, to improve accuracy in
networks with a loopy contention graph. The distributed
implementation of GBP is nontrivial to construct. A
contribution of this paper is to show that a ``maximal
clique'' method of forming regions in GBP: (1) yields
accurate results; and (2) is amenable to distributed
implementation in CSMA networks, with messages passed
between one-hop neighbors only. We show that both BP
and GBP algorithms for all three applications can yield
solutions within seconds in real operation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Miao:2012:CAD,
author = "Guowang Miao and Ye Li and Ananthram Swami",
title = "Channel-aware distributed medium access control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1290--1303",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2177473",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we solve a fundamental problem: how to
use distributed random access to achieve the
performance of centralized schedulers. We consider
wireless networks with arbitrary topologies and spatial
traffic distributions, where users can receive traffic
from or send traffic to different users and different
communication links may interfere with each other. The
channels are assumed heterogeneous, and the random
channel gains of different links may have different
distributions. To resolve the network contention in a
distributed way, each frame is divided into contention
and transmission periods. The contention period is used
to resolve conflicts, while the transmission period is
used to send payload in collision-free scenarios. We
design a multistage channel-aware Aloha scheme for the
contention period to enable users with relatively
better channel states to have higher probabilities of
contention success while assuring fairness among all
users. We show analytically that the proposed scheme
completely resolves network contention and achieves
throughput close to that of centralized schedulers.
Furthermore, the proposed scheme is robust to any
uncertainty in channel estimation. Simulation results
demonstrate that it significantly improves network
performance while maintaining fairness among different
users. The proposed random access approach can be
applied to different wireless networks, such as
cellular, sensor, and mobile ad hoc networks, to
improve quality of service.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:CBT,
author = "Pan Li and Miao Pan and Yuguang Fang",
title = "Capacity bounds of three-dimensional wireless ad hoc
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1304--1315",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network capacity investigation has been intensive in
the past few years. A large body of work on wireless
network capacity has appeared in the literature.
However, so far most of the effort has been made on
two-dimensional (2-D) wireless networks only. With the
great development of wireless technologies, wireless
networks are envisioned to extend from 2-D space to
three-dimensional (3-D) space. In this paper, we
investigate the throughput capacity of 3-D regular ad
hoc networks (RANETs) and of 3-D nonhomogeneous ad hoc
networks (NANETs), respectively, by employing a
generalized physical model. In 3-D RANETs, we assume
that the nodes are regularly placed, while in 3-D
NANETs, we consider that the nodes are distributed
according to a general Nonhomogeneous Poisson Process
(NPP). We find both lower and upper bounds in both
types of networks in a broad power propagation regime,
i.e., when the path loss exponent is no less than 2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Le:2012:OCW,
author = "Long Bao Le and Eytan Modiano and Ness B. Shroff",
title = "Optimal control of wireless networks with finite
buffers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1316--1329",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2176140",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers network control for wireless
networks with finite buffers. We investigate the
performance of joint flow control, routing, and
scheduling algorithms that achieve high network utility
and deterministically bounded backlogs inside the
network. Our algorithms guarantee that buffers inside
the network never overflow. We study the tradeoff
between buffer size and network utility and show that
under the one-hop interference model, if internal
buffers have size, $ (N - 1) / 2 \epsilon $ then $
\epsilon $-optimal network utility can be achieved,
where $ \epsilon $ is a control parameter $N$ and is
the number of network nodes. The underlying
scheduling/routing component of the considered control
algorithms requires ingress queue length information
(IQI) at all network nodes. However, we show that these
algorithms can achieve the same utility performance
with delayed ingress queue length information at the
cost of a larger average backlog bound. We also show
how to extend the results to other interference models
and to wireless networks with time-varying link
quality. Numerical results reveal that the considered
algorithms achieve nearly optimal network utility with
a significant reduction in queue backlog compared to
existing algorithms in the literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kokku:2012:NSV,
author = "Ravi Kokku and Rajesh Mahindra and Honghai Zhang and
Sampath Rangarajan",
title = "{NVS}: a substrate for virtualizing wireless resources
in cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1333--1346",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2179063",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper describes the design and implementation of
a network virtualization substrate (NVS) for effective
virtualization of wireless resources in cellular
networks. Virtualization fosters the realization of
several interesting deployment scenarios such as
customized virtual networks, virtual services, and
wide-area corporate networks, with diverse performance
objectives. In virtualizing a base station's uplink and
downlink resources into slices, NVS meets three key
requirements --- isolation, customization, and
efficient resource utilization --- using two novel
features: (1) NVS introduces a provably optimal slice
scheduler that allows existence of slices with
bandwidth-based and resource-based reservations
simultaneously; and (2) NVS includes a generic
framework for efficiently enabling customized flow
scheduling within the base station on a per-slice
basis. Through a prototype implementation and detailed
evaluation on a WiMAX testbed, we demonstrate the
efficacy of NVS. For instance, we show for both
downlink and uplink directions that NVS can run
different flow schedulers in different slices, run
different slices simultaneously with different types of
reservations, and perform slice-specific application
optimizations for providing customized services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khouzani:2012:MDM,
author = "M. H. R. Khouzani and Saswati Sarkar and Eitan
Altman",
title = "Maximum damage malware attack in mobile wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1347--1360",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2183642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Malware attacks constitute a serious security risk
that threatens to slow down the large-scale
proliferation of wireless applications. As a first step
toward thwarting this security threat, we seek to
quantify the maximum damage inflicted on the system due
to such outbreaks and identify the most vicious
attacks. We represent the propagation of malware in a
battery-constrained mobile wireless network by an
epidemic model in which the worm can dynamically
control the rate at which it kills the infected node
and also the transmission ranges and/or the media
scanning rates. At each moment of time, the worm at
each node faces the following tradeoffs: (1) using
larger transmission ranges and media scanning rates to
accelerate its spread at the cost of exhausting the
battery and thereby reducing the overall infection
propagation rate in the long run; or (2) killing the
node to inflict a large cost on the network, however at
the expense of losing the chance of infecting more
susceptible nodes at later times. We mathematically
formulate the decision problems and utilize Pontryagin
Maximum Principle from optimal control theory to
quantify the damage that the malware can inflict on the
network by deploying optimum decision rules. Next, we
establish structural properties of the optimal strategy
of the attacker over time. Specifically, we prove that
it is optimal for the attacker to defer killing of the
infective nodes in the propagation phase until reaching
a certain time and then start the slaughter with
maximum effort. We also show that in the optimal attack
policy, the battery resources are used according to a
decreasing function of time, i.e., most aggressively
during the initial phase of the outbreak. Finally, our
numerical investigations reveal a framework for
identifying intelligent defense strategies that can
limit the damage by appropriately selecting network
parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sherman:2012:FDB,
author = "Alex Sherman and Jason Nieh and Clifford Stein",
title = "{FairTorrent}: a deficit-based distributed algorithm
to ensure fairness in peer-to-peer systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1361--1374",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2185058",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer file-sharing applications suffer from a
fundamental problem of unfairness. Free-riders cause
slower download times for others by contributing little
or no upload bandwidth while consuming much download
bandwidth. Previous attempts to address this fair
bandwidth allocation problem suffer from slow peer
discovery, inaccurate predictions of neighboring peers'
bandwidth allocations, underutilization of bandwidth,
and complex parameter tuning. We present FairTorrent, a
new deficit-based distributed algorithm that accurately
rewards peers in accordance with their contribution. A
FairTorrent peer simply uploads the next data block to
a peer to whom it owes the most data as measured by a
deficit counter. FairTorrent is resilient to
exploitation by free-riders and strategic peers, is
simple to implement, requires no bandwidth
overallocation, no prediction of peers' rates, no
centralized control, and no parameter tuning. We
implemented FairTorrent in a BitTorrent client without
modifications to the BitTorrent protocol and evaluated
its performance against other widely used BitTorrent
clients. Our results show that FairTorrent provides up
to two orders of magnitude better fairness, up to five
times better download times for contributing peers, and
60\%-100\% better performance on average in live
BitTorrent swarms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koutsonikolas:2012:PHT,
author = "Dimitrios Koutsonikolas and Y. Charlie Hu and
Chih-Chun Wang",
title = "Pacifier: high-throughput, reliable multicast without
{``Crying} babies'' in wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1375--1388",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2177274",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In contrast to unicast routing, high-throughput
reliable multicast routing in wireless mesh networks
(WMNs) has received little attention. There are two
primary challenges to supporting high-throughput,
reliable multicast in WMNs. The first is no different
from unicast: Wireless links are inherently lossy due
to varying channel conditions and interference. The
second, known as the ``crying baby'' problem, is unique
to multicast: The multicast source may have varying
throughput to different multicast receivers, and hence
trying to satisfy the reliability requirement for
poorly connected receivers can potentially result in
performance degradation for the rest of the receivers.
In this paper, we propose Pacifier, a new
high-throughput, reliable multicast protocol for WMNs.
Pacifier seamlessly integrates four building blocks ---
namely, tree-based opportunistic routing, intraflow
network coding, source rate limiting, and round-robin
batching --- to support high-throughput, reliable
multicast routing in WMNs, while at the same time it
effectively addresses the ``crying baby'' problem. Our
experiments on a 22-node IEEE 802.11 WMN testbed show
that Pacifier increases the average throughput over a
state-of-the-art reliable network coding-based protocol
MORE by up to 144\%, while at the same time it solves
the ``crying baby'' problem by improving the throughput
of well-connected receivers by up to a factor of 14.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2012:BAN,
author = "Wei Chen and Khaled B. Letaief and Zhigang Cao",
title = "Buffer-aware network coding for wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1389--1401",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2176958",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding, which can combine various traffic
flows or packets via algebraic operations, has the
potential of achieving substantial throughput and power
efficiency gains in wireless networks. As such, it is
considered as a powerful solution to meet the stringent
demands and requirements of next-generation wireless
systems. However, because of the random and
asynchronous packet arrivals, network coding may result
in severe delay and packet loss because packets need to
wait to be network-coded with each others. To overcome
this and guarantee quality of service (QoS), we present
a novel cross-layer approach, which we shall refer to
as Buffer-Aware Network Coding, or BANC, which allows
transmission of some packets without network coding to
reduce the packet delay. We shall derive the average
delay and power consumption of BANC by presenting a
random mapping description of BANC and Markov models of
buffer states. A cross-layer optimization problem that
minimizes the average delay under a given power
constraint is then proposed and analyzed. Its solution
will not only demonstrate the fundamental performance
limits of BANC in terms of the achievable delay region
and delay-power tradeoff, but also obtains the
delay-optimal BANC schemes. Simulation results will
show that the proposed approach can strike the optimal
tradeoff between power efficiency and QoS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qin:2012:SST,
author = "Yang Qin and Lie-Liang Yang",
title = "Steady-state throughput analysis of network coding
nodes employing stop-and-wait automatic repeat
request",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1402--1411",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178860",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper analyzes the steady-state throughput of
network coding nodes when data is transmitted based on
the stop-and-wait automatic repeat request (SW-ARQ)
scheme. The state transition of network coding nodes
employing SW-ARQ is analyzed, which shows that the
operations of network coding nodes can be modeled by a
finite state machine. Therefore, the throughput
expressions of network coding nodes can be derived
based on the properties of finite state machines.
Furthermore, the throughput performance of network
coding nodes is investigated either by simulations or
by evaluation of the expressions obtained. It can be
shown that the simulation results converge closely to
the numerical results and justify the effectiveness of
our analytical expressions obtained.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:MPA,
author = "Yongkun Li and Bridge Qiao Zhao and John C. S. Lui",
title = "On modeling product advertisement in large-scale
online social networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1412--1425",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178078",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the following advertisement problem in
online social networks (OSNs). Given a fixed
advertisement investment, e.g., a number of free
samples that can be given away to a small number of
users, a company needs to determine the probability
that users in the OSN will eventually purchase the
product. In this paper, we model OSNs as scale-free
graphs (either with or without high clustering
coefficient). We employ various influence mechanisms
that govern the influence spreading in such large-scale
OSNs and use the local mean field (LMF) technique to
analyze these online social networks wherein states of
nodes can be changed by various influence mechanisms.
We extend our model for advertising with multiple
rating levels. Extensive simulations are carried out to
validate our models, which can provide insight on
designing efficient advertising strategies in online
social networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2012:EPL,
author = "Danhua Guo and Laxmi Narayan Bhuyan and Bin Liu",
title = "An efficient parallelized {L7-filter} design for
multicore servers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1426--1439",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2177858",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "L7-filter is a significant deep packet inspection
(DPI) extension to Netfilter in Linux's QoS framework.
It classifies network traffic based on information
hidden in the packet payload. Although the
computationally intensive payload classification can be
accelerated with multiple processors, the default OS
scheduler is oblivious to both the software
characteristics and the underlying multicore
architecture. In this paper, we present a parallelized
L7-filter algorithm and an efficient scheduler
technique for multicore servers. Our multithreaded
L7-filter algorithm can process the incoming packets on
multiple servers boosting the throughput tremendously.
Our scheduling algorithm is based on Highest Random
Weight (HRW), which maintains the connection locality
for the incoming traffic, but only guarantees load
balance at the connection level. We present an Adapted
Highest Random Weight (AHRW) algorithm that enhances
HRW by applying packet-level load balancing with an
additional feedback vector corresponding to the queue
length at each processor. We further introduce a
Hierarchical AHRW (AHRW-tree) algorithm that considers
characteristics of the multicore architecture such as
cache and hardware topology by developing a hash tree
architecture. The algorithm reduces the scheduling
overhead to $ O(\log N) $ instead of $ O(N) $ and
produces a better balance between locality and load
balancing. Results show that the AHRW-tree scheduler
can improve the L7-filter throughput by about 50\% on a
Sun-Niagara-2-based server compared to a connection
locality-based scheduler. Although extensively tested
for L7-filter traces, our technique is applicable to
many other packet processing applications, where
connection locality and load balancing are important
while executing on multiple processors. With these
speedups and inherent software flexibility, our design
and implementation provide a cost-effective alternative
to the traffic monitoring and filtering ASICs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zafer:2012:LGS,
author = "Murtaza Zafer and Dakshi Agrawal and Mudhakar
Srivatsa",
title = "Limitations of generating a secret key using wireless
fading under active adversary",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1440--1451",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2183146",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, many research studies have explored the use
of wireless fading to generate an information-theoretic
shared secret key over an open wireless channel. While
this line of research is now mature enough to be built
into demonstrative working systems for scenarios
involving a (limited) passive/eavesdropping adversary
model, the case of an active (jamming) adversary has
not been sufficiently studied. Under an active
adversary, information-bits that need to be exchanged
during the process of key setup will not only be
subject to eavesdropping, but also message disruptions
that could lead to a high communication cost per bit of
secret key generated. Measuring efficiency of key
exchange as the ratio of communication cost to the size
of secret key generated, in this paper, we address the
following question: Is generating a secret key by
exploiting wireless fading an efficient process? We
obtain analytical results that quantify the minimum
number of information-bits that must be exchanged to
obtain one bit of shared secret key and show that this
number rapidly increases with an active adversary's
signal power. Thus, through our analysis, we conclude
that the effectiveness of generating a secret key from
wireless fading is limited when considering active
adversaries.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Camp:2012:CFU,
author = "Joseph Camp and Ehsan Aryafar and Edward Knightly",
title = "Coupled 802.11 flows in urban channels: model and
experimental evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1452--1465",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2181863",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Contending flows in multihop 802.11 wireless networks
compete with two fundamental asymmetries: (1) channel
asymmetry, in which one flow has a stronger signal,
potentially yielding physical layer capture; and (2)
topological asymmetry, in which one flow has increased
channel state information, potentially yielding an
advantage in winning access to the channel. Prior work
has considered these asymmetries independently with a
highly simplified view of the other. However, in this
paper, we perform thousands of measurements on coupled
flows in urban environments and build a simple yet
accurate model that jointly considers information and
channel asymmetries. We show that if these two
asymmetries are not considered jointly, throughput
predictions of even two coupled flows are vastly
distorted from reality when traffic characteristics are
only slightly altered (e.g., changes to modulation
rate, packet size, or access mechanism). These
performance modes are sensitive not only to small
changes in system properties, but also small-scale link
fluctuations that are common in an urban mesh network.
We analyze all possible capture relationships for
two-flow subtopologies and show that capture of the
reverse traffic can allow a previously starving flow to
compete fairly. Finally, we show how to extend and
apply the model in domains such as modulation rate
adaptation and understanding the interaction of control
and data traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gai:2012:CNO,
author = "Yi Gai and Bhaskar Krishnamachari and Rahul Jain",
title = "Combinatorial network optimization with unknown
variables: multi-armed bandits with linear rewards and
individual observations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1466--1478",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2181864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We formulate the following combinatorial multiarmed
bandit (MAB) problem: There are $N$ random variables
with unknown mean that are each instantiated in an
i.i.d. fashion over time. At each time multiple random
variables can be selected, subject to an arbitrary
constraint on weights associated with the selected
variables. All of the selected individual random
variables are observed at that time, and a linearly
weighted combination of these selected variables is
yielded as the reward. The goal is to find a policy
that minimizes regret, defined as the difference
between the reward obtained by a genie that knows the
mean of each random variable, and that obtained by the
given policy. This formulation is broadly applicable
and useful for stochastic online versions of many
interesting tasks in networks that can be formulated as
tractable combinatorial optimization problems with
linear objective functions, such as maximum weighted
matching, shortest path, and minimum spanning tree
computations. Prior work on multi-armed bandits with
multiple plays cannot be applied to this formulation
because of the general nature of the constraint. On the
other hand, the mapping of all feasible combinations to
arms allows for the use of prior work on MAB with
single-play, but results in regret, storage, and
computation growing exponentially in the number of
unknown variables. We present new efficient policies
for this problem that are shown to achieve regret that
grows logarithmically with time, and polynomially in
the number of unknown variables. Furthermore, these
policies only require storage that grows linearly in
the number of unknown parameters. For problems where
the underlying deterministic problem is tractable,
these policies further require only polynomial
computation. For computationally intractable problems,
we also present results on a different notion of regret
that is suitable when a polynomial-time approximation
algorithm is used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Traskov:2012:SNC,
author = "Danail Traskov and Michael Heindlmaier and Muriel
M{\'e}dard and Ralf Koetter",
title = "Scheduling for network-coded multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1479--1488",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2180736",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider multicasting using random linear network
coding over a multihop wireless network in the
bandwidth limited regime. We address the associated
medium access problem and propose a scheduling
technique that activates hyperarcs rather than links,
as in classical scheduling approaches. We encapsulate
the constraints on valid network configurations in a
conflict graph model and formulate a joint optimization
problem taking into account both the network coding
subgraph and the schedule. Next, using Lagrangian
relaxation, we decompose the overall problem into two
subproblems, a multiple-shortest-paths problem and a
maximum weighted stable set (MWSS) problem. We show
that if we use a greedy heuristic for the MWSS part of
the problem, the overall algorithm is completely
distributed. We provide extensive simulation results
for both the centralized optimal and the decentralized
algorithms. The optimal algorithm improves performance
by up to a factor of two over widely used techniques
such as orthogonal or two-hop-constrained scheduling.
The decentralized algorithm is shown to buy its
distributed operation with some throughput losses.
Experimental results on randomly generated networks
suggest that these losses are not large. Finally, we
study the power consumption of our scheme and quantify
the tradeoff between power and bandwidth efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Song:2012:ETB,
author = "Haoyu Song and Murali Kodialam and Fang Hao and T. V.
Lakshman",
title = "Efficient trie braiding in scalable virtual routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1489--1500",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2181412",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many popular algorithms for fast packet forwarding and
filtering rely on the tree data structure. Examples are
the trie-based IP lookup and packet classification
algorithms. With the recent interest in network
virtualization, the ability to run multiple virtual
router instances on a common physical router platform
is essential. An important scaling issue is the number
of virtual router instances that can run on the
platform. One limiting factor is the amount of
high-speed memory and caches available for storing the
packet forwarding and filtering data structures. An
ideal goal is to achieve good scaling while maintaining
total isolation among the virtual routers. However,
total isolation requires maintaining separate data
structures in high-speed memory for each virtual
router. In this paper, we study the case where some
sharing of the forwarding and filtering data structures
is permissible and develop algorithms for combining
tries used for IP lookup and packet classification.
Specifically, we develop a mechanism called trie
braiding that allows us to combine tries from the data
structures of different virtual routers into just one
compact trie. Two optimal braiding algorithms and a
faster heuristic algorithm are presented, and the
effectiveness is demonstrated using the real-world data
sets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2012:CSG,
author = "Wentao Huang and Xinbing Wang",
title = "Capacity scaling of general cognitive networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1501--1513",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2180400",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There has been recent interest within the networking
research community to understand how performance scales
in cognitive networks with overlapping $n$ primary
nodes and $m$ secondary nodes. Two important metrics,
i.e., throughput and delay, are studied in this paper.
We first propose a simple and extendable decision
model, i.e., the hybrid protocol model, for the
secondary nodes to exploit spatial gap among primary
transmissions for frequency reuse. Then, a framework
for general cognitive networks is established based on
the hybrid protocol model to analyze the occurrence of
transmission opportunities for secondary nodes. We show
that if the primary network operates in a generalized
TDMA fashion, or employs a routing scheme such that
traffic flows choose relays independently, then the
hybrid protocol model suffices to guide the secondary
network to achieve the same throughput and delay
scaling as a standalone network without harming the
performance of the primary network, as long as the
secondary transmission range is smaller than the
primary range in order. Our approach is general in the
sense that we only make a few weak assumptions on both
networks, and therefore it obtains a wide variety of
results. We show secondary networks can obtain the same
order of throughput and delay as standalone networks
when primary networks are classic static networks,
networks with random walk mobility, hybrid networks,
multicast networks, CSMA networks, networks with
general mobility, or clustered networks. Our work
presents a relatively complete picture of the
performance scaling of cognitive networks and provides
fundamental insight on the design of them.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aezladen:2012:ELB,
author = "Mhameed Aezladen and Reuven Cohen and Danny Raz",
title = "Efficient location-based decision-supporting content
distribution to mobile groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1514--1526",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2182057",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper deals with efficient location-based
decision-supporting content distribution to mobile
groups. We consider the case where a set of information
dissemination devices (IDDs) broadcast a limited amount
of location-based information to passing mobile nodes
that are moving along well-defined paths. We develop a
novel model that captures the main aspects of the
problem and define a new optimization problem we call
Maximum Benefit Message Assignment Problem (MBMAP). We
study several variants of this problem in the case
where the IDDs are cooperative and in the case where
they are not. We develop new approximation algorithms
for these variants and then focus on the practical
effects of using them in realistic networking
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saleh:2012:AAM,
author = "Mohammad A. Saleh and Ahmed E. Kamal",
title = "Approximation algorithms for many-to-many traffic
grooming in optical {WDM} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1527--1540",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2183005",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A large number of network applications today allow
several users to interact together using the
many-to-many service mode. In many-to-many
communication, also referred to as group communication,
a session consists of a group of users (we refer to
them as members), where each member transmits its
traffic to all other members in the same group. In this
paper, we address the problem of grooming subwavelength
many-to-many traffic (e.g., OC-3) into high-bandwidth
wavelength channels (e.g., OC-192) in optical
wavelength division multiplexing (WDM) mesh networks.
The cost of an optical WDM network is dominated by the
cost of higher-layer electronic ports (i.e.,
transceivers). A transceiver is needed for each
initiation and termination of a lightpath. Therefore,
our objective is to minimize the total number of
lightpaths established. Unfortunately, the grooming
problem even with unicast traffic has been shown to be
NP-hard. In this paper, we introduce two novel
approximation algorithms for the many-to-many traffic
grooming problem. We also consider the routing and
wavelength assignment problem with the objective of
minimizing the number of wavelengths used. Through
extensive experiments, we show that the proposed
algorithms use a number of lightpaths that is very
close to that of a derived lower bound. Also, we
compare the two algorithms on other important
objectives such as the number of logical hops traversed
by a traffic stream, total amount of electronic
switching at a node, and Min-Max objectives.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tekin:2012:ACG,
author = "Cem Tekin and Mingyan Liu and Richard Southwell and
Jianwei Huang and Sahand Haji Ali Ahmad",
title = "Atomic congestion games on graphs and their
applications in networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1541--1552",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2182779",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we introduce and analyze the properties
of a class of games, the atomic congestion games on
graphs (ACGGs), which is a generalization of the
classical congestion games. In particular, an ACGG
captures the spatial information that is often ignored
in a classical congestion game. This is useful in many
networking problems, e.g., wireless networks where
interference among the users heavily depends on the
spatial information. In an ACGG, a player's payoff for
using a resource is a function of the number of players
who interact with it and use the same resource. Such
spatial information can be captured by a graph. We
study fundamental properties of the ACGGs: under what
conditions these games possess a pure strategy Nash
equilibrium (PNE), or the finite improvement property
(FIP), which is sufficient for the existence of a PNE.
We show that a PNE may not exist in general, but that
it does exist in many important special cases including
tree, loop, or regular bipartite networks. The FIP
holds for important special cases including systems
with two resources or identical payoff functions for
each resource. Finally, we present two wireless network
applications of ACGGs: power control and channel
contention under IEEE 802.11.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2012:SAM,
author = "Wei Gao and Qinghua Li and Bo Zhao and Guohong Cao",
title = "Social-aware multicast in disruption-tolerant
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1553--1566",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2183643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Node mobility and end-to-end disconnections in
disruption-tolerant networks (DTNs) greatly impair the
effectiveness of data forwarding. Although social-based
approaches can address the problem, most existing
solutions only focus on forwarding data to a single
destination. In this paper, we study multicast with
single and multiple data items in DTNs from a social
network perspective, develop analytical models for
multicast relay selection, and furthermore investigate
the essential difference between multicast and unicast
in DTNs. The proposed approach selects relays according
to their capabilities, measured by social-based
metrics, for forwarding data to the destinations. The
design of social-based metrics exploits social network
concepts such as node centrality and social community,
and the selected relays ensure achieving the required
data delivery ratio within the given time constraint.
Extensive trace-driven simulations show that the
proposed approach has similar data delivery ratio and
delay to that of Epidemic routing, but significantly
reduces data forwarding cost, measured by the number of
relays used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aparicio-Pardo:2012:NRV,
author = "Ramon Aparicio-Pardo and Nina Skorin-Kapov and Pablo
Pavon-Marino and Belen Garcia-Manrubia",
title = "{(Non-)reconfigurable} virtual topology design under
multihour traffic in optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1567--1580",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2184300",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates offline virtual topology
design in transparent optical networks under a
multihour traffic demand. The main problem variant
addressed here designs a reconfigurable virtual
topology that evolves over time to more efficiently
utilize network resources (the MH-VTD-R problem). The
case of designing a static non-reconfigurable virtual
topology that can accommodate the time-varying traffic
(the MH-VTD-NR problem) is also considered. The
objectives are to minimize: (1) the number of
transceivers, which make up for the main network cost;
and (2) the frequency of reconfiguration (for
MH-VTD-R), which incurs additional overhead and
potential service disruption. We formulate this
multiobjective problem as an exact mixed integer linear
program (MILP). Due to its high complexity, we propose
a very efficient heuristic algorithm called Greedy
Approach with Reconfiguration Flattening (GARF). GARF
not only solves both (non-)reconfigurable problem
variants, but it allows for tuning of the relative
importance of the two objectives. Exhaustive
experiments on real and synthetic traffic and
comparison to previous proposals and bounds reveal the
merits of GARF with respect to both solution quality
and execution time. Furthermore, the obtained results
indicate that the maximal transceiver cost savings
achieved by the fully reconfigurable case may not be
enough to justify the associated increase in
reconfiguration cost. However, results show that an
advantageous tradeoff between transceiver cost savings
and reconfiguration cost can be achieved by a allowing
a small number of virtual topology reconfigurations
over time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Phan:2012:NOD,
author = "Khoa Tran Phan and Jaeok Park and Mihaela {Van Der
Schaar}",
title = "Near-optimal deviation-proof medium access control
designs in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1581--1594",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2182359",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed medium access control (MAC) protocols are
essential for the proliferation of low-cost,
decentralized wireless local area networks (WLANs).
Most MAC protocols are designed with the presumption
that nodes comply with prescribed rules. However,
selfish nodes have natural motives to manipulate
protocols in order to improve their own performance.
This often degrades the performance of other nodes as
well as that of the overall system. In this paper, we
propose a class of protocols that limit the performance
gain from selfish manipulation while incurring only a
small efficiency loss. The proposed protocols are based
on the idea of a review strategy, with which nodes
collect signals about the actions of other nodes over a
period of time, use a statistical test to infer whether
or not other nodes are following the prescribed
behavior, and trigger a punishment if a deviation is
inferred. We consider the cases of private and public
signals and provide analytical and numerical results to
demonstrate the properties of the proposed protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2012:WMS,
author = "Honghai Zhang and Yuanxi Jiang and Karthik Sundaresan
and Sampath Rangarajan and Baohua Zhao",
title = "Wireless multicast scheduling with switched
beamforming antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1595--1607",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191977",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Using beamforming antennas to improve wireless
multicast transmissions has received considerable
attention recently. A recent work proposes to partition
all single-lobe beams into groups and to form composite
multilobe beam patterns to transmit multicast traffic.
Depending on how the power is split among the
individual beams constituting a composite beam pattern,
two power models are considered: (1) equal power split
(EQP), and (2) asymmetric power split (ASP). This paper
revisits the key challenge --- beam partitioning in the
beamforming-multicast problem --- and makes significant
progress in both algorithmic and analytic aspects of
the problem. Under EQP, we propose a low-complexity
optimal algorithm based on dynamic programming. Under
ASP, we prove that it is NP-hard to have $ (3 / 2 -
\epsilon)$-approximation algorithm for any $ \epsilon >
0$. For discrete rate functions under ASP, we develop
an Asymptotic Polynomial-Time Approximation Scheme
(APTAS), an asymptotic $ (3 / 2 + \beta)$-approximation
solution (where $ \beta \geq 0$ depends on the wireless
technology), and an asymptotic 2-approximation solution
to the problem by relating the problem to a generalized
version of the bin-packing problem. In retrospect, we
also obtain an asymptotic 2-approximation solution for
the generalized bin-packing problem, which is of
independent interest. For continuous rate functions
under ASP, we develop sufficient conditions under which
the optimal number of composite beams is $1$, {$K$},
and arbitrary, respectively, where {$K$} is the total
number of single-lobe beams. Both experimental results
and simulations based on real-world channel
measurements corroborate our analytical results by
showing significant improvement compared to
state-of-the-art algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bodas:2012:LCS,
author = "Shreeshankar Bodas and Sanjay Shakkottai and Lei Ying
and R. Srikant",
title = "Low-complexity scheduling algorithms for multichannel
downlink wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1608--1621",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2185709",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the problem of designing
scheduling algorithms for multichannel (e.g.,
OFDM-based) wireless downlink networks, with a large
number of users and proportionally large bandwidth. For
this system, while the classical MaxWeight algorithm is
known to be throughput-optimal, its buffer-overflow
performance is very poor (formally, it is shown that it
has zero rate function in our setting). To address
this, a class of algorithms called iterated Heaviest
matching with Longest Queues First (iHLQF) is proposed.
The algorithms in this class are shown to be
throughput-optimal for a general class of arrival\slash
channel processes, and also rate-function-optimal
(i.e., exponentially small buffer overflow probability)
for certain arrival\slash channel processes. iHLQF,
however, has higher complexity than MaxWeight ($ n^4 $
versus $ n^2 $, respectively). To overcome this issue,
a new algorithm called Server-Side Greedy (SSG) is
proposed. It is shown that SSG is throughput-optimal,
results in a much better per-user buffer overflow
performance than the MaxWeight algorithm (positive rate
function for certain arrival\slash channel processes),
and has a computational complexity ($ n^2$) that is
comparable to the MaxWeight algorithm. Thus, it
provides a nice tradeoff between buffer-overflow
performance and computational complexity. These results
are validated by both analysis and simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:PFT,
author = "Tao Li and Shigang Chen and Yibei Ling",
title = "Per-flow traffic measurement through randomized
counter sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1622--1634",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2192447",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic measurement provides critical real-world data
for service providers and network administrators to
perform capacity planning, accounting and billing,
anomaly detection, and service provision. One of the
greatest challenges in designing an online measurement
module is to minimize the per-packet processing time in
order to keep up with the line speed of the modern
routers. To meet this challenge, we should minimize the
number of memory accesses per packet and implement the
measurement module in the on-die SRAM. The small size
of SRAM requires extremely compact data structures to
be designed for storing per-flow information. The best
existing work, called counter braids, requires more
than 4 bits per flow and performs six or more memory
accesses per packet. In this paper, we design a fast
and compact measurement function that estimates the
sizes of all flows. It achieves the optimal processing
speed: two memory accesses per packet. In addition, it
provides reasonable measurement accuracy in a tight
space where the counter braids no longer work. Our
design is based on a new data encoding/decoding scheme,
called randomized counter sharing. This scheme allows
us to mix per-flow information together in storage for
compactness and, at the decoding time, separate the
information of each flow through statistical removal of
the error introduced during information mixing from
other flows. The effectiveness of our online per-flow
measurement approach is analyzed and confirmed through
extensive experiments based on real network traffic
traces. We also propose several methods to increase the
estimation range of flow sizes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Magistretti:2012:MDM,
author = "Eugenio Magistretti and Omer Gurewitz and Edward W.
Knightly",
title = "Measurement-driven modeling of transmission
coordination for 802.11 online",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1635--1648",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2192482",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In 802.11 managed wireless networks, the manager can
address underserved links by rate-limiting the
conflicting nodes. In order to determine to what extent
each conflicting node is responsible for the poor
performance, the manager needs to understand the
coordination among conflicting nodes' transmissions. In
this paper, we present a management framework called
Management, Inference, and Diagnostics using Activity
Share (MIDAS). We introduce the concept of Activity
Share, which characterizes the coordination among any
set of network nodes in terms of the time they spend
transmitting simultaneously. Unfortunately, the
Activity Share cannot be locally measured by the nodes.
Thus, MIDAS comprises an inference tool that, based on
a combined physical, protocol, and statistical
approach, infers the Activity Share by using a small
set of passively collected, time-aggregate local
channel measurements reported by the nodes. MIDAS uses
the estimated Activity Share as the input of a simple
model that predicts how limiting the transmission rate
of any conflicting node would benefit the throughput of
the underserved link. The model is based on the current
network conditions, thus representing the first
throughput model using online measurements. We
implemented our tool on real hardware and deployed it
on an indoor testbed. Our extensive validation combines
testbed experiments and simulations. The results show
that MIDAS infers the Activity Share with a mean
relative error as low as 4\% in testbed experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:SEE,
author = "Ruogu Li and Atilla Eryilmaz",
title = "Scheduling for end-to-end deadline-constrained traffic
with reliability requirements in multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1649--1662",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186978",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We attack the challenging problem of designing a
scheduling policy for end-to-end deadline-constrained
traffic with reliability requirements in a multihop
network. It is well known that the end-to-end delay
performance for a multihop flow has a complex
dependence on the high-order statistics of the arrival
process and the algorithm itself. Thus, neither the
earlier optimization-based approaches that aim to meet
the long-term throughput demands nor the solutions that
focus on a similar problem for single-hop flows
directly apply. Moreover, a dynamic programming-based
approach becomes intractable for such multi-timescale
quality-of-service (QoS)-constrained traffic in a
multihop environment. This motivates us in this paper
to develop a useful architecture that enables us to
exploit the degree of freedom in choosing appropriate
service discipline. Based on the new architecture, we
propose three different approaches, each leading to an
original algorithm. We study the performance of these
algorithms in different scenarios to show both
optimality characteristics and to demonstrate the
favorable service discipline characteristics they
possess. We provide extensive numerical results to
compare the performance of all of these solutions to
throughput-optimal back-pressure-type schedulers and to
longest waiting-time-based schedulers that have
provably optimal asymptotic performance
characteristics. Our results reveal that the dynamic
choice of service discipline of our proposed solutions
yields substantial performance improvements compared to
both of these types of traditional solutions under
nonasymptotic conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yadav:2012:DAG,
author = "Sandeep Yadav and Ashwath Kumar Krishna Reddy and A.
L. Narasimha Reddy and Supranamaya Ranjan",
title = "Detecting algorithmically generated domain-flux
attacks with {DNS} traffic analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "5",
pages = "1663--1677",
month = oct,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2184552",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:36 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent botnets such as Conficker, Kraken, and Torpig
have used DNS-based ``domain fluxing'' for
command-and-control, where each Bot queries for
existence of a series of domain names and the owner has
to register only one such domain name. In this paper,
we develop a methodology to detect such ``domain
fluxes'' in DNS traffic by looking for patterns
inherent to domain names that are generated
algorithmically, in contrast to those generated by
humans. In particular, we look at distribution of
alphanumeric characters as well as bigrams in all
domains that are mapped to the same set of IP
addresses. We present and compare the performance of
several distance metrics, including K-L distance, Edit
distance, and Jaccard measure. We train by using a good
dataset of domains obtained via a crawl of domains
mapped to all IPv4 address space and modeling bad
datasets based on behaviors seen so far and expected.
We also apply our methodology to packet traces
collected at a Tier-1 ISP and show we can automatically
detect domain fluxing as used by Conficker botnet with
minimal false positives, in addition to discovering a
new botnet within the ISP trace. We also analyze a
campus DNS trace to detect another unknown botnet
exhibiting advanced domain-name generation technique.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2012:UMP,
author = "Minghua Chen and Miroslav Ponec and Sudipta Sengupta
and Jin Li and Philip A. Chou",
title = "Utility maximization in peer-to-peer systems with
applications to video conferencing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1681--1694",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2201166",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of utility
maximization in peer-to-peer (P2P) systems, in which
aggregate application-specific utilities are maximized
by running distributed algorithms on P2P nodes, which
are constrained by their uplink capacities. For certain
P2P topologies, we show that routing along a linear
number of trees per source can achieve the largest rate
region that can be possibly obtained by intrasession
and intersession network coding. This observation
allows us to develop a simple multitree formulation for
the problem. For the resulting nonstrictly concave
optimization problem, we develop a Primal-dual
distributed algorithm and prove its global convergence
using our proposed sufficient conditions. These
conditions are general and add understanding to the
convergence of primal-dual algorithms under nonstrictly
concave settings. We implement the proposed distributed
algorithm in a peer-assisted multiparty conferencing
system by utilizing only end-to-end delay measurements
between P2P nodes. We demonstrate its superior
performance through actual experiments on a LAN testbed
and the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2012:ABE,
author = "Bo Han and Lusheng Ji and Seungjoon Lee and Bobby
Bhattacharjee and Robert R. Miller",
title = "Are all bits equal?: experimental study of {IEEE}
802.11 communication bit errors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1695--1706",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2225842",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, practical subframe-level schemes, such as
frame combining and partial packet recovery, have been
proposed for combating wireless transmission errors.
These approaches depend heavily on the bit error
behavior of wireless data transmissions, which is
overlooked in the literature. We study the
characteristics of subframe bit errors and their
location distribution by conducting extensive
experiments on several IEEE 802.11 WLAN testbeds. Our
measurement results identify three bit error patterns:
slope-line, saw-line, and finger. Among these three
patterns, we have verified that the slope-line and
saw-line are present in different physical environments
and across various hardware platforms. However, the
finger pattern does not appear on some platforms. We
discuss our current hypotheses for the reasons behind
these bit error patterns and how identifying these
patterns may help improve the robustness of WLAN
transmissions. We believe that identifiable bit error
patterns can potentially introduce new opportunities in
channel coding, network coding, forward error
correction (FEC), and frame combining.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2012:OCA,
author = "Lu Zhang and Xueyan Tang",
title = "Optimizing client assignment for enhancing
interactivity in distributed interactive applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1707--1720",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2187674",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed interactive applications (DIAs) are
networked systems that allow multiple participants at
different locations to interact with each other. Wide
spreads of client locations in large-scale DIAs often
require geographical distribution of servers to meet
the latency requirements of the applications. In the
distributed server architecture, the network latencies
involved in the interactions between clients are
directly affected by how the clients are assigned to
the servers. In this paper, we focus on the problem of
assigning clients to appropriate servers in DIAs to
enhance their interactivity. We formulate the problem
as a combinational optimization problem and prove that
it is NP-complete. Then, we propose several heuristic
algorithms for fast computation of good client
assignments and theoretically analyze their
approximation ratios. The proposed algorithms are also
experimentally evaluated with real Internet latency
data. The results show that the proposed algorithms are
efficient and effective in reducing the interaction
time between clients, and our proposed
Distributed-Modify-Assignment adapts well to the
dynamics of client participation and network
conditions. For the special case of tree network
topologies, we develop a polynomial-time algorithm to
compute the optimal client assignment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qazi:2012:CCM,
author = "Ihsan Ayyub Qazi and Lachlan L. H. Andrew and Taieb
Znati",
title = "Congestion control with multipacket feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1721--1733",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188838",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many congestion control protocols use explicit
feedback from the network to achieve high performance.
Most of these either require more bits for feedback
than are available in the IP header or incur
performance limitations due to inaccurate congestion
feedback. There has been recent interest in protocols
that obtain high-resolution estimates of congestion by
combining the explicit congestion notification (ECN)
marks of multiple packets, and using this to guide
multiplicative increase, additive increase,
multiplicative decrease (MI-AI-MD) window adaptation.
This paper studies the potential of such approaches,
both analytically and by simulation. The evaluation
focuses on a new protocol called Binary Marking
Congestion Control (BMCC). It is shown that these
schemes can quickly acquire unused capacity, quickly
approach a fair rate distribution, and have relatively
smooth sending rates, even on high bandwidth-delay
product networks. This is achieved while maintaining
low average queue length and negligible packet loss.
Using extensive simulations, we show that BMCC
outperforms XCP, VCP, MLCP, CUBIC, CTCP, SACK, and in
some cases RCP, in terms of average flow completion
times. Suggestions are also given for the incremental
deployment of BMCC.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2012:GRG,
author = "He Yan and Lee Breslau and Zihui Ge and Dan Massey and
Dan Pei and Jennifer Yates",
title = "{G-RCA}: a generic root cause analysis platform for
service quality management in large {IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1734--1747",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188837",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An increasingly diverse set of applications, such as
Internet games, streaming videos, e-commerce, online
banking, and even mission-critical emergency call
services, all relies on IP networks. In such an
environment, best-effort service is no longer
acceptable. This requires a transformation in network
management from detecting and replacing individual
faulty network elements to managing the end-to-end
service quality as a whole. In this paper, we describe
the design and development of a Generic Root Cause
Analysis platform (G-RCA) for service quality
management (SQM) in large IP networks. G-RCA contains a
comprehensive service dependency model that
incorporates topological and cross-layer relationships,
protocol interactions, and control plane dependencies.
G-RCA abstracts the root cause analysis process into
signature identification for symptom and diagnostic
events, temporal and spatial event correlation, and
reasoning and inference logic. G-RCA provides a
flexible rule specification language that allows
operators to quickly customize G-RCA and provide
different root cause analysis tools as new problems
need to be investigated. G-RCA is also integrated with
data trending, manual data exploration, and statistical
correlation mining capabilities. G-RCA has proven to be
a highly effective SQM platform in several different
applications, and we present results regarding BGP
flaps, PIM flaps in Multicast VPN service, and
end-to-end throughput degradation in content delivery
network (CDN) service.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2012:MSN,
author = "Liguang Xie and Yi Shi and Y. Thomas Hou and Hanif D.
Sherali",
title = "Making sensor networks immortal: an energy-renewal
approach with wireless power transfer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1748--1761",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2185831",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks are constrained by limited
battery energy. Thus, finite network lifetime is widely
regarded as a fundamental performance bottleneck.
Recent breakthrough in the area of wireless power
transfer offers the potential of removing this
performance bottleneck, i.e., allowing a sensor network
to remain operational forever. In this paper, we
investigate the operation of a sensor network under
this new enabling energy transfer technology. We
consider the scenario of a mobile charging vehicle
periodically traveling inside the sensor network and
charging each sensor node's battery wirelessly. We
introduce the concept of renewable energy cycle and
offer both necessary and sufficient conditions. We
study an optimization problem, with the objective of
maximizing the ratio of the wireless charging vehicle
(WCV)'s vacation time over the cycle time. For this
problem, we prove that the optimal traveling path for
the WCV is the shortest Hamiltonian cycle and provide a
number of important properties. Subsequently, we
develop a near-optimal solution by a piecewise linear
approximation technique and prove its performance
guarantee.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tapolcai:2012:NWL,
author = "J{\'a}nos Tapolcai and Pin-Han Ho and Lajos R{\'o}nyai
and Bin Wu",
title = "Network-wide local unambiguous failure localization
{(NWL-UFL)} via monitoring trails",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1762--1773",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186461",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Monitoring trail ($m$-trail) has been proposed as an
effective approach for link failure localization in
all-optical wavelength division multiplexing (WDM) mesh
networks. Previous studies in failure localization rely
on alarm dissemination via control plane signaling such
that the network controller can collect the flooded
alarms to form an alarm code for failure
identification. Such cross-layer signaling effort
obviously leads to additional control complexity. This
paper investigates a novel $m$-trail failure
localization scenario, called network-wide local
unambiguous failure localization (NWL-UFL), where each
node can perform UFL based on locally available ON-OFF
state of traversing $m$-trails, such that alarm
dissemination in the control plane can be completely
avoided. The paper first defines and formulates the
$m$-trail allocation problem under NWL-UFL and conducts
a series of bound analysis on the cover length required
for localizing any single-link failure. This is the
first study on monitoring trail allocation problem that
aims to gain understanding on the consumed cover length
via analytical approaches due to the special feature of
the NWL-UFL scenario. A novel heuristic algorithm based
on random spanning tree assignment (RSTA) and greedy
link swapping (GLS) is developed for solving the
formulated problem. Extensive simulation on thousands
of randomly generated network topologies is conducted
to verify the proposed scheme by comparing it to a
naive counterpart and with the derived lower bounds. We
also demonstrate the impact of topology diversity on
the performance of the proposed scheme as well as its
scalability regarding network sizes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2012:PIP,
author = "Fei Chen and Alex X. Liu",
title = "Privacy- and integrity-preserving range queries in
sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1774--1787",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188540",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The architecture of two-tiered sensor networks, where
storage nodes serve as an intermediate tier between
sensors and a sink for storing data and processing
queries, has been widely adopted because of the
benefits of power and storage saving for sensors as
well as the efficiency of query processing. However,
the importance of storage nodes also makes them
attractive to attackers. In this paper, we propose
SafeQ, a protocol that prevents attackers from gaining
information from both sensor collected data and sink
issued queries. SafeQ also allows a sink to detect
compromised storage nodes when they misbehave. To
preserve privacy, SafeQ uses a novel technique to
encode both data and queries such that a storage node
can correctly process encoded queries over encoded data
without knowing their values. To preserve integrity, we
propose two schemes --- one using Merkle hash trees and
another using a new data structure called neighborhood
chains --- to generate integrity verification
information so that a sink can use this information to
verify whether the result of a query contains exactly
the data items that satisfy the query. To improve
performance, we propose an optimization technique using
Bloom filters to reduce the communication cost between
sensors and storage nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Brauckhoff:2012:AEB,
author = "Daniela Brauckhoff and Xenofontas Dimitropoulos and
Arno Wagner and Kav{\'e} Salamatian",
title = "Anomaly extraction in backbone networks using
association rules",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1788--1799",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2187306",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Anomaly extraction refers to automatically finding, in
a large set of flows observed during an anomalous time
interval, the flows associated with the anomalous
event(s). It is important for root-cause analysis,
network forensics, attack mitigation, and anomaly
modeling. In this paper, we use meta-data provided by
several histogram-based detectors to identify
suspicious flows, and then apply association rule
mining to find and summarize anomalous flows. Using
rich traffic data from a backbone network, we show that
our technique effectively finds the flows associated
with the anomalous event(s) in all studied cases. In
addition, it triggers a very small number of false
positives, on average between 2 and 8.5, which exhibit
specific patterns and can be trivially sorted out by an
administrator. Our anomaly extraction method
significantly reduces the work-hours needed for
analyzing alarms, making anomaly detection systems more
practical.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ding:2012:MVD,
author = "Yong Ding and Yang Yang and Li Xiao",
title = "Multisource video on-demand streaming in wireless mesh
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1800--1813",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2188642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the multisource video on-demand (VoD)
application in multichannel multiradio wireless mesh
networks. When a user initiates a new video request,
the application can stream the video not only from the
media servers, but also from the peers that have
buffered the video. The multipath multisource video
on-demand streaming has been applied in wired networks
with great success. However, it remains a challenging
task in wireless networks due to wireless interference.
In this paper, we first focus on the problem of finding
the maximum number of high-quality and independent
paths from the user to the servers or peers for each
VoD request by considering the effect of wireless
interference. We formulate it as a constrained maximum
independent paths problem and propose two efficient
heuristic path discovery algorithms. Based on the
multiple paths discovered, we further propose a joint
routing and rate allocation algorithm, which minimizes
the network congestion caused by the new VoD session.
The algorithm is aware of the optimization for both
existing and potential VoD sessions in the wireless
mesh network. We evaluate our algorithms with real
video traces. Simulation results demonstrate that our
algorithm not only improves the average video streaming
performance over all the coexisting VoD sessions in the
network, but also increases the network's capacity of
satisfying more subsequent VoD requests.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2012:FFA,
author = "Anduo Wang and Limin Jia and Wenchao Zhou and Yiqing
Ren and Boon Thau Loo and Jennifer Rexford and Vivek
Nigam and Andre Scedrov and Carolyn Talcott",
title = "{FSR}: formal analysis and implementation toolkit for
safe interdomain routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1814--1827",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2187924",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Interdomain routing stitches the disparate parts of
the Internet together, making protocol stability a
critical issue to both researchers and practitioners.
Yet, researchers create safety proofs and
counterexamples by hand and build simulators and
prototypes to explore protocol dynamics. Similarly,
network operators analyze their router configurations
manually or using homegrown tools. In this paper, we
present a comprehensive toolkit for analyzing and
implementing routing policies, ranging from high-level
guidelines to specific router configurations. Our
Formally Safe Routing (FSR) toolkit performs all of
these functions from the same algebraic representation
of routing policy. We show that routing algebra has a
natural translation to both integer constraints (to
perform safety analysis with SMT solvers) and
declarative programs (to generate distributed
implementations). Our extensive experiments with
realistic topologies and policies show how FSR can
detect problems in an autonomous system's (AS's) iBGP
configuration, prove sufficient conditions for Border
Gateway Protocol (BGP) safety, and empirically evaluate
convergence time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Francois:2012:FCP,
author = "J{\'e}r{\^o}me Fran{\c{c}}ois and Issam Aib and Raouf
Boutaba",
title = "{FireCol}: a collaborative protection network for the
detection of flooding {DDoS} attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1828--1841",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2194508",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed denial-of-service (DDoS) attacks remain a
major security problem, the mitigation of which is very
hard especially when it comes to highly distributed
botnet-based attacks. The early discovery of these
attacks, although challenging, is necessary to protect
end-users as well as the expensive network
infrastructure resources. In this paper, we address the
problem of DDoS attacks and present the theoretical
foundation, architecture, and algorithms of FireCol.
The core of FireCol is composed of intrusion prevention
systems (IPSs) located at the Internet service
providers (ISPs) level. The IPSs form virtual
protection rings around the hosts to defend and
collaborate by exchanging selected traffic information.
The evaluation of FireCol using extensive simulations
and a real dataset is presented, showing FireCol
effectiveness and low overhead, as well as its support
for incremental deployment in real networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vanbever:2012:LML,
author = "Laurent Vanbever and Stefano Vissicchio and Cristel
Pelsser and Pierre Francois and Olivier Bonaventure",
title = "Lossless migrations of link-state {IGPs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1842--1855",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190767",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network-wide migrations of a running network, such as
the replacement of a routing protocol or the
modification of its configuration, can improve the
performance, scalability, manageability, and security
of the entire network. However, such migrations are an
important source of concerns for network operators as
the reconfiguration campaign can lead to long,
service-disrupting outages. In this paper, we propose a
methodology that addresses the problem of seamlessly
modifying the configuration of link-state Interior
Gateway Protocols (IGPs). We illustrate the benefits of
our methodology by considering several migration
scenarios, including the addition and the removal of
routing hierarchy in a running IGP, and the replacement
of one IGP with another. We prove that a strict
operational ordering can guarantee that the migration
will not create any service outage. Although finding a
safe ordering is NP-complete, we describe techniques
that efficiently find such an ordering and evaluate
them using several real-world and inferred ISP
topologies. Finally, we describe the implementation of
a provisioning system that automatically performs the
migration by pushing the configurations on the routers
in the appropriate order while monitoring the entire
migration process.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altman:2012:SSG,
author = "Eitan Altman and Anurag Kumar and Chandramani Singh
and Rajesh Sundaresan",
title = "Spatial {SINR} games of base station placement and
mobile association",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1856--1869",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the question of determining locations of base
stations (BSs) that may belong to the same or to
competing service providers. We take into account the
impact of these decisions on the behavior of
intelligent mobile terminals that can connect to the
base station that offers the best utility. The
signal-to-interference-plus-noise ratio (SINR) is used
as the quantity that determines the association. We
first study the SINR association-game: We determine the
cells corresponding to each base stations, i.e., the
locations at which mobile terminals prefer to connect
to a given base station than to others. We make some
surprising observations: (1) displacing a base station
a little in one direction may result in a displacement
of the boundary of the corresponding cell to the
opposite direction; (2) a cell corresponding to a BS
may be the union of disconnected subcells. We then
study the hierarchical equilibrium in the combined BS
location and mobile association problem: We determine
where to locate the BSs so as to maximize the revenues
obtained at the induced SINR mobile association game.
We consider the cases of single frequency band and two
frequency bands of operation. Finally, we also consider
hierarchical equilibria in two frequency systems with
successive interference cancellation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mertzios:2012:PRO,
author = "George B. Mertzios and Ignasi Sau and Mordechai Shalom
and Shmuel Zaks",
title = "Placing regenerators in optical networks to satisfy
multiple sets of requests",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1870--1879",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186462",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The placement of regenerators in optical networks has
become an active area of research during the last few
years. Given a set of lightpaths in a network {$G$} and
a positive integer $d$, regenerators must be placed in
such a way that in any lightpath there are no more than
$d$ hops without meeting a regenerator. The cost
function we consider is given by the total number of
regenerators placed at the nodes, which we believe to
be a more accurate estimation of the real cost of the
network than the number of locations considered in the
work of Flammini et al. (IEEE/ACM Trans. Netw., vol.
{\bf 19}, no. 2, pp. 498--511, Apr. 2011). Furthermore,
in our model we assume that we are given a finite set
of $p$ possible traffic patterns (each given by a set
of lightpaths), and our objective is to place the
minimum number of regenerators at the nodes so that
each of the traffic patterns is satisfied. While this
problem can be easily solved when $ d = 1$ or $ p = 1$,
we prove that for any fixed $ d, p \geq 2$, it does not
admit a PTAS, even if $G$ has maximum degree at most
$3$ and the lightpaths have length $ O(d)$. We
complement this hardness result with a constant-factor
approximation algorithm with ratio (dcp). We then study
the case where $G$ is a path, proving that the problem
is polynomial-time solvable for two particular families
of instances. Finally, we generalize our model in two
natural directions, which allows us to capture the
model of Flammini et al. as a particular case, and we
settle some questions that were left open therein.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2012:TCM,
author = "Thuy T. T. Nguyen and Grenville Armitage and Philip
Branch and Sebastian Zander",
title = "Timely and continuous machine-learning-based
classification for interactive {IP} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1880--1894",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2187305",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Machine Learning (ML) for classifying IP traffic has
relied on the analysis of statistics of full flows or
their first few packets only. However, automated QoS
management for interactive traffic flows requires quick
and timely classification well before the flows finish.
Also, interactive flows are often long-lived and should
be continuously monitored during their lifetime. We
propose to achieve this by using statistics derived
from sub-flows --- a small number of most recent
packets taken at any point in a flow's lifetime. Then,
the ML classifier must be trained on a set of
sub-flows, and we investigate different sub-flow
selection strategies. We also propose to augment
training datasets so that classification accuracy is
maintained even when a classifier mixes up
client-to-server and server-to-client directions for
applications exhibiting asymmetric traffic
characteristics. We demonstrate the effectiveness of
our approach with the Naive Bayes and C4.5 Decision
Tree ML algorithms, for the identification of
first-person-shooter online game and VoIP traffic. Our
results show that we can classify both applications
with up to 99\% Precision and 95\% Recall within less
than 1\,s. Stable results are achieved regardless of
where within a flow the classifier captures the packets
and the traffic direction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keslassy:2012:PPG,
author = "Isaac Keslassy and Kirill Kogan and Gabriel Scalosub
and Michael Segal",
title = "Providing performance guarantees in multipass network
processors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1895--1909",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2186979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current network processors (NPs) increasingly deal
with packets with heterogeneous processing times. In
such an environment, packets that require many
processing cycles delay low-latency traffic because the
common approach in today's NPs is to employ
run-to-completion processing. These difficulties have
led to the emergence of the Multipass NP architecture,
where after a processing cycle ends, all processed
packets are recycled into the buffer and recompete for
processing resources. In this paper, we provide a model
that captures many of the characteristics of this
architecture, and we consider several scheduling and
buffer management algorithms that are specially
designed to optimize the performance of multipass
network processors. In particular, we provide
analytical guarantees for the throughput performance of
our algorithms. We further conduct a comprehensive
simulation study, which validates our results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Seibert:2012:IWI,
author = "Jeff Seibert and Ruben Torres and Marco Mellia and
Maurizio M. Munafo and Cristina Nita-Rotaru and Sanjay
Rao",
title = "The {Internet}-wide impact of {P2P} traffic
localization on {ISP} profitability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1910--1923",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190093",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We conduct a detailed simulation study to examine how
localizing P2P traffic within network boundaries
impacts the profitability of an ISP. A distinguishing
aspect of our work is the focus on Internet-wide
implications, i.e., how adoption of localization within
an ISP affects both itself and other ISPs. Our
simulations are based on detailed models that estimate
inter-autonomous system (AS) P2P traffic and inter-AS
routing, localization models that predict the extent to
which P2P traffic is reduced, and pricing models that
predict the impact of changes in traffic on the profit
of an ISP. We evaluate our models by using a
large-scale crawl of BitTorrent containing over 138
million users sharing 2.75 million files. Our results
show that the benefits of localization must not be
taken for granted. Some of our key findings include:
(1) residential ISPs can actually lose money when
localization is employed, and some of them will not see
increased profitability until other ISPs employ
localization; (2) the reduction in costs due to
localization will be limited for small ISPs and tends
to grow only logarithmically with client population;
and (3) some ISPs can better increase profitability
through alternate strategies to localization by taking
advantage of the business relationships they have with
other ISPs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2012:RRW,
author = "Weiyao Xiao and Sachin Agarwal and David Starobinski
and Ari Trachtenberg",
title = "Reliable rateless wireless broadcasting with near-zero
feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1924--1937",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2189016",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We examine the problem of minimizing feedback in
reliable wireless broadcasting by pairing rateless
coding with extreme value theory. Our key observation
is that, in a broadcast environment, this problem
resolves into estimating the maximum number of packets
dropped among many receivers rather than for each
individual receiver. With rateless codes, this
estimation relates to the number of redundant
transmissions needed at the source in order for all
receivers to correctly decode a message with high
probability. We develop and analyze two new data
dissemination protocols, called Random Sampling (RS)
and Full Sampling with Limited Feedback (FSLF), based
on the moment and maximum likelihood estimators in
extreme value theory. Both protocols rely on a
single-round learning phase, requiring the transmission
of a few feedback packets from a small subset of
receivers. With fixed overhead, we show that FSLF has
the desirable property of becoming more accurate as the
receivers' population gets larger. Our protocols are
channel-agnostic, in that they do not require a priori
knowledge of (i.i.d.) packet loss probabilities, which
may vary among receivers. We provide simulations and an
improved full-scale implementation of the Rateless
Deluge over-the-air programming protocol on sensor
motes as a demonstration of the practical benefits of
our protocols, which translate into about 30\% latency
and energy consumption savings. Furthermore, we apply
our protocols to real-time (RT) oblivious rateless
codes in broadcast settings. Through simulations, we
demonstrate a 100-fold reduction in the amount of
feedback packets while incurring an increase of only
10\%-20\% in the number of encoded packets
transmissions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DiPalantino:2012:TES,
author = "Dominic DiPalantino and Ramesh Johari",
title = "Traffic engineering with semiautonomous users: a
game-theoretic perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1938--1949",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208475",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:36:40 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we explore the interaction between
traffic engineering and the users of a network. Because
a traffic engineer may be unaware of the structure of
content distribution systems or overlay networks, his
management of the network does not fully anticipate how
traffic might change as a result of his actions.
Content distribution systems that assign servers at the
application level can respond very rapidly to changes
in the routing of the network. Consequently, the
traffic engineer's decisions may not be applied to the
intended traffic. We use a game-theoretic framework in
which infinitesimal users of a network select the
source of content, and the traffic engineer decides how
the traffic will route through the network. We
formulate a game and prove the existence of equilibria.
Additionally, we present a setting in which equilibria
are socially optimal, essentially unique, and stable.
Conditions under which efficiency loss may be bounded
are presented, and the results are extended to the
cases of general overlay networks and multiple
autonomous systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2012:GTH,
author = "Jiajia Liu and Xiaohong Jiang and Hiroki Nishiyama and
Nei Kato",
title = "Generalized two-hop relay for flexible delay control
in {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1950--1963",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2187923",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:41:48 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The available two-hop relay protocols with
out-of-order or strictly in-order reception cannot
provide a flexible control for the packet delivery
delay, which may significantly limit their applications
to the future mobile ad hoc networks (MANETs) with
different delay requirements. This paper extends the
conventional two-hop relay and proposes a general
group-based two-hop relay algorithm with packet
redundancy. In such an algorithm with packet redundancy
limit $f$ and group size $g$ (2HR-$ (f, g)$ for short),
each packet is delivered to at most $f$ distinct relay
nodes and can be accepted by its destination if it is a
fresh packet to the destination and also it is among g
packets of the group the destination is currently
requesting. The 2HR-$ (f, g)$ covers the available
two-hop relay protocols as special cases, like the
in-order reception ones $ (f \geq 1, g = 1)$, the
out-of-order reception ones with redundancy $ (f > 1, g
= \infty)$, or without redundancy $ (f = 1, g =
\infty)$. A Markov chain-based theoretical framework is
further developed to analyze how the mean value and
variance of packet delivery delay vary with the
parameters $f$ and $g$, where the important medium
contention, interference, and traffic contention issues
are carefully incorporated into the analysis. Extensive
simulation and theoretical results are provided to
illustrate the performance of the 2HR-$ (f, g)$
algorithm and the corresponding theoretical framework,
which indicate that the theoretical framework is
efficient in delay analysis and the new 2HR-$ (f, g)$
algorithm actually enables both the mean value and
variance of packet delivery delay to be flexibly
controlled in a large region.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2012:PMW,
author = "Ziqiu Yun and Xiaole Bai and Dong Xuan and Weijia Jia
and Wei Zhao",
title = "Pattern mutation in wireless sensor deployment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1964--1977",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2199515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:41:48 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the optimal deployment pattern
problem in wireless sensor networks (WSNs). We propose
a new set of patterns, particularly when sensors'
communication range $ (r c) $ is relatively small
compared to their sensing range $ (r s) $, and prove
their optimality. In this study, we discover an
interesting phenomenon --- pattern mutation. To the
best of our knowledge, this is the first time that
mutation in pattern deployments has been discovered.
This phenomenon, which contradicts the conjecture
presented in a previous work that there exists a
universal elemental pattern among optimal pattern
deployment, significantly furthers our understanding of
optimal patterns in WSNs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2012:GEE,
author = "Tao Li and Samuel S. Wu and Shigang Chen and Mark C.
K. Yang",
title = "Generalized energy-efficient algorithms for the {RFID}
estimation problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1978--1990",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2192448",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:41:48 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) has been gaining
popularity for inventory control, object tracking, and
supply-chain management in warehouses, retail stores,
hospitals, etc. Periodically and automatically
estimating the number of RFID tags deployed in a large
area has many important applications in inventory
management and theft detection. Prior works focus on
designing time-efficient algorithms that can estimate
tens of thousands of tags in seconds. We observe that
for an RFID reader to access tags in a large area,
active tags are likely to be used due to their longer
operational ranges. These tags are battery-powered and
use their own energy for information transmission.
However, recharging batteries for tens of thousands of
tags is laborious. Hence, conserving energy for active
tags becomes critical. Some prior works have studied
how to reduce energy expenditure of an RFID reader when
it reads tag IDs. We study how to reduce the amount of
energy consumed by active tags during the process of
estimating the number of tags in a system. We design
two energy-efficient probabilistic estimation
algorithms that iteratively refine a control parameter
to optimize the information carried in transmissions
from tags, such that both the number and the size of
transmissions are reduced. These algorithms can also
take time efficiency into consideration. By tuning a
contention probability parameter $ \omega $, the new
algorithms can make tradeoff between energy cost and
estimation time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kasbekar:2012:GCV,
author = "Gaurav S. Kasbekar and Yigal Bejerano and Saswati
Sarkar",
title = "Generic coverage verification without location
information using dimension reduction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "1991--2004",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190620",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:41:48 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks (WSNs) have recently emerged
as a key sensing technology with diverse civilian and
military applications. In these networks, a large
number of small sensors or nodes perform distributed
sensing of a target field. Each node is capable of
sensing events of interest within its sensing range and
communicating with neighboring nodes. The target field
is said to be $k$-covered if every point in it is
within the sensing range of at least $k$ sensors, where
$k$ is any positive integer. We present a comprehensive
framework for verifying $k$-coverage of a
$d$-dimensional target field for an arbitrary positive
integer $k$ and $ d \in \{ 1, 2, 3 \} $. Our framework
uses a divide-and-conquer approach based on the
technique of dimension reduction, in which the
$k$-coverage verification problem in $d$ dimensions is
reduced to a number of coverage verification problems
in $ (d - 1)$ dimensions, which are then recursively
solved. Our framework leads to a distributed
polynomial-time coverage verification algorithm that
does not require knowledge of the locations of nodes or
directional information, which is difficult to obtain
in WSNs. Each node can execute the algorithm using only
the distances between adjacent nodes within its
transmission range and their sensing radii. We
analytically prove that the scheme detects a coverage
hole if and only if the target field has a coverage
hole.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kone:2012:EOS,
author = "Vinod Kone and Lei Yang and Xue Yang and Ben Y. Zhao
and Haitao Zheng",
title = "The effectiveness of opportunistic spectrum access: a
measurement study",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "6",
pages = "2005--2016",
month = dec,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191571",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 12 08:41:48 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Dynamic spectrum access networks are designed to allow
today's bandwidth-hungry ``secondary devices'' to share
spectrum allocated to legacy devices, or ``primary
users.'' The success of this wireless communication
model relies on the availability of unused spectrum and
the ability of secondary devices to utilize spectrum
without disrupting transmissions of primary users.
While recent measurement studies have shown that there
is sufficient underutilized spectrum available, little
is known about whether secondary devices can
efficiently make use of available spectrum while
minimizing disruptions to primary users. In this paper,
we present the first comprehensive study on the
presence of ``usable'' spectrum in opportunistic
spectrum access systems, and whether sufficient
spectrum can be extracted by secondary devices to
support traditional networking applications. We use for
our study fine-grain usage traces of a wide spectrum
range (20 MHz-6 GHz) taken at four locations in
Germany, the Netherlands, and Santa Barbara, CA. Our
study shows that on average, 54\% of spectrum is never
used and 26\% is only partially used. Surprisingly, in
this 26\% of partially used spectrum, secondary devices
can utilize very little spectrum using conservative
access policies to minimize interference with primary
users. Even assuming an optimal access scheme and
extensive statistical knowledge of primary-user access
patterns, a user can only extract between 20\%-30\% of
the total available spectrum. To provide better
spectrum availability, we propose frequency bundling,
where secondary devices build reliable channels by
combining multiple unreliable frequencies into virtual
frequency bundles. Analyzing our traces, we find that
there is little correlation of spectrum availability
across channels, and that bundling random channels
together can provide sustained periods of reliable
transmission with only short interruptions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tariq:2013:ATD,
author = "Mukarram Bin Tariq and Kaushik Bhandankar and Vytautas
Valancius and Amgad Zeitoun and Nick Feamster and
Mostafa Ammar",
title = "Answering: techniques and deployment experience",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "1--13",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230448",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designers of content distribution networks (CDNs)
often need to determine how changes to infrastructure
deployment and configuration affect service response
times when they deploy a new data center, change ISP
peering, or change the mapping of clients to servers.
Today, the designers use coarse, back-of-the-envelope
calculations or costly field deployments; they need
better ways to evaluate the effects of such
hypothetical ``what-if'' questions before the actual
deployments. This paper presents What-If Scenario
Evaluator (WISE), a tool that predicts the effects of
possible configuration and deployment changes in
content distribution networks. WISE makes three
contributions: (1) an algorithm that uses traces from
existing deployments to learn causality among factors
that affect service response-time distributions; (2) an
algorithm that uses the learned causal structure to
estimate a dataset that is representative of the
hypothetical scenario that a designer may wish to
evaluate, and uses these datasets to predict
hypothetical response-time distributions; (3) a
scenario specification language that allows a network
designer to easily express hypothetical deployment
scenarios without being cognizant of the dependencies
between variables that affect service response times.
Our evaluation, both in a controlled setting and in a
real-world field deployment on a large, global CDN,
shows that WISE can quickly and accurately predict
service response-time distributions for many practical
what-if scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2013:CAA,
author = "Yunyue Lin and Qishi Wu",
title = "Complexity analysis and algorithm design for advance
bandwidth scheduling in dedicated networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "14--27",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2189127",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An increasing number of high-performance networks
provision dedicated channels through circuit switching
or MPLS/GMPLS techniques to support large data
transfer. The link bandwidths in such networks are
typically shared by multiple users through advance
reservation, resulting in varying bandwidth
availability in future time. Developing efficient
scheduling algorithms for advance bandwidth reservation
has become a critical task to improve the utilization
of network resources and meet the transport
requirements of application users. We consider an
exhaustive combination of different path and bandwidth
constraints and formulate four types of advance
bandwidth scheduling problems, with the same objective
to minimize the data transfer end time for a given
transfer request with a prespecified data size: (1)
fixed path with fixed bandwidth (FPFB); (2) fixed path
with variable bandwidth (FPVB); (3) variable path with
fixed bandwidth (VPFB); and (4) variable path with
variable bandwidth (VPVB). For VPFB and VPVB, we
further consider two subcases where the path switching
delay is negligible or nonnegligible. We propose an
optimal algorithm for each of these scheduling problems
except for FPVB and VPVB with nonnegligible path
switching delay, which are proven to be NP-complete and
nonapproximable, and then tackled by heuristics. The
performance superiority of these heuristics is verified
by extensive experimental results in a large set of
simulated networks in comparison to optimal and greedy
strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2013:DDN,
author = "Youngmi Jin and George Kesidis and Ju Wook Jang",
title = "Diffusion dynamics of network technologies with
bounded rational users: aspiration-based learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "28--40",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2189891",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, economic models have been proposed to study
adoption dynamics of entrant and incumbent technologies
motivated by the need for new network architectures to
complement the current Internet. We propose new models
of adoption dynamics of entrant and incumbent
technologies among bounded rational users who choose a
satisfying strategy rather than an optimal strategy
based on aspiration-based learning. Two models of
adoption dynamics are proposed according to the
characteristics of aspiration level. The impacts of
switching cost, the benefit from entrant and incumbent
technologies, and the initial aspiration level on the
adoption dynamics are investigated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neely:2013:DBN,
author = "Michael J. Neely",
title = "Delay-based network utility maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "41--54",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191157",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is well known that max-weight policies based on a
queue backlog index can be used to stabilize stochastic
networks, and that similar stability results hold if a
delay index is used. Using Lyapunov optimization, we
extend this analysis to design a utility maximizing
algorithm that uses explicit delay information from the
head-of-line packet at each user. The resulting policy
is shown to ensure deterministic worst-case delay
guarantees and to yield a throughput utility that
differs from the optimally fair value by an amount that
is inversely proportional to the delay guarantee. Our
results hold for a general class of 1-hop networks,
including packet switches and multiuser wireless
systems with time-varying reliability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Manfredi:2013:DCL,
author = "Sabato Manfredi and Francesco Oliviero and Simon
Pietro Romano",
title = "A distributed control law for load balancing in
content delivery networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "55--68",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190297",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we face the challenging issue of
defining and implementing an effective law for load
balancing in Content Delivery Networks (CDNs). We base
our proposal on a formal study of a CDN system, carried
out through the exploitation of a fluid flow model
characterization of the network of servers. Starting
from such characterization, we derive and prove a lemma
about the network queues equilibrium. This result is
then leveraged in order to devise a novel distributed
and time-continuous algorithm for load balancing, which
is also reformulated in a time-discrete version. The
discrete formulation of the proposed balancing law is
eventually discussed in terms of its actual
implementation in a real-world scenario. Finally, the
overall approach is validated by means of
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vasudevan:2013:EAN,
author = "Sudarshan Vasudevan and Micah Adler and Dennis Goeckel
and Don Towsley",
title = "Efficient algorithms for neighbor discovery in
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "69--83",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2189892",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Neighbor discovery is an important first step in the
initialization of a wireless ad hoc network. In this
paper, we design and analyze several algorithms for
neighbor discovery in wireless networks. Starting with
a single-hop wireless network of $n$ nodes, we propose
a $ \Theta (n \ln n)$ ALOHA-like neighbor discovery
algorithm when nodes cannot detect collisions, and an
order-optimal $ \Theta (n)$ receiver feedback-based
algorithm when nodes can detect collisions. Our
algorithms neither require nodes to have a priori
estimates of the number of neighbors nor
synchronization between nodes. Our algorithms allow
nodes to begin execution at different time instants and
to terminate neighbor discovery upon discovering all
their neighbors. We finally show that receiver feedback
can be used to achieve a $ \Theta (n)$ running time,
even when nodes cannot detect collisions. We then
analyze neighbor discovery in a general multihop
setting. We establish an upper bound of $ O (\Delta \ln
n)$ on the running time of the ALOHA-like algorithm,
where $ \Delta $ denotes the maximum node degree in the
network and $n$ the total number of nodes. We also
establish a lower bound of $ \Omega (\Delta + \ln n)$
on the running time of any randomized neighbor
discovery algorithm. Our result thus implies that the
ALOHA-like algorithm is at most a factor $ \min
(\Delta, \ln n)$ worse than optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2013:SGW,
author = "Fangwen Fu and Ulas C. Kozat",
title = "Stochastic game for wireless network virtualization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "84--97",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "We propose a new framework for wireless network
virtualization. In this framework, service providers
(SPs) and the network operator (NO) are decoupled from
each other: The NO is solely responsible for spectrum
management, and SPs are responsible for
quality-of-service (QoS) management for their own
users. SPs compete for the shared wireless resources to
satisfy their distinct service objectives and
constraints. We model the dynamic interactions among
SPs and the NO as a stochastic game. SPs bid for the
resources via dynamically announcing their value
functions. The game is regulated by the NO through: (1)
sum-utility optimization under rate region constraints;
(2) enforcement of Vickrey-Clarke-Groves (VCG)
mechanism for pricing the instantaneous rate
consumption; and (3) declaration of conjectured prices
for future resource consumption. We prove that there
exists one Nash equilibrium in the conjectural prices
that is efficient, i.e., the sum-utility is maximized.
Thus, the NO has the incentive to compute the
equilibrium point and feedback to SPs. Given the
conjectural prices and the VCG mechanism, we also show
that SPs must reveal their truthful value functions at
each step to maximize their long-term utilities. As
another major contribution, we develop an online
learning algorithm that allows the SPs to update the
value functions and the NO to update the conjectural
prices iteratively. Thus, the proposed framework can
deal with unknown dynamics in traffic characteristics
and channel conditions. We present simulation results
to show the convergence to the Nash equilibrium prices
under various dynamic traffic and channel conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Song:2013:AAB,
author = "Haoyu Song and Jonathan S. Turner",
title = "{ABC}: adaptive binary cuttings for multidimensional
packet classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "98--109",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2190519",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Decision tree-based packet classification algorithms
are easy to implement and allow the tradeoff between
storage and throughput. However, the memory consumption
of these algorithms remains quite high when high
throughput is required. The Adaptive Binary Cuttings
(ABC) algorithm exploits another degree of freedom to
make the decision tree adapt to the geometric
distribution of the filters. The three variations of
the adaptive cutting procedure produce a set of
different-sized cuts at each decision step, with the
goal to balance the distribution of filters and to
reduce the filter duplication effect. The ABC algorithm
uses stronger and more straightforward criteria for
decision tree construction. Coupled with an efficient
node encoding scheme, it enables a smaller, shorter,
and well-balanced decision tree. The hardware-oriented
implementation of each variation is proposed and
evaluated extensively to demonstrate its scalability
and sensitivity to different configurations. The
results show that the ABC algorithm significantly
outperforms the other decision tree-based algorithms.
It can sustain more than 10-Gb/s throughput and is the
only algorithm among the existing well-known packet
classification algorithms that can compete with TCAMs
in terms of the storage efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2013:UMF,
author = "Juan Liu and Wei Chen and Ying Jun Zhang and Zhigang
Cao",
title = "A utility maximization framework for fair and
efficient multicasting in multicarrier wireless
cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "110--120",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2192747",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multicast/broadcast is regarded as an efficient
technique for wireless cellular networks to transmit a
large volume of common data to multiple mobile users
simultaneously. To guarantee the quality of service for
each mobile user in such single-hop multicasting, the
base-station transmitter usually adapts its data rate
to the worst channel condition among all users in a
multicast group. On one hand, increasing the number of
users in a multicast group leads to a more efficient
utilization of spectrum bandwidth, as users in the same
group can be served together. On the other hand, too
many users in a group may lead to unacceptably low data
rate at which the base station can transmit. Hence, a
natural question that arises is how to efficiently and
fairly transmit to a large number of users requiring
the same message. This paper endeavors to answer this
question by studying the problem of multicasting over
multicarriers in wireless orthogonal frequency division
multiplexing (OFDM) cellular systems. Using a unified
utility maximization framework, we investigate this
problem in two typical scenarios: namely, when users
experience roughly equal path losses and when they
experience different path losses, respectively. Through
theoretical analysis, we obtain optimal multicast
schemes satisfying various throughput-fairness
requirements in these two cases. In particular, we show
that the conventional multicast scheme is optimal in
the equal-path-loss case regardless of the utility
function adopted. When users experience different path
losses, the group multicast scheme, which divides the
users almost equally into many multicast groups and
multicasts to different groups of users over
nonoverlapping subcarriers, is optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2013:AEF,
author = "Ting Zhu and Ziguo Zhong and Tian He and Zhi-Li
Zhang",
title = "Achieving efficient flooding by utilizing link
correlation in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "121--134",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2197689",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although existing flooding protocols can provide
efficient and reliable communication in wireless sensor
networks on some level, further performance improvement
has been hampered by the assumption of link
independence, which requires costly acknowledgments
(ACKs) from every receiver. In this paper, we present
collective flooding (CF), which exploits the link
correlation to achieve flooding reliability using the
concept of collective ACKs. CF requires only 1-hop
information at each node, making the design highly
distributed and scalable with low complexity. We
evaluate CF extensively in real-world settings, using
three different types of testbeds: a single-hop network
with 20 MICAz nodes, a multihop network with 37 nodes,
and a linear outdoor network with 48 nodes along a
326-m-long bridge. System evaluation and extensive
simulation show that CF achieves the same reliability
as state-of-the-art solutions while reducing the total
number of packet transmission and the dissemination
delay by 30\%-50\% and 35\%-50\%, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2013:RWG,
author = "Yanhua Li and Zhi-Li Zhang",
title = "Random walks and {Green}'s function on digraphs: a
framework for estimating wireless transmission costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "135--148",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191158",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Various applications in wireless networks, such as
routing and query processing, can be formulated as
random walks on graphs. Many results have been obtained
for such applications by utilizing the theory of random
walks (or spectral graph theory), which is mostly
developed for undirected graphs. However, this
formalism neglects the fact that the underlying
(wireless) networks in practice contain asymmetric
links, which are best characterized by directed graphs
(digraphs). Therefore, random walk on digraphs is a
more appropriate model to consider for such networks.
In this paper, by generalizing the random walk theory
(or spectral graph theory) that has been primarily
developed for undirected graphs to digraphs, we show
how various transmission costs in wireless networks can
be formulated in terms of hitting times and cover times
of random walks on digraphs. Using these results, we
develop a unified theoretical framework for estimating
various transmission costs in wireless networks. Our
framework can be applied to random walk query
processing strategy and the three routing
paradigms--best path routing, opportunistic routing,
and stateless routing--to which nearly all existing
routing protocols belong. Extensive simulations
demonstrate that the proposed digraph-based analytical
model can achieve more accurate transmission cost
estimation over existing methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deng:2013:FPH,
author = "Xi Deng and Yuanyuan Yang and Sangjin Hong",
title = "A flexible platform for hardware-aware network
experiments and a case study on wireless network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "149--161",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191156",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present the design and
implementation of a general, flexible, hardware-aware
network platform that takes hardware processing
behavior into consideration to accurately evaluate
network performance. The platform adopts a
network-hardware co-simulation approach in which the
NS-2 network simulator supervises the network-wide
traffic flow and the SystemC hardware simulator
simulates the underlying hard-ware processing in
network nodes. In addition, as a case study, we
implemented wireless all-to-all broadcasting with
network coding on the platform. We analyze the hardware
processing behavior during the algorithm execution and
evaluate the overall performance of the algorithm. Our
experimental results demonstrate that hardware
processing can have a significant impact on the
algorithm performance and hence should be taken into
consideration in the algorithm design. We expect that
this hardware-aware platform will become a very useful
tool for more accurate network simulations and more
efficient design space exploration of
processing-intensive applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2013:EDS,
author = "Miao Wang and Lisong Xu and Byrav Ramamurthy",
title = "Exploring the design space of multichannel
peer-to-peer live video streaming systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "162--175",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2194165",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most of the commercial peer-to-peer (P2P) video
streaming deployments support hundreds of channels and
are referred to as multichannel systems. Recent
research studies have proposed specific protocols to
improve the streaming quality for all channels by
enabling cross-channel cooperation among multiple
channels. In this paper, we focus on the following
fundamental problems in designing cooperating
multichannel systems: (1) what are the general
characteristics of existing and potential designs? and
(2) under what circumstances should a particular design
be used to achieve the desired streaming quality with
the lowest implementation complexity? To answer the
first question, we propose simple models based on
linear programming and network-flow graphs for three
general designs, namely Naive Bandwidth allocation
Approach (NBA), Passive Channel-aware bandwidth
allocation Approach (PCA), and Active Channel-aware
bandwidth allocation Approach (ACA), which provide
insight into understanding the key characteristics of
cross-channel resource sharing. For the second
question, we first develop closed-form results for
two-channel systems. Then, we use extensive numerical
simulations to compare the three designs for various
peer population distributions, upload bandwidth
distributions, and channel structures. Our analytical
and simulation results show that: (1) the NBA design
can rarely achieve the desired streaming quality in
general cases; (2) the PCA design can achieve the same
performance as the ACA design in general cases; and (3)
the ACA design should be used for special
applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chun:2013:SST,
author = "Sung Hyun Chun and Richard J. La",
title = "Secondary spectrum trading: auction-based framework
for spectrum allocation and profit sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "176--189",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2191418",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, dynamic spectrum sharing has been gaining
interest as a potential solution to scarcity of
available spectrum. We investigate the problem of
designing a secondary spectrum-trading market when
there are multiple sellers and multiple buyers and
propose a general framework for the trading market
based on an auction mechanism. To this end, we first
introduce a new optimal auction mechanism, called the
generalized Branco's mechanism (GBM). The GBM, which is
both incentive-compatible and individually rational, is
used to determine the assigned frequency bands and
prices for them. Second, we assume that buyers of the
spectrum are selfish and model their interaction as a
noncooperative game. Using this model, we prove that
when the sellers employ the GBM to vend their frequency
bands, they can guarantee themselves the largest
expected profits by selling their frequency bands
jointly. Third, based on the previous finding, we model
the interaction among the sellers as a cooperative game
and demonstrate that, for any fixed strategies of the
buyers, the core of the cooperative game is nonempty.
This suggests that there exists a way for the sellers
to share the profits from the joint sale of the
spectrum so that no subset of sellers will find it
beneficial to vend their frequency bands separately
without the remaining sellers. Finally, we propose a
profit-sharing scheme that can achieve any expected
profit vector in the nonempty core of the cooperative
game while satisfying two desirable properties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Young:2013:TPC,
author = "Maxwell Young and Aniket Kate and Ian Goldberg and
Martin Karsten",
title = "Towards practical communication in
{Byzantine}-resistant {DHTs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "190--203",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2195729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There are several analytical results on distributed
hash tables (DHTs) that can tolerate Byzantine faults.
Unfortunately, in such systems, operations such as data
retrieval and message sending incur significant
communication costs. For example, a simple scheme used
in many Byzantine fault-tolerant DHT constructions of n
nodes requires O (log$^3$ n ) messages; this is likely
impractical for real-world applications. The previous
best known message complexity is O (log$^2$ n ) in
expectation. However, the corresponding protocol
suffers from prohibitive costs owing to hidden
constants in the asymptotic notation and setup costs.
In this paper, we focus on reducing the communication
costs against a computationally bounded adversary. We
employ threshold cryptography and distributed key
generation to define two protocols, both of which are
more efficient than existing solutions. In comparison,
our first protocol is deterministic with O (log$^2$ n )
message complexity, and our second protocol is
randomized with expected O (log n ) message complexity.
Furthermore, both the hidden constants and setup costs
for our protocols are small, and no trusted third party
is required. Finally, we present results from
microbenchmarks conducted over PlanetLab showing that
our protocols are practical for deployment under
significant levels of churn and adversarial behavior.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2013:SRB,
author = "Yong He and Jie Sun and Xiaojun Ma and Athanasios V.
Vasilakos and Ruixi Yuan and Weibo Gong",
title = "Semi-random backoff: towards resource reservation for
channel access in wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "204--217",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2202323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a semi-random backoff (SRB) method
that enables resource reservation in contention-based
wireless LANs. The proposed SRB is fundamentally
different from traditional random backoff methods
because it provides an easy migration path from random
backoffs to deterministic slot assignments. The central
idea of the SRB is for the wireless station to set its
backoff counter to a deterministic value upon a
successful packet transmission. This deterministic
value will allow the station to reuse the time-slot in
consecutive backoff cycles. When multiple stations with
successful packet transmissions reuse their respective
time-slots, the collision probability is reduced, and
the channel achieves the equivalence of resource
reservation. In case of a failed packet transmission, a
station will revert to the standard random backoff
method and probe for a new available time-slot. The
proposed SRB method can be readily applied to both
802.11 DCF and 802.11e EDCA networks with minimum
modification to the existing DCF/EDCA implementations.
Theoretical analysis and simulation results validate
the superior performance of the SRB for small-scale and
heavily loaded wireless LANs. When combined with an
adaptive mechanism and a persistent backoff process,
SRB can also be effective for large-scale and lightly
loaded wireless networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ren:2013:ESS,
author = "Shaolei Ren and Jaeok Park and Mihaela {Van Der
Schaar}",
title = "Entry and spectrum sharing scheme selection in
femtocell communications markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "218--232",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2198073",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Focusing on a femtocell communications market, we
study the entrant network service provider's (NSP's)
long-term decision: whether to enter the market and
which spectrum sharing technology to select to maximize
its profit. This long-term decision is closely related
to the entrant's pricing strategy and the users'
aggregate demand, which we model as medium-term and
short-term decisions, respectively. We consider two
markets, one with no incumbent and the other with one
incumbent. For both markets, we show the existence and
uniqueness of an equilibrium point in the user
subscription dynamics and provide a sufficient
condition for the convergence of the dynamics. For the
market with no incumbent, we derive upper and lower
bounds on the optimal price and market share that
maximize the entrant's revenue, based on which the
entrant selects an available technology to maximize its
long-term profit. For the market with one incumbent, we
model competition between the two NSPs as a
noncooperative game, in which the incumbent and the
entrant choose their market shares independently, and
provide a sufficient condition that guarantees the
existence of at least one pure Nash equilibrium.
Finally, we formalize the problem of entry and
spectrum-sharing scheme selection for the entrant and
provide numerical results to complement our analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2013:RAP,
author = "Yipeng Zhou and Tom Z. J. Fu and Dah Ming Chiu",
title = "On replication algorithm in {P2P VoD}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "233--243",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2196444",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional video-on-demand (VoD) systems rely purely
on servers to stream video content to clients, which
does not scale. In recent years, peer-to-peer assisted
VoD (P2P VoD) has proven to be practical and effective.
In P2P VoD, each peer contributes some storage to store
videos (or segments of videos) to help the video
server. Assuming peers have sufficient bandwidth for
the given video playback rate, a fundamental question
is what is the relationship between the storage
capacity (at each peer), the number of videos, the
number of peers, and the resultant off-loading of video
server bandwidth. In this paper, we use a simple
statistical model to derive this relationship. We
propose and analyze a generic replication algorithm
Random with Load Balancing (RLB) that balances the
service to all movies for both deterministic and random
(but stationary) demand models and both homogeneous and
heterogeneous peers (in upload bandwidth). We use
simulation to validate our results for sensitivity
analysis and for comparisons to other popular
replication algorithms. This study leads to several
fundamental insights for P2P VoD system design in
practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Athanasopoulou:2013:BPB,
author = "Eleftheria Athanasopoulou and Loc X. Bui and Tianxiong
Ji and R. Srikant and Alexander Stolyar",
title = "Back-pressure-based packet-by-packet adaptive routing
in communication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "244--257",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2195503",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Back-pressure-based adaptive routing algorithms where
each packet is routed along a possibly different path
have been extensively studied in the literature.
However, such algorithms typically result in poor delay
performance and involve high implementation complexity.
In this paper, we develop a new adaptive routing
algorithm built upon the widely studied backpressure
algorithm. We decouple the routing and scheduling
components of the algorithm by designing a
probabilistic routing table that is used to route
packets to per-destination queues. The scheduling
decisions in the case of wireless networks are made
using counters called shadow queues. The results are
also extended to the case of networks that employ
simple forms of network coding. In that case, our
algorithm provides a low-complexity solution to
optimally exploit the routing-coding tradeoff.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ayesta:2013:SRE,
author = "Urtzi Ayesta and Martin Erausquin and Matthieu
Jonckheere and Ina Maria Verloop",
title = "Scheduling in a random environment: stability and
asymptotic optimality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "258--271",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2199764",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the scheduling of a common resource
between several concurrent users when the feasible
transmission rate of each user varies randomly over
time. Time is slotted, and users arrive and depart upon
service completion. This may model, for example, the
flow-level behavior of end-users in a narrowband HDR
wireless channel (CDMA 1xEV-DO). As performance
criteria, we consider the stability of the system and
the mean delay experienced by the users. Given the
complexity of the problem, we investigate the
fluid-scaled system, which allows to obtain important
results and insights for the original system: (1)We
characterize for a large class of scheduling policies
the stability conditions and identify a set of maximum
stable policies, giving in each time-slot preference to
users being in their best possible channel condition.
We find in particular that many opportunistic
scheduling policies like Score-Based, Proportionally
Best, or Potential Improvement are stable under the
maximum stability conditions, whereas the opportunistic
scheduler Relative-Best or the $ c \mu $-rule are not.
(2) We show that choosing the right tie-breaking rule
is crucial for the performance (e.g., average delay) as
perceived by a user. We prove that a policy is
asymptotically optimal if it is maximum stable and the
tie-breaking rule gives priority to the user with the
highest departure probability. We will refer to such
tie-breaking rule as myopic. (3) We derive the growth
rates of the number of users in the system in overload
settings under various policies, which give additional
insights on the performance. (4) We conclude that
simple priority-index policies with the myopic
tie-breaking rule are stable and asymptotically
optimal. All our findings are validated with extensive
numerical experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Woo:2013:EIM,
author = "Shinuk Woo and Hwangnam Kim",
title = "An empirical interference modeling for link
reliability assessment in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "272--285",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2197864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In recent years, it has been widely believed in the
community that the link reliability is strongly related
to received signal strength indicator (RSSI) [or
signal-to-interference-plus-noise ratio (SINR)] and
external interference makes it unpredictable, which is
different from the previous understanding that there is
no tight relationship between the link reliability and
RSSI (or SINR), but multipath fading causes the
unpredictability. However, both cannot fully explain
why the unpredictability appears in the link state. In
this paper, we unravel the following questions: (1)
What causes frame losses that are directly related to
intermediate link states? (2) Is RSSI or SINR a right
criterion to represent the link reliability? (3) Is
there a better measure to assess the link reliability?
We first configured a testbed for performing a real
measurement study to identify the causes of frame
losses, and observed that link reliability depends on
an intraframe SINR distribution, not a single value of
RSSI (or SINR). We also learned that an RSSI value is
not always a good indicator to estimate the link state.
We then conducted a further investigation on the
intraframe SINR distribution and the relationship
between the SINR and link reliability with the ns-2
simulator. Based on these results, we finally propose
an interference modeling framework for estimating link
states in the presence of wireless interferences. We
envision that the framework can be used for developing
link-aware protocols to achieve their optimal
performance in a hostile wireless environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Radunovic:2013:DCC,
author = "Bozidar Radunovic and Alexandre Proutiere",
title = "On downlink capacity of cellular data networks with
{WLAN\slash WPAN} relays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "286--296",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2198072",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the downlink of a cellular network
supporting data traffic in which each user is equipped
with the same type of IEEE 802.11-like WLAN or WPAN
interface used to relay packets to further users. We
are interested in the design guidelines for such
networks and how much capacity improvements the
additional relay layer can bring. A first objective is
to provide a scheduling/relay strategy that maximizes
the network capacity. Using theoretical analysis,
numerical evaluation, and simulations, we find that
when the number of active users is large, the
capacity-achieving strategy divides the cell into two
areas: one closer to the base station where the relay
layer is always saturated and some nodes receive
traffic through both direct and relay links, and the
farther one where the relay is never saturated and the
direct traffic is almost nonexistent. We also show that
it is approximately optimal to use fixed relay link
lengths, and we derive this length. We show that the
obtained capacity is independent of the cell size
(unlike in traditional cellular networks). Based on our
findings, we propose simple decentralized routing and
scheduling protocols. We show that in a fully saturated
network our optimized protocol substantially improves
performance over the protocols that use naive
relay-only or direct-only policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dan:2013:CDP,
author = "Gy{\"o}rgy D{\'a}n and Niklas Carlsson",
title = "Centralized and distributed protocols for
tracker-based dynamic swarm management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "297--310",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2198491",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With BitTorrent, efficient peer upload utilization is
achieved by splitting contents into many small pieces,
each of which may be downloaded from different peers
within the same swarm. Unfortunately, piece and
bandwidth availability may cause the file-sharing
efficiency to degrade in small swarms with few
participating peers. Using extensive measurements, we
identified hundreds of thousands of torrents with
several small swarms for which reallocating peers among
swarms and/or modifying the peer behavior could
significantly improve the system performance. Motivated
by this observation, we propose a centralized and a
distributed protocol for dynamic swarm management. The
centralized protocol (CSM) manages the swarms of peers
at minimal tracker overhead. The distributed protocol
(DSM) manages the swarms of peers while ensuring load
fairness among the trackers. Both protocols achieve
their performance improvements by identifying and
merging small swarms and allow load sharing for large
torrents. Our evaluations are based on measurement data
collected during eight days from over 700 trackers
worldwide, which collectively maintain state
information about 2.8 million unique torrents. We find
that CSM and DSM can achieve most of the performance
gains of dynamic swarm management. These gains are
estimated to be up to 40\% on average for small
torrents.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2013:LWS,
author = "Jizhong Zhao and Wei Xi and Yuan He and Yunhao Liu and
Xiang-Yang Li and Lufeng Mo and Zheng Yang",
title = "Localization of wireless sensor networks in the wild:
pursuit of ranging quality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "311--323",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2200906",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Localization is a fundamental issue of wireless sensor
networks that has been extensively studied in the
literature. Our real-world experience from GreenOrbs, a
sensor network system deployed in a forest, shows that
localization in the wild remains very challenging due
to various interfering factors. In this paper, we
propose CDL, a Combined and Differentiated Localization
approach for localization that exploits the strength of
range-free approaches and range-based approaches using
received signal strength indicator (RSSI). A critical
observation is that ranging quality greatly impacts the
overall localization accuracy. To achieve a better
ranging quality, our method CDL incorporates
virtual-hop localization, local filtration, and
ranging-quality aware calibration. We have implemented
and evaluated CDL by extensive real-world experiments
in GreenOrbs and large-scale simulations. Our
experimental and simulation results demonstrate that
CDL outperforms current state-of-art localization
approaches with a more accurate and consistent
performance. For example, the average location error
using CDL in GreenOrbs system is 2.9 m, while the
previous best method SISR has an average error of 4.6
m.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koksal:2013:CWN,
author = "C. Emre Koksal and Ozgur Ercetin and Yunus Sarikaya",
title = "Control of wireless networks with secrecy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "324--337",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2197410",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of cross-layer resource
allocation in time-varying cellular wireless networks
and incorporate information theoretic secrecy as a
quality-of-service constraint. Specifically, each node
in the network injects two types of traffic, private
and open, at rates chosen in order to maximize a global
utility function, subject to network stability and
secrecy constraints. The secrecy constraint enforces an
arbitrarily low mutual information leakage from the
source to every node in the network, except for the
sink node. We first obtain the achievable rate region
for the problem for single- and multiuser systems
assuming that the nodes have full channel state
information (CSI) of their neighbors. Then, we provide
a joint flow control, scheduling, and private encoding
scheme, which does not rely on the knowledge of the
prior distribution of the gain of any channel. We prove
that our scheme achieves a utility arbitrarily close to
the maximum achievable utility. Numerical experiments
are performed to verify the analytical results and to
show the efficacy of the dynamic control algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2013:IIC,
author = "Haitao Wu and Zhenqian Feng and Chuanxiong Guo and
Yongguang Zhang",
title = "{ICTCP}: incast congestion control for {TCP} in
data-center networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "345--358",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2197411",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Transport Control Protocol (TCP) incast congestion
happens in high-bandwidth and low-latency networks when
multiple synchronized servers send data to the same
receiver in parallel. For many important data-center
applications such as MapReduce and Search, this
many-to-one traffic pattern is common. Hence TCP incast
congestion may severely degrade their performances,
e.g., by increasing response time. In this paper, we
study TCP incast in detail by focusing on the
relationships between TCP throughput, round-trip time
(RTT), and receive window. Unlike previous approaches,
which mitigate the impact of TCP incast congestion by
using a fine-grained timeout value, our idea is to
design an Incast congestion Control for TCP (ICTCP)
scheme on the receiver side. In particular, our method
adjusts the TCP receive window proactively before
packet loss occurs. The implementation and experiments
in our testbed demonstrate that we achieve almost zero
timeouts and high goodput for TCP incast.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lorenzo:2013:CAN,
author = "Beatriz Lorenzo and Savo Glisic",
title = "Context-aware nanoscale modeling of multicast multihop
cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "359--372",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2199129",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a new approach to
optimization of multicast in multihop cellular
networks. We apply a hexagonal tessellation for inner
partitioning of the cell into smaller subcells of
radius r. Subcells may be several orders of magnitude
smaller than, e.g., microcells, resulting in what we
refer to as a nanoscale network model (NSNM), including
a special nanoscale channel model (NSCM) for this
application. For such tessellation, a spatial
interleaving SI MAC protocol is introduced for
context-aware interlink interference management. The
directed flooding routing protocol (DFRP) and
interflooding network coding (IFNC) are proposed for
such a network model including intercell flooding
coordination (ICFC) protocol to minimize the intercell
interference. By adjusting the radius of the subcell,
r, we obtain different hopping ranges that directly
affect the throughput, power consumption, and
interference. With r as the optimization parameter, in
this paper we jointly optimize scheduling, routing, and
power control to obtain the optimum tradeoff between
throughput, delay, and power consumption in multicast
cellular networks. A set of numerical results
demonstrates that the NSNM enables high-resolution
optimization of the system and an effective use of the
context awareness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Preciado:2013:MBS,
author = "Victor M. Preciado and Ali Jadbabaie",
title = "Moment-based spectral analysis of large-scale networks
using local structural information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "373--382",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2217152",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The eigenvalues of matrices representing the structure
of large-scale complex networks present a wide range of
applications, fromthe analysis of dynamical processes
taking place in the network to spectral techniques
aiming to rank the importance of nodes in the network.
A common approach to study the relationship between the
structure of a network and its eigenvalues is to use
synthetic random networks in which structural
properties of interest, such as degree distributions,
are prescribed. Although very common, synthetic models
present two major flaws: (1) These models are only
suitable to study a very limited range of structural
properties; and (2) they implicitly induce structural
properties that are not directly controlled and can
deceivingly influence the network eigenvalue spectrum.
In this paper, we propose an alternative approach to
overcome these limitations. Our approach is not based
on synthetic models. Instead, we use algebraic graph
theory and convex optimization to study how structural
properties influence the spectrum of eigenvalues of the
network. Using our approach, we can compute, with low
computational overhead, global spectral properties of a
network from its local structural properties. We
illustrate our approach by studying how structural
properties of online social networks influence their
eigenvalue spectra.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keys:2013:ISI,
author = "Ken Keys and Young Hyun and Matthew Luckie and Kim
Claffy",
title = "{Internet}-scale {IPv4} alias resolution with
{MIDAR}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "383--399",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2198887",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A critical step in creating accurate Internet topology
maps from traceroute data is mapping IP addresses to
routers, a process known as alias resolution. Recent
work in alias resolution inferred aliases based on
similarities in IP ID time series produced by different
IP addresses. We design, implement, and experiment with
a new tool that builds on these insights to scale to
Internet-scale topologies, i.e., millions of addresses,
with greater precision and sensitivity. MIDAR, our
Monotonic ID-Based Alias Resolution tool, provides an
extremely precise ID comparison test based on
monotonicity rather than proximity. MIDAR integrates
multiple probing methods, multiple vantage points, and
a novel sliding-window probe scheduling algorithm to
increase scalability to millions of IP addresses.
Experiments show that MIDAR's approach is effective at
minimizing the false positive rate sufficiently to
achieve a high positive predictive value at Internet
scale. We provide sample statistics from running MIDAR
on over 2 million addresses. We also validate MIDAR and
RadarGun against available ground truth and show that
MIDAR's results are significantly better than
RadarGun's. Tools such as MIDAR can enable longitudinal
study of the Internet's topological evolution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2013:TBE,
author = "Wei Cheng and Nan Zhang and Xiuzhen Cheng and Min Song
and Dechang Chen",
title = "Time-bounded essential localization for wireless
sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "400--412",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2200107",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In many practical applications of wireless sensor
networks, it is crucial to accomplish the localization
of sensors within a given time bound. We find that the
traditional definition of relative localization is
inappropriate for evaluating its actual overhead in
localization time. To address this issue, we define a
novel problem called essential localization and present
the first rigorous study on the essential
localizability of a wireless sensor network within a
given time bound. Additionally, we propose an efficient
distributed algorithm for time-bounded essential
localization over a sensor network and evaluate the
performance of the algorithm with analysis and
extensive simulation studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Metnani:2013:SFC,
author = "Ammar Metnani and Brigitte Jaumard",
title = "Stability of {FIPP} $p$-cycles under dynamic traffic
in {WDM} networks: dynamic traffic,failure-independent
path-protecting {(FIPP)} $p$-cycles,path
protection,shared bandwidth protection,stability of
protection structures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "413--425",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2200905",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Application opportunities associated with video,
voice, and data triple-play result in a dramatic demand
increase in metro transport networks, with traffic
patterns becoming increasingly dynamic and difficult to
predict. This is driving the need of core networks with
a high degree of flexibility and multigranularities to
carry traffic. We propose to investigate the question
of what this means in terms of dynamic protection
provisioning. In other words, we want to study how
stable are the protection structures under dynamic
traffic, i.e., how much and how often they need to be
updated in a dynamic survivable WDM network. While most
studies on the stability of protection structures have
been conducted on p -cycles and link shared protection,
we propose to investigate here the stability of
failure-independent path-protecting (FIPP) p -cycles
under dynamic traffic. For doing so, we design and
develop an original scalable mathematical model that we
solve using large-scale optimization tools. Numerical
results show that FIPP p -cycles are remarkably stable
under the evaluation of the number of required optical
bypass reconfigurations under dynamic traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2013:CCS,
author = "Xinyu Zhang and Kang G. Shin",
title = "Cooperative carrier signaling: harmonizing coexisting
{WPAN} and {WLAN} devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "426--439",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2200499",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The unlicensed ISM spectrum is getting crowded by
wireless local area network (WLAN) and wireless
personal area network (WPAN) users and devices.
Spectrum sharing within the same network of devices can
be arbitrated by existing MAC protocols, but the
coexistence between WPAN and WLAN (e.g., ZigBee and
WiFi) remains a challenging problem. The traditional
MAC protocols are ineffective in dealing with the
disparate transmit-power levels, asynchronous
time-slots, and incompatible PHY layers of such
heterogeneous networks. Recent measurement studies have
shown moderate-to-high WiFi traffic to severely impair
the performance of coexisting ZigBee. We propose a
novel mechanism, called cooperative carrier signaling
(CCS), that exploits the inherent cooperation among
ZigBee nodes to harmonize their coexistence with WiFi
WLANs. CCS employs a separate ZigBee node to emit a
carrier signal (busy tone) concurrently with the
desired ZigBee's data transmission, thereby enhancing
the ZigBee's visibility to WiFi. It employs an
innovative way to concurrently schedule a busy tone and
a data transmission without causing interference
between them. We have implemented and evaluated CCS on
the TinyOS/MICAz and GNURadio/USRP platforms. Our
extensive experimental evaluation has shown that CCS
reduces collision between ZigBee and WiFi by 50\% for
most cases, and by up to 90\% in the presence of a
high-level interference, all at negligible WiFi
performance loss.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2013:MIC,
author = "Xinbing Wang and Xiaojun Lin and Qingsi Wang and
Wentao Luan",
title = "Mobility increases the connectivity of wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "440--454",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2200260",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the connectivity for
large-scale clustered wireless sensor and ad hoc
networks. We study the effect of mobility on the
critical transmission range for asymptotic connectivity
in k -hop clustered networks and compare to existing
results on nonclustered stationary networks. By
introducing k -hop clustering, any packet from a
cluster member can reach a cluster head within k hops,
and thus the transmission delay is bounded as \Theta
(1) for any finite k. We first characterize the
critical transmission range for connectivity in mobile
k -hop clustered networks where all nodes move under
either the random walk mobility model with nontrivial
velocity or the i.i.d. mobility model. By the term
nontrivial velocity, we mean that the velocity of a
node v is \omega (r(n)), where r(n) is the transmission
range of the node. We then compare with the critical
transmission range for stationary k -hop clustered
networks. In addition, the critical number of neighbors
is studied in a parallel manner for both stationary and
mobile networks. We also study the transmission power
versus delay tradeoff and the average energy
consumption per flow among different types of networks.
We show that random walk mobility with nontrivial
velocities increases connectivity in k -hop clustered
networks, and thus significantly decreases the energy
consumption and improves the power-delay tradeoff. The
decrease of energy consumption per flow is shown to be
\Theta (log n / n$^d$ ) in clustered networks. These
results provide insights on network design and
fundamental guidelines on building a large-scale
wireless network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gelal:2013:TCE,
author = "Ece Gelal and Jianxia Ning and Konstantinos
Pelechrinis and Tae-Suk Kim and Ioannis Broustis and
Srikanth V. Krishnamurthy and Bhaskar D. Rao",
title = "Topology control for effective interference
cancellation in multiuser {MIMO} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "455--468",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2205160",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In multiuser multiple-input-multiple-output (MIMO)
networks, receivers decode multiple concurrent signals
using successive interference cancellation (SIC). With
SIC, a weak target signal can be deciphered in the
presence of stronger interfering signals. However, this
is only feasible if each strong interfering signal
satisfies a signal-to-noise-plus-interference ratio
(SINR) requirement. This necessitates the appropriate
selection of a subset of links that can be concurrently
active in each receiver's neighborhood; in other words,
a subtopology consisting of links that can be
simultaneously active in the network is to be formed.
If the selected subtopologies are of small size, the
delay between the transmission opportunities on a link
increases. Thus, care should be taken to form a limited
number of subtopologies. We find that the problem of
constructing the minimum number of subtopologies such
that SIC decoding is successful with a desired
probability threshold is NP-hard. Given this, we
propose MUSIC, a framework that greedily forms and
activates subtopologies in a way that favors successful
SIC decoding with a high probability. MUSIC also
ensures that the number of selected subtopologies is
kept small. We provide both a centralized and a
distributed version of our framework. We prove that our
centralized version approximates the optimal solution
for the considered problem. We also perform extensive
simulations to demonstrate that: (1) MUSIC forms a
small number of subtopologies that enable efficient SIC
operations; the number of subtopologies formed is at
most 17\% larger than the optimum number of topologies,
discovered through exhaustive search (in small
networks); (2) MUSIC outperforms approaches that simply
consider the number of antennas as a measure for
determining the links that can be simultaneously
active. Specifically, MUSIC provides throughput
improvements of up to four times, as compared to such
an approach, in various topological settings. The
improvements can be directly attributable to a
significantly higher probability of correct SIC based
decoding with MUSIC.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Freris:2013:DAS,
author = "Nikolaos M. Freris and Cheng-Hsin Hsu and Jatinder Pal
Singh and Xiaoqing Zhu",
title = "Distortion-aware scalable video streaming to
multinetwork clients",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "469--481",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2203608",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of scalable video streaming
from a server to multinetwork clients over
heterogeneous access networks, with the goal of
minimizing the distortion of the received videos. This
problem has numerous applications including: (1) mobile
devices connecting to multiple licensed and ISM bands,
and (2) cognitive multiradio devices employing spectrum
bonding. In this paper, we ascertain how to optimally
determine which video packets to transmit over each
access network. We present models to capture the
network conditions and video characteristics and
develop an integer program for deterministic packet
scheduling. Solving the integer program exactly is
typically not computationally tractable, so we develop
heuristic algorithms for deterministic packet
scheduling, as well as convex optimization problems for
randomized packet scheduling. We carry out a thorough
study of the tradeoff between performance and
computational complexity and propose a convex
programming-based algorithm that yields good
performance while being suitable for real-time
applications. We conduct extensive trace-driven
simulations to evaluate the proposed algorithms using
real network conditions and scalable video streams. The
simulation results show that the proposed convex
programming-based algorithm: (1) outperforms the rate
control algorithms defined in the Datagram Congestion
Control Protocol (DCCP) by about 10-15 dB higher video
quality; (2) reduces average delivery delay by over
90\% compared to DCCP; (3) results in higher average
video quality of 4.47 and 1.92 dB than the two
developed heuristics; (4) runs efficiently, up to six
times faster than the best-performing heuristic; and
(5) does indeed provide service differentiation among
users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altman:2013:COC,
author = "Eitan Altman and Amar Prakash Azad and Tamer Basar and
Francesco {De Pellegrini}",
title = "Combined optimal control of activation and
transmission in delay-tolerant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "482--494",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2206079",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Performance of a delay-tolerant network has strong
dependence on the nodes participating in data
transportation. Such networks often face several
resource constraints especially related to energy.
Energy is consumed not only in data transmission, but
also in listening and in several signaling activities.
On one hand these activities enhance the system's
performance while on the other hand, they consume a
significant amount of energy even when they do not
involve actual node transmission. Accordingly, in order
to use energy efficiently, one may have to limit not
only the amount of transmissions, but also the amount
of nodes that are active at each time. Therefore, we
study two coupled problems: (1) the activation problem
that determines when a mobile will turn on in order to
receive packets; and (2) the problem of regulating the
beaconing. We derive optimal energy management
strategies by formulating the problem as an optimal
control one, which we then explicitly solve. We also
validate our findings through extensive simulations
that are based on contact traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2013:LCC,
author = "Po-Kai Huang and Xiaojun Lin and Chih-Chun Wang",
title = "A low-complexity congestion control and scheduling
algorithm for multihop wireless networks with
order-optimal per-flow delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "495--508",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2213343",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Quantifying the end-to-end delay performance in
multihop wireless networks is a well-known challenging
problem. In this paper, we propose a new joint
congestion control and scheduling algorithm for
multihop wireless networks with fixed-route flows
operated under a general interference model with
interference degree $ \kappa $. Our proposed algorithm
not only achieves a provable throughput guarantee
(which is close to at least $ 1 / \kappa $ of the
system capacity region), but also leads to explicit
upper bounds on the end-to-end delay of every flow. Our
end-to-end delay and throughput bounds are in simple
and closed forms, and they explicitly quantify the
tradeoff between throughput and delay of every flow.
Furthermore, the per-flow end-to-end delay bound
increases linearly with the number of hops that the
flow passes through, which is order-optimal with
respect to the number of hops. Unlike traditional
solutions based on the backpressure algorithm, our
proposed algorithm combines window-based flow control
with a new rate-based distributed scheduling algorithm.
A key contribution of our work is to use a novel
stochastic dominance approach to bound the
corresponding per-flow throughput and delay, which
otherwise are often intractable in these types of
systems. Our proposed algorithm is fully distributed
and requires a low per-node complexity that does not
increase with the network size. Hence, it can be easily
implemented in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zarikoff:2013:MPI,
author = "Brad W. Zarikoff and Douglas J. Leith",
title = "Measuring pulsed interference in 802.11 links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "509--521",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2202686",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless IEEE 802.11 links operate in unlicensed
spectrum and so must accommodate other unlicensed
transmitters that generate pulsed interference. We
propose a new approach for detecting the presence of
pulsed interference affecting 802.11 links and for
estimating temporal statistics of this interference.
This approach builds on recent work on distinguishing
collision losses from noise losses in 802.11 links.
When the intervals between interference pulses are
i.i.d., the approach is not confined to estimating the
mean and variance of these intervals, but can recover
the complete probability distribution. The approach is
a transmitter-side technique that provides per-link
information and is compatible with standard hardware.
We demonstrate the effectiveness of the proposed
approach using extensive experimental measurements. In
addition to applications to monitoring, management, and
diagnostics, the fundamental information provided by
our approach can potentially be used to adapt the frame
durations used in a network so as to increase capacity
in the presence of pulsed interference.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2013:PBD,
author = "Lei Yang and Hongseok Kim and Junshan Zhang and Mung
Chiang and Chee Wei Tan",
title = "Pricing-based decentralized spectrum access control in
cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "522--535",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2203827",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates pricing-based spectrum access
control in cognitive radio networks, where primary
users (PUs) sell the temporarily unused spectrum and
secondary users (SUs) compete via random access for
such spectrum opportunities. Compared to existing
market-based approaches with centralized scheduling,
pricing-based spectrum management with random access
provides a platform for SUs contending for spectrum
access and is amenable to decentralized implementation
due to its low complexity. We focus on two market
models, one with a monopoly PU market and the other
with a multiple-PU market. For the monopoly PU market
model, we devise decentralized pricing-based spectrum
access mechanisms that enable SUs to contend for
channel usage. Specifically, we first consider SUs
contending via slotted Aloha. Since the revenue
maximization problem therein is nonconvex, we
characterize the corresponding Pareto-optimal region
and obtain a Pareto-optimal solution that maximizes the
SUs' throughput subject to their budget constraints. To
mitigate the spectrum underutilization due to the
``price of contention,'' we revisit the problem where
SUs contend via CSMA, which results in more efficient
spectrum utilization and higher revenue. We then study
the tradeoff between the PU's utility and its revenue
when the PU's salable spectrum is controllable. Next,
for the multiple-PU market model, we cast the
competition among PUs as a three-stage Stackelberg
game, where each SU selects a PU's channel to maximize
its throughput. We explore the existence and the
uniqueness of Nash equilibrium, in terms of access
prices and the spectrum offered to SUs, and develop an
iterative algorithm for strategy adaptation to achieve
the Nash equilibrium. Our findings reveal that there
exists a unique Nash equilibrium when the number of PUs
is less than a threshold determined by the budgets and
elasticity of SUs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2013:MDO,
author = "Kyunghan Lee and Joohyun Lee and Yung Yi and Injong
Rhee and Song Chong",
title = "Mobile data offloading: how much can {WiFi} deliver?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "536--550",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2218122",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a quantitative study on the
performance of 3G mobile data offloading through WiFi
networks. We recruited 97 iPhone users from
metropolitan areas and collected statistics on their
WiFi connectivity during a two-and-a-halfweek period in
February 2010. Our trace-driven simulation using the
acquired whole-day traces indicates that WiFi already
offloads about 65\% of the total mobile data traffic
and saves 55\% of battery power without using any
delayed transmission. If data transfers can be delayed
with some deadline until users enter a WiFi zone,
substantial gains can be achieved only when the
deadline is fairly larger than tens of minutes. With
100-s delays, the achievable gain is less than only
2\%-3\%, whereas with 1 h or longer deadlines, traffic
and energy saving gains increase beyond 29\% and 20\%,
respectively. These results are in contrast to the
substantial gain (20\%-33\%) reported by the existing
work even for 100-s delayed transmission using traces
taken from transit buses or war-driving. In addition, a
distribution model-based simulator and a theoretical
framework that enable analytical studies of the average
performance of offloading are proposed. These tools are
useful for network providers to obtain a rough estimate
on the average performance of offloading for a given
WiFi deployment condition.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2013:QVR,
author = "Alex X. Liu and Amir R. Khakpour",
title = "Quantifying and verifying reachability for access
controlled networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "551--565",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2203144",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Quantifying and querying network reachability is
important for security monitoring and auditing as well
as many aspects of network management such as
troubleshooting, maintenance, and design. Although
attempts to model network reachability have been made,
feasible solutions to computing network reachability
have remained unknown. In this paper, we propose a
suite of algorithms for quantifying reachability based
on network configurations [mainly Access Control Lists
(ACLs)] as well as solutions for querying network
reachability. We present a network reachability model
that considers connectionless and connection-oriented
transport protocols, stateless and stateful routers/
firewalls, static and dynamic NAT, PAT, IP tunneling,
etc. We implemented the algorithms in our network
reachability tool called Quarnet and conducted
experiments on a university network. Experimental
results show that the offline computation of
reachability matrices takes a few hours, and the online
processing of a reachability query takes 0.075s on
average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2013:OCP,
author = "Bo Tan and Laurent Massouli{\'e}",
title = "Optimal content placement for peer-to-peer
video-on-demand systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "566--579",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208199",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we address the problem of content
placement in peer-to-peer (P2P) systems, with the
objective of maximizing the utilization of peers'
uplink bandwidth resources. We consider system
performance under a many-user asymptotic. We
distinguish two scenarios, namely ``Distributed Server
Networks'' (DSNs) for which requests are exogenous to
the system, and ``Pure P2P Networks'' (PP2PNs) for
which requests emanate from the peers themselves. For
both scenarios, we consider a loss network model of
performance and determine asymptotically optimal
content placement strategies in the case of a limited
content catalog. We then turn to an alternative ``large
catalog'' scaling where the catalog size scales with
the peer population. Under this scaling, we establish
that storage space per peer must necessarily grow
unboundedly if bandwidth utilization is to be
maximized. Relating the system performance to
properties of a specific random graph model, we then
identify a content placement strategy and a request
acceptance policy that jointly maximize bandwidth
utilization, provided storage space per peer grows
unboundedly, although arbitrarily slowly, with system
size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Menasche:2013:CAB,
author = "Daniel S. Menasche and Antonio A. {De A.Rocha} and Bin
Li and Don Towsley and Arun Venkataramani",
title = "Content availability and bundling in swarming
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "580--593",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2212205",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "BitTorrent, the immensely popular file swarming
system, suffers a fundamental problem: content
unavailability. Although swarming scales well to
tolerate flash crowds for popular content, it is less
useful for unpopular content as peers arriving after
the initial rush find it unavailable. In this paper, we
present a model to quantify content availability in
swarming systems. We use the model to analyze the
availability and the performance implications of
bundling, a strategy commonly adopted by many
BitTorrent publishers today. We find that even a
limited amount of bundling exponentially reduces
content unavailability. For swarms with highly
unavailable publishers, the availability gain of
bundling can result in a net decrease in average
download time. We empirically confirm the model's
conclusions through experiments on PlanetLab using the
Mainline BitTorrent client.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rozner:2013:MDO,
author = "Eric Rozner and Mi Kyung Han and Lili Qiu and Yin
Zhang",
title = "Model-driven optimization of opportunistic routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "594--609",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2205701",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic routing aims to improve wireless
performance by exploiting communication opportunities
arising by chance. A key challenge in opportunistic
routing is how to achieve good, predictable performance
despite the incidental nature of such communication
opportunities and the complicated effects of wireless
interference in IEEE 802.11 networks. To address the
challenge, we develop a model-driven optimization
framework to jointly optimize opportunistic routes and
rate limits for both unicast and multicast traffic. A
distinctive feature of our framework is that the
performance derived from optimization can be achieved
in a real IEEE 802.11 network. Our framework consists
of three key components: (1) a model for capturing the
interference among IEEE 802.11 broadcast transmissions;
(2) a novel algorithm for accurately optimizing
different performance objectives; and (3) effective
techniques for mapping the resulting solutions to
practical routing configurations. Extensive simulations
and testbed experiments show that our approach
significantly out-performs state-of-the-art
shortest-path routing and opportunistic routing
protocols. Moreover, the difference between the
achieved performance and our model estimation is
typically within 20\%. Evaluation in dynamic and
uncontrolled environments further shows that our
approach is robust against inaccuracy introduced by a
dynamic network and it also consistently outperforms
the existing schemes. These results clearly demonstrate
the effectiveness and accuracy of our approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Clementi:2013:OMM,
author = "Andrea Clementi and Francesco Pasquale and Riccardo
Silvestri",
title = "Opportunistic {MANETs}: mobility can make up for low
transmission power",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "610--620",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2204407",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic mobile ad hoc networks (MANETs) are a
special class of sparse and disconnected MANETs where
data communication exploits sporadic contact
opportunities among nodes. We consider opportunistic
MANETs where nodes move independently at random over a
square of the plane. Nodes exchange data if they are at
a distance at most r within each other, where r > O is
the node transmission radius. The flooding time is the
number of time-steps required to broadcast a message
from a source node to every node of the network.
Flooding time is an important measure of how fast
information can spread in dynamic networks. We derive
the first upper bound on the flooding time, which is a
decreasing function of the maximal speed of the nodes.
The bound holds with high probability, and it is nearly
tight. Our bound shows that, thanks to node mobility,
even when the network is sparse and disconnected,
information spreading can be fast.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2013:FTR,
author = "Qianhong Wu and Bo Qin and Lei Zhang and Josep
Domingo-Ferrer and Jes{\'u}s A. Manj{\'o}n",
title = "Fast transmission to remote cooperative groups: a new
key management paradigm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "621--633",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208201",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of efficiently and securely broadcasting
to a remote cooperative group occurs in many newly
emerging networks. A major challenge in devising such
systems is to overcome the obstacles of the potentially
limited communication from the group to the sender, the
unavailability of a fully trusted key generation
center, and the dynamics of the sender. The existing
key management paradigms cannot deal with these
challenges effectively. In this paper, we circumvent
these obstacles and close this gap by proposing a novel
key management paradigm. The new paradigm is a hybrid
of traditional broadcast encryption and group key
agreement. In such a system, each member maintains a
single public/secret key pair. Upon seeing the public
keys of the members, a remote sender can securely
broadcast to any intended subgroup chosen in an ad hoc
way. Following this model, we instantiate a scheme that
is proven secure in the standard model. Even if all the
nonintended members collude, they cannot extract any
useful information from the transmitted messages. After
the public group encryption key is extracted, both the
computation overhead and the communication cost are
independent of the group size. Furthermore, our scheme
facilitates simple yet efficient member deletion/
addition and flexible rekeying strategies. Its strong
security against collusion, its constant overhead, and
its implementation friendliness without relying on a
fully trusted authority render our protocol a very
promising solution to many applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2013:TOS,
author = "Bo Ji and Changhee Joo and Ness B. Shroff",
title = "Throughput-optimal scheduling in multihop wireless
networks without per-flow information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "634--647",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2205017",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of link
scheduling in multihop wireless networks under general
interference constraints. Our goal is to design
scheduling schemes that do not use per-flow or
per-destination information, maintain a single data
queue for each link, and exploit only local
information, while guaranteeing throughput optimality.
Although the celebrated back-pressure algorithm
maximizes throughput, it requires per-flow or
per-destination information. It is usually difficult to
obtain and maintain this type of information,
especially in large networks, where there are numerous
flows. Also, the backpressure algorithm maintains a
complex data structure at each node, keeps exchanging
queue-length information among neighboring nodes, and
commonly results in poor delay performance. In this
paper, we propose scheduling schemes that can
circumvent these drawbacks and guarantee throughput
optimality. These schemes use either the readily
available hop-count information or only the local
information for each link. We rigorously analyze the
performance of the proposed schemes using fluid limit
techniques via an inductive argument and show that they
are throughput-optimal. We also conduct simulations to
validate our theoretical results in various settings
and show that the proposed schemes can substantially
improve the delay performance in most scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hegde:2013:ECS,
author = "Malati Hegde and Pavan Kumar and K. R. Vasudev and N.
N. Sowmya and S. V. R. Anand and Anurag Kumar and Joy
Kuri",
title = "Experiences with a centralized scheduling approach for
performance management of {IEEE 802.11} wireless
{LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "648--662",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2207402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a centralized integrated approach for: (1)
enhancing the performance of an IEEE 802.11
infrastructure wireless local area network (WLAN), and
(2) managing the access link that connects the WLAN to
the Internet. Our approach, which is implemented on a
standard Linux platform, and which we call ADvanced
Wi-fi Internet Service EnhanceR (ADWISER), is an
extension of our previous system WLAN Manager (WM).
ADWISER addresses several infrastructure WLAN
performance anomalies such as mixed-rate inefficiency,
unfair medium sharing between simultaneous TCP uploads
and downloads, and inefficient utilization of the
Internet access bandwidth when Internet transfers
compete with LAN-WLAN transfers, etc. The approach is
via centralized queueing and scheduling, using a novel,
configurable, cascaded packet queueing and scheduling
architecture, with an adaptive service rate. In this
paper, we describe the design of ADWISER and report
results of extensive experimentation conducted on a
hybrid testbed consisting of real end-systems and an
emulated WLAN on Qualnet. We also present results from
a physical testbed consisting of one access point (AP)
and a few end-systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lam:2013:GRD,
author = "Simon S. Lam and Chen Qian",
title = "Geographic routing in $d$-dimensional spaces with
guaranteed delivery and low stretch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "663--677",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2214056",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Almost all geographic routing protocols have been
designed for 2-D. We present a novel geographic routing
protocol, named Multihop Delaunay Triangulation (MDT),
for 2-D, 3-D, and higher dimensions with these
properties: (1) guaranteed delivery for any connected
graph of nodes and physical links, and (2) low routing
stretch from efficient forwarding of packets out of
local minima. The guaranteed delivery property holds
for node locations specified by accurate, inaccurate,
or arbitrary coordinates. The MDT protocol suite
includes a packet forwarding protocol together with
protocols for nodes to construct and maintain a
distributed MDT for routing. We present the performance
of MDT protocols in 3-D and 4-D as well as performance
comparisons of MDT routing versus representative
geographic routing protocols for nodes in 2-D and 3-D.
Experimental results show that MDT provides the lowest
routing stretch in the comparisons. Furthermore, MDT
protocols are specially designed to handle churn, i.e.,
dynamic topology changes due to addition and deletion
of nodes and links. Experimental results show that
MDT's routing success rate is close to 100\% during
churn, and node states converge quickly to a correct
MDT after churn.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Soh:2013:RID,
author = "De Wen Soh and Wee Peng Tay and Tony Q. S. Quek",
title = "Randomized information dissemination in dynamic
environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "681--691",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2209676",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider randomized broadcast or information
dissemination in wireless networks with switching
network topologies. We show that an upper bound for the
$ \epsilon $-dissemination time consists of the
conductance bound for a network without switching, and
an adjustment that accounts for the number of informed
nodes in each period between topology changes. Through
numerical simulations, we show that our bound is
asymptotically tight.We apply our results to the case
of mobile wireless networks with unreliable
communication links and establish an upper bound for
the dissemination time when the network undergoes
topology changes and periods of communication link
erasures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pefkianakis:2013:TMA,
author = "Ioannis Pefkianakis and Suk-Bok Lee and Songwu Lu",
title = "Towards {MIMO}-aware {802.11n} rate adaptation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "692--705",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2207908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we use real experiments to study
multiple-input-multiple-output (MIMO) 802.11n rate
adaptation (RA) on a programmable access point (AP)
platform. Our case study shows that existing RA
solutions offer much lower throughput than even a
fixed-rate scheme. It is proven that all such
algorithms are MIMO-mode oblivious; they do not
differentiate spatial diversity and spatial
multiplexing modes. We first design MiRA, a novel MIMO
RA scheme that zigzags between intra- and inter-MIMO
modes to addressMIMO 802.11n dynamics. Second, we
examine a window-based RA solution, which runs an
independent RA in each MIMO mode in parallel and a
signal-to-noise ratio (SNR)-based MIMO RA that
differentiates modes using SNR measurements. Our
experiments show that MIMO-mode aware designs
outperform MIMO-mode oblivious RAs in various settings,
with goodput gains up to 73.5\% in field trials.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2013:FAP,
author = "Chee Wei Tan and Mung Chiang and R. Srikant",
title = "Fast algorithms and performance bounds for sum rate
maximization in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "706--719",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2210240",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider a wireless network where
interference is treated as noise, and we study the
nonconvex problem of sum rate maximization by power
control. We focus on finding approximately optimal
solutions that can be efficiently computed to this
NP-hard problem by studying the solutions to two
related problems, the sum rate maximization using a
signal-to-interference-plus-noise ratio (SINR)
approximation and the max-min weighted SINR
optimization. We show that these two problems are
intimately connected, can be solved efficiently by
algorithms with fast convergence and minimal parameter
configuration, and can yield high-quality approximately
optimal solutions to sum rate maximization in the low
interference regime. As an application of these
results, we analyze the connection-level stability of
cross-layer utility maximization in the wireless
network, where users arrive and depart randomly and are
subject to congestion control, and the queue service
rates at all the links are determined by the sum rate
maximization problem. In particular, we determine the
stability region when all the links solve the max-min
weighted SINR problem, using instantaneous queue sizes
as weights.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2013:PVP,
author = "Chris Y. T. Ma and David K. Y. Yau and Nung Kwan Yip
and Nageswara S. V. Rao",
title = "Privacy vulnerability of published anonymous mobility
traces",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "720--733",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208983",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobility traces of people and vehicles have been
collected and published to assist the design and
evaluation of mobile networks, such as large-scale
urban sensing networks. Although the published traces
are often made anonymous in that the true identities of
nodes are replaced by random identifiers, the privacy
concern remains. This is because in real life, nodes
are open to observations in public spaces, or they may
voluntarily or inadvertently disclose partial knowledge
of their whereabouts. Thus, snapshots of nodes'
location information can be learned by interested third
parties, e.g., directly through chance/engineered
meetings between the nodes and their observers, or
indirectly through casual conversations or other
information sources about people. In this paper, we
investigate how an adversary, when equipped with a
small amount of the snapshot information termed as side
information, can infer an extended view of the
whereabouts of a victim node appearing in an anonymous
trace. Our results quantify the loss of victim nodes'
privacy as a function of the nodal mobility, the
inference strategies of adversaries, and any noise that
may appear in the trace or the side information.
Generally, our results indicate that the privacy
concern is significant in that a relatively small
amount of side information is sufficient for the
adversary to infer the true identity (either uniquely
or with high probability) of a victim in a set of
anonymous traces. For instance, an adversary is able to
identify the trace of 30\%-50\% of the victims when she
has collected 10 pieces of side information about a
victim.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2013:RSA,
author = "Hung X. Nguyen and Matthew Roughan",
title = "Rigorous statistical analysis of {Internet} loss
measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "734--745",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2207915",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Loss measurements are widely used in today's networks.
There are existing standards and commercial products to
perform these measurements. The missing element is a
rigorous statistical methodology for their analysis.
Indeed, most existing tools ignore the correlation
between packet losses and severely underestimate the
errors in the measured loss ratios. In this paper, we
present a rigorous technique for analyzing performance
measurements, in particular, for estimating confidence
intervals of packet loss measurements. The task is
challenging because Internet packet loss ratios are
typically small and the packet loss process is bursty.
Our approach, SAIL, is motivated by some simple
observations about the mechanism of packet losses.
Packet losses occur when the buffer in a switch or
router fills, when there are major routing
instabilities, or when the hosts are overloaded, and so
we expect packet loss to proceed in episodes of loss,
interspersed with periods of successful packet
transmission. This can be modeled as a simple ON/OFF
process, and in fact, empirical measurements suggest
that an alternating renewal process is a reasonable
approximation to the real underlying loss process. We
use this structure to build a hidden semi-Markov model
(HSMM) of the underlying loss process and, from this,
to estimate both loss ratios and confidence intervals
on these loss ratios. We use both simulations and a set
of more than 18 000 hours of real Internet measurements
(between dedicated measurement hosts, PlanetLab hosts,
Web and DNS servers) to cross-validate our estimates
and show that they are better than any current
alternative.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qian:2013:DCA,
author = "Dajun Qian and Dong Zheng and Junshan Zhang and Ness
B. Shroff and Changhee Joo",
title = "Distributed {CSMA} algorithms for link scheduling in
multihop {MIMO} networks under {SINR} model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "746--759",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208200",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study distributed scheduling in
multihop multiple-input-multiple-output (MIMO)
networks. We first develop a ``MIMO-pipe'' model that
provides the upper layers a set of rates and
signal-to-interference-plus-noise ratio (SINR)
requirements that capture the rate-reliability tradeoff
in MIMO communications. The main thrust of this paper
is then dedicated to developing distributed carrier
sense multiple access (CSMA) algorithms for MIMO-pipe
scheduling under the SINR interference model. We choose
the SINR model over the extensively studied
protocol-based interference models because it more
naturally captures the impact of interference in
wireless networks. The coupling among the links caused
by the interference under the SINR model makes the
problem of devising distributed scheduling algorithms
very challenging. To that end, we explore the CSMA
algorithms for MIMO-pipe scheduling from two
perspectives. We start with an idealized
continuous-time CSMA network, where control messages
can be exchanged in a collision-free manner, and devise
a CSMA-based link scheduling algorithm that can achieve
throughput optimality under the SINR model. Next, we
consider a discrete-time CSMA network, where the
message exchanges suffer from collisions. For this more
challenging case, we develop a ``conservative''
scheduling algorithm by imposing a more stringent SINR
constraint on the MIMO-pipe model. We show that the
proposed conservative scheduling achieves an efficiency
ratio bounded from below.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Richa:2013:EFM,
author = "Andr{\'e}a Richa and Christian Scheideler and Stefan
Schmid and Jin Zhang",
title = "An efficient and fair {MAC} protocol robust to
reactive interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "760--771",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2210241",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Interference constitutes a major challenge to
availability for communication networks operating over
a shared medium. This paper proposes the medium access
(MAC) protocol ANTIJAM, which achieves a high and fair
throughput even in harsh environments. Our protocol
mitigates internal interference, requiring no knowledge
about the number of participants in the network. It is
also robust to intentional and unintentional external
interference, e.g., due to coexisting networks or
jammers. We model external interference using a
powerful reactive adversary that can jam a (1- \epsilon
)-portion of the time-steps, where 0 < \epsilon \leq 1
is an arbitrary constant. The adversary uses carrier
sensing to make informed decisions on when it is most
harmful to disrupt communications.Moreover, we allow
the adversary to be adaptive and to have complete
knowledge of the entire protocol history. ANTIJAM makes
efficient use of the nonjammed time periods and
achieves, if \epsilon is constant, a \theta
(1)-competitive throughput. In addition, ANTIJAM
features a low convergence time and has excellent
fairness properties, such that channel access
probabilities do not differ among nodes by more than a
small constant factor.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fang:2013:FGC,
author = "Ji Fang and Kun Tan and Yuanyang Zhang and Shouyuan
Chen and Lixin Shi and Jiansong Zhang and Yongguang
Zhang and Zhenhui Tan",
title = "Fine-grained channel access in wireless {LAN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "772--787",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2212207",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing of physical-layer (PHY) data rate
in modern wireless local area networks (WLANs) (e.g.,
802.11n), the overhead of media access control (MAC)
progressively degrades data throughput efficiency. This
trend reflects a fundamental aspect of the current MAC
protocol, which allocates the channel as a single
resource at a time. This paper argues that, in a high
data rate WLAN, the channel should be divided into
separate subchannels whose width is commensurate with
the PHY data rate and typical frame size. Multiple
stations can then contend for and use subchannels
simultaneously according to their traffic demands,
thereby increasing overall efficiency. We introduce
FICA, a fine-grained channel access method that
embodies this approach to media access using two novel
techniques. First, it proposes a new PHY architecture
based on orthogonal frequency division multiplexing
(OFDM) that retains orthogonality among subchannels
while relying solely on the coordination mechanisms in
existing WLAN, carrier sensing and broadcasting.
Second, FICA employs a frequency-domain contention
method that uses physical-layer Request to Send/Clear
to Send (RTS/CTS) signaling and frequency domain
backoff to efficiently coordinate subchannel access. We
have implemented FICA, both MAC and PHY layers, using a
software radio platform, and our experiments
demonstrate the feasibility of the FICA design.
Furthermore, our simulation results show FICA can
improve the efficiency of WLANs from a few percent to
600\% compared to existing 802.11.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lalanne:2013:FDC,
author = "Felipe Lalanne and Stephane Maag",
title = "A formal data-centric approach for passive testing of
communication protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "788--801",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2210443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There is currently a high level of consciousness of
the importance and impact of formally testing
communicating networks. By applying formal description
techniques and formal testing approaches, we are able
to validate the conformance of implementations to the
requirements of communication protocols. In this
context, passive testing techniques are used whenever
the system under test cannot be interrupted or access
to its interfaces is unavailable. Under such
conditions, communication traces are extracted from
points of observation and compared to the expected
behavior formally specified as properties. Since most
works on the subject come from a formal model context,
they are optimized for testing the control part of the
communication with a secondary focus on the data parts.
In the current work, we provide a data-centric approach
for black-box testing of network protocols. A formalism
is provided to express complex properties in a
bottom-up fashion starting from expected data relations
in messages. A novel algorithm is provided for
evaluation of properties in protocol traces.
Experimental results on Session Initiation Protocol
(SIP) traces for IP Multimedia Subsystem (IMS) services
are provided.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Checconi:2013:QEP,
author = "Fabio Checconi and Luigi Rizzo and Paolo Valente",
title = "{QFQ}: efficient packet scheduling with tight
guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "802--816",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2215881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet scheduling, together with classification, is
one of the most expensive processing steps in systems
providing tight bandwidth and delay guarantees at high
packet rates. Schedulers with near-optimal service
guarantees and O(1) time complexity have been proposed
in the past, using techniques such as timestamp
rounding and flow grouping to keep their execution time
small. However, even the two best proposals in this
family have a per-packet cost component that is linear
either in the number of groups or in the length of the
packet being transmitted. Furthermore, no studies are
available on the actual execution time of these
algorithms. In this paper we make two contributions.
First, we present Quick Fair Queueing (QFQ), a new O
(1) scheduler that provides near-optimal guarantees and
is the first to achieve that goal with a truly constant
cost also with respect to the number of groups and the
packet length. The QFQ algorithm has no loops and uses
very simple instructions and data structures that
contribute to its speed of operation. Second, we have
developed production-quality implementations of QFQ and
of its closest competitors, which we use to present a
detailed comparative performance analysis of the
various algorithms. Experiments show that QFQ fulfills
our expectations, outperforming the other algorithms in
the same class. In absolute terms, even on a low-end
workstation, QFQ takes about 110 ns for an
enqueue()/dequeue() pair (only twice the time of DRR,
but with much better service guarantees).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2013:SCB,
author = "Tao Li and Shigang Chen and Wen Luo and Ming Zhang and
Yan Qiao",
title = "Spreader classification based on optimal dynamic bit
sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "817--830",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2218255",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Spreader classification is an online traffic
measurement function that has many important
applications. In order to keep up with ever-higher line
speed, the recent research trend is to implement such
functions in fast but small on-die SRAM. However, the
mismatch between the huge amount of Internet traffic to
be monitored and limited on-die memory space presents a
significant technical challenge. In this paper, we
propose an Efficient Spreader Classification (ESC)
scheme based on dynamic bit sharing, a compact
information storage method. We design a maximum
likelihood estimation method to extract per-source
information from the compact storage and determine the
heavy spreaders. Our new scheme ensures that false
positive/negative ratios are bounded. Moreover, given
an arbitrary set of bounds, we develop a systematic
approach to determine the optimal system parameters
that minimize the amount of memory needed to meet the
bounds. Experiments based on a real Internet traffic
trace demonstrate that the proposed spreader
classification scheme reduces memory consumption by
3-20 times when compared to the best existing work. We
also investigate a new multi-objective spreader
classification problem and extend our classification
scheme to solve it.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2013:LBA,
author = "Longbo Huang and Scott Moeller and Michael J. Neely
and Bhaskar Krishnamachari",
title = "{LIFO}-backpressure achieves near-optimal
utility-delay tradeoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "831--844",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226215",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There has been considerable work developing a
stochastic network utility maximization framework using
Backpressure algorithms, also known as MaxWeight. A key
open problem has been the development of
utility-optimal algorithms that are also
delay-efficient. In this paper, we show that the
Backpressure algorithm, when combined with the
last-in-first-out (LIFO) queueing discipline (called
LIFO-Backpressure), is able to achieve a utility that
is within O(1/V) of the optimal value, for any scalar V
\geq 1, while maintaining an average delay of O ([log(
V )]$^2$ ) for all but a tiny fraction of the network
traffic. This result holds for a general class of
problems with Markovian dynamics. Remarkably, the
performance of LIFO-Backpressure can be achieved by
simply changing the queueing discipline; it requires no
other modifications of the original Backpressure
algorithm. We validate the results through empirical
measurements from a sensor network testbed, which show
a good match between theory and practice. Because some
packets may stay in the queues for a very long time
under LIFO-Backpressure, we further develop the
LIFO$^p$ -Backpressure algorithm, which generalizes
LIFO-Backpressure by allowing interleaving between
first-in-first-out (FIFO) and LIFO. We show that
LIFO$^p$ -Backpressure also achieves the same O(1/V)
close-to-optimal utility performance and guarantees an
average delay of O ([log( V )]$^2$ ) for the packets
that are served during the LIFO period.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{CastroFernandes:2013:ERA,
author = "Natalia {Castro Fernandes} and Marcelo {Duffles Donato
Moreira} and Otto Carlos {Muniz Bandeira Duarte}",
title = "An efficient and robust addressing protocol for node
autoconfiguration in ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "845--856",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227977",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Address assignment is a key challenge in ad hoc
networks due to the lack of infrastructure. Autonomous
addressing protocols require a distributed and
self-managed mechanism to avoid address collisions in a
dynamic network with fading channels, frequent
partitions, and joining/leaving nodes. We propose and
analyze a lightweight protocol that configures mobile
ad hoc nodes based on a distributed address database
stored in filters that reduces the control load and
makes the proposal robust to packet losses and network
partitions.We evaluate the performance of our protocol,
considering joining nodes, partition merging events,
and network initialization. Simulation results show
that our protocol resolves all the address collisions
and also reduces the control traffic when compared to
previously proposed protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2013:CDP,
author = "Fei Chen and Bezawada Bruhadeshwar and Alex X. Liu",
title = "Cross-domain privacy-preserving cooperative firewall
optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "857--868",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2217985",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Firewalls have been widely deployed on the Internet
for securing private networks. A firewall checks each
incoming or outgoing packet to decide whether to accept
or discard the packet based on its policy. Optimizing
firewall policies is crucial for improving network
performance. Prior work on firewall optimization
focuses on either intrafirewall or interfirewall
optimization within one administrative domain where the
privacy of firewall policies is not a concern. This
paper explores interfirewall optimization across
administrative domains for the first time. The key
technical challenge is that firewall policies cannot be
shared across domains because a firewall policy
contains confidential information and even potential
security holes, which can be exploited by attackers. In
this paper, we propose the first cross-domain
privacy-preserving cooperative firewall policy
optimization protocol. Specifically, for any two
adjacent firewalls belonging to two different
administrative domains, our protocol can identify in
each firewall the rules that can be removed because of
the other firewall. The optimization process involves
cooperative computation between the two firewalls
without any party disclosing its policy to the other.
We implemented our protocol and conducted extensive
experiments. The results on real firewall policies show
that our protocol can remove as many as 49\% of the
rules in a firewall, whereas the average is 19.4\%. The
communication cost is less than a few hundred
kilobytes. Our protocol incurs no extra online packet
processing overhead, and the offline processing time is
less than a few hundred seconds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Premnath:2013:BOB,
author = "Sriram N. Premnath and Daryl Wasden and Sneha K.
Kasera and Neal Patwari and Behrouz Farhang-Boroujeny",
title = "Beyond {OFDM}: best-effort dynamic spectrum access
using filterbank multicarrier",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "869--882",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2213344",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Orthogonal frequency division multiplexing (OFDM),
widely recommended for sharing the spectrum among
different nodes in a dynamic spectrum access network,
imposes tight timing and frequency synchronization
requirements. We examine the use of filterbank
multicarrier (FBMC), a somewhat lesser known and
understood alternative, for dynamic spectrum access.
FBMC promises very low out-of-band energy of each
subcarrier signal when compared to OFDM. In order to
fully understand and evaluate the promise of FBMC, we
first examine the use of special pulse-shaping filters
of the FBMC PHY layer in reliably transmitting data
packets at a very high rate. Next, to understand the
impact of FBMC beyond the PHY layer, we devise a
distributed and adaptive medium access control (MAC)
protocol that coordinates data packet traffic among the
different nodes in the network in a best-effort manner.
Using extensive simulations, we show that FBMC
consistently achieves at least an order of magnitude
performance improvement over OFDM in several aspects
including packet transmission delays, channel access
delays, and effective data transmission rate available
to each node in static, indoor settings. Using
measurements of power spectral density and high data
rate transmissions from a transceiver that we build
using our National Instruments hardware platform, we
show that while FBMC can decode/distinguish all the
received symbols without any errors, OFDM cannot.
Finally, we also examine the use of FBMC in a vehicular
network setup. We find that FBMC achieves an order of
magnitude performance improvement over large distances
in this setup as well. Furthermore, in the case of
multihop vehicular networks, FBMC can achieve about 20$
\times $ smaller end-to-end data packet delivery delays
and relatively low packet drop probabilities. In
summary, FBMC offers a much higher performing
alternative to OFDM for networks that dynamically share
the spectrum among multiple nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fogue:2013:ASB,
author = "Manuel Fogue and Piedad Garrido and Francisco J.
Martinez and Juan-Carlos Cano and Carlos T. Calafate
and Pietro Manzoni",
title = "An adaptive system based on roadmap profiling to
enhance warning message dissemination in {VANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "883--895",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2212206",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In recent years, new applications, architectures, and
technologies have been proposed for vehicular ad hoc
networks (VANETs). Regarding traffic safety
applications for VANETs, warning messages have to be
quickly and smartly disseminated in order to reduce the
required dissemination time and to increase the number
of vehicles receiving the traffic warning information.
In the past, several approaches have been proposed to
improve the alert dissemination process in multihop
wireless networks, but none of them were tested in real
urban scenarios, adapting its behavior to the
propagation features of the scenario. In this paper, we
present the Profile-driven Adaptive Warning
Dissemination Scheme (PAWDS) designed to improve the
warning message dissemination process. With respect to
previous proposals, our proposed scheme uses a mapping
technique based on adapting the dissemination strategy
according to both the characteristics of the street
area where the vehicles are moving and the density of
vehicles in the target scenario. Our algorithm reported
a noticeable improvement in the performance of alert
dissemination processes in scenarios based on real city
maps.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Arslan:2013:AAC,
author = "Mustafa Y. Arslan and Konstantinos Pelechrinis and
Ioannis Broustis and Shailendra Singh and Srikanth V.
Krishnamurthy and Sateesh Addepalli and Konstantina
Papagiannaki",
title = "{ACORN}: an auto-configuration framework for {802.11n
WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "896--909",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2218125",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The wide channels feature combines two adjacent
channels to form a new, wider channel to facilitate
high-data-rate transmissions in
multiple-input-multiple-output (MIMO)-based IEEE
802.11n networks. Using a wider channel can exacerbate
interference effects. Furthermore, contrary to what has
been reported by prior studies, we find that wide
channels do not always provide benefits in isolation
(i.e., one link without interference) and can even
degrade performance. We conduct an in-depth,
experimental study to understand the implications of
wide channels on throughput performance. Based on our
measurements, we design an auto-configuration framework
called ACORN for enterprise 802.11n WLANs. ACORN
integrates the functions of user association and
channel allocation since our study reveals that they
are tightly coupled when wide channels are used. We
show that the channel allocation problem with the
constraints of wide channels is NP-complete. Thus,
ACORN uses an algorithm that provides a worst-case
approximation ratio of $ O(1 / \Delta + 1) $, with $
\Delta $ being the maximum node degree in the network.
We implement ACORN on our 802.11n testbed. Our
evaluations show that ACORN: (1) outperforms previous
approaches that are agnostic to wide channels
constraints; it provides per-AP throughput gains
ranging from $ 1.5 \times $ to $ 6 \times $ and (2) in
practice, its channel allocation module achieves an
approximation ratio much better than the theoretically
predicted $ O(1 / \Delta + 1) $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2013:DCA,
author = "Kai Han and Yang Liu and Jun Luo",
title = "Duty-cycle-aware minimum-energy multicasting in
wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "910--923",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2212452",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In duty-cycled wireless sensor networks, the nodes
switch between active and dormant states, and each node
may determine its active/dormant schedule
independently. This complicates the Minimum-Energy
Multicasting (MEM) problem, which was primarily studied
in always-active wireless ad hoc networks. In this
paper, we study the duty-cycle-aware MEM problem in
wireless sensor networks both for one-to-many
multicasting and for all-to-all multicasting. In the
case of one-to-many multicasting, we present a
formalization of the Minimum-Energy Multicast Tree
Construction and Scheduling (MEMTCS) problem. We prove
that the MEMTCS problem is NP-hard, and it is unlikely
to have an approximation algorithm with a performance
ratio of $ (1 - o(1)) $ in $ \Delta $, where $ \Delta $
is the maximum node degree in a network. We propose a
polynomial-time approximation algorithm for the MEMTCS
problem with a performance ratio of $ O(H(\Delta + 1))
$, where $ H(c) $ is the harmonic number. In the case
of all-to-all multicasting, we prove that the
Minimum-Energy Multicast Backbone Construction and
Scheduling (MEMBCS) problem is also NP-hard and present
an approximation algorithm for it, which has the same
approximation ratio as that of the proposed algorithm
for the MEMTCS problem. We also provide a distributed
implementation of our algorithms, as well as a simple
but efficient collision-free scheduling scheme to avoid
packet loss. Finally, we perform extensive simulations,
and the results demonstrate that our algorithms
significantly outperform other known algorithms in
terms of the total transmission energy cost, without
sacrificing much of the delay performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2013:FTS,
author = "Yuanqing Zheng and Mo Li",
title = "Fast tag searching protocol for large-scale {RFID}
systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "924--934",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2212454",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fast searching a particular subset in a large number
of products attached with radio frequency
identification (RFID) tags is of practical importance
for a variety of applications, but not yet thoroughly
investigated. Since the cardinality of the products can
be extremely large, collecting the tag information
directly from each of those tags could be highly
inefficient. To address the tag searching efficiency in
large-scale RFID systems, this paper proposes several
algorithms to meet the stringent delay requirement in
developing fast tag searching protocols. We formally
formulate the tag searching problem in large-scale RFID
systems. We propose utilizing compact approximators to
efficiently aggregate a large volume of RFID tag
information and exchange such information with a
two-phase approximation protocol. By estimating the
intersection of two compact approximators, the proposed
two-phase compact approximator-based tag searching
protocol significantly reduces the searching time
compared to all possible solutions we can directly
borrow from existing studies. We further introduce a
scalable cardinality range estimation method that
provides inexpensive input for our tag searching
protocol. We conduct comprehensive simulations to
validate our design. The results demonstrate that the
proposed tag searching protocol is highly efficient in
terms of both time efficiency and transmission
overhead, leading to good applicability and scalability
for large-scale RFID systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altman:2013:PIM,
author = "Eitan Altman and Philippe Nain and Adam Shwartz and
Yuedong Xu",
title = "Predicting the impact of measures against {P2P}
networks: transient behavior and phase transition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "935--949",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2217505",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The paper has two objectives. The first is to study
rigorously the transient behavior of some peer-to-peer
(P2P) networks whenever information is replicated and
disseminated according to epidemic-like dynamics. The
second is to use the insight gained from the previous
analysis in order to predict how efficient are measures
taken against P2P networks. We first introduce a
stochastic model that extends a classical epidemic
model and characterize the P2P swarm behavior in
presence of free-riding peers. We then study a second
model in which a peer initiates a contact with another
peer chosen randomly. In both cases, the network is
shown to exhibit phase transitions: A small change in
the parameters causes a large change in the behavior of
the network. We show, in particular, how phase
transitions affect measures of content providers
against P2P networks that distribute nonauthorized
music, books, or articles and what is the efficiency of
countermeasures. In addition, our analytical framework
can be generalized to characterize the heterogeneity of
cooperative peers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2013:RBW,
author = "Tae-Suk Kim and Ioannis Broustis and Serdar Vural and
Dimitris Syrivelis and Shailendra Singh and Srikanth V.
Krishnamurthy and Thomas F. {La Porta}",
title = "Realizing the benefits of wireless network coding in
multirate settings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "950--962",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2214487",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding has been proposed as a technique that
can potentially increase the transport capacity of a
wireless network via mixing data packets at
intermediate routers. However, most previous studies
either assume a fixed transmission rate or do not
consider the impact of using diverse rates on the
network coding gain. Since in many cases, network
coding implicitly relies on overhearing, the choice of
the transmission rate has a big impact on the
achievable gains. The use of higher rates works in
favor of increasing the native throughput. However, it
may in many cases work against effective overhearing.
In other words, there is a tension between the
achievable network coding gain and the inherent rate
gain possible on a link. In this paper, our goal is to
drive the network toward achieving the best tradeoff
between these two contradictory effects. We design a
distributed framework that: (1) facilitates the choice
of the best rate on each link while considering the
need for overhearing; and (2) dictates the choice of
which decoding recipient will acknowledge the reception
of an encoded packet. We demonstrate that both of these
features contribute significantly toward gains in
throughput. We extensively simulate our framework in a
variety of topological settings. We also fully
implement it on real hardware and demonstrate its
applicability and performance gains via
proof-of-concept experiments on our wireless testbed.
We show that our framework yields throughput gains of
up to 390\% as compared to what is achieved in a
rate-unaware network coding framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2013:DCL,
author = "Yilin Shen and Nam P. Nguyen and Ying Xuan and My T.
Thai",
title = "On the discovery of critical links and nodes for
assessing network vulnerability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "963--973",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2215882",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The assessment of network vulnerability is of great
importance in the presence of unexpected disruptive
events or adversarial attacks targeting on critical
network links and nodes. In this paper, we study
Critical Link Disruptor (CLD) and Critical Node
Disruptor (CND) optimization problems to identify
critical links and nodes in a network whose removals
maximally destroy the network's functions. We provide a
comprehensive complexity analysis of CLD and CND on
general graphs and show that they still remain
NP-complete even on unit disk graphs and power-law
graphs. Furthermore, the CND problem is shown NP-hard
to be approximated within $ \Omega (n - k / n^\epsilon)
$ on general graphs with $n$ vertices and $k$ critical
nodes. Despite the intractability of these problems, we
propose HILPR, a novel LP-based rounding algorithm, for
efficiently solving CLD and CND problems in a timely
manner. The effectiveness of our solutions is validated
on various synthetic and real-world networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Moazzez-Estanjini:2013:SMN,
author = "Reza Moazzez-Estanjini and Jing Wang and Ioannis Ch.
Paschalidis",
title = "Scheduling mobile nodes for cooperative data transport
in sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "974--989",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2216897",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Message ferrying has been shown to be an effective
approach to support routing in sparse ad hoc or sensor
networks. Considering a generic network model where
each node in the network wishes to send data to some
(or possibly all) other nodes with known (and possibly
different) rates, we propose three schemes enabling
multiple ferries to coordinate in collecting and
delivering the data. We analyze the performance of each
scheme and establish bounds on the average and
worst-case delay. The latter bounds are useful in
offering performance guarantees. We establish that
under one of our schemes, constant per-node throughput
is achievable within constant maximum (worst-case)
delay as the network size grows. Using simulation, we
compare our proposed schemes with an alternative, the
Ferry Relaying algorithm proposed earlier in the
literature. The results show that our schemes perform
better and provide guidance on which scheme to use
given performance preferences and the number of
available ferries.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vissicchio:2013:INA,
author = "Stefano Vissicchio and Laurent Vanbever and Cristel
Pelsser and Luca Cittadini and Pierre Francois and
Olivier Bonaventure",
title = "Improving network agility with seamless {BGP}
reconfigurations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "990--1002",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2217506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The network infrastructure of Internet service
providers (ISPs) undergoes constant evolution. Whenever
new requirements arise (e.g., the deployment of a new
Point of Presence or a change in the business
relationship with a neighboring ISP), operators need to
change the configuration of the network. Due to the
complexity of the Border Gateway Protocol (BGP) and the
lack of methodologies and tools, maintaining service
availability during reconfigurations that involve BGP
is a challenge for operators. In this paper, we show
that the current best practices to reconfigure BGP do
not provide guarantees with respect to traffic
disruptions. Then, we study the problem of finding an
operational ordering of BGP reconfiguration steps that
guarantees no packet loss. Unfortunately, finding such
an operational ordering, when it exists, is
computationally hard. To enable lossless
reconfigurations, we propose a framework that extends
current features of carrier-grade routers to run two
BGP control planes in parallel. We present a prototype
implementation and show the effectiveness of our
framework through a case study.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paris:2013:CLM,
author = "Stefano Paris and Cristina Nita-Rotaru and Fabio
Martignon and Antonio Capone",
title = "Cross-layer metrics for reliable routing in wireless
mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "1003--1016",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230337",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless mesh networks (WMNs) have emerged as a
flexible and low-cost network infrastructure, where
heterogeneous mesh routers managed by different users
collaborate to extend network coverage. This paper
proposes a novel routing metric, Expected Forwarded
Counter (EFW), and two further variants, to cope with
the problem of selfish behavior (i.e., packet dropping)
of mesh routers in a WMN. EFW combines, in a
cross-layer fashion, routing-layer observations of
forwarding behavior with MAC-layer measurements of
wireless link quality to select the most reliable and
high-performance path. We evaluate the proposed metrics
both through simulations and real-life deployments on
two different wireless testbeds, performing a
comparative analysis with On-Demand Secure Byzantine
Resilient Routing (ODSBR) Protocol and Expected
Transmission Counter (ETX). The results show that our
cross-layer metrics accurately capture the path
reliability and considerably increase the WMN
performance, even when a high percentage of network
nodes misbehave.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2013:HRC,
author = "Kaidi D. Huang and Ken R. Duffy and David Malone",
title = "{H-RCA}: {802.11} collision-aware rate control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1021--1034",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2216891",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Rate control methodologies that are currently
available in IEEE 802.11 network cards seriously
underutilize network resources and, in addition,
per-second throughputs suffer from high variability. In
this paper, we introduce an algorithm, H-RCA, that
overcomes these shortcomings, giving substantially
higher, and less variable, throughput. The approach
solely uses information already available at the
driver-level to function and can be implemented on
802.11e commodity hardware. H-RCA's design objective is
to minimize the average time each packet spends on the
medium (including retries) in order to maximize total
network throughput. It uses a development of a recently
proposed estimation scheme to distinguish transmission
failures due to collisions from those caused by channel
noise. It employs an estimate of the packet loss ratio
due to noise in assessing whether it is appropriate to
change rate. We demonstrate experimentally that packet
loss ratio is not necessarily a monotonic increasing
function of rate; this is accounted for in H-RCA's
design. A s H-RCA statistically separates noise losses
from those caused by collisions, ns-2 simulations show
that it is robust to changing environments. H-RCA does
not require specific hardware support nor any change to
the IEEE 802.11 protocol. This point is substantiated
with results from an experimental implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sen:2013:DIA,
author = "Sayandeep Sen and Tan Zhang and Syed Gilani and
Shreesha Srinath and Suman Banerjee and Sateesh
Addepalli",
title = "Design and implementation of an ``approximate''
communication system for wireless media applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1035--1048",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226470",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "All practical wireless communication systems are prone
to errors. At the symbol level, such wireless errors
have a well-defined structure: When a receiver decodes
a symbol erroneously, it is more likely that the
decoded symbol is a good ``approximation'' of the
transmitted symbol than a randomly chosen symbol among
all possible transmitted symbols. Based on this
property, we define approximate communication, a method
that exploits this error structure to natively provide
unequal error protection to data bits. Unlike
traditional [forward error correction (FEC)-based]
mechanisms of unequal error protection that consume
additional network and spectrum resources to encode
redundant data, the approximate communication technique
achieves this property at the PHY layer without
consuming any additional network or spectrum resources
(apart from a minimal signaling overhead). Approximate
communication is particularly useful to media delivery
applications that can benefit significantly from
unequal error protection of data bits. We show the
usefulness of this method to such applications by
designing and implementing an end-to-end media delivery
system, called Apex. Our Software Defined Radio
(SDR)-based experiments reveal that Apex can improve
video quality by 5-20 dB [peak signal-to-noise ratio
(PSNR)] across a diverse set of wireless conditions
when compared to traditional approaches. We believe
that mechanisms such as Apex can be a cornerstone in
designing future wireless media delivery systems under
any error-prone channel condition.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Srivastava:2013:BPL,
author = "Rahul Srivastava and Can Emre Koksal",
title = "Basic performance limits and tradeoffs in
energy-harvesting sensor nodes with finite data and
energy storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1049--1062",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2218123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As many sensor network applications require deployment
in remote and hard-to-reach areas, it is critical to
ensure that such networks are capable of operating
unattended for long durations. Consequently, the
concept of using nodes with energy replenishment
capabilities has been gaining popularity. However, new
techniques and protocols must be developed to maximize
the performance of sensor networks with energy
replenishment. Here, we analyze limits of the
performance of sensor nodes with limited energy, being
replenished at a variable rate. We provide a simple
localized energy management scheme that achieves a
performance close to that with an unlimited energy
source and at the same time keeps the probability of
complete battery discharge low. Based on the insights
developed, we address the problem of energy management
for energy-replenishing nodes with finite battery and
finite data buffer capacities. To this end, we give an
energy management scheme that achieves the optimal
utility asymptotically while keeping both the battery
discharge and data loss probabilities low.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghaderi:2013:IAP,
author = "Javad Ghaderi and R. Srikant",
title = "The impact of access probabilities on the delay
performance of {Q--CSMA} algorithms in wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1063--1075",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2215964",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been recently shown that queue-based carrier
sense multiple access (CSMA) algorithms are
throughput-optimal. In these algorithms, each link of
the wireless network has two parameters: a transmission
probability and an access probability. The transmission
probability of each link is chosen as an appropriate
function of its queue length, however the access
probabilities are simply regarded as some random
numbers since they do not play any role in establishing
the network stability. In this paper, we show that the
access probabilities control the mixing time of the
CSMA Markov chain and, as a result, affect the delay
performance of the CSMA. In particular, we derive
formulas that relate the mixing time to access
probabilities and use these to develop the following
guideline for choosing access probabilities: Each link
$i$ should choose its access probability equal to $ 1 /
(d_i + 1) $, where $ d_i $ is the number of links that
interfere with link $i$. Simulation results show that
this choice of access probabilities results in good
delay performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khakpour:2013:ITA,
author = "Amir R. Khakpour and Alex X. Liu",
title = "An information-theoretical approach to high-speed flow
nature identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1076--1089",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2219591",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper concerns the fundamental problem of
identifying the content nature of a flow--namely text,
binary, or encrypted--for the first time. We propose
Iustitia, a framework for identifying flow nature on
the fly. The key observation behind Iustitia is that
text flows have the lowest entropy and encrypted flows
have the highest entropy, while the entropy of binary
flows stands in between. We further extend Iustitia for
the finer-grained classification of binary flows so
that we can differentiate different types of binary
flows (such as image, video, and executables) and even
the file formats (such as JPEG and GIF for images, MPEG
and AVI for videos) carried by binary flows. The basic
idea of Iustitia is to classify flows using machine
learning techniques where a feature is the entropy of
every certain number of consecutive bytes. Our
experimental results show that the classification can
be done with high speed and high accuracy. On average,
Iustitia can classify flows with 88.27\% of accuracy
using a buffer size of 1 K with a classification time
of less than 10\% of packet interarrival time for
91.2\% of flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2013:MRG,
author = "Xiaoming Wang and Xiaoyong Li and Dmitri Loguinov",
title = "Modeling residual-geometric flow sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1090--1103",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2231435",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic monitoring and estimation of flow parameters
in high-speed routers have recently become challenging
as the Internet grew in both scale and complexity. In
this paper, we focus on a family of flow-size
estimation algorithms we call Residual-Geometric
Sampling (RGS), which generates a random point within
each flow according to a geometric random variable and
records all remaining packets in a flow counter. Our
analytical investigation shows that previous estimation
algorithms based on this method exhibit bias in
recovering flow statistics from the sampled
measurements. To address this problem, we derive a
novel set of unbiased estimators for RGS, validate them
using real Internet traces, and show that they provide
an accurate and scalable solution to Internet traffic
monitoring.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2013:PMS,
author = "Tsern-Huei Lee and Nai-Lun Huang",
title = "A pattern-matching scheme with high throughput
performance and low memory requirement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1104--1116",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2224881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Pattern-matching techniques have recently been applied
to network security applications such as intrusion
detection, virus protection, and spam filters. The
widely used Aho--Corasick (AC) algorithm can
simultaneously match multiple patterns while providing
a worst-case performance guarantee. However, as
transmission technologies improve, the AC algorithm
cannot keep up with transmission speeds in high-speed
networks. Moreover, it may require a huge amount of
space to store a two-dimensional state transition table
when the total length of patterns is large. In this
paper, we present a pattern-matching architecture
consisting of a stateful pre-filter and an AC-based
verification engine. The stateful pre-filter is optimal
in the sense that it is equivalent to utilizing all
previous query results. In addition, the filter can be
easily realized with bitmaps and simple bitwise-AND and
shift operations. The size of the two-dimensional state
transition table in our proposed architecture is
proportional to the number of patterns, as opposed to
the total length of patterns in previous designs. Our
proposed architecture achieves a significant
improvement in both throughput performance and memory
usage.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2013:UOS,
author = "Longbo Huang and Michael J. Neely",
title = "Utility optimal scheduling in energy-harvesting
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1117--1130",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230336",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we show how to achieve close-to-optimal
utility performance in energy-harvesting networks with
only finite capacity energy storage devices. In these
networks, nodes are capable of harvesting energy from
the environment. The amount of energy that can be
harvested is time-varying and evolves according to some
probability law.We develop an online algorithm, called
the Energy-limited Scheduling Algorithm (ESA), which
jointly manages the energy and makes power allocation
decisions for packet transmissions. ESA only has to
keep track of the amount of energy left at the network
nodes and does not require any knowledge of the
harvestable energy process. We show that ESA achieves a
utility that is within {$ O (\epsilon) $} of the
optimal, for any $ \epsilon > 0 $, while ensuring that
the network congestion and the required capacity of the
energy storage devices are deterministically
upper-bounded by bounds of size {$ O(1 / \epsilon) $}.
We then also develop the Modified-ESA (MESA) algorithm
to achieve the same {$ O(\epsilon) $} close-to-utility
performance, with the average network congestion and
the required capacity of the energy storage devices
being only {$ O([\log (1 / \epsilon)]^2) $}, which is
close to the theoretical lower bound {$ O(\log (1 /
\epsilon)) $}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karbasi:2013:RLI,
author = "Amin Karbasi and Sewoong Oh",
title = "Robust localization from incomplete local
information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1131--1144",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2220378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of localizing wireless devices
in an ad hoc network embedded in a d -dimensional
Euclidean space. Obtaining a good estimate of where
wireless devices are located is crucial in wireless
network applications including environment monitoring,
geographic routing, and topology control. When the
positions of the devices are unknown and only local
distance information is given, we need to infer the
positions from these local distance measurements. This
problem is particularly challenging when we only have
access to measurements that have limited accuracy and
are incomplete. We consider the extreme case of this
limitation on the available information, namely only
the connectivity information is available, i.e., we
only know whether a pair of nodes is within a fixed
detection range of each other or not, and no
information is known about how far apart they are.
Furthermore, to account for detection failures, we
assume that even if a pair of devices are within the
detection range, they fail to detect the presence of
one another with some probability, and this probability
of failure depends on how far apart those devices are.
Given this limited information, we investigate the
performance of a centralized positioning algorithm
MDS-MAP introduced by Shang et al. and a distributed
positioning algorithm HOP-TERRAIN introduced by
Savarese et al. In particular, for a network consisting
of n devices positioned randomly, we provide a bound on
the resulting error for both algorithms. We show that
the error is bounded, decreasing at a rate that is
proportional to R Critical/ R, where R Critical is the
critical detection range when the resulting random
network starts to be connected, and R is the detection
range of each device.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lopez-Perez:2013:DCR,
author = "David L{\'o}pez-P{\'e}rez and Xiaoli Chu and
Athanasios V. Vasilakos and Holger Claussen",
title = "On distributed and coordinated resource allocation for
interference mitigation in self-organizing {LTE}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1145--1158",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2218124",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a distributed and coordinated radio
resource allocation algorithm for orthogonal frequency
division multiple access (OFDMA)-based cellular
networks to self-organize efficient and stable
frequency reuse patterns. In the proposed radio
resource allocation algorithm, each cell independently
and dynamically allocates modulation and coding scheme
(MCS), resource block (RB), and transmit power to its
users in a way that its total downlink (DL) transmit
power is minimized, while users' throughput demands are
satisfied. Moreover, each cell informs neighboring
cells of the RBs that have been scheduled for its
cell-edge users' DL transmissions through message
passing. Accordingly, the neighboring cells abstain
from assigning high transmit powers to the specified
RBs. Extensive simulation results attempt to
demonstrate that DL power control on a per-RB basis may
play a key role in future networks, and show that the
distributed minimization of DL transmit power at each
cell, supported by intercell interference coordination,
is able to provide a 20\% improvement of network
throughput, considerably reduce the number of user
outages, and significantly enhance spatial reuse, as
compared to cutting-edge resource allocation schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarkar:2013:DFT,
author = "Rik Sarkar and Jie Gao",
title = "Differential forms for target tracking and aggregate
queries in distributed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1159--1172",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2220857",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Consider mobile targets in a plane and their movements
being monitored by a network such as a field of
sensors. We develop distributed algorithms for
in-network tracking and range queries for aggregated
data (for example, returning the number of targets
within any user given region). Our scheme stores the
target detection information locally in the network and
answers a query by examining the perimeter of the given
range. The cost of updating data about mobile targets
is proportional to the target displacement. The key
insight is to maintain in the sensor network a function
with respect to the target detection data on the graph
edges that is a differential form such that the
integral of this form along any closed curve C gives
the integral within the region bounded by C. The
differential form has great flexibility, making it
appropriate for tracking mobile targets. The basic
range query can be used to find a nearby target or any
given identifiable target with cost O(d), where d is
the distance to the target in question. Dynamic
insertion, deletion, coverage holes, and mobility of
sensor nodes can be handled with only local operations,
making the scheme suitable for a highly dynamic
network. It is extremely robust and capable of
tolerating errors in sensing and target localization.
Targets do not need to be identified for the tracking,
thus user privacy can be preserved. In this paper, we
only elaborate the advantages of differential forms in
tracking of mobile targets. Similar routines can be
applied for organizing many other types of
information--for example, streaming scalar sensor data
(such as temperature data field)--to support efficient
range queries. We demonstrate through analysis and
simulations that this scheme compares favorably to
existing schemes that use location services for
answering aggregate range queries of target detection
data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guan:2013:JOR,
author = "Zhangyu Guan and Tommaso Melodia and Dongfeng Yuan",
title = "Jointly optimal rate control and relay selection for
cooperative wireless video streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1173--1186",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2248020",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Physical-layer cooperation allows leveraging the
spatial diversity of wireless channels without
requiring multiple antennas on a single device.
However, most research in this field focuses on
optimizing physical-layer metrics, with little
consideration for network-wide and application-specific
performance measures. This paper studies cross-layer
design techniques for video streaming over cooperative
networks. The problem of joint rate control, relay
selection, and power allocation is formulated as a
mixed-integer nonlinear problem, with the objective of
maximizing the sum peak signal-to-noise ratio (PSNR) of
a set of concurrent video sessions. A global
optimization algorithm based on the branch and bound
framework and on convex relaxation of nonconvex
constraints is then proposed to solve the problem. The
proposed algorithm can provide a theoretical upper
bound on the achievable video quality and is shown to
provably converge to the optimal solution. In addition,
it is shown that cooperative relaying allows nodes to
save energy without leading to a perceivable decrease
in video quality. Based on this observation, an
uncoordinated, distributed, and localized
low-complexity algorithm is designed, for which we
derive conditions for convergence to a Nash equilibrium
(NE) of relay selection. The distributed algorithm is
also shown to achieve performance comparable in
practice to the optimal solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2013:MLV,
author = "Liang Zhang and Shigang Chen and Ying Jian and Yuguang
Fang and Zhen Mo",
title = "Maximizing lifetime vector in wireless sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1187--1200",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227063",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Maximizing the lifetime of a sensor network has been a
subject of intensive study. However, much prior work
defines the network lifetime as the time before the
first data-generating sensor in the network runs out of
energy or is not reachable to the sink due to network
partition. The problem is that even though one sensor
is out of operation, the rest of the network may well
remain operational, with other sensors generating
useful data and delivering those data to the sink.
Hence, instead of just maximizing the time before the
first sensor is out of operation, we should maximize
the lifetime vector of the network, consisting of the
lifetimes of all sensors, sorted in ascending order.
For this problem, there exists only a centralized
algorithm that solves a series of linear programming
problems with high-order complexities. This paper
proposes a fully distributed algorithm that runs
iteratively. Each iteration produces a lifetime vector
that is better than the vector produced by the previous
iteration. Instead of giving the optimal result in one
shot after lengthy computation, the proposed
distributed algorithm has a result at any time, and the
more time spent gives the better result.We show that
when the algorithm stabilizes, its result produces the
maximum lifetime vector. Furthermore, simulations
demonstrate that the algorithm is able to converge
rapidly toward the maximum lifetime vector with low
overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2013:EGC,
author = "Yeim-Kuan Chang and Cheng-Chien Su and Yung-Chieh Lin
and Sun-Yuan Hsieh",
title = "Efficient gray-code-based range encoding schemes for
packet classification in {TCAM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1201--1214",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2220566",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An efficient ternary content addressable memory (TCAM)
encoding scheme using a binary reflected Gray code
(BRGC) and the concept of elementary intervals is
presented for efficiently storing arbitrary ranges in
TCAM. The proposed layered BRGC range encoding scheme
(L-BRGC) groups ranges into BRGC range sets in which
each range can be encoded into a single ternary vector.
The results of experiments performed on real-life and
synthesized rule tables show that L-BRGC consumes less
TCAM than all the existing range encoding schemes for
all rule tables, except that the direct conversion
scheme (EIGC) using elementary intervals and BRGC codes
performs best for a small real-life ACL rule table.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2013:FSD,
author = "Xinzhou Wu and Saurabha Tavildar and Sanjay Shakkottai
and Tom Richardson and Junyi Li and Rajiv Laroia and
Aleksandar Jovicic",
title = "{FlashLinQ}: a synchronous distributed scheduler for
peer-to-peer ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1215--1228",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2264633",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes FlashLinQ--a synchronous
peer-to-peer wireless PHY/MAC network architecture.
FlashLinQ leverages the fine-grained parallel channel
access offered by OFDM and incorporates an analog
energy-level-based signaling scheme that enables
signal-to-interference ratio (SIR)-based distributed
scheduling. This new signaling mechanism, and the
concomitant scheduling algorithm, enables efficient
channel-aware spatial resource allocation, leading to
significant gains over a CSMA/CA system using RTS/CTS.
FlashLinQ is a complete system architecture including:
(1) timing and frequency synchronization derived from
cellular spectrum; (2) peer discovery; (3) link
management; and (4) channel-aware distributed power,
data rate, and link scheduling. FlashLinQ has been
implemented for operation over licensed spectrum on a
digital signal processor/field-programmable gate array
(DSP/FPGA) platform. In this paper, we present
FlashLinQ performance results derived from both
measurements and simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hsu:2013:EST,
author = "Chih-Cheng Hsu and Ming-Shing Kuo and Cheng-Fu Chou
and Kate Ching-Ju Lin",
title = "The elimination of spatial-temporal uncertainty in
underwater sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1229--1242",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2220155",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Since data in underwater sensor networks (UWSNs) is
transmitted by acoustic signals, the characteristics of
a UWSN are different from those of a terrestrial sensor
network. Specifically, due to the high propagation
delay of acoustic signals in UWSNs, referred as
spatial-temporal uncertainty, current terrestrial MAC
schemes do not work well in UWSNs. Hence, we consider
spatial-temporal uncertainty in the design of an
energy-efficient TDMA-based MAC protocol for UWSNs. We
first translate the TDMA-based scheduling problem in
UWSNs into a special vertex-coloring problem in the
context of a spatial-temporal conflict graph (ST-CG)
that describes explicitly the conflict delays among
transmission links. With the help of the ST-CG, we
propose two novel heuristic approaches: (1) the
traffic-based one-step trial approach (TOTA) to solve
the coloring problem in a centralized fashion; and for
scalability, (2) the distributed traffic-based one-step
trial approach (DTOTA) to assign the data schedule for
tree-based routing structures in a distributed manner.
In addition, a mixed integer linear programming (MILP)
model is derived to obtain a theoretical bound for the
TDMA-based scheduling problem in UWSNs. Finally, a
comprehensive performance study is presented, showing
that both TOTA and DTOTA guarantee collision-free
transmission. They thus outperform existing MAC schemes
such as S-MAC, ECDiG, and T-Lohi in terms of network
throughput and energy consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2013:EOS,
author = "Zhenghao Zhang and Steven Bronson and Jin Xie and Wei
Hu",
title = "Employing the one-sender-multiple-receiver technique
in wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1243--1255",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2222436",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the
One-Sender-Multiple-Receiver (OSMR) transmission
technique, which allows one sender to send to multiple
receivers simultaneously by utilizing multiple antennas
at the sender. To study the physical-layer
characteristics of OSMR, we implement a prototype OSMR
transmitter/receiver with GNU software defined radio
and conduct experiments in a university building. Our
results are positive and show that wireless channels
allow OSMR for a significant percentage of the time.
Motivated by our physical-layer study, we propose
extensions to the 802.11 MAC protocol to support OSMR
transmission, which is backward-compatible with
existing 802.11 devices. We also note that the access
point (AP) needs a packet scheduling algorithm to
efficiently exploit OSMR. We show that the scheduling
problem without considering the packet transmission
overhead can be formalized as a linear programming
problem, but the scheduling problem considering the
overhead is NP-hard. We then propose a practical
scheduler based on a two-phase algorithm that can also
handle channel fluctuations. We test the proposed
protocol and algorithm with simulations driven by
traffic traces collected from wireless LANs and
channel-state traces collected from our experiments,
and the results show that OSMR significantly improves
the downlink performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lakshminarayana:2013:MMI,
author = "Subhash Lakshminarayana and Atilla Eryilmaz",
title = "Multirate multicasting with intralayer network
coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1256--1269",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226909",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multirate multicasting is a generalization of
single-rate multicasting to prevent destinations with
good connections from being limited by the capacity of
bottleneck connections. While multirate multicasting
has been traditionally performed over fixed trees,
advances in network coding theory have enabled higher
throughput and have helped us move beyond the
restriction of tree structures for routing the
multicast data. In this paper, we address the questions
of optimal rate allocation and low-complexity network
coding solutions to the problem of multirate
multicasting in general multihop networks. Our work
considers intralayer network coding capabilities, where
the session is conceptually divided into layers
optimally and coding is performed across packets
belonging to the same layer. Our approach differs from
earlier works in this domain in its separation of the
problem into rate allocation and content distribution
items, which allows a number of optimization and
graphical techniques in their solution. Noting the
complexities involved in the optimal rate allocation
and content distribution solutions, we then propose and
investigate two novel approaches for reducing the
complexity of the original scheme for more practical
implementation based on a layered multicasting
mechanism and nested optimization approach. We
demonstrate the implementation advantages of these
low-complexity schemes via extensive numerical
studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2013:DDC,
author = "Shouling Ji and Zhipeng Cai",
title = "Distributed data collection in large-scale
asynchronous wireless sensor networks under the
generalized physical interference model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1270--1283",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2221165",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks (WSNs) are more likely to be
distributed asynchronous systems. In this paper, we
investigate the achievable data collection capacity of
realistic distributed asynchronous WSNs. Our main
contributions include five aspects. First, to avoid
data transmission interference, we derive an R o-proper
carrier-sensing range ( R o --- PCR) under the
generalized physical interference model, where R o is
the satisfied threshold of data receiving rate. Taking
R o --- PCR as its carrier-sensing range, any sensor
node can initiate a data transmission with a guaranteed
data receiving rate. Second, based on R o --- PCR, we
propose a Distributed Data Collection (DDC) algorithm
with fairness consideration. Theoretical analysis of
DDC surprisingly shows that its achievable network
capacity is order-optimal and independent of network
size. Thus, DDC is scalable. Third, we discuss how to
apply R o --- PCR to the distributed data aggregation
problem and propose a Distributed Data Aggregation
(DDA) algorithm. The delay performance of DDA is also
analyzed. Fourth, to be more general, we study the
delay and capacity of DDC and DDA under the Poisson
node distribution model. The analysis demonstrates that
DDC is also scalable and order-optimal under the
Poisson distribution model. Finally, we conduct
extensive simulations to validate the performance of
DDC and DDA.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Himura:2013:SGB,
author = "Yosuke Himura and Kensuke Fukuda and Kenjiro Cho and
Pierre Borgnat and Patrice Abry and Hiroshi Esaki",
title = "Synoptic graphlet: bridging the gap between supervised
and unsupervised profiling of host-level network
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1284--1297",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226603",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "End-host profiling by analyzing network traffic comes
out as a major stake in traffic engineering. Graphlet
constitutes an efficient and common framework for
interpreting host behaviors, which essentially consists
of a visual representation as a graph. However,
graphlet analyses face the issues of choosing between
supervised and unsupervised approaches. The former can
analyze a priori defined behaviors but is blind to
undefined classes, while the latter can discover new
behaviors at the cost of difficult a posteriori
interpretation. This paper aims at bridging the gap
between the two. First, to handle unknown classes,
unsupervised clustering is originally revisited by
extracting a set of graphlet-inspired attributes for
each host. Second, to recover interpretability for each
resulting cluster, a synoptic graphlet, defined as a
visual graphlet obtained by mapping from a cluster, is
newly developed. Comparisons against supervised
graphlet-based, port-based, and payload-based
classifiers with two datasets demonstrate the
effectiveness of the unsupervised clustering of
graphlets and the relevance of the a posteriori
interpretation through synoptic graphlets. This
development is further complemented by studying
evolutionary tree of synoptic graphlets, which
quantifies the growth of graphlets when increasing the
number of inspected packets per host.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Duffy:2013:DCS,
author = "Ken R. Duffy and Charles Bordenave and Douglas J.
Leith",
title = "Decentralized constraint satisfaction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1298--1308",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2222923",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We show that several important resource allocation
problems in wireless networks fit within the common
framework of constraint satisfaction problems (CSPs).
Inspired by the requirements of these applications,
where variables are located at distinct network devices
that may not be able to communicate but may interfere,
we define natural criteria that a CSP solver must
possess in order to be practical. We term these
algorithms decentralized CSP solvers. The best known
CSP solvers were designed for centralized problems and
do not meet these criteria. We introduce a stochastic
decentralized CSP solver, proving that it will find a
solution in almost surely finite time, should one
exist, and also showing it has many practically
desirable properties. We benchmark the algorithm's
performance on a well-studied class of CSPs, random
k-SAT, illustrating that the time the algorithm takes
to find a satisfying assignment is competitive with
stochastic centralized solvers on problems with order a
thousand variables despite its decentralized nature. We
demonstrate the solver's practical utility for the
problems that motivated its introduction by using it to
find a noninterfering channel allocation for a network
formed from data from downtown Manhattan.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vehel:2013:LDM,
author = "Jacques L{\'e}vy V{\'e}hel and Michal Rams",
title = "Large deviation multifractal analysis of a class of
additive processes with correlated nonstationary
increments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1309--1321",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2229469",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a family of stochastic processes built
from infinite sums of independent positive random
functions on R +. Each of these functions increases
linearly between two consecutive negative jumps, with
the jump points following a Poisson point process on
R+. The motivation for studying these processes stems
from the fact that they constitute simplified models
for TCP traffic. Such processes bear some analogy with
L{\'e}vy processes, but are more complex since their
increments are neither stationary nor independent. In
the work of Barral and L{\'e}vy V{\'e}hel, the
Hausdorff multifractal spectrum of these processes was
computed. We are interested here in their Large
Deviation and Legendre multifractal spectra. These
``statistical'' spectra are seen to give, in this case,
a richer information than the ``geometrical'' Hausdorff
spectrum. In addition, our results provide a firm
theoretical basis for the empirical discovery of the
multifractal nature of TCP traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Caragiannis:2013:EIM,
author = "Ioannis Caragiannis and Michele Flammini and Luca
Moscardelli",
title = "An exponential improvement on the {MST} heuristic for
minimum energy broadcasting in ad hoc wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1322--1331",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2223483",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a new approximation algorithm for the
Minimum Energy Broadcast Routing (MEBR) problem in ad
hoc wireless networks that achieves an exponentially
better approximation factor compared to the well-known
Minimum Spanning Tree (MST) heuristic. Namely, for any
instance where a minimum spanning tree of the set of
stations is guaranteed to cost at most \rho \geq 2
times the cost of an optimal solution for MEBR, we
prove that our algorithm achieves an approximation
ratio bounded by 2 \ln \rho --- 2 \ln 2 +2. This result
is particularly relevant for its consequences on
Euclidean instances where we significantly improve
previous results. In this respect, our experimental
analysis confirms the better performance of the
algorithm also in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Galluccio:2013:GMG,
author = "Laura Galluccio and Giacomo Morabito and Sergio
Palazzo",
title = "{GEographic Multicast (GEM)} for dense wireless
networks: protocol design and performance analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1332--1346",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2236351",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multicast is necessary in several wireless multihop
communication scenarios. Accordingly, it has received a
lot of attention in the past, and several multicast
protocols have been proposed. Nevertheless, traditional
solutions typically incur poor efficiency when there is
a large number of nodes, topology changes occur
frequently, and/or the traffic load is low. Geographic
multicast has been recently exploited to solve the
problems mentioned above. However, these solutions
require exchange of topology information that, again,
can lead to excessive overhead. In this paper, we
propose a new geographic multicast protocol denoted as
GEM, which is inspired by the Euclidean Steiner Tree
(EST) theory and does not require any information
exchange for routing purposes. Therefore, it is very
efficient and scalable in wireless networking scenarios
where other schemes achieve low performance, especially
in terms of energy consumption. In this paper, we also
derive some key properties of GEM that allow us to
characterize the protocol performance. As a major
contribution, we show that these properties are quite
general and apply to a wide range of algorithms
inspired by the EST. Simulation results assess the
derived properties and confirm the effectiveness of the
proposed GEM scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aryafar:2013:SCC,
author = "Ehsan Aryafar and Theodoros Salonidis and Jingpu Shi
and Edward Knightly",
title = "Synchronized {CSMA} contention: model, implementation,
and evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1349--1362",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2228225",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A class of carrier sense multiple access (CSMA)
protocols used in a broad range of wireless
applications uses synchronized contention where nodes
periodically contend at intervals of fixed duration.
While several models exist for asynchronous CSMA
contention used in protocols like IEEE 802.11 MAC, no
model exists for synchronized CSMA contention that also
incorporates realistic factors like clock drifts. In
this paper, we introduce a model that quantifies the
interplay of clock drifts with contention window size,
control packet size, and carrier sense regulated by
usage of guard time. Using a field programmable gate
array (FPGA)-based MAC protocol implementation and
controlled experiments on a wireless testbed, we
evaluate the model predictions on the isolated and
combined impact of these key performance factors to
per-flow throughput and fairness properties in both
single-hop and multihop networks. Our model and
experimental evaluation reveal conditions on protocol
parameters under which the throughput of certain flows
can exponentially decrease; while at the same time, it
enables solutions that can offset such problems in a
predictable manner.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cello:2013:OCC,
author = "Marco Cello and Giorgio Gnecco and Mario Marchese and
Marcello Sanguineti",
title = "Optimality conditions for coordinate-convex policies
in {CAC} with nonlinear feasibility boundaries",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1363--1377",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2222924",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Optimality conditions for Call Admission Control (CAC)
problems with nonlinearly constrained feasibility
regions and K classes of users are derived. The adopted
model is a generalized stochastic knapsack, with
exponentially distributed interarrival times of the
objects. Call admission strategies are restricted to
the family of Coordinate-Convex (CC) policies. For $ K
= 2 $ classes of users, both general structural
properties of the optimal CC policies and structural
properties that depend on the revenue ratio are
investigated. Then, the analysis is extended to the
case $ K > 2 $. The theoretical results are exploited
to narrow the set of admissible solutions to the
associated knapsack problem, i.e., the set of CC
policies to which an optimal one belongs. With respect
to results available in the literature, less
restrictive conditions on the optimality of the
complete-sharing policy are obtained. To illustrate the
role played by the theoretical results on the
combinatorial CAC problem, simulation results are
presented, which show how the number of candidate
optimal CC policies dramatically decreases as the
derived optimality conditions are imposed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2013:DRS,
author = "Minghong Lin and Adam Wierman and Lachlan L. H. Andrew
and Eno Thereska",
title = "Dynamic right-sizing for power-proportional data
centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1378--1391",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226216",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Power consumption imposes a significant cost for data
centers implementing cloud services, yet much of that
power is used to maintain excess service capacity
during periods of low load. This paper investigates how
much can be saved by dynamically ``right-sizing'' the
data center by turning off servers during such periods
and how to achieve that saving via an online algorithm.
We propose a very general model and prove that the
optimal offline algorithm for dynamic right-sizing has
a simple structure when viewed in reverse time, and
this structure is exploited to develop a new ``lazy''
online algorithm, which is proven to be 3-competitive.
We validate the algorithm using traces from two real
data-center workloads and show that significant cost
savings are possible. Additionally, we contrast this
new algorithm with the more traditional approach of
receding horizon control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jindal:2013:ECC,
author = "Apoorva Jindal and Konstantinos Psounis",
title = "On the efficiency of {CSMA-CA} scheduling in wireless
multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1392--1406",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2225843",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper establishes that random access scheduling
schemes, and more specifically CSMA-CA, yield
exceptionally good performance in the context of
wireless multihop networks. While it is believed that
CSMA-CA performs significantly worse than optimal, this
belief is usually based on experiments that use rate
allocation mechanisms that grossly underutilize the
available capacity that random access provides. To
establish our thesis, we first compare the achievable
rate region of CSMA-CA and optimal in a number of
carefully constructed multihop topologies and find that
CSMA-CA is always within 48\% of the optimal. Motivated
by this result, we next characterize the worst-case
performance of CSMA-CA in neighborhood topologies
representing the congested regions of larger multihop
topologies by deriving the neighborhood topology that
yields the worst-case throughput ratio for CSMA-CA and
find that in neighborhood topologies with less than 20
edges: (1) CSMA-CA is never worse than 16\% of the
optimal when ignoring physical-layer constraints; and
(2) in any realistic topology with geometric
constraints due to the physical layer, CSMA-CA is never
worse than 30\% of the optimal. Considering that
maximal scheduling achieves much lower bounds than the
above, and greedy maximal scheduling, which is one of
the best known distributed approximation of an optimal
scheduler, achieves similar worst-case bounds, CSMA-CA
is surprisingly efficient.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2013:BNC,
author = "Xiaolan Zhang and Giovanni Neglia and Jim Kurose and
Don Towsley and Haixiang Wang",
title = "Benefits of network coding for unicast application in
disruption-tolerant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1407--1420",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2224369",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the benefits of applying
a form of network coding known as random linear coding
(RLC) to unicast applications in disruption-tolerant
networks (DTNs). Under RLC, nodes store and forward
random linear combinations of packets as they encounter
each other. For the case of a single group of packets
originating from the same source and destined for the
same destination, we prove a lower bound on the
probability that the RLC scheme achieves the minimum
time to deliver the group of packets. Although RLC
significantly reduces group delivery delays, it fares
worse in terms of average packet delivery delay and
network transmissions. When replication control is
employed, RLC schemes reduce group delivery delays
without increasing the number of transmissions. In
general, the benefits achieved by RLC are more
significant under stringent resource (bandwidth and
buffer) constraints, limited signaling, highly dynamic
networks, and when applied to packets in the same flow.
For more practical settings with multiple continuous
flows in the network, we show the importance of
deploying RLC schemes with a carefully tuned
replication control in order to achieve reduction in
average delay, which is observed to be as large as 20\%
when buffer space is constrained.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cuevas:2013:UIC,
author = "Rub{\'e}n Cuevas and Michal Kryczka and Angel Cuevas
and Sebastian Kaune and Carmen Guerrero and Reza
Rejaie",
title = "Unveiling the incentives for content publishing in
popular {BitTorrent} portals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1421--1435",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2228224",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "BitTorrent is the most popular peer-to-peer (P2P)
content delivery application where individual users
share various types of content with tens of thousands
of other users. The growing popularity of BitTorrent is
primarily due to the availability of valuable content
without any cost for the consumers. However, apart from
the required resources, publishing valuable (and often
copyrighted) content has serious legal implications for
the users who publish the material. This raises the
question that whether (at least major) content
publishers behave in an altruistic fashion or have
other motives such as financial incentives. In this
paper, we identify the content publishers of more than
55 K torrents in two major BitTorrent portals and
examine their characteristics. We discover that around
100 publishers are responsible for publishing 67\% of
the content, which corresponds to 75\% of the
downloads. Our investigation reveals several key
insights about major publishers. First, antipiracy
agencies and malicious users publish ``fake'' files to
protect copyrighted content and spread malware,
respectively. Second, excluding the fake publishers,
content publishing in major BitTorrent portals appears
to be largely driven by companies that try to attract
consumers to their own Web sites for financial gain.
Finally, we demonstrate that profit-driven publishers
attract more loyal consumers than altruistic top
publishers, whereas the latter have a larger fraction
of loyal consumers with a higher degree of loyalty than
the former.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gatmir-Motahari:2013:TCB,
author = "Sara Gatmir-Motahari and Hui Zang and Phyllis
Reuther",
title = "Time-clustering-based place prediction for wireless
subscribers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1436--1446",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2225443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many of today's applications such as cellular network
management, prediction and control of the spread of
biological and mobile viruses, etc., depend on the
modeling and prediction of human locations. However,
having widespread wireless localization technology,
such as pervasive cell-tower/GPS location estimation
available for only the last few years, many factors
that impact human mobility patterns remain under
researched. Further more, many industries including
telecom providers are still in need of low-cost and
simple location/place prediction methods that can be
implemented on a large scale. In this paper, we focus
on ``temporal factors'' and demonstrate that they
significantly impact randomness, size, and probability
distribution of people's movements. We also use this
information to make simple and inexpensive prediction
models for subscribers' visited places. We monitored
individuals for a month and divided days and hours into
segments for each user to obtain probability
distribution of their places for each segment of time
intervals and observed major improvement in future
``time-based'' predictions of their location compared
to when temporal factors were not considered. In
addition to quantifying the improvement in place
prediction, we show that significant improvements can
actually be achieved through an intuitive division of
time intervals with no added computational
complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Arslan:2013:RMS,
author = "Mustafa Y. Arslan and Jongwon Yoon and Karthikeyan
Sundaresan and Srikanth V. Krishnamurthy and Suman
Banerjee",
title = "A resource management system for interference
mitigation in enterprise {OFDMA} femtocells",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1447--1460",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2226245",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To meet the capacity demands from ever-increasing
mobile data usage, mobile network operators are moving
toward smaller cell structures. These small cells,
called femtocells, use sophisticated air interface
technologies such as orthogonal frequency division
multiple access (OFDMA). While femtocells are expected
to provide numerous benefits such as energy efficiency
and better throughput, the interference resulting from
their dense deployments prevents such benefits from
being harnessed in practice. Thus, there is an evident
need for a resource management solution to mitigate the
interference that occurs between collocated femtocells.
In this paper, we design and implement one of the first
resource management systems, FERMI, for OFDMA-based
femtocell networks. As part of its design, FERMI: (1)
provides resource isolation in the frequency domain (as
opposed to time) to leverage power pooling across cells
to improve capacity; (2) uses measurement-driven
triggers to intelligently distinguish clients that
require just link adaptation from those that require
resource isolation; (3) incorporates mechanisms that
enable the joint scheduling of both types of clients in
the same frame; and (4) employs efficient, scalable
algorithms to determine a fair resource allocation
across the entire network with high utilization and low
overhead. We implement FERMI on a prototype four-cell
WiMAX femtocell testbed and show that it yields
significant gains over conventional approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2013:ADF,
author = "Reuven Cohen and Ilia Nudelman and Gleb Polevoy",
title = "On the admission of dependent flows in powerful sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1461--1471",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227792",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we define and study a new problem,
referred to as the Dependent Unsplittable Flow Problem
(D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor
networks, but we believe it has important applications
on the admission of large flows in other networks as
well. In order to optimize the selection of flows
transmitted to the gateway, D-UFP takes into account
possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no
good approximation is known. Then, we address two
special cases of this problem: the case where all the
sensors have a shared channel and the case where the
sensors form a mesh and route to the gateway over a
spanning tree.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gomaa:2013:EIC,
author = "Hazem Gomaa and Geoffrey G. Messier and Carey
Williamson and Robert Davies",
title = "Estimating instantaneous cache hit ratio using
{Markov} chain analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1472--1483",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a novel analytical model for
estimating the cache hit ratio as a function of time.
The cache may not reach the steady-state hit ratio when
the number of Web objects, object popularity, and/or
caching resources themselves are subject to change.
Hence, the only way to quantify the hit ratio
experienced by Web users is to calculate the
instantaneous hit ratio. The proposed analysis
considers a single Web cache with infinite or finite
capacity. For a cache with finite capacity, two
replacement policies are considered: Least Recently
Used (LRU) and First-In-First-Out (FIFO). Based on the
insights from the proposed analytical model, we propose
a new replacement policy, called Frequency-Based-FIFO
(FB-FIFO). The results show that FB-FIFO outperforms
both LRU and FIFO, assuming that the number of Web
objects is fixed. Assuming that new popular objects are
generated periodically, the results show that FB-FIFO
adapts faster than LRU and FIFO to the changes in the
popularity of the cached objects when the cache
capacity is large relative to the number of newly
generated objects.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Filippini:2013:NOR,
author = "Ilario Filippini and Eylem Ekici and Matteo Cesana",
title = "A new outlook on routing in cognitive radio networks:
minimum-maintenance-cost routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1484--1498",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2236569",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio networks (CRNs) are composed of
frequency-agile radio devices that allow licensed
(primary) and unlicensed (secondary) users to coexist,
where secondary users opportunistically access channels
without interfering with the operation of primary ones.
From the perspective of secondary users, spectrum
availability is a time-varying network resource over
which multihop end-to-end connections must be
maintained. In this paper, a theoretical outlook on the
problem of routing secondary user flows in a CRN is
provided. The investigation aims to characterize
optimal sequences of routes over which a secondary flow
is maintained. The optimality is defined according to a
novel metric that considers the maintenance cost of a
route as channels, and/or links must be switched due to
the primary user activity. Different from the
traditional notion of route stability, the proposed
approach considers subsequent path selections, as well.
The problem is formulated as an integer programming
optimization model. Properties of the problem are also
formally introduced and leveraged to design a heuristic
algorithm when information on primary user activity is
not complete. Numerical results are presented to assess
the optimality gap of the heuristic routing algorithm
in realistic CRN scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2013:CQF,
author = "Wei Wang and Donghyun Kim and Min Kyung An and Wei Gao
and Xianyue Li and Zhao Zhang and Weili Wu",
title = "On construction of quality fault-tolerant virtual
backbone in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1499--1510",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227791",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of computing
quality fault-tolerant virtual backbone in homogeneous
wireless network, which is defined as the k -connected
m -dominating set problem in a unit disk graph. This
problem is NP-hard, and thus many efforts have been
made to find a constant factor approximation algorithm
for it, but never succeeded so far with arbitrary k
\geq 3 and m \geq 1 pair. We propose a new strategy for
computing a smaller-size 3-connected m -dominating set
in a unit disk graph with any m \geq 1. We show the
approximation ratio of our algorithm is constant and
its running time is polynomial. We also conduct a
simulation to examine the average performance of our
algorithm. Our result implies that while there exists a
constant factor approximation algorithm for the k
-connected m -dominating set problem with arbitrary k
\leq 3 and m \geq 1 pair, the k -connected m
-dominating set problem is still open with k > 3.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liao:2013:DDM,
author = "Yongjun Liao and Wei Du and Pierre Geurts and Guy
Leduc",
title = "{DMFSGD}: a decentralized matrix factorization
algorithm for network distance prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1511--1524",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2228881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The knowledge of end-to-end network distances is
essential to many Internet applications. As active
probing of all pairwise distances is infeasible in
large-scale networks, a natural idea is to measure a
few pairs and to predict the other ones without
actually measuring them. This paper formulates the
prediction problem as matrix completion where the
unknown entries in a pairwise distance matrix
constructed from a network are to be predicted. By
assuming that the distance matrix has low-rank
characteristics, the problem is solvable by low-rank
approximation based on matrix factorization. The new
formulation circumvents the well-known drawbacks of
existing approaches based on Euclidean embedding. A new
algorithm, so-called Decentralized Matrix Factorization
by Stochastic Gradient Descent (DMFSGD), is proposed.
By letting network nodes exchange messages with each
other, the algorithm is fully decentralized and only
requires each node to collect and to process local
measurements, with neither explicit matrix
constructions nor special nodes such as landmarks and
central servers. In addition, we compared
comprehensively matrix factorization and Euclidean
embedding to demonstrate the suitability of the former
on network distance prediction. We further studied the
incorporation of a robust loss function and of
nonnegativity constraints. Extensive experiments on
various publicly available datasets of network delays
show not only the scalability and the accuracy of our
approach, but also its usability in real Internet
applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Agarwal:2013:RWN,
author = "Pankaj K. Agarwal and Alon Efrat and Shashidhara K.
Ganjugunte and David Hay and Swaminathan Sankararaman
and Gil Zussman",
title = "The resilience of {WDM} networks to probabilistic
geographical failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1525--1538",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2232111",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Telecommunications networks, and in particular optical
WDM networks, are vulnerable to large-scale failures in
their physical infrastructure, resulting from physical
attacks (such as an electromagnetic pulse attack) or
natural disasters (such as solar flares, earthquakes,
and floods). Such events happen at specific
geographical locations and disrupt specific parts of
the network, but their effects cannot be determined
exactly in advance. Therefore, we provide a unified
framework to model network vulnerability when the event
has a probabilistic nature, defined by an arbitrary
probability density function. Our framework captures
scenarios with a number of simultaneous attacks, when
network components consist of several dependent
subcomponents, and in which either a 1 + 1 or a 1:1
protection plan is in place. We use computational
geometric tools to provide efficient algorithms to
identify vulnerable points within the network under
various metrics. Then, we obtain numerical results for
specific backbone networks, demonstrating the
applicability of our algorithms to real-world
scenarios. Our novel approach allows to identify
locations that require additional protection efforts
(e.g., equipment shielding). Overall, the paper
demonstrates that using computational geometric
techniques can significantly contribute to our
understanding of network resilience.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2013:DBB,
author = "Bo Ji and Changhee Joo and Ness B. Shroff",
title = "Delay-based back-pressure scheduling in multihop
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1539--1552",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227790",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Scheduling is a critical and challenging resource
allocation mechanism for multihop wireless networks. It
is well known that scheduling schemes that favor links
with larger queue length can achieve high throughput
performance. However, these queue-length-based schemes
could potentially suffer from large (even infinite)
packet delays due to the well-known last packet
problem, whereby packets belonging to some flows may be
excessively delayed due to lack of subsequent packet
arrivals. Delay-based schemes have the potential to
resolve this last packet problem by scheduling the link
based on the delay the packet has encountered. However,
characterizing throughput optimality of these
delay-based schemes has largely been an open problem in
multihop wireless networks (except in limited cases
where the traffic is single-hop). In this paper, we
investigate delay-based scheduling schemes for multihop
traffic scenarios with fixed routes. We develop a
scheduling scheme based on a new delay metric and show
that the proposed scheme achieves optimal throughput
performance. Furthermore, we conduct simulations to
support our analytical results and show that the
delay-based scheduler successfully removes excessive
packet delays, while it achieves the same throughput
region as the queue-length-based scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Banchs:2013:GTA,
author = "Albert Banchs and Andres Garcia-Saavedra and Pablo
Serrano and Joerg Widmer",
title = "A game-theoretic approach to distributed opportunistic
scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1553--1566",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2228500",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed opportunistic scheduling (DOS) is
inherently more difficult than conventional
opportunistic scheduling due to the absence of a
central entity that knows the channel state of all
stations. With DOS, stations use random access to
contend for the channel and, upon winning a contention,
they measure the channel conditions. After measuring
the channel conditions, a station only transmits if the
channel quality is good; otherwise, it gives up the
transmission opportunity. The distributed nature of DOS
makes it vulnerable to selfish users: By deviating from
the protocol and using more transmission opportunities,
a selfish user can gain a greater share of wireless
resources at the expense of ``well-behaved'' users. In
this paper, we address the problem of selfishness in
DOS from a game-theoretic standpoint. We propose an
algorithm that satisfies the following properties: (1)
When all stations implement the algorithm, the wireless
network is driven to the optimal point of operation;
and (2) one or more selfish stations cannot obtain any
gain by deviating from the algorithm. The key idea of
the algorithm is to react to a selfish station by using
a more aggressive configuration that (indirectly)
punishes this station. We build on multivariable
control theory to design a mechanism for punishment
that is sufficiently severe to prevent selfish
behavior, yet not so severe as to render the system
unstable. We conduct a game-theoretic analysis based on
repeated games to show the algorithm's effectiveness
against selfish stations. These results are confirmed
by extensive simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2013:HFP,
author = "Myungjin Lee and Nick Duffield and Ramana Rao
Kompella",
title = "High-fidelity per-flow delay measurements with
reference latency interpolation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1567--1580",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2227793",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "New applications such as soft real-time data center
applications, algorithmic trading, and high-performance
computing require extremely low latency (in
microseconds) from networks. Network operators today
lack sufficient fine-grain measurement tools to detect,
localize, and repair delay spikes that cause
application service level agreement (SLA) violations. A
recently proposed solution called LDA provides a
scalable way to obtain latency, but only provides
aggregate measurements. However, debugging
application-specific problems requires per-flow
measurements since different flows may exhibit
significantly different characteristics even when they
are traversing the same link. To enable fine-grained
per-flow measurements in routers, we propose a new
scalable architecture called reference latency
interpolation (RLI) that is based on our observation
that packets potentially belonging to different flows
that are closely spaced to each other exhibit similar
delay properties. In our evaluation using simulations
over real traces, we show that while having small
overhead, RLI achieves a median relative error of 12\%
and one to two orders of magnitude higher accuracy than
previous per-flow measurement solutions. We also
observe RLI achieves as high accuracy as LDA in
aggregate latency estimation, and RLI outperforms LDA
in standard deviation estimation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sappidi:2013:MAT,
author = "Rajasekhar Sappidi and Andr{\'e} Girard and Catherine
Rosenberg",
title = "Maximum achievable throughput in a wireless sensor
network using in-network computation for statistical
functions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1581--1594",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many applications require the sink to compute a
function of the data collected by the sensors. Instead
of sending all the data to the sink, the intermediate
nodes could process the data they receive to
significantly reduce the volume of traffic transmitted:
this is known as in-network computation. Instead of
focusing on asymptotic results for large networks as is
the current practice, we are interested in explicitly
computing the maximum achievable throughput of a given
network when the sink is interested in the first M
statistical moments of the collected data. Here, the k
th statistical moment is defined as the expectation of
the k th power of the data. Flow models have been
routinely used in multihop wireless networks when there
is no in-network computation, and they are typically
tractable for relatively large networks. However,
deriving such models is not obvious when in-network
computation is allowed. We develop a discrete-time
model for the real-time network operation and perform
two transformations to obtain a flow model that keeps
the essence of in-network computation. This gives an
upper bound on the maximum achievable throughput. To
show its tightness, we derive a numerical lower bound
by computing a solution to the discrete-time model
based on the solution to the flow model. This lower
bound turns out to be close to the upper bound, proving
that the flow model is an excellent approximation to
the discrete-time model. We then provide several
engineering insights on these networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aryafar:2013:AAB,
author = "Ehsan Aryafar and Mohammad Ali Khojastepour and
Karthik Sundaresan and Sampath Rangarajan and Edward
Knightly",
title = "{ADAM}: an adaptive beamforming system for
multicasting in wireless {LANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1595--1608",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2228501",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present the design and implementation of ADAM, the
first adaptive beamforming-based multicast system and
experimental framework for indoor wireless
environments. ADAM addresses the joint problem of
adaptive beamformer design at the PHY layer and client
scheduling at the MAC layer by proposing efficient
algorithms that are amenable to practical
implementation. ADAM is implemented on a field
programmable gate array (FPGA) platform, and its
performance is compared against that of omnidirectional
and switched beamforming based multicast. Our
experimental results reveal that: (1) switched
multicast beamforming has limited gains in indoor
multipath environments, whose deficiencies can be
effectively overcome by ADAM to yield an average gain
of threefold; (2) the higher the dynamic range of the
discrete transmission rates employed by the MAC
hardware, the higher the gains in ADAM's performance,
yielding up to ninefold improvement over omni with the
802.11 rate table; and (3) finally, ADAM's performance
is susceptible to channel variations due to user
mobility and infrequent channel information feedback.
However, we show that training ADAM's signal-to-noise
ratio (SNR)-rate mapping to incorporate feedback rate
and coherence time significantly increases its
robustness to channel dynamics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sahneh:2013:GEM,
author = "Faryad Darabi Sahneh and Caterina Scoglio and Piet
{Van Mieghem}",
title = "Generalized epidemic mean-field model for spreading
processes over multilayer complex networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1609--1620",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2239658",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mean-field deterministic epidemic models have been
successful in uncovering several important dynamic
properties of stochastic epidemic spreading processes
over complex networks. In particular, individual-based
epidemic models isolate the impact of the network
topology on spreading dynamics. In this paper, the
existing models are generalized to develop a class of
models that includes the spreading process in
multilayer complex networks. We provide a detailed
description of the stochastic process at the agent
level where the agents interact through different
layers, each represented by a graph. The set of
differential equations that describes the time
evolution of the state occupancy probabilities has an
exponentially growing state-space size in terms of the
number of the agents. Based on a mean-field type
approximation, we developed a set of nonlinear
differential equations that has linearly growing
state-space size. We find that the latter system,
referred to as the generalized epidemic mean-field
(GEMF) model, has a simple structure characterized by
the elements of the adjacency matrices of the network
layers and the Laplacian matrices of the transition
rate graphs. Finally, we present several examples of
epidemic models, including spreading of virus and
information in computer networks and spreading of
multiple pathogens in a host population.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2013:CDM,
author = "Kyunghan Lee and Yoora Kim and Song Chong and Injong
Rhee and Yung Yi and Ness B. Shroff",
title = "On the critical delays of mobile networks under
{L{\'e}vy} walks and {L{\'e}vy} flights",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1621--1635",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2229717",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Delay-capacity tradeoffs for mobile networks have been
analyzed through a number of research works. However,
L{\'e}vy mobility known to closely capture human
movement patterns has not been adopted in such work.
Understanding the delay-capacity tradeoff for a network
with L{\'e}vy mobility can provide important insights
into understanding the performance of real mobile
networks governed by human mobility. This paper
analytically derives an important point in the
delay-capacity tradeoff for L{\'e}vy mobility, known as
the critical delay. The critical delay is the minimum
delay required to achieve greater throughput than what
conventional static networks can possibly achieve
(i.e., $ O(1 / \sqrt n) $ per node in a network with n
nodes). The L{\'e}vy mobility includes L{\'e}vy flight
and L{\'e}vy walk whose step-size distributions
parametrized by $ \alpha \in (0, 2) $ are both
heavy-tailed while their times taken for the same step
size are different. Our proposed technique involves:
(1) analyzing the joint spatio-temporal probability
density function of a time-varying location of a node
for L{\'e}vy flight, and (2) characterizing an embedded
Markov process in L{\'e}vy walk, which is a semi-Markov
process. The results indicate that in L{\'e}vy walk,
there is a phase transition such that for $ \alpha \in
(0, 1) $, the critical delay is always $ \Theta (n^{ 1
/ 2 }) $, and for $ \alpha \in [1, 2] $ it is $ \Theta
(n^{\alpha / 2}) $. In contrast, L{\'e}vy flight has
the critical delay $ \Theta (n^{\alpha / 2}) $ for $
\alpha \in (0, 2) $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2013:TOC,
author = "Tae Hyun Kim and Jian Ni and R. Srikant and Nitin H.
Vaidya",
title = "Throughput-optimal {CSMA} with imperfect carrier
sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1636--1650",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2233495",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, it has been shown that a simple, distributed
backlog-based carrier-sense multiple access (CSMA)
algorithm is throughput-optimal. However, throughput
optimality is established under the perfect or ideal
carrier-sensing assumption, i.e., each link can
precisely sense the presence of other active links in
its neighborhood. In this paper, we investigate the
achievable throughput of the CSMA algorithm under
imperfect carrier sensing. Through the analysis on both
false positive and negative carrier sensing failures,
we show that CSMA can achieve an arbitrary fraction of
the capacity region if certain access probabilities are
set appropriately. To establish this result, we use the
perturbation theory of Markov chains.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khalili:2013:MPO,
author = "Ramin Khalili and Nicolas Gast and Miroslav Popovic
and Jean-Yves {Le Boudec}",
title = "{MPTCP} is not {Pareto}-optimal: performance issues
and a possible solution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1651--1665",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2274462",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multipath TCP (MPTCP) has been proposed recently as a
mechanism for transparently supporting multiple
connections to the application layer. It is under
discussion at the IETF. We nevertheless demonstrate
that the current MPTCP suffers from two problems: (P1)
Upgrading some TCP users to MPTCP can reduce the
throughput of others without any benefit to the
upgraded users, which is a symptom of not being
Pareto-optimal; and (P2) MPTCP users could be
excessively aggressive toward TCP users. We attribute
these problems to the linked-increases algorithm (LIA)
of MPTCP and, more specifically, to an excessive amount
of traffic transmitted over congested paths. The design
of LIA forces a tradeoff between optimal resource
pooling and responsiveness. We revisit the problem and
show that it is possible to provide these two
properties simultaneously. We implement the resulting
algorithm, called the opportunistic linked-increases
algorithm (OLIA), in the Linux kernel, and we study its
performance over our testbed by simulations and by
theoretical analysis. We prove that OLIA is
Pareto-optimal and satisfies the design goals of MPTCP.
Hence, it can avoid the problems P1 and P2. Our
measurements and simulations indicate that MPTCP with
OLIA is as responsive and nonflappy as MPTCP with LIA
and that it solves problems P1 and P2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shin:2013:FCW,
author = "Ji-Yong Shin and Emin Gn Sirer and Hakim Weatherspoon
and Darko Kirovski",
title = "On the feasibility of completely wireless
datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "5",
pages = "1666--1679",
month = oct,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2274480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:25 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Conventional datacenters, based on wired networks,
entail high wiring costs, suffer from performance
bottlenecks, and have low resilience to network
failures. In this paper, we investigate a radically new
methodology for building wire-free datacenters based on
emerging 60-GHz radio frequency (RF) technology. We
propose a novel rack design and a resulting network
topology inspired by Cayley graphs that provide a dense
interconnect. Our exploration of the resulting design
space shows that wireless datacenters built with this
methodology can potentially attain higher aggregate
bandwidth, lower latency, and substantially higher
fault tolerance than a conventional wired datacenter
while improving ease of construction and maintenance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Balan:2013:AED,
author = "Horia Vlad Balan and Ryan Rogalin and Antonios
Michaloliakos and Konstantinos Psounis and Giuseppe
Caire",
title = "{AirSync}: enabling distributed multiuser {MIMO} with
full spatial multiplexing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1681--1695",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230449",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The enormous success of advanced wireless devices is
pushing the demand for higher wireless data rates.
Denser spectrum reuse through the deployment of more
access points (APs) per square mile has the potential
to successfully meet such demand. In principle,
distributed multiuser multiple-input-multiple-output
(MU-MIMO) provides the best approach to infrastructure
density increase since several access points are
connected to a central server and operate as a large
distributed multiantenna access point. This ensures
that all transmitted signal power serves the purpose of
data transmission, rather than creating interference.
In practice, however, a number of implementation
difficulties must be addressed, the most significant of
which is aligning the phases of all jointly coordinated
APs. In this paper, we propose AirSync, a novel scheme
that provides timing and phase synchronization accurate
enough to enable distributed MU-MIMO. AirSync detects
the slot boundary such that all APs are
time-synchronous within a cyclic prefix (CP) of the
orthogonal frequency-division multiplexing (OFDM)
modulation and predicts the instantaneous carrier phase
correction along the transmit slot such that all
transmitters maintain their coherence, which is
necessary for multiuser beamforming. We have
implemented AirSync as a digital circuit in the field
programmable gate array (FPGA) of the WARP radio
platform. Our experimental testbed, comprising four APs
and four clients, shows that AirSync is able to achieve
timing synchronization within the OFDM CP and carrier
phase coherence within a few degrees. For the purpose
of demonstration, we have implemented two MU-MIMO
precoding schemes, Zero-Forcing Beamforming (ZFBF) and
Tomlinson-Harashima Precoding (THP). In both cases, our
system approaches the theoretical optimal multiplexing
gains. We also discuss aspects related to the MAC and
multiuser scheduling design, in relation to the
distributed MU-MIMO architecture. To the best of our
knowledge, AirSync offers the first realization of the
full distributed MU-MIMO multiplexing gain, namely the
ability to increase the number of active wireless
clients per time-frequency slot linearly with the
number of jointly coordinated APs, without reducing the
per client rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xue:2013:DGC,
author = "Dongyue Xue and Eylem Ekici",
title = "Delay-guaranteed cross-layer scheduling in multihop
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1696--1707",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230404",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a cross-layer scheduling
algorithm that achieves a throughput ``$ \epsilon
$-close'' to the optimal throughput in multihop
wireless networks with a tradeoff of $ O (1 / \epsilon)
$ in average end-to-end delay guarantees. The algorithm
guarantees finite buffer sizes and aims to solve a
joint congestion control, routing, and scheduling
problem in a multihop wireless network while satisfying
per-flow average end-to-end delay constraints and
minimum data rate requirements. This problem has been
solved for both backlogged as well as arbitrary arrival
rate systems. Moreover, we discuss the design of a
class of low-complexity suboptimal algorithms, effects
of delayed feedback on the optimal algorithm, and
extensions of the proposed algorithm to different
interference models with arbitrary link capacities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Karaca:2013:OSP,
author = "Mehmet Karaca and Karim Khalil and Eylem Ekici and
Ozgur Ercetin",
title = "Optimal scheduling and power allocation in
cooperate-to-join cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1708--1721",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2230187",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, optimal resource allocation policies
are characterized for wireless cognitive networks under
the spectrum leasing model. We propose cooperative
schemes in which secondary users share the time-slot
with primary users in return for cooperation.
Cooperation is feasible only if the primary system's
performance is improved over the non-cooperative case.
First, we investigate a scheduling problem where
secondary users are interested in immediate rewards.
Here, we consider both infinite and finite backlog
cases. Then, we formulate another problem where the
secondary users are guaranteed a portion of the primary
utility, on a long-term basis, in return for
cooperation. Finally, we present a power allocation
problem where the goal is to maximize the expected net
benefit defined as utility minus cost of energy. Our
proposed scheduling policies are shown to outperform
non-cooperative scheduling policies, in terms of
expected utility and net benefit, for a given set of
feasible constraints. Based on Lyapunov optimization
techniques, we show that our schemes are arbitrarily
close to the optimal performance at the price of
reduced convergence rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiang:2013:CDA,
author = "Liu Xiang and Jun Luo and Catherine Rosenberg",
title = "Compressed data aggregation: energy-efficient and
high-fidelity data collection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1722--1735",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2229716",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We focus on wireless sensor networks (WSNs) that
perform data collection with the objective of obtaining
the whole dataset at the sink (as opposed to a function
of the dataset). In this case, energy-efficient data
collection requires the use of data aggregation.
Whereas many data aggregation schemes have been
investigated, they either compromise the fidelity of
the recovered data or require complicated in-network
compressions. In this paper, we propose a novel data
aggregation scheme that exploits compressed sensing
(CS) to achieve both recovery fidelity and energy
efficiency in WSNs with arbitrary topology. We make use
of diffusion wavelets to find a sparse basis that
characterizes the spatial (and temporal) correlations
well on arbitrary WSNs, which enables straightforward
CS-based data aggregation as well as high-fidelity data
recovery at the sink. Based on this scheme, we
investigate the minimum-energy compressed data
aggregation problem. We first prove its
NP-completeness, and then propose a mixed integer
programming formulation along with a greedy heuristic
to solve it. We evaluate our scheme by extensive
simulations on both real datasets and synthetic
datasets. We demonstrate that our compressed data
aggregation scheme is capable of delivering data to the
sink with high fidelity while achieving significant
energy saving.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Srebrny:2013:NMD,
author = "Piotr H. Srebrny and Thomas Plagemann and Vera Goebel
and Andreas Mauthe",
title = "No more {D{\'e}j{\`a} Vu}: eliminating redundancy with
cachecast: feasibility and performance gains",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1736--1749",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2236104",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the lack of multicast services in the Internet,
applications based on single-source,
multiple-destination transfers such as video
conferencing, IP radio, and IPTV must use unicast. This
type of traffic exhibits high redundancy with temporal
clustering of duplicated packets. The redundancy
originates from multiple transfers of the same data
chunk over the same link. We propose CacheCast, a
link-layer caching mechanism that eliminates the
redundant data transmissions using small caches on
links. CacheCast's underlying principles are simplicity
and reliability. It is a fully distributed and
incrementally deployable architecture. It consists of
small caches on links that act independently and a
server support that simplifies the link cache
operation. Our analysis indicates that transfers of the
same data to multiple destinations with CacheCast can
achieve near-multicast efficiency in terms of consumed
link bandwidth. The implementation of CacheCast proves
its feasibility, efficiency, and the improvements of
the server.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baccarelli:2013:OSA,
author = "Enzo Baccarelli and Nicola Cordeschi and Valentina
Polli",
title = "Optimal self-adaptive {QoS} resource management in
interference-affected multicast wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1750--1759",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2237411",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we focus on the quality-of-service
(QoS)-constrained jointly optimal congestion control,
network coding, and adaptive distributed power control
for connectionless wireless networks affected by
multiple access interference (MAI). The goal is to
manage the available network resources, so as to
support multiple multicast sessions with QoS
requirements when intrasession network coding (NC) is
allowed. To cope with the nonconvex nature of the
resulting cross-layer optimization problem, we propose
a two-level decomposition that provides the means to
attain the optimal solution through suitable relaxed
convex versions of its comprising subproblems.
Sufficient conditions for the equivalence of the
primary nonconvex problem and its related convex
version are derived, occurrence of such conditions
investigated, and performance with respect to
conventional routing-based layered solutions analyzed.
Moreover, we develop a distributed algorithm to compute
the actual solution of the resource allocation problem
that quickly adapts to network time-evolutions.
Performance of this algorithm and its adaptivity are
evaluated in the presence of varying network/fading
conditions and noisy measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leonard:2013:DIW,
author = "Derek Leonard and Dmitri Loguinov",
title = "Demystifying {Internet}-wide service discovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1760--1773",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2231434",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper develops a high-performance, Internet-wide
service discovery tool, which we call IRLscanner, whose
main design objectives have been to maximize politeness
at remote networks, allow scanning rates that achieve
coverage of the Internet in minutes/hours (rather than
weeks/months), and significantly reduce administrator
complaints. Using IRLscanner and 24-h scans, we perform
21 Internet-wide experiments using six different
protocols (i.e., DNS, HTTP, SMTP, EPMAP, ICMP, and UDP
ECHO), demonstrate the usefulness of ACK scans in
detecting live hosts behind stateless firewalls, and
undertake the first Internet-wide OS fingerprinting. In
addition, we analyze the feedback generated (e.g.,
complaints, IDS alarms) and suggest novel approaches
for reducing the amount of blowback during similar
studies, which should enable researchers to collect
valuable experimental data in the future with
significantly fewer hurdles.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Kofahi:2013:SRS,
author = "Osameh M. Al-Kofahi and Ahmed E. Kamal",
title = "Scalable redundancy for sensors-to-sink
communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1774--1784",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2231878",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a new technique that uses
deterministic binary network coding in a distributed
manner to enhance the resiliency of sensor-to-base
information flow against packet loss. First, we show
how to use network coding to tolerate a single packet
loss by combining the data units from sensor nodes to
produce $ k + 1 $ combinations such that any $k$ of
them are solvable. After that, we extend the solution
to tolerate multiple losses. Moreover, we study the
coding efficiency issue and introduce the idea of
relative indexing to reduce the coding coefficients
overhead. To tolerate node or link failures, we
introduce a simple routing protocol that can find
maximally disjoint paths from the $k$ sensor nodes to
the base station (BS). We study the relationship
between the probability of successful recovery of all
data units at the BS, and the number of sources
protected together taking into consideration their hop
distance from the BS. From this study, we can decide on
the appropriate number of sources to be protected
together, so that the probability of successful
recovery is higher than a certain threshold. Finally,
we show through a simulation study that our approach is
highly scalable and performs better as the network size
increases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joe-Wong:2013:MAF,
author = "Carlee Joe-Wong and Soumya Sen and Tian Lan and Mung
Chiang",
title = "Multiresource allocation: fairness-efficiency
tradeoffs in a unifying framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1785--1798",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2233213",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Quantifying the notion of fairness is underexplored
when there are multiple types of resources and users
request different ratios of the different resources. A
typical example is data centers processing jobs with
heterogeneous resource requirements on CPU, memory,
network bandwidth, etc. In such cases, a tradeoff
arises between equitability, or ``fairness,'' and
efficiency. This paper develops a unifying framework
addressing the fairness-efficiency tradeoff in light of
multiple types of resources. We develop two families of
fairness functions that provide different tradeoffs,
characterize the effect of user requests'
heterogeneity, and prove conditions under which these
fairness measures satisfy the Pareto efficiency,
sharing incentive, and envy-free properties. Intuitions
behind the analysis are explained in two visualizations
of multiresource allocation. We also investigate
people's fairness perceptions through an online survey
of allocation preferences.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2013:NCD,
author = "Zhijun Li and Guang Gong",
title = "On the node clone detection in wireless sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1799--1811",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2233750",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks are vulnerable to the node
clone, and several distributed protocols have been
proposed to detect this attack. However, they require
too strong assumptions to be practical for large-scale,
randomly deployed sensor networks. In this paper, we
propose two novel node clone detection protocols with
different tradeoffs on network conditions and
performance. The first one is based on a distributed
hash table (DHT), by which a fully decentralized,
key-based caching and checking system is constructed to
catch cloned nodes effectively. The protocol
performance on efficient storage consumption and high
security level is theoretically deducted through a
probability model, and the resulting equations, with
necessary adjustments for real application, are
supported by the simulations. Although the DHT-based
protocol incurs similar communication cost as previous
approaches, it may be considered a little high for some
scenarios. To address this concern, our second
distributed detection protocol, named randomly directed
exploration, presents good communication performance
for dense sensor networks, by a probabilistic directed
forwarding technique along with random initial
direction and border determination. The simulation
results uphold the protocol design and show its
efficiency on communication overhead and satisfactory
detection probability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2013:OFD,
author = "Chandramani Singh and Eitan Altman and Anurag Kumar
and Rajesh Sundaresan",
title = "Optimal forwarding in delay-tolerant networks with
multiple destinations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1812--1826",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2233494",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the tradeoff between delivery delay and
energy consumption in a delay-tolerant network in which
a message (or a file) has to be delivered to each of
several destinations by epidemic relaying. In addition
to the destinations, there are several other nodes in
the network that can assist in relaying the message. We
first assume that, at every instant, all the nodes know
the number of relays carrying the message and the
number of destinations that have received the message.
We formulate the problem as a controlled
continuous-time Markov chain and derive the optimal
closed-loop control (i.e., forwarding policy). However,
in practice, the intermittent connectivity in the
network implies that the nodes may not have the
required perfect knowledge of the system state. To
address this issue, we obtain an ordinary differential
equation (ODE) (i.e., a deterministic fluid)
approximation for the optimally controlled Markov
chain. This fluid approximation also yields an
asymptotically optimal open-loop policy. Finally, we
evaluate the performance of the deterministic policy
over finite networks. Numerical results show that this
policy performs close to the optimal closed-loop
policy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ouyang:2013:ATO,
author = "Ming Ouyang and Lei Ying",
title = "Approaching throughput optimality with limited
feedback in multichannel wireless downlink networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1827--1838",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2235459",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the allocation of feedback
resources in the downlink of a frequency-division
duplex (FDD) multichannel wireless system. We consider
a downlink network with a single base station, $L$
shared channels, and $N$ mobile users. Throughput
optimal algorithms like MaxWeight in general require
the complete channel-state information (CSI) ($ N L $
link states) for scheduling. Acquiring the complete
CSI, however, is a prohibitive overhead in multichannel
networks when the number of users is large. In this
paper, we consider the scenario where the base station
allocates only a limited amount of uplink resources for
acquiring channel-state information. We first show that
to support a $ (1 - \epsilon) $ fraction of the full
throughput region (the throughput region with the
complete CSI), the base station needs to acquire at
least $ \Theta ((1 - \epsilon) L) $ link states at each
time-slot. We then propose a Weight-Based Feedback
allocation, named WBF, and show that WBF together with
MaxWeight scheduling achieves a $ (1 - \epsilon) $
fraction of the full throughput region by acquiring $
\Theta (L \log 1 / \epsilon) $ link states per
time-slot. For i.i.d. ON-OFF channels, we further prove
that $ \Theta (L \log 1 / \epsilon) $ link states per
time-slot is necessary for achieving a $ (1 - \epsilon)
$ fraction of the full throughput region.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fukushima:2013:MDR,
author = "Masaki Fukushima and Kohei Sugiyama and Teruyuki
Hasegawa and Toru Hasegawa and Akihiro Nakao",
title = "Minimum disclosure routing for network virtualization
and its experimental evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1839--1851",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2238950",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Although the virtual collocation of service providers
(SPs) on top of infrastructure providers (InPs) via
network virtualization brings various benefits, we
posit that operational confidentiality has not been
considered in this network model. We extend and apply
the Secure Multiparty Computation (SMC) protocol to
solving Minimum Disclosure Routing (MDR), namely,
enabling an SP to route packets without disclosing
routing information to InPs. We implement the proposed
MDR protocol and evaluate its performance via
experiments by comparing it against the prediction
based on our analytical performance model. Our study
reveals that MDR can be securely achieved with marginal
latency overhead with regard to the convergence time in
well-engineered nonsecure routing algorithms. Our study
sheds light on the path for network virtualization to
be used to resolve the challenges for the ISPs of
today.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Laoutaris:2013:DTB,
author = "Nikolaos Laoutaris and Georgios Smaragdakis and Rade
Stanojevic and Pablo Rodriguez and Ravi Sundaram",
title = "Delay-tolerant bulk data transfers on the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1852--1865",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2237555",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many emerging scientific and industrial applications
require transferring multiple terabytes of data on a
daily basis. Examples include pushing scientific data
from particle accelerators/ colliders to laboratories
around the world, synchronizing datacenters across
continents, and replicating collections of
high-definition videos from events taking place at
different time-zones. A key property of all above
applications is their ability to tolerate delivery
delays ranging from a few hours to a few days. Such
delay-tolerant bulk (DTB) data are currently being
serviced mostly by the postal system using hard drives
and DVDs, or by expensive dedicated networks. In this
paper, we propose transmitting such data through
commercial ISPs by taking advantage of already-paid-for
off-peak bandwidth resulting from diurnal traffic
patterns and percentile pricing. We show that between
sender-receiver pairs with small time-zone difference,
simple source scheduling policies are able to take
advantage of most of the existing off-peak capacity.
When the time-zone difference increases, taking
advantage of the full capacity requires performing
store-and-forward through intermediate storage nodes.
We present an extensive evaluation of the two options
based on traffic data from 200+ links of a large
transit provider with points of presence (PoPs) at
three continents. Our results indicate that there
exists huge potential for performing multiterabyte
transfers on a daily basis at little or no additional
cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2013:PON,
author = "Richard T. B. Ma and Vishal Misra",
title = "The public option: a nonregulatory alternative to
network neutrality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1866--1879",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2237412",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network neutrality and the role of regulation on the
Internet have been heavily debated in recent times.
Among the various definitions of network neutrality, we
focus on the one that prohibits paid prioritization of
content. We develop a model of the Internet ecosystem
in terms of three primary players: consumers, ISPs, and
content providers. We analyze this issue from the point
of view of the consumer and target the desired system
state that maximizes consumer utility. By analyzing
various structures of an ISP market, we obtain
different conclusions on the desirability of
regulation. We also introduce the notion of a Public
Option ISP, an ISP that carries traffic in a
network-neutral manner. We find: (1) in a monopolistic
scenario, network-neutral regulations might benefit
consumers, however the introduction of a Public Option
ISP is even better as it aligns the interests of the
monopolistic ISP with the consumer utility; and (2) in
an oligopolistic scenario, the presence of a Public
Option ISP is again preferable to network-neutral
regulations, although the presence of competing
nonneutral ISPs provides the most desirable situation
for the consumers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2013:ECI,
author = "Yin Wang and Yuan He and Xufei Mao and Yunhao Liu and
Xiang-Yang Li",
title = "Exploiting constructive interference for scalable
flooding in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1880--1889",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2238951",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Constructive interference-based flooding (CIBF) is a
latency-optimal flooding protocol, which can realize
millisecond network flooding latency and submicrosecond
time synchronization accuracy, require no network state
information, and be adapted to topology changes.
However, constructive interference (CI) has a
precondition to function, i.e., the maximum temporal
displacement $ \Delta $ of concurrent packet
transmissions should be less than a given hardware
constrained threshold (e.g., $ 0.5 \micro $ s, for the
IEEE 802.15.4 radio). In this paper, we derive the
closed-form packet reception ratio (PRR) formula for
CIBF and theoretically disclose that CIBF suffers the
scalability problem. The packet reception performance
of intermediate nodes degrades significantly as the
density or the size of the network increases. We
analytically show that CIBF has a PRR lower bound
(94.5\%) in the grid topology. Based on this
observation, we propose the spine constructive
interference-based flooding (SCIF) protocol for an
arbitrary uniformly distributed topology. Extensive
simulations show that SCIF floods the entire network
much more reliably than the state-of-the-art Glossy
protocol does in high-density or large-scale networks.
We further explain the root cause of CI with waveform
analysis, which is mainly examined in simulations and
experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Triay:2013:ABP,
author = "Joan Triay and Cristina Cervell{\'o}-Pastor and Vinod
M. Vokkarane",
title = "Analytical blocking probability model for hybrid
immediate and advance reservations in optical {WDM}
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1890--1903",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2235857",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Immediate reservation (IR) and advance reservation
(AR) are the two main reservation mechanisms currently
implemented on large-scale scientific optical networks.
They can be used to satisfy both provisioning delay and
low blocking for delay-tolerant applications.
Therefore, it seems reasonable that future optical
network provisioning systems will provide both
mechanisms in hybrid IR/AR scenarios. Nonetheless, such
scenarios can increase the blocking of IR if no
quality-of-service (QoS) policies are implemented. A
solution could be to quantify such blocking performance
based on the current network load and implement
mechanisms that would act accordingly. However, current
blocking analytical models are not able to deal with
both IR and AR. In this paper, we propose an analytical
model to compute the network-wide blocking performance
of different IR/AR classes within the scope of a
multiservice framework for optical wavelength-division
multiplexing (WDM) networks. Specifically, we calculate
the blocking on two common optical network scenarios
using the fixed-point approximation analysis: on
wavelength conversion capable and wavelength-continuity
constrained networks. Performance results show that our
model provides good accuracy compared to simulation
results, even in a scenario with multiple reservation
classes defined by different book-ahead times.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2013:FAA,
author = "Huasen Wu and Chenxi Zhu and Richard J. La and Xin Liu
and Youguang Zhang",
title = "{FASA}: accelerated {S-ALOHA} using access history for
event-driven {M2M} communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1904--1917",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2241076",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Supporting massive device transmission is challenging
in machine-to-machine (M2M) communications.
Particularly, in event-driven M2M communications, a
large number of devices become activated within a short
period of time, which in turn causes high radio
congestions and severe access delay. To address this
issue, we propose a Fast Adaptive S-ALOHA (FASA) scheme
for random access control of M2M communication systems
with bursty traffic. Instead of the observation in a
single slot, the statistics of consecutive idle and
collision slots are used in FASA to accelerate the
tracking process of network status that is critical for
optimizing S-ALOHA systems. With a design based on
drift analysis, the estimate of the number of the
active devices under FASA converges fast to the true
value. Furthermore, by examining the T-slot drifts, we
prove that the proposed FASA scheme is stable as long
as the average arrival rate is smaller than $ e^{-1} $,
in the sense that the Markov chain derived from the
scheme is geometrically ergodic. Simulation results
demonstrate that under highly bursty traffic, the
proposed FASA scheme outperforms traditional additive
schemes such as PB-ALOHA and achieves near-optimal
performance in reducing access delays. Moreover,
compared to multiplicative schemes, FASA shows its
robustness under heavy traffic load in addition to
better delay performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2013:RPA,
author = "William Wei-Liang Li and Yuan Shen and Ying Jun Zhang
and Moe Z. Win",
title = "Robust power allocation for energy-efficient
location-aware networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1918--1930",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2276063",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless location-aware networks, mobile nodes
(agents) typically obtain their positions using the
range measurements to the nodes with known positions.
Transmit power allocation not only affects network
lifetime and throughput, but also determines
localization accuracy. In this paper, we present an
optimization framework for robust power allocation in
network localization with imperfect knowledge of
network parameters. In particular, we formulate power
allocation problems to minimize localization errors for
a given power budget and show that such formulations
can be solved via conic programming. Moreover, we
design a distributed power allocation algorithm that
allows parallel computation among agents. The
simulation results show that the proposed schemes
significantly outperform uniform power allocation, and
the robust schemes outperform their non-robust
counterparts when the network parameters are subject to
uncertainty.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wolf:2013:HPC,
author = "Tilman Wolf and Sriram Natarajan and Kamlesh T.
Vasudevan",
title = "High-performance capabilities for $1$-hop containment
of network attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1931--1946",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2240463",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Capabilities-based networks present a fundamental
shift in the security design of network architectures.
Instead of permitting the transmission of packets from
any source to any destination, routers deny forwarding
by default. For a successful transmission, packets need
to positively identify themselves and their permissions
to the router. A major challenge for a high-performance
implementation of such a network is an efficient design
of the credentials that are carried in the packet and
the verification procedure on the router. We present a
capabilities system that uses packet credentials based
on Bloom filters. The credentials are of fixed length
(independent of the number of routers that are
traversed by the packet) and can be verified by routers
with a few simple operations. This high-performance
design of capabilities makes it feasible that traffic
is verified on every router in the network, and most
attack traffic can be contained within a single hop. We
present an analysis of our design and a practical
protocol implementation that can effectively limit
unauthorized traffic with only a small per-packet
overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2013:GTA,
author = "Dejun Yang and Guoliang Xue and Xi Fang and
Satyajayant Misra and Jin Zhang",
title = "A game-theoretic approach to stable routing in max-min
fair networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1947--1959",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2247416",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a game-theoretic study of
the problem of routing in networks with max-min fair
congestion control at the link level. The problem is
formulated as a noncooperative game, in which each user
aims to maximize its own bandwidth by selecting its
routing path. We first prove the existence of Nash
equilibria. This is important, because at a Nash
equilibrium (NE), no user has any incentive to change
its routing strategy--leading to a stable state. In
addition, we investigate how the selfish behavior of
users may affect the performance of the network as a
whole. We next introduce a novel concept of observed
available bandwidth on each link. It allows a user to
find a path with maximum bandwidth under max-min fair
congestion control in polynomial time, when paths of
other users are fixed. We then present a game-based
algorithm to compute an NE and prove that by following
the natural game course, the network converges to an
NE. Extensive simulations show that the algorithm
converges to an NE within 10 iterations and also
achieves better fairness compared to other
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shafiq:2013:LSM,
author = "M. Zubair Shafiq and Lusheng Ji and Alex X. Liu and
Jeffrey Pang and Jia Wang",
title = "Large-scale measurement and characterization of
cellular machine-to-machine traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1960--1973",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2256431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cellular network-based machine-to-machine (M2M)
communication is fast becoming a market-changing force
for a wide spectrum of businesses and applications such
as telematics, smart metering, point-of-sale terminals,
and home security and automation systems. In this
paper, we aim to answer the following important
question: Does traffic generated by M2M devices impose
new requirements and challenges for cellular network
design and management? To answer this question, we take
a first look at the characteristics of M2M traffic and
compare it to traditional smartphone traffic. We have
conducted our measurement analysis using a week-long
traffic trace collected from a tier-1 cellular network
in the US. We characterize M2M traffic from a wide
range of perspectives, including temporal dynamics,
device mobility, application usage, and network
performance. Our experimental results show that M2M
traffic exhibits significantly different patterns than
smartphone traffic inmultiple aspects. For instance,
M2M devices have a much larger ratio of
uplink-to-downlink traffic volume, their traffic
typically exhibits different diurnal patterns, they are
more likely to generate synchronized traffic resulting
in bursty aggregate traffic volumes, and are less
mobile compared to smartphones. On the other hand, we
also find that M2M devices are generally competing with
smartphones for network resources in co-located
geographical regions. These and other findings suggest
that better protocol design, more careful spectrum
allocation, and modified pricing schemes may be needed
to accommodate the rise of M2M devices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2013:EPI,
author = "Tao Li and Shigang Chen and Yibei Ling",
title = "Efficient protocols for identifying the missing tags
in a large {RFID} system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1974--1987",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2245510",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Compared to the classical barcode system, radio
frequency identification (RFID) extends the operational
distance from inches to a number of feet (passive RFID
tags) or even hundreds of feet (active RFID tags).
Their wireless transmission, processing, and storage
capabilities enable them to support full automation of
many inventory management functions in industry. This
paper studies the practically important problem of
monitoring a large set of active RFID tags and
identifying the missing ones--the objects that the
missing tags are associated with are likely to be
missing as well. This monitoring function may need to
be executed frequently and therefore should be made
efficient in terms of execution time in order to avoid
disruption of normal inventory operations. Based on
probabilistic methods, we design a series of
missing-tag identification protocols that employ novel
techniques to reduce the execution time. Our best
protocol reduces the time for detecting the missing
tags by an order of magnitude when compared to existing
protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pei:2013:AAT,
author = "Guanhong Pei and Srinivasan Parthasarathy and Aravind
Srinivasan and Anil Kumar S. Vullikanti",
title = "Approximation algorithms for throughput maximization
in wireless networks with delay constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "1988--2000",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2247415",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of throughput maximization in
multihop wireless networks with end-to-end delay
constraints for each session. This problem has received
much attention starting with the work of Grossglauser
and Tse (2002), and it has been shown that there is a
significant tradeoff between the end-to-end delays and
the total achievable rate. We develop algorithms to
compute such tradeoffs with provable performance
guarantees for arbitrary instances, with general
interference models. Given a target delay-bound $
\Delta (c) $ for each session $c$, our algorithm gives
a stable flow vector with a total throughput within a
factor of $ O(\log \Delta m / \log \Delta m) $ of the
maximum, so that the per-session (end-to-end) delay is
$ O(((\log \Delta m / \log \log \Delta m) \Delta
(c))^2) $, where $ \Delta m = \max c \{ \Delta (c) \}
$; note that these bounds depend only on the delays,
and not on the network size, and this is the first such
result, to our knowledge.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Krishnan:2013:VSQ,
author = "S. Shunmuga Krishnan and Ramesh K. Sitaraman",
title = "Video stream quality impacts viewer behavior:
inferring causality using quasi-experimental designs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "6",
pages = "2001--2014",
month = dec,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2281542",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:34 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The distribution of videos over the Internet is
drastically transforming how media is consumed and
monetized. Content providers, such as media outlets and
video subscription services, would like to ensure that
their videos do not fail, start up quickly, and play
without interruptions. In return for their investment
in video stream quality, content providers expect less
viewer abandonment, more viewer engagement, and a
greater fraction of repeat viewers, resulting in
greater revenues. The key question for a content
provider or a content delivery network (CDN) is whether
and to what extent changes in video quality can cause
changes in viewer behavior. Our work is the first to
establish a causal relationship between video quality
and viewer behavior, taking a step beyond purely
correlational studies. To establish causality, we use
Quasi-Experimental Designs, a novel technique adapted
from the medical and social sciences. We study the
impact of video stream quality on viewer behavior in a
scientific data-driven manner by using extensive traces
from Akamai's streaming network that include 23 million
views from 6.7 million unique viewers. We show that
viewers start to abandon a video if it takes more than
2 s to start up, with each incremental delay of 1 s
resulting in a 5.8\% increase in the abandonment rate.
Furthermore, we show that a moderate amount of
interruptions can decrease the average play time of a
viewer by a significant amount. A viewer who
experiences a rebuffer delay equal to 1\% of the video
duration plays 5\% less of the video in comparison to a
similar viewer who experienced no rebuffering. Finally,
we show that a viewer who experienced failure is 2.32\%
less likely to revisit the same site within a week than
a similar viewer who did not experience a failure.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2014:OAP,
author = "Shan-Hung Wu and Ming-Syan Chen and Chung-Min Chen",
title = "Optimally Adaptive Power-Saving Protocols for Ad Hoc
Networks Using the Hyper Quorum System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "1--15",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2296614",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Quorum-based power-saving (QPS) protocols have been
proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc
mode) to increase energy efficiency and prolong the
operational time of mobile stations. These protocols
assign to each station a cycle pattern that specifies
when the station should wake up (to transmit/receive
data) and sleep (to save battery power). In all
existing QPS protocols, the cycle length is either
identical for all stations or is restricted to certain
numbers (e.g., squares or primes). These restrictions
on cycle length severely limit the practical use of QPS
protocols as each individual station may want to select
a cycle length that is best suited for its own need (in
terms of remaining battery power, tolerable packet
delay, and drop ratio). In this paper, we propose the
notion of hyper quorum system (HQS) --- a
generalization of QPS that allows for arbitrary cycle
lengths. We describe algorithms to generate two
different classes of HQS given any set of arbitrary
cycle lengths as input. We also describe how to find
the optimal cycle length for a station to maximize
energy efficiency, subject to certain performance
constraints. We then present analytical and simulation
results that show the benefits of HQS-based
power-saving protocols over the existing QPS protocols.
The HQS protocols yield up to 41\% improvement in
energy efficiency under heavy traffic loads while
eliminating more than 90\% delay drops under light
traffic loads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hur:2014:SDR,
author = "Junbeom Hur and Kyungtae Kang",
title = "Secure Data Retrieval for Decentralized
Disruption-Tolerant Military Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "16--26",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2210729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile nodes in military environments such as a
battlefield or a hostile region are likely to suffer
from intermittent network connectivity and frequent
partitions. Disruption-tolerant network (DTN)
technologies are becoming successful solutions that
allow wireless devices carried by soldiers to
communicate with each other and access the confidential
information or command reliably by exploiting external
storage nodes. Some of the most challenging issues in
this scenario are the enforcement of authorization
policies and the policies update for secure data
retrieval. Ciphertext-policy attribute-based encryption
(CP-ABE) is a promising cryptographic solution to the
access control issues. However, the problem of applying
CP-ABE in decentralized DTNs introduces several
security and privacy challenges with regard to the
attribute revocation, key escrow, and coordination of
attributes issued from different authorities. In this
paper, we propose a secure data retrieval scheme using
CP-ABE for decentralized DTNs where multiple key
authorities manage their attributes independently. We
demonstrate how to apply the proposed mechanism to
securely and efficiently manage the confidential data
distributed in the disruption-tolerant military
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2014:RDB,
author = "Jian Tan and Swapna and Shroff",
title = "Retransmission Delays With Bounded Packets: Power-Law
Body and Exponential Tail",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "27--38",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2244907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Retransmissions serve as the basic building block that
communication protocols use to achieve reliable data
transfer. Until recently, the number of retransmissions
was thought to follow a geometric (light-tailed)
distribution. However, recent work shows that when the
distribution of the packet sizes have infinite support,
retransmission-based protocols may result in
heavy-tailed delays and possibly zero throughput even
when the aforementioned distribution is light-tailed.
In reality, however, packet sizes are often bounded by
the maximum transmission unit (MTU), and thus the
aforementioned result merits a deeper investigation. To
that end, in this paper, we allow the distribution of
the packet size $L$ to have finite support. Under mild
conditions, we show that the transmission duration
distribution exhibits a transition from a power-law
main body to an exponential tail. The timescale to
observe the power-law main body is roughly equal to the
average transmission duration of the longest packet.
The power-law main body, if significant, may cause the
channel throughput to be very close to zero. These
theoretical findings provide an understanding on why
some empirical measurements suggest heavy tails. We use
these results to further highlight the engineering
implications of distributions with power-law main
bodies and light tails by analyzing two cases: (1) the
throughput of on-off channels with retransmissions,
where we show that even when packet sizes have small
means and bounded support the variability in their
sizes can greatly impact system performance; (2) the
distribution of the number of jobs in an $ M / M /
\infty $ queue with server failures. Here, we show that
retransmissions can cause long-range dependence and
quantify the impact of the maximum job sizes on the
long-range dependence.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zohar:2014:PPB,
author = "Eyal Zohar and Israel Cidon and Osnat Mokryn",
title = "{PACK}: Prediction-Based Cloud Bandwidth and Cost
Reduction System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "39--51",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2240010",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present PACK (Predictive ACKs), a
novel end-to-end traffic redundancy elimination (TRE)
system, designed for cloud computing customers.
Cloud-based TRE needs to apply a judicious use of cloud
resources so that the bandwidth cost reduction combined
with the additional cost of TRE computation and storage
would be optimized. PACK's main advantage is its
capability of offloading the cloud-server TRE effort to
end-clients, thus minimizing the processing costs
induced by the TRE algorithm. Unlike previous
solutions, PACK does not require the server to
continuously maintain clients' status. This makes PACK
very suitable for pervasive computation environments
that combine client mobility and server migration to
maintain cloud elasticity. PACK is based on a novel TRE
technique, which allows the client to use newly
received chunks to identify previously received chunk
chains, which in turn can be used as reliable
predictors to future transmitted chunks. We present a
fully functional PACK implementation, transparent to
all TCP-based applications and network devices.
Finally, we analyze PACK benefits for cloud users,
using traffic traces from various sources.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2014:SPT,
author = "Yan Cai and Xiaolin Wang and Weibo Gong and Don
Towsley",
title = "A Study on the Performance of a Three-Stage
Load-Balancing Switch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "52--65",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2244906",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There has been a great deal of interest recently in
load-balancing switches due to their simple
architecture and high forwarding bandwidth.
Nevertheless, the mis-sequencing problem of the
original load-balancing switch hinders the performance
of underlying TCP applications. Several load-balancing
switch designs have been proposed to address this
mis-sequencing issue. They solve this mis-sequencing
problem at the cost of either algorithmic complexity or
special hardware requirements. In this paper, we
address the mis-sequencing problem by introducing a
three-stage load-balancing switch architecture enhanced
with an output load-balancing mechanism. This
three-stage load-balancing switch achieves a high
forwarding capacity while preserving the order of
packets without the need of costly online scheduling
algorithms. Theoretical analyses and simulation results
show that this three-stage load-balancing switch
provides a transmission delay that is upper-bounded by
that of an output-queued switch plus a constant that
depends only on the number of input/output ports,
indicating the same forwarding capacity as an
output-queued switch.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2014:AAS,
author = "Jinbei Zhang and Luoyi Fu and Xinbing Wang",
title = "Asymptotic Analysis on Secrecy Capacity in Large-Scale
Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "66--79",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2244230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Since wireless channel is vulnerable to eavesdroppers,
the secrecy during message delivery is a major concern
in many applications such as commercial, governmental,
and military networks. This paper investigates
information-theoretic secrecy in large-scale networks
and studies how capacity is affected by the secrecy
constraint where the locations and channel state
information (CSI) of eavesdroppers are both unknown. We
consider two scenarios: (1) noncolluding case where
eavesdroppers can only decode messages individually;
and (2) colluding case where eavesdroppers can collude
to decode a message. For the noncolluding case, we show
that the network secrecy capacity is not affected in
order-sense by the presence of eavesdroppers. For the
colluding case, the per-node secrecy capacity of $
\Theta ({1 \over \sqrt {n}}) $ can be achieved when the
eavesdropper density $ \psi_e(n) $ is $ O(n^{- \beta })
$, for any constant $ \beta > 0 $ and decreases
monotonously as the density of eavesdroppers increases.
The upper bounds on network secrecy capacity are
derived for both cases and shown to be achievable by
our scheme when $ \psi_e(n) = O(n^{- \beta }) $ or $
\psi_e(n) = \Omega (\log^{\alpha - 2 \over \alpha }n)
$, where $ \alpha $ is the path-loss gain. We show that
there is a clear tradeoff between the security
constraints and the achievable capacity. Furthermore,
we also investigate the impact of secrecy constraint on
the capacity of dense network, the impact of active
attacks and other traffic patterns, as well as mobility
models in the context.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Uddin:2014:JRM,
author = "Md. Forkan Uddin and Catherine Rosenberg and Weihua
Zhuang and Patrick Mitran and Andre Girard",
title = "Joint Routing and Medium Access Control in Fixed
Random Access Wireless Multihop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "80--93",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2243163",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study cross-layer design in random-access-based
fixed wireless multihop networks under a physical
interference model. Due to the complexity of the
problem, we consider a simple slotted ALOHA medium
access control (MAC) protocol for link-layer operation.
We formulate a joint routing, access probability, and
rate allocation optimization problem to determine the
optimal max-min throughput of the flows and the optimal
configuration of the routing, access probability, and
transmission rate parameters in a slotted ALOHA system.
We then also adapt this problem to include an XOR-like
network coding without opportunistic listening. Both
problems are complex nonlinear and nonconvex. We
provide extensive numerical results for both problems
for medium-size mesh networks using an iterated optimal
search technique. Via numerical and simulation results,
we show that: (1) joint design provides a significant
throughput gain over a default configuration in
slotted-ALOHA-based wireless networks; and (2) the
throughput gain obtained by the simple network coding
is significant, especially at low transmission power.
We also propose simple heuristics to configure
slotted-ALOHA-based wireless mesh networks. These
heuristics are extensively evaluated via simulation and
found to be very efficient.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Meiners:2014:FRE,
author = "Chad R. Meiners and Jignesh Patel and Eric Norige and
Alex X. Liu and Eric Torng",
title = "Fast Regular Expression Matching Using Small {TCAM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "94--109",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2256466",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "Regular expression (RE) matching is a core component
of deep packet inspection in modern networking and
security devices. In this paper, we propose the first
hardware-based RE matching approach that uses ternary
content addressable memory (TCAM), which is available
as off-the-shelf chips and has been widely deployed in
modern networking devices for tasks such as packet
classification. We propose three novel techniques to
reduce TCAM space and improve RE matching speed:
transition sharing, table consolidation, and variable
striding. We tested our techniques on eight real-world
RE sets, and our results show that small TCAMs can be
used to store large deterministic finite automata
(DFAs) and achieve potentially high RE matching
throughput. For space, we can store each of the
corresponding eight DFAs with 25,000 states in a
0.59-Mb TCAM chip. Using a different TCAM encoding
scheme that facilitates processing multiple characters
per transition, we can achieve potential RE matching
throughput of 10-19 Gb/s for each of the eight DFAs
using only a single 2.36-Mb TCAM chip.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bolla:2014:GNP,
author = "Raffaele Bolla and Roberto Bruschi and Alessandro
Carrega and Franco Davoli",
title = "Green Networking With Packet Processing Engines:
Modeling and Optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "110--123",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2242485",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the aim of controlling power consumption in
metro/transport and core networks, we consider
energy-aware devices able to reduce their energy
requirements by adapting their performance. In
particular, we focus on state-of-the-art packet
processing engines, which generally represent the most
energy-consuming components of network devices, and
which are often composed of a number of parallel
pipelines to ``divide and conquer'' the incoming
traffic load. Our goal is to control both the power
configuration of pipelines and the way to distribute
traffic flows among them. We propose an analytical
model to accurately represent the impact of green
network technologies (i.e., low power idle and adaptive
rate) on network- and energy-aware performance indexes.
The model has been validated with experimental results,
performed by using energy-aware software routers loaded
by real-world traffic traces. The achieved results
demonstrate how the proposed model can effectively
represent energy- and network-aware performance
indexes. On this basis, we propose a constrained
optimization policy, which seeks the best tradeoff
between power consumption and packet latency times. The
procedure aims at dynamically adapting the energy-aware
device configuration to minimize energy consumption
while coping with incoming traffic volumes and meeting
network performance constraints. In order to deeply
understand the impact of such policy, a number of tests
have been performed by using experimental data from
software router architectures and real-world traffic
traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ren:2014:TTD,
author = "Wei Ren and Qing Zhao and Ananthram Swami",
title = "Temporal Traffic Dynamics Improve the Connectivity of
Ad Hoc Cognitive Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "124--136",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2244612",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In an ad hoc cognitive radio network, secondary users
access channels temporarily unused by primary users,
and the existence of a communication link between two
secondary users depends on the transmitting and
receiving activities of nearby primary users. Using
theories and techniques from continuum percolation and
ergodicity, we analytically characterize the
connectivity of the secondary network defined in terms
of the almost sure finiteness of the multihop delay,
and show the occurrence of a phase transition
phenomenon while studying the impact of the temporal
dynamics of the primary traffic on the connectivity of
the secondary network. Specifically, as long as the
primary traffic has some temporal dynamics caused by
either mobility and/or changes in traffic load and
pattern, the connectivity of the secondary network
depends solely on its own density and is independent of
the primary traffic; otherwise, the connectivity of the
secondary network requires putting a density-dependent
cap on the primary traffic load. We show that the
scaling behavior of the multihop delay depends
critically on whether or not the secondary network is
instantaneously connected. In particular, we establish
the scaling law of the minimum multihop delay with
respect to the source-destination distance when the
propagation delay is negligible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deb:2014:AEI,
author = "Supratim Deb and Pantelis Monogioudis and Jerzy
Miernik and James P. Seymour",
title = "Algorithms for Enhanced Inter-{Cell} Interference
Coordination {(eICIC)} in {LTE HetNets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "137--150",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2246820",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The success of LTE heterogeneous networks (HetNets)
with macrocells and picocells critically depends on
efficient spectrum sharing between high-power macros
and low-power picos. Two important challenges in this
context are: (1) determining the amount of radio
resources that macrocells should offer to picocells,
and (2) determining the association rules that decide
which user equipments (UEs) should associate with
picos. In this paper, we develop a novel algorithm to
solve these two coupled problems in a joint manner. Our
algorithm has provable guarantee, and furthermore, it
accounts for network topology, traffic load, and
macro-pico interference map. Our solution is standard
compliant and can be implemented using the notion of
Almost Blank Subframes (ABS) and Cell Selection Bias
(CSB) proposed by LTE standards. We also show extensive
evaluations using RF plan from a real network and
discuss self-optimized networking (SON)-based enhanced
inter-cell interference coordination (eICIC)
implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hariharan:2014:SPO,
author = "Srikanth Hariharan and Ness B. Shroff",
title = "On Sample-Path Optimal Dynamic Scheduling for
Sum-Queue Minimization in Forests",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "151--164",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2245339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the problem of minimizing the sum of
the queue lengths of all the nodes in a wireless
network with a forest topology. Each packet is destined
to one of the roots (sinks) of the forest. We consider
a time-slotted system and a primary (or one-hop)
interference model. We characterize the existence of
causal sample-path optimal scheduling policies for this
network topology under this interference model. A
causal sample-path optimal scheduling policy is one for
which at each time-slot, and for any sample-path
traffic arrival pattern, the sum of the queue lengths
of all the nodes in the network is minimum among all
policies. We show that such policies exist in
restricted forest structures, and that for any other
forest structure, there exists a traffic arrival
pattern for which no causal sample-path optimal policy
can exist. Surprisingly, we show that many forest
structures for which such policies exist can be
scheduled by converting the structure into an
equivalent linear network and scheduling the equivalent
linear network according to the one-hop interference
model. The nonexistence of such policies in many forest
structures underscores the inherent limitation of using
sample-path optimality as a performance metric and
necessitates the need to study other (relatively)
weaker metrics of delay performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bienkowski:2014:WAV,
author = "Marcin Bienkowski and Anja Feldmann and Johannes
Grassler and Gregor Schaffrath and Stefan Schmid",
title = "The Wide-Area Virtual Service Migration Problem: a
Competitive Analysis Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "165--178",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2245676",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Today's trend toward network virtualization and
software-defined networking enables flexible new
distributed systems where resources can be dynamically
allocated and migrated to locations where they are most
useful. This paper proposes a competitive analysis
approach to design and reason about online algorithms
that find a good tradeoff between the benefits and
costs of a migratable service. A competitive online
algorithm provides worst-case performance guarantees
under any demand dynamics, and without any information
or statistical assumptions on the demand in the future.
This is attractive especially in scenarios where the
demand is hard to predict and can be subject to
unexpected events. As a case study, we describe a
service (e.g., an SAP server or a gaming application)
that uses network virtualization to improve the quality
of service (QoS) experienced by thin client
applications running on mobile devices. By decoupling
the service from the underlying resource
infrastructure, it can be migrated closer to the
current client locations while taking into account
migration costs. We identify the major cost factors in
such a system and formalize the wide-area service
migration problem. Our main contributions are a
randomized and a deterministic online algorithm that
achieve a competitive ratio of $ O(\log {n}) $ in a
simplified scenario, where $n$ is the size of the
substrate network. This is almost optimal. We
complement our worst-case analysis with simulations in
different specific scenarios and also sketch a
migration demonstrator.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Turkcu:2014:OWW,
author = "Onur Turkcu and Suresh Subramaniam",
title = "Optimal Wavebanding in {WDM} Ring Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "179--190",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2247625",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Savings in switching costs of an optical cross-connect
can be achieved by grouping together a set of
consecutive wavelengths and switching them as a single
waveband. This technique is known as waveband
switching. While previous work has focused on either
uniform band sizes or nonuniform band sizes considering
a single node, in this paper we focus on the number of
wavebands and their sizes for ring topologies. First,
we show that such solutions are inadequate when
considering the entire network. We then present a novel
framework for optimizing the number of wavebands in a
ring network for deterministic traffic. The objective
of the Band Minimization Problem is to minimize the
number of nonuniform wavebands in the network while
using the minimum possible number of wavelengths. We
show that the problem is NP-hard and present heuristics
for it. We then consider a specific type of traffic,
namely all-to-all traffic, and present a construction
method for achieving the minimum number of wavebands in
the ring. Our results show that the number of ports can
be reduced by a large amount using waveband switching
compared to wavelength switching, for both all-to-all
traffic and random traffic. We also numerically
evaluate the performance of our waveband design
algorithms under dynamic stochastic traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:AAP,
author = "Wei Li and Shengling Wang and Yong Cui and Xiuzhen
Cheng and Ran Xin and Mznah A. Al-Rodhaan and Abdullah
Al-Dhelaan",
title = "{AP} Association for Proportional Fairness in
Multirate {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "191--202",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2245145",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the problem of achieving
proportional fairness via access point (AP) association
in multirate WLANs. This problem is formulated as a
nonlinear programming with an objective function of
maximizing the total user bandwidth utilities in the
whole network. Such a formulation jointly considers
fairness and AP selection. We first propose a
centralized algorithm Non-Linear Approximation
Optimization for Proportional Fairness (NLAO-PF) to
derive the user-AP association via relaxation. Since
the relaxation may cause a large integrality gap, a
compensation function is introduced to ensure that our
algorithm can achieve at least half of the optimal in
the worst case. This algorithm is assumed to be adopted
periodically for resource management. To handle the
case of dynamic user membership, we propose a
distributed heuristic Best Performance First (BPF)
based on a novel performance revenue function, which
provides an AP selection criterion for newcomers. When
an existing user leaves the network, the transmission
times of other users associated with the same AP can be
redistributed easily based on NLAO-PF. Extensive
simulation study has been performed to validate our
design and to compare the performance of our algorithms
to those of the state of the art.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Goratti:2014:UOA,
author = "Leonardo Goratti and Ece Yaprak and Stefano Savazzi
and Carlos Pomalaza-Raez",
title = "An Urn Occupancy Approach for Modeling the Energy
Consumption of Distributed Beaconing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "203--216",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270437",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In past years, ultrawideband technology has attracted
great attention from academia and industry for wireless
personal area networks and wireless sensor networks.
Maintenance of connectivity and exchange of data
require an efficient way to manage the devices.
Distributed beaconing defined by ECMA-368 is used to
manage the network in fully distributed fashion. All
the devices must acquire a unique beacon slot, with the
beacon period accessed using a slotted Aloha scheme. In
this paper, we study the efficiency of distributed
beaconing in the presence of $k$ newcomer devices
forming a closed system. Efficiency is measured in
terms of energy consumption and network setup delay.
ECMA-368 defines two distinct phases: extension and
contraction. Both phases are analyzed with particular
emphasis on the extension phase by means of an
absorbing Markov chain model. The main contributions of
this paper are: (1) a systematic approach to model
distributed beaconing by formulating two equivalent urn
occupancy problems of the extension and contraction
phases; (2) the use of exponential generating functions
to obtain closed-form expressions of the transition
probabilities of the absorbing Markov chain; and (3)
comparison to computer simulations based on Opnet
modeling and with the preexisting literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramaswamy:2014:MWN,
author = "Vinod Ramaswamy and Vinith Reddy and Srinivas
Shakkottai and Alex Sprintson and Natarajan Gautam",
title = "Multipath Wireless Network Coding: an Augmented
Potential Game Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "217--229",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2262772",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider wireless networks in which multiple paths
are available between each source and destination. We
allow each source to split traffic among all of its
available paths, and we ask the question: How do we
attain the lowest possible number of transmissions per
unit time to support a given traffic matrix? Traffic
bound in opposite directions over two wireless hops can
utilize the ``reverse carpooling'' advantage of network
coding in order to decrease the number of transmissions
used. We call such coded hops ``hyper-links.'' With the
reverse carpooling technique, longer paths might be
cheaper than shorter ones. However, there is a peculiar
situation among sources-the network coding advantage is
realized only if there is traffic in both directions of
a shared path. We consider the problem of routing with
network coding by selfish agents (the sources) as a
potential game and develop a method of state-space
augmentation in which additional agents (the
hyper-links) decouple sources' choices from each other
by declaring a hyper-link capacity, allowing sources to
split their traffic selfishly in a distributed fashion,
and then changing the hyper-link capacity based on user
actions. Furthermore, each hyper-link has a scheduling
constraint in terms of the maximum number of
transmissions allowed per unit time. We show that our
two-level control scheme is stable and verify our
analytical insights by simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Esposito:2014:RTE,
author = "Christian Esposito and Marco Platania and Roberto
Beraldi",
title = "Reliable and Timely Event Notification for
Publish\slash Subscribe Services Over the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "230--243",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2245144",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The publish/subscribe paradigm is gaining attention
for the development of several applications in wide
area networks (WANs) due to its intrinsic time, space,
and synchronization decoupling properties that meet the
scalability and asynchrony requirements of those
applications. However, while the communication in a WAN
may be affected by the unpredictable behavior of the
network, with messages that can be dropped or delayed,
existing publish/subscribe solutions pay just a little
attention to addressing these issues. On the contrary,
applications such as business intelligence, critical
infrastructures, and financial services require
delivery guarantees with strict temporal deadlines. In
this paper, we propose a framework that enforces both
reliability and timeliness for publish/subscribe
services over WAN. Specifically, we combine two
different approaches: gossiping, to retrieve missing
packets in case of incomplete information, and network
coding, to reduce the number of retransmissions and,
consequently, the latency. We provide an analytical
model that describes the information recovery
capabilities of our algorithm and a simulation-based
study, taking into account a real workload from the Air
Traffic Control domain, which evidences how the
proposed solution is able to ensure reliable event
notification over a WAN within a reasonable bounded
time window.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Magharei:2014:IFL,
author = "Nazanin Magharei and Reza Rejaie and Ivica Rimac and
Volker Hilt and Markus Hofmann",
title = "{ISP}-Friendly Live {P2P} Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "244--256",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2257840",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Swarm-based peer-to-peer streaming (SPS) mechanisms
tend to generate a significant amount of costly
inter-ISP traffic. Localization of overlay connectivity
reduces inter-ISP traffic. However, it can adversely
affect the delivered quality. In this paper, we
systematically examine the performance of SPS for live
video over localized overlays. We identify and discuss
the fundamental bottlenecks limiting the stream quality
and present OLIVES, an ISP-friendly P2P streaming
mechanism for live video. OLIVES maintains a fully
localized overlay to reduce the volume of inter-ISP
traffic and incorporates a two-tier inter-ISP and
intra-ISP scheduling scheme to maximize the delivered
quality to individual peers. One important design
choice is to perform basic scheduling at a substream
level and to use implicit coordination among peers.
This allows OLIVES to efficiently detect missing blocks
and pull them into the ISP in a timely manner with a
minimum in coordination overhead. Furthermore, OLIVES
incorporates a shortcutting technique that limits the
buffer requirements for each participating peer and
effectively reduced the playout latency. Through
analysis and extensive simulations, we demonstrate the
ability of OLIVES to deliver high-quality streams over
localized overlays in various realistic scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Markakis:2014:MWS,
author = "Mihalis G. Markakis and Eytan Modiano and John N.
Tsitsiklis",
title = "Max-Weight Scheduling in Queueing Networks With
Heavy-Tailed Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "257--270",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2246869",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of scheduling in a single-hop
switched network with a mix of heavy-tailed and
light-tailed traffic and analyze the impact of
heavy-tailed traffic on the performance of Max-Weight
scheduling. As a performance metric, we use the delay
stability of traffic flows: A traffic flow is
delay-stable if its expected steady-state delay is
finite, and delay-unstable otherwise. First, we show
that a heavy-tailed traffic flow is delay-unstable
under any scheduling policy. Then, we focus on the
celebrated Max-Weight scheduling policy and show that a
light-tailed flow that conflicts with a heavy-tailed
flow is also delay-unstable. This is true irrespective
of the rate or the tail distribution of the
light-tailed flow or other scheduling constraints in
the network. Surprisingly, we show that a light-tailed
flow can become delay-unstable, even when it does not
conflict with heavy-tailed traffic. Delay stability in
this case may depend on the rate of the light-tailed
flow. Finally, we turn our attention to the class of
Max-Weight- $ \alpha $ scheduling policies. We show
that if the $ \alpha $ -parameters are chosen suitably,
then the sum of the $ \alpha $-moments of the
steady-state queue lengths is finite. We provide an
explicit upper bound for the latter quantity, from
which we derive results related to the delay stability
of traffic flows, and the scaling of moments of
steady-state queue lengths with traffic intensity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Anderson:2014:ODS,
author = "Eric Anderson and Caleb Phillips and Douglas Sicker
and Dirk Grunwald",
title = "Optimization Decomposition for Scheduling and System
Configuration in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "271--284",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2289980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Who gets to use radio spectrum, and when, where, and
how? Scheduling (who, where, when) and system
configuration (how) are fundamental problems in radio
communication and wireless networking. Optimization
decomposition based on Lagrangian relaxation of signal
quality requirements provides a mathematical framework
for solving this type of combined problem. This paper
demonstrates the technique as a solution to spatial
reuse time-division multiple access (STDMA) scheduling
with reconfigurable antennas. The joint beam steering
and scheduling (JBSS) problem offers both a challenging
mathematical structure and significant practical value.
We present algorithms for JBSS and describe an
implemented system based on these algorithms. We
achieve up to 600\% of the throughput of TDMA with a
mean of 234\% in our experiments. The decomposition
approach leads to a working distributed protocol
producing optimal solutions in an amount of time that
is at worst linear in the size of the input. This is,
to the best of our knowledge, the first actually
implemented wireless scheduling system based on dual
decomposition. We identify and briefly address some of
the challenges that arise in taking such a system from
theory to reality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2014:MUC,
author = "Shurui Huang and Aditya Ramamoorthy",
title = "On the Multiple-Unicast Capacity of $3$-Source,
$3$-Terminal Directed Acyclic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "285--299",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270438",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the multiple-unicast problem with three
source-terminal pairs over directed acyclic networks
with unit-capacity edges. The three $ s_i{\hbox {-}}t_i
$ pairs wish to communicate at unit-rate via network
coding. The connectivity between the $ s_i{\hbox
{-}}t_i $ pairs is quantified by means of a
connectivity-level vector, $ [k_1 \ k_2 \ k_3] $ such
that there exist $ k_i $ edge-disjoint paths between $
s_i $ and $ t_i $. In this paper, we attempt to
classify networks based on the connectivity level. It
can be observed that unit-rate transmission can be
supported by routing if $ k_i \geq 3 $, for all $ i =
1, \ldots, 3 $. In this paper, we consider
connectivity-level vectors such that $ \min_{i = 1,
\ldots, 3} k_i < 3 $. We present either a constructive
linear network coding scheme or an instance of a
network that cannot support the desired unit-rate
requirement, for all such connectivity-level vectors
except the vector [1 2 4] (and its permutations). The
benefits of our schemes extend to networks with higher
and potentially different edge capacities.
Specifically, our experimental results indicate that
for networks where the different source-terminal paths
have a significant overlap, our constructive unit-rate
schemes can be packed along with routing to provide
higher throughput as compared to a pure routing
approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Clad:2014:GCL,
author = "Francois Clad and Pascal Merindol and Jean-Jacques
Pansiot and Pierre Francois and Olivier Bonaventure",
title = "Graceful Convergence in Link-State {IP} Networks: a
Lightweight Algorithm Ensuring Minimal Operational
Impact",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "300--312",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2255891",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The use of real-time multimedia or mission-critical
applications over IP networks puts strong pressure on
service providers to operate disruption-free networks.
However, after any topological change, link-state
Interior Gateway Protocols (IGPs), such as IS-IS or
OSPF, enter a convergence phase during which transient
forwarding loops may occur. Such loops increase the
network latency and cause packet losses. In this paper,
we propose and evaluate an efficient algorithm aimed at
avoiding such traffic disruptions without modifying
these IGPs. In case of an intentional modification of
the weight of a link (e.g., to shut it down for
maintenance operations or to perform traffic
engineering), our algorithm iteratively changes this
weight, splitting the modification into a sequence of
loop-free transitions. The number of weight increments
that need to be applied on the link to reach its target
state is minimized in order to remain usable in
existing networks. Analysis performed on inferred and
real Internet service provider (ISP) topologies shows
that few weight increments are required to handle most
link shutdown events (less than two intermediate
metrics for more than 85\% of the links). The
evaluation of our implementation also reveals that
these minimal sequences can be computed in a reasonable
time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Addis:2014:EMT,
author = "Bernardetta Addis and Antonio Capone and Giuliana
Carello and Luca G. Gianoli and Brunilde Sanso",
title = "Energy Management Through Optimized Routing and Device
Powering for Greener Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "313--325",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2249667",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent data confirm that the power consumption of the
information and communications technologies (ICT) and
of the Internet itself can no longer be ignored,
considering the increasing pervasiveness and the
importance of the sector on productivity and economic
growth. Although the traffic load of communication
networks varies greatly over time and rarely reaches
capacity limits, its energy consumption is almost
constant. Based on this observation, energy management
strategies are being considered with the goal of
minimizing the energy consumption, so that consumption
becomes proportional to the traffic load either at the
individual-device level or for the whole network. The
focus of this paper is to minimize the energy
consumption of the network through a management
strategy that selectively switches off devices
according to the traffic level. We consider a set of
traffic scenarios and jointly optimize their energy
consumption assuming a per-flow routing. We propose a
traffic engineering mathematical programming
formulation based on integer linear programming that
includes constraints on the changes of the device
states and routing paths to limit the impact on quality
of service and the signaling overhead. We show a set of
numerical results obtained using the energy consumption
of real routers and study the impact of the different
parameters and constraints on the optimal energy
management strategy. We also present heuristic results
to compare the optimal operational planning with online
energy management operation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2014:IFE,
author = "Junchen Jiang and Vyas Sekar and Hui Zhang",
title = "Improving Fairness, Efficiency, and Stability in
{HTTP}-Based Adaptive Video Streaming With {Festive}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "326--340",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291681",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern video players today rely on bit-rate adaptation
in order to respond to changing network conditions.
Past measurement studies have identified issues with
today's commercial players when multiple
bit-rate-adaptive players share a bottleneck link with
respect to three metrics: fairness, efficiency, and
stability. Unfortunately, our current understanding of
why these effects occur and how they can be mitigated
is quite limited. In this paper, we present a
principled understanding of bit-rate adaptation and
analyze several commercial players through the lens of
an abstract player model consisting of three main
components: bandwidth estimation, bit-rate selection,
and chunk scheduling. Using framework, we identify the
root causes of several undesirable interactions that
arise as a consequence of overlaying the video bit-rate
adaptation over HTTP. Building on these insights, we
develop a suite of techniques that can systematically
guide the tradeoffs between stability, fairness, and
efficiency and thus lead to a general framework for
robust video adaptation. We pick one concrete instance
from this design space and show that it significantly
outperforms today's commercial players on all three key
metrics across a range of experimental scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ferragut:2014:NRA,
author = "Andr{\'e}s Ferragut and Fernando Paganini",
title = "Network resource allocation for users with multiple
connections: fairness and stability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "349--362",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2251896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies network resource allocation between
users that manage multiple connections, possibly
through different routes, where each connection is
subject to congestion control. We formulate a
user-centric Network Utility Maximization problem that
takes into account the aggregate rate a user obtains
from all connections, and we propose decentralized
means to achieve this fairness objective. In a first
proposal, cooperative users control their number of
active connections based on congestion prices from the
transport layer to emulate suitable primal-dual
dynamics in the aggregate rate; we show this control
achieves asymptotic convergence to the optimal
user-centric allocation. For the case of noncooperative
users, we show that network stability and user-centric
fairness can be enforced by a utility-based admission
control implemented at the network edge. We also study
stability and fairness issues when routing of incoming
connections is enabled at the edge router. We obtain in
this case a characterization of the stability region of
loads that can be served with routing alone and a
generalization of our admission control policy to
ensure user-centric fairness when the stability
condition is not met. The proposed algorithms are
implemented at the packet level in ns2 and demonstrated
through simulation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Laufer:2014:CLB,
author = "Rafael Laufer and Theodoros Salonidis and Henrik
Lundgren and Pascal {Le Guyadec}",
title = "A cross-layer backpressure architecture for wireless
multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "363--376",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2249592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Contemporary wireless multihop networks operate much
below their capacity due to the poor coordination among
transmitting nodes. In this paper, we present XPRESS, a
cross-layer backpressure architecture designed to reach
the capacity of wireless multihop networks. Instead of
a collection of poorly coordinated wireless routers,
XPRESS turns a mesh network into a wireless switch.
Transmissions over the network are scheduled using a
throughput-optimal backpressure algorithm. Realizing
this theoretical concept entails several challenges,
which we identify and address with a cross-layer design
and implementation on top of our wireless hardware
platform. In contrast to previous work, we implement
and evaluate backpressure scheduling over a TDMA MAC
protocol, as it was originally proposed in theory. Our
experiments in an indoor testbed show that XPRESS can
yield up to 128\% throughput gains over 802.11.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khan:2014:SSF,
author = "Faisal Khan and Nicholas Hosein and Soheil Ghiasi and
Chen-Nee Chuah and Puneet Sharma",
title = "Streaming solutions for fine-grained network traffic
measurements and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "377--390",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2263228",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Online network traffic measurements and analysis is
critical for detecting and preventing any real-time
anomalies in the network. We propose, implement, and
evaluate an online, adaptive measurement platform,
which utilizes real-time traffic analysis results to
refine subsequent traffic measurements. Central to our
solution is the concept of Multi-Resolution Tiling
(MRT), a heuristic approach that performs sequential
analysis of traffic data to zoom into traffic
subregions of interest. However, MRT is sensitive to
transient traffic spikes. In this paper, we propose
three novel traffic streaming algorithms that overcome
the limitations of MRT and can cater to varying degrees
of computational and storage budgets, detection
latency, and accuracy of query response. We evaluate
our streaming algorithms on a highly parallel and
programmable hardware as well as a traditional
software-based platforms. The algorithms demonstrate
significant accuracy improvement over MRT in detecting
anomalies consisting of synthetic hard-to-track
elephant flows and global icebergs. Our proposed
algorithms maintain the worst-case complexities of the
MRT while incurring only a moderate increase in average
resource utilization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Skoberne:2014:IAS,
author = "Nejc Skoberne and Olaf Maennel and Iain Phillips and
Randy Bush and Jan Zorz and Mojca Ciglaric",
title = "{IPv4} address sharing mechanism classification and
tradeoff analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "391--404",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2256147",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The growth of the Internet has made IPv4 addresses a
scarce resource. Due to slow IPv6 deployment,
IANA-level IPv4 address exhaustion was reached before
the world could transition to an IPv6-only Internet.
The continuing need for IPv4 reachability will only be
supported by IPv4 address sharing. This paper reviews
ISP-level address sharing mechanisms, which allow
Internet service providers to connect multiple
customers who share a single IPv4 address. Some
mechanisms come with severe and unpredicted
consequences, and all of them come with tradeoffs. We
propose a novel classification, which we apply to
existing mechanisms such as NAT444 and DS-Lite and
proposals such as 4rd, MAP, etc. Our tradeoff analysis
reveals insights into many problems including: abuse
attribution, performance degradation, address and port
usage efficiency, direct intercustomer communication,
and availability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nahir:2014:TDC,
author = "Amir Nahir and Ariel Orda and Ari Freund",
title = "Topology design of communication networks: a
game-theoretic perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "405--414",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2254125",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the performance of noncooperative networks in
light of three major topology design considerations,
namely the price of establishing a link, path delay,
and path proneness to congestion, the latter being
modeled through the ``relaying extent'' of the nodes.
We analyze these considerations and the tradeoffs
between them from a game-theoretic perspective, where
each network element attempts to optimize its
individual performance. We show that for all considered
cases but one, the existence of a Nash equilibrium
point is guaranteed. For the latter case, we indicate,
by simulations, that practical scenarios tend to admit
a Nash equilibrium. In addition, we demonstrate that
the price of anarchy, i.e., the performance penalty
incurred by noncooperative behavior, may be
prohibitively large; yet, we also show that such games
usually admit at least one Nash equilibrium that is
system-wide optimal, i.e., their price of stability is
1. This finding suggests that a major improvement can
be achieved by providing a central (``social'') agent
with the ability to impose the initial configuration on
the system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bremler-Barr:2014:CSP,
author = "Anat Bremler-Barr and David Hay and Yaron Koral",
title = "{CompactDFA}: Scalable pattern matching using longest
prefix match solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "415--428",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253119",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "A central component in all contemporary intrusion
detection systems (IDSs) is their pattern matching
algorithms, which are often based on constructing and
traversing a deterministic finite automaton (DFA) that
represents the patterns. While this approach ensures
deterministic time guarantees, modern IDSs need to deal
with hundreds of patterns, thus requiring to store very
large DFAs, which usually do not fit in fast memory.
This results in a major bottleneck on the throughput of
the IDS, as well as its power consumption and cost. We
propose a novel method to compress DFAs by observing
that the name used by common DFA encoding is
meaningless. While regular DFAs store separately each
transition between two states, we use this degree of
freedom and encode states in such a way that all
transitions to a specific state are represented by a
single prefix that defines a set of current states. Our
technique applies to a large class of automata, which
can be categorized by simple properties. Then, the
problem of pattern matching is reduced to the
well-studied problem of Longest Prefix Match (LPM),
which can be solved either in ternary
content-addressable memory (TCAM), in commercially
available IP-lookup chips, or in software.
Specifically, we show that with a TCAM our scheme can
reach a throughput of 10 Gb/s with low power
consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chamania:2014:CAE,
author = "Mohit Chamania and Admela Jukan",
title = "A comparative analysis of the effects of dynamic
optical circuit provisioning on {IP} routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "429--442",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2251897",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We analyze the effects of dynamic optical circuit
setup on IP routing in general and on two routing
mechanisms in particular, i.e., explicit routing and
shortest-path-first routing. We present analytical
models for computing the size and placement of optical
circuits and propose model adaptations driven by the IP
router system design. The results show that without
careful consideration of intrinsic capabilities of IP
routing protocol and forwarding, the size and location
of optical circuits used can be vastly underestimated,
also leading to significant disruptions in real
networks. We present the Optical Bypass mechanisms and
show that these methods, unlike traditional IP
routing-based solutions, affect a comparatively lower
number of IP routes and can be computed near-optimally,
even under unknown traffic matrix conditions, making
them effective and feasible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lim:2014:BCP,
author = "Hyesook Lim and Nara Lee and Geumdan Jin and Jungwon
Lee and Youngju Choi and Changhoon Yim",
title = "Boundary cutting for packet classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "443--456",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2254124",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Decision-tree-based packet classification algorithms
such as HiCuts, HyperCuts, and EffiCuts show excellent
search performance by exploiting the geometrical
representation of rules in a classifier and searching
for a geometric subspace to which each input packet
belongs. However, decision tree algorithms involve
complicated heuristics for determining the field and
number of cuts. Moreover, fixed interval-based cutting
not relating to the actual space that each rule covers
is ineffective and results in a huge storage
requirement. A new efficient packet classification
algorithm using boundary cutting is proposed in this
paper. The proposed algorithm finds out the space that
each rule covers and performs the cutting according to
the space boundary. Hence, the cutting in the proposed
algorithm is deterministic rather than involving the
complicated heuristics, and it is more effective in
providing improved search performance and more
efficient in memory requirement. For rule sets with
1000-100 000 rules, simulation results show that the
proposed boundary cutting algorithm provides a packet
classification through 10-23 on-chip memory accesses
and 1-4 off-chip memory accesses in average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramaswamy:2014:WPM,
author = "Vinod Ramaswamy and Diganto Choudhury and Srinivas
Shakkottai",
title = "Which protocol? {Mutual} interaction of heterogeneous
congestion controllers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "457--469",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2262773",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A large number of congestion control protocols have
been proposed in the last few years, with all having
the same purpose--to divide available bandwidth
resources among different flows in a fair manner. Each
protocol operates on the paradigm of some conception of
link price (such as packet losses or packet delays)
that determines source transmission rates. Recent work
on network utility maximization has brought forth the
idea that the fundamental price or Lagrange multiplier
for a link is proportional to the queue length at that
link, and that different congestion metrics (such as
delays or drops) are essentially ways of interpreting
such a Lagrange multiplier. We thus ask the following
question: Suppose that each flow has a number of
congestion control protocols to choose from, which one
(or combination) should it choose? We introduce a
framework wherein each flow has a utility that depends
on throughput and also has a disutility that is some
function of the queue lengths encountered along the
route taken. Flows must choose a combination of
protocols that would maximize their payoffs. We study
both the socially optimal, as well as the selfish cases
to determine the loss of system-wide value incurred
through selfish decision making, so characterizing the
``price of heterogeneity.'' We also propose tolling
schemes that incentivize flows to choose one of several
different virtual networks catering to particular needs
and show that the total system value is greater, hence
making a case for the adoption of such virtual
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xue:2014:PTA,
author = "Guoliang Xue and Ravi Gottapu and Xi Fang and Dejun
Yang and Krishnaiyan Thulasiraman",
title = "A polynomial-time algorithm for computing disjoint
lightpath pairs in minimum isolated-failure-immune
{WDM} optical networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "470--483",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2257180",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A fundamental problem in survivable routing in
wavelength division multiplexing (WDM) optical networks
is the computation of a pair of link-disjoint (or
node-disjoint) lightpaths connecting a source with a
destination, subject to the wavelength continuity
constraint. However, this problem is NP-hard when the
underlying network topology is a general mesh network.
As a result, heuristic algorithms and integer linear
programming (ILP) formulations for solving this problem
have been proposed. In this paper, we advocate the use
of 2-edge connected (or 2-node connected) subgraphs of
minimum isolated failure immune networks as the
underlying topology for WDM optical networks. We
present a polynomial-time algorithm for computing a
pair of link-disjoint lightpaths with shortest total
length in such networks. The running time of our
algorithm is O ( nW$^2$ ), where n is the number of
nodes, and W is the number of wavelengths per link.
Numerical results are presented to demonstrate the
effectiveness and scalability of our algorithm.
Extension of our algorithm to the node-disjoint case is
straightforward.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lubben:2014:SBE,
author = "Ralf L{\"u}bben and Markus Fidler and J{\"o}rg
Liebeherr",
title = "Stochastic bandwidth estimation in networks with
random service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "484--497",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2261914",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Numerous methods for available bandwidth estimation
have been developed for wireline networks, and their
effectiveness is well-documented. However, most methods
fail to predict bandwidth availability reliably in a
wireless setting. It is accepted that the increased
variability of wireless channel conditions makes
bandwidth estimation more difficult. However, a
(satisfactory) explanation why these methods are
failing is missing. This paper seeks to provide
insights into the problem of bandwidth estimation in
wireless networks or, more broadly, in networks with
random service. We express bandwidth availability in
terms of bounding functions with a defined violation
probability. Exploiting properties of a stochastic
min-plus linear system theory, the task of bandwidth
estimation is formulated as inferring an unknown
bounding function from measurements of probing traffic.
We present derivations showing that simply using the
expected value of the available bandwidth in networks
with random service leads to a systematic
overestimation of the traffic departures. Furthermore,
we show that in a multihop setting with random service
at each node, available bandwidth estimates requires
observations over (in principle infinitely) long time
periods. We propose a new estimation method for random
service that is based on iterative constant-rate probes
that take advantage of statistical methods. We show how
our estimation method can be realized to achieve both
good accuracy and confidence levels. We evaluate our
method for wired single-and multihop networks, as well
as for wireless networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:OOS,
author = "Kai Chen and Ankit Singla and Atul Singh and Kishore
Ramachandran and Lei Xu and Yueping Zhang and Xitao Wen
and Yan Chen",
title = "{OSA}: an optical switching architecture for data
center networks with unprecedented flexibility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "498--511",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253120",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A detailed examination of evolving traffic
characteristics, operator requirements, and network
technology trends suggests a move away from nonblocking
interconnects in data center networks (DCNs). As a
result, recent efforts have advocated oversubscribed
networks with the capability to adapt to traffic
requirements on-demand. In this paper, we present the
design, implementation, and evaluation of OSA, a novel
Optical Switching Architecture for DCNs. Leveraging
runtime reconfigurable optical devices, OSA dynamically
changes its topology and link capacities, thereby
achieving unprecedented flexibility to adapt to dynamic
traffic patterns. Extensive analytical simulations
using both real and synthetic traffic patterns
demonstrate that OSA can deliver high bisection
bandwidth (60\%-100\% of the nonblocking architecture).
Implementation and evaluation of a small-scale
functional prototype further demonstrate the
feasibility of OSA.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gajic:2014:CWP,
author = "Vojislav Gaji{\'c} and Jianwei Huang and Bixio
Rimoldi",
title = "Competition of wireless providers for atomic users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "512--525",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2255889",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study a problem where wireless service providers
compete for heterogeneous wireless users. The users
differ in their utility functions as well as in the
perceived quality of service of individual providers.
We model the interaction of an arbitrary number of
providers and users as a two-stage
multi-leader-follower game. We prove existence and
uniqueness of the subgame perfect Nash equilibrium for
a generic channel model and a wide class of users'
utility functions. We show that the competition of
resource providers leads to a globally optimal outcome
under mild technical conditions. Most users will
purchase the resource from only one provider at the
unique subgame perfect equilibrium. The number of users
who connect to multiple providers at the equilibrium is
always smaller than the number of providers. We also
present a decentralized algorithm that globally
converges to the unique system equilibrium with only
local information under mild conditions on the update
rates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DeCicco:2014:AVS,
author = "Luca {De Cicco} and Saverio Mascolo",
title = "An adaptive video streaming control system: modeling,
validation, and performance evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "526--539",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253797",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Adaptive video streaming is a relevant advancement
with respect to classic progressive download streaming
a la YouTube. Among the different approaches, the video
stream-switching technique is getting wide acceptance,
being adopted by Microsoft, Apple, and popular video
streaming services such as Akamai, Netflix, Hulu, Vudu,
and Livestream. In this paper, we present a model of
the automatic video stream-switching employed by one of
these leading video streaming services along with a
description of the client-side communication and
control protocol. From the control architecture point
of view, the automatic adaptation is achieved by means
of two interacting control loops having the controllers
at the client and the actuators at the server: One loop
is the buffer controller, which aims at steering the
client playout buffer to a target length by regulating
the server sending rate; the other one implements the
stream-switching controller and aims at selecting the
video level. A detailed validation of the proposed
model has been carried out through experimental
measurements in an emulated scenario.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Le:2014:IRI,
author = "Franck Le and Jo{\~a}o Lu{\'\i}s Sobrinho",
title = "Interconnecting routing instances",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "540--553",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2255311",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many operators run more than one routing instance--
more than one routing protocol, or more than one
instance of a given routing protocol--in their
networks. Route election and route redistribution are
mechanisms introduced by router vendors to interconnect
routing instances. We show that these mechanisms do not
heed basic performance goals. Especially, we show that,
in general, they do not allow network configurations
that are simultaneously free from routing anomalies and
resilient to failures. We then propose a new form of
interconnection that overcomes the limitations of route
election and route redistribution, permitting the
configuration of a resilient and efficient routing
system. We conduct a thorough study of this new form of
interconnection, presenting conditions for its
correctness and optimality. The precepts of the study
are applied to routing instances substantiated by the
current Internal Gateway Protocols of the Internet:
RIP, OSPF, IS-IS, IGRP, and EIGRP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zeng:2014:ATP,
author = "Hongyi Zeng and Peyman Kazemian and George Varghese
and Nick McKeown",
title = "Automatic test packet generation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "554--566",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253121",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Networks are getting larger and more complex, yet
administrators rely on rudimentary tools such as and to
debug problems. We propose an automated and systematic
approach for testing and debugging networks called
``Automatic Test Packet Generation'' (ATPG). ATPG reads
router configurations and generates a
device-independent model. The model is used to generate
a minimum set of test packets to (minimally) exercise
every link in the network or (maximally) exercise every
rule in the network. Test packets are sent
periodically, and detected failures trigger a separate
mechanism to localize the fault. ATPG can detect both
functional (e.g., incorrect firewall rule) and
performance problems (e.g., congested queue). ATPG
complements but goes beyond earlier work in static
checking (which cannot detect liveness or performance
faults) or fault localization (which only localize
faults given liveness results). We describe our
prototype ATPG implementation and results on two
real-world data sets: Stanford University's backbone
network and Internet2. We find that a small number of
test packets suffices to test all rules in these
networks: For example, 4000 packets can cover all rules
in Stanford backbone network, while 54 are enough to
cover all links. Sending 4000 test packets 10 times per
second consumes less than 1\% of link capacity. ATPG
code and the data sets are publicly available.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:LLB,
author = "Feng Li and Chi Zhang and Jun Luo and Shi-Qing Xin and
Ying He",
title = "{LBDP}: localized boundary detection and
parametrization for {$3$-D} sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "567--579",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253561",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many applications of wireless sensor networks involve
monitoring a time-variant event (e.g., radiation
pollution in the air). In such applications, fast
boundary detection is a crucial function, as it allows
us to track the event variation in a timely fashion.
However, the problem becomes very challenging as it
demands a highly efficient algorithm to cope with the
dynamics introduced by the evolving event. Moreover, as
many physical events occupy volumes rather than
surfaces (e.g., pollution again), the algorithm has to
work for 3-D cases. Finally, as boundaries of a 3-D
network can be complicated 2-manifolds, many network
functionalities (e.g., routing) may fail in the face of
such boundaries. To this end, we propose Localized
Boundary Detection and Parametrization (LBDP) to tackle
these challenges. The first component of LBDP is
UNiform Fast On-Line boundary Detection (UNFOLD). It
applies an inversion to node coordinates such that a
``notched'' surface is ``unfolded'' into a convex one,
which in turn reduces boundary detection to a localized
convexity test. We prove the correctness and efficiency
of UNFOLD; we also use simulations and implementations
to evaluate its performance, which demonstrates that
UNFOLD is two orders of magnitude more time- and
energy-efficient than the most up-to-date proposal.
Another component of LBDP is Localized Boundary
Sphericalization (LBS). Through purely localized
operations, LBS maps an arbitrary genus-0 boundary to a
unit sphere, which in turn supports functionalities
such as distinguishing interboundaries from external
ones and distributed coordinations on a boundary. We
implement LBS in TOSSIM and use simulations to show its
effectiveness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kavitha:2014:FSC,
author = "Veeraruna Kavitha and Eitan Altman and R. El-Azouzi
and Rajesh Sundaresan",
title = "Fair scheduling in cellular systems in the presence of
noncooperative mobiles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "580--594",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of ``fair'' scheduling the
resources to one of the many mobile stations by a
centrally controlled base station (BS). The BS is the
only entity taking decisions in this framework based on
truthful information from the mobiles on their radio
channel. We study the well-known family of parametric
\alpha -fair scheduling problems from a game-theoretic
perspective in which some of the mobiles may be
noncooperative. We first show that if the BS is unaware
of the noncooperative behavior from the mobiles, the
noncooperative mobiles become successful in snatching
the resources from the other cooperative mobiles,
resulting in unfair allocations. If the BS is aware of
the noncooperative mobiles, a new game arises with BS
as an additional player. It can then do better by
neglecting the signals from the noncooperative mobiles.
The BS, however, becomes successful in eliciting the
truthful signals from the mobiles only when it uses
additional information (signal statistics). This new
policy along with the truthful signals from mobiles
forms a Nash equilibrium (NE) that we call a Truth
Revealing Equilibrium. Finally, we propose new
iterative algorithms to implement fair scheduling
policies that robustify the otherwise nonrobust (in
presence of noncooperation) \alpha -fair scheduling
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Anshelevich:2014:CAG,
author = "Elliot Anshelevich and Bugra Caskurlu and Koushik Kar
and Hang Zhang",
title = "Capacity allocation games for network-coded multicast
streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "595--607",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2255890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we formulate and study a capacity
allocation game between a set of receivers (players)
that are interested in receiving multicast data
(video/multimedia) being streamed from a server through
a multihop network. We consider fractional multicast
streaming, where the multicast stream from the source
(origin-server) to any particular receiver (end-user)
can be split over multiple paths. The receivers are
selfish and noncooperative, but must collaboratively
purchase capacities of links in the network, as
necessary for delivery of the multicast stream from the
source to the individual receivers, assuming that the
multicast stream is network-coded. For this multicast
capacity allocation (network formation) game, we show
that the Nash equilibrium is guaranteed to exist in
general. For a 2-tier network model where the receivers
must obtain the multicast data from the source through
a set of relay nodes, we show that the price of
stability is at most 2, and provide a polynomial-time
algorithm that computes a Nash equilibrium whose social
cost is within a factor of 2 of the socially optimum
solution. For more general network models, we show that
there exists a 2-approximate Nash equilibrium, whose
cost is at most two times the social optimum. We also
give a polynomial-time algorithm that computes a (2 +
\epsilon )-approximate Nash equilibrium for any
\epsilon > 0, whose cost is at most two times the
social optimum. Simulation studies show that our
algorithms generate efficient Nash equilibrium
allocation solutions for a vast majority of randomly
generated network topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2014:ILW,
author = "Qingjun Xiao and Bin Xiao and Kai Bu and Jiannong
Cao",
title = "Iterative localization of wireless sensor networks: an
accurate and robust approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "608--621",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2257839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless sensor networks, an important research
problem is to use a few anchor nodes with known
locations to derive the locations of other nodes
deployed in the sensor field. A category of solutions
for this problem is the iterative localization, which
sequentially merges the elements in a network to
finally locate them. Here, a network element is
different from its definition in iterative
trilateration. It can be either an individual node or a
group of nodes. For this approach, we identify a new
problem called inflexible body merging, whose objective
is to align two small network elements and generate a
larger element. It is more generalized than the
traditional tools of trilateration and patch stitching
and can replace them as a new merging primitive. We
solve this problem and make the following
contributions. (1) Our primitive can tolerate ranging
noise when merging two network elements. It adopts an
optimization algorithm based on rigid body dynamics and
relaxing springs. (2) Our primitive improves the
robustness against flip ambiguities. It uses orthogonal
regression to detect the rough collinearity of nodes in
the presence of ranging noise, and then enumerate flip
ambiguities accordingly. (3) We present a condition to
indicate when we can apply this primitive to align two
network elements. This condition can unify previous
work and thus achieve a higher percentage of
localizable nodes. All the declared contributions have
been validated by both theoretical analysis and
simulation results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:MCM,
author = "Yixuan Li and Qiuyu Peng and Xinbing Wang",
title = "Multicast capacity with max-min fairness for
heterogeneous networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "622--635",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2255065",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the multicast capacity
for static ad hoc networks with heterogeneous clusters.
We study the effect of heterogeneous cluster traffic
(HCT) on the achievable capacity. HCT means cluster
clients are more likely to appear near the cluster head
instead of being uniformly distributed across the
network. Such a property is commonly found in real
networks. By adopting max-min fairness, the minimum
among all individual multicast capacities of clusters
can be maximized. Since this minimal individual
multicast capacity will not be maximized unlimitedly,
our work focuses on deriving the upper bound of the
minimum individual multicast capacity (we refer it as
minimum capacity for simplicity) in HCT, which provides
the best performance for the minimum multicast capacity
to attain in the whole network. We find that HCT
increases minimum capacity for ad hoc networks.
Furthermore, the multicast capacity achieving scheme is
provided to justify the derived asymptotic upper bound
for the minimum capacity. Our work can generalize
various results obtained under nonheterogeneous
networks in previous literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2014:CER,
author = "Rami Cohen and Danny Raz",
title = "Cost-effective resource allocation of overlay routing
relay nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "636--646",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2260867",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay routing is a very attractive scheme that
allows improving certain properties of the routing
(such as delay or TCP throughput) without the need to
change the standards of the current underlying routing.
However, deploying overlay routing requires the
placement and maintenance of overlay infrastructure.
This gives rise to the following optimization problem:
Find a minimal set of overlay nodes such that the
required routing properties are satisfied. In this
paper, we rigorously study this optimization problem.
We show that it is NP-hard and derive a nontrivial
approximation algorithm for it, where the approximation
ratio depends on specific properties of the problem at
hand. We examine the practical aspects of the scheme by
evaluating the gain one can get over several real
scenarios. The first one is BGP routing, and we show,
using up-to-date data reflecting the current BGP
routing policy in the Internet, that a relative small
number of less than 100 relay servers is sufficient to
enable routing over shortest paths from a single source
to all autonomous systems (ASs), reducing the average
path length of inflated paths by 40\%. We also
demonstrate that the scheme is very useful for TCP
performance improvement (results in an almost optimal
placement of overlay nodes) and for Voice-over-IP
(VoIP) applications where a small number of overlay
nodes can significantly reduce the maximal peer-to-peer
delay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Loiseau:2014:IMI,
author = "Patrick Loiseau and Galina Schwartz and John Musacchio
and Saurabh Amin and S. Shankar Sastry",
title = "Incentive mechanisms for {Internet} congestion
management: fixed-budget rebate versus time-of-day
pricing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "647--661",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270442",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile data traffic has been steadily rising in the
past years. This has generated a significant interest
in the deployment of incentive mechanisms to reduce
peak-time congestion. Typically, the design of these
mechanisms requires information about user demand and
sensitivity to prices. Such information is naturally
imperfect. In this paper, we propose a fixed-budget
rebate mechanism that gives each user a reward
proportional to his percentage contribution to the
aggregate reduction in peak-time demand. For
comparison, we also study a time-of-day pricing
mechanism that gives each user a fixed reward per unit
reduction of his peak-time demand. To evaluate the two
mechanisms, we introduce a game-theoretic model that
captures the public good nature of decongestion. For
each mechanism, we demonstrate that the socially
optimal level of decongestion is achievable for a
specific choice of the mechanism's parameter. We then
investigate how imperfect information about user demand
affects the mechanisms' effectiveness. From our
results, the fixed-budget rebate pricing is more robust
when the users' sensitivity to congestion is
``sufficiently'' convex. This feature of the
fixed-budget rebate mechanism is attractive for many
situations of interest and is driven by its closed-loop
property, i.e., the unit reward decreases as the
peak-time demand decreases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joo:2014:DPN,
author = "Changhee Joo and Ness B. Shroff",
title = "On the delay performance of in-network aggregation in
lossy wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "662--673",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2256795",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the implication of wireless
broadcast for data aggregation in lossy wireless sensor
networks. Each sensor node generates information by
sensing its physical environment and transmits the data
to a special node called the sink, via multihop
communications. The goal of the network system is to
compute a function at the sink from the information
gathered by spatially distributed sensor nodes. In the
course of collecting information, in-network
computation at intermediate forwarding nodes can
substantially increase network efficiency by reducing
the number of transmissions. On the other hand, it also
increases the amount of the information contained in a
single packet and makes the system vulnerable to packet
loss. Instead of retransmitting lost packets, which
incurs additional delay, we develop a wireless system
architecture that exploits the diversity of the
wireless medium for reliable operations. To elaborate,
we show that for a class of aggregation functions,
wireless broadcasting is an effective strategy to
improve delay performance while satisfying reliability
constraint. We provide scaling law results on the
performance improvement of our solution over unicast
architecture with retransmissions. Interestingly, the
improvement depends on the transmission range as well
as the reliability constraint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borst:2014:NUM,
author = "Sem C. Borst and Mihalis G. Markakis and Iraj Saniee",
title = "Nonconcave utility maximization in locally coupled
systems, with applications to wireless and wireline
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "674--687",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2257181",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by challenging resource allocation issues
arising in large-scale wireless and wireline
communication networks, we study distributed network
utility maximization problems with a mixture of concave
(e.g., best-effort throughputs) and nonconcave (e.g.,
voice/video streaming rates) utilities. In the first
part of the paper, we develop our methodological
framework in the context of a locally coupled networked
system, where nodes represent agents that control a
discrete local state. Each node has a possibly
nonconcave local objective function, which depends on
the local state of the node and the local states of its
neighbors. The goal is to maximize the sum of the local
objective functions of all nodes. We devise an
iterative randomized algorithm, whose convergence and
optimality properties follow from the classical
framework of Markov Random Fields and Gibbs Measures
via a judiciously selected neighborhood structure. The
proposed algorithm is distributed, asynchronous,
requires limited computational effort per
node/iteration, and yields provable convergence in the
limit. In order to demonstrate the scope of the
proposed methodological framework, in the second part
of the paper we show how the method can be applied to
two different problems for which no distributed
algorithm with provable convergence and optimality
properties is available. Specifically, we describe how
the proposed methodology provides a distributed
mechanism for solving nonconcave utility maximization
problems: (1) arising in OFDMA cellular networks,
through power allocation and user assignment; (2)
arising in multihop wireline networks, through explicit
rate allocation. Several numerical experiments are
presented to illustrate the convergence speed and
performance of the proposed method.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Venkataraman:2014:EIP,
author = "Mukundan Venkataraman and Mainak Chatterjee",
title = "Effects of {Internet} path selection on {video-QoE}:
analysis and improvements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "689--702",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2257838",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents large-scale Internet measurements
to understand and improve the effects of Internet path
selection on perceived video quality, or quality of
experience (QoE). We systematically study a large
number of Internet paths between popular video
destinations and clients to create an empirical
understanding of location, persistence, and recurrence
of failures. These failures are mapped to perceived
video quality by reconstructing video clips and
conducting surveys. We then investigate ways to recover
from QoE degradation by choosing one-hop detour paths
that preserve application-specific policies. We seek
simple, scalable path selection strategies without the
need for background path monitoring. Using five
different measurement overlays spread across the globe,
we show that a source can recover from over 75\% of the
degradations by attempting to restore QoE with any $k$
randomly chosen nodes in an overlay, where $k$ is
bounded by $ O(\ln (N))$. We argue that our results are
robust across datasets. Finally, we design and
implement a prototype packet forwarding module called
source initiated frame restoration (SIFR). We deployed
SIFR on PlanetLab nodes and compared the performance of
SIFR to the default Internet routing. We show that SIFR
outperforms IP-path selection by providing higher
on-screen perceptual quality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:PDC,
author = "Shuqin Li and Jianwei Huang",
title = "Price differentiation for communication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "703--716",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2258173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the optimal usage-based pricing problem in a
resource-constrained network with one profit-maximizing
service provider and multiple groups of
surplus-maximizing users. With the assumption that the
service provider knows the utility function of each
user (thus complete information), we find that the
complete price differentiation scheme can achieve a
large revenue gain (e.g., 50\%) compared to no price
differentiation, when the total network resource is
comparably limited and the high-willingness-to-pay
users are minorities. However, the complete price
differentiation scheme may lead to a high
implementational complexity. To trade off the revenue
against the implementational complexity, we further
study the partial price differentiation scheme and
design a polynomial-time algorithm that can compute the
optimal partial differentiation prices. We also
consider the incomplete information case where the
service provider does not know to which group each user
belongs. We show that it is still possible to realize
price differentiation under this scenario and provide
the sufficient and necessary condition under which an
incentive-compatible differentiation scheme can achieve
the same revenue as under complete information.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2014:ODP,
author = "Shaoquan Zhang and Ziyu Shao and Minghua Chen and
Libin Jiang",
title = "Optimal distributed {P2P} streaming under node degree
bounds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "717--730",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270915",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of maximizing the broadcast rate
in peer-to-peer (P2P) systems under node degree bounds,
i.e., the number of neighbors a node can simultaneously
connect to is upper-bounded. The problem is critical
for supporting high-quality video streaming in P2P
systems and is challenging due to its combinatorial
nature. In this paper, we address this problem by
providing the first distributed solution that achieves
near-optimal broadcast rate under arbitrary node degree
bounds and over arbitrary overlay graph. It runs on
individual nodes and utilizes only the measurement from
their one-hop neighbors, making the solution easy to
implement and adaptable to peer churn and network
dynamics. Our solution consists of two distributed
algorithms proposed in this paper that can be of
independent interests: a network-coding-based
broadcasting algorithm that optimizes the broadcast
rate given a topology, and a Markov-chain guided
topology hopping algorithm that optimizes the topology.
Our distributed broadcasting algorithm achieves the
optimal broadcast rate over arbitrary P2P topology,
while previously proposed distributed algorithms obtain
optimality only for P2P complete graphs. We prove the
optimality of our solution and its convergence to a
neighborhood around the optimal equilibrium under noisy
measurements or without time-scale separation
assumptions. We demonstrate the effectiveness of our
solution in simulations using uplink bandwidth
statistics of Internet hosts.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cho:2014:PMP,
author = "Jeong-Woo Cho and Yung Yi",
title = "On the payoff mechanisms in peer-assisted services
with multiple content providers: rationality and
fairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "731--744",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2259637",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies an incentive structure for
cooperation and its stability in peer-assisted services
when there exist multiple content providers, using a
coalition game-theoretic approach. We first consider a
generalized coalition structure consisting of multiple
providers with many assisting peers, where peers assist
providers to reduce the operational cost in content
distribution. To distribute the profit from cost
reduction to players (i.e, providers and peers), we
then establish a generalized formula for individual
payoffs when a ``Shapley-like'' payoff mechanism is
adopted. We show that the grand coalition is unstable,
even when the operational cost functions are concave,
which is in sharp contrast to the recently studied case
of a single provider where the grand coalition is
stable. We also show that irrespective of stability of
the grand coalition, there always exist coalition
structures that are not convergent to the grand
coalition under a dynamic among coalition structures.
Our results give us an incontestable fact that a
provider does not tend to cooperate with other
providers in peer-assisted services and is separated
from them. Three facets of the noncooperative (selfish)
providers are illustrated: (1) underpaid peers; (2)
service monopoly; and (3) oscillatory coalition
structure. Lastly, we propose a stable payoff mechanism
that improves fairness of profit sharing by regulating
the selfishness of the players as well as grants the
content providers a limited right of realistic
bargaining. Our study opens many new questions such as
realistic and efficient incentive structures and the
tradeoffs between fairness and individual providers'
competition in peer-assisted services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Goussevskaia:2014:AWC,
author = "Olga Goussevskaia and Magn{\'u}s M. Halld{\'o}rsson
and Roger Wattenhofer",
title = "Algorithms for wireless capacity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "745--755",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2258036",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we address two basic questions in
wireless communication. First, how long does it take to
schedule an arbitrary set of communication requests?
Second, given a set of communication requests, how many
of them can be scheduled concurrently? Our results are
derived in the signal-to-interference-plus-noise ratio
(SINR) interference model with geometric path loss and
consist of efficient algorithms that find a constant
approximation for the second problem and a logarithmic
approximation for the first problem. In addition, we
show that the interference model is robust to various
factors that can influence the signal attenuation. More
specifically, we prove that as long as influences on
the signal attenuation are constant, they affect the
capacity only by a constant factor.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sundaresan:2014:CVM,
author = "Karthikeyan Sundaresan and Sampath Rangarajan",
title = "Cooperation versus multiplexing: multicast scheduling
algorithms for {OFDMA} relay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "756--769",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2260353",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the next-generation cellular networks making a
transition toward smaller cells, two-hop orthogonal
frequency-division multiple access (OFDMA) relay
networks have become a dominant, mandatory component in
the 4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While
unicast flows have received reasonable attention in
two-hop OFDMA relay networks, not much light has been
shed on the design of efficient scheduling algorithms
for multicast flows. Given the growing importance of
multimedia broadcast and multicast services (MBMS) in
4G networks, the latter forms the focus of this paper.
We show that while relay cooperation is critical for
improving multicast performance, it must be carefully
balanced with the ability to multiplex multicast
sessions and hence maximize aggregate multicast flow.
To this end, we highlight strategies that carefully
group relays for cooperation to achieve this balance.
We then solve the multicast scheduling problem under
two OFDMA subchannelization models. We establish the
NP-hardness of the scheduling problem even for the
simpler model and provide efficient algorithms with
approximation guarantees under both models. Evaluation
of the proposed solutions reveals the efficiency of the
scheduling algorithms as well as the significant
benefits obtained from the multicasting strategy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Almasaeid:2014:EMD,
author = "Hisham M. Almasaeid and Ahmed E. Kamal",
title = "Exploiting multichannel diversity for cooperative
multicast in cognitive radio mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "770--783",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2258035",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio networks (CRNs) have emerged as a
promising, yet challenging, solution to enhance
spectrum utilization, thanks to the technology of
cognitive radios. A well-known property of CRNs is the
potential heterogeneity in channel availability among
secondary users. Therefore, multicast throughput in
CRNs may suffer from significant degradation because of
this property since a link-level broadcast of a frame
may only reach a small subset of destinations that are
able to receive on the same channel. This may
necessitate multiple sequential transmissions of the
same frame by the source on different channels to
guarantee delivery to all receivers in the destination
set. In case of high data generation rate, delivery
delay will be high due to the repeated transmissions by
the source. In this paper, we propose an assistance
strategy to reduce the effect of the channel
heterogeneity property on the multicast throughput in
cognitive radio wireless mesh networks (CR-WMNs). This
assistance strategy is composed of two main activities:
first, allowing multicast receivers to assist the
source in delivering the data, and second, allowing the
transmission of coded packets so that multicast
receivers belonging to different multicast groups can
decode and extract their data concurrently. Results
show that the proposed assistance paradigm reduces
multicast time and increases throughput
significantly.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dhanapala:2014:TPM,
author = "Dulanjalie C. Dhanapala and Anura P. Jayasumana",
title = "Topology preserving maps: extracting layout maps of
wireless sensor networks from virtual coordinates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "784--797",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2263254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A method for obtaining topology-preserving maps (TPMs)
from virtual coordinates (VCs) of wireless sensor
networks is presented. In a virtual coordinate system
(VCS), a node is identified by a vector containing its
distances, in hops, to a small subset of nodes called
anchors. Layout information such as physical voids,
shape, and even relative physical positions of sensor
nodes with respect to x-y directions are absent in a
VCS description. The proposed technique uses Singular
Value Decomposition to isolate dominant radial
information and to extract topological information from
the VCS for networks deployed on 2-D/3-D surfaces and
in 3-D volumes. The transformation required for TPM
extraction can be generated using the coordinates of a
subset of nodes, resulting in sensor-network-friendly
implementation alternatives. TPMs of networks
representing a variety of topologies are extracted.
Topology preservation error ( E TP), a metric that
accounts for both the number and degree of node flips,
is defined and used to evaluate 2-D TPMs. The
techniques extract TPMs with ( E TP) less than 2\%.
Topology coordinates provide an economical alternative
to physical coordinates for many sensor networking
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Seibert:2014:NSV,
author = "Jeff Seibert and Sheila Becker and Cristina
Nita-Rotaru and Radu State",
title = "{Newton}: securing virtual coordinates by enforcing
physical laws",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "798--811",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2264725",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Virtual coordinate systems (VCSs) provide accurate
estimations of latency between arbitrary hosts on a
network, while conducting a small amount of actual
measurements and relying on node cooperation. While
these systems have good accuracy under benign settings,
they suffer a severe decrease of their effectiveness
when under attack by compromised nodes acting as
insider attackers. Previous defenses mitigate such
attacks by using machine learning techniques to
differentiate good behavior (learned over time) from
bad behavior. However, these defense schemes have been
shown to be vulnerable to advanced attacks that make
the schemes learn malicious behavior as good behavior.
We present Newton, a decentralized VCS that is robust
to a wide class of insider attacks. Newton uses an
abstraction of a real-life physical system, similar to
that of Vivaldi, but in addition uses safety invariants
derived from Newton's laws of motion. As a result,
Newton does not need to learn good behavior and can
tolerate a significantly higher percentage of malicious
nodes. We show through simulations and real-world
experiments on the PlanetLab testbed that Newton is
able to mitigate all known attacks against VCSs while
providing better accuracy than Vivaldi, even in benign
settings. Finally, we show how to design a VCS that
better matches a real physical system, thus allowing
for more intuitive and tighter system parameters that
are even more difficult to exploit by attackers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2014:BAP,
author = "Ning Lu and Tom H. Luan and Miao Wang and Xuemin Shen
and Fan Bai",
title = "Bounds of asymptotic performance limits of
social-proximity vehicular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "812--825",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2260558",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the asymptotic
performance limits (throughput capacity and average
packet delay) of social-proximity vehicular networks.
The considered network involves N vehicles moving and
communicating on a scalable grid-like street layout
following the social-proximity model: Each vehicle has
a restricted mobility region around a specific social
spot and transmits via a unicast flow to a destination
vehicle that is associated with the same social spot.
Moreover, the spatial distribution of the vehicle
decays following a power-law distribution from the
central social spot toward the border of the mobility
region. With vehicles communicating using a variant of
the two-hop relay scheme, the asymptotic bounds of
throughput capacity and average packet delay are
derived in terms of the number of social spots, the
size of the mobility region, and the decay factor of
the power-law distribution. By identifying these key
impact factors of performance mathematically, we find
three possible regimes for the performance limits. Our
results can be applied to predict the network
performance of real-world scenarios and provide insight
on the design and deployment of future vehicular
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2014:VTE,
author = "Yang Xu and Chenguang Yu and Jingjiang Li and Yong
Liu",
title = "Video telephony for end-consumers: measurement study
of {Google+}, {iChat} and {Skype}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "826--839",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2260354",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video telephony requires high-bandwidth and low-delay
voice and video transmissions between geographically
distributed users. It is challenging to deliver
high-quality video telephony to end-consumers through
the best-effort Internet. In this paper, we present our
measurement study on three popular video telephony
systems on the Internet: Google+, iChat, and Skype.
Through a series of carefully designed active and
passive measurements, we uncover important information
about their key design choices and performance,
including application architecture, video generation
and adaptation schemes, loss recovery strategies,
end-to-end voice and video delays, resilience against
random and bursty losses, etc. The obtained insights
can be used to guide the design of applications that
call for high-bandwidth and low-delay data
transmissions under a wide range of ``best-effort''
network conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vadrevu:2014:DSP,
author = "Chaitanya S. K. Vadrevu and Rui Wang and Massimo
Tornatore and Charles U. Martel and Biswanath
Mukherjee",
title = "Degraded service provisioning in mixed-line-rate {WDM}
backbone networks using multipath routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "840--849",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2259638",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic in optical backbone networks is increasing and
becoming more heterogeneous with respect to bandwidth
and QoS requirements due to the popularity of
high-bandwidth services (such as cloud computing,
e-science, telemedicine, etc.), which need to coexist
with traditional services (HTTP, etc.). Mixed-line-rate
(MLR) networks that support lightpaths of different
rates such as 10, 40, 100 Gb/s, etc., are being studied
to better support the heterogeneous traffic demands.
Here, we study the important topic of degraded services
in MLR networks, where a service can accept some
degradation (i.e., reduction) in bandwidth in case of a
failure in exchange for a lower cost, a concept called
partial protection. Network operators may wish to
support degraded services to optimize network resources
and reduce cost. We propose using multipath routing to
support degraded services in MLR networks, a problem
that has not been studied before and is significantly
more challenging than in single-line-rate (SLR)
networks. We consider minimum-cost MLR network design
(i.e., choosing which transponder rates to use at each
node), considering the opportunity to exploit multipath
routes to support degraded services. We propose a
mixed-integer-linear-program (MILP) solution and a
computationally efficient heuristic, and consider two
partial-protection models. Our illustrative numerical
results show that significant cost savings can be
achieved due to partial protection versus full
protection and is highly beneficial for network
operators. We also note that multipath routing in MLR
networks exploits volume discount of higher-line-rate
transponders by cost-effectively grooming requests over
appropriate line rates to maximize transponder reuse
versus SLR.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dhaini:2014:EET,
author = "Ahmad R. Dhaini and Pin-Han Ho and Gangxiang Shen and
Basem Shihada",
title = "Energy efficiency in {TDMA}-based next-generation
passive optical access networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "850--863",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2259596",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Next-generation passive optical network (PON) has been
considered in the past few years as a cost-effective
broadband access technology. With the ever-increasing
power saving concern, energy efficiency has been an
important issue in its operations. In this paper, we
propose a novel sleep-time sizing and scheduling
framework for the implementation of green bandwidth
allocation (GBA) in TDMA-PONs. The proposed framework
leverages the batch-mode transmission feature of GBA to
minimize the overhead due to frequent ONU on-off
transitions. The optimal sleeping time sequence of each
ONU is determined in every cycle without violating the
maximum delay requirement. With multiple ONUs possibly
accessing the shared media simultaneously, a collision
may occur. To address this problem, we propose a new
sleep-time sizing mechanism, namely Sort-And-Shift
(SAS), in which the ONUs are sorted according to their
expected transmission start times, and their sleep
times are shifted to resolve any possible collision
while ensuring maximum energy saving. Results show the
effectiveness of the proposed framework and highlight
the merits of our solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Abedini:2014:CCS,
author = "Navid Abedini and Srinivas Shakkottai",
title = "Content caching and scheduling in wireless networks
with elastic and inelastic traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "864--874",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2261542",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The rapid growth of wireless content access implies
the need for content placement and scheduling at
wireless base stations. We study a system under which
users are divided into clusters based on their channel
conditions, and their requests are represented by
different queues at logical front ends. Requests might
be elastic (implying no hard delay constraint) or
inelastic (requiring that a delay target be met).
Correspondingly, we have request queues that indicate
the number of elastic requests, and deficit queues that
indicate the deficit in inelastic service. Caches are
of finite size and can be refreshed periodically from a
media vault. We consider two cost models that
correspond to inelastic requests for streaming stored
content and real-time streaming of events,
respectively. We design provably optimal policies that
stabilize the request queues (hence ensuring finite
delays) and reduce average deficit to zero [hence
ensuring that the quality-of-service (QoS) target is
met] at small cost. We illustrate our approach through
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eshete:2014:TBC,
author = "Addisu Tadesse Eshete and Yuming Jiang",
title = "On the transient behavior of {CHOKe}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "875--888",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2260831",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "CHOKe is a simple and stateless active queue
management (AQM) scheme. Apart from low operational
overhead, a highly attractive property of CHOKe is that
it can protect responsive TCP flows from unresponsive
UDP flows. Particularly, previous works have proven
that CHOKe is able to bound both bandwidth share and
buffer share of (a possible aggregate) UDP traffic
(flow) on a link. However, these studies consider, and
pertain only to, a steady state where the queue reaches
equilibrium in the presence of many (long-lived) TCP
flows and an unresponsive UDP flow of fixed arrival
rate. If the steady-state conditions are perturbed,
particularly when UDP traffic rate changes over time,
it is unclear whether the protection property of CHOKe
still holds. Indeed, it can be examined, for example,
that when UDP rate suddenly becomes 0 (i.e., flow
stops), the unresponsive flow may assume close to full
utilization in sub-round-trip-time (sub-RTT) scales,
potentially starving out the TCP flows. To explain this
apparent discrepancy, this paper investigates CHOKe
queue properties in a transient regime, which is the
time period of transition between two steady states of
the queue, initiated when the rate of the unresponsive
flow changes. Explicit expressions that characterize
flow throughputs in transient regimes are derived.
These results provide additional understanding of CHOKe
and give some explanation on its intriguing behavior in
the transient regime.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2014:CHB,
author = "Yifan Zhang and Gexin Yu and Qun Li and Haodong Wang
and Xiaojun Zhu and Baosheng Wang",
title = "Channel-hopping-based communication rendezvous in
cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "889--902",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio (CR) networks have an ample but
dynamic amount of spectrum for communications.
Communication rendezvous in CR networks is the process
of establishing a control channel between radios before
they can communicate. Designing a communication
rendezvous protocol that can take advantage of all the
available spectrum at the same time is of great
importance, because it alleviates load on control
channels, and thus further reduces probability of
collisions. In this paper, we present ETCH, efficient
channel-hopping-based MAC-layer protocols for
communication rendezvous in CR networks. Compared to
the existing solutions, ETCH fully exploits spectrum
diversity in communication rendezvous by allowing all
the rendezvous channels to be utilized at the same
time. We propose two protocols, SYNC-ETCH, which is a
synchronous protocol assuming CR nodes can synchronize
their channel hopping processes, and ASYNC-ETCH, which
is an asynchronous protocol not relying on global clock
synchronization. Our theoretical analysis and
ns-2-based evaluation show that ETCH achieves better
performances of time-to-rendezvous and throughput than
the existing work.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2014:EHA,
author = "Hui Lin and Halit {\"U}ster",
title = "Exact and heuristic algorithms for data-gathering
cluster-based wireless sensor network design problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "903--916",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2262153",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data-gathering wireless sensor networks (WSNs) are
operated unattended over long time horizons to collect
data in several applications such as those in climate
monitoring and a variety of ecological studies.
Typically, sensors have limited energy (e.g., an
on-board battery) and are subject to the elements in
the terrain. In-network operations, which largely
involve periodically changing network flow decisions to
prolong the network lifetime, are managed remotely, and
the collected data are retrieved by a user via
Internet. In this paper, we study an integrated
topology control and routing problem in cluster-based
WSNs. To prolong network lifetime via efficient use of
the limited energy at the sensors, we adopt a
hierarchical network structure with multiple sinks at
which the data collected by the sensors are gathered
through the clusterheads (CHs). We consider a
mixed-integer linear programming (MILP) model to
optimally determine the sink and CH locations as well
as the data flow in the network. Our model effectively
utilizes both the position and the energy-level aspects
of the sensors while selecting the CHs and avoids the
highest-energy sensors or the sensors that are
well-positioned sensors with respect to sinks being
selected as CHs repeatedly in successive periods. For
the solution of the MILP model, we develop an effective
Benders decomposition (BD) approach that incorporates
an upper bound heuristic algorithm, strengthened cuts,
and an $ \epsilon $-optimal framework for accelerated
convergence. Computational evidence demonstrates the
efficiency of the BD approach and the heuristic in
terms of solution quality and time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Smaragdakis:2014:DSM,
author = "Georgios Smaragdakis and Nikolaos Laoutaris and
Konstantinos Oikonomou and Ioannis Stavrakakis and Azer
Bestavros",
title = "Distributed server migration for scalable {Internet}
service deployment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "917--930",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270440",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The effectiveness of service provisioning in
large-scale networks is highly dependent on the number
and location of service facilities deployed at various
hosts. The classical, centralized approach to
determining the latter would amount to formulating and
solving the uncapacitated $k$-median (UKM) problem (if
the requested number of facilities is fixed-$k$) or the
uncapacitated facility location (UFL) problem (if the
number of facilities is also to be optimized). Clearly,
such centralized approaches require knowledge of global
topological and demand information, and thus do not
scale and are not practical for large networks. The key
question posed and answered in this paper is the
following: ``How can we determine in a distributed and
scalable manner the number and location of service
facilities?'' In this paper, we develop a scalable and
distributed approach that answers our key question
through an iterative reoptimization of the location and
the number of facilities within network neighborhoods.
We propose an innovative approach to migrate, add, or
remove servers within limited-scope network
neighborhoods by utilizing only local information about
the topology and demand. We show that even with limited
information about the network topology and demand,
within one or two hops, our distributed approach
achieves performance, under various synthetic and real
Internet topologies and workloads, that is comparable
to that of optimal, centralized approaches requiring
full topology and demand information. We also show that
it is responsive to volatile demand. Our approach
leverages recent advances in virtualization technology
toward an automated placement of services on the
Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2014:BAI,
author = "Kuai Xu and Feng Wang and Lin Gu",
title = "Behavior analysis of {Internet} traffic via bipartite
graphs and one-mode projections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "931--942",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2264634",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As Internet traffic continues to grow in size and
complexity, it has become an increasingly challenging
task to understand behavior patterns of end-hosts and
network applications. This paper presents a novel
approach based on behavioral graph analysis to study
the behavior similarity of Internet end-hosts.
Specifically, we use bipartite graphs to model host
communications from network traffic and build one-mode
projections of bipartite graphs for discovering
social-behavior similarity of end-hosts. By applying
simple and efficient clustering algorithms on the
similarity matrices and clustering coefficient of
one-mode projection graphs, we perform network-aware
clustering of end-hosts in the same network prefixes
into different end-host behavior clusters and discover
inherent clustered groups of Internet applications. Our
experiment results based on real datasets show that
end-host and application behavior clusters exhibit
distinct traffic characteristics that provide improved
interpretations on Internet traffic. Finally, we
demonstrate the practical benefits of exploring
behavior similarity in profiling network behaviors,
discovering emerging network applications, and
detecting anomalous traffic patterns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Butkiewicz:2014:CWP,
author = "Michael Butkiewicz and Harsha V. Madhyastha and Vyas
Sekar",
title = "Characterizing {Web} page complexity and its impact",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "943--956",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2269999",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Over the years, the Web has evolved from simple text
content from one server to a complex ecosystem with
different types of content from servers spread across
several administrative domains. There is anecdotal
evidence of users being frustrated with high page load
times. Because page load times are known to directly
impact user satisfaction, providers would like to
understand if and how the complexity of their Web sites
affects the user experience. While there is an
extensive literature on measuring Web graphs, Web site
popularity, and the nature of Web traffic, there has
been little work in understanding how complex
individual Web sites are, and how this complexity
impacts the clients' experience. This paper is a first
step to address this gap. To this end, we identify a
set of metrics to characterize the complexity of Web
sites both at a content level (e.g., number and size of
images) and service level (e.g., number of
servers/origins). We find that the distributions of
these metrics are largely independent of a Web site's
popularity rank. However, some categories (e.g., News)
are more complex than others. More than 60\% of Web
sites have content from at least five non-origin
sources, and these contribute more than 35\% of the
bytes downloaded. In addition, we analyze which metrics
are most critical for predicting page render and load
times and find that the number of objects requested is
the most important factor. With respect to variability
in load times, however, we find that the number of
servers is the best indicator.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2014:HHA,
author = "Layong Luo and Gaogang Xie and Yingke Xie and Laurent
Mathy and Kav{\'e} Salamatian",
title = "A hybrid hardware architecture for high-speed {IP}
lookups and fast route updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "957--969",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2266665",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As network link rates are being pushed beyond 40 Gb/s,
IP lookup in high-speed routers is moving to hardware.
The ternary content addressable memory (TCAM)-based IP
lookup engine and the static random access memory
(SRAM)-based IP lookup pipeline are the two most common
ways to achieve high throughput. However, route updates
in both engines degrade lookup performance and may lead
to packet drops. Moreover, there is a growing interest
in virtual IP routers where more frequent updates
happen. Finding solutions that achieve both fast lookup
and low update overhead becomes critical. In this
paper, we propose a hybrid IP lookup architecture to
address this challenge. The architecture is based on an
efficient trie partitioning scheme that divides the
forwarding information base (FIB) into two prefix sets:
a large disjoint leaf prefix set mapped into an
external TCAM-based lookup engine and a small
overlapping prefix set mapped into an on-chip
SRAM-based lookup pipeline. Critical optimizations are
developed on both IP lookup engines to reduce the
update overhead. We show how to extend the proposed
hybrid architecture to support virtual routers. Our
implementation shows a throughput of 250 million
lookups per second (equivalent to 128 Gb/s with 64-B
packets). The update overhead is significantly lower
than that of previous work, the memory consumption is
reasonable, and the utilization ratio of most external
TCAMs is up to 100\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2014:DCF,
author = "Chengchen Hu and Bin Liu and Hongbo Zhao and Kai Chen
and Yan Chen and Yu Cheng and Hao Wu",
title = "Discount counting for fast flow statistics on flow
size and flow volume",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "970--981",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270439",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A complete flow statistics report should include both
flow size (the number of packets in a flow) counting
and flow volume (the number of bytes in a flow)
counting. Although previous studies have contributed a
lot to the flow size counting problem, it is still a
great challenge to well support the flow volume
statistics due to the demanding requirements on both
memory size and memory bandwidth in monitoring device.
In this paper, we propose a DIScount COunting (DISCO)
method, which is designed for both flow size and flow
bytes counting. For each incoming packet of length l,
DISCO increases the corresponding counter assigned to
the flow with an increment that is less than l. With an
elaborate design on the counter update rule and the
inverse estimation, DISCO saves memory consumption
while providing an accurate unbiased estimator. The
method is evaluated thoroughly under theoretical
analysis and simulations with synthetic and real
traces. The results demonstrate that DISCO is more
accurate than related work given the same counter
sizes. DISCO is also implemented on the network
processor Intel IXP2850 for a performance test. Using
only one microengine (ME) in IXP2850, the throughput
can reach up to 11.1 Gb/s under a traditional traffic
pattern. The throughput increases to 39 Gb/s when
employing four MEs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2014:HTM,
author = "Yang Xu and Zhaobo Liu and Zhuoyuan Zhang and H.
Jonathan Chao",
title = "High-throughput and memory-efficient multimatch packet
classification based on distributed and pipelined hash
tables",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "982--995",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The emergence of new network applications, such as the
network intrusion detection system and packet-level
accounting, requires packet classification to report
all matched rules instead of only the best matched
rule. Although several schemes have been proposed
recently to address the multimatch packet
classification problem, most of them require either
huge memory or expensive ternary content addressable
memory (TCAM) to store the intermediate data structure,
or they suffer from steep performance degradation under
certain types of classifiers. In this paper, we
decompose the operation of multimatch packet
classification from the complicated multidimensional
search to several single-dimensional searches, and
present an asynchronous pipeline architecture based on
a signature tree structure to combine the intermediate
results returned from single-dimensional searches. By
spreading edges of the signature tree across multiple
hash tables at different stages, the pipeline can
achieve a high throughput via the interstage parallel
access to hash tables. To exploit further intrastage
parallelism, two edge-grouping algorithms are designed
to evenly divide the edges associated with each stage
into multiple work-conserving hash tables. To avoid
collisions involved in hash table lookup, a hybrid
perfect hash table construction scheme is proposed.
Extensive simulation using realistic classifiers and
traffic traces shows that the proposed pipeline
architecture outperforms HyperCuts and B2PC schemes in
classification speed by at least one order of
magnitude, while having a similar storage requirement.
Particularly, with different types of classifiers of 4K
rules, the proposed pipeline architecture is able to
achieve a throughput between 26.8 and 93.1 Gb/s using
perfect hash tables.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Minnebo:2014:FCP,
author = "Wouter Minnebo and Benny {Van Houdt}",
title = "A fair comparison of pull and push strategies in large
distributed networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "996--1006",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270445",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we compare the performance of the pull
and push strategies in a large homogeneous distributed
system. When a pull strategy is in use, lightly loaded
nodes attempt to steal jobs from more highly loaded
nodes, while under the push strategy, more highly
loaded nodes look for lightly loaded nodes to process
some of their jobs. Given the maximum allowed overall
probe rate R and arrival rate $ \lambda $, we provide
closed-form solutions for the mean response time of a
job for the push and pull strategy under the infinite
system model. More specifically, we show that the push
strategy outperforms the pull strategy for any probe
rate $ R > 0 $ when $ \lambda < \varphi - 1 $, where $
\varphi = (1 + \sqrt 5) / 2 \approx 1.6180 $ is the
golden ratio. More generally, we show that the push
strategy prevails if and only if $ 2 \lambda < \sqrt (R
+ 1)^2 + 4 (R + 1) - (R + 1) $. We also show that under
the infinite system model, a hybrid pull-and-push
strategy is always inferior to the pure pull or push
strategy. The relation between the finite and infinite
system model is discussed, and simulation results that
validate the infinite system model are provided.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Congdon:2014:SRL,
author = "Paul T. Congdon and Prasant Mohapatra and Matthew
Farrens and Venkatesh Akella",
title = "Simultaneously reducing latency and power consumption
in {OpenFlow} switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "3",
pages = "1007--1020",
month = jun,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270436",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 1 09:58:30 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Ethernet switch is a primary building block for
today's enterprise networks and data centers. As
network technologies converge upon a single Ethernet
fabric, there is ongoing pressure to improve the
performance and efficiency of the switch while
maintaining flexibility and a rich set of packet
processing features. The OpenFlow architecture aims to
provide flexibility and programmable packet processing
to meet these converging needs. Of the many ways to
create an OpenFlow switch, a popular choice is to make
heavy use of ternary content addressable memories
(TCAMs). Unfortunately, TCAMs can consume a
considerable amount of power and, when used to match
flows in an OpenFlow switch, put a bound on switch
latency. In this paper, we propose enhancing an
OpenFlow Ethernet switch with per-port packet
prediction circuitry in order to simultaneously reduce
latency and power consumption without sacrificing rich
policy-based forwarding enabled by the OpenFlow
architecture. Packet prediction exploits the temporal
locality in network communications to predict the flow
classification of incoming packets. When predictions
are correct, latency can be reduced, and significant
power savings can be achieved from bypassing the full
lookup process. Simulation studies using actual network
traces indicate that correct prediction rates of 97\%
are achievable using only a small amount of prediction
circuitry per port. These studies also show that
prediction circuitry can help reduce the power consumed
by a lookup process that includes a TCAM by 92\% and
simultaneously reduce the latency of a cut-through
switch by 66\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cunha:2014:DSP,
author = "{\'I}talo Cunha and Renata Teixeira and Darryl Veitch
and Christophe Diot",
title = "{DTRACK}: a system to predict and track {Internet}
path changes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1025--1038",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2269837",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we implement and evaluate a system that
predicts and tracks Internet path changes to maintain
an up-to-date network topology. Based on empirical
observations, we claim that monitors can enhance
probing according to the likelihood of path changes. We
design a simple predictor of path changes and show that
it can be used to enhance probe targeting. Our path
tracking system, called DTRACK, focuses probes on
unstable paths and spreads probes over time to minimize
the chances of missing path changes. Our evaluations of
DTRACK with trace-driven simulations and with a
prototype show that DTRACK can detect up to three times
more path changes than traditional traceroute-based
topology mapping techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Altieri:2014:ACS,
author = "Andr{\'e}s Altieri and Leonardo Rey Vega and Pablo
Piantanida and Cecilia G. Galarza",
title = "Analysis of a cooperative strategy for a large
decentralized wireless network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1039--1051",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2269054",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the benefits of cooperation
and proposes a relay activation strategy for a large
wireless network with multiple transmitters. In this
framework, some nodes cooperate with a nearby node that
acts as a relay, using the decode-and-forward protocol,
and others use direct transmission. The network is
modeled as an independently marked Poisson point
process, and the source nodes may choose their relays
from the set of inactive nodes. Although cooperation
can potentially lead to significant improvements in the
performance of a communication pair, relaying causes
additional interference in the network, increasing the
average noise that other nodes see. We investigate how
source nodes should balance cooperation versus
interference to obtain reliable transmissions, and for
this purpose, we study and optimize a relay activation
strategy with respect to the outage probability.
Surprisingly, in the high reliability regime, the
optimized strategy consists on the activation of all
the relays or none at all, depending on network
parameters. We provide a simple closed-form expression
that indicates when the relays should be active, and we
introduce closed-form expressions that quantify the
performance gains of this scheme with respect to a
network that only uses direct transmission.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2014:MRW,
author = "Hyang-Won Lee and Kayi Lee and Eytan Modiano",
title = "Maximizing reliability in {WDM} networks through
lightpath routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1052--1066",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2266666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the reliability maximization problem in
wavelength division multiplexing (WDM) networks with
random link failures. Reliability in these networks is
defined as the probability that the logical network is
connected, and it is determined by the underlying
lightpath routing, network topologies, and the link
failure probability. By introducing the notion of
lexicographical ordering for lightpath routings, we
characterize precise optimization criteria for maximum
reliability in the low failure probability regime.
Based on the optimization criteria, we develop
lightpath routing algorithms that maximize the
reliability, and logical topology augmentation
algorithms for further improving reliability. We also
study the reliability maximization problem in the high
failure probability regime.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tapolcai:2014:SFF,
author = "J{\'a}nos Tapolcai and Pin-Han Ho and P{\'e}ter
Babarczi and Lajos R{\'o}nyai",
title = "On signaling-free failure dependent restoration in
all-optical mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1067--1078",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272599",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Failure dependent protection (FDP) is known to achieve
optimal capacity efficiency among all types of
protection, at the expense of longer recovery time and
more complicated signaling overhead. This particularly
hinders the usage of FDP in all-optical mesh networks.
As a remedy, this paper investigates a new restoration
framework that enables all-optical fault management and
device configuration via state-of-the-art failure
localization techniques, such as the FDP restoration
process. It can be implemented without relying on any
control plane signaling. With the proposed restoration
framework, a novel spare capacity allocation problem is
defined and is further analyzed on circulant topologies
for any single link failure, aiming to gain a solid
understanding of the problem. By allowing reuse of
monitoring resources for restoration capacity, we are
particularly interested in the monitoring resource
hidden property, where less or even no monitoring
resources are consumed as more working traffic is in
place. To deal with general topologies, we introduce a
novel heuristic approach to the proposed spare capacity
allocation problem, which comprises a generic FDP
survivable routing scheme followed by a novel
monitoring resource allocation method. Extensive
simulation is conducted to examine the proposed scheme
and verify the proposed restoration framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2014:MTD,
author = "Wen Luo and Shigang Chen and Yan Qiao and Tao Li",
title = "Missing-tag detection and energy-time tradeoff in
large-scale {RFID} systems with unreliable channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1079--1091",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270444",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) technologies are
poised to revolutionize retail, warehouse, and supply
chain management. One of their interesting applications
is to automatically detect missing tags in a large
storage space, which may have to be performed
frequently to catch any missing event such as theft in
time. Because RFID systems typically work under
low-rate channels, past research has focused on
reducing execution time of a detection protocol to
prevent excessively long protocol execution from
interfering normal inventory operations. However, when
active tags are used for a large spatial coverage,
energy efficiency becomes critical in prolonging the
lifetime of these battery-powered tags. Furthermore,
much of the existing literature assumes that the
channel between a reader and tags is reliable, which is
not always true in reality because of
noise/interference in the environment. Given these
concerns, this paper makes three contributions. First,
we propose a novel protocol design that considers both
energy efficiency and time efficiency. It achieves
multifold reduction in both energy cost and execution
time when compared to the best existing work. Second,
we reveal a fundamental energy-time tradeoff in
missing-tag detection, which can be flexibly controlled
through a couple of system parameters in order to
achieve desirable performance. Third, we extend our
protocol design to consider channel error under two
different models. We find that energy/time cost will be
higher in unreliable channel conditions, but the
energy-time tradeoff relation persists.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rottenstreich:2014:VIC,
author = "Ori Rottenstreich and Yossi Kanizo and Isaac
Keslassy",
title = "The variable-increment counting {Bloom} filter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1092--1105",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272604",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Counting Bloom Filters (CBFs) are widely used in
networking device algorithms. They implement fast set
representations to support membership queries with
limited error and support element deletions unlike
Bloom Filters. However, they consume significant
amounts of memory. In this paper, we introduce a new
general method based on variable increments to improve
the efficiency of CBFs and their variants. Unlike CBFs,
at each element insertion, the hashed counters are
incremented by a hashed variable increment instead of a
unit increment. Then, to query an element, the exact
value of a counter is considered and not just its
positiveness. We present two simple schemes based on
this method. We demonstrate that this method can always
achieve a lower false positive rate and a lower
overflow probability bound than CBF in practical
systems. We also show how it can be easily implemented
in hardware, with limited added complexity and memory
overhead. We further explain how this method can extend
many variants of CBF that have been published in the
literature. We then suggest possible improvements of
the presented schemes and provide lower bounds on their
memory consumption. Lastly, using simulations with
real-life traces and hash functions, we show how it can
significantly improve the false positive rate of CBFs
given the same amount of memory.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:PME,
author = "Yishuai Chen and Baoxian Zhang and Changjia Chen and
Dah Ming Chiu",
title = "Performance modeling and evaluation of peer-to-peer
live streaming systems under flash crowds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1106--1120",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272056",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A peer-to-peer (P2P) live streaming system faces a big
challenge under flash crowds. When a flash crowd
occurs, the sudden arrival of numerous peers may starve
the upload capacity of the system, hurt its quality of
service, and even cause system collapse. This paper
provides a comprehensive study on the performance of
P2P live streaming systems under flash crowds. By
modeling the systems using a fluid model, we study the
system capacity, peer startup latency, and system
recovery time of systems with and without admission
control for flash crowds, respectively. Our study
demonstrates that, without admission control, a P2P
live streaming system has limited capacity to handle
flash crowds. We quantify this capacity by the largest
flash crowd (measured in shock level) that the system
can handle, and further find this capacity is
independent of system initial state while decreasing as
departure rate of stable peer increases, in a power-law
relationship. We also establish the mathematical
relationship of flash crowd size to the worst-case peer
startup latency and system recovery time. For a system
with admission control, we prove that it can recover
stability under flash crowds of any sizes. Moreover,
its worst-case peer startup latency and system recovery
time increase logarithmically with the flash crowd
size. Based on the analytical results, we present
detailed flash crowd handling strategies, which can be
used to achieve satisfying peer startup performance
while keeping system stability in the presence of flash
crowds under different circumstances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mohsenian-Rad:2014:RIN,
author = "Hamed Mohsenian-Rad and Jianwei Huang and Vincent W.
S. Wong and Robert Schober",
title = "Repeated intersession network coding games: efficiency
and min-max bargaining solution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1121--1135",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2271038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent results have shown that selfish users do not
have an incentive to participate in intersession
network coding in a static noncooperative game setting.
Because of this, the worst-case network efficiency
(i.e., the price-of-anarchy) can be as low as 20\%. In
this paper, we show that if the same game is played
repeatedly, then the price-of-anarchy can be improved
to 36\%. We design a grim-trigger strategy that
encourages users to cooperate and participate in the
intersession network coding. A key challenge is to
determine a common cooperative coding rate that the
users should mutually agree on. We resolve the conflict
of interest among the users through a bargaining
process and obtain tight upper bounds for the
price-of-anarchy that are valid for any possible
bargaining scheme. Moreover, we propose a simple and
efficient min-max bargaining solution that can achieve
these upper bounds, as confirmed through simulation
studies. The coexistence of multiple selfish network
coding sessions as well as the coexistence of selfish
network coding and routing sessions are also
investigated. Our results represent a first step toward
designing practical intersession network coding schemes
that achieve reasonable performance for selfish
users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2014:FMM,
author = "Myungjin Lee and Sharon Goldberg and Ramana Rao
Kompella and George Varghese",
title = "{FineComb}: measuring microscopic latency and loss in
the presence of reordering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1136--1149",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272080",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern stock trading and cluster applications require
microsecond latencies and almost no losses in data
centers. This paper introduces an algorithm called
FineComb that can obtain fine-grain end-to-end loss and
latency measurements between edge routers in these
networks. Such a mechanism can allow managers to
distinguish between latencies and loss singularities
caused by servers and those caused by the network.
Compared to prior work, such as Lossy Difference
Aggregator (LDA), which focused on switch-level latency
measurements, the requirement of end-to-end latency
measurements introduces the challenge of reordering
that occurs commonly in IP networks due to churn. The
problem is even more acute in switches across data
center networks that employ multipath routing
algorithms to exploit the inherent path diversity.
Without proper care, a loss estimation algorithm can
confound loss and reordering; furthermore, any attempt
to aggregate delay estimates in the presence of
reordering results in severe errors. FineComb deals
with these problems using order-agnostic packet digests
and a simple new idea we call stash recovery. Our
evaluation demonstrates that FineComb is orders of
magnitude more accurate than LDA in loss and delay
estimates in the presence of reordering.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2014:NDD,
author = "Shizhen Zhao and Xinbing Wang",
title = "Node density and delay in large-scale wireless
networks with unreliable links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1150--1163",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270088",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the delay performance in large-scale wireless
multihop networks with unreliable links from
percolation perspective. Previous works have showed
that the end-to-end delay scales linearly with the
source-to-destination distance, and thus the delay
performance can be characterized by the delay-distance
ratio $ \gamma $. However, the range of $ \gamma $,
which may be the most important parameter for delay,
remains unknown. We expect that $ \gamma $ may depend
heavily on the node density $ \lambda $ of a wireless
multihop network. In this paper, we investigate the
fundamental relationship between $ \gamma $ and $
\lambda $. Obtaining the exact value of $ \gamma
(\lambda) $ is extremely hard, mainly because of the
dynamically changing network topologies caused by the
link unreliability. Instead, we provide both upper
bound and lower bound to the delay-distance ratio $
\gamma (\lambda) $. Simulations are conducted to verify
our theoretical analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yue:2014:UTI,
author = "Hao Yue and Chi Zhang and Miao Pan and Yuguang Fang
and Shigang Chen",
title = "Unknown-target information collection in
sensor-enabled {RFID} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1164--1175",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sensor-enabled radio frequency identification (RFID)
technology has generated a lot of interest from
industries lately. Integrated with miniaturized
sensors, RFID tags can provide not only the IDs, but
also valuable real-time information about the state of
the objects or their surrounding environment, which can
benefit many practical applications, such as warehouse
management and inventory control. In this paper, we
study the problem of designing efficient protocols for
a reader to collect sensor-produced information from
unknown target tags in an RFID system with minimum
execution time. Different from information collection
with all target tags known a priori, in the scenarios
we consider, the reader has to first find out the
target tags in order to read information from them,
which makes traditional information collection
protocols not efficient any more. We design a
Bloom-filter-based information collection protocol
(BIC) to address this challenging problem. A Bloom
filter is constructed for the reader to efficiently
determine the target tags, which significantly reduces
the communication and time overhead. We also introduce
the allocation vectors to coordinate the transmissions
from different tags and minimize collision during
information collection. Extensive simulation results
demonstrate that our protocol is highly efficient in
terms of execution time, and it performs much better
than other solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aurzada:2014:FAN,
author = "Frank Aurzada and Martin L{\'e}vesque and Martin Maier
and Martin Reisslein",
title = "{FiWi} access networks based on next-generation {PON}
and gigabit-class {WLAN} technologies: a capacity and
delay analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1176--1189",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270360",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current Gigabit-class passive optical networks (PONs)
evolve into next-generation PONs, whereby high-speed
Gb/s time division multiplexing (TDM) and long-reach
wavelength-broadcasting/routing wavelength division
multiplexing (WDM) PONs are promising near-term
candidates. On the other hand, next-generation wireless
local area networks (WLANs) based on frame aggregation
techniques will leverage physical-layer enhancements,
giving rise to Gigabit-class very high throughput (VHT)
WLANs. In this paper, we develop an analytical
framework for evaluating the capacity and delay
performance of a wide range of routing algorithms in
converged fiber-wireless (FiWi) broadband access
networks based on different next-generation PONs and a
Gigabit-class multiradio multichannel WLAN-mesh front
end. Our framework is very flexible and incorporates
arbitrary frame size distributions, traffic matrices,
optical/wireless propagation delays, data rates, and
fiber faults. We verify the accuracy of our
probabilistic analysis by means of simulation for the
wireless and wireless-optical-wireless operation modes
of various FiWi network architectures under
peer-to-peer, upstream, uniform, and nonuniform traffic
scenarios. The results indicate that our proposed
optimized FiWi routing algorithm (OFRA) outperforms
minimum (wireless) hop and delay routing in terms of
throughput for balanced and unbalanced traffic loads,
at the expense of a slightly increased mean delay at
small to medium traffic loads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sheng:2014:PIT,
author = "Shang-Pin Sheng and Mingyan Liu",
title = "Profit incentive in trading nonexclusive access on a
secondary spectrum market through contract design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1190--1203",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2270954",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we formulate a contract design problem
where a primary license holder wishes to profit from
its excess spectrum capacity by selling it to potential
secondary users/buyers. It needs to determine how to
optimally price the excess spectrum so as to maximize
its profit, knowing that this excess capacity is
stochastic in nature, does not come with exclusive
access, and cannot provide deterministic service
guarantees to a buyer. At the same time, buyers are of
different types, characterized by different
communication needs, tolerance for the channel
uncertainty, and so on, all of which are a buyer's
private information. The license holder must then try
to design different contracts catered to different
types of buyers in order to maximize its profit. We
address this problem by adopting as a reference a
traditional spectrum market where the buyer can
purchase exclusive access with fixed/deterministic
guarantees. We fully characterize the optimal solution
in the cases where there is a single buyer type, and
when multiple types of buyers share the same known
channel condition as a result of the primary user
activity. In the most general case, we construct an
algorithm that generates a set of contracts in a
computationally efficient manner and show that this set
is optimal when the buyer types satisfy a monotonicity
condition.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Choi:2014:DLS,
author = "Jin-Ghoo Choi and Changhee Joo and Junshan Zhang and
Ness B. Shroff",
title = "Distributed link scheduling under {SINR} model in
multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1204--1217",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2273100",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Link adaptation technologies, such as Adaptive
Modulation and Coding (AMC) and
Multiple-Input-Multiple-Output (MIMO), are used in
advanced wireless communication systems to achieve high
spectrum efficiency. Communication performance can be
improved significantly by adaptive transmissions based
on the quality of received signals, i.e., the
signal-to-interference-plus-noise ratio (SINR).
However, for multihop wireless communications, most
link scheduling schemes have been developed under
simplified interference models that do not account for
accumulative interference and cannot fully exploit the
recent advances in PHY-layer communication theory. This
paper focuses on developing link scheduling schemes
that can achieve optimal performance under the SINR
model. One key idea is to treat an adaptive wireless
link as multiple parallel virtual links with different
signal quality, building on which we develop
throughput-optimal scheduling schemes using a two-stage
queueing structure in conjunction with recently
developed carrier-sensing techniques. Furthermore, we
introduce a novel three-way handshake to ensure, in a
distributed manner, that all transmitting links satisfy
their SINR requirements. We evaluate the proposed
schemes through rigorous analysis and simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2014:DSP,
author = "Xin Zhang and Fanfu Zhou and Xinyu Zhu and Haiyang Sun
and Adrian Perrig and Athanasios V. Vasilakos and
Haibing Guan",
title = "{DFL}: secure and practical fault localization for
datacenter networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1218--1231",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2274662",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Datacenter networking has gained increasing popularity
in the past few years. While researchers paid
considerable efforts to enhance the performance and
scalability of datacenter networks, achieving reliable
data delivery in these emerging networks with
misbehaving routers and switches received far less
attention. Unfortunately, documented incidents of
router compromise underscore that the capability to
identify adversarial routers and switches is an
imperative and practical need rather than merely a
theoretical exercise. To this end, data-plane fault
localization (FL) aims to identify faulty links and is
an effective means of achieving high network
availability. However, existing secure FL protocols
assume that the source node knows the entire outgoing
path that delivers the source node's packets and that
the path is static and long-lived. These assumptions
are invalidated by the dynamic traffic patterns and
agile load balancing commonly seen in modern datacenter
networks. We propose the first secure FL protocol, DFL,
with no requirements on path durability or the source
node knowing the outgoing paths. Through a core
technique we named delayed function disclosure, DFL
incurs little communication overhead and a small,
constant router state independent of the network size
or the number of flows traversing a router.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Houmansadr:2014:NBW,
author = "Amir Houmansadr and Negar Kiyavash and Nikita
Borisov",
title = "Non-blind watermarking of network flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1232--1244",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272740",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Linking network flows is an important problem in
intrusion detection as well as anonymity. Passive
traffic analysis can link flows, but requires long
periods of observation to reduce errors. Active traffic
analysis, also known as flow watermarking, allows for
better precision and is more scalable. Previous flow
watermarks introduce significant delays to the traffic
flow as a side effect of using a blind detection
scheme; this enables attacks that detect and remove the
watermark, while at the same time slowing down
legitimate traffic. We propose the first non-blind
approach for flow watermarking, called RAINBOW, that
improves watermark invisibility by inserting delays
hundreds of times smaller than previous blind
watermarks, hence reduces the watermark interference on
network flows. We derive and analyze the optimum
detectors for RAINBOW as well as the passive traffic
analysis under different traffic models by using
hypothesis testing. Comparing the detection performance
of RAINBOW and the passive approach, we observe that
both RAINBOW and passive traffic analysis perform
similarly good in the case of uncorrelated traffic,
however the RAINBOW detector drastically outperforms
the optimum passive detector in the case of correlated
network flows. This justifies the use of non-blind
watermarks over passive traffic analysis even though
both approaches have similar scalability constraints.
We confirm our analysis by simulating the detectors and
testing them against large traces of real network
flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:MST,
author = "Shuang Li and Zizhan Zheng and Eylem Ekici and Ness
Shroff",
title = "Maximizing system throughput by cooperative sensing in
cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1245--1256",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272722",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cognitive radio networks (CRNs) allow unlicensed users
to opportunistically access the licensed spectrum
without causing disruptive interference to the primary
users (PUs). One of the main challenges in CRNs is the
ability to detect PU transmissions. Recent works have
suggested the use of secondary user (SU) cooperation
over individual sensing to improve sensing accuracy. In
this paper, we consider a CRN consisting of multiple
PUs and SUs to study the problem of maximizing the
total expected system throughput. First, we study the
sensing decision problem for maximizing the system
throughput subject to a constraint on the PU
throughput, and we design a Bayesian decision
rule-based algorithm. The problem is shown to be
strongly NP-hard and solved via a greedy algorithm with
time complexity $ O(N^5 / \log^2 (1 / 1 - \epsilon)) $,
where $N$ is the total number of SUs. The algorithm
achieves a throughput strictly greater than $ (1 / 2)
(1 - \epsilon)$ of the optimal solution and results in
a small constraint violation that goes to zero with $
\epsilon $. We then investigate the more general
problem with constraints on both PU throughput and the
sensing time overhead, which limits the number of SUs
that can participate in cooperative sensing. We
illustrate the efficacy of the performance of our
algorithms and provide sensitivity analysis via a
numerical investigation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rosberg:2014:IJA,
author = "Zvi Rosberg and Yu Peng and Jing Fu and Jun Guo and
Eric W. M. Wong and Moshe Zukerman",
title = "Insensitive job assignment with throughput and energy
criteria for processor-sharing server farms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1257--1270",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2276427",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of stochastic job assignment in a
server farm comprising multiple processor-sharing
servers with various speeds and finite buffer sizes. We
consider two types of assignment policies: without
jockeying, where an arriving job is assigned only once
to an available server, and with jockeying, where a job
may be reassigned at any time. We also require that the
underlying Markov process under each policy is
insensitive. Namely, the stationary distribution of the
number of jobs in the system is independent of the job
size distribution except for its mean. For the case
without jockeying, we derive two insensitive heuristic
policies: One aims at maximizing job throughput, and
the other trades off job throughput for energy
efficiency. For the case with jockeying, we formulate
the optimal assignment problem as a semi-Markov
decision process and derive optimal policies with
respect to various optimization criteria. We further
derive two simple insensitive heuristic policies with
jockeying: One maximizes job throughput, and the other
aims at maximizing energy efficiency. Numerical
examples demonstrate that, under a wide range of system
parameters, the latter policy performs very close to
the optimal policy. Numerical examples also demonstrate
energy/throughput tradeoffs for the various policies
and, in the case with jockeying, they show a potential
of substantial energy savings relative to a policy that
optimizes throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2014:IID,
author = "Wei Dong and Swati Rallapalli and Rittwik Jana and
Lili Qiu and K. K. Ramakrishnan and Leo Razoumov and
Yin Zhang and Tae Won Cho",
title = "{iDEAL}: incentivized dynamic cellular offloading via
auctions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1271--1284",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2273766",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The explosive growth of cellular traffic and its
highly dynamic nature often make it increasingly
expensive for a cellular service provider to provision
enough cellular resources to support the peak traffic
demands. In this paper, we propose iDEAL, a novel
auction-based incentive framework that allows a
cellular service provider to leverage resources from
third-party resource owners on demand by buying
capacity whenever needed through reverse auctions.
iDEAL has several distinctive features: (1) iDEAL
explicitly accounts for the diverse spatial coverage of
different resources and can effectively foster
competition among third-party resource owners in
different regions, resulting in significant savings to
the cellular service provider. (2) iDEAL provides
revenue incentives for third-party resource owners to
participate in the reverse auction and be truthful in
the bidding process. (3) iDEAL is provably efficient.
(4) iDEAL effectively guards against collusion. (5)
iDEAL effectively copes with the dynamic nature of
traffic demands. In addition, iDEAL has useful
extensions that address important practical issues.
Extensive evaluation based on real traces from a large
US cellular service provider clearly demonstrates the
effectiveness of our approach. We further demonstrate
the feasibility of iDEAL using a prototype
implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Teng:2014:ELI,
author = "Jin Teng and Boying Zhang and Junda Zhu and Xinfeng Li
and Dong Xuan and Yuan F. Zheng",
title = "{EV-Loc}: integrating electronic and visual signals
for accurate localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1285--1296",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2274283",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Nowadays, more and more objects can be represented
with electronic identifiers, e.g., people can be
recognized from their laptops' MACs, and products can
be identified by their RFID numbers. Localizing
electronic identifiers is more and more important for a
fully digitalized life. However, traditional wireless
localization techniques are not satisfactory in
performance to determine these electronic identifiers'
positions. Some of them require costly hardware to
achieve high accuracy and, hence, are not practical.
The others are inaccurate and not robust against
environmental noises, e.g., RSSI-based localization.
Therefore, an accurate and practical approach for
localizing electronic identifiers is needed. In this
paper, we propose a new localization technique called
EV-Loc. In EV-Loc, we make use of visual signals to
help improve the accuracy of wireless localization. Our
technique fully takes advantage of the high accuracy of
visual signals and pervasiveness of electronic signals.
To effectively couple these two signals together, we
have designed an E-V match engine to find the
correspondence between an object's electronic
identifier and its visual appearance. We have
implemented our technique on mobile devices and
evaluated it in the real world. The localization error
is less than 1 m. We have also evaluated our approach
using large-scale simulations. The results show that
our approach is accurate and robust.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Seferoglu:2014:NCA,
author = "Hulya Seferoglu and Athina Markopoulou",
title = "Network coding-aware queue management for {TCP} flows
over coded wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1297--1310",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2278292",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we are interested in improving the
performance of TCP flows over wireless networks with a
given constructive intersession network coding scheme.
We are motivated by the observation that TCP does not
fully exploit the potential of the underlying network
coding opportunities. In order to improve the
performance of TCP flows over coded wireless networks,
without introducing changes to TCP itself, we propose a
network-coding aware queue management scheme (NCAQM)
that is implemented at intermediate network coding
nodes and bridges the gap between network coding and
TCP rate control. The design of NCAQM is grounded on
the network utility maximization (NUM) framework and
includes the following mechanisms. NCAQM: (1) stores
coded packets at intermediate nodes in order to use the
buffer space more efficiently; (2) determines what
fraction of the flows should be coded together; and (3)
drops packets at intermediate nodes so that it matches
the rates of parts of different TCP flows that are
coded together. We demonstrate, via simulation, that
NCAQM significantly improves TCP throughput compared to
TCP over baseline queue management schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2014:TCA,
author = "Peng Yang and Juan Shao and Wen Luo and Lisong Xu and
Jitender Deogun and Ying Lu",
title = "{TCP} congestion avoidance algorithm identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1311--1324",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2278271",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet has recently been evolving from
homogeneous congestion control to heterogeneous
congestion control. Several years ago, Internet traffic
was mainly controlled by the traditional RENO, whereas
it is now controlled by multiple different TCP
algorithms, such as RENO, CUBIC, and Compound TCP
(CTCP). However, there is very little work on the
performance and stability study of the Internet with
heterogeneous congestion control. One fundamental
reason is the lack of the deployment information of
different TCP algorithms. In this paper, we first
propose a tool called TCP Congestion Avoidance
Algorithm Identification (CAAI) for actively
identifying the TCP algorithm of a remote Web server.
CAAI can identify all default TCP algorithms (e.g.,
RENO, CUBIC, and CTCP) and most non-default TCP
algorithms of major operating system families. We then
present the CAAI measurement result of about 30 000 Web
servers. We found that only 3.31\%-14.47\% of the Web
servers still use RENO, 46.92\% of the Web servers use
BIC or CUBIC, and 14.5\%-25.66\% of the Web servers use
CTCP. Our measurement results show a strong sign that
the majority of TCP flows are not controlled by RENO
anymore, and a strong sign that the Internet congestion
control has changed from homogeneous to
heterogeneous.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:SAO,
author = "Shengbo Chen and Prasun Sinha and Ness B. Shroff and
Changhee Joo",
title = "A simple asymptotically optimal joint energy
allocation and routing scheme in rechargeable sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1325--1336",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2273830",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the utility maximization
problem for a sensor network with energy replenishment.
Each sensor node consumes energy in its battery to
generate and deliver data to its destination via
multihop communications. Although the battery can be
replenished from renewable energy sources, the energy
allocation should be carefully designed in order to
maximize system performance, especially when the
replenishment profile is unknown in advance. In this
paper, we address the joint problem of energy
allocation and routing to maximize the total system
utility, without prior knowledge of the replenishment
profile. We first characterize optimal throughput of a
single node under general replenishment profile and
extend our idea to the multihop network case. After
characterizing the optimal network utility with an
upper bound, we develop a low-complexity online
solution that achieves asymptotic optimality. Focusing
on long-term system performance, we can greatly
simplify computational complexity while maintaining
high performance. We also show that our solution can be
approximated by a distributed algorithm using standard
optimization techniques. In addition, we show that the
required battery size is $ O(1 / \xi) $ to constrain
the performance of our scheme within $ \xi $
-neighborhood of the optimum. Through simulations with
replenishment profile traces for solar and wind energy,
we numerically evaluate our solution, which outperforms
a state-of-the-art scheme that is developed based on
the Lyapunov optimization technique.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2014:PON,
author = "Yuan Shen and Wenhan Dai and Moe Z. Win",
title = "Power optimization for network localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1337--1350",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2278984",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reliable and accurate localization of mobile objects
is essential for many applications in wireless
networks. In range-based localization, the position of
the object can be inferred using the distance
measurements from wireless signals exchanged with
active objects or reflected by passive ones. Power
allocation for ranging signals is important since it
affects not only network lifetime and throughput but
also localization accuracy. In this paper, we establish
a unifying optimization framework for power allocation
in both active and passive localization networks. In
particular, we first determine the functional
properties of the localization accuracy metric, which
enable us to transform the power allocation problems
into second-order cone programs (SOCPs). We then
propose the robust counterparts of the problems in the
presence of parameter uncertainty and develop
asymptotically optimal and efficient near-optimal
SOCP-based algorithms. Our simulation results validate
the efficiency and robustness of the proposed
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2014:ILM,
author = "Liang Ma and Ting He and Kin K. Leung and Ananthram
Swami and Don Towsley",
title = "Inferring link metrics from end-to-end path
measurements: identifiability and monitor placement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1351--1368",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2328668",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the problem of identifying individual
link metrics in a communication network from end-to-end
path measurements, under the assumption that link
metrics are additive and constant. To uniquely identify
the link metrics, the number of linearly independent
measurement paths must equal the number of links. Our
contribution is to characterize this condition in terms
of the network topology and the number/placement of
monitors, under the constraint that measurement paths
must be cycle-free. Our main results are: (1) it is
generally impossible to identify all the link metrics
by using two monitors; (2) nevertheless, metrics of all
the interior links not incident to any monitor are
identifiable by two monitors if the topology satisfies
a set of necessary and sufficient connectivity
conditions; (3) these conditions naturally extend to a
necessary and sufficient condition for identifying all
the link metrics using three or more monitors. We show
that these conditions not only facilitate efficient
identifiability tests, but also enable an efficient
algorithm to place the minimum number of monitors in
order to identify all link metrics. Our evaluations on
both random and real topologies show that the proposed
algorithm achieves identifiability using a much smaller
number of monitors than a baseline solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gopalan:2014:MNL,
author = "Abishek Gopalan and Srinivasan Ramasubramanian",
title = "On the maximum number of linearly independent cycles
and paths in a network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1373--1388",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291208",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Central to network tomography is the problem of
identifiability, the ability to identify internal
network characteristics uniquely from end-to-end
measurements. This problem is often underconstrained
even when internal network characteristics such as link
delays are modeled as additive constants. While it is
known that the network topology can play a role in
determining the extent of identifiability, there is a
lack in the fundamental understanding of being able to
quantify it for a given network. In this paper, we
consider the problem of identifying additive link
metrics in an arbitrary undirected network using
measurement nodes and establishing paths/cycles between
them. For a given placement of measurement nodes, we
define and derive the ``link rank'' of the network--the
maximum number of linearly independent cycles/paths
that may be established between the measurement nodes.
We achieve this in linear time. The link rank helps
quantify the exact extent of identifiability in a
network. We also develop a quadratic time algorithm to
compute a set of cycles/paths that achieves the maximum
rank.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2014:YFM,
author = "Bo Han and Jian Li and Aravind Srinivasan",
title = "Your friends have more friends than you do:
identifying influential mobile users through
random-walk sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1389--1400",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2280436",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the problem of
identifying influential users in mobile social
networks. Influential users are individuals with high
centrality in their social-contact graphs. Traditional
approaches find these users through centralized
algorithms. However, the computational complexity of
these algorithms is known to be very high, making them
unsuitable for large-scale networks. We propose a
lightweight and distributed protocol, iWander, to
identify influential users through fixed-length
random-walk sampling. We prove that random-walk
sampling with O (log n ) steps, where is the number of
nodes in a graph, comes quite close to sampling
vertices approximately according to their degrees. To
the best of our knowledge, we are the first to design a
distributed protocol on mobile devices that leverages
random walks for identifying influential users,
although this technique has been used in other areas.
The most attractive feature of iWander is its extremely
low control-message overhead, which lends itself well
to mobile applications. We evaluate the performance of
iWander for two applications, targeted immunization of
infectious diseases and target-set selection for
information dissemination. Through extensive simulation
studies using a real-world mobility trace, we
demonstrate that targeted immunization using iWander
achieves a comparable performance with a degree-based
immunization policy that vaccinates users with a large
number of contacts first, while generating only less
than 1\% of this policy's control messages. We also
show that target-set selection based on iWander
outperforms the random and degree-based selections for
information dissemination in several scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:RSR,
author = "Chao-Chih Chen and Lihua Yuan and Albert Greenberg and
Chen-Nee Chuah and Prasant Mohapatra",
title = "Routing-as-a-service {(RaaS)}: a framework for
tenant-directed route control in data center",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1401--1414",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2277880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a multi-tenant data center environment, the current
paradigm for route control customization involves a
labor-intensive ticketing process where tenants submit
route control requests to the landlord. This results in
tight coupling between tenants and the landlord,
extensive human resource deployment, and long ticket
resolution time. We propose Routing-as-a-Service
(RaaS), a framework for tenant-directed route control
in data centers. We show that RaaS-based implementation
provides a route control platform where multiple
tenants can perform route control independently with
little administrative involvement, and the landlord can
set the overall network policies. RaaS-based solutions
can run on commercial off-the-shelf (COTS) hardware and
leverage existing technologies, so it can be
implemented in existing networks without major
infrastructural overhaul. We present the design of
RaaS, introduce its components, and evaluate a
prototype based on RaaS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Castro:2014:UTR,
author = "Ignacio Castro and Rade Stanojevic and Sergey
Gorinsky",
title = "Using tuangou to reduce {IP} transit costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1415--1428",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2278236",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A majority of Internet service providers (ISPs)
support connectivity to the entire Internet by
transiting their traffic via other providers. Although
the transit prices per megabit per second (Mbps)
decline steadily, the overall transit costs of these
ISPs remain high or even increase due to the traffic
growth. The discontent of the ISPs with the high
transit costs has yielded notable innovations such as
peering, content distribution networks, multicast, and
peer-to-peer localization. While the above solutions
tackle the problem by reducing the transit traffic,
this paper explores a novel approach that reduces the
transit costs without altering the traffic. In the
proposed Cooperative IP Transit (CIPT), multiple ISPs
cooperate to jointly purchase Internet Protocol (IP)
transit in bulk. The aggregate transit costs decrease
due to the economies-of-scale effect of typical
subadditive pricing as well as burstable billing: Not
all ISPs transit their peak traffic during the same
period. To distribute the aggregate savings among the
CIPT partners, we propose Shapley-value sharing of the
CIPT transit costs. Using public data about IP traffic
and transit prices, we quantitatively evaluate CIPT and
show that significant savings can be achieved, both in
relative and absolute terms. We also discuss the
organizational embodiment, relationship with transit
providers, traffic confidentiality, and other aspects
of CIPT.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{VanDeVen:2014:BEH,
author = "P. M. {Van De Ven} and Augustus J. E. M. Janssen and
J. S. H. {Van Leeuwaarden}",
title = "Balancing exposed and hidden nodes in linear wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1429--1443",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2277654",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless networks equipped with the CSMA protocol are
subject to collisions due to interference. For a given
interference range, we investigate the tradeoff between
collisions (hidden nodes) and unused capacity (exposed
nodes). We show that the sensing range that maximizes
throughput critically depends on the activation rate of
nodes. For infinite line networks, we prove the
existence of a threshold: When the activation rate is
below this threshold, the optimal sensing range is
small (to maximize spatial reuse). When the activation
rate is above the threshold, the optimal sensing range
is just large enough to preclude all collisions.
Simulations suggest that this threshold policy extends
to more complex linear and nonlinear topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahlehagh:2014:VAS,
author = "Hasti Ahlehagh and Sujit Dey",
title = "Video-aware scheduling and caching in the radio access
network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1444--1462",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2294111",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we introduce distributed caching of
videos at the base stations of the Radio Access Network
(RAN) to significantly improve the video capacity and
user experience of mobile networks. To ensure
effectiveness of the massively distributed but
relatively small-sized RAN caches, unlike Internet
content delivery networks (CDNs) that can store
millions of videos in a relatively few large-sized
caches, we propose RAN-aware reactive and proactive
caching policies that utilize User Preference Profiles
(UPPs) of active users in a cell. Furthermore, we
propose video-aware backhaul and wireless channel
scheduling techniques that, in conjunction with edge
caching, ensure maximizing the number of concurrent
video sessions that can be supported by the end-to-end
network while satisfying their initial delay
requirements and minimize stalling. To evaluate our
proposed techniques, we developed a statistical
simulation framework using MATLAB and performed
extensive simulations under various cache sizes, video
popularity and UPP distributions, user dynamics, and
wireless channel conditions. Our simulation results
show that RAN caches using UPP-based caching policies,
together with video-aware backhaul scheduling, can
improve capacity by 300\% compared to having no RAN
caches, and by more than 50\% compared to RAN caches
using conventional caching policies. The results also
demonstrate that using UPP-based RAN caches can
significantly improve the probability that video
requests experience low initial delays. In networks
where the wireless channel bandwidth may be
constrained, application of our video-aware wireless
channel scheduler results in significantly (up to
250\%) higher video capacity with very low stalling
probability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Antikainen:2014:DSA,
author = "Markku Antikainen and Tuomas Aura and Mikko
S{\"a}rel{\"a}",
title = "Denial-of-service attacks in {Bloom}-filter-based
forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1463--1476",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2281614",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Bloom-filter-based forwarding has been suggested to
solve several fundamental problems in the current
Internet, such as routing-table growth, multicast
scalability issues, and denial-of-service (DoS) attacks
by botnets. The proposed protocols are source-routed
and include the delivery tree encoded as a Bloom filter
in each packet. The network nodes forward packets based
on this in-packet information without consulting
routing tables and without storing per-flow state. We
show that these protocols have critical vulnerabilities
and make several false security assumptions. In
particular, we present DoS attacks against broad
classes of Bloom-filter-based protocols and conclude
that the protocols are not ready for deployment on open
networks. The results also help us understand the
limitations and design options for Bloom-filter
forwarding.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2014:SMW,
author = "Shihuan Liu and Eylem Ekici and Lei Ying",
title = "Scheduling in multihop wireless networks without
back-pressure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1477--1488",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2278840",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper focuses on scheduling in multihop wireless
networks where flows are associated with fixed routes.
The well-known back-pressure scheduling algorithm is
throughput-optimal, but requires constant exchange of
queue length information among neighboring nodes for
calculating the ``back-pressure.'' Moreover, previous
research shows that the total queue length along a
route increases quadratically as the route length under
the backpressure algorithm, resulting in poor delay
performance. In this paper, we propose a self-regulated
MaxWeight scheduling, which does not require
back-pressure calculation. We prove that the
self-regulated MaxWeight scheduling is
throughput-optimal (an algorithm is said to be
throughput-optimal if it can stabilize any traffic that
can be stabilized by any other algorithm). In the
simulation part, we show that the self-regulated
MaxWeight scheduling has a much better delay
performance than the back-pressure algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2014:ROU,
author = "Jin Xiao and Raouf Boutaba",
title = "Reconciling the overlay and underlay tussle",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1489--1502",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2281276",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the presence of multiple overlays and underlays,
the emerging global network behavior is the result of
interactions of self-serving overlay routing decisions
and independent underlay management actions. It is
crucial for network operators, service, and content
providers to have a good grasp of the underlying
principles in order to better design and manage current
and future networks and services. In this paper, we
describe special game scenarios wherein the interaction
of noncooperative overlays and underlays in multidomain
networks can result in an operable global configuration
in linear time and the overall convergence is
polynomial in the unweighed case. For weighted games,
we find that weighted Shapley potential can achieve
linear time convergence to an operable state.
Furthermore, we analyze the interaction of overlays and
underlays as a two-stage congestion game and recommend
simple operational guidelines to ensure global
stability. We further explore the use of Shapley value
as an enabler of mutual cooperation in an otherwise
competitive environment. Our simulation results confirm
our findings and demonstrate its effectiveness in
general networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:RDM,
author = "Dan Li and Hongze Zhao and Mingwei Xu and Xiaoming
Fu",
title = "Revisiting the design of mega data centers:
considering heterogeneity among containers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1503--1515",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2280764",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we revisit the design of mega data
centers, which are usually built by a number of
modularized containers. Due to technical innovation and
vendor diversity, heterogeneity widely exists among
data-center containers in practice. To embrace this
issue, we propose uFix, which is a scalable, flexible,
and modularized network architecture to interconnect
heterogeneous data-center containers. The
intercontainer connection rule in uFix is designed in
such a way that it can flexibly scale to a huge number
of servers with stable server/switch hardware settings.
uFix allows modularized and fault-tolerant routing by
completely decoupling intercontainer routing from
intracontainer routing. We implement a software-based
uFix prototype on a Linux platform. Both simulation and
prototype-based experiment show that uFix enjoys high
network capacity, gracefully handles server/switch
failures, and causes lightweight CPU overhead onto
data-center servers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Muthusamy:2014:IFC,
author = "Vinod Muthusamy and Hans-Arno Jacobsen",
title = "Infrastructure-free content-based publish\slash
subscribe",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1516--1530",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2282159",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer (P2P) networks can offer benefits to
distributed content-based publish/subscribe data
dissemination systems. In particular, since a P2P
network's aggregate resources grow as the number of
participants increases, scalability can be achieved
using no infrastructure other than the participants'
own resources. This paper proposes algorithms for
supporting content-based publish/subscribe in which
subscriptions can specify a range of interest and
publications a range of values. The algorithms are
built over a distributed hash table abstraction and are
completely decentralized. Load balance is addressed by
subscription delegation away from overloaded peers and
a bottom-up tree search technique that avoids root
hotspots. Furthermore, fault tolerance is achieved with
a lightweight replication scheme that quickly detects
and recovers from faults. Experimental results support
the scalability and fault-tolerance properties of the
algorithms: For example, doubling the number of
subscriptions does not double internal system messages,
and even the simultaneous failure of 20\% of the peers
in the system requires less than 2 min to fully
recover.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yoon:2014:VMJ,
author = "Jongwon Yoon and Honghai Zhang and Suman Banerjee and
Sampath Rangarajan",
title = "Video multicast with joint resource allocation and
adaptive modulation and coding in {4G} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1531--1544",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2279887",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although wireless broadband technologies have evolved
significantly over the past decade, they are still
insufficient to support the fast-growing mobile
traffic, especially due to the increasing popularity of
mobile video applications. Wireless multicast, aiming
to exploit the wireless broadcast advantage, is a
viable approach to bridge the gap between the limited
wireless capacity and the ever-increasing mobile video
traffic demand. In this paper, we propose MuVi, a
Multicast Video delivery scheme through joint optimal
resource allocation and adaptive modulation and coding
scheme in OFDMA-based 4G cellular networks. MuVi
differentiates video frames based on their importance
in reconstructing the video and incorporates an
efficient radio resource allocation algorithm to
optimize the overall video quality across all users in
the multicast group. MuVi is a lightweight solution
with most of the implementation in the gateway, slight
modification in the base station, and no modification
at the clients. We implement MuVi on a WiMAX testbed
and compare its performance to a Naive wireless
multicast scheme that employs the most robust
Modulation and Coding Scheme (MCS), and an Adaptive
scheme that employs the highest MCS supportable by all
clients. Experimental results show that MuVi improves
the average video peak signal-to-noise ratio (PSNR) by
up to 13 and 7 dB compared to the Naive and the
Adaptive schemes, respectively. MuVi does not require
modification to the video encoding scheme or the air
interface. Thus, it allows speedy deployment in
existing systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:SUD,
author = "Kang Chen and Haiying Shen",
title = "{SMART}: utilizing distributed social map for
lightweight routing in delay-tolerant networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1545--1558",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2281583",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Previous delay-tolerant network (DTN) routing
algorithms exploit either past encounter records or
social network properties to derive a node's
probability of delivering packets to their
destinations. However, they only have a local view of
the network, which limits the routing efficiency. Also,
when two nodes meet, they have to exchange the delivery
abilities to the destinations of all packets in the two
nodes, which incurs high resource consumption. In this
paper, we propose SMART, which utilizes a distributed
social map for lightweight routing in delay-tolerant
networks. In SMART, each node builds its own social map
consisting of nodes it has met and their frequently
encountered nodes in a distributed manner. Based on
both encountering frequency and social closeness of the
two linked nodes in the social map, we decide the
weight of each link to reflect the packet delivery
ability between the two nodes. The social map enables
more accurate forwarder selection through a broader
view. Moreover, nodes exchange much less information
for social map update, which reduces resource
consumption. Trace-driven experiments and tests on the
GENI ORBIT testbed demonstrate the high efficiency of
SMART in comparison to previous algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2014:USM,
author = "Van Minh Nguyen and Chung Shue Chen and Laurent
Thomas",
title = "A unified stochastic model of handover measurement in
mobile networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1559--1576",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283577",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Handover measurement is responsible for finding a
handover target and directly decides the performance of
mobility management. It is governed by a complex
combination of parameters dealing with multicell
scenarios and system dynamics. A network design has to
offer an appropriate handover measurement procedure in
such a multiconstraint problem. This paper proposes a
unified framework for the network analysis and
optimization. The exposition focuses on the stochastic
modeling and addresses its key probabilistic events,
namely: (1) suitable handover target found; (2) service
failure; (3) handover measurement triggering; and (4)
handover measurement withdrawal. We derive their
closed-form expressions and provide a generalized setup
for the analysis of handover measurement failure and
target cell quality by the best signal quality and
level crossing properties. Finally, we show its
application and effectiveness in today's 3GPP-LTE
cellular networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kucera:2014:ECC,
author = "Stepan Kucera",
title = "Enabling co-channel small-cell deployments in
{SINR}-constraint networks by distributed monitoring of
normalized network capacity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1577--1590",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2280148",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose distributed algorithms for real-time
monitoring and admission control that allow base
stations in heterogeneous wireless cellular networks to
dynamically serve mobile users under the constraint of:
(1) accommodating all active transmissions in a single
shared channel; and (2) guaranteeing a minimum
signal-to-interference-plus-noise ratio (SINR) to each
served user. In particular, we develop distributed
techniques for iterative real-time computation of the
spectral radius of an unknown network matrix (often the
Perron root of the matrix) that indicates the
time-varying limits of power control stability, i.e.,
the limits of network capacity. Solely locally
available information is used as algorithmic input. By
drawing a formal analogy with the Google PageRank
algorithm, the computations are shown analytically to
be exponentially fast and sufficiently accurate for
optimal (error-free) stability detection. Numerical
simulations of an existing office building demonstrate
the applicability of the proposed algorithms to actual
UMTS W-CDMA systems characterized by discrete power
control with limited step-size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Develder:2014:JDS,
author = "Chris Develder and Jens Buysse and Bart Dhoedt and
Brigitte Jaumard",
title = "Joint dimensioning of server and network
infrastructure for resilient optical grids\slash
clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1591--1606",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283924",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the dimensioning of infrastructure,
comprising both network and server resources, for
large-scale decentralized distributed systems such as
grids or clouds. We design the resulting grid/cloud to
be resilient against network link or server failures.
To this end, we exploit relocation: Under failure
conditions, a grid job or cloud virtual machine may be
served at an alternate destination (i.e., different
from the one under failure-free conditions). We thus
consider grid/cloud requests to have a known origin,
but assume a degree of freedom as to where they end up
being served, which is the case for grid applications
of the bag-of-tasks (BoT) type or hosted virtual
machines in the cloud case. We present a generic
methodology based on integer linear programming (ILP)
that: (1) chooses a given number of sites in a given
network topology where to install server
infrastructure; and (2) determines the amount of both
network and server capacity to cater for both the
failure-free scenario and failures of links or nodes.
For the latter, we consider either failure-independent
(FID) or failure-dependent (FD) recovery. Case studies
on European-scale networks show that relocation allows
considerable reduction of the total amount of network
and server resources, especially in sparse topologies
and for higher numbers of server sites. Adopting a
failure-dependent backup routing strategy does lead to
lower resource dimensions, but only when we adopt
relocation (especially for a high number of server
sites): Without exploiting relocation, potential
savings of FD versus FID are not meaningful.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Su:2014:EAV,
author = "Sen Su and Zhongbao Zhang and Alex X. Liu and Xiang
Cheng and Yiwen Wang and Xinchao Zhao",
title = "Energy-aware virtual network embedding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1607--1620",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2286156",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Virtual network embedding, which means mapping virtual
networks requested by users to a shared substrate
network maintained by an Internet service provider, is
a key function that network virtualization needs to
provide. Prior work on virtual network embedding has
primarily focused on maximizing the revenue of the
Internet service provider and did not consider the
energy cost in accommodating such requests. As energy
cost is more than half of the operating cost of the
substrate networks, while trying to accommodate more
virtual network requests, minimizing energy cost is
critical for infrastructure providers. In this paper,
we make the first effort toward energy-aware virtual
network embedding. We first propose an energy cost
model and formulate the energy-aware virtual network
embedding problem as an integer linear programming
problem. We then propose two efficient energy-aware
virtual network embedding algorithms: a heuristic-based
algorithm and a
particle-swarm-optimization-technique-based algorithm.
We implemented our algorithms in C++ and performed
side-by-side comparison with prior algorithms. The
simulation results show that our algorithms
significantly reduce the energy cost by up to 50\% over
the existing algorithm for accommodating the same
sequence of virtual network requests.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vaze:2014:DPA,
author = "Rahul Vaze and Rachit Garg and Neetish Pathak",
title = "Dynamic power allocation for maximizing throughput in
energy-harvesting communication system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1621--1630",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2281196",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The design of online algorithms for maximizing the
achievable rate in a wireless communication channel
between a source and a destination over a fixed number
of slots is considered. The source is assumed to be
powered by a natural renewable source, and the most
general case of arbitrarily varying energy arrivals is
considered, where neither the future energy arrival
instants or amount nor their distribution is known. The
fading coefficients are also assumed to be arbitrarily
varying over time, with only causal information
available at the source. For a maximization problem,
the utility of an online algorithm is tested by finding
its competitive ratio or competitiveness that is
defined to be the maximum of the ratio of the gain of
the optimal offline algorithm and the gain of the
online algorithm over all input sequences. We show that
the lower bound on the optimal competitive ratio for
maximizing the achievable rate is arbitrarily close to
the number of slots. Conversely, we propose a simple
strategy that invests available energy uniformly over
all remaining slots until the next energy arrival, and
show that its competitive ratio is equal to the number
of slots, to conclude that it is an optimal online
algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2014:SHR,
author = "I-Hong Hou",
title = "Scheduling heterogeneous real-time traffic over fading
wireless channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1631--1644",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2280846",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop a general approach for designing scheduling
policies for real-time traffic over wireless channels.
We extend prior work, which characterizes a real-time
flow by its traffic pattern, delay bound, timely
throughput requirement, and channel reliability, to
allow clients to have different deadlines and allow a
variety of channel models. In particular, our extended
model consider scenarios where channel qualities are
time-varying, the access point may not have explicit
information on channel qualities, and the access point
may or may not employ rate adaptation. Thus, our model
allows the treatment of more realistic fading channels
as well as scenarios with mobile nodes and the usage of
more general transmission strategies. We derive a
sufficient condition for a scheduling policy to be
feasibility optimal, and thereby establish a class of
feasibility optimal policies. We demonstrate the
utility of the identified class by deriving a
feasibility optimal policy for the scenario with rate
adaptation, time-varying channels, and heterogeneous
delay bounds. When rate adaptation is not available, we
also derive feasibility optimal policies for both
scenarios where the access point may or may not have
explicit knowledge on channel qualities. For the
scenario where rate adaptation is not available but
clients have different delay bounds, we describe a
heuristic. Simulation results are also presented, which
indicate the usefulness of the scheduling policies for
more realistic and complex scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cicconetti:2014:ETD,
author = "Claudio Cicconetti and Luciano Lenzini and Andrea Lodi
and Silvano Martello and Enzo Mingozzi and Michele
Monaci",
title = "Efficient two-dimensional data allocation in {IEEE
802.16 OFDMA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1645--1658",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2282965",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In IEEE 802.16, the wireless resources are logically
partitioned into 5-ms frames, which extend in two
dimensions: time and frequency. To break down the
complexity of resource allocation at the base station,
a split approach has been proposed in the literature,
where the tasks of scheduling packets and allocating
them into frames are solved in separate and subsequent
stages. In this paper, we focus on the allocation task
alone, which is addressed in its full complexity, i.e.,
by considering that data within the frame must be
allocated as bursts with rectangular shape, each
consisting of a set of indivisible sub-bursts, and that
a variable portion of the frame is reserved for in-band
signaling. After proving that the resulting allocation
problem is NP-hard, we develop an efficient heuristic
algorithm, called Recursive Tiles and Stripes (RTS), to
solve it. RTS, in addition to handling a more general
problem, is shown to perform better than
state-of-the-art solutions via numerical analysis with
realistic system parametrization. Furthermore, an
extensive evaluation of the interaction between the
scheduler and the allocator is carried out in a wide
variety of network scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2014:VFD,
author = "Lei Zhang and Dongning Guo",
title = "Virtual full duplex wireless broadcasting via
compressed sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1659--1671",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283793",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A novel solution is proposed to undertake a frequent
task in wireless networks, which is to let all nodes
broadcast information to and receive information from
their respective one-hop neighboring nodes. The
contribution in this paper is twofold. First, as each
neighbor selects one message-bearing codeword from its
unique codebook for transmission, it is shown that
decoding their messages based on a superposition of
those codewords through the multiaccess channel is
fundamentally a problem of compressed sensing. In the
case where each message is designed to consist of a
small number of bits, an iterative algorithm based on
belief propagation is developed for efficient decoding.
Second, to satisfy the half-duplex constraint, each
codeword consists of randomly distributed on-slots and
off-slots. A node transmits during its on-slots and
listens to its neighbors only through its own
off-slots. Over one frame interval, each node
broadcasts a message to its neighbors and
simultaneously receives the superposition of neighbors'
signals through its own off-slots and then decodes all
messages. The proposed solution fully exploits the
multiaccess nature of the wireless medium and addresses
the half-duplex constraint at the fundamental level. In
a network consisting of Poisson distributed nodes,
numerical results demonstrate that the proposed scheme
often achieves several times the rate of slotted ALOHA
and CSMA with the same packet error rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2014:DRE,
author = "Hao Han and Yunxin Liu and Guobin Shen and Yongguang
Zhang and Qun Li and Chiu C. Tan",
title = "Design, realization, and evaluation of {DozyAP} for
power-efficient {Wi-Fi} tethering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1672--1685",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283636",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wi-Fi tethering (i.e., sharing the Internet connection
of a mobile phone via its Wi-Fi interface) is a useful
functionality and is widely supported on commercial
smartphones. Yet, existing Wi-Fi tethering schemes
consume excessive power: They keep the Wi-Fi interface
in a high power state regardless if there is ongoing
traffic or not. In this paper, we propose DozyAP to
improve the power efficiency of Wi-Fi tethering. Based
on measurements in typical applications, we identify
many opportunities that a tethering phone could sleep
to save power. We design a simple yet reliable sleep
protocol to coordinate the sleep schedule of the
tethering phone with its clients without requiring
tight time synchronization. Furthermore, we develop a
two-stage, sleep interval adaptation algorithm to
automatically adapt the sleep intervals to ongoing
traffic patterns of various applications. DozyAP does
not require any changes to the 802.11 protocol and is
incrementally deployable through software updates. We
have implemented DozyAP on commercial smartphones.
Experimental results show that, while retaining
comparable user experiences, our implementation can
allow the Wi-Fi interface to sleep for up to 88\% of
the total time in several different applications and
reduce the system power consumption by up to 33\% under
the restricted programmability of current Wi-Fi
hardware.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jahromizadeh:2014:JRC,
author = "Soroush Jahromizadeh and Veselin Rakocevic",
title = "Joint rate control and scheduling for providing
bounded delay with high efficiency in multihop wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "5",
pages = "1686--1698",
month = oct,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2282872",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:34 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of supporting traffic with
elastic bandwidth requirements and average end-to-end
delay constraints in multihop wireless networks, with
focus on source rates and link data rates as the key
resource allocation decisions. The network utility
maximization-based approaches to support
delay-sensitive traffic have been predominantly based
on either reducing link utilization, or approximation
of links as M/D/1 queues, which lead to inefficient
link utilization under optimal resource allocation, and
mostly to unpredictable transient behavior of packet
delays. On the contrary, we present an alternative
formulation where the delay constraint is omitted and
sources' utility functions are multiplied by a weight
factor. The alternative optimization problem is solved
by a scheduling algorithm incorporating a duality-based
rate control algorithm at its inner layer, where link
prices correlate with their average queueing delays. We
then present an alternative strategy where the utility
weight of each source is adjusted to ensure its desired
optimal path prices, and hence the desired average path
delays. Since the proposed strategy is based on solving
a concave optimization problem for the elastic traffic,
it leads to maximal utilization of the network
capacity. The proposed approach is then realized by a
scheduling algorithm that runs jointly with an integral
controller whereby each source independently regulates
the queueing delay on its paths at the desired level,
using its utility weight factor as the control
variable. The proposed algorithms are shown, using
theoretical analysis and simulation, to achieve
asymptotic regulation of end-to-end delay with good
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Patel:2014:BSE,
author = "Jignesh Patel and Alex X. Liu and Eric Torng",
title = "Bypassing space explosion in high-speed regular
expression matching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1701--1714",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2309014",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network intrusion detection and prevention systems
commonly use regular expression (RE) signatures to
represent individual security threats. While the
corresponding deterministic finite state automata (DFA)
for any one RE is typically small, the DFA that
corresponds to the entire set of REs is usually too
large to be constructed or deployed. To address this
issue, a variety of alternative automata
implementations that compress the size of the final
automaton have been proposed such as extended finite
automata (XFA) and delayed input DFA (D$^2$ FA). The
resulting final automata are typically much smaller
than the corresponding DFA. However, the previously
proposed automata construction algorithms do suffer
from some drawbacks. First, most employ a ``Union then
Minimize'' framework where the automata for each RE are
first joined before minimization occurs. This leads to
an expensive nondeterministic finite automata (NFA) to
DFA subset construction on a relatively large NFA.
Second, most construct the corresponding large DFA as
an intermediate step. In some cases, this DFA is so
large that the final automaton cannot be constructed
even though the final automaton is small enough to be
deployed. In this paper, we propose a ``Minimize then
Union'' framework for constructing compact alternative
automata focusing on the D$^2$ FA. We show that we can
construct an almost optimal final D$^2$ FA with small
intermediate parsers. The key to our approach is a
space-and time-efficient routine for merging two
compact D$^2$ FA into a compact D$^2$ FA. In our
experiments, our algorithm runs on average 155 times
faster and uses 1500 times less memory than previous
algorithms. For example, we are able to construct a
D$^2$ FA with over 80 000 000 states using only 1 GB of
main memory in only 77 min.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2014:DRA,
author = "Amy Fu and Parastoo Sadeghi and Muriel M{\'e}dard",
title = "Dynamic rate adaptation for improved throughput and
delay in wireless network coded broadcast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1715--1728",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2292613",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we provide theoretical and
simulation-based study of the delivery delay
performance of a number of existing throughput-optimal
coding schemes and use the results to design a new
dynamic rate adaptation scheme that achieves improved
overall throughput-delay performance. Under a baseline
rate control scheme, the receivers' delay performance
is examined. Based on their Markov states, the
knowledge difference between the sender and receiver,
three distinct methods for packet delivery are
identified: zero state, leader state, and
coefficient-based delivery. We provide analyses of each
of these and show that, in many cases, zero state
delivery alone presents a tractable approximation of
the expected packet delivery behavior. Interestingly,
while coefficient-based delivery has so far been
treated as a secondary effect in the literature, we
find that the choice of coefficients is extremely
important in determining the delay, and a well-chosen
encoding scheme can, in fact, contribute a significant
improvement to the delivery delay. Based on our
delivery delay model, we develop a dynamic rate
adaptation scheme that uses performance prediction
models to determine the sender transmission rate.
Surprisingly, taking this approach leads us to the
simple conclusion that the sender should regulate its
addition rate based on the total number of undelivered
packets stored at the receivers. We show that despite
its simplicity, our proposed dynamic rate adaptation
scheme results in noticeably improved throughput-delay
performance over existing schemes in the literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tapparello:2014:DCT,
author = "Cristiano Tapparello and Osvaldo Simeone and Michele
Rossi",
title = "Dynamic compression-transmission for energy-harvesting
multihop networks with correlated sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1729--1741",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283071",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Energy-harvesting wireless sensor networking is an
emerging technology with applications to various fields
such as environmental and structural health monitoring.
A distinguishing feature of wireless sensors is the
need to perform both source coding tasks, such as
measurement and compression, and transmission tasks. It
is known that the overall energy consumption for source
coding is generally comparable to that of transmission,
and that a joint design of the two classes of tasks can
lead to relevant performance gains. Moreover, the
efficiency of source coding in a sensor network can be
potentially improved via distributed techniques by
leveraging the fact that signals measured by different
nodes are correlated. In this paper, a data-gathering
protocol for multihop wireless sensor networks with
energy-harvesting capabilities is studied whereby the
sources measured by the sensors are correlated. Both
the energy consumptions of source coding and
transmission are modeled, and distributed source coding
is assumed. The problem of dynamically and jointly
optimizing the source coding and transmission
strategies is formulated for time-varying channels and
sources. The problem consists in the minimization of a
cost function of the distortions in the source
reconstructions at the sink under queue stability
constraints. By adopting perturbation-based Lyapunov
techniques, a close-to-optimal online scheme is
proposed that has an explicit and controllable tradeoff
between optimality gap and queue sizes. The role of
side information available at the sink is also
discussed under the assumption that acquiring the side
information entails an energy cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Akhoondi:2014:LLL,
author = "Masoud Akhoondi and Curtis Yu and Harsha V.
Madhyastha",
title = "{LASTor}: a low-latency {AS}-aware {Tor} client",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1742--1755",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291242",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Though the widely used Tor anonymity network is
designed to enable low-latency anonymous communication,
interactive communications on Tor incur latencies over
5 greater than on the direct Internet path, and in many
cases, autonomous systems (ASs) can compromise
anonymity via correlations of network traffic. In this
paper, we develop LASTor, a new Tor client that
addresses these shortcomings in Tor with only
client-side modifications. First, LASTor improves
communication latencies by accounting for the inferred
locations of Tor relays while choosing paths. Since the
preference for shorter paths reduces the entropy of
path selection, we design LASTor so that a user can
choose an appropriate tradeoff between latency and
anonymity. Second, we develop an efficient and accurate
algorithm to identify paths on which an AS can
compromise anonymity by traffic correlation. LASTor
avoids such paths to improve a user's anonymity, and
the low run-time of the algorithm ensures that the
impact on end-to-end communication latencies is low.
Our results show that, in comparison to the default Tor
client, LASTor reduces median latencies by 25\% while
also reducing the false negative rate of not detecting
a potential snooping AS from 57\% to 11\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kompella:2014:CCU,
author = "Sastry Kompella and Gam D. Nguyen and Clement Kam and
Jeffrey E. Wieselthier and Anthony Ephremides",
title = "Cooperation in cognitive underlay networks: stable
throughput tradeoffs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1756--1768",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2284788",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses fundamental issues in a shared
channel where the users have different priority levels.
In particular, we study a two-user cognitive shared
channel consisting of a primary (higher-priority) and a
secondary user, operating in the cognitive underlay
fashion, but in a novel way where interference suffered
by the primary user is compensated by requiring the
secondary user to cooperatively relay some of the
primary's packets. We start by analyzing the case of no
node cooperation, where nodes transmit their own
packets to their respective destinations. We then
extend the analysis to a system in which the secondary
node acts as a relay for the primary user, in addition
to serving its own packets. Specifically, in the
cognitive cooperation case, the secondary node forwards
those packets to the primary destination that it
receives successfully from the primary source. In such
cognitive shared channels, a tradeoff arises in terms
of activating the secondary along with the primary so
that both transmissions may be successful, but with a
lower probability, compared to the case of the
secondary node staying idle when the primary user
transmits. Results show the benefits of relaying for
both the primary as well as the secondary nodes in
terms of the stable-throughput region.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Orsini:2014:EIK,
author = "Chiara Orsini and Enrico Gregori and Luciano Lenzini
and Dmitri Krioukov",
title = "Evolution of the {Internet} $k$-dense structure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1769--1780",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2282756",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the Internet autonomous system (AS)-level topology
grows over time, some of its structural properties
remain unchanged. Such time-invariant properties are
generally interesting because they tend to reflect some
fundamental processes or constraints behind Internet
growth. As has been shown before, the time-invariant
structural properties of the Internet include some most
basic ones, such as the degree distribution or
clustering. Here, we add to this time-invariant list a
nontrivial property --- $k$-dense decomposition. This
property is derived from a recursive form of edge
multiplicity, defined as the number of triangles that
share a given edge. We show that after proper
normalization, the $k$-dense decomposition of the
Internet has remained stable over the last decade, even
though the Internet size has approximately doubled, and
so has the $k$-density of its $k$-densest core. This
core consists mostly of content providers peering at
Internet eXchange Points, and it only loosely overlaps
with the high-degree or high-rank AS core, consisting
mostly of tier-1 transit providers. We thus show that
high degrees and high k-densities reflect two different
Internet-specific properties of ASs (transit versus
content providers). As a consequence, even though
degrees and $k$-densities of nodes are correlated, the
relative fluctuations are strong, and related to that,
random graphs with the same degree distribution or even
degree correlations as in the Internet, do not
reproduce its $k$-dense decomposition. Therefore an
interesting open question is what Internet topology
models or generators can fully explain or at least
reproduce the $k$-dense properties of the Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:MQR,
author = "Shannon Chen and Cing-Yu Chu and Su-Ling Yeh and
Hao-Hua Chu and Polly Huang",
title = "Modeling the {QoE} of rate changes in {Skype\slash
SILK VoIP} calls",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1781--1793",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2286624",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The effective end-to-end transport of delay-sensitive
voice data has long been a problem in multimedia
networking. One of the major issues is determining the
sending rate of real-time VoIP streams such that the
user experience is maximized per unit network resource
consumed. A particularly interesting complication that
remains to be addressed is that the available bandwidth
is often dynamic. Thus, it is unclear whether a
marginal increase warrants better user experience. If a
user naively tunes the sending rate to the optimum at
any given opportunity, the user experience could
fluctuate. To investigate the effects of magnitude and
frequency of rate changes on user experience, we
recruited 127 human participants to systematically
score emulated Skype calls with different combinations
of rate changes, including varying magnitude and
frequency of rate changes. Results show that: (1) the
rate change frequency affects the user experience on a
logarithmic scale, echoing Weber-Fechner's Law; (2) the
effect of rate change magnitude depends on how users
perceive the quality difference; and (3) this study
derives a closed-form model of user perception for rate
changes for Skype calls.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stamatiou:2014:DCM,
author = "Kostas Stamatiou and Martin Haenggi",
title = "Delay characterization of multihop transmission in a
{Poisson} field of interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1794--1807",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2283338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We evaluate the end-to-end delay of a multihop
transmission scheme that includes a source, a number of
relays, and a destination, in the presence of
interferers located according to a Poisson point
process. The medium access control (MAC) protocol
considered is a combination of TDMA and ALOHA,
according to which nodes located a certain number of
hops apart are allowed to transmit with a certain
probability. Based on an independent transmissions
assumption, which decouples the queue evolutions, our
analysis provides explicit expressions for the mean
end-to-end delay and throughput, as well as scaling
laws when the interferer density grows to infinity. If
the source always has packets to transmit, we find that
full spatial reuse, i.e., ALOHA, is asymptotically
delay-optimal, but requires more hops than a TDMA-ALOHA
protocol. The results of our analysis have applications
in delay-minimizing joint MAC/routing algorithms for
networks with randomly located nodes.We simulate a
network where sources and relays form a Poisson point
process, and each source assembles a route to its
destination by selecting the relays closest to the
optimal locations. We assess both theoretically and via
simulation the sensitivity of the end-to-end delay with
respect to imperfect relay placements and route
crossings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sojoudi:2014:BDS,
author = "Somayeh Sojoudi and Steven H. Low and John C. Doyle",
title = "Buffering dynamics and stability of {Internet}
congestion controllers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1808--1818",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2287198",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many existing fluid-flow models of the Internet
congestion control algorithms make simplifying
assumptions on the effects of buffers on the data
flows. In particular, they assume that the flow rate of
a TCP flow at every link in its path is equal to the
original source rate. However, a fluid flow in practice
is modified by the queueing processes on its path, so
that an intermediate link will generally not see the
original source rate. In this paper, a more accurate
model is derived for the behavior of the network under
a congestion controller, which takes into account the
effect of buffering on output flows. It is shown how
this model can be deployed for some well-known service
disciplines such as first-in-first-out and generalized
weighted fair queueing. Based on the derived model, the
dual and primal-dual algorithms are studied under the
common pricing mechanisms, and it is shown that these
algorithms can become unstable. Sufficient conditions
are provided to guarantee the stability of the dual and
primal-dual algorithms. Finally, a new pricing
mechanism is proposed under which these congestion
control algorithms are both stable.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2014:PFD,
author = "I-Hong Hou and Piyush Gupta",
title = "Proportionally fair distributed resource allocation in
multiband wireless systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1819--1830",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2284494",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A challenging problem in multiband multicell
self-organized wireless systems, such as
femtocells/picocells in cellular networks, multichannel
Wi-Fi networks, and more recent wireless networks over
TV white spaces, is of distributed resource allocation.
This in general involves four components: channel
selection, client association, channel access, and
client scheduling. In this paper, we present a unified
framework for jointly addressing the four components
with the global system objective of maximizing the
clients throughput in a proportionally fair manner. Our
formulation allows a natural dissociation of the
problem into two subparts. We show that the first part,
involving channel access and client scheduling, is
convex and derive a distributed adaptation procedure
for achieving a Pareto-optimal solution. For the second
part, involving channel selection and client
association, we develop a Gibbs-sampler-based approach
for local adaptation to achieve the global objective,
as well as derive fast greedy algorithms from it that
achieve good solutions often.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Blough:2014:FUI,
author = "Douglas M. Blough and Paolo Santi and Ramya
Srinivasan",
title = "On the feasibility of unilateral interference
cancellation in {MIMO} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1831--1844",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2286829",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of multiple-input-multiple-output (MIMO)
feasibility refers to whether it is possible to support
specified numbers of streams allocated to the links of
an MIMO network while canceling all interference. In
unilateral interference cancellation, nodes account
only for interfering links that they have been assigned
to cancel and ignore other interfering links. We
present several different formulations of the
unilateral MIMO feasibility problem and use these
formulations to analyze the problem's complexity and
develop heuristic feasibility algorithms. We first
prove that the general unilateral feasibility problem
is NP-complete. We then identify several special cases
where the problem is solvable in polynomial time. These
include when only receiver-side interference
cancellation is performed, when all nodes have two
antenna elements, and when the maximum degree of the
network's interference graph is two. Finally, we
present several heuristic feasibility algorithms
derived from different problem formulations and
evaluate their accuracies on randomly generated MIMO
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Magistretti:2014:CAC,
author = "Eugenio Magistretti and Omer Gurewitz and Edward W.
Knightly",
title = "{802.11ec}: collision avoidance without control
messages",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1845--1858",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we design, implement, and evaluate
802.11ec (Encoded Control), an 802.11-based protocol
without control messages: Instead, 802.11ec employs
correlatable symbol sequences that, together with the
timing the codes are transmitted, encode all control
information and change the fundamental design
properties of the MAC. The use of correlatable symbol
sequences provides two key advantages: (1) efficiency,
as it permits a near order of magnitude reduction of
the control time; (2) robustness, because codes are
short and easily detectable even at low
signal-to-interference-plus-noise ratio (SINR) and even
while a neighbor is transmitting data. We implement
802.11ec on a field programmable gate array
(FPGA)-based software defined radio. We perform a large
number of experiments and show that, compared to 802.11
(with and without RTS/CTS), 802.11ec achieves a vast
efficiency gain in conveying control information and
resolves key throughput and fairness problems in the
presence of hidden terminals, asymmetric topologies,
and general multihop topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lim:2014:SMW,
author = "Sungsu Lim and Kyomin Jung and Matthew Andrews",
title = "Stability of the max-weight protocol in adversarial
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1859--1872",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288372",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the MAX-WEIGHT protocol for
routing and scheduling in wireless networks under an
adversarial model. This protocol has received a
significant amount of attention dating back to the
papers of Tassiulas and Ephremides. In particular, this
protocol is known to be throughput-optimal whenever the
traffic patterns and propagation conditions are
governed by a stationary stochastic process. However,
the standard proof of throughput optimality (which is
based on the negative drift of a quadratic potential
function) does not hold when the traffic patterns and
the edge capacity changes over time are governed by an
arbitrary adversarial process. Such an environment
appears frequently in many practical wireless scenarios
when the assumption that channel conditions are
governed by a stationary stochastic process does not
readily apply. In this paper, we prove that even in the
above adversarial setting, the MAX-WEIGHT protocol
keeps the queues in the network stable (i.e., keeps the
queue sizes bounded) whenever this is feasible by some
routing and scheduling algorithm. However, the proof is
somewhat more complex than the negative potential drift
argument that applied in the stationary case. Our proof
holds for any arbitrary interference relationships
among edges. We also prove the same stability of
\epsilon -approximate MAX-WEIGHT under the adversarial
model. We conclude the paper with a discussion of queue
sizes in the adversarial model as well as a set of
simulation results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Ayyoub:2014:TSA,
author = "Mahmoud Al-Ayyoub and Himanshu Gupta",
title = "Truthful spectrum auctions with approximate
social-welfare or revenue",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1873--1885",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288317",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cellular networks, a recent trend in research is to
make spectrum access dynamic in the spatial and
temporal dimensions for the sake of efficient
utilization of spectrum. In one such model, the
spectrum is divided into channels and periodically
allocated to competing base stations using an
auction-based market mechanism. An ``efficient''
auction mechanism is essential to the success of such a
dynamic spectrum access model. A key objective in
designing an auction mechanism is ``truthfulness.''
Combining this objective with an optimization of some
social choice function (such as the social-welfare or
the generated revenue) is highly desirable. In this
paper, we design polynomial-time spectrum auction
mechanisms that are truthful and yield an allocation
with O (1)-approximate social-welfare or revenue. Our
mechanisms generalize to general interference models.
To the best of our knowledge, ours is the first work to
design polynomial-time truthful spectrum auction
mechanisms with a constant-factor approximation of
either the expected revenue or the social-welfare. We
demonstrate the performance of our designed mechanism
through simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2014:TME,
author = "Yuanqing Zheng and Mo Li",
title = "Towards more efficient cardinality estimation for
large-scale {RFID} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1886--1896",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288352",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) cardinality
estimation with an accuracy guarantee is of practical
importance in various large-scale RFID applications.
This paper proposes a fast RFID cardinality estimation
protocol, named Zero-One Estimator (ZOE). ZOE only
requires 1-bit response from the RFID tags per
estimation round. More importantly, ZOE rapidly
converges to optimal parameter configurations and
achieves higher estimation efficiency compared to
existing protocols. ZOE guarantees arbitrary accuracy
requirement without imposing heavy computation and
memory overhead at RFID tags except the routine
operations of C1G2 standard. ZOE also provides reliable
cardinality estimation with unreliable channels due to
the robust protocol design. We prototype ZOE using the
USRP software defined radio and the Intel WISP tags. We
extensively evaluate the performance of ZOE compared to
existing protocols, which demonstrates encouraging
results in terms of estimation accuracy, time
efficiency, as well as robustness over a large range of
tag population.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2014:PPB,
author = "Changbin Liu and Ricardo Correa and Harjot Gill and
Tanveer Gill and Xiaozhou Li and Shivkumar Muthukumar
and Taher Saeed and Boon Thau Loo and Prithwish Basu",
title = "{PUMA}: policy-based unified multiradio architecture
for agile mesh networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1897--1910",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2286321",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents the design and implementation of
PUMA, a declarative constraint-solving platform for
policy-based routing and channel selection in
multiradio wireless mesh networks. In PUMA, users
formulate channel selection policies as optimization
goals and constraints that are concisely declared using
the Colog declarative language. To efficiently execute
Colog programs in a distributed setting, PUMA
integrates a high-performance constraint solver with a
declarative networking engine. We demonstrate the
capabilities of PUMA in defining distributed protocols
that cross-optimize across channel selection and
routing. We have developed a prototype of the PUMA
system that we extensively evaluated in simulations and
on the ORBIT testbed. Our experimental results
demonstrate that PUMA can flexibly and efficiently
implement a variety of centralized and distributed
channel selection protocols that result in
significantly higher throughput compared to
single-channel and identical-channel assignment
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2014:LCS,
author = "Bo Ji and Gagan R. Gupta and Xiaojun Lin and Ness B.
Shroff",
title = "Low-complexity scheduling policies for achieving
throughput and asymptotic delay optimality in
multichannel wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1911--1924",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291793",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the scheduling problem for
downlink transmission in a multichannel (e.g.,
OFDM-based) wireless network. We focus on a single
cell, with the aim of developing a unifying framework
for designing low-complexity scheduling policies that
can provide optimal performance in terms of both
throughput and delay. We develop new easy-to-verify
sufficient conditions for rate-function delay
optimality (in the many-channel many-user asymptotic
regime) and throughput optimality (in general
nonasymptotic setting), respectively. The sufficient
conditions allow us to prove rate-function delay
optimality for a class of Oldest Packets First (OPF)
policies and throughput optimality for a large class of
Maximum Weight in the Fluid limit (MWF) policies,
respectively. By exploiting the special features of our
carefully chosen sufficient conditions and
intelligently combining policies from the classes of
OPF and MWF policies, we design hybrid policies that
are both rate-function delay-optimal and
throughput-optimal with a complexity of O ( n$^{2.5}$
log n ), where n is the number of channels or users.
Our sufficient condition is also used to show that a
previously proposed policy called Delay Weighted
Matching (DWM) is rate-function delay-optimal. However,
DWM incurs a high complexity of O(n$^5$ ). Thus, our
approach yields significantly lower complexity than the
only previously designed delay and throughput-optimal
scheduling policy. We also conduct numerical
experiments to validate our theoretical results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2014:SPE,
author = "Qi Li and Mingwei Xu and Yuan Yang and Lixin Gao and
Yong Cui and Jianping Wu",
title = "Safe and practical energy-efficient detour routing in
{IP} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1925--1937",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288790",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet is generally not energy-efficient since
all network devices are running all the time and only a
small fraction of consumed power is actually related to
traffic forwarding. Existing studies try to detour
around links and nodes during traffic forwarding to
save powers for energy-efficient routing. However,
energy-efficient routing in traditional IP networks is
not well addressed. The most challenges within an
energy-efficient routing scheme in IP networks lie in
safety and practicality. The scheme should ensure
routing stability and loop-and congestion-free packet
forwarding, while not requiring modifications in the
traditional IP forwarding diagram and shortest-path
routing protocols. In this paper, we propose a novel
energy-efficient routing approach called safe and
practical energy-efficient detour routing (SPEED) for
power savings in IP networks. We provide theoretical
insight into energy-efficient routing and prove that
determining if energy-efficient routing exists is
NP-complete. We develop a heuristic in SPEED to
maximize pruned links in computing energy-efficient
routings. Extensive experimental results show that
SPEED significantly saves power consumptions without
incurring network congestions using real network
topologies and traffic matrices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Maguluri:2014:SJU,
author = "Siva Theja Maguluri and R. Srikant",
title = "Scheduling jobs with unknown duration in clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1938--1951",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288973",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a stochastic model of jobs arriving at a
cloud data center. Each job requests a certain amount
of CPU, memory, disk space, etc. Job sizes (durations)
are also modeled as random variables, with possibly
unbounded support. These jobs need to be scheduled
nonpreemptively on servers. The jobs are first routed
to one of the servers when they arrive and are queued
at the servers. Each server then chooses a set of jobs
from its queues so that it has enough resources to
serve all of them simultaneously. This problem has been
studied previously under the assumption that job sizes
are known and upper-bounded, and an algorithm was
proposed that stabilizes traffic load in a diminished
capacity region. Here, we present a load balancing and
scheduling algorithm that is throughput-optimal,
without assuming that job sizes are known or are
upper-bounded.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2014:MAP,
author = "Wei Dong and Yunhao Liu and Yuan He and Tong Zhu and
Chun Chen",
title = "Measurement and analysis on the packet delivery
performance in a large-scale sensor network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1952--1963",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2288646",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Understanding the packet delivery performance of a
wireless sensor network (WSN) is critical for improving
system performance and exploring future developments
and applications of WSN techniques. In spite of many
empirical measurements in the literature, we still lack
in-depth understanding on how and to what extent
different factors contribute to the overall packet
losses for a complete stack of protocols at large
scale. Specifically, very little is known about: (1)
when, where, and under what kind of circumstances
packet losses occur; (2) why packets are lost. As a
step toward addressing those issues, we deploy a
large-scale WSN and design a measurement system for
retrieving important system metrics. We propose MAP, a
step-by-step methodology to identify the losses,
extract system events, and perform spatial-temporal
correlation analysis by employing a carefully examined
causal graph. MAP enables us to get a closer look at
the root causes of packet losses in a low-power ad hoc
network. This study validates some earlier conjectures
on WSNs and reveals some new findings. The quantitative
results also shed lights for future large-scale WSN
deployments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dainotti:2014:ACW,
author = "Alberto Dainotti and Claudio Squarcella and Emile Aben
and Kimberly C. Claffy and Marco Chiesa and Michele
Russo and Antonio Pescap{\'e}",
title = "Analysis of country-wide {Internet} outages caused by
censorship",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1964--1977",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291244",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the first months of 2011, Internet communications
were disrupted in several North African countries in
response to civilian protests and threats of civil war.
In this paper, we analyze episodes of these disruptions
in two countries: Egypt and Libya. Our analysis relies
on multiple sources of large-scale data already
available to academic researchers: BGP interdomain
routing control plane data, unsolicited data plane
traffic to unassigned address space, active macroscopic
traceroute measurements, RIR delegation files, and
MaxMind's geolocation database. We used the latter two
data sets to determine which IP address ranges were
allocated to entities within each country, and then
mapped these IP addresses of interest to BGP-announced
address ranges (prefixes) and origin autonomous systems
(ASs) using publicly available BGP data repositories in
the US and Europe. We then analyzed observable activity
related to these sets of prefixes and ASs throughout
the censorship episodes. Using both control plane and
data plane data sets in combination allowed us to
narrow down which forms of Internet access disruption
were implemented in a given region over time. Among
other insights, we detected what we believe were
Libya's attempts to test firewall-based blocking before
they executed more aggressive BGP-based disconnection.
Our methodology could be used, and automated, to detect
outages or similar macroscopically disruptive events in
other geographic or topological regions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yao:2014:NCR,
author = "Hongyi Yao and Danilo Silva and Sidharth Jaggi and
Michael Langberg",
title = "Network codes resilient to jamming and eavesdropping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1978--1987",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2294254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of communicating information
over a network secretly and reliably in the presence of
a hidden adversary who can eavesdrop and inject
malicious errors. We provide polynomial-time
distributed network codes that are
information-theoretically rate-optimal for this
scenario, improving on the rates achievable in prior
work by Ngai et al. Ourmain contribution shows that as
long as the sum of the number of links the adversary
can jam (denoted by Z O ) and the number of links he
can eavesdrop on (denoted by ZI ) is less than the
network capacity (denoted by C ) (i.e., ZO + ZI {$<$} C
), our codes can communicate (with vanishingly small
error probability) a single bit correctly and without
leaking any information to the adversary.We then use
this scheme as a module to design codes that allow
communication at the source rate of C --- ZO when there
are no security requirements, and codes that allow
communication at the source rate of C --- ZO --- ZI
while keeping the communicated message provably secret
from the adversary. Interior nodes are oblivious to the
presence of adversaries and perform random linear
network coding; only the source and destination need to
be tweaked. We also prove that the rate-region obtained
is information-theoretically optimal. In proving our
results, we correct an error in prior work by a subset
of the authors in this paper.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2014:EDC,
author = "Shaxun Chen and Kai Zeng and Prasant Mohapatra",
title = "Efficient data capturing for network forensics in
cognitive radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1988--2000",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291832",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network forensics is an emerging interdiscipline used
to track down cyber crimes and detect network anomalies
for a multitude of applications. Efficient capture of
data is the basis of network forensics. Compared to
traditional networks, data capture faces significant
challenges in cognitive radio networks. In traditional
wireless networks, usually one monitor is assigned to
one channel for traffic capture. This approach will
incur very high cost in cognitive radio networks
because it typically has a large number of channels.
Furthermore, due to the uncertainty of the primary
user's behavior, cognitive radio devices change their
operating channels dynamically, which makes data
capturing more difficult. In this paper, we propose a
systematic method to capture data in cognitive radio
networks with a small number of monitors. We utilize
incremental support vector regression to predict packet
arrival time and intelligently switch monitors between
channels. We also propose a protocol that schedules
multiple monitors to perform channel scanning and
packet capturing in an efficient manner. Monitors are
reused in the time domain, and geographic coverage is
taken into account. The real-world experiments and
simulations show that our method is able to achieve the
packet capture rate above 70\% using a small number of
monitors, which outperforms the random scheme by
200\%-300\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dinh:2014:CEV,
author = "Thang N. Dinh and Huiyuan Zhang and Dzung T. Nguyen
and My T. Thai",
title = "Cost-effective viral marketing for time-critical
campaigns in large-scale social networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "2001--2011",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2290714",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Online social networks (OSNs) have become one of the
most effective channels for marketing and advertising.
Since users are often influenced by their friends,
``word-of-mouth'' exchanges, so-called viral marketing,
in social networks can be used to increase product
adoption or widely spread content over the network. The
common perception of viral marketing about being cheap,
easy, and massively effective makes it an ideal
replacement of traditional advertising. However, recent
studies have revealed that the propagation often fades
quickly within only few hops from the sources,
counteracting the assumption on the self-perpetuating
of influence considered in literature. With only
limited influence propagation, is massively reaching
customers via viral marketing still affordable? How do
we economically spend more resources to increase the
spreading speed? We investigate the cost-effective
massive viral marketing problem, taking into the
consideration the limited influence propagation. Both
analytical analysis based on power-law network theory
and numerical analysis demonstrate that the viral
marketing might involve costly seeding. To minimize the
seeding cost, we provide mathematical programming to
find optimal seeding for medium-size networks and
propose VirAds, an efficient algorithm, to tackle the
problem on large-scale networks. VirAds guarantees a
relative error bound of O(1) from the optimal solutions
in power-law networks and outperforms the greedy
heuristics that realizes on the degree centrality.
Moreover, we also show that, in general, approximating
the optimal seeding within a ratio better than O (log n
) is unlikely possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2014:FCP,
author = "Guanfeng Liang and Ulas C. Kozat",
title = "Fast cloud: pushing the envelope on delay performance
of cloud storage with coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "2012--2025",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2289382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Our paper presents solutions that can significantly
improve the delay performance of putting and retrieving
data in and out of cloud storage. We first focus on
measuring the delay performance of a very popular cloud
storage service Amazon S3. We establish that there is
significant randomness in service times for reading and
writing small and medium size objects when assigned
distinct keys. We further demonstrate that using
erasure coding, parallel connections to storage cloud
and limited chunking (i.e., dividing the object into a
few smaller objects) together pushes the envelope on
service time distributions significantly (e.g., 76\%,
80\%, and 85\% reductions in mean, 90th, and 99th
percentiles for 2-MB files) at the expense of
additional storage (e.g., 1.75x). However, chunking and
erasure coding increase the load and hence the queuing
delays while reducing the supportable rate region in
number of requests per second per node. Thus, in the
second part of our paper, we focus on analyzing the
delay performance when chunking, forward error
correction (FEC), and parallel connections are used
together. Based on this analysis, we develop
load-adaptive algorithms that can pick the best code
rate on a per-request basis by using offline computed
queue backlog thresholds. The solutions work with
homogeneous services with fixed object sizes, chunk
sizes, operation type (e.g., read or write) as well as
heterogeneous services with mixture of object sizes,
chunk sizes, and operation types. We also present a
simple greedy solution that opportunistically uses idle
connections and picks the erasure coding rate
accordingly on the fly. Both backlog-based and greedy
solutions support the full rate region and provide best
mean delay performance when compared to the best fixed
coding rate policy. Our evaluations show that
backlog-based solutions achieve better delay
performance at higher percentile values than the greedy
solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kriegleder:2014:CAA,
author = "Maximilian Kriegleder",
title = "A correction to algorithm {A2} in {``Asynchronous
distributed averaging on communication networks''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "2026--2027",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2292800",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Mehyar:2007:ADA}.",
abstract = "This paper discusses Algorithm A2 in ``Asynchronous
Distributed Averaging on Communication Networks'' (IEEE
Trans. Netw., vol. 15, no. 3, pp. 512-520, Jun. 2007),
which claims to solve the distributed averaging problem
provided that the parameters to the algorithm meet
certain constraints. Specifically, the states of each
node in the network are claimed to converge to the
average of the initial values associated with the nodes
under these constraints. This paper points out a flaw
in the proof of the algorithm and in addition provides
a specific example of a network, satisfying the
assumptions, for which the algorithm does not
converge.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2015:PPA,
author = "Wanchun Jiang and Fengyuan Ren and Chuang Lin",
title = "Phase plane analysis of quantized congestion
notification for data center {Ethernet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "1--14",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2292851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Currently, Ethernet is being enhanced to become the
unified switch fabric in data centers. With the unified
switch fabric, the cost on redundant devices is
reduced, while the design and management of data center
networks are simplified. Congestion management is one
of the indispensable enhancements on Ethernet, and
Quantized Congestion Notification (QCN) has just been
ratified as the formal standard. Though QCN has been
investigated for several years, there exist few
in-depth theoretical analyses on QCN. The most possible
reason is that QCN is heuristically designed and
involves the property of variable structure. The
classic linear analysis method is incapable of handling
the segmented nonlinearity of the variable structure
system. In this paper, we use the phase plane method,
which is suitable for systems of segmented
nonlinearity, to analyze the QCN system. The overall
dynamic behaviors of the QCN system are presented, and
the sufficient conditions for the stable QCN system are
deduced. These sufficient conditions serve as
guidelines toward proper parameters setting. Moreover,
we find that the stability of QCN is mainly promised by
the sliding mode motion, which is the underlying reason
for QCN's stable queue shown in numerous simulations
and experiments. Experiments on the NetFPGA platform
verify that the analytical results can explain the
complex behaviors of QCN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2015:CBS,
author = "Hongbo Jiang and Tianlong Yu and Chen Tian and Guang
Tan and Chonggang Wang",
title = "Connectivity-based segmentation in large-scale
{$2$-D\slash $3$-D} sensor networks: algorithm and
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "15--27",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2289912",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient sensor network design requires a full
understanding of the geometric environment in which
sensor nodes are deployed. In practice, a large-scale
sensor network often has a complex and irregular
topology, possibly containing obstacles/holes. Convex
network partitioning, also known as convex
segmentation, is a technique to divide a network into
convex regions in which traditional algorithms designed
for a simple network geometry can be applied. Existing
segmentation algorithms heavily depend on concave node
detection, or sink extraction from the median
axis/skeleton, resulting in sensitivity of performance
to network boundary noise. Furthermore, since they rely
on the network's 2-D geometric properties, they do not
work for 3-D cases. This paper presents a novel
segmentation approach based on Morse function, bringing
together the notions of convex components and the Reeb
graph of a network. The segmentation is realized by a
distributed and scalable algorithm, named CONSEL, for
CONnectivity-based SEgmentation in Large-scale
$2$-D\slash $3$-D sensor networks. In CONSEL, several
boundary nodes first flood the network to construct the
Reeb graph. The ordinary nodes then compute mutex pairs
locally, generating a coarse segmentation. Next,
neighboring regions that are not mutex pairs are merged
together. Finally, by ignoring mutex pairs that lead to
small concavity, we provide an approximate convex
decomposition. CONSEL has a number of advantages over
previous solutions: (1) it works for both $2$-D and
$3$-D sensor networks; (2) it uses merely network
connectivity information; (3) it guarantees a bound for
the generated regions' deviation from convexity. We
further propose to integrate network segmentation with
existing applications that are oriented to simple
network geometry. Extensive simulations show the
efficacy of CONSEL in segmenting networks and in
improving the performance of two applications:
geographic routing and connectivity-based
localization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basile:2015:AAL,
author = "Cataldo Basile and Antonio Lioy",
title = "Analysis of application-layer filtering policies with
application to {HTTP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "28--41",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2293625",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Application firewalls are increasingly used to inspect
upper-layer protocols (as HTTP) that are the target or
vehicle of several attacks and are not properly
addressed by network firewalls. Like other security
controls, application firewalls need to be carefully
configured, as errors have a significant impact on
service security and availability. However, currently
no technique is available to analyze their
configuration for correctness and consistency. This
paper extends a previous model for analysis of packet
filters to the policy anomaly analysis in application
firewalls. Both rule-pair and multirule anomalies are
detected, hence reducing the likelihood of conflicting
and suboptimal configurations. The expressiveness of
this model has been successfully tested against the
features of Squid, a popular Web-caching proxy offering
various access control capabilities. The tool
implementing this model has been tested on various
scenarios and exhibits good performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Leogrande:2015:MCP,
author = "Marco Leogrande and Fulvio Risso and Luigi Ciminiera",
title = "Modeling complex packet filters with finite state
automata",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "42--55",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2290739",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designing an efficient and scalable packet filter for
modern computer networks becomes more challenging each
day: Faster link speeds, the steady increase in the
number of encapsulation rules (e.g., tunneling), and
the necessity to precisely isolate a given subset of
traffic cause filtering expressions to become more
complex than in the past. Most current packet filtering
mechanisms cannot deal with those requirements because
their optimization algorithms either cannot scale with
the increased size of the filtering code or exploit
simple domain-specific optimizations that cannot
guarantee to operate properly in case of complex
filters. This paper presents pFSA, a new model that
transforms packet filters into finite state automata
and guarantees the optimal number of checks on the
packet, also in case of multiple filters composition,
hence enabling efficiency and scalability without
sacrificing filtering computation time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rabbachin:2015:WNI,
author = "Alberto Rabbachin and Andrea Conti and Moe Z. Win",
title = "Wireless network intrinsic secrecy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "56--69",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2297339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless secrecy is essential for communication
confidentiality, health privacy, public safety,
information superiority, and economic advantage in the
modern information society. Contemporary security
systems are based on cryptographic primitives and can
be complemented by techniques that exploit the
intrinsic properties of a wireless environment. This
paper develops a foundation for design and analysis of
wireless networks with secrecy provided by intrinsic
properties such as node spatial distribution, wireless
propagation medium, and aggregate network interference.
We further propose strategies that mitigate
eavesdropping capabilities, and we quantify their
benefits in terms of network secrecy metrics. This
research provides insights into the essence of wireless
network intrinsic secrecy and offers a new perspective
on the role of network interference in communication
confidentiality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2015:HAA,
author = "Haiying Shen and Ze Li",
title = "A hierarchical account-aided reputation management
system for {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "70--84",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2290731",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Encouraging cooperation and deterring selfish
behaviors are important for proper operations of mobile
ad hoc networks (MANETs). For this purpose, most
previous efforts rely on either reputation systems or
price systems. However, these systems are neither
sufficiently effective in providing cooperation
incentives nor sufficiently efficient in resource
consumption. Nodes in both systems can be uncooperative
while still being considered trustworthy. Also,
information exchange between mobile nodes in reputation
systems and credit circulation in price systems
consumes significant resources. This paper presents a
hierarchical Account-aided Reputation Management system
(ARM) to efficiently and effectively provide
cooperation incentives. ARM builds a hierarchical
locality-aware distributed hash table (DHT)
infrastructure for efficient and integrated operation
of both reputation and price systems. The
infrastructure helps to globally collect all node
reputation information in the system, which can be used
to calculate more accurate reputation and detect
abnormal reputation information. Also, ARM integrates
reputation and price systems by enabling higher-reputed
nodes to pay less for their received services.
Theoretical analysis demonstrates the properties of
ARM. Simulation results show that ARM outperforms the
individual reputation system and price system in terms
of effectiveness and efficiency of providing
cooperation incentives and deterring selfish
behaviors.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2015:EIE,
author = "Richard T. B. Ma and John C. S. Lui and Vishal Misra",
title = "Evolution of the {Internet} economic ecosystem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "85--98",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291852",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The evolution of the Internet has manifested itself in
many ways: the traffic characteristics, the
interconnection topologies, and the business
relationships among the autonomous components. It is
important to understand why (and how) this evolution
came about, and how the interplay of these dynamics may
affect future evolution and services. We propose a
network-aware, macroscopic model that captures the
characteristics and interactions of the application and
network providers, and show how it leads to a market
equilibrium of the ecosystem. By analyzing the driving
forces and the dynamics of the market equilibrium, we
obtain some fundamental understandings of the cause and
effect of the Internet evolution, which explain why
some historical and recent evolutions have happened.
Furthermore, by projecting the likely future
evolutions, our model can help application and network
providers to make informed business decisions so as to
succeed in this competitive ecosystem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Celik:2015:SNT,
author = "G{\"u}ner D. {\c{C}}elik and Eytan Modiano",
title = "Scheduling in networks with time-varying channels and
reconfiguration delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "99--113",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2292604",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the optimal control problem for networks
subjected to time-varying channels, reconfiguration
delays, and interference constraints. We show that the
simultaneous presence of time-varying channels and
reconfiguration delays significantly reduces the system
stability region and changes the structure of optimal
policies. We first consider memoryless channel
processes and characterize the stability region in
closed form. We prove that a frame-based Max-Weight
scheduling algorithm that sets frame durations
dynamically, as a function of the current queue lengths
and average channel gains, is throughput-optimal. Next,
we consider arbitrary Markov-modulated channel
processes and show that memory in the channel processes
can be exploited to improve the stability region. We
develop a novel approach to characterizing the
stability region of such systems using state-action
frequencies, which are stationary solutions to a Markov
Decision Process (MDP) formulation. Moreover, we
develop a dynamic control policy using the state-action
frequencies and variable frames whose lengths are
functions of queue sizes and show that it is
throughput-optimal. The frame-based dynamic control
(FBDC) policy is applicable to a broad class of network
control systems, with or without reconfiguration
delays, and provides a new framework for developing
throughput-optimal network control policies using
state-action frequencies. Finally, we propose Myopic
policies that are easy to implement and have better
delay properties as compared to the FBDC policy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2015:JSF,
author = "Reuven Cohen and Guy Grebla",
title = "Joint scheduling and fast cell selection in {OFDMA}
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "114--125",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2291295",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In modern broadband cellular networks, the
omni-directional antenna at each cell is replaced by
three or six directional antennas, one in every sector.
While every sector can run its own scheduling
algorithm, bandwidth utilization can be significantly
increased if a joint scheduler makes these decisions
for all the sectors. This gives rise to a new problem,
referred to as ``joint scheduling,'' addressed in this
paper for the first time. The problem is proven to be
NP-hard, but we propose efficient algorithms with a
worst-case performance guarantee for solving it. We
then show that the proposed algorithms indeed
substantially increase the network throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2015:TRC,
author = "Yang Yang and Ness B. Shroff",
title = "Throughput of rateless codes over broadcast erasure
channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "126--137",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2295608",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we characterize the throughput of a
broadcast network with n receivers using rateless codes
with block size $K$. We assume that the underlying
channel is a Markov modulated erasure channel that is
i.i.d. across users, but can be correlated in time. We
characterize the system throughput asymptotically in
$n$. Specifically, we explicitly show how the
throughput behaves for different values of the coding
block size $K$ as a function of $n$, as $ n \to \infty
$. For finite values of $K$ and $n$, under the more
restrictive assumption of Gilbert--Elliott erasure
channels, we are able to provide a lower bound on the
maximum achievable throughput. Using simulations, we
show the tightness of the bound with respect to system
parameters $n$ and $K$ and find that its performance is
significantly better than the previously known lower
bounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nakibly:2015:ODP,
author = "Gabi Nakibly and Reuven Cohen and Liran Katzir",
title = "Optimizing data plane resources for multipath flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "138--147",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2292895",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In many modern networks, such as datacenters, optical
networks, and multiprotocol label switching (MPLS), the
delivery of a traffic flow with a certain bandwidth
demand over a single network path is either not
possible or not cost-effective. In these cases, it is
very often possible to improve the network's bandwidth
utilization by splitting the traffic flow over multiple
efficient paths. While using multiple paths for the
same traffic flow increases the efficiency of the
network, it consumes expensive forwarding resources
from the network nodes, such as TCAM entries of
Ethernet/MPLS switches and wavelengths/lightpaths of
optical switches. In this paper, we define several
problems related to splitting a traffic flow over
multiple paths while minimizing the consumption of
forwarding resources, and present efficient algorithms
for solving these problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Checco:2015:FVN,
author = "Alessandro Checco and Douglas J. Leith",
title = "Fair virtualization of 802.11 networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "148--160",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2293501",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider virtualization of network capacity in
802.11 WLANs and mesh networks. We show that allocating
total airtime slices to ISPs is analogous to allocating
a fraction of available time-slots in TDMA. We
establish that the max-min fair flow rate allocation
within an ISP airtime slice can be characterized
independently of the rate allocation policy employed in
other slices. Building on these observations, we
present a lightweight, distributed algorithm for
allocating airtime slices among ISP and max-min fair
flow rates within each slice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Martignon:2015:ETB,
author = "Fabio Martignon and Stefano Paris and Ilario Filippini
and Lin Chen and Antonio Capone",
title = "Efficient and truthful bandwidth allocation in
wireless mesh community networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "161--174",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2296401",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Nowadays, the maintenance costs of wireless devices
represent one of the main limitations to the deployment
of wireless mesh networks (WMNs) as a means to provide
Internet access in urban and rural areas. A promising
solution to this issue is to let the WMN operator lease
its available bandwidth to a subset of customers,
forming a wireless mesh community network, in order to
increase network coverage and the number of residential
users it can serve. In this paper, we propose and
analyze an innovative marketplace to allocate the
available bandwidth of a WMN operator to those
customers who are willing to pay the higher price for
the requested bandwidth, which in turn can be subleased
to other residential users. We formulate the allocation
mechanism as a combinatorial truthful auction
considering the key features of wireless multihop
networks and further present a greedy algorithm that
finds efficient and fair allocations even for
large-scale, real scenarios while maintaining the
truthfulness property. Numerical results show that the
greedy algorithm represents an efficient, fair, and
practical alternative to the combinatorial auction
mechanism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Partov:2015:UFO,
author = "Bahar Partov and Douglas J. Leith and Rouzbeh Razavi",
title = "Utility fair optimization of antenna tilt angles in
{LTE} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "175--185",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2294965",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We formulate adaptation of antenna tilt angle as a
utility fair optimization task. This optimization
problem is nonconvex, but in this paper we show that,
under reasonable conditions, it can be reformulated as
a convex optimization. Using this insight, we develop a
lightweight method for finding the optimal antenna tilt
angles, making use of measurements that are already
available at base stations, and suited to distributed
implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2015:DPL,
author = "Jiliang Wang and Wei Dong and Zhichao Cao and Yunhao
Liu",
title = "On the delay performance in a large-scale wireless
sensor network: measurement, analysis, and
implications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "186--197",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2296331",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a comprehensive delay performance
measurement and analysis in a large-scale wireless
sensor network. We build a lightweight delay
measurement system and present a robust method to
calculate the per-packet delay. We show that the method
can identify incorrect delays and recover them with a
bounded error. Through analysis of delay and other
system metrics, we seek to answer the following
fundamental questions: What are the spatial and
temporal characteristics of delay performance in a real
network? What are the most important impacting factors,
and is there any practical model to capture those
factors? What are the implications to protocol designs?
In this paper, we identify important factors from the
data trace and show that the important factors are not
necessarily the same with those in the Internet.
Furthermore, we propose a delay model to capture those
factors. We revisit several prevalent protocol designs
such as Collection Tree Protocol, opportunistic
routing, and Dynamic Switching-based Forwarding and
show that our model and analysis are useful to
practical protocol designs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Papadopoulos:2015:NMR,
author = "Fragkiskos Papadopoulos and Constantinos Psomas and
Dmitri Krioukov",
title = "Network mapping by replaying hyperbolic growth",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "198--211",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2294052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent years have shown a promising progress in
understanding geometric underpinnings behind the
structure, function, and dynamics of many complex
networks in nature and society. However, these promises
cannot be readily fulfilled and lead to important
practical applications, without a simple, reliable, and
fast network mapping method to infer the latent
geometric coordinates of nodes in a real network. Here,
we present HyperMap, a simple method to map a given
real network to its hyperbolic space. The method
utilizes a recent geometric theory of complex networks
modeled as random geometric graphs in hyperbolic
spaces. The method replays the network's geometric
growth, estimating at each time-step the hyperbolic
coordinates of new nodes in a growing network by
maximizing the likelihood of the network snapshot in
the model. We apply HyperMap to the Autonomous Systems
(AS) Internet and find that: (1) the method produces
meaningful results, identifying soft communities of ASs
belonging to the same geographic region; (2) the method
has a remarkable predictive power: Using the resulting
map, we can predict missing links in the Internet with
high precision, outperforming popular existing methods;
and (3) the resulting map is highly navigable, meaning
that a vast majority of greedy geometric routing paths
are successful and low-stretch. Even though the method
is not without limitations, and is open for
improvement, it occupies a unique attractive position
in the space of tradeoffs between simplicity, accuracy,
and computational complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2015:DFI,
author = "Kang Chen and Haiying Shen",
title = "{DTN-FLOW}: inter-landmark data flow for
high-throughput routing in {DTNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "212--226",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2296751",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we focus on the efficient routing of
data among different areas in delay tolerant networks
(DTNs). In current algorithms, packets are forwarded
gradually through nodes with higher probability of
visiting the destination node or area. However, the
number of such nodes usually is limited, leading to
insufficient throughput performance. To solve this
problem, we propose an inter-landmark data routing
algorithm, namely DTN-FLOW. It selects popular places
that nodes visit frequently as landmarks and divides
the entire DTN area into subareas represented by
landmarks. Nodes transiting between landmarks relay
packets among landmarks, even though they rarely visit
the destinations of these packets. Specifically, the
number of node transits between two landmarks is
measured to represent the forwarding capacity between
them, based on which routing tables are built on each
landmark to guide packet routing. Each node predicts
its transits based on its previous landmark visiting
records using the order- k Markov predictor. When
routing a packet, the landmark determines the next-hop
landmark based on its routing table and forwards the
packet to the node with the highest probability of
transiting to the selected landmark. Thus, DTN-FLOW
fully utilizes all node movements to route packets
along landmark-based paths to their destinations. We
analyzed two real DTN traces to support the design of
DTN-FLOW. We deployed a small DTN-FLOW system on our
campus for performance evaluation. We also proposed
advanced extensions to improve its efficiency and
stability. The real deployment and trace-driven
simulation demonstrate the high efficiency of DTN-FLOW
in comparison to state-of-the-art DTN routing
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vissicchio:2015:IRP,
author = "Stefano Vissicchio and Luca Cittadini and Giuseppe {Di
Battista}",
title = "On {iBGP} routing policies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "227--240",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2296330",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet service providers (ISPs) run the internal
Border Gateway Protocol (iBGP) to distribute
interdomain routing information among their BGP
routers. Previous research consistently assumed that
iBGP is always configured as a mere dispatcher of
interdomain routes. However, router configuration
languages offer operators the flexibility of
fine-tuning iBGP. In this paper, we study the impact of
deploying routing policies in iBGP. First, we devise a
provably correct inference technique to pinpoint iBGP
policies from public BGP data. We show that the
majority of large transit providers and many small
transit providers do apply policies in iBGP. Then, we
discuss how iBGP policies can help achieve traffic
engineering and routing objectives. We prove that,
unfortunately, the presence of iBGP policies
exacerbates the iBGP convergence problem and
invalidates fundamental assumptions for previous
results, affecting their applicability. Hence, we
propose provably correct configuration guidelines to
achieve traffic engineering goals with iBGP policies,
without sacrificing BGP convergence guarantees.
Finally, for the cases in which our guidelines are not
applicable, we propose a novel technique to verify the
correctness of an iBGP configuration with iBGP
policies. We implement a prototype tool and show the
feasibility of offline analyses of arbitrary policies
on both real-world and in vitro configurations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shahzad:2015:FAE,
author = "Muhammad Shahzad and Alex X. Liu",
title = "Fast and accurate estimation of {RFID} tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "241--254",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2298039",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) systems have
been widely deployed for various applications such as
object tracking, 3-D positioning, supply chain
management, inventory control, and access control. This
paper concerns the fundamental problem of estimating
RFID tag population size, which is needed in many
applications such as tag identification, warehouse
monitoring, and privacy-sensitive RFID systems. In this
paper, we propose a new scheme for estimating tag
population size called Average Run-based Tag estimation
(ART). The technique is based on the average run length
of ones in the bit string received using the
standardized framed slotted Aloha protocol. ART is
significantly faster than prior schemes. For example,
given a required confidence interval of 0.1\% and a
required reliability of 99.9\%, ART is consistently 7
times faster than the fastest existing schemes (UPE and
EZB) for any tag population size. Furthermore, ART's
estimation time is provably independent of the tag
population sizes. ART works with multiple readers with
overlapping regions and can estimate sizes of
arbitrarily large tag populations. ART is easy to
deploy because it neither requires modification to tags
nor to the communication protocol between tags and
readers. ART only needs to be implemented on readers as
a software module.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lai:2015:OSA,
author = "Yuan-Cheng Lai and Ling-Yen Hsiao and Bor-Shen Lin",
title = "Optimal slot assignment for binary tracking tree
protocol in {RFID} tag identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "255--268",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2295839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Tag anti-collision has long been an important issue in
RFID systems. To accelerate tag identification, some
researchers have recently adopted bit tracking
technology that allows the reader to detect the
locations of collided bits in a collision slot.
However, these methods still encounter the problem of
too many collisions occurring at the beginning of
identification. This paper proposes an optimal binary
tracking tree protocol (OBTT) that tries to separate
all of the tags into smaller sets to reduce collisions
at the beginning of identification. Using bit tracking
technology, OBTT mainly adopts three proposed
approaches, bit estimation, optimal partition, and
binary tracking tree. Bit estimation first estimates
the number of tags based on the locations of collided
bits. Optimal partition then determines the optimal
number of the initial sets based on this estimation.
Binary tracking tree lets the tag utilize one counter
to achieve the split during the identification process.
This paper formally analyzes the slot efficiency of
OBTT, which represents how many tags can be identified
in a slot. Results show that the slot efficiency is
close to 0.614, the highest value published to date.
Considering slot lengths, OBTT further determines the
optimal number of the initial sets to minimize the
identification delay. The analytical results show that
the delay efficiency of OBTT achieves 0.750, where
delay efficiency represents the number of tags that can
be identified in a baseline slot, the length of which
is the complete ID sent by the tag. The simulation
results show that OBTT outperforms other existing
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Premkumar:2015:PFC,
author = "Karumbu Premkumar and Xiaomin Chen and Douglas J.
Leith",
title = "Proportional fair coding for wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "269--281",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2298974",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider multihop wireless networks carrying
unicast flows for multiple users. Each flow has a
specified delay deadline, and the lossy wireless links
are modeled as binary symmetric channels (BSCs). Since
transmission time, also called airtime, on the links is
shared among flows, increasing the airtime for one flow
comes at the cost of reducing the airtime available to
other flows sharing the same link. We derive the joint
allocation of flow airtimes and coding rates that
achieves the proportionally fair throughput allocation.
This utility optimization problem is nonconvex, and one
of the technical contributions of this paper is to show
that the proportional fair utility optimization can
nevertheless be decomposed into a sequence of convex
optimization problems. The solution to this sequence of
convex problems is the unique solution to the original
nonconvex optimization. Surprisingly, this solution can
be written in an explicit form that yields considerable
insight into the nature of the proportional fair joint
airtime/coding rate allocation. To our knowledge, this
is the first time that the utility fair joint
allocation of airtime/coding rate has been analyzed,
and also one of the first times that utility fairness
with delay deadlines has been considered.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Godfrey:2015:SRS,
author = "P. Brighten Godfrey and Matthew Caesar and Ian Haken
and Yaron Singer and Scott Shenker and Ion Stoica",
title = "Stabilizing route selection in {BGP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "282--299",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2299795",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Route instability is an important contributor to data
plane unreliability on the Internet and also incurs
load on the control plane of routers. In this paper, we
study how route selection schemes can avoid these
changes in routes. Modifying route selection implies a
tradeoff between stability, deviation from operators'
preferred routes, and availability of routes. We
develop algorithms to lower-bound the feasible points
in these tradeoff spaces. We also propose a new
approach, Stable Route Selection (SRS), which uses
flexibility in route selection to improve stability
without sacrificing availability and with a controlled
amount of deviation. Through large-scale simulation, a
software-router implementation, and an emulation with
real-world BGP update feeds, we demonstrate that SRS is
a promising approach to safely stabilize route
selection.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2015:BDI,
author = "Xinghua Sun and Lin Dai",
title = "Backoff design for {IEEE} 802.11 {DCF} networks:
fundamental tradeoff and design criterion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "300--316",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2295242",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Binary Exponential Backoff (BEB) is a key component of
the IEEE 802.11 DCF protocol. It has been shown that
BEB can achieve the theoretical limit of throughput as
long as the initial backoff window size is properly
selected. It, however, suffers from significant delay
degradation when the network becomes saturated. It is
thus of special interest for us to further design
backoff schemes for IEEE 802.11 DCF networks that can
achieve comparable throughput as BEB, but provide
better delay performance. This paper presents a
systematic study on the effect of backoff schemes on
throughput and delay performance of saturated IEEE
802.11 DCF networks. In particular, a backoff scheme is
defined as a sequence of backoff window sizes { W i }.
The analysis shows that a saturated IEEE 802.11 DCF
network has a single steady-state operating point as
long as { Wi } is a monotonic increasing sequence. The
maximum throughput is found to be independent of { Wi
}, yet the growth rate of { Wi } determines a
fundamental tradeoff between throughput and delay
performance. For illustration, Polynomial Backoff is
proposed, and the effect of polynomial power x on the
network performance is characterized. It is
demonstrated that Polynomial Backoff with a larger is
more robust against the fluctuation of the network
size, but in the meanwhile suffers from a larger second
moment of access delay. Quadratic Backoff (QB), i.e.,
Polynomial Backoff with x = 2 stands out to be a
favorable option as it strikes a good balance between
throughput and delay performance. The comparative study
between QB and BEB confirms that QB well preserves the
robust nature of BEB and achieves much better queueing
performance than BEB.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gozupek:2015:GTA,
author = "Didem G{\"o}z{\"u}pek and Mordechai Shalom and Fatih
Alag{\"o}z",
title = "A graph-theoretic approach to scheduling in cognitive
radio networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "317--328",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2297441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We focus on throughput-maximizing, max-min fair, and
proportionally fair scheduling problems for centralized
cognitive radio networks. First, we propose a
polynomial-time algorithm for the throughput-maximizing
scheduling problem. We then elaborate on certain
special cases of this problem and explore their
combinatorial properties. Second, we prove that the
max-min fair scheduling problem is NP-Hard in the
strong sense. We also prove that the problem cannot be
approximated within any constant factor better than 2
unless P = NP. Additionally, we propose an
approximation algorithm for the max-min fair scheduling
problem with approximation ratio depending on the ratio
of the maximum possible data rate to the minimum
possible data rate of a secondary users. We then focus
on the combinatorial properties of certain special
cases and investigate their relation with various
problems such as the multiple-knapsack, matching,
terminal assignment, and Santa Claus problems. We then
prove that the proportionally fair scheduling problem
is NP-Hard in the strong sense and inapproximable
within any additive constant less than log (4/3).
Finally, we evaluate the performance of our
approximation algorithm for the max-min fair scheduling
problem via simulations. This approach sheds light on
the complexity and combinatorial properties of these
scheduling problems, which have high practical
importance in centralized cognitive radio networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dainotti:2015:ASS,
author = "Alberto Dainotti and Alistair King and Kimberly Claffy
and Ferdinando Papale and Antonio Pescap{\'e}",
title = "Analysis of a ``/0'' stealth scan from a botnet",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "341--354",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2297678",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Botnets are the most common vehicle of cyber-criminal
activity. They are used for spamming, phishing,
denial-of-service attacks, brute-force cracking,
stealing private information, and cyber warfare.
Botnets carry out network scans for several reasons,
including searching for vulnerable machines to infect
and recruit into the botnet, probing networks for
enumeration or penetration, etc. We present the
measurement and analysis of a horizontal scan of the
entire IPv4 address space conducted by the Sality
botnet in February 2011. This 12-day scan originated
from approximately 3 million distinct IP addresses and
used a heavily coordinated and unusually covert
scanning strategy to try to discover and compromise
VoIP-related (SIP server) infrastructure. We observed
this event through the UCSD Network Telescope, a /8
darknet continuously receiving large amounts of
unsolicited traffic, and we correlate this traffic data
with other public sources of data to validate our
inferences. Sality is one of the largest botnets ever
identified by researchers. Its behavior represents
ominous advances in the evolution of modern malware:
the use of more sophisticated stealth scanning
strategies by millions of coordinated bots, targeting
critical voice communications infrastructure. This
paper offers a detailed dissection of the botnet's
scanning behavior, including general methods to
correlate, visualize, and extrapolate botnet behavior
across the global Internet",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joe-Wong:2015:OSN,
author = "Carlee Joe-Wong and Soumya Sen and Sangtae Ha",
title = "Offering supplementary network technologies: adoption
behavior and offloading benefits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "355--368",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300863",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To alleviate the congestion caused by rapid growth in
demand for mobile data, wireless service providers
(WSPs) have begun encouraging users to offload some of
their traffic onto supplementary network technologies,
e.g., offloading from 3G or 4G to WiFi or femtocells.
With the growing popularity of such offerings, a deeper
understanding of the underlying economic principles and
their impact on technology adoption is necessary. To
this end, we develop a model for user adoption of a
base technology (e.g., 3G) and a bundle of the base
plus a supplementary technology (e.g., 3G + WiFi).
Users individually make their adoption decisions based
on several factors, including the technologies'
intrinsic qualities, negative congestion externalities
from other subscribers, and the flat access rates that
a WSP charges. We then show how these user-level
decisions translate into aggregate adoption dynamics
and prove that these converge to a unique equilibrium
for a given set of exogenously determined system
parameters. We fully characterize these equilibria and
study adoption behaviors of interest to a WSP. We then
derive analytical expressions for the
revenue-maximizing prices and optimal coverage factor
for the supplementary technology and examine some
resulting nonintuitive user adoption behaviors.
Finally, we develop a mobile app to collect empirical
3G/WiFi usage data and numerically investigate the
profit-maximizing adoption levels when a WSP accounts
for its cost of deploying the supplemental technology
and savings from offloading traffic onto this
technology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tytgat:2015:AEV,
author = "Lieven Tytgat and Opher Yaron and Sofie Pollin and
Ingrid Moerman and Piet Demeester",
title = "Analysis and experimental verification of
frequency-based interference avoidance mechanisms in
{IEEE} 802.15.4",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "369--382",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "More and more wireless networks are deployed with
overlapping coverage. Especially in the unlicensed
bands, we see an increasing density of heterogeneous
solutions, with very diverse technologies and
application requirements. As a consequence,
interference from heterogeneous sources--also called
cross-technology interference--is a major problem
causing an increase of packet error rate (PER) and
decrease of quality of service (QoS), possibly leading
to application failure. This issue is apparent, for
example, when an IEEE 802.15.4 wireless sensor network
coexists with an IEEE 802.11 wireless LAN, which is the
focus of this work. One way to alleviate
cross-technology interference is to avoid it in the
frequency domain by selecting different channels.
Different multichannel protocols suitable for
frequency-domain interference avoidance have already
been proposed in the literature. However, most of these
protocols have only been investigated from the
perspective of intratechnology interference. Within
this work, we create an objective comparison of
different candidate channel selection mechanisms based
on a new multichannel protocol taxonomy using
measurements in a real-life testbed. We assess
different metrics for the most suitable mechanism using
the same set of measurements as in the comparison
study. Finally, we verify the operation of the best
channel selection metric in a proof-of-concept
implementation running on the testbed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Madhavan:2015:ACN,
author = "Mukundan Madhavan and Harish Ganapathy and Malolan
Chetlur and Shivkumar Kalyanaraman",
title = "Adapting cellular networks to whitespaces spectrum",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "383--397",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300491",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "TV Whitespaces, recently opened up by the Federal
Communications Commission (FCC) for unlicensed use, are
seen as a potential cellular offload and/or standalone
mechanism, especially in dense metros where the demand
for throughput is high. In this paper, we use real data
collected from whitespaces databases to empirically
demonstrate features unique to whitespaces--
power-spectrum tradeoff and spatial variation in
spectrum availability. From this study, we conclude the
need for whitespaces-specific adaptations to cellular
networks so as to be able to extract maximum throughput
and guarantee reliability. To tackle the effects of the
power-spectrum tradeoff, we propose a novel
base-station design that specifically uses low-power
transmitters as a means to maximize throughput. This
design co-locates and networks together many
low-powered mode-I devices to act as a multiple-antenna
array. We estimate the size of the array required to
meet typical rate targets, and show that the array
design significantly outperforms traditional designs in
terms of throughput for a given cost. We then turn our
attention to spatial variability and study its impact
on the problem of locating base stations in a
whitespaces network. Here, we propose spectrum-aware
placement algorithms for whitespaces, which account for
this spatial variability along with key parameters like
user density. We show that such algorithms clearly
outperform traditional placement algorithms and improve
network coverage in this band",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deb:2015:LBU,
author = "Supratim Deb and Pantelis Monogioudis",
title = "Learning-based uplink interference management in
{$4$G} {LTE} cellular systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "398--411",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300448",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "LTE's uplink (UL) efficiency critically depends on how
the interference across different cells is controlled.
The unique characteristics of LTE's modulation and UL
resource assignment poses considerable challenges in
achieving this goal because most LTE deployments have
1:1 frequency reuse, and the uplink interference can
vary considerably across successive time-slots. In this
paper, we propose LeAP, a measurement data-driven
machine learning paradigm for power control to manage
uplink interference in LTE. The data-driven approach
has the inherent advantage that the solution adapts
based on network traffic, propagation, and network
topology, which is increasingly heterogeneous with
multiple cell-overlays. LeAP system design consists of
the following components: (1) design of user equipment
(UE) measurement statistics that are succinct, yet
expressive enough to capture the network dynamics, and
(2) design of two learning-based algorithms that use
the reported measurements to set the power control
parameters and optimize the network performance. LeAP
is standards-compliant and can be implemented in a
centralized self-organized networking (SON) server
resource (cloud). We perform extensive evaluations
using radio network plans from a real LTE network
operational in a major metro area in the US. Our
results show that, compared to existing approaches,
LeAP provides $ 4.9 \times $ gain in the 20th
percentile of user data rate, $ 3.25 \times $ gain in
median data rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Papageorgiou:2015:DRR,
author = "George Papageorgiou and Shailendra Singh and Srikanth
V. Krishnamurthy and Ramesh Govindan and Tom {La
Porta}",
title = "A distortion-resistant routing framework for video
traffic in wireless multihop networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "412--425",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2302815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional routing metrics designed for wireless
networks are application-agnostic. In this paper, we
consider a wireless network where the application flows
consist of video traffic. From a user perspective,
reducing the level of video distortion is critical. We
ask the question ``Should the routing policies change
if the end-to-end video distortion is to be
minimized?'' Popular link-quality-based routing metrics
(such as ETX) do not account for dependence (in terms
of congestion) across the links of a path; as a result,
they can cause video flows to converge onto a few paths
and, thus, cause high video distortion. To account for
the evolution of the video frame loss process, we
construct an analytical framework to, first, understand
and, second, assess the impact of the wireless network
on video distortion. The framework allows us to
formulate a routing policy for minimizing distortion,
based on which we design a protocol for routing video
traffic. We find via simulations and testbed
experiments that our protocol is efficient in reducing
video distortion and minimizing the user experience
degradation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2015:EAP,
author = "Reuven Cohen and Guy Grebla",
title = "Efficient allocation of periodic feedback channels in
broadband wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "426--436",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2298052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Advanced wireless technologies such as
multiple-input-multiple-output (MIMO) require each
mobile station (MS) to send a lot of feedback to the
base station. This periodic feedback consumes much of
the uplink bandwidth. This expensive bandwidth is very
often viewed as a major obstacle to the deployment of
MIMO and other advanced closed-loop wireless
technologies. This paper is the first to propose a
framework for efficient allocation of periodic feedback
channels to the nodes of a wireless network. Several
relevant optimization problems are defined and
efficient algorithms for solving them are presented. A
scheme for deciding when the base station (BS) should
invoke each algorithm is also proposed and shown
through simulations to perform very well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2015:MNW,
author = "Liguang Xie and Yi Shi and Y. Thomas Hou and Wenjing
Lou and Hanif D. Sherali and Scott F. Midkiff",
title = "Multi-node wireless energy charging in sensor
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "437--450",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2303979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless energy transfer based on magnetic resonant
coupling is a promising technology to replenish energy
to a wireless sensor network (WSN). However, charging
sensor nodes one at a time poses a serious scalability
problem. Recent advances in magnetic resonant coupling
show that multiple nodes can be charged at the same
time. In this paper, we exploit this multi-node
wireless energy transfer technology and investigate
whether it is a scalable technology to address energy
issues in a WSN. We consider a wireless charging
vehicle (WCV) periodically traveling inside a WSN and
charging sensor nodes wirelessly. Based on charging
range of the WCV, we propose a cellular structure that
partitions the two-dimensional plane into adjacent
hexagonal cells. We pursue a formal optimization
framework by jointly optimizing traveling path, flow
routing, and charging time. By employing discretization
and a novel Reformulation-Linearization Technique
(RLT), we develop a provably near-optimal solution for
any desired level of accuracy. Through numerical
results, we demonstrate that our solution can indeed
address the charging scalability problem in a WSN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2015:EYJ,
author = "Chih-Chuan Cheng and Pi-Cheng Hsiu",
title = "Extend your journey: considering signal strength and
fluctuation in location-based applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "451--464",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2301171",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reducing the communication energy is essential to
facilitate the growth of emerging mobile applications.
In this paper, we introduce signal strength into
location-based applications to reduce the energy
consumption of mobile devices for data reception.
First, we model the problem of data fetch scheduling,
with the objective of minimizing the energy required to
fetch location-based information without impacting the
application's semantics adversely. To solve the
fundamental problem, we propose a dynamic-programming
algorithm and prove its optimality in terms of energy
savings. Then, we perform postoptimal analysis to
explore the tolerance of the algorithm to signal
strength fluctuations. Finally, based on the algorithm,
we consider implementation issues. We have also
developed a virtual tour system integrated with
existing Web applications to validate the
practicability of the proposed concept. The results of
experiments conducted based on real-world case studies
are very encouraging and demonstrate the applicability
of the proposed algorithm toward signal strength
fluctuations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2015:FFC,
author = "Yong Cui and Lian Wang and Xin Wang and Hongyi Wang
and Yining Wang",
title = "{FMTCP}: a fountain code-based multipath transmission
control protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "465--478",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300140",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ideally, the throughput of a Multipath TCP (MPTCP)
connection should be as high as that of multiple
disjoint single-path TCP flows. In reality, the
throughput of MPTCP is far lower than expected. In this
paper, we conduct an extensive simulation-based study
on this phenomenon, and the results indicate that a
subflow experiencing high delay and loss severely
affects the performance of other subflows, thus
becoming the bottleneck of the MPTCP connection and
significantly degrading the aggregate goodput. To
tackle this problem, we propose Fountain code-based
Multipath TCP (FMTCP), which effectively mitigates the
negative impact of the heterogeneity of different
paths. FMTCP takes advantage of the random nature of
the fountain code to flexibly transmit encoded symbols
from the same or different data blocks over different
subflows. Moreover, we design a data allocation
algorithm based on the expected packet arriving time
and decoding demand to coordinate the transmissions of
different subflows. Quantitative analyses are provided
to show the benefit of FMTCP. We also evaluate the
performance of FMTCP through ns-2 simulations and
demonstrate that FMTCP outperforms IETF-MPTCP, a
typical MPTCP approach, when the paths have diverse
loss and delay in terms of higher total goodput, lower
delay, and jitter. In addition, FMTCP achieves high
stability under abrupt changes of path quality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barghi:2015:EAA,
author = "Sanaz Barghi and Hamid Jafarkhani",
title = "Exploiting asynchronous amplify-and-forward relays to
enhance the performance of {IEEE} 802.11 networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "479--490",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300147",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cooperative communication is a promising path to
recover from performance anomaly in IEEE 802.11
networks. However, a simple solution for employing
multiple relays to enhance the relay link quality has
not been proposed. The main obstacle for multiple relay
utilization in distributed networks is that
synchronizing relay transmissions requires huge
signaling overhead. In this paper, we investigate the
problem from both a physical-layer and MAC-layer point
of view. In the physical layer, a simple, practical
solution that provides diversity gain from asynchronous
relay transmissions is introduced. In the MAC layer, a
rate adaptation algorithm, RA-ARF, that takes the extra
relay path into account is discussed, and R-MAC is
designed to utilize relays in IEEE 802.11 networks. Our
simulation results show considerable improvement in
network performance using R-MAC.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2015:ABN,
author = "Tong Ye and Tony T. Lee and Weisheng Hu",
title = "{AWG}-based non-blocking {Clos} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "491--504",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2300899",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The three-stage Clos networks remain the most popular
solution to many practical switching systems to date.
The aim of this paper is to show that the modular
structure of Clos networks is invariant with respect to
the technological changes. Due to the wavelength
routing property of arrayed-waveguide gratings (AWGs),
non-blocking and contention-free
wavelength-division-multiplexing (WDM) switches require
that two calls carried by the same wavelength must be
connected by separated links; otherwise, they must be
carried by different wavelengths. Thus, in addition to
the non-blocking condition, the challenge of the design
of AWG-based multistage switching networks is to scale
down the wavelength granularity and to reduce the
conversion range of tunable wavelength converters
(TWCs). We devise a logic scheme to partition the WDM
switch network into wavelength autonomous cells and
show that the wavelength scalability problem can be
solved by recursively reusing similar, but smaller, set
of wavelengths in different cells. Furthermore, we
prove that the rearrangeably non-blocking (RNB)
condition and route assignments in these AWG-based
three-stage networks are consistent with that of
classical Clos networks. Thus, the optimal AWG-based
non-blocking Clos networks also can achieve 100\%
utilization when all input and output wavelength
channels are busy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2015:AOT,
author = "Po-Kai Huang and Xiaojun Lin",
title = "Achieving optimal throughput utility and low delay
with {CSMA}-like algorithms: a virtual multichannel
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "505--518",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2301170",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Carrier-sense multiple access (CSMA) algorithms have
recently received significant interests in the
literature for designing wireless control algorithms.
CSMA algorithms incur low complexity and can achieve
the optimal capacity under certain assumptions.
However, CSMA algorithms suffer the starvation problem
and incur large delay that may grow exponentially with
the network size. In this paper, our goal is to develop
a new algorithm that can provably achieve high
throughput utility and low delay with low complexity.
Toward this end, we propose a new CSMA-like algorithm,
called Virtual-Multi-Channel CSMA (VMC-CSMA), that can
dramatically reduce delay. The key idea of VMC-CSMA to
avoid the starvation problem is to use multiple virtual
channels (which emulate a multichannel system) and
compute a good set of feasible schedules simultaneously
(without constantly switching/recomputing schedules).
Under the protocol interference model and a single-hop
utility-maximization setting, VMC-CSMA can approach
arbitrarily close-to-optimal system utility with both
the number of virtual channels and the computation
complexity increasing logarithmically with the network
size. Furthermore, once VMC-CSMA converges to the
steady state, we can show that under certain
assumptions on the utility functions and the topology,
both the expected packet delay and the tail
distribution of the head-of-line (HOL) waiting time at
each link can be bounded independently of the network
size. Our simulation results confirm that VMC-CSMA
algorithms indeed achieve both high throughput utility
and low delay with low-complexity operations",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xue:2015:CAD,
author = "Dongyue Xue and Robert Murawski and Eylem Ekici",
title = "Capacity achieving distributed scheduling with finite
buffers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "519--532",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2303093",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a distributed cross-layer
scheduling algorithm for wireless networks with
single-hop transmissions that can guarantee finite
buffer sizes and meet minimum utility requirements. The
algorithm can achieve a utility arbitrarily close to
the optimal value with a tradeoff in the buffer sizes.
The finite buffer property is not only important from
an implementation perspective, but, along with the
algorithm, also yields superior delay performance. In
addition, another extended algorithm is provided to
help construct the upper bounds of per-flow average
packet delays. A novel structure of Lyapunov function
is employed to prove the utility optimality of the
algorithm with the introduction of novel virtual queue
structures. Unlike traditional back-pressure-based
optimal algorithms, our proposed algorithm does not
need centralized computation and achieves fully local
implementation without global message passing. Compared
to other recent throughput/utility-optimal CSMA
distributed algorithms, we illustrate through rigorous
numerical and implementation results that our proposed
algorithm achieves far better delay performance for
comparable throughput/utility levels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kuo:2015:MSS,
author = "Tung-Wei Kuo and Kate Ching-Ju Lin and Ming-Jer Tsai",
title = "Maximizing submodular set function with connectivity
constraint: theory and application to networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "533--546",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2301816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the wireless network
deployment problem, which seeks the best deployment of
a given limited number of wireless routers. We find
that many goals for network deployment, such as
maximizing the number of covered users, the size of the
coverage area, or the total throughput of the network,
can be modeled with a submodular set function.
Specifically, given a set of routers, the goal is to
find a set of locations S, each of which is equipped
with a router, such that S maximizes a predefined
submodular set function. However, this deployment
problem is more difficult than the traditional maximum
submodular set function problem, e.g., the maximum
coverage problem, because it requires all the deployed
routers to form a connected network. In addition,
deploying a router in different locations might consume
different costs. To address these challenges, this
paper introduces two approximation algorithms, one for
homogeneous deployment cost scenarios and the other for
heterogeneous deployment cost scenarios. Our
simulations, using synthetic data and real traces of
census in Taipei, Taiwan, show that the proposed
algorithms achieve better performances than other
heuristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rossi:2015:PHM,
author = "Lorenzo Rossi and Jacob Chakareski and Pascal Frossard
and Stefania Colonnese",
title = "A {Poisson} hidden {Markov} model for multiview video
traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "547--558",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2303162",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multiview video has recently emerged as a means to
improve user experience in novel multimedia services.
We propose a new stochastic model to characterize the
traffic generated by a Multiview Video Coding (MVC)
variable bit-rate source. To this aim, we resort to a
Poisson hidden Markov model (P-HMM), in which the first
(hidden) layer represents the evolution of the video
activity and the second layer represents the frame
sizes of the multiple encoded views. We propose a
method for estimating the model parameters in long MVC
sequences. We then present extensive numerical
simulations assessing the model's ability to produce
traffic with realistic characteristics for a general
class of MVC sequences. We then extend our framework to
network applications where we show that our model is
able to accurately describe the sender and receiver
buffers behavior in MVC transmission. Finally, we
derive a model of user behavior for interactive view
selection, which, in conjunction with our
traffic-model, is able to accurately predict actual
network load in interactive multiview services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Banaei:2015:ASG,
author = "Armin Banaei and Daren B. H. Cline and Costas N.
Georghiades and Shuguang Cui",
title = "On asymptotic statistics for geometric routing schemes
in wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "559--573",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2303477",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present a methodology employing
statistical analysis and stochastic geometry to study
geometric routing schemes in wireless ad hoc networks.
In particular, we analyze the network-layer performance
of one such scheme, the random $ 1 / 2 $ disk routing
scheme, which is a localized geometric routing scheme
in which each node chooses the next relay randomly
among the nodes within its transmission range and in
the general direction of the destination. The
techniques developed in this paper enable us to
establish the asymptotic connectivity and the
convergence results for the mean and variance of the
routing path lengths generated by geometric routing
schemes in random wireless networks. In particular, we
approximate the progress of the routing path toward the
destination by a Markov process and determine the
sufficient conditions that ensure the asymptotic
connectivity for both dense and large-scale ad hoc
networks deploying the random $ 1 / 2 $ disk routing
scheme. Furthermore, using this Markov
characterization, we show that the expected length (hop
count) of the path generated by the random $ 1 / 2 $
disk routing scheme normalized by the length of the
path generated by the ideal direct-line routing,
converges to $ 3 \pi / 4 $ asymptotically. Moreover, we
show that the variance-to-mean ratio of the routing
path length converges $ 9 \pi^2 / 64 - 1 $ to
asymptotically. Through simulation, we show that the
aforementioned asymptotic statistics are in fact quite
accurate even for finite granularity and size of the
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Supittayapornpong:2015:QIM,
author = "Sucha Supittayapornpong and Michael J. Neely",
title = "Quality of information maximization for wireless
networks via a fully separable quadratic policy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "574--586",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2304293",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An information collection problem in a wireless
network with random events is considered. Wireless
devices report on each event using one of multiple
reporting formats. Each format has a different quality
and uses different data lengths. Delivering all data in
the highest-quality format can overload system
resources. The goal is to make intelligent format
selection and routing decisions to maximize
time-averaged information quality subject to network
stability. Lyapunov optimization theory can be used to
solve such a problem by repeatedly minimizing the
linear terms of a quadratic drift-plus-penalty
expression. To reduce delays, this paper proposes a
novel extension of this technique that preserves the
quadratic nature of the drift minimization while
maintaining a fully separable structure. In addition,
to avoid high queuing delay, paths are restricted to at
most 2 hops. The resulting algorithm can push average
information quality arbitrarily close to optimum, with
a tradeoff in queue backlog. The algorithm compares
favorably to the basic drift-plus-penalty scheme in
terms of backlog and delay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Picu:2015:DMF,
author = "Andreea Picu and Thrasyvoulos Spyropoulos",
title = "{DTN-meteo}: forecasting the performance of {DTN}
protocols under heterogeneous mobility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "587--602",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2301376",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic or delay-tolerant networks (DTNs) may be
used to enable communication in case of failure or lack
of infrastructure (disaster, censorship, remote areas)
and to complement existing wireless technologies
(cellular, WiFi). Wireless peers communicate when in
contact, forming an impromptu network, whose
connectivity graph is highly dynamic and only partly
connected. In this harsh environment, communication
algorithms are mostly local search heuristics, choosing
a solution among the locally available ones.
Furthermore, they are routinely evaluated through
simulations only, as they are hard to model
analytically. Even when more insight is sought from
models, these usually assume homogeneous node meeting
rates, thereby ignoring the attested heterogeneity and
nontrivial structure of human mobility. We propose
DTN-Meteo, a new unified analytical model that maps an
important class of DTN optimization problems over
heterogeneous mobility/contact models into a Markov
chain traversal over the relevant solution space.
(Heterogeneous) meeting probabilities between different
pairs of nodes dictate the chain's transition
probabilities and determine neighboring solutions.
Local optimization algorithms can accept/reject
candidate transitions (deterministically or randomly),
thus ``modulating'' the above transition probabilities.
We apply our model to two example problems: routing and
content placement. We predict the performance of
state-of-the-art algorithms (SimBet, BubbleRap) in
various real and synthetic mobility scenarios and show
that surprising precision can be achieved against
simulations, despite the complexity of the problems and
diversity of settings. To our best knowledge, this is
the first analytical work that can accurately predict
performance for utility-based algorithms and
heterogeneous node contact rates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2015:WHS,
author = "Zhenyu Wu and Zhang Xu and Haining Wang",
title = "Whispers in the hyper-space: high-bandwidth and
reliable covert channel attacks inside the cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "603--614",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2304439",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Privacy and information security in general are major
concerns that impede enterprise adaptation of shared or
public cloud computing. Specifically, the concern of
virtual machine (VM) physical co-residency stems from
the threat that hostile tenants can leverage various
forms of side channels (such as cache covert channels)
to exfiltrate sensitive information of victims on the
same physical system. However, on virtualized x86
systems, covert channel attacks have not yet proven to
be practical, and thus the threat is widely considered
a ``potential risk.'' In this paper, we present a novel
covert channel attack that is capable of high-bandwidth
and reliable data transmission in the cloud. We first
study the application of existing cache channel
