@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
techniques in a virtualized environment and uncover
their major insufficiency and difficulties. We then
overcome these obstacles by: (1) redesigning a pure
timing-based data transmission scheme, and (2)
exploiting the memory bus as a high-bandwidth covert
channel medium. We further design and implement a
robust communication protocol and demonstrate realistic
covert channel attacks on various virtualized x86
systems. Our experimental results show that covert
channels do pose serious threats to information
security in the cloud. Finally, we discuss our insights
on covert channel mitigation in virtualized
environments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2015:RBF,
author = "Chih-Ping Li and Eytan Modiano",
title = "Receiver-based flow control for networks in overload",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "616--630",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2302445",
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 utility maximization in networks where the
sources do not employ flow control and may consequently
overload the network. In the absence of flow control at
the sources, some packets will inevitably have to be
dropped when the network is in overload. To that end,
we first develop a distributed, threshold-based
packet-dropping policy that maximizes the weighted sum
throughput. Next, we consider utility maximization and
develop a receiver-based flow control scheme that, when
combined with threshold-based packet dropping, achieves
the optimal utility. The flow control scheme creates
virtual queues at the receivers as a push-back
mechanism to optimize the amount of data delivered to
the destinations via back-pressure routing. A new
feature of our scheme is that a utility function can be
assigned to a collection of flows, generalizing the
traditional approach of optimizing per-flow utilities.
Our control policies use finite-buffer queues and are
independent of arrival statistics. Their near-optimal
performance is proved and further supported by
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:2015:OCS,
author = "Bin Li and Ruogu Li and Atilla Eryilmaz",
title = "On the optimal convergence speed of wireless
scheduling for fair resource allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "631--643",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2304421",
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 study the design of joint flowrate
control and scheduling policies in multihop wireless
networks for achieving maximum network utility with
provably optimal convergence speed. Fast convergence is
especially important in wireless networks that are
dominated by the dynamics of incoming and outgoing
flows as well as the time-sensitive applications. Yet,
the design of fast converging policies in wireless
networks is complicated by: (1) the
interference-constrained communication capabilities,
and (2) the finite set of transmission rates to select
from due to operational and physical-layer constraints.
We tackle these challenges by explicitly incorporating
such discrete constraints to understand their impact on
the convergence speed at which the running average of
the received service rates and the network utility over
a finite time horizon converges to their limits. In
particular, we establish a fundamental fact that the
convergence speed of any feasible policy cannot be
faster than under both the rate and utility metrics.
Then, we develop an algorithm that achieves this
optimal convergence speed in both metrics. We also show
that the well-known dual algorithm can achieve the
optimal convergence speed in terms of its utility
value. These results reveal the interesting fact that
the convergence speed of rates and utilities in
wireless networks is dominated by the discrete choices
of scheduling and transmission rates, which also
implies that the use of higher-order flow-rate
controllers with fast convergence guarantees cannot
overcome the aforementioned fundamental limitation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2015:FSE,
author = "Qiang Liu and Xin Wang and Nageswara S. V. Rao",
title = "Fusion of state estimates over long-haul sensor
networks with random loss and delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "644--656",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2303123",
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 long-haul sensor networks, remote sensors are
deployed to cover a large geographical area, such as a
continent or the entire globe. Related applications can
be found in military surveillance, air traffic control,
greenhouse gas emission monitoring, and global cyber
attack detection, among others. In this paper, we
consider target monitoring and tracking using a
long-haul sensor network, wherein the state and
covariance estimates are sent from the sensors to a
fusion center that generates a fused state estimate.
Long-haul communications over submarine fibers and
satellite links are subject to long latencies and/or
high loss rates, which lead to lost or out-of-order
messages. These in turn may significantly degrade the
fusion performance: Fusing fewer state estimates may
compromise the accuracy of the fused state, whereas
waiting for all estimates to arrive may compromise its
timeliness. We propose an online selective linear
fusion method to fuse the state estimates based on
projected information contribution from the pending
data. Using both prediction and retrodiction
techniques, our scheme enables the fusion center to
opportunistically make decisions on when to fuse the
estimates, thereby achieving a balance between accuracy
and timeliness of the fused state. Simulation results
of a target tracking application show that our scheme
yields accurate and timely fused estimates under
variable communications delay and loss conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2015:GGL,
author = "Zhenhua Liu and Minghong Lin and Adam Wierman and
Steven Low and Lachlan L. H. Andrew",
title = "Greening geographical load balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "657--671",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2308295",
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 = "Energy expenditure has become a significant fraction
of data center operating costs. Recently,
``geographical load balancing'' has been proposed to
reduce energy cost by exploiting the electricity price
differences across regions. However, this reduction of
cost can paradoxically increase total energy use. We
explore whether the geographical diversity of
Internet-scale systems can also provide environmental
gains. Specifically, we explore whether geographical
load balancing can encourage use of ``green'' renewable
energy and reduce use of ``brown'' fossil fuel energy.
We make two contributions. First, we derive three
distributed algorithms for achieving optimal
geographical load balancing. Second, we show that if
the price of electricity is proportional to the
instantaneous fraction of the total energy that is
brown, then geographical load balancing significantly
reduces brown energy use. However, the benefits depend
strongly on dynamic energy pricing and the form of
pricing used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Riboni:2015:OSD,
author = "Daniele Riboni and Antonio Villani and Domenico Vitali
and Claudio Bettini and Luigi V. Mancini",
title = "Obfuscation of sensitive data for incremental release
of network flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "2",
pages = "672--686",
month = apr,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2309011",
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 = "Large datasets of real network flows acquired from the
Internet are an invaluable resource for the research
community. Applications include network modeling and
simulation, identification of security attacks, and
validation of research results. Unfortunately, network
flows carry extremely sensitive information, and this
discourages the publication of those datasets. Indeed,
existing techniques for network flow sanitization are
vulnerable to different kinds of attacks, and solutions
proposed for microdata anonymity cannot be directly
applied to network traces. In our previous research, we
proposed an obfuscation technique for network flows,
providing formal confidentiality guarantees under
realistic assumptions about the adversary's knowledge.
In this paper, we identify the threats posed by the
incremental release of network flows, we propose a
novel defense algorithm, and we formally prove the
achieved confidentiality guarantees. An extensive
experimental evaluation of the algorithm for
incremental obfuscation, carried out with billions of
real Internet flows, shows that our obfuscation
technique preserves the utility of flows for network
traffic analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2015:SSM,
author = "Yu Wu and Chuan Wu and Bo Li and Linquan Zhang and
Zongpeng Li and Francis C. M. Lau",
title = "Scaling social media applications into geo-distributed
clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "689--702",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2308254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Federation of geo-distributed cloud services is a
trend in cloud computing that, by spanning multiple
data centers at different geographical locations, can
provide a cloud platform with much larger capacities.
Such a geo-distributed cloud is ideal for supporting
large-scale social media applications with dynamic
contents and demands. Although promising, its
realization presents challenges on how to efficiently
store and migrate contents among different cloud sites
and how to distribute user requests to the appropriate
sites for timely responses at modest costs. These
challenges escalate when we consider the persistently
increasing contents and volatile user behaviors in a
social media application. By exploiting social
influences among users, this paper proposes efficient
proactive algorithms for dynamic, optimal scaling of a
social media application in a geo-distributed cloud.
Our key contribution is an online content migration and
request distribution algorithm with the following
features: (1) future demand prediction by novelly
characterizing social influences among the users in a
simple but effective epidemic model; (2) one-shot
optimal content migration and request distribution
based on efficient optimization algorithms to address
the predicted demand; and (3) a $ \Delta (t)$-step
look-ahead mechanism to adjust the one-shot
optimization results toward the offline optimum. We
verify the effectiveness of our online algorithm by
solid theoretical analysis, as well as thorough
comparisons to ready algorithms including the ideal
offline optimum, using large-scale experiments with
dynamic realistic settings on Amazon Elastic Compute
Cloud (EC2).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rottenstreich:2015:BPW,
author = "Ori Rottenstreich and Isaac Keslassy",
title = "The {Bloom} paradox: when not to use a {Bloom}
filter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "703--716",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2306060",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we uncover the Bloom paradox in Bloom
Filters: Sometimes, the Bloom Filter is harmful and
should not be queried. We first analyze conditions
under which the Bloom paradox occurs in a Bloom Filter
and demonstrate that it depends on the a priori
probability that a given element belongs to the
represented set. We show that the Bloom paradox also
applies to Counting Bloom Filters (CBFs) and depends on
the product of the hashed counters of each element. In
addition, we further suggest improved architectures
that deal with the Bloom paradox in Bloom Filters,
CBFs, and their variants. We further present an
application of the presented theory in cache sharing
among Web proxies. Lastly, using simulations, we verify
our theoretical results and show that our improved
schemes can lead to a large improvement in the
performance of Bloom Filters and CBFs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lenzen:2015:PES,
author = "Christoph Lenzen and Philipp Sommer and Roger
Wattenhofer",
title = "{PulseSync}: an efficient and scalable clock
synchronization protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "717--727",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2309805",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Clock synchronization is an enabling service for a
wide range of applications and protocols in both wired
and wireless networks. We study the implications of
clock drift and communication latency on the accuracy
of clock synchronization when scaling the network
diameter. Starting with a theoretical analysis of
synchronization protocols, we prove tight bounds on the
synchronization error in a model that assumes
independently and randomly distributed communication
delays and slowly changing drifts. While this model is
more optimistic than traditional worst-case analysis,
it much better captures the nature of real-world
systems such as wireless networks. The bound on the
synchronization accuracy, which is roughly the square
root of the network diameter, is achieved by the novel
PulseSync protocol. Extensive experiments demonstrate
that PulseSync is able to meet the predictions from
theory and tightly synchronizes large networks. This
contrasts against an exponential growth of the skew
incurred by the state-of-the-art protocol for wireless
sensor networks. Moreover, PulseSync adapts much faster
to network dynamics and changing clock drifts than this
protocol.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2015:BDC,
author = "I-Hong Hou",
title = "Broadcasting delay-constrained traffic over unreliable
wireless links with network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "728--740",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2304880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There is increasing demand for using wireless networks
for applications that generate packets with strict
per-packet delay constraints. In addition to delay
constraints, such applications also have various
traffic patterns and require guarantees on throughputs
of packets that are delivered within their delay
constraints. Furthermore, a mechanism for serving
delay-constrained traffic needs to specifically
consider the unreliable nature of wireless links, which
may differ from link to link. Also, as it is usually
infeasible to gather feedback information from all
clients after each transmission, broadcasting
delay-constrained traffic requires addressing the
challenge of the lack of feedback information. We study
a model that jointly considers the application
requirements on traffic patterns, delay constraints,
and throughput requirements, as well as wireless
limitations, including the unreliable wireless links
and the lack of feedback information. Based on this
model, we develop a general framework for designing
feasibility-optimal broadcasting policies that applies
to systems with various network coding mechanisms. We
demonstrate the usage of this framework by designing
policies for three different kinds of systems: one that
does not use network coding, one that employs XOR
coding, and the last that allows the usage of linear
coding.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Traverso:2015:NFS,
author = "Stefano Traverso and Luca Abeni and Robert Birke and
Csaba Kiraly and Emilio Leonardi and Renato {Lo Cigno}
and Marco Mellia",
title = "Neighborhood filtering strategies for overlay
construction in {P2P-TV} systems: design and
experimental comparison",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "741--754",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2307157",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer live-streaming (P2P-TV) systems' goal is
disseminating real-time video content using
peer-to-peer technology. Their performance is driven by
the overlay topology, i.e., the virtual topology that
peers use to exchange video chunks. Several proposals
have been made in the past to optimize it, yet few
experimental studies have corroborated results. The aim
of this paper is to provide a comprehensive
experimental comparison based on PeerStreamer in order
to benchmark different strategies for the construction
and maintenance of the overlay topology in P2P-TV
systems. We present only experimental results in which
fully distributed strategies are evaluated in both
controlled experiments and the Internet using thousands
of peers. Results confirm that the topological
properties of the overlay have a deep impact on both
user quality of experience and network load. Strategies
based solely on random peer selection are greatly
outperformed by smart yet simple and actually
implementable strategies. The most performing strategy
we devise guarantees to deliver almost all chunks to
all peers with a playout delay as low as 6s even when
system load approaches $1$, and in almost adversarial
network scenarios. PeerStreamer is open-source to make
results reproducible and allow further research by the
community.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yao:2015:UPL,
author = "Zhongmei Yao and Daren B. H. Cline and Dmitri
Loguinov",
title = "Unstructured {P2P} link lifetimes redux",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "755--767",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2306153",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We revisit link lifetimes in random P2P graphs under
dynamic node failure and create a unifying stochastic
model that generalizes the majority of previous efforts
in this direction. We not only allow nonexponential
user lifetimes and age-dependent neighbor selection,
but also cover both active and passive neighbor
management strategies, model the lifetimes of incoming
and outgoing links, derive churn-related message volume
of the system, and obtain the distribution of transient
in/out degree at each user. We then discuss the impact
of design parameters on overhead and resilience 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{Zheng:2015:EPC,
author = "Zizhan Zheng and Zhixue Lu and Prasun Sinha and
Santosh Kumar",
title = "Ensuring predictable contact opportunity for scalable
vehicular {Internet} access on the go",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "768--781",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2309991",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With increasing popularity of media-enabled hand-helds
and their integration with the in-vehicle entertainment
systems, the need for high-data-rate services for
mobile users on the go is evident. This ever-increasing
demand of data is constantly surpassing what cellular
networks can economically support. Large-scale wireless
local area networks (WLANs) can provide such a service,
but they are expensive to deploy and maintain. Open
WLAN access points, on the other hand, need no new
deployments, but can offer only opportunistic services,
lacking any performance guarantees. In contrast, a
carefully planned sparse deployment of roadside WiFi
provides an economically scalable infrastructure with
quality-of-service assurance to mobile users. In this
paper, we present a new metric, called Contact
Opportunity, to closely model the quality of data
service that a mobile user might experience when
driving through the system. We then present efficient
deployment algorithms for minimizing the cost for
ensuring a required level of contact opportunity. We
further extend this concept and the deployment
techniques to a more intuitive metric---the average
throughput---by taking various dynamic elements into
account. Simulations over a real road network and
experimental results show that our approach achieves
significantly better cost versus throughput tradeoff in
both the worst case and average case compared to some
commonly used deployment algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2015:CBR,
author = "Jihwan Kim and Hyang-Won Lee and Song Chong",
title = "{CSMA}-based robust {AP} throughput guarantee under
user distribution uncertainty",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "782--795",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2305985",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of providing
inter-access-point (AP) fairness guarantee in dense AP
deployments where starvation can occur. In particular,
we develop a framework for providing robust minimum
throughput guarantee for each AP under the uncertainty
of user distributions. Our framework consists of an AP
throughput provisioning scheme and a distributed CSMA
algorithm. The throughput provisioning scheme computes
a robust feasible minimum AP throughput vector based on
a random AP-level conflict graph and chance-constrained
optimization. By incorporating the minimum throughput
vector, we develop a distributed CSMA algorithm that
fulfills the minimum requirement for each AP and is
compatible with the IEEE 802.11 standard. We show
through extensive simulations that our framework
addresses the AP starvation problem by guaranteeing
minimum throughput for each AP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shahzad:2015:POT,
author = "Muhammad Shahzad and Alex X. Liu",
title = "Probabilistic optimal tree hopping for {RFID}
identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "796--809",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2308873",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) systems are
widely used in various applications such as supply
chain management, inventory control, and object
tracking. Identifying RFID tags in a given tag
population is the most fundamental operation in RFID
systems. While the Tree Walking (TW) protocol has
become the industrial standard for identifying RFID
tags, little is known about the mathematical nature of
this protocol, and only some ad hoc heuristics exist
for optimizing it. In this paper, first we analytically
model the TW protocol, and then using that model,
propose the Tree Hopping (TH) protocol that optimizes
TW both theoretically and practically. The key novelty
of TH is to formulate tag identification as an
optimization problem and find the optimal solution that
ensures the minimal average number of queries or
identification time as per the requirement. With this
solid theoretical underpinning, for different tag
population sizes ranging from 100 to 100 K tags, TH
significantly outperforms the best prior tag
identification protocols on the metrics of the total
number of queries per tag, the total identification
time per tag, and the average number of responses per
tag by an average of 40\%, 59\%, and 67\%,
respectively, when tag IDs are nonuniformly distributed
in the ID space, and of 50\%, 10\%, and 30\%,
respectively, when tag IDs are uniformly distributed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yao:2015:EEE,
author = "Yanjun Yao and Qing Cao and Athanasios V. Vasilakos",
title = "{EDAL}: an energy-efficient, delay-aware, and
lifetime-balancing data collection protocol for
heterogeneous wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "810--823",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2306592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Our work in this paper stems from our insight that
recent research efforts on open vehicle routing (OVR)
problems, an active area in operations research, are
based on similar assumptions and constraints compared
to sensor networks. Therefore, it may be feasible that
we could adapt these techniques in such a way that they
will provide valuable solutions to certain tricky
problems in the wireless sensor network (WSN) domain.
To demonstrate that this approach is feasible, we
develop one data collection protocol called EDAL, which
stands for Energy-efficient Delay-aware
Lifetime-balancing data collection. The algorithm
design of EDAL leverages one result from OVR to prove
that the problem formulation is inherently NP-hard.
Therefore, we proposed both a centralized heuristic to
reduce its computational overhead and a distributed
heuristic to make the algorithm scalable for
large-scale network operations. We also develop EDAL to
be closely integrated with compressive sensing, an
emerging technique that promises considerable reduction
in total traffic cost for collecting sensor readings
under loose delay bounds. Finally, we systematically
evaluate EDAL to compare its performance to related
protocols in both simulations and a hardware testbed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2015:PCG,
author = "Xia Zhou and Zengbin Zhang and Gang Wang and Xiaoxiao
Yu and Ben Y. Zhao and Haitao Zheng",
title = "Practical conflict graphs in the wild",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "824--835",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2306416",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today, most spectrum allocation algorithms use
conflict graphs to capture interference conditions. The
use of conflict graphs, however, is often questioned by
the wireless community for two reasons. First, building
accurate conflict graphs requires significant overhead,
and hence does not scale to outdoor networks. Second,
conflict graphs cannot properly capture accumulative
interference. In this paper, we use large-scale
measurement data as ground truth to understand how
severe these problems are and whether they can be
overcome. We build ``practical'' conflict graphs using
measurement-calibrated propagation models, which remove
the need for exhaustive signal measurements by
interpolating signal strengths using calibrated models.
Calibrated models are imperfect, and we study the
impact of their errors on multiple steps in the
process, from calibrating propagation models,
predicting signal strengths, to building conflict
graphs. At each step, we analyze the introduction,
propagation, and final impact of errors by comparing
each intermediate result to its ground-truth
counterpart. Our work produces several findings.
Calibrated propagation models generate
location-dependent prediction errors, ultimately
producing conservative conflict graphs. While these
``estimated conflict graphs'' lower spectrum
utilization, their conservative nature improves
reliability by reducing the impact of accumulative
interference. Finally, we propose a graph augmentation
technique to address remaining accumulative
interference.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Athanasiou:2015:OCA,
author = "George Athanasiou and Pradeep Chathuranga Weeraddana
and Carlo Fischione and Leandros Tassiulas",
title = "Optimizing client association for load balancing and
fairness in millimeter-wave wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "836--850",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2307918",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Millimeter-wave communications in the 60-GHz band are
considered one of the key technologies for enabling
multigigabit wireless access. However, the special
characteristics of such a band pose major obstacles to
the optimal utilization of the wireless resources,
where the problem of efficient client association to
access points (APs) is of vital importance. In this
paper, the client association in 60-GHz wireless access
networks is investigated. The AP utilization and the
quality of the rapidly vanishing communication links
are the control parameters. Because of the tricky
non-convex and combinatorial nature of the client
association optimization problem, a novel solution
method is developed to guarantee balanced and fair
resource allocation. A new distributed, lightweight,
and easy-to-implement association algorithm, based on
Lagrangian duality theory and subgradient methods, is
proposed. It is shown that the algorithm is
asymptotically optimal, that is, the relative duality
gap diminishes to zero as the number of clients
increases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Briat:2015:CIT,
author = "Corentin Briat and Emre Altug Yavuz and H{\aa}kan
Hjalmarsson and Karl Henrik Johansson and Ulf T.
J{\"o}nsson and Gunnar Karlsson and Henrik Sandberg",
title = "The conservation of information, towards an
axiomatized modular modeling approach to congestion
control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "851--865",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2308272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We derive a modular fluid-flow network congestion
control model based on a law of fundamental nature in
networks: the conservation of information. Network
elements such as queues, users, and transmission
channels and network performance indicators like
sending/acknowledgment rates and delays are
mathematically modeled by applying this law locally.
Our contributions are twofold. First, we introduce a
modular metamodel that is sufficiently generic to
represent any network topology. The proposed model is
composed of building blocks that implement mechanisms
ignored by the existing ones, which can be recovered
from exact reduction or approximation of this new
model. Second, we provide a novel classification of
previously proposed models in the literature and show
that they are often not capable of capturing the
transient behavior of the network precisely. Numerical
results obtained from packet-level simulations
demonstrate the accuracy of the proposed model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nistor:2015:HAP,
author = "Maricica Nistor and Daniel E. Lucani and Jo{\~a}o
Barros",
title = "Hardware abstraction and protocol optimization for
coded sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "866--879",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2310171",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The design of the communication protocols in wireless
sensor networks (WSNs) often neglects several key
characteristics of the sensor's hardware, while
assuming that the number of transmitted bits is the
dominating factor behind the system's energy
consumption. A closer look at the hardware
specifications of common sensors reveals, however, that
other equally important culprits exist, such as the
reception and processing energy. Hence, there is a need
for a more complete hardware abstraction of a sensor
node to reduce effectively the total energy consumption
of the network by designing energy-efficient protocols
that use such an abstraction, as well as mechanisms to
optimize a communication protocol in terms of energy
consumption. The problem is modeled for different
feedback-based techniques, where sensors are connected
to a base station, either directly or through relays.
We show that for four example platforms, the use of
relays may decrease up to 4.5 times the total energy
consumption when the protocol and the hardware are
carefully matched. We conclude that: (1) the energy
budget for a communication protocol varies
significantly on different sensor platforms; and (2)
the protocols can be judiciously adapted to the
underlying hardware. The results are cross-validated
using real-life measurements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2015:AOT,
author = "Bo Ji and Gagan R. Gupta and Manu Sharma and Xiaojun
Lin and Ness B. Shroff",
title = "Achieving optimal throughput and near-optimal
asymptotic delay performance in multichannel wireless
networks with low complexity: a practical greedy
scheduling policy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "880--893",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2313120",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 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 scheduling problem in
multichannel wireless networks, e.g., the downlink of a
single cell in fourth-generation (4G) OFDM-based
cellular networks. Our goal is to design practical
scheduling policies that can achieve provably good
performance in terms of both throughput and delay, at a
low complexity. While a class of $ O(n^{2.5} \log
n)$-complexity hybrid scheduling policies is recently
developed to guarantee both rate-function delay
optimality (in the many-channel many-user asymptotic
regime) and throughput optimality (in the general
non-asymptotic setting), their practical complexity is
typically high. To address this issue, we develop a
simple greedy policy called Delay-based
Server-Side-Greedy (D-SSG) with a lower complexity $
?^2 n^2 + 2 n $, and rigorously prove that D-SSG not
only achieves throughput optimality, but also
guarantees near-optimal asymptotic delay performance.
Specifically, the rate-function of the delay-violation
probability attained by D-SSG for any fixed integer
delay threshold $ b > 0 $ is no smaller than the
maximum achievable rate-function by any scheduling
policy for threshold $ b - 1 $. Thus, we are able to
achieve a reduction in complexity (from $ O(n^{2.5}
\log n) $ of the hybrid policies to $ 2 n^2 + 2 n$)
with a minimal drop in the delay performance. More
importantly, in practice, D-SSG generally has a
substantially lower complexity than the hybrid policies
that typically have a large constant factor hidden in
the $ O(\cdot)$ notation. Finally, we conduct
simulations to validate our theoretical results in
various scenarios. The simulation results show that in
all scenarios we consider, D-SSG not only guarantees a
near-optimal rate-function, but also empirically has a
similar delay performance to the rate-function
delay-optimal policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2015:FLC,
author = "Hu Jin and Bang Chul Jung and Victor C. M. Leung",
title = "Fundamental limits of {CDF}-based scheduling:
throughput, fairness, and feedback overhead",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "894--907",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2312534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate fundamental performance
limits of cumulative distribution function (CDF)-based
scheduling (CS) in downlink cellular networks. CS is
known as an efficient scheduling method that can assign
different time fractions for users or, equivalently,
satisfy different channel access ratio (CAR)
requirements of users while exploiting multiuser
diversity. We first mathematically analyze the
throughput characteristics of CS in arbitrary fading
statistics and data rate functions. It is shown that
the throughput gain of CS increases as the CAR of a
user decreases or the number of users in a cell
increases. For Nakagami-$m$ fading channels, we obtain
the average throughput in closed form and investigate
the effects of the average signal-to-noise ratio, the
shape parameter $m$, and the CAR on the throughput
performance. In addition, we propose a threshold-based
opportunistic feedback technique in order to reduce
feedback overhead while satisfying the CAR requirements
of users. We prove that the average feedback overhead
of the proposed technique is upper-bounded by $ - \ln
p$, where $p$ is the probability that no user satisfies
the threshold condition in a cell. Finally, we adopt a
novel fairness criterion, called qualitative fairness,
which considers not only the quantity of the allocated
resources to users, but also the quality of the
resources. It is observed that CS provides a better
qualitative fairness than other scheduling algorithms
designed for controlling CARs of users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Trajanovski:2015:FCR,
author = "Stojan Trajanovski and Fernando A. Kuipers and
Aleksandar Ili{\'c} and Jon Crowcroft and Piet {Van
Mieghem}",
title = "Finding critical regions and region-disjoint paths in
a network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "908--921",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2309253",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to their importance to society, communication
networks should be built and operated to withstand
failures. However, cost considerations make network
providers less inclined to take robustness measures
against failures that are unlikely to manifest, like
several failures coinciding simultaneously in different
geographic regions of their network. Considering
networks embedded in a two-dimensional plane, we study
the problem of finding a critical region---a part of
the network that can be enclosed by a given elementary
figure of predetermined size---whose destruction would
lead to the highest network disruption. We determine
that only a polynomial, in the input, number of
nontrivial positions for such a figure needs to be
considered and propose a corresponding polynomial-time
algorithm. In addition, we consider region-aware
network augmentation to decrease the impact of a
regional failure. We subsequently address the
region-disjoint paths problem, which asks for two paths
with minimum total weight between a source ($s$) and a
destination ($d$) that cannot both be cut by a single
regional failure of diameter $D$ (unless that failure
includes $s$ or $d$). We prove that deciding whether
region-disjoint paths exist is NP-hard and propose a
heuristic region-disjoint paths algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2015:LFL,
author = "Zhichao Cao and Yuan He and Qiang Ma and Yunhao Liu",
title = "{$ L^2 $}: lazy forwarding in low-duty-cycle wireless
sensor network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "922--930",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2310812",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In order to simultaneously achieve good energy
efficiency and high packet delivery performance, a
multihop forwarding scheme should generally involve
three design elements: media access mechanism, link
estimation scheme, and routing strategy. Disregarding
the low-duty-cycle nature of media access often leads
to overestimation of link quality. Neglecting the
bursty loss characteristic of wireless links inevitably
consumes much more energy than necessary and
underutilizes wireless channels. The routing strategy,
if not well tailored to the above two factors, results
in poor packet delivery performance. In this paper, we
propose $ L^2 $, a practical design of data forwarding
in low-duty-cycle wireless sensor networks. $ L^2 $
addresses link burstiness by employing multivariate
Bernoulli link model. Further incorporated with
synchronized rendezvous, $ L^2 $ enables sensor nodes
to work in a lazy mode, keep their radios off most of
the time, and realize highly reliable forwarding by
scheduling very limited packet transmissions. We
implement $ L^2 $ on a real sensor network testbed. The
results demonstrate that $ L^2 $ outperforms
state-of-the-art approaches in terms of energy
efficiency and network yield.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Georgiadis:2015:MET,
author = "Leonidas Georgiadis and Georgios S. Paschos and Lavy
Libman and Leandros Tassiulas",
title = "Minimal evacuation times and stability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "931--945",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2312271",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a system where packets (jobs) arrive for
processing using one of the policies in a given class.
We study the connection between the minimal evacuation
time and the stability region of the system and show
that evacuation time optimal policies can be used for
stabilizing the system (and for characterizing its
stability region) under broad assumptions. Conversely,
we show that while a stabilizing policy can be
suboptimal in terms of evacuation time, one can always
design a randomized version of any stabilizing policy
that achieves an optimal evacuation time in the
asymptotic regime when the number of evacuated packets
scales to infinity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2015:PPQ,
author = "Fei Chen and Bruhadeshwar Bezawada and Alex X. Liu",
title = "Privacy-preserving quantification of cross-domain
network reachability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "946--958",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2320981",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network reachability is an important characteristic
for understanding end-to-end network behavior and helps
in detecting violations of security policies across the
network. While quantifying network reachability within
one administrative domain is a difficult problem in
itself, performing the same computation across a
network spanning multiple administrative domains
presents a novel challenge. The problem of quantifying
network reachability across multiple administrative
domains is more difficult because the privacy of
security policies of individual domains is a serious
concern and needs to be protected through this process.
In this paper, we propose the first cross-domain
privacy-preserving protocol for quantifying network
reachability. Our protocol constructs equivalent
representations of the Access Control List (ACL) rules
and determines network reachability while preserving
the privacy of the individual ACLs. This protocol can
accurately determine the network reachability along a
network path through different administrative domains.
We have implemented and evaluated our protocol on both
real and synthetic ACLs. The experimental results show
that the online processing time of an ACL containing
thousands of rules is less than 25s. Given two ACLs,
each containing thousands of rules, the comparison time
is less than 6s, and the total communication cost is
less than 2100 kB.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2015:DAM,
author = "Yunbae Kim and Ganguk Hwang",
title = "Design and analysis of medium access protocol:
throughput and short-term fairness perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "959--972",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2310815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a simple MAC protocol, called the renewal
access protocol (RAP), that adopts all of the legacy
802.11 standard but the backoff stage feature. To meet
two objectives in the design of the RAP---optimal
throughput and high short-term fairness---we develop a
mathematical model of the RAP and rigorously analyze
the performance of the RAP. First, we show that the
throughput performance of the RAP depends only on the
expectation of the selection distribution where the
backoff counter is selected, provided that the number
of terminals is fixed, which is in accordance with a
well-known result. Second, with the help of renewal and
reliability theories, we analyze the short-term
fairness of the RAP. We also show that if the RAP has a
selection distribution of the New Better than Used in
Expectation (NBUE) type, the RAP can guarantee high
short-term fairness. Third, we construct a special
binomial distribution that is obviously of the NBUE
type that can achieve high short-term fairness as well
as optimal throughput when used as the selection
distribution of the RAP. Furthermore, by the Poisson
approximation for binomial distributions, we propose to
use in practice a Poisson distribution corresponding to
the special binomial distribution. Numerical and
simulation results are provided to validate our
analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mokhtarian:2015:MDM,
author = "Kianoosh Mokhtarian and Hans-Arno Jacobsen",
title = "Minimum-delay multicast algorithms for mesh overlays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "973--986",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2310735",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study delivering delay-sensitive data to a group of
receivers with minimum latency. This latency consists
of the time that the data spends in overlay links as
well as the delay incurred at each overlay node, which
has to send out a piece of data several times over a
finite-capacity network connection. The latter part is
a significant portion of the total delay as we show in
the paper, yet it is often ignored or only partially
addressed by previous multicast algorithms. We analyze
the actual delay in multicast trees and consider
building trees with minimum-average and minimum-maximum
delay. We show the NP-hardness of these problems and
prove that they cannot be approximated in polynomial
time to within any reasonable approximation ratio. We
then present a set of algorithms to build minimum-delay
multicast trees that cover a wide range of application
requirements---min-average and min-max delay, for
different scales, real-time requirements, and session
characteristics. We conduct comprehensive experiments
on different real-world datasets, using various overlay
network models. The results confirm that our algorithms
can achieve much lower delays (up to 60\% less) and up
to orders-of-magnitude faster running times (i.e.,
supporting larger scales) than previous related
approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2015:SNA,
author = "Haiying Shen and Yuhua Lin and Jin Li",
title = "A social-network-aided efficient peer-to-peer live
streaming system",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "987--1000",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2311431",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In current peer-to-peer (P2P) live streaming systems,
nodes in a channel form a P2P overlay for video
sharing. To watch a new channel, a node depends on the
centralized server to join in the overlay of the
channel. In today's live streaming applications, the
increase in the number of channels triggers users'
desire of watching multiple channels successively or
simultaneously. However, the support of such watching
modes in current applications is no better than joining
in different channel overlays successively or
simultaneously through the centralized server, which if
widely used, poses a heavy burden on the server. In
order to achieve higher efficiency and scalability, we
propose a Social-network-Aided efficient liVe strEaming
system (SAVE). SAVE regards users' channel switching or
multichannel watching as interactions between channels.
By collecting the information of channel interactions,
nodes' interests, and watching times, SAVE forms nodes
in multiple channels with frequent interactions into an
overlay, constructs bridges between overlays of
channels with less frequent interactions, and enables
nodes to identify friends sharing similar interests and
watching times. Thus, a node can connect to a new
channel while staying in its current overlay, using
bridges or relying on its friends, reducing the need to
contact the centralized server. We further propose the
channel-closeness-based chunk-pushing strategy and
capacity-based chunk provider selection strategy to
enhance the system performance. Extensive experimental
results from the PeerSim simulator and PlanetLab verify
that SAVE outperforms other systems in system
efficiency and server load reduction, as well as the
effectiveness of the two proposed strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dinh:2015:NUJ,
author = "Thang N. Dinh and My T. Thai",
title = "Network under joint node and link attacks:
vulnerability assessment methods and analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "1001--1011",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2317486",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Critical infrastructures such as communication
networks, electrical grids, and transportation systems
are highly vulnerable to natural disasters and
malicious attacks. Even failures of few nodes or links
may have a profound impact on large parts of the
system. Traditionally, network vulnerability assessment
methods separate the studies of node vulnerability and
link vulnerability, and thus ignore joint node and link
attack schemes that may cause grave damage to the
network. To this end, we introduce a new assessment
method, called \beta -disruptor, that unifies both link
and node vulnerability assessment. The new assessment
method is formulated as an optimization problem in
which we aim to identify a minimum-cost set of mixed
links and nodes whose removal would severely disrupt
the network connectivity. We prove the NP-completeness
of the problem and propose an $ O(\sqrt {\log n}) $
bicriteria approximation algorithm for the $ \beta
$-disruptor problem. This new theoretical guarantee
improves the best approximation results for both link
and node vulnerability assessment in literature. We
further enhance the proposed algorithm by embedding it
into a special combination of simulated annealing and
variable neighborhood search method. The results of our
extensive simulation-based experiments on synthetic and
real networks show the feasibility and efficiency of
our proposed vulnerability assessment methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jarray:2015:DAV,
author = "Abdallah Jarray and Ahmed Karmouch",
title = "Decomposition approaches for virtual network embedding
with one-shot node and link mapping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "3",
pages = "1012--1025",
month = jun,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2312928",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 14 16:10:54 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network virtualization is a promising new resource
management approach that allows customized virtual
networks (VNs) to be multiplexed on a shared physical
infrastructure. In this paper, our focus is on the
embedding of VN resources onto this infrastructure.
Since this problem is known to be NP-hard, embedding
proposals in literature are heuristic-based approaches
that restrict the problem space in different
dimensions. Limitations of these proposals are: (1) as
embedding of VN links and nodes is performed in two
separate stages, it may ensue in a high blocking of VN
requests and a less efficient usage of substrate
resources; and (2) as pricing of embedding resources is
based on linear functions, it triggers no competition
among VN users in order to maximize infrastructure
provider profits. These drawbacks motivate us to
propose a mathematical model that makes use of
large-scale optimization tools and proposes a Column
Generation (CG) formulation of the problem, coupled
with branch-and-bound technique or rounding-off
heuristic. We also propose a periodical planning of
embedding process where profitable VN requests are
selected through an auction mechanism. In our
experiments with different substrate network topologies
and many different VN request patterns, we show a clear
advantage of auction-based CG models over present
benchmarks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Maddah-Ali:2015:DCC,
author = "Mohammad Ali Maddah-Ali and Urs Niesen",
title = "Decentralized coded caching attains order-optimal
memory-rate tradeoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1029--1040",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2317316",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Replicating or caching popular content in memories
distributed across the network is a technique to reduce
peak network loads. Conventionally, the main
performance gain of this caching was thought to result
from making part of the requested data available closer
to end-users. Instead, we recently showed that a much
more significant gain can be achieved by using caches
to create coded-multicasting opportunities, even for
users with different demands, through coding across
data streams. These coded-multicasting opportunities
are enabled by careful content overlap at the various
caches in the network, created by a central
coordinating server. In many scenarios, such a central
coordinating server may not be available, raising the
question if this multicasting gain can still be
achieved in a more decentralized setting. In this
paper, we propose an efficient caching scheme, in which
the content placement is performed in a decentralized
manner. In other words, no coordination is required for
the content placement. Despite this lack of
coordination, the proposed scheme is nevertheless able
to create coded-multicasting opportunities and achieves
a rate close to the optimal centralized scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2015:AEE,
author = "Kai Han and Jun Luo and Liu Xiang and Mingjun Xiao and
Liusheng Huang",
title = "Achieving energy efficiency and reliability for data
dissemination in duty-cycled {WSNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1041--1052",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2312973",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Because data dissemination is crucial to wireless
sensor networks (WSNs), its energy efficiency and
reliability are of paramount importance. While
achieving these two goals together is highly
nontrivial, the situation is exacerbated if WSN nodes
are duty-cycled (DC) and their transmission power is
adjustable. In this paper, we study the problem of
minimizing the expected total transmission power for
reliable data dissemination (multicast/broadcast) in
DC-WSNs. Due to the NP-hardness of the problem, we
design efficient approximation algorithms with provable
performance bounds for it. To facilitate our algorithm
design, we propose the novel concept of
Time-Reliability-Power (TRP) space as a general data
structure for designing data dissemination algorithms
in WSNs, and the performance ratios of our algorithms
based on the TRP space are proven to be $ O(\log \Delta
\log k) $ for both multicast and broadcast, where $
\Delta $ is the maximum node degree in the network and
$k$ is the number of source/destination nodes involved
in a data dissemination session. We also conduct
extensive simulations to firmly demonstrate the
efficiency of our algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2015:TDR,
author = "Qingkai Liang and Xinbing Wang and Xiaohua Tian and
Fan Wu and Qian Zhang",
title = "Two-dimensional route switching in cognitive radio
networks: a game-theoretical framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1053--1066",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2315194",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cognitive radio networks (CRNs), secondary users
(SUs) can flexibly access primary users' (PUs') idle
spectrum bands, but such spectrum opportunities are
dynamic due to PUs' uncertain activity patterns. In a
multihop CRN consisting of SUs as relays, such spectrum
dynamics will further cause the invalidity of
predetermined routes. In this paper, we investigate
spectrum-mobility-incurred route-switching problems in
both spatial and frequency domains for CRNs, where
spatial switching determines which relays and links
should be reselected and frequency switching decides
which channels ought to be reassigned to the spatial
routes. The proposed route-switching scheme not only
avoids conflicts with PUs but also mitigates spectrum
congestion. Meanwhile, tradeoffs between routing costs
and channel switching costs are achieved. We further
formulate the route-switching problem as the
Route-Switching Game, which is shown to be a potential
game and has a pure Nash equilibrium (NE). Accordingly,
efficient algorithms for finding the NE and the $
\epsilon $-NE are proposed. Then, we extend the
proposed game to the incomplete-information scenario
and provide a method to compute the Bayesian NE.
Finally, we prove that the price of anarchy of the
proposed game has a deterministic upper bound.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khanafer:2015:RBP,
author = "Ali Khanafer and Murali Kodialam and Krishna P. N.
Puttaswamy",
title = "To rent or to buy in the presence of statistical
information: the constrained ski-rental problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1067--1077",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2326988",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cloud service providers enable tenants to elastically
scale resources to meet their demands. While running
cloud applications, a tenant aiming to minimize cost is
often challenged with crucial tradeoffs. For instance,
upon each arrival of a query, a Web application can
either choose to pay for CPU to compute the response
fresh, or pay for cache storage to store the response
to reduce future compute costs. The Ski-Rental problem
abstracts such scenarios where a tenant is faced with a
to-rent-or-to-buy tradeoff; in its basic form, a skier
should choose between renting or buying a set of skis
without knowing the number of days she will be skiing.
In the multislope version of the Ski-Rental problem,
the skier can choose among multiple services that
differ in their buying and renting prices. In this
paper, we introduce a variant of the classical
Ski-Rental problem in which we assume that the skier
knows the first (or second) moment of the distribution
of the number of ski days in a season. We also extend
the classical multislope Ski-Rental problem, where the
skier can choose among multiple services, to this
setting. We demonstrate that utilizing this information
leads to achieving the best worst-case expected
competitive ratio performance. Our method yields a new
class of randomized algorithms that provide
arrivals-distribution-free performance guarantees.
Simulations illustrate that our scheme exhibits robust
average-cost performance that combines the best of the
well-known deterministic and randomized schemes
previously proposed to tackle the Ski-Rental problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khabbazian:2015:BIW,
author = "Majid Khabbazian and Stephane Durocher and Alireza
Haghnegahdar and Fabian Kuhn",
title = "Bounding interference in wireless ad hoc networks with
nodes in random position",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1078--1091",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2313627",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Given a set of positions for wireless nodes, the
interference minimization problem is to assign a
transmission radius (i.e., a power level) to each node
such that the resulting communication graph is
connected while minimizing the maximum (respectively,
average) interference. We consider the model introduced
by von Rickenbach et al. (2005), in which each wireless
node is represented by a point in Euclidean space on
which is centered a transmission range represented by a
ball, and edges in the corresponding graph are
symmetric. The problem is NP-complete in two or more
dimensions (Buchin 2008), and no polynomial-time
approximation algorithm is known. We show how to solve
the problem efficiently in settings typical for
wireless ad hoc networks. If nodes are represented by a
set P of n points selected uniformly and independently
at random over a d -dimensional rectangular region,
then the topology given by the closure of the Euclidean
minimum spanning tree of P has O (log n ) maximum
interference with high probability and O (1) expected
interference. We extend the first bound to a general
class of communication graphs over a broad set of
probability distributions. We present a local algorithm
that constructs a graph from this class; this is the
first local algorithm to provide an upper bound on
expected maximum interference. Finally, we disprove a
conjecture of Devroye and Morin (2012) relating the
maximum interference of the Euclidean minimum spanning
tree to the optimal maximum interference attainable.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Caleffi:2015:SST,
author = "Marcello Caleffi and Ian F. Akyildiz and Luigi Paura",
title = "On the solution of the {Steiner} tree {NP}-hard
problem via \bioname{Physarum} {BioNetwork}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1092--1106",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2317911",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the last several years, many algorithms trying to
mimic biological processes have been proposed to
enhance the performance of communication networks.
However, the bio-inspired algorithms represent only the
very first step toward the design of a smart adaptive
communication network since: (1) they model only a
limited set of the rules underlying the biological
processes, thus, omitting fundamental functionalities;
(2) they are executed on traditional computer
architectures, thus, failing to achieve the intrinsic
parallelism exhibited by biological processes. To
overcome these issues, in this paper, the BioNetwork
paradigm is proposed, a novel communication network
paradigm in which the traditional network nodes are
replaced by living organisms. The BioNetwork paradigm
provides very attractive features over traditional
network paradigms, such as efficiency, adaptivity,
reliability, self-organization, and scalability.
Moreover, it has a huge potential since it can be
adopted in many different applications, such as health
and military ones. In the paper, this potential is
shown by proving that a BioNetwork can solve one of the
most fundamental NP-hard problems in networks, i.e.,
the Steiner tree problem. To this aim, a BioNetwork
constituted by a unicellular organism, the
\bioname{Physarum polycephalum} slime mold, is
designed. Throughout the paper, it is proven that a
\bioname{Physarum} BioNetwork can solve the Steiner
tree problem with an exponential convergence rate
toward the optimal solution. The theoretical solutions
are validated 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{Widmer:2015:EIN,
author = "Joerg Widmer and Andrea Capalbo and Antonio
Fern{\'a}ndez Anta and Albert Banchs",
title = "Efficient interlayer network codes for fair layered
multicast streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1107--1120",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2326523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multilayer video streaming allows to provide different
video qualities to a group of multicast receivers with
heterogeneous receive rates. The number of layers
received (and thus the receive rate) determines the
quality of the decoded video stream. For such layered
multicast streaming, network coding provides higher
capacity than multicast routing. Network coding can be
performed within a layer or across layers, and in
general, interlayer coding outperforms intralayer
coding. An optimal solution to a network-coded layered
multicast problem may require decoding of the network
code at interior nodes to extract information to be
forwarded. However, decoding consumes resources and
introduces delay, which is particularly undesirable at
interior nodes (the routers) of the network. In this
paper, we thus focus on the interlayer network coding
problem without decoding at interior nodes. We show
that the problem is NP-hard and propose a heuristic
algorithm for rate allocation and coding based on the
Edmonds--Karp maximum flow algorithm. We prove that our
algorithm ensures decodability of the information
received and provides some fairness properties.
Finally, we perform extensive simulations and show that
our algorithm may even outperform other heuristics that
do require decoding at interior nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Santagati:2015:MAC,
author = "G. Enrico Santagati and Tommaso Melodia and Laura
Galluccio and Sergio Palazzo",
title = "Medium access control and rate adaptation for
ultrasonic intrabody sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1121--1134",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2316675",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The use of wirelessly internetworked miniaturized
biomedical devices is promising a significant leap
forward in medical treatment of many pervasive
diseases. Recognizing the limitations of traditional
radio-frequency wireless communications in
interconnecting devices within the human body, in this
paper, we propose for the first time to develop network
protocols for implantable devices based on ultrasonic
transmissions. We start off by assessing the
theoretical feasibility of using ultrasonic waves in
human tissues and by deriving an accurate channel model
for ultrasonic intrabody communications. Then, we
propose a new ultrasonic transmission and multiple
access technique, which we refer to as Ultrasonic
WideBand (UsWB). UsWB is based on the idea of
transmitting information bits spread over very short
pulses following a time-hopping pattern. The short
impulse duration results in limited reflection and
scattering effects, and the low duty cycle reduces the
impact of thermal and mechanical effects, which may be
detrimental for human health. We then develop a
multiple access technique with distributed control to
enable efficient simultaneous access by mutually
interfering devices based on minimal and localized
information exchange and on measurements at the
receiver only. Finally, we demonstrate the performance
of UsWB through a multiscale simulator that models the
proposed communication system at the acoustic wave
level, at the physical (bit) level, and at the network
(packet) level. We also validate the simulation results
by comparing them to experimental results obtained with
a software-defined testbed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2015:RCA,
author = "Yu-Sian Li and Trang Minh Cao and Shu-Ting Wang and
Xin Huang and Cheng-Hsin Hsu and Po-Ching Lin",
title = "A resource-constrained asymmetric redundancy
elimination algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1135--1148",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2322889",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We focus on the problem of efficient communications
over access networks with asymmetric bandwidth and
capability. We propose a resource-constrained
asymmetric redundancy elimination algorithm (RCARE) to
leverage downlink bandwidth and receiver capability to
accelerate the uplink data transfer. RCARE can be
deployed on a client or a proxy. Different from
existing asymmetric algorithms, RCARE uses a flexible
matching mechanism to identify redundant data and
allocates a small sender cache to absorb the high
downlink traffic overhead. Compared to existing
redundancy elimination algorithms, RCARE provides a
scalable sender cache that is adaptive based on
resource and performance. We evaluate RCARE with real
traffic traces collected from multiple servers and a
campus gateway. The trace-driven simulation results
indicate that RCARE achieves higher goodput gains and
reduces downlink traffic compared to existing
asymmetric communication algorithms. We design an
adaptation algorithm for resource-constrained senders
sending multiple data streams. Our algorithm takes
samples from data streams and predicts how to invest
cache size on individual data streams to achieve
maximal uplink goodput gain. The adaptation algorithm
improves the goodput gain by up to 87\% compared to the
baseline. In first 10\% of data streams (sorted by the
optimal goodput gains), RCARE achieves up to 42\%
goodput gain on average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2015:DIS,
author = "Yang Yang and Miao Jin and Yao Zhao and Hongyi Wu",
title = "Distributed information storage and retrieval in
{$3$-D} sensor networks with general topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1149--1162",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2317809",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed in-network data-centric processing aims to
reduce energy consumed for communication and establish
a self-contained data storage, retrieval, aggregation,
and query sensor system that focuses more on the data
itself rather than the identities of the individual
network nodes. Double-ruling-based schemes support
efficient in-network data-centric information storage
and retrieval, especially for aggregated data, since
all data with different types generated in a network
can be conveniently retrieved along any single
retrieval curve. Previous double-ruling-based research
focuses on two-dimensional (2-D) wireless sensor
networks where a 2-D planar setting is assumed. With
increasing interests in deploying wireless sensors in
three-dimensional (3-D) space for various applications,
it is urgent yet fundamentally challenging to design
double-ruling-based approach in general 3-D sensor
networks because double-ruling-based schemes in general
have much harder geometric constraints than other
distributed in-network data-centric processing schemes.
In this research, we propose a geographic location-free
double-ruling-based approach for general 3-D sensor
networks with possibly complicated topology and
geometric shapes. Without the knowledge of the
geographic location and the distance bound, a query
simply travels along a simple curve with the guaranteed
success to retrieve aggregated data through time and
space with one or different types across the network.
Extensive simulations and comparisons show the proposed
scheme with low cost and a balanced traffic load.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2015:UMA,
author = "Yipeng Zhou and Tom Z. J. Fu and Dah Ming Chiu",
title = "A unifying model and analysis of {P2P} {VoD}
replication and scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1163--1175",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2321422",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a peer-to-peer (P2P)-assisted
video-on-demand (VoD) system where each peer can store
a relatively small number of movies to offload the
server when these movies are requested. User requests
are stochastic based on some movie popularity
distribution. The problem is how to replicate (or
place) content at peer storage to minimize the server
load. Several variations of this replication problem
have been studied recently with somewhat different
conclusions. In this paper, we first point out and
explain that the main difference between these studies
is in how they model the scheduling of peers to serve
user requests, and show that these different scheduling
assumptions will lead to different ``optimal''
replication strategies. We then propose a unifying
request scheduling model, parameterized by the maximum
number of peers that can be used to serve a single
request. This scheduling is called Fair Sharing with
Bounded Degree (FSBD). Based on this unifying model, we
can compare the different replication strategies for
different degree bounds and see how and why different
replication strategies are favored depending on the
degree. We also propose a simple (primarily)
distributed replication algorithm and show that this
algorithm is able to adapt itself to work well for
different degrees in scheduling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2015:TPP,
author = "Jianhang Gao and Qing Zhao and Ananthram Swami",
title = "The thinnest path problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1176--1189",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2321159",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We formulate and study the thinnest path problem for
secure communication in wireless ad hoc networks. The
objective is to find a path from a source to its
destination that results in the minimum number of nodes
overhearing the message by a judicious choice of
relaying nodes and their corresponding transmission
powers. We adopt a directed hypergraph model of the
problem and establish the NP-completeness of the
problem in 2-D networks. We then develop two
polynomial-time approximation algorithms that offer
[EQUATION] and [EQUATION] approximation ratios for
general directed hypergraphs (which can model
nonisotropic signal propagation in space) and constant
approximation ratios for ring hypergraphs (which result
from isotropic signal propagation). We also consider
the thinnest path problem in 1-D networks and 1-D
networks embedded in a 2-D field of eavesdroppers with
arbitrary unknown locations (the so-called 1.5-D
networks). We propose a linear-complexity algorithm
based on nested backward induction that obtains the
optimal solution for both 1-D and 1.5-D networks. This
algorithm does not require the knowledge of
eavesdropper locations and achieves the best
performance offered by any algorithm that assumes
complete location information of the eavesdroppers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gomaa:2015:HCP,
author = "Hazem Gomaa and Geoffrey G. Messier and Robert
Davies",
title = "Hierarchical cache performance analysis under
{TTL}-based consistency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1190--1201",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2320723",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces an analytical model for
characterizing the instantaneous hit ratio and
instantaneous average hit distance of a traditional
least recently used (LRU) cache hierarchy. The analysis
accounts for the use of two variants of the
Time-to-Live (TTL) weak consistency mechanism. The
first is the typical TTL scheme (TTL-T) used in the
HTTP/1.1 protocol where expired objects are refreshed
using conditional GET requests. The second is TTL
immediate ejection (TTL-IE) where objects are ejected
as soon as they expire. The analysis also accounts for
two sharing protocols: Leave Copy Everywhere (LCE) and
Promote Cached Objects (PCO). PCO is a new sharing
protocol introduced in this paper that decreases the
user's perceived latency and is robust under
nonstationary access patterns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garcia-Saavedra:2015:SSO,
author = "Andres Garcia-Saavedra and Balaji Rengarajan and Pablo
Serrano and Daniel Camps-Mur and Xavier
Costa-P{\'e}rez",
title = "{SOLOR}: self-optimizing {WLANs} with
legacy-compatible opportunistic relays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1202--1215",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2321975",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current IEEE 802.11 WLANs suffer from the well-known
rate anomaly problem, which can drastically reduce
network performance. Opportunistic relaying can address
this problem, but three major considerations, typically
considered separately by prior work, need to be taken
into account for an efficient deployment in real-world
systems: (1) relaying could imply increased power
consumption, and nodes might be heterogeneous, both in
power source (e.g., battery-powered versus
socket-powered) and power consumption profile; (2)
similarly, nodes in the network are expected to have
heterogeneous throughput needs and preferences in terms
of the throughput versus energy consumption tradeoff;
and (3) any proposed solution should be
backwards-compatible, given the large number of legacy
802.11 devices already present in existing networks. In
this paper, we propose a novel framework,
Self-Optimizing, Legacy-Compatible Opportunistic
Relaying (SOLOR), which jointly takes into account the
above considerations and greatly improves network
performance even in systems comprised mostly of vanilla
nodes and legacy access points. SOLOR jointly optimizes
the topology of the network, i.e., which are the nodes
associated to each relay-capable node; and the relay
schedules, i.e., how the relays split time between the
downstream nodes they relay for and the upstream flow
to access points. Our results, obtained for a large
variety of scenarios and different node preferences,
illustrate the significant gains achieved by our
approach. Specifically, SOLOR greatly improves network
throughput performance (more than doubling it) and
power consumption (up to 75\% reduction) even in
systems comprised mostly of vanilla nodes and legacy
access points. Its feasibility is demonstrated through
testbed experimentation in a realistic deployment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Johnston:2015:ROA,
author = "Matthew Johnston and Hyang-Won Lee and Eytan Modiano",
title = "A robust optimization approach to backup network
design with random failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1216--1228",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2320829",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a scheme in which a dedicated
backup network is designed to provide protection from
random link failures. Upon a link failure in the
primary network, traffic is rerouted through a
preplanned path in the backup network. We introduce a
novel approach for dealing with random link failures,
in which probabilistic survivability guarantees are
provided to limit capacity overprovisioning. We show
that the optimal backup routing strategy in this
respect depends on the reliability of the primary
network. Specifically, as primary links become less
likely to fail, the optimal backup networks employ more
resource sharing among backup paths. We apply results
from the field of robust optimization to formulate an
ILP for the design and capacity provisioning of these
backup networks. We then propose a simulated annealing
heuristic to solve this problem for large-scale
networks and present simulation results that verify our
analysis and approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Antonakopoulos:2015:FPM,
author = "Spyridon Antonakopoulos and Yigal Bejerano and Pramod
Koppol",
title = "Full protection made easy: the {DisPath IP} fast
reroute scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1229--1242",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2369855",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A major concern in IP networks is to ensure that any
topology changes, whether planned or unplanned, do not
disrupt network performance. IP Fast Reroute (IP FRR)
is a general approach to address this issue by promptly
forwarding an IP packet to a predetermined alternate
next-hop as soon as the primary next-hop to the
destination becomes unavailable. Among the numerous IP
FRR schemes proposed to date, the simplest ones do not
guarantee protection against every component failure,
while more sophisticated ones tend to be difficult to
implement due to various inherent complexities, such as
nontrivial modifications of IP packets or high resource
requirements. This paper presents a simple and
efficient IP FRR scheme called DisPath, which leverages
several fundamental properties of minimum-cost
node-disjoint paths for determining the alternate
next-hop toward a given destination. We show that
DisPath ensures full coverage, meaning protection
against all single link or node failures, with low
computational overhead and without the practical
complications encountered by other schemes that offer
the same level of protection. Our simulations on
several realistic instances reveal that DisPath usually
creates shorter (and, at worst, not much longer)
alternative paths than existing solutions adopted by
the industry. Combined with the aforementioned
protection guarantee and simplicity of implementation,
these results provide strong evidence that DisPath is a
most compelling choice of IP FRR scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Serrano:2015:PFE,
author = "Pablo Serrano and Andres Garcia-Saavedra and Giuseppe
Bianchi and Albert Banchs and Arturo Azcorra",
title = "Per-frame energy consumption in 802.11 devices and its
implication on modeling and design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1243--1256",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2322262",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper provides an in-depth understanding of the
per-frame energy consumption behavior in 802.11
wireless LAN devices. Extensive measurements are
performed for seven devices of different types
(wireless routers, smartphones, tablets, and embedded
devices) and for both UDP and TCP traffic. Experimental
results unveil that a substantial fraction of energy
consumption, hereafter descriptively named
cross-factor, may be ascribed to each individual frame
while it crosses the protocol stack (OS, driver, NIC)
and is independent of the frame size. Our findings,
summarized in a convenient energy consumption model,
contrast traditional models that (implicitly) amortize
such energy cost component in a fixed baseline cost or
in a toll proportional to the frame size and raise the
alert that, in some cases, conclusions drawn using
traditional energy models may be fallacious.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2015:RNT,
author = "Jun Zhang and Xiao Chen and Yang Xiang and Wanlei Zhou
and Jie Wu",
title = "Robust network traffic classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1257--1270",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2320577",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As a fundamental tool for network management and
security, traffic classification has attracted
increasing attention in recent years. A significant
challenge to the robustness of classification
performance comes from zero-day applications previously
unknown in traffic classification systems. In this
paper, we propose a new scheme of Robust statistical
Traffic Classification (RTC) by combining supervised
and unsupervised machine learning techniques to meet
this challenge. The proposed RTC scheme has the
capability of identifying the traffic of zero-day
applications as well as accurately discriminating
predefined application classes. In addition, we develop
a new method for automating the RTC scheme parameters
optimization process. The empirical study on real-world
traffic data confirms the effectiveness of the proposed
scheme. When zero-day applications are present, the
classification performance of the new scheme is
significantly better than four state-of-the-art
methods: random forest, correlation-based
classification, semi-supervised clustering, and
one-class SVM.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2015:TPP,
author = "Fan Wu and Qianyi Huang and Yixin Tao and Guihai
Chen",
title = "Towards privacy preservation in strategy-proof
spectrum auction mechanisms for noncooperative wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1271--1285",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2322104",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of dynamic spectrum redistribution has
been extensively studied in recent years. Auctions are
believed to be among the most effective tools to solve
this problem. A great number of strategy-proof auction
mechanisms have been proposed to improve spectrum
allocation efficiency by stimulating bidders to
truthfully reveal their valuations of spectrum, which
are the private information of bidders. However, none
of these approaches protects bidders' privacy. In this
paper, we present PRIDE, which is a PRIvacy-preserving
anD stratEgy-proof spectrum auction mechanism. PRIDE
guarantees $k$-anonymity for both single- and
multiple-channel auctions. Furthermore, we enhance
PRIDE to provide $l$-diversity, which is an even
stronger privacy protection than $k$-anonymity. We not
only rigorously prove the economic and
privacy-preserving properties of PRIDE, but also
extensively evaluate its performance. Our evaluation
results show that PRIDE achieves good spectrum
redistribution efficiency and fairness 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{Almasaeid:2015:RBC,
author = "Hisham M. Almasaeid and Ahmed E. Kamal",
title = "Receiver-based channel allocation in cognitive radio
wireless mesh networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1286--1299",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2326153",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the channel allocation problem
in cognitive radio wireless mesh networks (CR-WMNs). We
aim at finding an allocation strategy that guarantees
quality of service (QoS) (link reliability), maximizes
network coverage, and alleviates the need for a common
control channel to coordinate the communication
process. The allocation of a particular channel to a
mesh client (MC) is considered feasible if the MC can
establish connectivity with the backbone network in
both the upstream and the downstream directions, and
has the signal-to-interference-plus-noise ratio (SINR)
of the uplink and the downlink with its parent mesh
router (MR) within a predetermined threshold. A
receiver-based channel allocation (RBA) model that
achieves the aforementioned objectives is proposed
(channel assignment under this model can be proven to
be NP-hard). We then formulate a mixed integer linear
program, of the channel allocation problem under the
proposed model, and compare its performance to that of
two other baseline models, namely, transmitter-based
and all-tunable channel allocation strategies. The
results prove the superiority of the proposed model. We
also developed a heuristic algorithm, which is shown to
be an accurate algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DellAmico:2015:UAP,
author = "Matteo Dell'Amico and Maurizio Filippone and Pietro
Michiardi and Yves Roudier",
title = "On user availability prediction and network
applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1300--1313",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2321430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "User connectivity patterns in network applications are
known to be heterogeneous and to follow periodic (daily
and weekly) patterns. In many cases, the regularity and
the correlation of those patterns is problematic: For
network applications, many connected users create peaks
of demand; in contrast, in peer-to-peer scenarios,
having few users online results in a scarcity of
available resources. On the other hand, since
connectivity patterns exhibit a periodic behavior, they
are to some extent predictable. This paper shows how
this can be exploited to anticipate future user
connectivity and to have applications proactively
responding to it. We evaluate the probability that any
given user will be online at any given time, and assess
the prediction on 6-month availability traces from
three different Internet applications. Building upon
this, we show how our probabilistic approach makes it
easy to evaluate and optimize the performance in a
number of diverse network application models and to use
them to optimize systems. In particular, we show how
this approach can be used in distributed hash tables,
friend-to-friend storage, and cache preloading for
social networks, resulting in substantial gains in data
availability and system efficiency at negligible
costs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gregori:2015:NMA,
author = "Enrico Gregori and Alessandro Improta and Luciano
Lenzini and Lorenzo Rossi and Luca Sani",
title = "A novel methodology to address the {Internet}
{AS}-level data incompleteness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1314--1327",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2323128",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the last decade, many studies have used the
Internet autonomous system (AS)-level topology to
perform several analyses, from discovering its graph
properties to assessing its impact on the effectiveness
of worm-containment strategies. Yet, the Border Gateway
Protocol (BGP) data used to reveal the topologies are
far from complete. Our contribution is threefold.
First, we analyze BGP data currently gathered by the
most famous route collector projects, highlighting and
explaining the causes of their incompleteness. We found
that large areas of the Internet are not properly
captured due to the geographical location of route
collector feeders and due to BGP filters, such as
export policies and decision processes. Second, we
propose a methodology based on a new metric, named
p2c-distance, which is able to: (1) identify the
minimum number of ASs required to obtain an Internet
AS-level topology that is closer to reality; and (2)
identify a ranking list of these ASs to show that it is
possible to obtain nonnegligible coverage improvements
with a limited number of appropriately chosen feeding
ASs. Third, we characterize the ASs that were found to
be part of the solution of the above covering problems.
We found that the route collectors are rarely connected
to these ASs, thus highlighting that much effort is
needed to devise a route collector infrastructure that
ideally would be able to capture a complete view 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{Yang:2015:NCC,
author = "Chao Yang and Scott Jordan",
title = "A novel coordinated connection access control and
resource allocation framework for {$4$G} wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1328--1341",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2326168",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the academic literature on cellular network design,
resource allocation algorithms often attempt to
maximize total utility or throughput over a short time
period, and connection access control often admits
arrivals if and only if there are sufficient resources.
In this paper, we investigate how connection access
control and resource allocation can be coordinated to
jointly achieve maximum total utility. We propose a
decomposition in which resource allocation maximizes
long-term average utility for each system state, and
connection access control maximizes long-term average
utility over all system states. We discuss the
resulting interface and give examples of algorithms
that satisfy this decomposition and interface.
Simulation results illustrate that the optimal
connection access control policy may block applications
with relatively low average utility per unit rate even
when capacity is available, and that coordinated
connection access control and resource allocation can
outperform uncoordinated approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2015:SSM,
author = "Yu Cheng and Hongkun Li and Devu Manikantan Shila and
Xianghui Cao",
title = "A systematic study of maximal scheduling algorithms in
multiradio multichannel wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1342--1355",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2324976",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The greedy maximal scheduling (GMS) and maximal
scheduling (MS) algorithms are well-known
low-complexity scheduling policies with guaranteed
capacity region in the context of single-radio
single-channel (SR-SC) wireless networks. However, how
to design maximal scheduling algorithms for multiradio
multichannel (MR-MC) wireless networks and the
associated capacity analysis are not well understood
yet. In this paper, we develop a new model by
transforming an MR-MC network node to multiple
node-radio-channel (NRC) tuples. Such a framework
facilitates the derivation of a tuple-based
back-pressure algorithm for throughput-optimal control
in MR-MC wireless networks and enables the tuple-based
GMS and MS scheduling as low-complexity approximation
algorithms with guaranteed performance. An important
existing work on GMS and MS for MR-MC networks is that
of Lin and Rasool ( IEEE/ACM Trans. Networking, vol.
17, no. 6, 1874--1887, Dec. 2009), where link-based
algorithms are developed. Compared to the link-based
algorithms, the tuple-based modeling has significant
advantages in enabling a fully decomposable cross-layer
control framework. Another theoretical contribution in
this paper is that we, for the first time, extend the
local-pooling factor analysis to study the capacity
efficiency ratio of the tuple-based GMS in MR-MC
networks and obtain a lower bound that is much tighter
than those known in the literature. Moreover, we
analyze the communications and computation overhead in
implementing the distributed MS algorithm and present
simulation results to demonstrate the performance of
the tuple-based maximal scheduling algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2015:PMP,
author = "Yuanqing Zheng and Mo Li",
title = "{P-MTI}: physical-layer missing tag identification via
compressive sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1356--1366",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2326460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) systems are
emerging platforms that support a variety of pervasive
applications. RFID tags can be used to label items and
enable item-level monitoring. The problem of
identifying missing tags in RFID systems has attracted
wide attention due to its practical importance (e.g.,
anti-theft). This paper presents P-MTI: a
Physical-layer Missing Tag Identification scheme that
effectively makes use of the lower-layer information
and dramatically improves operational efficiency.
Unlike conventional approaches, P-MTI looks into the
aggregated tag responses instead of focusing on
individual tag responses and extracts useful
information from physical-layer collisions. P-MTI
leverages the sparsity of missing tag events and
reconstructs tag responses through compressive sensing.
We prototype P-MTI using the USRP software defined
radio and Intel WISP platform. We also evaluate the
performance of P-MTI with extensive simulations and
compare to previous approaches. The experiment results
show the promising performance of P-MTI in
identification accuracy, time efficiency, as well as
robustness over noisy channels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2015:CCN,
author = "Fan Zhang and Yewen Cao and Deqiang Wang",
title = "Comments and corrections: a note on {``Low-complexity
distributed scheduling algorithms for wireless
networks''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "4",
pages = "1367--1369",
month = aug,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2323998",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Sep 16 18:45:55 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Gupta:2009:LCD}.",
abstract = "We point out a flaw involved in the proof of Lemma 2
in the above-cited paper (IEEE/ACM Trans. Netw., vol.
17, no. 6, pp. 1846--1859, Dec. 2009) and provide a
corrected version.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Clad:2015:CMU,
author = "Francois Clad and Stefano Vissicchio and Pascal
M{\'e}rindol and Pierre Francois and Jean-Jacques
Pansiot",
title = "Computing minimal update sequences for graceful
router-wide reconfigurations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1373--1386",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332101",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Manageability and high availability are critical
properties for IP networks. Unfortunately, with
link-state routing protocols commonly used in such
networks, topological changes lead to transient
forwarding loops inducing service disruption. This
reduces the frequency at which operators can adapt
their network. Prior works proved that it is possible
to avoid disruptions due to the planned reconfiguration
of a link by progressively changing its weight, leading
to a solution that does not require changing protocol
specification. In this paper, we study the more general
problem of gracefully modifying the logical state of
multiple interfaces of a router, while minimizing the
number of weight updates. Compared to single-link
modifications, the router update problem is k
-dimensional for a router having k neighbors. We also
show that multidimensional updates may trigger new
kinds of disruptions that make the problem more
challenging than the single-link case. We then present
and evaluate efficient algorithms that compute minimal
sequences of weights enabling disruption-free router
reconfigurations. Based on analysis of real IP network
topologies, we show that both the size of such
sequences and the computing time taken by our
algorithms are limited.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bouillard:2015:EWC,
author = "Anne Bouillard and Giovanni Stea",
title = "Exact worst-case delay in {FIFO}-multiplexing
feed-forward networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1387--1400",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332071",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we compute the actual worst-case
end-to-end delay for a flow in a feed-forward network
of first-in-first-out (FIFO)-multiplexing service curve
nodes, where flows are shaped by piecewise-affine
concave arrival curves, and service curves are
piecewise affine and convex. We show that the
worst-case delay problem can be formulated as a mixed
integer linear programming problem, whose size grows
exponentially with the number of nodes involved.
Furthermore, we present approximate solution schemes to
find upper and lower delay bounds on the worst-case
delay. Both only require to solve just one linear
programming problem and yield bounds that are generally
more accurate than those found in the previous work,
which are computed under more restrictive
assumptions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Imon:2015:EER,
author = "Sk Kajal Arefin Imon and Adnan Khan and Mario {Di
Francesco} and Sajal K. Das",
title = "Energy-efficient randomized switching for maximizing
lifetime in tree-based wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1401--1415",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2331178",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In most wireless sensor network (WSN) applications,
data are typically gathered by sensor nodes and
reported to a data collection point called sink. To
support such a data collection pattern, a tree
structure rooted at the sink is defined. Depending on
various factors, including the WSN topology and the
availability of resources, the energy consumption of
nodes in different paths of the data collection tree
may vary largely, thus affecting the overall network
lifetime. This paper addresses the problem of lifetime
maximization of WSNs based on data collection trees.
Specifically, we propose a novel and efficient
algorithm, called Randomized Switching for Maximizing
Lifetime (RaSMaLai), that aims at extending the
lifetime of WSNs through load balancing. Given an
initial data collection tree, RaSMaLai randomly
switches some sensor nodes from their original paths to
other paths with lower load. We prove that, under
appropriate settings of the operating parameters,
RaSMaLai converges with a low time complexity. We
further design a distributed version of our algorithm.
Through an extensive performance evaluation study that
includes simulation of large-scale scenarios and real
experiments on a WSN testbed, we show that the proposed
RaSMaLai algorithm and its distributed version achieve
a longer network lifetime than the state-of-the-art
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Su:2015:TTS,
author = "Yi-Sheng Su",
title = "Topology-transparent scheduling via the {Chinese}
remainder theorem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1416--1429",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a novel scheme for the design of
topology-transparent scheduling (TTS) in mobile ad hoc
networks (MANETs), based on the Chinese remainder
theorem (CRT). TTS can provide each node with
guaranteed success in each schedule without any
detailed topology information and yields a guaranteed
upper bound on the transmission delay of each packet at
every node in a MANET. In general, TTS requires two
global constraints on the number of nodes in the MANET
and the maximum nodal degree of the graph representing
connectivity of the MANET. Due to the inherent mobility
of MANETs, the maximum nodal degree, however, cannot be
available or easily estimated. To eliminate the
requirement for the maximum nodal degree, this paper
proposes TTS via the CRT. By the redundancy property of
the Chinese remainder representation, the proposed
CRT-based scheme not only preserves the advantages of
providing guaranteed success in each schedule with only
the global constraint on the number of nodes in the
MANET, but also offers flexibility in constructing TTS.
To have a better transmission delay bound for a node
with lower interference, this paper also introduces two
threaded counterparts of the proposed CRT-based scheme.
This paper provides performance analyses for the
proposed CRT-based scheme and its threaded
counterparts. Numerical results demonstrate that TTS
via the CRT can outperform existing schemes, especially
in scenarios with harsh interference, and is a
versatile approach for the design of TTS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2015:DAS,
author = "Lei Yang and Yalin E. Sagduyu and Junshan Zhang and
Jason H. Li",
title = "Deadline-aware scheduling with adaptive network coding
for real-time traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1430--1443",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2331018",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study deadline-aware scheduling with adaptive
network coding (NC) for real-time traffic over a
single-hop wireless network. To meet hard deadlines of
real-time traffic, the block size for NC is adapted
based on the remaining time to the deadline so as to
strike a balance between maximizing the throughput and
minimizing the risk that the entire block of coded
packets may not be decodable by the deadline. This
sequential block size adaptation problem is then cast
as a finite-horizon Markov decision process. One
interesting finding is that the optimal block size and
its corresponding action space monotonically decrease
as the deadline approaches, and that the optimal block
size is bounded by the ``greedy'' block size. These
unique structures make it possible to significantly
narrow down the search space of dynamic programming,
building on which we develop a monotonicity-based
backward induction algorithm (MBIA) that can find the
optimal block size in polynomial time. Furthermore, a
joint real-time scheduling and channel learning scheme
with adaptive NC is developed to adapt to channel
dynamics in a mobile network environment. Then, we
generalize the analysis to multiple flows with hard
deadlines and long-term delivery ratio constraints. We
devise a low-complexity online scheduling algorithm
integrated with the MBIA, and then establish its
asymptotical utility optimality. The analysis and
simulation results are corroborated by high-fidelity
wireless emulation tests, where actual radio
transmissions over emulated channels are performed to
demonstrate the feasibility of the MBIA in finding the
optimal block size in real time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oguz:2015:SDP,
author = "Barlas O{\u{g}}uz and Venkat Anantharam and Ilkka
Norros",
title = "Stable distributed {P2P} protocols based on random
peer sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1444--1456",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2331352",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer protocols that rely on fully random peer
and chunk selection have recently been shown to suffer
from instability. The culprit is referred to as the
missing piece syndrome, whereby a single chunk is
driven to near extinction, leading to an accumulation
of peers having almost complete files, but waiting for
the missing chunk. We investigate three distributed
random peer sampling protocols that tackle this issue,
and present proofs of their stability using Lyapunov
function techniques. The first two protocols are based
on the sampling of multiple peers and a rare chunk
selection rule. The last protocol incorporates an
incentive mechanism to prevent free riding. It is shown
that this incentive mechanism interacts well with the
rare chunk selection protocol and stability is
maintained. Besides being stable for all arrival rates
of peers, all three protocols are scalable in that the
mean upload rate of each peer is bounded uniformly
independent of the arrival rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sarikaya:2015:CPC,
author = "Yunus Sarikaya and Ozgur Ercetin and Can Emre Koksal",
title = "Confidentiality-preserving control of uplink cellular
wireless networks using hybrid {ARQ}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1457--1470",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2331077",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
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 with information-theoretic secrecy for
uplink transmissions in time-varying cellular wireless
networks. Particularly, each node in an uplink cellular
network injects two types of traffic, confidential and
open at rates chosen in order to maximize a global
utility function while keeping the data queues stable
and meeting a constraint on the secrecy outage
probability. The transmitting node only knows the
distribution of channel gains. Our scheme is based on
Hybrid Automatic Repeat Request (HARQ) transmission
with incremental redundancy. We prove that our scheme
achieves a utility, arbitrarily close to the maximum
achievable. 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{Chen:2015:EST,
author = "Xu Chen and Brian Proulx and Xiaowen Gong and Junshan
Zhang",
title = "Exploiting social ties for cooperative {D$2$D}
communications: a mobile social networking case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1471--1484",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2329956",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Thanks to the convergence of pervasive mobile
communications and fast-growing online social
networking, mobile social networking is penetrating
into our everyday life. Aiming to develop a systematic
understanding of mobile social networks, in this paper
we exploit social ties in human social networks to
enhance cooperative device-to-device (D2D)
communications. Specifically, as handheld devices are
carried by human beings, we leverage two key social
phenomena, namely social trust and social reciprocity,
to promote efficient cooperation among devices. With
this insight, we develop a coalitional game-theoretic
framework to devise social-tie-based cooperation
strategies for D2D communications. We also develop a
network-assisted relay selection mechanism to implement
the coalitional game solution, and show that the
mechanism is immune to group deviations, individually
rational, truthful, and computationally efficient. We
evaluate the performance of the mechanism by using real
social data traces. Simulation results corroborate that
the proposed mechanism can achieve significant
performance gain over the case without D2D
cooperation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yazdanpanah:2015:DNC,
author = "Mina Yazdanpanah and Chadi Assi and Samir Sebbah and
Yousef Shayan",
title = "Does network coding combined with interference
cancellation bring any gain to a wireless network?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1485--1500",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332423",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the achievable performance gain that
network coding (NC) when combined with successive
interference cancellation (SIC) brings to a multihop
wireless network. While SIC enables concurrent
receptions from multiple transmitters, NC reduces the
transmission time-slot overhead, and each of these
techniques has shown independently great benefits in
improving the network performance. We present a
cross-layer formulation for the joint routing and
scheduling problem in a wireless network with NC (with
opportunistic listening) and SIC capabilities. We use
the realistic signal-to-interference-plus-noise ratio
(SINR) interference model. To solve this
combinatorially complex nonlinear problem, we decompose
it (using column generation) to two linear
subproblems--namely opportunistic NC aware routing and
scheduling subproblems. Our scheduling subproblem
consists of activating noninterfering NC components,
rather than links, which do not interfere with each
other and will be used to route the traffic. We further
extend our design to consider a multi-rate multihop
wireless network with interference cancellation
capabilities. We use numerical evaluation to present
the achieved performance gain and compare our work to
three other models: a base model with no NC and SIC, a
model with only NC, and a model with only SIC
capabilities. The numerical results show that our
proposed method (both with and without variable
transmission rate selection) achieves performance gains
that range between moderate and significant for the
various considered scenarios. Such improvements are
attributed to the joint capabilities of SIC and NC in
effectively controlling the interference and improving
the spatial reuse.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Abadal:2015:AES,
author = "Sergi Abadal and Mario Iannazzo and Mario Nemirovsky
and Albert Cabellos-Aparicio and Heekwan Lee and Eduard
Alarc{\'o}n",
title = "On the area and energy scalability of wireless
network-on-chip: a model-based benchmarked design space
exploration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1501--1513",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332271",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Networks-on-chip (NoCs) are emerging as the way to
interconnect the processing cores and the memory within
a chip multiprocessor. As recent years have seen a
significant increase in the number of cores per chip,
it is crucial to guarantee the scalability of NoCs in
order to avoid communication to become the next
performance bottleneck in multicore processors. Among
other alternatives, the concept of wireless
network-on-chip (WNoC) has been proposed, wherein
on-chip antennas would provide native broadcast
capabilities leading to enhanced network performance.
Since energy consumption and chip area are the two
primary constraints, this work is aimed to explore the
area and energy implications of scaling a WNoC in terms
of: (1) the number of cores within the chip, and (2)
the capacity of each link in the network. To this end,
an integral design space exploration is performed,
covering implementation aspects (area and energy),
communication aspects (link capacity), and
network-level considerations (number of cores and
network architecture). The study is entirely based upon
analytical models, which will allow to benchmark the
WNoC scalability against a baseline NoC. Eventually,
this investigation will provide qualitative and
quantitative guidelines for the design of future
transceivers for wireless on-chip communication.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2015:CLL,
author = "Chenxi Qiu and Haiying Shen and Sohraab Soltani and
Karan Sapra and Hao Jiang and Jason O. Hallstrom",
title = "{CEDAR}: a low-latency and distributed strategy for
packet recovery in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1514--1527",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2332980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Underlying link-layer protocols of well-established
wireless networks that use the conventional
``store-and-forward'' design paradigm cannot provide
highly sustainable reliability and stability in
wireless communication, which introduce significant
barriers and setbacks in scalability and deployments of
wireless networks. In this paper, we propose a Code
Embedded Distributed Adaptive and Reliable (CEDAR)
link-layer framework that targets low latency and
balancing en/decoding load among nodes. CEDAR is the
first comprehensive theoretical framework for analyzing
and designing distributed and adaptive error recovery
for wireless networks. It employs a theoretically sound
framework for embedding channel codes in each packet
and performs the error correcting process in selected
intermediate nodes in a packet's route. To identify the
intermediate nodes for the decoding, we mathematically
calculate the average packet delay and formalize the
problem as a nonlinear integer programming problem. By
minimizing the delays, we derive three propositions
that: (1) can identify the intermediate nodes that
minimize the propagation and transmission delay of a
packet; and (2) and (3) can identify the intermediate
nodes that simultaneously minimize the queuing delay
and maximize the fairness of en/decoding load of all
the nodes. Guided by the propositions, we then propose
a scalable and distributed scheme in CEDAR to choose
the intermediate en/decoding nodes in a route to
achieve its objective. The results from real-world
testbed ``NESTbed'' and simulation with MATLAB prove
that CEDAR is superior to schemes using hop-by-hop
decoding and destination decoding not only in packet
delay and throughput but also in energy-consumption and
load distribution balance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paschalidis:2015:MPA,
author = "Ioannis Ch. Paschalidis and Fuzhuo Huang and Wei Lai",
title = "A message-passing algorithm for wireless network
scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1528--1541",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2338277",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider scheduling in wireless networks and
formulate it as a Maximum Weighted Independent Set
(MWIS) problem on a ``conflict'' graph that captures
interference among simultaneous transmissions. We
propose a novel, low-complexity, and fully distributed
algorithm that yields high-quality feasible solutions.
Our proposed algorithm consists of two phases, each of
which requires only local information and is based on
message-passing. The first phase solves a relaxation of
the MWIS problem using a gradient projection method.
The relaxation we consider is tighter than the simple
linear programming relaxation and incorporates
constraints on all cliques in the graph. The second
phase of the algorithm starts from the solution of the
relaxation and constructs a feasible solution to the
MWIS problem. We show that our algorithm always outputs
an optimal solution to the MWIS problem for perfect
graphs. Simulation results compare our policies against
carrier sense multiple access (CSMA) and other
alternatives and show excellent performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2015:TOS,
author = "Bin Li and Ruogu Li and Atilla Eryilmaz",
title = "Throughput-optimal scheduling design with regular
service guarantees in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1542--1552",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2333008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by the regular service requirements of video
applications for improving quality of experience (QoE)
of users, we consider the design of scheduling
strategies in multihop wireless networks that not only
maximize system throughput but also provide regular
interservice times for all links. Since the service
regularity of links is related to the higher-order
statistics of the arrival process and the policy
operation, it is challenging to characterize and
analyze directly. We overcome this obstacle by
introducing a new quantity, namely the
time-since-last-service (TSLS), which tracks the time
since the last service. By combining it with the queue
length in the weight, we propose a novel
maximum-weight-type scheduling policy, called Regular
Service Guarantee (RSG) Algorithm. The unique evolution
of the TSLS counter poses significant challenges for
the analysis of the RSG Algorithm. To tackle these
challenges, we first propose a novel Lyapunov function
to show the throughput optimality of the RSG Algorithm.
Then, we prove that the RSG Algorithm can provide
service regularity guarantees by using the
Lyapunov-drift-based analysis of the steady-state
behavior of the stochastic processes. In particular,
our algorithm can achieve a degree of service
regularity within a factor of a fundamental lower bound
we derive. This factor is a function of the system
statistics and design parameters and can be as low as
two in some special networks. Our results, both
analytical and numerical, exhibit significant service
regularity improvements over the traditional
throughput-optimal policies, which reveals the
importance of incorporating the metric of
time-since-last-service into the scheduling policy for
providing regulated service.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sorour:2015:CDM,
author = "Sameh Sorour and Shahrokh Valaee",
title = "Completion delay minimization for instantly decodable
network codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1553--1567",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2338053",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of minimizing
the completion delay for instantly decodable network
coding (IDNC) in wireless multicast and broadcast
scenarios. We are interested in this class of network
coding due to its numerous benefits, such as low
decoding delay, low coding and decoding complexities,
and simple receiver requirements. We first extend the
IDNC graph, which represents all feasible IDNC coding
opportunities, to efficiently operate in both multicast
and broadcast scenarios. We then formulate the minimum
completion delay problem for IDNC as a stochastic
shortest path (SSP) problem. Although finding the
optimal policy using SSP is intractable, we use this
formulation to draw the theoretical guidelines for the
policies that can minimize the completion delay in
IDNC. Based on these guidelines, we design a maximum
weight clique selection algorithm, which can
efficiently reduce the IDNC completion delay in
polynomial time. We also design a quadratic-time
heuristic clique selection algorithm, which can operate
in real-time applications. Simulation results show that
our proposed algorithms significantly reduce the IDNC
completion delay compared to the random and
maximum-rate algorithms, and almost achieve the global
optimal completion delay performance over all network
codes in broadcast scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wood:2015:CDP,
author = "Timothy Wood and K. K. Ramakrishnan and Prashant
Shenoy and Jacobus {Van Der Merwe} and Jinho Hwang and
Guyue Liu and Lucas Chaufournier",
title = "{CloudNet}: dynamic pooling of cloud resources by live
{WAN} migration of virtual machines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1568--1583",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2343945",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
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 = "Virtualization technology and the ease with which
virtual machines (VMs) can be migrated within the LAN
have changed the scope of resource management from
allocating resources on a single server to manipulating
pools of resources within a data center. We expect WAN
migration of virtual machines to likewise transform the
scope of provisioning resources from a single data
center to multiple data centers spread across the
country or around the world. In this paper, we present
the CloudNet architecture consisting of cloud computing
platforms linked with a virtual private network
(VPN)-based network infrastructure to provide seamless
and secure connectivity between enterprise and cloud
data center sites. To realize our vision of efficiently
pooling geographically distributed data center
resources, CloudNet provides optimized support for live
WAN migration of virtual machines. Specifically, we
present a set of optimizations that minimize the cost
of transferring storage and virtual machine memory
during migrations over low bandwidth and high-latency
Internet links. We evaluate our system on an
operational cloud platform distributed across the
continental US. During simultaneous migrations of four
VMs between data centers in Texas and Illinois,
CloudNet's optimizations reduce memory migration time
by 65\% and lower bandwidth consumption for the storage
and memory transfer by 19 GB, a 50\% reduction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Moharir:2015:MWV,
author = "Sharayu Moharir and Sanjay Shakkottai",
title = "Max weight versus back pressure: routing and
scheduling in multichannel relay networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1584--1598",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2343992",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study routing and scheduling algorithms for
relay-assisted, multichannel downlink wireless networks
[e.g., orthogonal frequency-division multiplexing
(OFDM)-based cellular systems with relays]. Over such
networks, while it is well understood that the
BackPressure algorithm is stabilizing (i.e., queue
lengths do not become arbitrarily large), its
performance (e.g., delay, buffer usage) can be poor. In
this paper, we study an alternative--the MaxWeight
algorithm--variants of which are known to have good
performance in a single-hop setting. In a general relay
setting, however, MaxWeight is not even stabilizing
(and thus can have very poor performance). In this
paper, we study an iterative MaxWeight algorithm for
routing and scheduling in downlink multichannel relay
networks. We show that, surprisingly, the iterative
MaxWeight algorithm can stabilize the system in several
large-scale instantiations of this setting (e.g.,
general arrivals with full-duplex relays, bounded
arrivals with half-duplex relays). Furthermore, using
both many-channel large-deviations analysis and
simulations, we show that iterative MaxWeight
outperforms the BackPressure algorithm from a
queue-length/delay perspective.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dikbiyik:2015:EEC,
author = "Ferhat Dikbiyik and Massimo Tornatore and Biswanath
Mukherjee",
title = "Exploiting excess capacity, part {II}: differentiated
services under traffic growth",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1599--1609",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2335252",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Connections provisioned in a backbone network are
usually protected. A ``good'' protection scheme can
decrease the downtime experienced by a connection,
which can reduce (or eliminate) penalties for the
violation of the Service Level Agreement (SLA) between
the network operator and its customer. Although
``good'' protection schemes can guarantee high
availability to connections, they usually require high
capacity (e.g., bandwidth). However, backbone networks
usually have some excess capacity (EC) to accommodate
traffic fluctuations and growth, and when there is
enough EC, the high capacity requirement of protection
schemes can be tolerated. However, under traffic
growth, the network operator has to add more bandwidth
to avoid capacity exhaustion, which increases upgrade
costs. In this study, we show that, in case of
connections supporting differentiated services, where
connections' tolerable downtimes are diverse, efficient
exploitation of EC can decrease both SLA violations and
upgrade costs. We develop a novel EC management (ECM)
approach that provides high-availability high-capacity
protection schemes when EC is available, and
reprovisions backup resources with multiple protection
schemes so that SLAs are still respected, but network
upgrade costs are kept under control. We formulate this
problem as an integer linear program (ILP) and develop
an efficient heuristic as the ILP is intractable for
large problems. We present several alternatives of our
ECM approach to show its compatibility with different
protection-scheme combinations. Numerical examples are
presented to illustrate how the proposed ECM technique
finds a tradeoff between upgrade costs and penalties
paid for SLA violations while reducing the total cost
significantly.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gulyas:2015:SRP,
author = "Andr{\'a}s Guly{\'a}s and G{\'a}bor R{\'e}tv{\'a}ri
and Zal{\'a}n Heszberger and Rachit Agarwal",
title = "On the scalability of routing with policies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1610--1618",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2345839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today's ever-growing networks call for routing schemes
with sound theoretical scalability guarantees. In this
context, a routing scheme is scalable if the amount of
memory needed to implement it grows significantly
slower than the network size. Unfortunately,
theoretical scalability characterizations only exist
for shortest path routing, but for general policy
routing that current and future networks increasingly
rely on, very little understanding is available. In
this paper, we attempt to fill this gap. We define a
general framework for policy routing, and we study the
theoretical scaling properties of three fundamental
policy models within this framework. Our most important
contributions are the finding that, contrary to
shortest path routing, there exist policies that
inherently scale well, and a separation between the
class of policies that admit compact routing tables and
those that do not. Finally, we ask to what extent
memory size can be decreased by allowing paths to
contain a certain bounded number of policy violations
and, surprisingly, we conclude that most unscalable
policies remain unscalable under the relaxed model as
well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mallada:2015:SNC,
author = "Enrique Mallada and Xiaoqiao Meng and Michel Hack and
Li Zhang and Ao Tang",
title = "Skewless network clock synchronization without
discontinuity: convergence and performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1619--1633",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2345692",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper examines synchronization of computer clocks
connected via a data network and proposes a skewless
algorithm to synchronize them. Unlike existing
solutions, which either estimate and compensate the
frequency difference (skew) among clocks or introduce
offset corrections that can generate jitter and
possibly even backward jumps, our solution achieves
synchronization without these problems. We first
analyze the convergence property of the algorithm and
provide explicit necessary and sufficient conditions on
the parameters to guarantee synchronization. We then
study the effect of noisy measurements (jitter) and
frequency drift (wander) on the offsets and
synchronization frequency, and further optimize the
parameter values to minimize their variance. Our study
reveals a few insights, for example, we show that our
algorithm can converge even in the presence of timing
loops and noise, provided that there is a well-defined
leader. This marks a clear contrast with current
standards such as NTP and PTP, where timing loops are
specifically avoided. Furthermore, timing loops can
even be beneficial in our scheme as it is demonstrated
that highly connected subnetworks can collectively
outperform individual clients when the time source has
large jitter. The results are supported by experiments
running on a cluster of IBM BladeCenter servers with
Linux.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Iosifidis:2015:DAM,
author = "George Iosifidis and Lin Gao and Jianwei Huang and
Leandros Tassiulas",
title = "A double-auction mechanism for mobile data-offloading
markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1634--1647",
month = oct,
year = "2015",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The unprecedented growth of mobile data traffic
challenges the performance and economic viability of
today's cellular networks and calls for novel network
architectures and communication solutions. Mobile data
offloading through third-party Wi-Fi or femtocell
access points (APs) can significantly alleviate the
cellular congestion and enhance user quality of service
(QoS), without requiring costly and time-consuming
infrastructure investments. This solution has
substantial benefits both for the mobile network
operators (MNOs) and the mobile users, but comes with
unique technical and economic challenges that must be
jointly addressed. In this paper, we consider a market
where MNOs lease APs that are already deployed by
residential users for the offloading purpose. We assume
that each MNO can employ multiple APs, and each AP can
concurrently serve traffic from multiple MNOs. We
design an iterative double-auction mechanism that
ensures the efficient operation of the market by
maximizing the differences between the MNOs' offloading
benefits and APs' offloading costs. The proposed scheme
takes into account the particular characteristics of
the wireless network, such as the coupling of MNOs'
offloading decisions and APs' capacity constraints.
Additionally, it does not require full information
about the MNOs and APs and creates non-negative revenue
for the market broker.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2015:GHB,
author = "Dan Li and Jing Zhu and Jianping Wu and Junjie Guan
and Ying Zhang",
title = "Guaranteeing heterogeneous bandwidth demand in
multitenant data center networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1648--1660",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2341246",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The ability to provide guaranteed network bandwidth
for tenants is essential to the prosperity of cloud
computing platforms, as it is a critical step for
offering predictable performance to applications.
Despite its importance, it is still an open problem for
efficient network bandwidth sharing in a multitenant
environment, especially when applications have diverse
bandwidth requirements. More precisely, it is not only
that different tenants have distinct demands, but also
that one tenant may want to assign bandwidth
differently across her virtual machines (VMs), i.e.,
the heterogeneous bandwidth requirements. In this
paper, we tackle the problem of VM allocation with
bandwidth guarantee in multitenant data center
networks. We first propose an online VM allocation
algorithm that improves on the accuracy of the existing
work. Next, we develop a VM allocation algorithm under
heterogeneous bandwidth demands. We conduct extensive
simulations to demonstrate the efficiency of our
method.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Du:2015:RNP,
author = "Wei Du and Yongjun Liao and Narisu Tao and Pierre
Geurts and Xiaoming Fu and Guy Leduc",
title = "Rating network paths for locality-aware overlay
construction and routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1661--1673",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2337371",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the rating of network paths,
i.e., acquiring quantized measures of path properties
such as round-trip time and available bandwidth.
Compared to fine-grained measurements, coarse-grained
ratings are appealing in that they are not only
informative but also cheap to obtain. Motivated by this
insight, we first address the scalable acquisition of
path ratings by statistical inference. By observing
similarities to recommender systems, we examine the
applicability of solutions to a recommender system and
show that our inference problem can be solved by a
class of matrix factorization techniques. A technical
contribution is an active and progressive inference
framework that not only improves the accuracy by
selectively measuring more informative paths, but also
speeds up the convergence for available bandwidth by
incorporating its measurement methodology. Then, we
investigate the usability of rating-based network
measurement and inference in applications. A case study
is performed on whether locality awareness can be
achieved for overlay networks of Pastry and BitTorrent
using inferred ratings. We show that such
coarse-grained knowledge can improve the performance of
peer selection and that finer granularities do not
always lead to larger improvements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shah:2015:HPC,
author = "Virag Shah and Gustavo {De Veciana}",
title = "High-performance centralized content delivery
infrastructure: models and asymptotics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1674--1687",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2461132",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a centralized content delivery
infrastructure where a large number of
storage-intensive files are replicated across several
collocated servers. To achieve scalable mean delays in
file downloads under stochastic loads, we allow
multiple servers to work together as a pooled resource
to meet individual download requests. In such systems,
basic questions include: How and where to replicate
files? What is the impact of dynamic service allocation
across request types, and whether such allocations can
provide substantial gains over simpler load balancing
policies? What are tradeoffs among performance,
reliability and recovery costs, and energy? This paper
provides a simple performance model for large systems
towards addressing these basic questions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shu:2015:PML,
author = "Tao Shu and Yingying Chen and Jie Yang",
title = "Protecting multi-lateral localization privacy in
pervasive environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1688--1701",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2478881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Location-based services (LBSs) have raised serious
privacy concerns in the society, due to the possibility
of leaking a mobile user's location information in
enabling location-dependent services. While existing
location-privacy studies are mainly focused on
preventing the leakage of a user's location in
accessing the LBS server, the possible privacy leakage
in the calculation of the user's location, i.e., the
localization, has been largely ignored. Such a privacy
leakage stems from the fact that a localization
algorithm typically takes the location of anchors
(reference points for localization) as input, and
generates the target's location as output. As such, the
location of anchors and target could be leaked to
others. An adversary could further utilize the leakage
of anchor's locations to attack the localization
infrastructure and undermine the accurate estimation of
the target's location. To address this issue, in this
paper, we study the multilateral privacy-preserving
localization problem, whereby the location of a target
is calculated without the need of revealing anchors'
location, and the knowledge of the localization
outcome, i.e., the target's location, is strictly
limited to the target itself. To fully protect the
user's privacy, our study protects not only the user's
exact location information (the geo-coordinates), but
also any side information that may lead to a coarse
estimate of the location. We formulate the problem as a
secure least-squared-error (LSE) estimation for an
overdetermined linear system and develop three
privacy-preserving solutions by leveraging combinations
of information-hiding and homomorphic encryption. These
solutions provide different levels of protection for
location-side information and resilience to node
collusion and have the advantage of being able to trade
a user's privacy requirements for better computation
and communication efficiency. Through numerical
results, we verify the significant efficiency
improvement of the proposed schemes over existing
multiparty secure LSE algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2015:CLS,
author = "Dahai Xu and Mung Chiang and Jennifer Rexford",
title = "Corrections to {``Link-state routing with hop-by-hop
forwarding can achieve optimal traffic engineering''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1702--1703",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2402276",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Xu:2011:LSR}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Abdolee:2016:DLS,
author = "Reza Abdolee and Benoit Champagne",
title = "Diffusion {LMS} strategies in sensor networks with
noisy input data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "3--14",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2350013",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the performance of distributed
least-mean square (LMS) algorithms for parameter
estimation over sensor networks where the regression
data of each node are corrupted by white measurement
noise. Under this condition, we show that the estimates
produced by distributed LMS algorithms will be biased
if the regression noise is excluded from consideration.
We propose a bias-elimination technique and develop a
novel class of diffusion LMS algorithms that can
mitigate the effect of regression noise and obtain an
unbiased estimate of the unknown parameter vector over
the network. In our development, we first assume that
the variances of the regression noises are known a
priori. Later, we relax this assumption by estimating
these variances in real time. We analyze the stability
and convergence of the proposed algorithms and derive
closed-form expressions to characterize their
mean-square error performance in transient and
steady-state regimes. We further provide computer
experiment results that illustrate the efficiency of
the proposed algorithms and support the analytical
findings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chrysos:2016:DNF,
author = "Nikolaos Chrysos and Lydia Chen and Christoforos
Kachris and Manolis Katevenis",
title = "Discharging the network from its flow control
headaches: packet drops and {HOL} blocking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "15--28",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2378012",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Congestion control becomes indispensable in highly
utilized consolidated networks running demanding
applications. In this paper, proactive congestion
management schemes for Clos networks are described and
evaluated. The key idea is to move the congestion
avoidance burden from the data fabric to a scheduling
network, which isolates flows using per-flow request
counters. The scheduling network comprises per-output
arbiters that grant data packets after reserving space
for them in the buffer memories in front of fabric
outputs. Computer simulations show that this strategy
eliminates head-of-line (HOL) blocking and its
adversarial effects throughout the fabric, without
having to drop packets. In particular, a simplified
model describes this result as a synergy between
proactive buffer reservations and fine-grained
multipath routing. Two alternative designs are
presented. The first one places all arbiters in a
central control unit, is simpler, and has superior
performance. The second is more scalable by
distributing the arbiters over the switching elements
of the Clos network and by routing the control messages
to and from endpoint adapters via multiple paths.
Computer simulations of the complete system demonstrate
high throughput and low latency under any number of
congested outputs. Weighted max-min fair allocation of
fabric-output link bandwidth is also demonstrated.
Furthermore, delay breakdowns show that the time that
packets wait in fabric and resequencing buffers is
minimized as a result of the reduced (and equalized
across all fabric paths) in-fabric contention. Finally,
the high throughput capability of the system is
corroborated by a Markov chain analysis of output
buffer credits.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kavurmacioglu:2016:CPC,
author = "Emir Kavurmacioglu and Murat Alanyali and David
Starobinski",
title = "Competition in private commons: price war or market
sharing?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "29--42",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2357679",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper characterizes the outcomes of secondary
spectrum markets when multiple providers compete for
secondary demand. We study a competition model in which
each provider aims to enhance its revenue by
opportunistically serving a price-dependent secondary
demand, while also serving dedicated primary demand. We
consider two methodologies for sharing spectrum between
primary and secondary demand: In coordinated access,
spectrum providers have the option to decline a
secondary access request if that helps enhance their
revenue. We explicitly characterize a break-even price
such that profitability of secondary access provision
is guaranteed if secondary access is priced above the
break-even price, regardless of the volume of secondary
demand. Consequently, we establish that competition
among providers that employ optimal coordinated access
leads to a price war, as a result of which the provider
with the lowest break-even price captures the entire
market. This result holds for arbitrary secondary
demand functions. In uncoordinated access, primary and
secondary users share spectrum on equal basis, akin to
ISM bands. Under this policy, we characterize a market
sharing price that determines a provider's willingness
to share the market. We show an instance where the
market sharing price is strictly greater than the
breakeven price, indicating that market equilibrium in
an uncoordinated access setting can be fundamentally
different as it opens up the possibility of providers
sharing the market at higher prices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2016:RDG,
author = "Hongyu Gao and Vinod Yegneswaran and Jian Jiang and
Yan Chen and Phillip Porras and Shalini Ghosh and
Haixin Duan",
title = "Reexamining {DNS} from a global recursive resolver
perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "43--57",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2358637",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The performance and operational characteristics of the
Domain Name System (DNS) protocol are of deep interest
to the research and network operations community. In
this paper, we present measurement results from a
unique dataset containing more than 26 billion DNS
query-response pairs collected from more than 600
globally distributed recursive DNS resolvers. We use
this dataset to reaffirm findings in published work and
notice some significant differences that could be
attributed both to the evolving nature of DNS traffic
and to our differing perspective. For example, we find
that although characteristics of DNS traffic vary
greatly across networks, the resolvers within an
organization tend to exhibit similar behavior. We
further find that more than 50\% of DNS queries issued
to root servers do not return successful answers, and
that the primary cause of lookup failures at root
servers is malformed queries with invalid top-level
domains (TLDs). Furthermore, we propose a novel
approach that detects malicious domain groups using
temporal correlation in DNS queries. Our approach
requires no comprehensive labeled training set, which
can be difficult to build in practice. Instead, it uses
a known malicious domain as anchor and identifies the
set of previously unknown malicious domains that are
related to the anchor domain. Experimental results
illustrate the viability of this approach, i.e., we
attain a true positive rate of more than 96\%, and each
malicious anchor domain results in a malware domain
group with more than 53 previously unknown malicious
domains on average.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2016:SCS,
author = "Can Zhao and Xiaojun Lin and Chuan Wu",
title = "The streaming capacity of sparsely connected {P2P}
systems with distributed control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "58--71",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2359963",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer (P2P) streaming technologies can take
advantage of the upload capacity of clients, and hence
can scale to large content distribution networks with
lower cost. A fundamental question for P2P streaming
systems is the maximum streaming rate that all users
can sustain. Prior works have studied the optimal
streaming rate for a complete network, where every peer
is assumed to be able to communicate with all other
peers. This is, however, an impractical assumption in
real systems. In this paper, we are interested in the
achievable streaming rate when each peer can only
connect to a small number of neighbors. We show that
even with a random peer-selection algorithm and uniform
rate allocation, as long as each peer maintains $
\Omega (\ln N) $ downstream neighbors, where $N$ is the
total number of peers in the system, the system can
asymptotically achieve a streaming rate that is close
to the optimal streaming rate of a complete network.
These results reveal a number of important insights
into the dynamics of the system, based on which we then
design simple improved algorithms that can reduce the
constant factor in front of the $ \Omega (\ln N)$ term,
yet can achieve the same level of performance
guarantee. Simulation results are provided to verify
our analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kang:2016:PLD,
author = "Xiaohan Kang and Weina Wang and Juan Jos{\'e}
Jaramillo and Lei Ying",
title = "On the performance of largest-deficit-first for
scheduling real-time traffic in wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "72--84",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2360365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the problem of scheduling
real-time traffic in wireless networks. We consider ad
hoc wireless networks with general conflict graph-based
interference model and single-hop traffic. Each packet
is associated with a deadline and will be dropped if it
is not transmitted before the deadline. The number of
packet arrivals in each time-slot and the maximum delay
before the deadline are independent and identically
distributed across time. We require a minimum fraction
of packets to be delivered. At each link, we assume the
link keeps track of the difference between the minimum
number of packets that need to be delivered so far and
the number of packets that are actually delivered,
which we call the deficit. The largest-deficit-first
(LDF) policy schedules links in descending order
according to their deficit values, which is a variation
of the longest-queue-first (LQF) policy for
non-real-time traffic. We prove that the efficiency
ratio of LDF, which is the fraction of the throughput
region that LDF can achieve for given traffic
distributions, can be lower-bounded by a quantity that
we call the real-time local-pooling factor (R-LPF). We
further prove that a lower bound on the R-LPF can be
related to the weighted sum of the service rates, with
a special case of $ 1 / (\beta + 1) $ by considering
the uniform weight, where $ \beta $ is the interference
degree of the conflict graph. We also propose a
heuristic consensus algorithm that can be used to
obtain a good weight vector for such lower bounds for
given network topology.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:VBF,
author = "Chih-Yu Wang and Chun-Han Ko and Hung-Yu Wei and
Athanasios V. Vasilakos",
title = "A voting-based femtocell downlink cell-breathing
control mechanism",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "85--98",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2357498",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An overlay macrocell-femtocell system aims to increase
the system capacity with a low-cost infrastructure. To
construct such an infrastructure, we need to solve some
existing problems. First, there is a tradeoff between
femtocell coverage and overall system throughput, which
we defined as the cell-breathing phenomenon. In light
of this, we propose a femtocell downlink cell-breathing
control framework to strike a balance between the
coverage and data rate. Second, due to the selfish
nature of mobile stations, the system information
collected from them does not necessarily reflect the
true status of the system. Thus, we design FEmtocell
Virtual Election Rule (FEVER), a voting-based direct
mechanism that only requires users to report their
channel quality information to the femtocell base
station. Not only is it proved to be truthful and has
low implementation complexity, but it also strikes a
balance between efficiency and fairness to meet the
different needs. The simulation results verify the
enhanced system performance under the FEVER
mechanism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiao:2016:OCO,
author = "Lei Jiao and Jun Li and Tianyin Xu and Wei Du and
Xiaoming Fu",
title = "Optimizing cost for online social networks on
geo-distributed clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "99--112",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2359365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Geo-distributed clouds provide an intriguing platform
to deploy online social network (OSN) services. To
leverage the potential of clouds, a major concern of
OSN providers is optimizing the monetary cost spent in
using cloud resources while considering other important
requirements, including providing satisfactory quality
of service (QoS) and data availability to OSN users. In
this paper, we study the problem of cost optimization
for the dynamic OSN on multiple geo-distributed clouds
over consecutive time periods while meeting predefined
QoS and data availability requirements. We model the
cost, the QoS, as well as the data availability of the
OSN, formulate the problem, and design an algorithm
named cosplay. We carry out extensive experiments with
a large-scale real-world Twitter trace over 10
geo-distributed clouds all across the US. Our results
show that, while always ensuring the QoS and the data
availability as required, cosplay can reduce much more
one-time cost than the state-of-the-art methods, and it
can also significantly reduce the accumulative cost
when continuously evaluated over 48 months, with OSN
dynamics comparable to real-world cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kashef:2016:OPR,
author = "Mohamed Kashef and Anthony Ephremides",
title = "Optimal partial relaying for energy-harvesting
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "113--122",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2361683",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we asses the benefits of using partial
relaying in energy-harvesting networks. We consider a
system composed of a source, a relay, and a
destination. Each of the source and the relay has
energy-harvesting capability and generates its own
traffic. The source is helped by the relay through a
partial relaying network-level cooperation protocol.
The relay regulates the arrivals from the source by
accepting only a proportion of the successfully
received packets at the relay. The relaying parameter,
which determines the proportion of packets to be
accepted, is selected based on the parameters of the
network to ensure the stability of the source and the
relay data queues. In this work, we provide an exact
characterization of the stability region of the
network. We derive the optimal value of the relaying
parameter to maximize the stable throughput of the
source for a given data arrival rate to the relay.
Also, we compare the stability region of the proposed
strategy with partial relaying to the stability regions
of simple transmission strategies. Finally, we consider
the problem of network utility optimization in which we
optimize over the value of the relaying parameter for a
given pair of data arrival rates for the source and the
relay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Szymanski:2016:ULL,
author = "Ted H. Szymanski",
title = "An ultra-low-latency guaranteed-rate {Internet} for
cloud services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "123--136",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2358497",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An Enhanced-Internet network that provides
ultra-low-latency guaranteed-rate (GR) communications
for Cloud Services is proposed. The network supports
two traffic classes, the Smooth and Best-Effort
classes. Smooth traffic flows receive low-jitter GR
service over virtual-circuit-switched (VCS) connections
with negligible buffering and queueing delays, up to
100\% link utilizations, deterministic end-to-end
quality-of-service (QoS) guarantees, and improved
energy efficiency. End-to-end delays are effectively
reduced to the fiber ``time of flight.'' A new router
scheduling problem called the Bounded Normalized-Jitter
integer-programming problem is formulated. A fast
polynomial-time approximate solution is presented,
allowing TDM-based router schedules to be computed in
microseconds. We establish that all admissible traffic
demands in any packet-switched network can be
simultaneously satisfied with GR-VCS connections, with
minimal buffering. Each router can use two periodic
TDM-based schedules to support GR-VCS connections,
which are updated automatically when the router's
traffic rate matrix changes. The design of a
Silicon-Photonics all-optical packet switch with
minimal buffering is presented. The Enhanced-Internet
can: (1) reduce router buffer requirements by factors
of $ \geq 1000 $; (2) increase the Internet's aggregate
capacity; (3) lower the Internet's capital and
operating costs; and (4) lower greenhouse gas emissions
through improved energy efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lemamou:2016:HIL,
author = "Eunice Adjarath Lemamou and Philippe Galinier and
Steven Chamberland",
title = "A hybrid iterated local search algorithm for the
global planning problem of survivable {4G} wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "137--148",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2362356",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a hybrid iterated local
search (ILS) heuristic, named GPP4G-ILS, to solve the
global planning problem of survivable wireless
networks. The planning problem of wireless networks is
to determine a set of sites among potential sites to
install the various network devices in order to cover a
given geographical area. It should also make the
connections between the devices in accordance with
well-defined constraints. The global planning consists
in solving this problem without dividing it into
several subproblems. The objective is to minimize the
cost of the network while maximizing its survivability.
The GPP4G-ILS algorithm is a new form of hybridization
between the ILS algorithm and the integer linear
programming (ILP) method. We propose a configuration
that allows to reuse a previously developed ILP
algorithm by integrating it in the ILS algorithm. This
allows to benefit from the advantages of both methods.
The ILS algorithm is used to effectively explore the
search space, while the ILP algorithm is used to
intensify the solutions obtained. The performance of
the algorithm was evaluated using an exact method that
generates optimal solutions for small instances. For
larger instances, lower bounds have been calculated
using a relaxation of the problem. The results show
that the proposed algorithm is able to reach solutions
that are, on average, within 0.06\% of the optimal
solutions and 2.43\% from the lower bounds for the
instances that cannot be solved optimally, within a
reduced computation time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Retvari:2016:CIF,
author = "G{\'a}bor R{\'e}tv{\'a}ri and J{\'a}nos Tapolcai and
Attila K{\H{o}}r{\"o}si and Andr{\'a}s Majd{\'a}n and
Zal{\'a}n Heszberger",
title = "Compressing {IP} forwarding tables: towards entropy
bounds and beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "149--162",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2357051",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Lately, there has been an upsurge of interest in
compressed data structures, aiming to pack ever larger
quantities of information into constrained memory
without sacrificing the efficiency of standard
operations, like random access, search, or update. The
main goal of this paper is to demonstrate how data
compression can benefit the networking community by
showing how to squeeze the IP Forwarding Information
Base (FIB), the giant table consulted by IP routers to
make forwarding decisions, into information-theoretical
entropy bounds, with essentially zero cost on longest
prefix match and FIB update. First, we adopt the state
of the art in compressed data structures, yielding a
static entropy-compressed FIB representation with
asymptotically optimal lookup. Then, we redesign the
venerable prefix tree, used commonly for IP lookup for
at least 20 years in IP routers, to also admit entropy
bounds and support lookup in optimal time and update in
nearly optimal time. Evaluations on a Linux kernel
prototype indicate that our compressors encode an FIB
comprising more than 440 K prefixes to just about
100-400 kB of memory, with a threefold increase in
lookup throughput and no penalty on FIB updates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Naghizadeh:2016:PTM,
author = "Parinaz Naghizadeh and Mingyan Liu",
title = "Perceptions and truth: a mechanism design approach to
crowd-sourcing reputation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "163--176",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2359767",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a distributed multiuser system where
individual entities possess observations or perceptions
of one another, while the truth is only known to
themselves and they might have an interest in
withholding or distorting the truth. We ask the
question whether it is possible for the system as a
whole to arrive at the correct perceptions or
assessment of all users, referred to as their
reputation, by encouraging or incentivizing the users
to participate in a collective effort without violating
private information and self-interest. In this paper,
we investigate this problem using a mechanism design
theoretic approach. We introduce a number of utility
models representing users' strategic behavior, each
consisting of one or both of a truth element and an
image element, reflecting the user's desire to obtain
an accurate view of others and an inflated image of
itself. For each model, we either design a mechanism
that achieves the optimal performance (solution to the
corresponding centralized problem), or present
individually rational suboptimal solutions. In the
latter case, we demonstrate that even when the
centralized solution is not achievable, by using a
simple punish-reward mechanism, not only does a user
have the incentive to participate and provide
information, but also that this information can improve
the system performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mao:2016:OOS,
author = "Zhoujia Mao and Can Emre Koksal and Ness B. Shroff",
title = "Optimal online scheduling with arbitrary hard
deadlines in multihop communication networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "177--189",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2363136",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of online packet scheduling with hard
deadlines has been studied extensively in the
single-hop setting, whereas it is notoriously difficult
in the multihop setting. This difficulty stems from the
fact that packet scheduling decisions at each hop
influence and are influenced by decisions on other
hops, and only a few provably efficient online
scheduling algorithms exist in the multihop setting. We
consider a multihop wired network (interference-free
and full duplex transmissions) in which packets with
various deadlines and weights arrive at and are
destined to different nodes through given routes. We
study the problem of joint admission control and packet
scheduling in order to maximize the cumulative weights
of the packets that reach their destinations within
their deadlines. We first focus on uplink transmissions
in the tree topology and show that the well-known
Earliest Deadline First algorithm achieves the same
performance as the optimal offline algorithm for any
feasible arrival pattern. We then address the general
topology with multiple source-destination pairs,
develop a simple online algorithm, and show that it is
$ O (P M \log P M)$-competitive, where PM is the
maximum route length among all packets. Our algorithm
only requires information along the route of each
packet, and our result is valid for general arrival
samples. Moreover, we show that $ O (P M \log P
M)$-competitive is the best any online algorithm can
do. Via numerical results, we also show that our
algorithm achieves performance that is comparable to
the noncausal optimal offline algorithm. To the best of
our knowledge, this is the first algorithm with a
provable (based on a sample-path construction)
competitive ratio, subject to hard deadline constraints
for general network topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:MSM,
author = "Weina Wang and Kai Zhu and Lei Ying and Jian Tan and
Li Zhang",
title = "{MapTask} scheduling in {MapReduce} with data
locality: throughput and heavy-traffic optimality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "190--203",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2362745",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "MapReduce/Hadoop framework has been widely used to
process large-scale datasets on computing clusters.
Scheduling map tasks with data locality consideration
is crucial to the performance of MapReduce. Many works
have been devoted to increasing data locality for
better efficiency. However, to the best of our
knowledge, fundamental limits of MapReduce computing
clusters with data locality, including the capacity
region and theoretical bounds on the delay performance,
have not been well studied. In this paper, we address
these problems from a stochastic network perspective.
Our focus is to strike the right balance between data
locality and load balancing to simultaneously maximize
throughput and minimize delay. We present a new
queueing architecture and propose a map task scheduling
algorithm constituted by the Join the Shortest Queue
policy together with the MaxWeight policy. We identify
an outer bound on the capacity region, and then prove
that the proposed algorithm can stabilize any arrival
rate vector strictly within this outer bound. It shows
that the outer bound coincides with the actual capacity
region, and the proposed algorithm is
throughput-optimal. Furthermore, we study the number of
backlogged tasks under the proposed algorithm, which is
directly related to the delay performance based on
Little's law. We prove that the proposed algorithm is
heavy-traffic optimal, i.e., it asymptotically
minimizes the number of back-logged tasks as the
arrival rate vector approaches the boundary of the
capacity region. Therefore, the proposed algorithm is
also delay-optimal in the heavy-traffic regime. The
proofs in this paper deal with random processing times
with heterogeneous parameters and nonpreemptive task
execution, which differentiate our work from many
existing works on MaxWeight-type algorithms, so the
proof techniques themselves for the stability analysis
and the heavy-traffic analysis are also novel
contributions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Zubaidy:2016:NLP,
author = "Hussein Al-Zubaidy and J{\"o}rg Liebeherr and Almut
Burchard",
title = "Network-layer performance analysis of multihop fading
channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "204--217",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2360675",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A fundamental problem for the delay and backlog
analysis across multihop paths in wireless networks is
how to account for the random properties of the
wireless channel. Since the usual statistical models
for radio signals in a propagation environment do not
lend themselves easily to a description of the
available service rate, the performance analysis of
wireless networks has resorted to higher-layer
abstractions, e.g., using Markov chain models. In this
paper, we propose a network calculus that can
incorporate common statistical models of fading
channels and obtain statistical bounds on delay and
backlog across multiple nodes. We conduct the analysis
in a transfer domain, where the service process at a
link is characterized by the instantaneous
signal-to-noise ratio at the receiver. We discover
that, in the transfer domain, the network model is
governed by a dioid algebra, which we refer to as the
(min, $ \times $) algebra. Using this algebra, we
derive the desired delay and backlog bounds. Using
arguments from large deviations theory, we show that
the bounds are asymptotically tight. An application of
the analysis is demonstrated for a multihop network of
Rayleigh fading channels with cross traffic at each
hop.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bienkowski:2016:DAD,
author = "Marcin Bienkowski and Leszek G{\k{a}}sieniec and Marek
Klonowski and Miroslaw Korzeniowski and Bernard Mans
and Stefan Schmid and Roger Wattenhofer",
title = "Distributed alarming in the on-duty and off-duty
models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "218--230",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2359684",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Decentralized monitoring and alarming systems can be
an attractive alternative to centralized architectures.
Distributed sensor nodes (e.g., in the smart grid's
distribution network) are closer to an observed event
than a global and remote observer or controller. This
improves the visibility and response time of the
system. Moreover, in a distributed system, local
problems may also be handled locally and without
overloading the communication network. This paper
studies alarming from a distributed computing
perspective and for two fundamentally different
scenarios: on-duty and off-duty. We model the alarming
system as a sensor network consisting of a set of
distributed nodes performing local measurements to
sense events. In order to avoid false alarms, the
sensor nodes cooperate and only escalate an event
(i.e., raise an alarm) if the number of sensor nodes
sensing an event exceeds a certain threshold. In the
on-duty scenario, nodes not affected by the event can
actively help in the communication process, while in
the off-duty scenario, non-event nodes are inactive. We
present and analyze algorithms that minimize the
reaction time of the monitoring system while avoiding
unnecessary message transmissions. We investigate time
and message complexity tradeoffs in different settings,
and also shed light on the optimality of our algorithms
by deriving cost lower bounds for distributed alarming
systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qian:2016:SRL,
author = "Chen Qian and Simon S. Lam",
title = "A scalable and resilient layer-2 network with
{Ethernet} compatibility",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "231--244",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2361773",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present the architecture and protocols of ROME, a
layer-2 network designed to be backwards-compatible
with Ethernet and scalable to tens of thousands of
switches and millions of end-hosts. Such large-scale
networks are needed for emerging applications including
data center networks, wide area networks, and metro
Ethernet. ROME is based upon a recently developed
greedy routing protocol, greedy distance vector (GDV).
Protocol design innovations in ROME include a stateless
multicast protocol, a Delaunay distributed hash table
(DHT), as well as routing and host discovery protocols
for a hierarchical network. ROME protocols do not use
broadcast and provide both control-plane and data-plane
scalability. Extensive experimental results from a
packet-level event-driven simulator, in which ROME
protocols are implemented in detail, show that ROME
protocols are efficient and scalable to metropolitan
size. Furthermore, ROME protocols are highly resilient
to network dynamics. The routing latency of ROME is
only slightly higher than shortest-path latency. To
demonstrate scalability, we provide simulation
performance results for ROME networks with up to 25 000
switches and 1.25 million hosts.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stai:2016:PAC,
author = "Eleni Stai and Symeon Papavassiliou and John S.
Baras",
title = "Performance-aware cross-layer design in wireless
multihop networks via a weighted backpressure
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "245--258",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2360942",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study, analyze, and evaluate a
performance-aware cross-layer design approach for
wireless multihop networks. Through network utility
maximization (NUM) and weighted network graph modeling,
a cross-layer algorithm for performing jointly routing,
scheduling, and congestion control is introduced. The
performance awareness is achieved by both the
appropriate definition of the link weights for the
corresponding application's requirements and the
introduction of a weighted backpressure (BP)
routing/scheduling. Contrary to the conventional BP,
the proposed algorithm scales the congestion gradients
with the appropriately defined per-pair (link,
destination) weights. We analytically prove the queue
stability achieved by the proposed cross-layer scheme,
while its convergence to a close neighborhood of the
optimal source rates' values is proven via an $
\epsilon $-subgradient approach. The issue of the
weights' assignment based on various quality-of-service
(QoS) metrics is also investigated. Through modeling
and simulation, we demonstrate the performance
improvements that can be achieved by the proposed
approach-when compared against existing methodologies
in the literature-for two different examples with
diverse application requirements, emphasizing
respectively on delay and trustworthiness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:OPB,
author = "Xiaowen Gong and Junshan Zhang and Douglas Cochran and
Kai Xing",
title = "Optimal placement for barrier coverage in bistatic
radar sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "259--271",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2360849",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "By taking advantage of active sensing using radio
waves, radar sensors can offer several advantages over
passive sensors. Although much attention has been given
to multistatic and multiple-input-multiple-output
(MIMO) radar concepts, little has been paid to
understanding radar networks (i.e., multiple individual
radars working in concert). In this context, we study
the coverage problem of a bistatic radar (BR) sensor
network, which is very challenging due to the Cassini
oval sensing region of a BR and the coupling of sensing
regions across different BRs. In particular, we
consider the problem of deploying a network of BRs in a
region to maximize the worst-case intrusion
detectability, which amounts to minimizing the
vulnerability of a barrier. We show that it is optimal
to place BRs on the shortest barrier if it is the
shortest line segment that connects the left and right
boundary of the region. Based on this, we study the
optimal placement of BRs on a line segment to minimize
its vulnerability, which is a nonconvex optimization
problem. By exploiting certain specific structural
properties pertaining to the problem (particularly an
important structure of detectability), we characterize
the optimal placement order and the optimal placement
spacing of the BR nodes, both of which present elegant
balanced structures. Our findings provide valuable
insights into the placement of BRs for barrier
coverage. To our best knowledge, this is the first work
to explore the barrier coverage of a network of BRs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:MTC,
author = "Feng Wang and Jiangchuan Liu and Minghua Chen and
Haiyang Wang",
title = "Migration towards cloud-assisted live media
streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "272--282",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2362541",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Live media streaming has become one of the most
popular applications over the Internet. We have
witnessed the successful deployment of commercial
systems with content delivery network (CDN)- or
peer-to-peer-based engines. While each being effective
in certain aspects, having an all-round scalable,
reliable, responsive, and cost-effective solution
remains an illusive goal. Moreover, today's live
streaming services have become highly globalized, with
subscribers from all over the world. Such a
globalization makes user behaviors and demands even
more diverse and dynamic, further challenging
state-of-the-art system designs. The emergence of cloud
computing, however, sheds new light into this dilemma.
Leveraging the elastic resource provisioning from the
cloud, we present Cloud-Assisted Live Media Streaming
(CALMS), a generic framework that facilitates a
migration to the cloud. CALMS adaptively leases and
adjusts cloud server resources in a fine granularity to
accommodate temporal and spatial dynamics of demands
from live streaming users. We present optimal solutions
to deal with cloud servers with diverse capacities and
lease prices, as well as the potential latencies in
initiating and terminating leases in real-world cloud
platforms. Our solution well accommodates location
heterogeneity, mitigating the impact from user
globalization. It also enables seamless migration for
existing streaming systems, e.g., peer-to-peer, and
fully explores their potentials. Simulations with data
traces from both cloud service providers (Amazon EC2
and SpotCloud) and a live streaming service provider
(PPTV) demonstrate that CALMS effectively mitigates the
overall system deployment costs and yet provides users
with satisfactory streaming latency and rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eshghi:2016:OPC,
author = "Soheil Eshghi and M. H. R. Khouzani and Saswati Sarkar
and Santosh S. Venkatesh",
title = "Optimal patching in clustered malware epidemics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "283--298",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2364034",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Studies on the propagation of malware in mobile
networks have revealed that the spread of malware can
be highly inhomogeneous. Platform diversity, contact
list utilization by the malware, clustering in the
network structure, etc., can also lead to differing
spreading rates. In this paper, a general formal
framework is proposed for leveraging such heterogeneity
to derive optimal patching policies that attain the
minimum aggregate cost due to the spread of malware and
the surcharge of patching. Using Pontryagin's Maximum
Principle for a stratified epidemic model, it is
analytically proven that in the mean-field
deterministic regime, optimal patch disseminations are
simple single-threshold policies. These policies are
amenable to implementation and can serve as benchmarks
for policies that have less knowledge of the network.
Through numerical simulations, the behavior of optimal
patching policies is investigated in sample topologies,
and their advantages are demonstrated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alfano:2016:CCW,
author = "Giusi Alfano and Michele Garetto and Emilio Leonardi",
title = "Content-centric wireless networks with limited
buffers: when mobility hurts",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "299--311",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2361935",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We analyze throughput-delay scaling laws of mobile ad
hoc networks under a content-centric traffic scenario,
where users are mainly interested in retrieving
contents cached by other nodes. We assume limited
buffer size available at each node and Zipf-like
content popularity. We consider nodes uniformly
visiting the network area according to a random-walk
mobility model, whose flight size varies from the
typical distance among the nodes (quasi-static case) up
to the edge length of the network area (reshuffling
mobility model). Our main findings are: (1) the best
throughput-delay tradeoffs are achieved in the
quasi-static case: increasing the mobility degree of
nodes leads to worse and worse performance; (2) the
best throughput-delay tradeoffs can be recovered by
power control (i.e., by adapting the transmission range
to the content) even in the complete reshuffling
case.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2016:URC,
author = "Ziling Zhou and Binbin Chen and Haifeng Yu",
title = "Understanding {RFID} counting protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "312--327",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2361149",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Counting the number of radio frequency identification
(RFID) tags, namely RFID counting, is needed by a wide
array of important wireless applications. Motivated by
its paramount practical importance, researchers have
developed an impressive arsenal of techniques to
improve the performance of RFID counting (i.e., to
reduce the time needed to do the counting). This paper
aims to gain deeper and fundamental insights in this
subject to facilitate future research on this topic. As
our central thesis, we find out that the overlooked key
design aspect for RFID counting protocols to achieve
near-optimal performance is a conceptual separation of
a protocol into two phases. The first phase uses small
overhead to obtain a rough estimate, and the second
phase uses the rough estimate to further achieve an
accuracy target. Our thesis also indicates that other
performance-enhancing techniques or ideas proposed in
the literature are only of secondary importance. Guided
by our central thesis, we manage to design near-optimal
protocols that are more efficient than existing ones
and simultaneously simpler than most of them.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2016:TAU,
author = "Guang Tan and Zhimeng Yin and Hongbo Jiang",
title = "Trap array: a unified model for scalability evaluation
of geometric routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "328--341",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2362943",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Scalable routing for large-scale wireless networks
needs to find near shortest paths with low state on
each node, preferably sublinear with the network size.
Two approaches are considered promising toward this
goal: compact routing and geometric routing
(geo-routing). To date, the two lines of research have
been largely independent, perhaps because of the
distinct principles they follow. In particular, it
remains unclear how they compare to each other in the
worst case, despite extensive experimental results
showing the superiority of one or another in particular
cases. We develop a novel Trap Array topology model
that provides a unified framework to uncover the
limiting behavior of 10 representative geo-routing
algorithms. We present a series of new theoretical
results, in comparison to the performance of compact
routing as a baseline. In light of their pros and cons,
we further design a Compact Geometric Routing (CGR)
algorithm that attempts to leverage the benefits of
both approaches. Theoretical analysis and simulations
show the advantages of the topology model and the
algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Plante:2016:MOS,
author = "Jeremy M. Plante and Arush Gadkar and Vinod M.
Vokkarane",
title = "Manycast overlay in split-incapable networks for
supporting bandwidth-intensive applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "342--354",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2360503",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent trends in science applications call for
long-range and large-scale collaboration among
laboratories and super-computing sites. Long gone are
the days of entering data manually into a spreadsheet
on a local workstation. The world's most powerful and
ground-breaking experiments generate exabytes of
information, which must be distributed to multiple labs
for analysis and interpretation. Such trends reveal the
unwavering importance of new communication paradigms,
like multicasting and manycasting, which provide
point-to-multipoint data transfers. Typically, these
all-important mechanisms are provided at the optical
layer, where split-capable cross-connects split input
signals into multiple output signals all-optically.
Unfortunately, some of the world's largest and most
powerful networks do not have the hardware
infrastructure to support such functionality, but allow
for point-to-point communication exclusively. In such
split-incapable (SI) networks, multicast and manycast
must be provided as a logical overlay to the
pre-existing and limited unicast infrastructure. In
this paper, we present two overlay models for providing
manycast support in SI networks: Manycasting with Drop
at Member Node (MA-DMN) and Manycasting with Drop at
Any Node (MA-DAN). Through the development of integer
linear programs (ILPs) and heuristics, we evaluate
these models in terms of both optimal solutions and
efficient approximations for both small-scale and
large-scale networks and consider both static and
dynamic traffic scenarios. Our results demonstrate that
despite a small tradeoff in additional complexity and
delay from signal conversion to the optical domain, our
models provide efficient utilization of network
resources and greatly surpass the standard naive
approach of establishing paths to every destination.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Margolies:2016:EMP,
author = "Robert Margolies and Ashwin Sridharan and Vaneet
Aggarwal and Rittwik Jana and N. K. Shankaranarayanan
and Vinay A. Vaishampayan and Gil Zussman",
title = "Exploiting mobility in proportional fair cellular
scheduling: measurements and algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "355--367",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2362928",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Proportional Fair (PF) scheduling algorithms are the
de facto standard in cellular networks. They exploit
the users' channel state diversity (induced by
fast-fading) and are optimal for stationary channel
state distributions and an infinite time-horizon.
However, mobile users experience a nonstationary
channel, due to slow-fading (on the order of seconds),
and are associated with base stations for short
periods. Hence, we develop the Predictive
Finite-horizon PF Scheduling ((PF)$^2$ S) Framework
that exploits mobility. We present extensive channel
measurement results from a 3G network and characterize
mobility-induced channel state trends. We show that a
user's channel state is highly reproducible and
leverage that to develop a data rate prediction
mechanism. We then present a few channel allocation
estimation algorithms that exploit the prediction
mechanism. Our trace-based simulations consider
instances of the ((PF)$^2$ S) Framework composed of
combinations of prediction and channel allocation
estimation algorithms. They indicate that the framework
can increase the throughput by 15\%-55\% compared to
traditional PF schedulers, while improving fairness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Santacruz:2016:LPL,
author = "Pedro E. Santacruz and Vaneet Aggarwal and Ashutosh
Sabharwal",
title = "Leveraging physical-layer capabilities: distributed
scheduling in interference networks with local views",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "368--382",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2365440",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In most wireless networks, nodes have only limited
local information about the state of the network, which
includes connectivity and channel state information.
With limited local information about the network, each
node's knowledge is mismatched; therefore, they must
make distributed decisions. In this paper, we pose the
following question: If every node has network state
information only about a small neighborhood, how and
when should nodes choose to transmit? While link
scheduling answers the above question for
point-to-point physical layers that are designed for an
interference-avoidance paradigm, we look for answers in
cases when interference can be embraced by advanced
PHY-layer design, as suggested by results in network
information theory. To make progress on this
challenging problem, we propose a constructive
distributed algorithm that achieves rates higher than
link scheduling based on interference avoidance,
especially if each node knows more than one hop of
network state information. We compare our new
aggressive algorithm to a conservative algorithm we
have presented in a 2013 conference paper. Both
algorithms schedule subnetworks such that each
subnetwork can employ advanced interference-embracing
coding schemes to achieve higher rates. Our innovation
is in the identification, selection, and scheduling of
subnetworks, especially when subnetworks are larger
than a single link.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kandhway:2016:CHS,
author = "Kundan Kandhway and Joy Kuri",
title = "Campaigning in heterogeneous social networks: optimal
control of {SI} information epidemics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "383--396",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2361801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the optimal control problem of maximizing the
spread of an information epidemic on a social network.
Information propagation is modeled as a
susceptible-infected (SI) process, and the campaign
budget is fixed. Direct recruitment and word-of-mouth
incentives are the two strategies to accelerate
information spreading (controls). We allow for multiple
controls depending on the degree of the
nodes/individuals. The solution optimally allocates the
scarce resource over the campaign duration and the
degree class groups. We study the impact of the degree
distribution of the network on the controls and present
results for Erd``os-R{\'e}nyi and scale-free networks.
Results show that more resource is allocated to
high-degree nodes in the case of scale-free networks,
but medium-degree nodes in the case of
Erd''os-R{\'e}nyi networks. We study the effects of
various model parameters on the optimal strategy and
quantify the improvement offered by the optimal
strategy over the static and bang-bang control
strategies. The effect of the time-varying spreading
rate on the controls is explored as the interest level
of the population in the subject of the campaign may
change over time. We show the existence of a solution
to the formulated optimal control problem, which has
nonlinear isoperimetric constraints, using novel
techniques that is general and can be used in other
similar optimal control problems. This work may be of
interest to political, social awareness, or
crowdfunding campaigners and product marketing
managers, and with some modifications may be used for
mitigating biological epidemics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2016:EPR,
author = "Wen Luo and Yan Qiao and Shigang Chen and Min Chen",
title = "An efficient protocol for {RFID} multigroup
threshold-based classification based on sampling and
logical bitmap",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "397--407",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2367520",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most existing research adopts a ``flat'' view of radio
frequency identification (RFID) systems to perform
various functions of collecting tag IDs, estimating the
number of tags, detecting the missing tags, etc.
However, in practice, tags are often attached to
objects of different groups, which may represent
different product types in a warehouse, different book
categories in a library, etc. As we move from a flat
view to an organized group view, there arise many
interesting problems. One of them, called multigroup
threshold-based classification, is the focus of this
paper. It is to determine whether the number of objects
in each group is above or below a prescribed threshold
value. Solving this problem is important for inventory
tracking applications. If the number of groups is very
large, it will be inefficient to measure the groups one
at a time. The best existing solution for multigroup
threshold-based classification is based on generic
group testing, whose design is however geared toward
detecting a small number of populous groups. Its
performance degrades quickly when the number of groups
above the threshold becomes large. In this paper, we
propose a new classification protocol based on tag
sampling and logical bitmaps. It achieves high
efficiency by measuring all groups in a mixed fashion.
In the meantime, we show that the new method is able to
perform threshold-based classification with an accuracy
that can be preset to any desirable level, allowing
tradeoff between time efficiency and accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2016:ISD,
author = "Kai Zhu and Lei Ying",
title = "Information source detection in the {SIR} model: a
sample-path-based approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "408--421",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2364972",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of detecting the
information source in a network in which the spread of
information follows the popular
Susceptible-Infected-Recovered (SIR) model. We assume
all nodes in the network are in the susceptible state
initially, except one single information source that is
in the infected state. Susceptible nodes may then be
infected by infected nodes, and infected nodes may
recover and will not be infected again after recovery.
Given a snapshot of the network, from which we know the
graph topology and all infected nodes but cannot
distinguish susceptible nodes and recovered nodes, the
problem is to find the information source based on the
snapshot and the network topology. We develop a
sample-path-based approach where the estimator of the
information source is chosen to be the root node
associated with the sample path that most likely leads
to the observed snapshot. We prove for infinite-trees,
the estimator is a node that minimizes the maximum
distance to the infected nodes. A reverse-infection
algorithm is proposed to find such an estimator in
general graphs. We prove that for g + 1-regular trees
such that gq {$>$} 1, where g + 1 is the node degree
and is the infection probability, the estimator is
within a constant distance from the actual source with
a high probability, independent of the number of
infected nodes and the time the snapshot is taken. Our
simulation results show that for tree networks, the
estimator produced by the reverse-infection algorithm
is closer to the actual source than the one identified
by the closeness centrality heuristic. We then further
evaluate the performance of the reverse infection
algorithm on several 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{Chen:2016:ABD,
author = "Chen Chen and Hans-Arno Jacobsen and Roman Vitenberg",
title = "Algorithms based on divide and conquer for topic-based
publish\slash subscribe overlay design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "422--436",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2369346",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Overlay design for topic-based publish/subscribe
(pub/sub) systems is of primary importance because the
overlay forms the basis for the system and directly
impacts its performance. This paper focuses on the
MinAvg-TCO problem: Use the minimum number of edges to
construct a topic-connected overlay (TCO) such that all
nodes that are interested in the same topic are
organized in a directly connected dissemination
sub-overlay. Existing algorithms for MinAvg-TCO suffer
from three key drawbacks: (1) prohibitively high
runtime cost; (2) reliance on global knowledge and
centralized operation; and (3) nonincremental operation
by reconstructing the TCO from scratch. From a
practical point of view, these are all severe
limitations. To address these concerns, we develop
algorithms that dynamically join multiple TCOs.
Inspired by the divide-and-conquer character of this
idea, we derive a number of algorithms for the original
MinAvg-TCO problem that accommodate a variety of
practical pub/sub workloads. Both theoretical analysis
and experimental evaluations demonstrate that our
divide-and-conquer algorithms seek a balance between
time efficiency and the number of edges required: Our
algorithms cost a fraction (up to 1.67\%) of the
runtime cost of their greedy alternatives, which come
at the expense of an empirically insignificant increase
in the average node degree. Furthermore, in order to
reduce the probability of poor partitioning at the
divide phase, we develop a bulk-lightweight
partitioning scheme on top of random partitioning. This
more refined partitioning imposes a marginally higher
runtime cost, but leads to improvements in the output
TCOs, including average node degrees and topic
diameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pacifici:2016:CBA,
author = "Valentino Pacifici and Frank Lehrieder and Gy{\"o}rgy
D{\'a}n",
title = "Cache bandwidth allocation for {P2P} file-sharing
systems to minimize inter-{ISP} traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "437--448",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2367021",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many Internet service providers (ISPs) have deployed
peer-to-peer (P2P) caches in their networks in order to
decrease costly inter-ISP traffic. A P2P cache stores
parts of the most popular contents locally, and if
possible serves the requests of local peers to decrease
the inter-ISP traffic. Traditionally, P2P cache
resource management focuses on managing the storage
resource of the cache so as to maximize the inter-ISP
traffic savings. In this paper, we show that when there
are many overlays competing for the upload bandwidth of
a P2P cache, then in order to maximize the inter-ISP
traffic savings, the cache's upload bandwidth should be
actively allocated among the overlays. We formulate the
problem of P2P cache bandwidth allocation as a Markov
decision process and propose three approximations to
the optimal cache bandwidth allocation policy. We use
extensive simulations and experiments to evaluate the
performance of the proposed policies, and show that the
bandwidth allocation policy that prioritizes swarms
with a small ratio of local peers to all peers in the
swarm can improve the inter-ISP traffic savings in
BitTorrent-like P2P systems by up to 30\%-60\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:ERR,
author = "Qiang Liu and Xin Wang and Nageswara S. V. Rao and
Katharine Brigham and B. V. K. Vijaya Kumar",
title = "Effect of retransmission and retrodiction on
estimation and fusion in long-haul sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "449--461",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2363841",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a long-haul sensor network, sensors are remotely
deployed over a large geographical area to perform
certain tasks, such as target tracking. In this paper,
we study the scenario where sensors take measurements
of one or more dynamic targets and send state estimates
of the targets to a fusion center via satellite links.
The severe loss and delay inherent over the satellite
channels reduce the number of estimates successfully
arriving at the fusion center, thereby limiting the
potential fusion gain and resulting in suboptimal
accuracy performance of the fused estimates. In
addition, the errors in target-sensor data association
can also degrade the estimation performance. To
mitigate the effect of imperfect communications on
state estimation and fusion, we consider retransmission
and retrodiction. The system adopts certain
retransmission-based transport protocols so that lost
messages can be recovered over time. Moreover,
retrodiction/smoothing techniques are applied so that
the chances of incurring excess delay due to
retransmission are greatly reduced. We analyze the
extent to which retransmission and retrodiction can
improve the performance of delay-sensitive target
tracking tasks under variable communication loss and
delay conditions. Simulation results of a ballistic
target tracking application are shown in the end to
demonstrate the validity of our analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2016:ERW,
author = "Fengyu Gao and Hongyan Qian",
title = "Efficient, real-world token bucket configuration for
residential gateways",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "462--475",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2366496",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet service providers should deploy effective
active queue management (AQM) strategies to provide
high-bandwidth low-latency access links to customers.
However, they do not, and customers see high latencies,
which are problematic for latency-sensitive
applications (e.g., VoIP). As a result, customers have
to deploy token buckets, but they are hard to
configure. In this paper, we evaluate different token
bucket configurations and find that the anecdotal
evidence regarding token bucket configuration is not
optimal. We analyze different configurations using the
ns-2 simulator and find a formula to derive optimal
parameters depending on the link bandwidth, which
brings about much lower latency and higher
throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Athanasiadou:2016:SXB,
author = "Sophia Athanasiadou and Marios Gatzianas and Leonidas
Georgiadis and Leandros Tassiulas",
title = "Stable {XOR}-based policies for the broadcast erasure
channel with feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "476--491",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2366435",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we describe a network coding scheme for
the Broadcast Erasure Channel with multiple unicast
stochastic flows, for a single source transmitting
packets to users with per-slot ACK/NACK feedback. This
scheme performs only binary (XOR) operations and
involves a network of queues, along with special rules
for coding and moving packets among the queues, that
ensure instantaneous decodability. Additionally, for
the scheme to work, one has to specify which packets to
select for encoding at each time, based on the received
feedback. Contrary to prior work where this packet
selection was explicitly specified a priori, we employ
a backpressure-type policy that makes the selection
based only on queue backlogs. We next provide a
stability region outer bound for arbitrary and erasure
patterns and show that this bound effectively coincides
with a bound on the system's information-theoretic
capacity region (accounting for idle slots). Finally,
for and i.i.d. erasures, we provide a policy that
achieves the stability outer bound and employs the
proposed XOR scheme using a restricted set of coding
rules.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Banchs:2016:TSB,
author = "Albert Banchs and Jorge Ortin and Andres
Garcia-Saavedra and Douglas J. Leith and Pablo
Serrano",
title = "Thwarting selfish behavior in {802.11 WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "492--505",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2369535",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The 802.11e standard enables user configuration of
several MAC parameters, making WLANs vulnerable to
users that selfishly configure these parameters to gain
throughput. In this paper, we propose a novel
distributed algorithm to thwart such selfish behavior.
The key idea of the algorithm is for stations to react,
upon detecting a misbehavior, by using a more
aggressive configuration that penalizes the misbehaving
station. We show that the proposed algorithm guarantees
global stability while providing good response times.
By conducting an analysis of the effectiveness of the
algorithm against selfish behaviors, we also show that
a misbehaving station cannot obtain any gain by
deviating from the algorithm. Simulation results
confirm that the proposed algorithm optimizes
throughput performance while discouraging selfish
behavior. We also present an experimental prototype of
the proposed algorithm demonstrating that it can be
implemented on commodity hardware.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Coras:2016:AML,
author = "Florin Coras and Jordi Domingo-Pascual and Darrel
Lewis and Albert Cabellos-Aparicio",
title = "An analytical model for {Loc\slash ID} mappings
caches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "506--516",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2373398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Concerns regarding the scalability of the interdomain
routing have encouraged researchers to start
elaborating a more robust Internet architecture. While
consensus on the exact form of the solution is yet to
be found, the need for a semantic decoupling of a
node's location and identity is generally accepted as a
promising way forward. However, this typically requires
the use of caches that store temporal bindings between
the two namespaces, to avoid hampering router packet
forwarding speeds. In this article, we propose a
methodology for an analytical analysis of cache
performance that relies on the working-set theory. We
first identify the conditions that network traffic must
comply with for the theory to be applicable and then
develop a model that predicts average cache miss rates
relying on easily measurable traffic parameters. We
validate the result by emulation, using real packet
traces collected at the egress points of a campus and
an academic network. To prove its versatility, we
extend the model to consider cache polluting user
traffic and observe that simple, low intensity attacks
drastically reduce performance, whereby manufacturers
should either overprovision router memory or implement
more complex cache eviction policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2016:IPI,
author = "Yi Gao and Wei Dong and Chun Chen and Jiajun Bu and
Wenbin Wu and Xue Liu",
title = "{iPath}: path inference in wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "517--528",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2371459",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent wireless sensor networks (WSNs) are becoming
increasingly complex with the growing network scale and
the dynamic nature of wireless communications. Many
measurement and diagnostic approaches depend on
per-packet routing paths for accurate and fine-grained
analysis of the complex network behaviors. In this
paper, we propose iPath, a novel path inference
approach to reconstructing the per-packet routing paths
in dynamic and large-scale networks. The basic idea of
iPath is to exploit high path similarity to iteratively
infer long paths from short ones. iPath starts with an
initial known set of paths and performs path inference
iteratively. iPath includes a novel design of a
lightweight hash function for verification of the
inferred paths. In order to further improve the
inference capability as well as the execution
efficiency, iPath includes a fast bootstrapping
algorithm to reconstruct the initial set of paths. We
also implement iPath and evaluate its performance using
traces from large-scale WSN deployments as well as
extensive simulations. Results show that iPath achieves
much higher reconstruction ratios under different
network settings compared to other state-of-the-art
approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nair:2016:CFF,
author = "Jayakrishnan Nair and Martin Andreasson and Lachlan L.
H. Andrew and Steven H. Low and John C. Doyle",
title = "On channel failures, file fragmentation policies, and
heavy-tailed completion times",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "529--541",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2375920",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been recently discovered that heavy-tailed
completion times can result from protocol interaction
even when file sizes are light-tailed. A key to this
phenomenon is the use of a restart policy where if the
file is interrupted before it is completed, it needs to
restart from the beginning. In this paper, we show that
fragmenting a file into pieces whose sizes are either
bounded or independently chosen after each interruption
guarantees light-tailed completion time as long as the
file size is light-tailed; i.e., in this case,
heavy-tailed completion time can only originate from
heavy-tailed file sizes. If the file size is
heavy-tailed, then the completion time is necessarily
heavy-tailed. For this case, we show that when the file
size distribution is regularly varying, then under
independent or bounded fragmentation, the completion
time tail distribution function is asymptotically
bounded above by that of the original file size
stretched by a constant factor. We then prove that if
the distribution of times between interruptions has
nondecreasing failure rate, the expected completion
time is minimized by dividing the file into equal-sized
fragments; this optimal fragment size is unique but
depends on the file size. We also present a simple
blind fragmentation policy where the fragment sizes are
constant and independent of the file size and prove
that it is asymptotically optimal. Both these policies
are also shown to have desirable completion time tail
behavior. Finally, we bound the error in expected
completion time due to error in modeling of the failure
process.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Afrasiabi:2016:EUP,
author = "Mohammad Hadi Afrasiabi and Roch Gu{\'e}rin",
title = "Exploring user-provided connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "542--554",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2378771",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network services often exhibit positive and negative
externalities that affect users' adoption decisions.
One such service is ``user-provided connectivity'' or
UPC. The service offers an alternative to traditional
infrastructure-based communication services by allowing
users to share their ``home base'' connectivity with
other users, thereby increasing their access to
connectivity. More users means more connectivity
alternatives, i.e., a positive externality, but also
greater odds of having to share one's own connectivity,
i.e., a negative externality. The tug of war between
positive and negative externalities together with the
fact that they often depend not just on how many but
also which users adopt make it difficult to predict the
service's eventual success. Exploring this issue is the
focus of this paper, which investigates not only when
and why such services may be viable, but also explores
how pricing can be used to effectively and practically
realize them.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rottenstreich:2016:OTE,
author = "Ori Rottenstreich and Isaac Keslassy and Avinatan
Hassidim and Haim Kaplan and Ely Porat",
title = "Optimal in\slash out {TCAM} encodings of ranges",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "555--568",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2382031",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Hardware-based packet classification has become an
essential component in many networking devices. It
often relies on ternary content-addressable memories
(TCAMs), which compare the packet header against a set
of rules. TCAMs are not well suited to encode range
rules. Range rules are often encoded by multiple TCAM
entries, and little is known about the smallest number
of entries that one needs for a specific range. In this
paper, we introduce the In/Out TCAM, a new architecture
that combines a regular TCAM together with a modified
TCAM. This custom architecture enables independent
encoding of each rule in a set of rules. We provide the
following theoretical results for the new architecture:
(1) We give an upper bound on the worst-case expansion
of range rules in one and two dimensions. (2) For
extremal ranges, which are 89\% of the ranges that
occur in practice, we provide an efficient algorithm
that computes an optimal encoding. (3) We present a
closed-form formula for the average expansion of an
extremal range.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Esposito:2016:DVN,
author = "Flavio Esposito and Donato {Di Paola} and Ibrahim
Matta",
title = "On distributed virtual network embedding with
guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "569--582",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2375826",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To provide wide-area network services, resources from
different infrastructure providers are needed.
Leveraging the consensus-based resource allocation
literature, we propose a general distributed auction
mechanism for the (NP-hard) virtual network (VNET)
embedding problem. Under reasonable assumptions on the
bidding scheme, the proposed mechanism is proven to
converge, and it is shown that the solutions guarantee
a worst-case efficiency of (1 --- (1/ e )) relative to
the optimal node embedding, or VNET embedding if
virtual links are mapped to exactly one physical link.
This bound is optimal, that is, no better
polynomial-time approximation algorithm exists, unless
P = NP. Using extensive simulations, we confirm
superior convergence properties and resource
utilization when compared to existing distributed VNET
embedding solutions, and we show how by appropriate
policy design, our mechanism can be instantiated to
accommodate the embedding goals of different service
and infrastructure providers, resulting in an
attractive and flexible resource allocation solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2016:SAA,
author = "Xiaochun Yun and Yipeng Wang and Yongzheng Zhang and
Yu Zhou",
title = "A semantics-aware approach to the automated network
protocol identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "583--595",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2381230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic classification, a mapping of traffic to
network applications, is important for a variety of
networking and security issues, such as network
measurement, network monitoring, as well as the
detection of malware activities. In this paper, we
propose Securitas, a network trace-based protocol
identification system, which exploits the semantic
information in protocol message formats. Securitas
requires no prior knowledge of protocol specifications.
Deeming a protocol as a language between two processes,
our approach is based upon the new insight that the
$n$-grams of protocol traces, just like those of
natural languages, exhibit highly skewed frequency-rank
distribution that can be leveraged in the context of
protocol identification. In Securitas, we first extract
the statistical protocol message formats by clustering
n -grams with the same semantics, and then use the
corresponding statistical formats to classify raw
network traces. Our tool involves the following key
features: (1) applicable to both connection oriented
protocols and connection less protocols; (2) suitable
for both text and binary protocols; (3) no need to
assemble IP packets into TCP or UDP flows; and (4)
effective for both long-live flows and short-live
flows. We implement Securitas and conduct extensive
evaluations on real-world network traces containing
both textual and binary protocols. Our experimental
results on BitTorrent, CIFS/SMB, DNS, FTP, PPLIVE, SIP,
and SMTP traces show that Securitas has the ability to
accurately identify the network traces of the target
application protocol with an average recall of about
97.4\% and an average precision of about 98.4\%. Our
experimental results prove Securitas is a robust
system, and meanwhile displaying a competitive
performance in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Peng:2016:MTA,
author = "Qiuyu Peng and Anwar Walid and Jaehyun Hwang and
Steven H. Low",
title = "Multipath {TCP}: analysis, design, and
implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "596--609",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2379698",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multipath TCP (MP-TCP) has the potential to greatly
improve application performance by using multiple paths
transparently. We propose a fluid model for a large
class of MP-TCP algorithms and identify design criteria
that guarantee the existence, uniqueness, and stability
of system equilibrium. We clarify how algorithm
parameters impact TCP-friendliness, responsiveness, and
window oscillation and demonstrate an inevitable
tradeoff among these properties. We discuss the
implications of these properties on the behavior of
existing algorithms and motivate our algorithm Balia
(balanced linked adaptation), which generalizes
existing algorithms and strikes a good balance among
TCP-friendliness, responsiveness, and window
oscillation. We have implemented Balia in the Linux
kernel. We use our prototype to compare the new
algorithm to existing MP-TCP algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Daly:2016:DRA,
author = "James Daly and Alex X. Liu and Eric Torng",
title = "A difference resolution approach to compressing access
control lists",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "610--623",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2397393",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Access control lists (ACLs) are the core of many
networking and security devices. As new threats and
vulnerabilities emerge, ACLs on routers and firewalls
are getting larger. Therefore, compressing ACLs is an
important problem. In this paper, we propose a new
approach, called Diplomat, to ACL compression. The key
idea is to transform higher dimensional target patterns
into lower dimensional patterns by dividing the
original pattern into a series of hyperplanes and then
resolving differences between two adjacent hyperplanes
by adding rules that specify the differences. This
approach is fundamentally different from prior ACL
compression algorithms and is shown to be very
effective. We implemented Diplomat and conducted
side-by-side comparison with the prior Firewall
Compressor, TCAM Razor, and ACL Compressor algorithms
on real life classifiers. Our experimental results show
that Diplomat outperforms all of them on most of our
real-life classifiers, often by a considerable margin,
particularly as classifier size and complexity
increases. In particular, on our largest ACLs, Diplomat
has an average improvement ratio of 34.9\% over
Firewall Compressor on range-ACLs, of 14.1\% over TCAM
Razor on prefix-ACLs, and 8.9\% over ACL Compressor on
mixed-ACLs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hanif:2016:MFG,
author = "Ahmed Farhan Hanif and Hamidou Tembine and Mohamad
Assaad and Djamal Zeghlache",
title = "Mean-field games for resource sharing in cloud-based
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "624--637",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2387100",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider last level cache (LLC)
sharing problems in large-scale cloud networks with a
fair payoff function. We formulate the problem as a
strategic decision-making problem (i.e., a game). We
examine the resource-sharing game with finite and
infinite number of players. Exploiting the aggregate
structure of the payoff functions, we show that the
resource-sharing game has a Nash equilibrium in a wide
range of return index. We show that the Nash
equilibrium is not an evolutionarily stable strategy in
the finite regime. Then, we introduce a myopic
mean-field response where each player implements a
mean-field-taking strategy. We show that such a
mean-field-taking strategy is an evolutionarily stable
strategy in both finite and infinite regime. We provide
closed-form expression of the optimal pricing that
gives an efficient resource-sharing policy. As the
number of active players grows without bound, we show
that the equilibrium strategy converges to a mean-field
equilibrium, and the optimal prices for resources
converge to the optimal price of the mean-field game.
Then, we address the demand satisfaction problem for
which a necessary and sufficient condition for
satisfactory solutions is provided. In addition, a very
fast mean-field learning algorithm is provided.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2016:BFO,
author = "Dong Zhao and Xiang-Yang Li and Huadong Ma",
title = "Budget-feasible online incentive mechanisms for
crowdsourcing tasks truthfully",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "647--661",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile crowd sensing (MCS) is a new paradigm that
takes advantage of pervasive mobile devices to
efficiently collect data, enabling numerous novel
applications. To achieve good service quality for an
MCS application, incentive mechanisms are necessary to
attract more user participation. Most existing
mechanisms apply only for the offline scenario where
all users report their strategic types in advance. On
the contrary, we focus on a more realistic scenario
where users arrive one by one online in a random order.
Based on the online auction model, we investigate the
problem that users submit their private types to the
crowdsourcer when arriving, and the crowdsourcer aims
at selecting a subset of users before a specified
deadline for maximizing the value of services (assumed
to be a nonnegative monotone submodular function)
provided by selected users under a budget constraint.
We design two online mechanisms, OMZ and OMG,
satisfying the computational efficiency, individual
rationality, budget feasibility, truthfulness, consumer
sovereignty, and constant competitiveness under the
zero arrival-departure interval case and a more general
case, respectively. Through extensive simulations, we
evaluate the performance and validate the theoretical
properties of our online mechanisms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:DDO,
author = "Daibo Liu and Mengshu Hou and Zhichao Cao and Jiliang
Wang and Yuan He and Yunhao Liu",
title = "Duplicate detectable opportunistic forwarding in
duty-cycled wireless sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "662--673",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic routing, offering relatively efficient
and adaptive forwarding in low-duty-cycled sensor
networks, generally allows multiple nodes to forward
the same packet simultaneously, especially in networks
with intensive traffic. Uncoordinated transmissions
often incur a number of duplicate packets, which are
further forwarded in the network, occupy the limited
network resource, and hinder the packet delivery
performance. Existing solutions to this issue, e.g.,
overhearing or coordination based approaches, either
cannot scale up with the system size, or suffer high
control overhead. We present Duplicate-Detectable
Opportunistic Forwarding (DOF), a duplicate-free
opportunistic forwarding protocol for low-duty-cycled
wireless sensor networks. DOF enables senders to obtain
the information of all potential forwarders via a
slotted acknowledgment scheme, so the data packets can
be sent to the deterministic next-hop forwarder. Based
on light-weight coordination, DOF explores the
opportunities as many as possible and removes duplicate
packets from the forwarding process. We implement DOF
and evaluate its performance on an indoor testbed with
20 TelosB nodes. The experimental results show that DOF
reduces the average duplicate ratio by 90\%, compared
to state-of-the-art opportunistic protocols, and
achieves 61.5\% enhancement in network yield and 51.4\%
saving in energy consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oller:2016:TCS,
author = "Joaquim Oller and Ilker Demirkol and Jordi Casademont
and Josep Paradells and Gerd Ulrich Gamm and Leonhard
Reindl",
title = "Has time come to switch from duty-cycled {MAC}
protocols to wake-up radio for wireless sensor
networks?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "674--687",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Duty-cycled Medium Access Control (MAC) protocols
certainly improve the energy efficiency of wireless
networks. However, most of these protocols still suffer
from severe degrees of overhearing and idle listening.
These two issues prevent optimum energy usage, a
crucial aspect in energy-constrained wireless networks
such as wireless sensor networks (WSNs). Wake-up radio
(WuR) systems drastically reduce these problems by
completely switching off the nodes' microcontroller
unit (MCU) and main radio transceiver until a
secondary, extremely low-power receiver is triggered by
a particular wireless transmission, the so called
wake-up call. Unfortunately, most WuR studies focus on
theoretical platforms and/or custom-built simulators.
Both these factors reduce the associated usefulness of
the obtained results. In this paper, we model and
simulate a real, recent, and promising WuR hardware
platform developed by the authors. The simulation model
uses time and energy consumption values obtained in the
laboratory and does not rely on custom-built simulation
engines, but rather on the OMNET++ simulator. The
performance of the WuR platform is compared to four of
the most well-known and widely employed MAC protocols
for WSN under three real-world network deployments. The
paper demonstrates how the use of our WuR platform
presents numerous benefits in several areas, from
energy efficiency and latency to packet delivery ratio
and applicability, and provides the essential
information for serious consideration of switching
duty-cycled MAC-based networks to WuR.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mishra:2016:AFP,
author = "Abhishek Mishra and Parv Venkitasubramaniam",
title = "Anonymity and fairness in packet scheduling: a
quantitative tradeoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "688--702",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fairness among multiple users sharing a common
resource is an important criterion in the design and
evaluation of scheduling algorithms in networks.
Anonymous networking, where sources of transmitted
packets are undecipherable to an eavesdropper, requires
packets arriving at routers from multiple sources to be
randomly reordered prior to transmission, which works
against the notion of temporal fairness in packet
scheduling. Consequently, it is important to understand
the relationship between temporal fairness and
achievable anonymity. In this paper, this relationship
is investigated for three fair scheduling paradigms:
First-Come--First-Serve (FCFS), Fair Queuing, and the
Proportional Method. Using an information-theoretic
metric for anonymity and a common temporal fairness
index that measures the degree of out-of-order
transmissions, the anonymity achievable under these
scheduling paradigms is characterized and their
anonymity-fairness tradeoffs are compared. The FCFS and
Fair Queuing algorithms have little inherent anonymity,
and a significant improvement in anonymity is achieved
by relaxing their respective fairness paradigms. The
analysis of the relaxed FCFS criterion, in particular,
is accomplished by modeling the problem as a stochastic
control system that is solved using dynamic
programming. The proportional method of scheduling,
while unpopular in networks today, is shown to
outperform the other fair scheduling algorithms when
trading temporal fairness for anonymity, and is also
proven to be asymptotically optimal as the buffer size
of the scheduler is increased.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2016:ETS,
author = "Min Chen and Wen Luo and Zhen Mo and Shigang Chen and
Yuguang Fang",
title = "An efficient tag search protocol in large-scale {RFID}
systems with noisy channel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "703--716",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification (RFID) technology has
many applications in inventory management, supply
chain, product tracking, transportation, and logistics.
One research issue of practical importance is to search
for a particular group of tags in a large-scale RFID
system. Time efficiency is a crucial factor that must
be considered when designing a tag search protocol to
ensure its execution will not interfere with other
normal inventory operations. In this paper, we design a
new technique called filtering vector, which can
significantly reduce transmission overhead during
search process, thereby shortening search time. Based
on this technique, we propose an iterative tag search
protocol. In each round, we filter out some tags and
eventually terminate the search process when the search
result meets the accuracy requirement. Furthermore, we
extend our protocol to work under noisy channel. The
simulation results demonstrate that our protocol
performs much better than the best existing work.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shafigh:2016:FDN,
author = "Alireza Shams Shafigh and Beatriz Lorenzo and Savo
Glisic and Jordi P{\'e}rez-Romero and Luiz A. DaSilva
and Allen B. MacKenzie and Juha R{\"o}ning",
title = "A framework for dynamic network architecture and
topology optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "717--730",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A new paradigm in wireless network access is presented
and analyzed. In this concept, certain classes of
wireless terminals can be turned temporarily into an
access point (AP) anytime while connected to the
Internet. This creates a dynamic network architecture
(DNA) since the number and location of these APs vary
in time. In this paper, we present a framework to
optimize different aspects of this architecture. First,
the dynamic AP association problem is addressed with
the aim to optimize the network by choosing the most
convenient APs to provide the quality-of-service (QoS)
levels demanded by the users with the minimum cost.
Then, an economic model is developed to compensate the
users for serving as APs and, thus, augmenting the
network resources. The users' security investment is
also taken into account in the AP selection. A
preclustering process of the DNA is proposed to keep
the optimization process feasible in a high dense
network. To dynamically reconfigure the optimum
topology and adjust it to the traffic variations, a new
specific encoding of genetic algorithm (GA) is
presented. Numerical results show that GA can provide
the optimum topology up to two orders of magnitude
faster than exhaustive search for network clusters, and
the improvement significantly increases with the
cluster size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Qudah:2016:ITD,
author = "Zakaria Al-Qudah and Eamon Johnson and Michael
Rabinovich and Oliver Spatscheck",
title = "{Internet} with transient destination-controlled
addressing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "731--744",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today's Internet makes hosts and individual networks
inherently insecure because permanent addresses turn
destinations into permanent attack targets. This paper
describes an Evasive Internet Protocol (EIP), a change
to the data plane of the Internet that: (1) prevents
senders from forging their identities while preserving
the current Internet privacy paradigm; (2) gives
recipients full control over who can communicate with
them and for how long; (3) achieves the above features
without requiring global signaling protocols; and (4)
allows coexistence with and graceful introduction into
the current Internet. We motivate our approach, present
the architectural design, and evaluate it through
trace-driven and synthetic simulations as well as
prototype testing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:EEI,
author = "Zhi Zhang and Yigal Bejerano and Spyridon
Antonakopoulos",
title = "Energy-efficient {IP} core network configuration under
general traffic demands",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "745--758",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of minimizing the power
consumption of IP core networks by means of power aware
configuration of the Points of Presence (PoPs), given
general traffic demands on the links. Although the
problem is in general NP-complete, we give an optimal
algorithm for an important variant where the number of
ports on each line-card chassis is 2. For the general
problem, we design two approximation algorithms with
respective P /2 and 2 ln N approximation ratios, where
P is the number of ports on each line-card chassis, and
N is the number of chassis within the PoP. When the
traffic demands are correlated, we prove that our
algorithms are optimal. Extensive simulations
demonstrate that our PoP configuration algorithms
significantly outperform existing design solutions over
a wide range of traffic instances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neely:2016:DSO,
author = "Michael J. Neely",
title = "Distributed stochastic optimization via correlated
scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "759--772",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers a problem where multiple devices
make repeated decisions based on their own observed
events. The events and decisions at each time-step
determine the values of a utility function and a
collection of penalty functions. The goal is to make
distributed decisions over time to maximize
time-average utility subject to time-average
constraints on the penalties. An example is a
collection of power-constrained sensors that repeatedly
report their own observations to a fusion center.
Maximum time-average utility is fundamentally reduced
because devices do not know the events observed by
others. Optimality is characterized for this
distributed context. It is shown that optimality is
achieved by correlating device decisions through a
commonly known pseudo-random sequence. An optimal
algorithm is developed that chooses pure strategies at
each time-step based on a set of time-varying
weights.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rahman:2016:DMF,
author = "Sazzadur Rahman and Ting-Kai Huang and Harsha V.
Madhyastha and Michalis Faloutsos",
title = "Detecting malicious {Facebook} applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "773--787",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With 20 million installs a day [1], third-party apps
are a major reason for the popularity and addictiveness
of Facebook. Unfortunately, hackers have realized the
potential of using apps for spreading malware and spam.
The problem is already significant, as we find that at
least 13\% of apps in our dataset are malicious. So
far, the research community has focused on detecting
malicious posts and campaigns. In this paper, we ask
the question: Given a Facebook application, can we
determine if it is malicious? Our key contribution is
in developing FRAppE---Facebook's Rigorous Application
Evaluator---arguably the first tool focused on
detecting malicious apps on Facebook. To develop
FRAppE, we use information gathered by observing the
posting behavior of 111K Facebook apps seen across 2.2
million users on Facebook. First, we identify a set of
features that help us distinguish malicious apps from
benign ones. For example, we find that malicious apps
often share names with other apps, and they typically
request fewer permissions than benign apps. Second,
leveraging these distinguishing features, we show that
FRAppE can detect malicious apps with 99.5\% accuracy,
with no false positives and a high true positive rate
(95.9\%). Finally, we explore the ecosystem of
malicious Facebook apps and identify mechanisms that
these apps use to propagate. Interestingly, we find
that many apps collude and support each other; in our
dataset, we find 1584 apps enabling the viral
propagation of 3723 other apps through their posts.
Long term, we see FRAppE as a step toward creating an
independent watchdog for app assessment and ranking, so
as to warn Facebook users before installing apps.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:ANC,
author = "Xudong Wang and Wenguang Mao",
title = "Analog network coding without restrictions on
superimposed frames",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "788--805",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The applicability of analog network coding (ANC) to a
wireless network is constrained by several limitations:
(1) some ANC schemes demand fine-grained frame-level
synchronization, which cannot be practically achieved
in a wireless network; (2) others support only a
specific type of modulation or require equal frame size
in concurrent transmissions. In this paper, a new ANC
scheme, called restriction-free analog network coding
(RANC), is developed to eliminate the above
limitations. It incorporates several function blocks,
including frame boundary detection, joint channel
estimation, waveform recovery, circular channel
estimation, and frequency offset estimation, to support
random concurrent transmissions with arbitrary frame
sizes in a wireless network with various linear
modulation schemes. To demonstrate the distinguished
features of RANC, two network applications are studied.
In the first application, RANC is applied to support a
new relaying scheme called multi-way relaying, which
significantly improves the spectrum efficiency as
compared to two-way relaying. In the second
application, RANC enables random-access-based ANC in an
ad hoc network where flow compensation can be
gracefully exploited to further improve the throughput
performance. RANC and its network applications are
implemented and evaluated on universal software radio
peripheral (USRP) software radio platforms. Extensive
experiments confirm that all function blocks of RANC
work effectively without being constrained by the above
limitations. The overall performance of RANC is shown
to approach the ideal case of interference-free
communications. The results of experiments in a real
network setup demonstrate that RANC significantly
outperforms existing ANC schemes and achieves
constraint-free ANC in wireless networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Meng:2016:CBN,
author = "Tong Meng and Fan Wu and Guihai Chen",
title = "Code-based neighbor discovery protocols in mobile
wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "806--819",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In mobile wireless networks, the emerging
proximity-based applications have led to the need for
highly effective and energy-efficient neighbor
discovery protocols. However, existing works cannot
realize the optimal worst-case latency in the symmetric
case, and their performances with asymmetric duty
cycles can still be improved. In this paper, we
investigate asynchronous neighbor discovery through a
code-based approach, including the symmetric and
asymmetric cases. We derive the tight worst-case
latency bound in the case of symmetric duty cycle. We
design a novel class of symmetric patterns called
Diff-Codes, which is optimal when the Diff-Code can be
extended from a perfect difference set. We further
consider the asymmetric case and design ADiff-Codes. To
evaluate (A)Diff-Codes, we conduct both simulations and
testbed experiments. Both simulation and experiment
results show that (A)Diff-Codes significantly
outperform existing neighbor discovery protocols in
both the median case and worst case. Specifically, in
the symmetric case, the maximum worst-case improvement
is up to 50\%; in both symmetric and asymmetric cases,
the median case gain is as high as 30\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joseph:2016:ORA,
author = "Vinay Joseph and Sem Borst and Martin I. Reiman",
title = "Optimal rate allocation for video streaming in
wireless networks with user dynamics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "820--835",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of optimal rate allocation and
admission control for adaptive video streaming sessions
in wireless networks with user dynamics. The central
aim is to achieve an optimal tradeoff between several
key objectives: maximizing the average rate utility per
user, minimizing the temporal rate variability, and
maximizing the number of users supported. We derive
sample path upper bounds for the long-term net utility
rate in terms of either a linear program or a concave
optimization problem, depending on whether the
admissible rate set is discrete or continuous. We then
show that the upper bounds are asymptotically
achievable in large-scale systems by policies which
either deny access to a user or assign it a fixed rate
for its entire session, without relying on any advance
knowledge of the duration. Moreover, the asymptotically
optimal policies exhibit a specific structure, which
allow them to be characterized through just a single
variable, and have the further property that the
induced offered load is unity. We exploit the latter
insights to devise parsimonious online algorithms for
learning and tracking the optimal rate assignments and
establish the convergence of these algorithms.
Extensive simulation experiments demonstrate that the
proposed algorithms perform well, even in relatively
small-scale systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pedarsani:2016:OCC,
author = "Ramtin Pedarsani and Mohammad Ali Maddah-Ali and Urs
Niesen",
title = "Online coded caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "836--845",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a basic content distribution scenario
consisting of a single origin server connected through
a shared bottleneck link to a number of users each
equipped with a cache of finite memory. The users issue
a sequence of content requests from a set of popular
files, and the goal is to operate the caches as well as
the server such that these requests are satisfied with
the minimum number of bits sent over the shared link.
Assuming a basic Markov model for renewing the set of
popular files, we characterize approximately the
optimal long-term average rate of the shared link. We
further prove that the optimal online scheme has
approximately the same performance as the optimal
offline scheme, in which the cache contents can be
updated based on the entire set of popular files before
each new request. To support these theoretical results,
we propose an online coded caching scheme termed coded
least-recently sent (LRS) and simulate it for a demand
time series derived from the dataset made available by
Netflix for the Netflix Prize. For this time series, we
show that the proposed coded LRS algorithm
significantly outperforms the popular least-recently
used caching algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:GGA,
author = "Jinsong Han and Chen Qian and Panlong Yang and Dan Ma
and Zhiping Jiang and Wei Xi and Jizhong Zhao",
title = "{GenePrint}: generic and accurate physical-layer
identification for {UHF RFID} tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "846--858",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Physical-layer identification utilizes unique features
of wireless devices as their fingerprints, providing
authenticity and security guarantee. Prior
physical-layer identification techniques on radio
frequency identification (RFID) tags require nongeneric
equipments and are not fully compatible with existing
standards. In this paper, we propose a novel
physical-layer identification system, GenePrint, for
UHF passive tags. The GenePrint prototype system is
implemented by a commercial reader, a USRP-based
monitor, and off-the-shelf UHF passive tags. Our
solution is generic and completely compatible with the
existing standard, EPCglobal C1G2 specification.
GenePrint leverages the internal similarity among
pulses of tags' RN16 preamble signals to extract a
hardware feature as the fingerprint. We conduct
extensive experiments on over 10 000 RN16 preamble
signals from 150 off-the-shelf RFID tags. The results
show that GenePrint achieves a high identification
accuracy of 99.68\%+. The feature extraction of
GenePrint is resilient to various malicious attacks,
such as the feature replay attack.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2016:CRR,
author = "Kun Xie and Xin Wang and Jigang Wen and Jiannong Cao",
title = "Cooperative routing with relay assignment in
multiradio multihop wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "859--872",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cooperative communication (CC) for wireless networks
has gained a lot of recent interests. It has been shown
that CC has the potential to significantly increase the
capacity of wireless networks, with its ability of
mitigating fading by exploiting spatial diversity.
However, most of the works on CC are limited to single
radio wireless network. To demonstrate the benefits of
CC in multiradio multihop wireless network, this paper
studies a joint problem of multiradio cooperative
routing and relay assignment to maximize the minimum
rate among a set of concurrent communication sessions.
We first model this problem as a mixed-integer
programming (MIP) problem and prove it to be NP-hard.
Then, we propose a centralized algorithm and a
distributed algorithm to solve the problem. The
centralized algorithm is designed within a
branch-and-bound framework by using the relaxation of
the formulated MIP, which can find a global $ (1 +
\varepsilon)$-optimal solution. Our distributed
algorithm includes two subalgorithms: a cooperative
route selection subalgorithm and a fairness-aware route
adjustment subalgorithm. Our simulation results
demonstrate the effectiveness of the proposed
algorithms and the significant rate gains that can be
achieved by incorporating CC in multiradio multihop
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2016:FNB,
author = "Jian Guo and Fangming Liu and John C. S. Lui and Hai
Jin",
title = "Fair network bandwidth allocation in {IaaS}
datacenters via a cooperative game approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "873--886",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With wide application of virtualization technology,
tenants are able to access isolated cloud services by
renting the shared resources in
Infrastructure-as-a-Service (IaaS) datacenters. Unlike
resources such as CPU and memory, datacenter network,
which relies on traditional transport-layer protocols,
suffers unfairness due to a lack of virtual machine
(VM)-level bandwidth guarantees. In this paper, we
model the datacenter bandwidth allocation as a
cooperative game, toward VM-based fairness across the
datacenter with two main objectives: (1) guarantee
bandwidth for VMs based on their base bandwidth
requirements, and (2) share residual bandwidth in
proportion to the weights of VMs. Through a bargaining
game approach, we propose a bandwidth allocation
algorithm, Falloc, to achieve the asymmetric Nash
bargaining solution (NBS) in datacenter networks, which
exactly meets our objectives. The cooperative structure
of the algorithm is exploited to develop an online
algorithm for practical real-world implementation. We
validate Falloc with experiments under diverse
scenarios and show that by adapting to different
network requirements of VMs, Falloc can achieve
fairness among VMs and balance the tradeoff between
bandwidth guarantee and proportional bandwidth sharing.
Our large-scale trace-driven simulations verify that
Falloc achieves high utilization while maintaining
fairness among VMs in datacenters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2016:RTV,
author = "Hongkun Yang and Simon S. Lam",
title = "Real-time verification of network properties using
atomic predicates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "887--900",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network management will benefit from automated tools
based upon formal methods. Several such tools have been
published in the literature. We present a new formal
method for a new tool, Atomic Predicates (AP) Verifier,
which is much more time and space efficient than
existing tools. Given a set of predicates representing
packet filters, AP Verifier computes a set of atomic
predicates, which is minimum and unique. The use of
atomic predicates dramatically speeds up computation of
network reachability. We evaluated the performance of
AP Verifier using forwarding tables and ACLs from three
large real networks. The atomic predicate sets of these
networks were computed very quickly and their sizes are
surprisingly small. Real networks are subject to
dynamic state changes over time as a result of rule
insertion and deletion by protocols and operators,
failure and recovery of links and boxes, etc. In a
software-defined network, the network state can be
observed in real time and thus may be controlled in
real time. AP Verifier includes algorithms to process
such events and check compliance with network policies
and properties in real time. We compare time and space
costs of AP Verifier with Header Space and NetPlumber
using datasets from the real networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Arslan:2016:IIB,
author = "Mustafa Y. Arslan and Karthikeyan Sundaresan and
Srikanth V. Krishnamurthy and Sampath Rangarajan",
title = "{iBUS}: an integrated beamformer and uplink scheduler
for {OFDMA} small cells",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "901--914",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Beamforming is a signal processing technique with
numerous benefits in wireless communication. Unlike
traditional omnidirectional communication, it focuses
the energy of the transmitted and/or the received
signal in a particular direction. Although beamforming
has been extensively studied on conventional systems
such as WiFi, little is known about its practical
impact on performance in orthogonal frequency-domain
multiple access (OFDMA) small-cell deployments. Since
OFDMA schedules multiple clients (users) in the same
frame in contrast to WiFi, designing intelligent
scheduling mechanisms and at the same time leveraging
beamforming is a challenging task. Unlike downlink, we
show that the integration of beamforming with uplink
scheduling projects an interesting tradeoff between
beamforming gain on the one hand, and the power-pooling
gain resulting from joint multiuser scheduling on the
other hand. This, in turn, makes the uplink scheduling
problem even hard to approximate. To address this, we
propose algorithms that are simple to implement, yet
provably efficient with a worst-case guarantee of 1/2.
We implement our algorithms on a real WiMAX small-cell
platform integrated with an eight-element phased-array
beamforming antenna. Evaluations from both prototype
implementation and trace-driven simulations show that
the algorithms deliver throughput gains of over 40\%
compared to an omnidirectional scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sundaresan:2016:FFC,
author = "Karthikeyan Sundaresan and Mustafa Y. Arslan and
Shailendra Singh and Sampath Rangarajan and Srikanth V.
Krishnamurthy",
title = "{FluidNet}: a flexible cloud-based radio access
network for small cells",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "915--928",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cloud-based radio access networks (C-RAN) have been
proposed as a cost-efficient way of deploying small
cells. Unlike conventional RANs, a C-RAN decouples the
baseband processing unit (BBU) from the remote radio
head (RRH), allowing for centralized operation of BBUs
and scalable deployment of light-weight RRHs as small
cells. In this work, we argue that the intelligent
configuration of the front-haul network between the
BBUs and RRHs, is essential in delivering the
performance and energy benefits to the RAN and the BBU
pool, respectively. We propose FluidNet ---a scalable,
light-weight framework for realizing the full potential
of C-RAN. FluidNet deploys a logically re-configurable
front-haul to apply appropriate transmission strategies
in different parts of the network and hence cater
effectively to both heterogeneous user profiles and
dynamic traffic load patterns. FluidNet 's algorithms
determine configurations that maximize the traffic
demand satisfied on the RAN, while simultaneously
optimizing the compute resource usage in the BBU pool.
We prototype FluidNet on a 6 BBU, 6 RRH WiMAX C-RAN
testbed. Prototype evaluations and large-scale
simulations reveal that FluidNet 's ability to
re-configure its front-haul and tailor transmission
strategies provides a 50\% improvement in satisfying
traffic demands, while reducing the compute resource
usage in the BBU pool by 50\% compared to baseline
schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:LCI,
author = "Huiyuan Zhang and Dung T. Nguyen and Huiling Zhang and
My T. Thai",
title = "Least cost influence maximization across multiple
social networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "929--939",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, in online social networks (OSNs), the least
cost influence (LCI) problem has become one of the
central research topics. It aims at identifying a
minimum number of seed users who can trigger a wide
cascade of information propagation. Most of existing
literature investigated the LCI problem only based on
an individual network. However, nowadays users often
join several OSNs such that information could be spread
across different networks simultaneously. Therefore, in
order to obtain the best set of seed users, it is
crucial to consider the role of overlapping users under
this circumstances. In this article, we propose a
unified framework to represent and analyze the
influence diffusion in multiplex networks. More
specifically, we tackle the LCI problem by mapping a
set of networks into a single one via lossless and
lossy coupling schemes. The lossless coupling scheme
preserves all properties of original networks to
achieve high-quality solutions, while the lossy
coupling scheme offers an attractive alternative when
the running time and memory consumption are of primary
concern. Various experiments conducted on both real and
synthesized datasets have validated the effectiveness
of the coupling schemes, which also provide some
interesting insights into the process of influence
propagation in multiplex networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2016:OPC,
author = "Chee Wei Tan",
title = "Optimal power control in {Rayleigh}-fading
heterogeneous wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "940--953",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Heterogeneous wireless networks provide varying
degrees of network coverage in a multi-tier
configuration in which low-powered small cells are used
to enhance performance. Due to the ad-hoc deployment of
small cells, optimal resource allocation is important
to provision fairness and enhance energy efficiency. We
first study the worst outage probability problem in
Rayleigh-fading channels, and solve this nonconvex
stochastic program using mathematical tools from
nonlinear Perron--Frobenius theory. As a by-product, we
solve an open problem of convergence for a previously
proposed algorithm in the interference-limited case. We
then address a total power minimization problem with
outage specification constraints and its feasibility
issue. We propose a dynamic algorithm that adapts the
outage probability specification in a heterogeneous
wireless network to minimize the total energy
consumption and to simultaneously provide fairness
guarantees in terms of the worst outage probability.
Finally, we provide numerical evaluation on the
performance of the algorithms and the effectiveness of
deploying closed-access small cells in heterogeneous
wireless networks to address the tradeoff between
energy saving and feasibility of users satisfying their
outage probability specifications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2016:EDP,
author = "Ying Cui and Edmund M. Yeh and Ran Liu",
title = "Enhancing the delay performance of dynamic
backpressure algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "954--967",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For general multi-hop queueing networks, delay optimal
network control has unfortunately been an outstanding
problem. The dynamic backpressure (BP) algorithm
elegantly achieves throughput optimality, but does not
yield good delay performance in general. In this paper,
we obtain an asymptotically delay optimal control
policy, which resembles the BP algorithm in basing
resource allocation and routing on a backpressure
calculation, but differs from the BP algorithm in the
form of the backpressure calculation employed. The
difference suggests a possible reason for the
unsatisfactory delay performance of the BP algorithm,
i.e., the myopic nature of the BP control. Motivated by
this new connection, we introduce a new class of
enhanced backpressure-based algorithms which
incorporate a general queue-dependent bias function
into the backpressure term of the traditional BP
algorithm to improve delay performance. These enhanced
algorithms exploit queue state information beyond one
hop. We prove the throughput optimality and
characterize the utility-delay tradeoff of the enhanced
algorithms. We further focus on two specific
distributed algorithms within this class, which have
demonstrably improved delay performance as well as
acceptable implementation complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wei:2016:FNC,
author = "Rihua Wei and Yang Xu and H. Jonathan Chao",
title = "Finding nonequivalent classifiers in {Boolean} space
to reduce {TCAM} usage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "968--981",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is one of the major challenges
today in designing high-speed routers and firewalls, as
it involves sophisticated multi-dimensional searching.
Ternary content addressable memory (TCAM) has been
widely used to implement packet classification, thanks
to its parallel search capability and constant
processing speed. However, TCAMs have limitations of
high cost and high power consumption, which ignite the
desire to reduce TCAM usage. Recently, many works have
been presented on this subject due to two
opportunities. One is the well-known range expansion
problem for packet classifiers to be stored in TCAM
entries. The other is that there often exists
redundancy among rules. In this paper, we propose a
novel technique called Block Permutation (BP) to
compress the packet classification rules stored in
TCAMs. Unlike previous schemes that compress
classifiers by converting the original classifiers to
semantically equivalent classifiers, the BP technique
innovatively finds semantically nonequivalent
classifiers to achieve compression by performing
block-based permutations on the rules represented in
Boolean Space. We have developed an efficient heuristic
approach to find permutations for compression and have
designed its hardware implementation by using a
field-programmable gate array (FPGA) to preprocess
incoming packets. Our experiments with ClassBench
classifiers and Internet Service Provider (ISP)
real-life classifiers show that the proposed BP
technique can significantly reduce 31.88\% TCAM entries
on average, in addition to the reduction contributed by
other state-of-the-art schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nair:2016:WHT,
author = "Jayakrishnan Nair and Krishna Jagannathan and Adam
Wierman",
title = "When heavy-tailed and light-tailed flows compete: the
response time tail under generalized max-weight
scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "982--995",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper focuses on the design and analysis of
scheduling policies for multi-class queues, such as
those found in wireless networks and high-speed
switches. In this context, we study the response-time
tail under generalized max-weight policies in settings
where the traffic flows are highly asymmetric.
Specifically, we consider a setting where a bursty
flow, modeled using heavy-tailed statistics, competes
with a more benign, light-tailed flow. In this setting,
we prove that classical max-weight scheduling, which is
known to be throughput optimal, results in the
light-tailed flow having heavy-tailed response times.
However, we show that via a careful design of
inter-queue scheduling policy (from the class of
generalized max-weight policies) and intra-queue
scheduling policies, it is possible to maintain
throughput optimality, and guarantee light-tailed
delays for the light-tailed flow, without affecting the
response-time tail for the heavy-tailed flow.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pedersen:2016:EMV,
author = "Hasti A. Pedersen and Sujit Dey",
title = "Enhancing mobile video capacity and quality using rate
adaptation, {RAN} caching and processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "996--1010",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Adaptive Bit Rate (ABR) streaming has become a popular
video delivery technique, credited with improving
Quality of Experience (QoE) of videos delivered on
wireless networks. Recent independent research reveals
video caching in the Radio Access Network (RAN) holds
promise for increasing the network capacity and
improving video QoE. In this paper, we investigate
opportunities and challenges of combining the
advantages of ABR and RAN caching to increase the video
capacity and QoE of the wireless networks. While each
ABR video is divided into multiple chunks that can be
requested at different bit rates, a cache hit requires
the presence of a specific chunk at a desired bit rate,
making ABR-aware RAN caching challenging. To address
this without having to cache all bit rate versions of a
video, we propose adding limited processing capacity to
each RAN cache. This enables transrating a higher rate
version that may be available in the cache, to satisfy
a request for a lower rate version, and joint caching
and processing policies that leverage the back-haul,
caching, and processing resources most effectively,
thereby maximizing video capacity of the network. We
also propose a novel rate adaptation algorithm that
uses video characteristics to simultaneously change the
video encoding and transmission rate. The results of
extensive statistical simulations demonstrate the
effectiveness of our approaches in achieving
significant capacity gain over ABR or RAN caching
alone, as well as other ways of enabling ABR-aware RAN
caching, while improving video QoE.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2016:PVI,
author = "Mingchen Zhao and Wenchao Zhou and Alexander J. T.
Gurney and Andreas Haeberlen and Micah Sherr and Boon
Thau Loo",
title = "Private and verifiable interdomain routing decisions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1011--1024",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Existing secure interdomain routing protocols can
verify validity properties about individual routes,
such as whether they correspond to a real network path.
It is often useful to verify more complex properties
relating to the route decision procedure --- for
example, whether the chosen route was the best one
available, or whether it was consistent with the
network's peering agreements. However, this is
difficult to do without knowing a network's routing
policy and full routing state, which are not normally
disclosed. In this paper, we show how a network can
allow its peers to verify a number of nontrivial
properties of its interdomain routing decisions without
revealing any additional information. If all the
properties hold, the peers learn nothing beyond what
the interdomain routing protocol already reveals; if a
property does not hold, at least one peer can detect
this and prove the violation. We present SPIDeR, a
practical system that applies this approach to the
Border Gateway Protocol, and we report results from an
experimental evaluation to demonstrate that SPIDeR has
a reasonable overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2016:EDO,
author = "Han Cai and Irem Koprulu and Ness B. Shroff",
title = "Exploiting double opportunities for
latency-constrained content propagation in wireless
networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1025--1037",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we focus on a mobile wireless network
comprising a powerful communication center and a
multitude of mobile users. We investigate the
propagation of latency-constrained content in the
wireless network characterized by heterogeneous
(time-varying and user-dependent) wireless channel
conditions, heterogeneous user mobility, and where
communication could occur in a hybrid format (e.g.,
directly from the central controller or by exchange
with other mobiles in a peer-to-peer manner). We show
that exploiting double opportunities, i.e., both
time-varying channel conditions and mobility, can
result in substantial performance gains. We develop a
class of double opportunistic multicast schedulers and
prove their optimality in terms of both utility and
fairness under heterogeneous channel conditions and
user mobility. Extensive simulation results are
provided to demonstrate that these algorithms can not
only substantially boost the throughput of all users
(e.g., by 50\% to 150\%), but also achieve different
consideration of fairness among individual users and
groups of users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:TLB,
author = "Tao Han and Nirwan Ansari",
title = "A traffic load balancing framework for
software-defined radio access networks powered by
hybrid energy sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1038--1051",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Dramatic mobile data traffic growth has spurred a
dense deployment of small cell base stations (SCBSs).
Small cells enhance the spectrum efficiency and thus
enlarge the capacity of mobile networks. Although SCBSs
consume much less power than macro BSs (MBSs) do, the
overall power consumption of a large number of SCBSs is
phenomenal. As the energy harvesting technology
advances, base stations (BSs) can be powered by green
energy to alleviate the on-grid power consumption. For
mobile networks with high BS density, traffic load
balancing is critical in order to exploit the capacity
of SCBSs. To fully utilize harvested energy, it is
desirable to incorporate the green energy utilization
as a performance metric in traffic load balancing
strategies. In this paper, we have proposed a traffic
load balancing framework that strives a balance between
network utilities, e.g., the average traffic delivery
latency, and the green energy utilization. Various
properties of the proposed framework have been derived.
Leveraging the software-defined radio access network
architecture, the proposed scheme is implemented as a
virtually distributed algorithm, which significantly
reduces the communication overheads between users and
BSs. The simulation results show that the proposed
traffic load balancing framework enables an adjustable
trade-off between the on-grid power consumption and the
average traffic delivery latency, and saves a
considerable amount of on-grid power, e.g., 30\%, at a
cost of only a small increase, e.g., 8\%, of the
average traffic delivery latency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:FSC,
author = "Wei Gong and Ivan Stojmenovic and Amiya Nayak and
Kebin Liu and Haoxiang Liu",
title = "Fast and scalable counterfeits estimation for
large-scale {RFID} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1052--1064",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many algorithms have been introduced to
deterministically authenticate Radio Frequency
Identification (RFID) tags, while little work has been
done to address scalability issue in batch
authentications. Deterministic approaches verify tags
one by one, and the communication overhead and time
cost grow linearly with increasing size of tags. We
design a fast and scalable counterfeits estimation
scheme, INformative Counting (INC), which achieves
sublinear authentication time and communication cost in
batch verifications. The key novelty of INC builds on
an FM-Sketch variant authentication synopsis that can
capture key counting information using only sublinear
space. With the help of this well-designed data
structure, INC is able to provide authentication
results with accurate estimates of the number of
counterfeiting tags and genuine tags, while previous
batch authentication methods merely provide 0/1 results
indicating the existence of counterfeits. We conduct
detailed theoretical analysis and extensive experiments
to examine this design and the results show that INC
significantly outperforms previous work in terms of
effectiveness and efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2016:CBS,
author = "Chandramani Singh and Anurag Kumar and Rajesh
Sundaresan",
title = "Combined base station association and power control in
multichannel cellular networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1065--1080",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A combined base station association and power control
problem is studied for the uplink of multichannel
multicell cellular networks, in which each channel is
used by exactly one cell (i.e., base station). A
distributed association and power update algorithm is
proposed and shown to converge to a Nash equilibrium of
a noncooperative game. We consider network models with
discrete mobiles (yielding an atomic congestion game),
as well as a continuum of mobiles (yielding a
population game). We find that the equilibria need not
be Pareto efficient, nor need they be system optimal.
To address the lack of system optimality, we propose
pricing mechanisms. It is shown that these mechanisms
can be implemented in a distributed fashion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shin:2016:RCE,
author = "Dong-Hoon Shin and Shibo He and Junshan Zhang",
title = "Robust and cost-effective design of cyber-physical
systems: an optimal middleware deployment approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1081--1094",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cyber-Physical Systems (CPS) are emerging as the
underpinning technology for major industries in this
century. Wide-area monitoring and control is an
essential ingredient of CPS to ensure reliability and
security. Traditionally, a hierarchical system has been
used to monitor and control remote devices deployed in
a large geographical region. However, a general
consensus is that such a hierarchical system can be
highly vulnerable to component (i.e., nodes and links)
failures, calling for a robust and cost-effective
communication system for CPS. To this end, we consider
a middleware approach to leverage the existing
commercial communication infrastructure (e.g., Internet
and cellular networks) with abundant connectivity. In
this approach, a natural question is how to use the
middleware to cohesively ``glue'' the physical system
and the commercial communication infrastructure
together, in order to enhance robustness and
cost-effectiveness. We tackle this problem while taking
into consideration two different cases of middleware
deployment: single-stage and multi-stage deployments.
We design offline and online algorithms for these two
cases, respectively. We show that the offline algorithm
achieves the best possible approximation ratio while
the online algorithm attains the order-optimal
competitive ratio. We also demonstrate the performance
of our proposed algorithms through simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2016:SSW,
author = "Sang-Yoon Chang and Yih-Chun Hu and Nicola Laurenti",
title = "{SimpleMAC}: a simple wireless {MAC}-layer
countermeasure to intelligent and insider jammers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1095--1108",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless networks, users share a transmission
medium. For efficient channel use, wireless systems
often use a Medium Access Control (MAC) protocol to
perform channel coordination by having each node
announce its usage intentions and other nodes avoid
making conflicting transmissions. Traditionally, such
announcements are made on a common control channel.
However, this control channel is vulnerable to jamming
because its location is pre-assigned and known to
attackers. Furthermore, the announcements themselves
provide information useful for jamming. We focus on a
situation where transmitters share spectrum in the
presence of intelligent and insider jammers capable of
adaptively changing their jamming patterns. Despite the
complex threat model, we propose a simple MAC scheme,
called SimpleMAC, that effectively counters network
compromise and MAC-aware jamming attacks. We then study
the optimal adversarial behavior and analyze the
performance of the proposed scheme theoretically,
through Monte Carlo simulations, and by implementation
on the WARP software-defined radio platform. In
comparison to the Nash equilibrium alternative of
disabling the MAC protocol, SimpleMAC quickly attains
vastly improved performance and converges to the
optimal solution (over six-fold improvement in SINR and
50\% gains in channel capacity in a realistic mobile
scenario).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Agrawal:2016:EIU,
author = "Gaurav Agrawal and Deep Medhi",
title = "Embedding {IP} unique shortest path topology on a
wavelength-routed network: normal and survivable
design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1109--1124",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we address the network virtualization
problem of embedding a unique shortest path-based IP
topology using lightpaths in a wavelength-routed
network. We present an integer linear programming
formulation and propose a 2-phase heuristic approach to
solve this problem. We extend the model and the
heuristic by addressing survivability in an integrated
cross-layer framework, where the objective is to
allocate a light-path topology that remains connected
in the event of any single physical link failure while
providing the IP network with unique shortest paths for
all node-pairs. We consider a number of measures to
show effectiveness of our approach and to discuss the
impact on normal and survivable topology design, in
terms of the number of transreceivers deployed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2016:TBM,
author = "Dao-Yuan Chang and Pi-Chung Wang",
title = "{TCAM}-based multi-match packet classification using
multidimensional rule layering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1125--1138",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ternary content addressable memory (TCAM) has superior
performance for single-match packet classification but
not the case for multi-match packet classification. The
limitation is caused by TCAM architecture that reports
only the first matching rule. To cope with the
limitation, previous algorithms use extra TCAM entries
or accesses, or both, to fulfill multi-match packet
classification. These algorithms also reorder rules;
thus, a multi-match classifier based on these
algorithms cannot maintain performance for single-match
packet classification. In other words, all matching
rules must be yielded to determine the highest priority
matching rule. In this paper, we present a TCAM-based
scheme for multi-match packet classification without
single-match penalty. Our scheme partitions a rule set
based on range layering, which can be applied to
achieve range encoding. The rule partitioning generates
rule subsets which satisfy that the rules in a subset
are mutually disjoint. Each rule is then tagged a
bitmap for subset identification to fulfill multi-match
packet classification. Two approaches, loose coupling
and tight coupling, are derived with different search
procedures while incorporating range encoding. Both
approaches can maintain original rule order, but with
different performance tradeoff. We also present a
refinement which uses all available TCAM entries to
improve the performance of multi-match packet
classification. The experimental results show that
combining range encoding with multi-match packet
classification has advantages of storage efficiency and
speed superiority. The capability of supporting
single-match packet classification also provides better
flexibility of applying different packet actions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2016:OSC,
author = "Xuanyu Cao and Jinbei Zhang and Luoyi Fu and Weijie Wu
and Xinbing Wang",
title = "Optimal secrecy capacity-delay tradeoff in large-scale
mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1139--1152",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the impact of
information-theoretic secrecy constraint on the
capacity and delay of mobile ad hoc networks (MANETs)
with mobile legitimate nodes and static eavesdroppers
whose location and channel state information (CSI) are
both unknown. We assume n legitimate nodes move
according to the fast i.i.d. mobility pattern and each
desires to communicate with one randomly selected
destination node. There are also n$^v$ static
eavesdroppers located uniformly in the network and we
assume the number of eavesdroppers is much larger than
that of legitimate nodes, i.e., $ v > 1$. We propose a
novel simple secure communication model, i.e., the
secure protocol model, and prove its equivalence to the
widely accepted secure physical model under a few
technical assumptions. Based on the proposed model, a
framework of analyzing the secrecy capacity and delay
in MANETs is established. Given a delay constraint $D$,
we find that the optimal secrecy throughput capacity is
[EQUATION] $ (W ((D / n))^{(2 / 3)})$, where $W$ is the
data rate of each link. We observe that: (1) the
capacity-delay tradeoff is independent of the number of
eavesdroppers, which indicates that adding more
eavesdroppers will not degenerate the performance of
the legitimate network as long as $ v > 1$; (2) the
capacity-delay tradeoff of our paper outperforms the
previous result $ \Theta ((1 / n \psi_e))$ in [11],
where $ \psi_e = n^{v - 1} = \omega (1)$ is the density
of the eavesdroppers. Throughout this paper, for
functions $ f (n)$ and $ G (n)$, we denote $ f (n) = o
(g (n))$ if $ \lim_{n \rightarrow \infty } (f (n) / g
(n)) = 0$; $ f (n) = \omega (g (n))$ if $ g (n) = o (f
(n))$; $ f (n) = O (g (n))$ if there is a positive
constant $c$ such that $ f (n) \le c g (n)$ for
sufficiently large $n$; $ f (n) = \Omega (g (n))$ if $
g (n) = O (f (n))$; $ f (n) = \Theta (g (n))$ if both $
f (n) = O (g (n))$ and $ f (n) = \Omega (g (n))$ hold.
Besides, the order notation [EQUATION] omits the
polylogarithmic factors for better readability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guan:2016:TTD,
author = "Zhangyu Guan and Tommaso Melodia and Gesualdo
Scutari",
title = "To transmit or not to transmit?: distributed queueing
games in infrastructureless wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1153--1166",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study distributed queueing games in
interference-limited wireless networks. We formulate
the throughput maximization problem via distributed
selection of users' transmission thresholds as a Nash
Equilibrium Problem (NEP). We first focus on the
solution analysis of the NEP and derive sufficient
conditions for the existence and uniqueness of a Nash
Equilibrium (NE). Then, we develop a general
best-response-based algorithmic framework wherein the
users can explicitly choose the degree of desired
cooperation and signaling, converging to different
types of solutions, namely: (1) a NE of the NEP when
there is no cooperation among users and (2) a
stationary point of the Network Utility Maximization
(NUM) problem associated with the NEP, when some
cooperation among the users in the form of (pricing)
message passing is allowed. Finally, as a benchmark, we
design a globally optimal but centralized solution
method for the nonconvex NUM problem. Our experiments
show that in many scenarios the sum-throughput at the
NE of the NEP is very close to the global optimum of
the NUM problem, which validates our noncooperative and
distributed approach. When the gap of the NE from the
global optimality is non negligible (e.g., in the
presence of ``high'' coupling among users), exploiting
cooperation among the users in the form of pricing
enhances the system performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhorkar:2016:ORC,
author = "Abhijeet Bhorkar and Mohammad Naghshvar and Tara
Javidi",
title = "Opportunistic routing with congestion diversity in
wireless ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1167--1180",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of routing packets across a
multi-hop network consisting of multiple sources of
traffic and wireless links while ensuring bounded
expected delay. Each packet transmission can be
overheard by a random subset of receiver nodes among
which the next relay is selected opportunistically. The
main challenge in the design of minimum-delay routing
policies is balancing the trade-off between routing the
packets along the shortest paths to the destination and
distributing the traffic according to the maximum
backpressure. Combining important aspects of shortest
path and backpressure routing, this paper provides a
systematic development of a distributed opportunistic
routing policy with congestion diversity (D-ORCD).
D-ORCD uses a measure of draining time to
opportunistically identify and route packets along the
paths with an expected low overall congestion. D-ORCD
with single destination is proved to ensure a bounded
expected delay for all networks and under any
admissible traffic, so long as the rate of computations
is sufficiently fast relative to traffic statistics.
Furthermore, this paper proposes a practical
implementation of D-ORCD which empirically optimizes
critical algorithm parameters and their effects on
delay as well as protocol overhead. Realistic QualNet
simulations for 802.11-based networks demonstrate a
significant improvement in the average delay over
comparable solutions 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{Sarikaya:2016:DNC,
author = "Yunus Sarikaya and C. Emre Koksal and Ozgur Ercetin",
title = "Dynamic network control for confidential multi-hop
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1181--1195",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of resource allocation and
control of multihop networks in which multiple
source-destination pairs communicate confidential
messages, to be kept confidential from the intermediate
nodes. We pose the problem as that of network utility
maximization, into which confidentiality is
incorporated as an additional quality of service
constraint. We develop a simple, and yet provably
optimal dynamic control algorithm that combines flow
control, routing and end-to-end secrecy-encoding. In
order to achieve confidentiality, our scheme exploits
multipath diversity and temporal diversity due to
channel variability. Our end-to-end dynamic encoding
scheme encodes confidential messages across multiple
packets, to be combined at the ultimate destination for
recovery. We first develop an optimal dynamic policy
for the case in which the number of blocks across which
secrecy encoding is performed is asymptotically large.
Next, we consider encoding across a finite number of
packets, which eliminates the possibility of achieving
perfect secrecy. For this case, we develop a dynamic
policy to choose the encoding rates for each message,
based on the instantaneous channel state information,
queue states and secrecy outage requirements. By
numerical analysis, we observe that the proposed scheme
approaches the optimal rates asymptotically with
increasing block size. Finally, we address the
consequences of practical implementation issues such as
infrequent queue updates and decentralized scheduling.
We demonstrate the efficacy of our policies by
numerical studies under various network conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alresaini:2016:BDE,
author = "Majed Alresaini and Kwame-Lante Wright and Bhaskar
Krishnamachari and Michael J. Neely",
title = "Backpressure delay enhancement for encounter-based
mobile networks while sustaining throughput
optimality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1196--1208",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Backpressure routing, in which packets are
preferentially transmitted over links with high queue
differentials, offers the promise of throughput-optimal
operation for a wide range of communication networks.
However, when traffic load is low, backpressure methods
suffer from long delays. This is of particular concern
in intermittent encounter-based mobile networks which
are already delay-limited due to the sparse and highly
dynamic network connectivity. While state of the art
mechanisms for such networks have proposed the use of
redundant transmissions to improve delay, they do not
work well when traffic load is high. In this paper we
propose backpressure with adaptive redundancy (BWAR), a
novel hybrid approach that provides the best of both
worlds. This approach is robust, distributed, and does
not require any prior knowledge of network load
conditions. We also present variants of BWAR that
remove redundant packets via a timeout mechanism, and
that improve energy use. These algorithms are evaluated
by mathematical analysis and by simulations of real
traces of taxis in Beijing, China. The simulations
confirm that BWAR outperforms traditional backpressure
at low load, while outperforming encounter-routing
schemes (Spray and Wait and Spray and Focus) at high
load.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tu:2016:DPC,
author = "Guan-Hua Tu and Yuanjie Li and Chunyi Peng and Chi-Yu
Li and Songwu Lu",
title = "Detecting problematic control-plane protocol
interactions in mobile networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1209--1222",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The control-plane protocols in 3G/4G mobile networks
communicate with each other, and provide a rich set of
control functions, such as radio resource control,
mobility support, connectivity management, to name a
few. Despite their significance, the problem of
verifying protocol correctness remains largely
unaddressed. In this paper, we examine control-plane
protocol interactions in mobile networks. We propose
CNetVerifier, a two-phase signaling diagnosis tool to
detect problematic interactions in both design and
practice. CNetVerifier first performs protocol
screening based on 3GPP standards via domain-specific
model checking, and then conducts phone-based empirical
validation in operational 3G/4G networks. With
CNetVerifier, we have uncovered seven types of
troublesome interactions, along three dimensions of
cross (protocol) layers, cross (circuit-switched and
packet-switched) domains, and cross (3G and 4G)
systems. Some are caused by necessary yet problematic
cooperation (i.e., protocol interactions are needed but
they misbehave), whereas others are due to independent
yet unnecessary coupled operations (i.e., protocols
interactions are not required but actually coupled).
These instances span both design defects in 3GPP
standards and operational slips by carriers and
vendors. They all result in performance penalties or
functional incorrectness. We deduce root causes,
present empirical results, propose solutions, and
summarize learned lessons.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Anand:2016:EVA,
author = "Ashok Anand and Athula Balachandran and Aditya Akella
and Vyas Sekar and Srinivasan Seshan",
title = "Enhancing video accessibility and availability using
information-bound references",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1223--1236",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Users are often frustrated when they cannot view video
links shared via blogs, social networks, and shared
bookmark sites on their devices or suffer performance
and usability problems when doing so. While other
versions of the same content better suited to their
device and network constraints may be available on
other third-party hosting sites, these remain unusable
because users cannot efficiently discover these and
verify that these variants match the content
publisher's original intent. Our vision is to enable
consumers to leverage verifiable alternatives from
different hosting sites that are best suited to their
constraints to deliver a high quality of experience and
enable content publishers to reach a wide audience with
diverse operating conditions with minimal upfront
costs. To this end, we make a case for
information-bound references or IBRs that bind
references to video content to the underlying
information that a publisher wants to convey, decoupled
from details such as protocols, hosts, file names, or
the underlying bits. This paper addresses key
challenges in the design and implementation of IBR
generation and resolution mechanisms, and presents an
evaluation of the benefits IBRs offer.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lutu:2016:BVT,
author = "Andra Lutu and Marcelo Bagnulo and Cristel Pelsser and
Olaf Maennel and Jesus Cid-Sueiro",
title = "The {BGP} visibility toolkit: detecting anomalous
{Internet} routing behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1237--1250",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose the BGP Visibility Toolkit,
a system for detecting and analyzing anomalous behavior
in the Internet. We show that interdomain prefix
visibility can be used to single out cases of erroneous
demeanors resulting from misconfiguration or bogus
routing policies. The implementation of routing
policies with BGP is a complicated process, involving
fine-tuning operations and interactions with the
policies of the other active ASes. Network operators
might end up with faulty configurations or unintended
routing policies that prevent the success of their
strategies and impact their revenues. As part of the
Visibility Toolkit, we propose the BGP Visibility
Scanner, a tool which identifies limited visibility
prefixes in the Internet. The tool enables operators to
provide feedback on the expected visibility status of
prefixes. We build a unique set of ground-truth
prefixes qualified by their ASes as intended or
unintended to have limited visibility. Using a machine
learning algorithm, we train on this unique dataset an
alarm system that separates with 95\% accuracy the
prefixes with unintended limited visibility. Hence, we
find that visibility features are generally powerful to
detect prefixes which are suffering from inadvertent
effects of routing policies. Limited visibility could
render a whole prefix globally unreachable. This points
towards a serious problem, as limited reachability of a
non-negligible set of prefixes undermines the global
connectivity of the Internet. We thus verify the
correlation between global visibility and global
connectivity of prefixes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kogan:2016:EOI,
author = "Kirill Kogan and Sergey I. Nikolenko and Ori
Rottenstreich and William Culhane and Patrick Eugster",
title = "Exploiting order independence for scalable and
expressive packet classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1251--1264",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient packet classification is a core concern for
network services. Traditional multi-field
classification approaches, in both software and ternary
content-addressable memory (TCAMs), entail tradeoffs
between (memory) space and (lookup) time. TCAMs cannot
efficiently represent range rules, a common class of
classification rules confining values of packet fields
to given ranges. The exponential space growth of TCAM
entries relative to the number of fields is exacerbated
when multiple fields contain ranges. In this work, we
present a novel approach which identifies properties of
many classifiers which can be implemented in linear
space and with worst-case guaranteed logarithmic time
and allows the addition of more fields including range
constraints without impacting space and time
complexities. On real-life classifiers from Cisco
Systems and additional classifiers from ClassBench
(with real parameters), 90--95\% of rules are thus
handled, and the other 5--10\% of rules can be stored
in TCAM to be processed in parallel.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2016:DSA,
author = "Shizhen Zhao and Xiaojun Lin",
title = "Design of scheduling algorithms for end-to-end backlog
minimization in wireless multi-hop networks under
$k$-hop interference models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1265--1278",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of link scheduling
for multi-hop wireless networks with per-flow delay
constraints under the K -hop interference model.
Specifically, we are interested in algorithms that
maximize the asymptotic decay-rate of the probability
with which the maximum end-to-end backlog among all
flows exceeds a threshold, as the threshold becomes
large. We provide both positive and negative results in
this direction. By minimizing the drift of the maximum
end-to-end backlog in the converge-cast on a tree, we
design an algorithm, Largest-Weight-First (LWF), that
achieves the optimal asymptotic decay-rate for the
overflow probability of the maximum end-to-end backlog
as the threshold becomes large. However, such a drift
minimization algorithm may not exist for general
networks. We provide an example in which no algorithm
can minimize the drift of the maximum end-to-end
backlog. Finally, we simulate the LWF algorithm
together with a well known algorithm (the back-pressure
algorithm) and a large-deviations optimal algorithm in
terms of the sum-queue (the P-TREE algorithm) in
converge-cast networks. Our simulation shows that our
algorithm performs significantly better not only in
terms of asymptotic decay-rate, but also in terms of
the actual overflow probability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:LHS,
author = "Qingsi Wang and Mingyan Liu",
title = "Learning in hide-and-seek",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1279--1292",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Existing work on pursuit-evasion problems typically
either assumes stationary or heuristic behavior of one
side and examines countermeasures of the other, or
assumes both sides to be strategic which leads to a
game theoretical framework. Results from the former
often lack robustness against changes in the
adversarial behavior, while those from the second
category, typically as equilibrium solution concepts,
may be difficult to justify: either due to the implied
knowledge of other players' actions/beliefs and
knowledge of their knowledge, or due to a lack of
efficient dynamics to achieve such equilibria. In this
paper, we take a different approach by assuming an
intelligent pursuer/evader that is adaptive to the
information available to it and is capable of learning
over time with performance guarantee. Within this
context we investigate two cases. In the first case we
assume either the evader or the pursuer is aware of the
type of learning algorithm used by the opponent, while
in the second case neither side has such information
and thus must try to learn. We show that the optimal
policies in the first case have a greedy nature. This
result is then used to assess the performance of the
learning algorithms that both sides employ in the
second case, which is shown to be mutually optimal and
there is no loss for either side compared to the case
when it knows perfectly the adaptive pattern used by
the adversary and responses optimally. We further
extend our model to study the application of jamming
defense.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:PCU,
author = "Alex X. Liu and Chad R. Meiners and Eric Torng",
title = "Packet classification using binary content addressable
memory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1295--1307",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
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 devices. Although using ternary
content addressable memory (TCAM) to perform high-speed
packet classification has become the widely adopted
solution, TCAM is very expensive, has limited capacity,
consumes large amounts of power, and generates
tremendous amounts of heat because of their extremely
dense and parallel circuitry. In this paper, we propose
the first packet classification scheme that uses binary
CAM (BCAM). BCAM is similar to TCAM except that in
BCAM, every bit has only two possible states: 0 or 1;
in contrast, in TCAM, every bit has three possible
states: 0, 1, or * (don't care). Because of the high
complexity in implementing the extra ``don't care''
state, TCAM has much higher circuit density than BCAM.
As the power consumption, heat generation, and price
grow non-linearly with circuit density, BCAM consumes
much less power, generates much less heat, and costs
much less money than TCAM. Our BCAM-based packet
classification scheme is built on two key ideas. First,
we break a multi-dimensional lookup into a series of
1-D lookups. Second, for each 1-D lookup, we convert
the ternary matching problem into a binary string exact
matching problem. To speed up the lookup process, we
propose a number of optimization techniques, including
skip lists, free expansion, minimizing maximum lookup
time, minimizing average lookup time, and lookup short
circuiting. We evaluated our BCAM scheme on 17
real-life packet classifiers. On these classifiers, our
BCAM scheme requires roughly five times fewer CAM bits
than the traditional TCAM-based scheme. The penalty is
a throughput that is roughly four times less.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shafiq:2016:COC,
author = "M. Zubair Shafiq and Lusheng Ji and Alex X. Liu and
Jeffrey Pang and Shobha Venkataraman and Jia Wang",
title = "Characterizing and optimizing cellular network
performance during crowded events",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1308--1321",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "During crowded events, cellular networks face voice
and data traffic volumes that are often orders of
magnitude higher than what they face during routine
days. Despite the use of portable base stations for
temporarily increasing communication capacity and free
Wi-Fi access points for offloading Internet traffic
from cellular base stations, crowded events still
present significant challenges for cellular network
operators looking to reduce dropped call events and
improve Internet speeds. For an effective cellular
network design, management, and optimization, it is
crucial to understand how cellular network performance
degrades during crowded events, what causes this
degradation, and how practical mitigation schemes would
perform in real-life crowded events. This paper makes a
first step toward this end by characterizing the
operational performance of a tier-1 cellular network in
the U.S. during two high-profile crowded events in
2012. We illustrate how the changes in population
distribution, user behavior, and application workload
during crowded events result in significant voice and
data performance degradation, including more than two
orders of magnitude increase in connection failures.
Our findings suggest two mechanisms that can improve
performance without resorting to costly infrastructure
changes: radio resource allocation tuning and
opportunistic connection sharing. Using trace-driven
simulations, we show that more aggressive release of
radio resources via 1-2 s shorter radio resource
control timeouts as compared with routine days helps to
achieve better tradeoff between wasted radio resources,
energy consumption, and delay during crowded events,
and opportunistic connection sharing can reduce
connection failures by 95\% when employed by a small
number of devices in each cell sector.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kwon:2016:TSP,
author = "Soongeol Kwon and Natarajan Gautam",
title = "Time-stable performance in parallel queues with
non-homogeneous and multi-class workloads",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1322--1335",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by applications in data centers, we consider
a scenario where multiple classes of requests arrive at
a dispatcher at time-varying rates which historically
has daily or weekly patterns. We assume that the
underlying environment is such that at all times the
load from each class is very high and a large number of
servers are necessary which, for example, is fairly
common in many data centers. In addition, each server
can host one or more classes. Design, control and
performance analysis under such heterogeneous and
transient conditions is extremely difficult. To address
this shortcoming we have suggested a holistic approach
that includes a combination of sizing, assignment, and
routing in an integrated fashion. Our proposed approach
decomposes a multidimensional and non-stationary
problem into a one-dimensional, simpler and stationary
one, and achieves time-stability by introducing an
insignificant number of dummy requests. Based on
time-stability, our suggested approach can provide
performance bounds and guarantees for time-varying and
transient system. Moreover, we can operate the data
centers in an energy-efficient manner via suggested
approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gopalan:2016:IFR,
author = "Abishek Gopalan and Srinivasan Ramasubramanian",
title = "{IP} fast rerouting and disjoint multipath routing
with three edge-independent spanning trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1336--1349",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop approaches for disjoint multipath routing
and fast recovery in IP networks that guarantee
recovery from arbitrary two link failures. We achieve
this by developing the first known algorithm to
construct three edge-independent spanning trees, which
has a running time complexity of. The property of these
trees is that the paths from a source to the
destination on the trees are mutually link-disjoint. We
illustrate how the three edge-independent trees rooted
at a destination may be employed to achieve multipath
routing and IP fast recovery. We discuss different ways
of employing the trees. The routing of packets is based
on the destination address and the input interface over
which the packet was received. If the trees are
employed exclusively for multipath routing, then no
packet overhead is required. If the trees are employed
for failure recovery, then the overhead bits will range
from 0 to 2 bits depending on the flexibility sought in
routing. We evaluate the performance of the trees in
fast recovery by comparing the path lengths provided
under single- and dual-link failures with an earlier
approach based on tunneling. We also evaluate the
performance of the trees when used for multipath
routing and compare it to equal-cost multipaths
(ECMP).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qin:2016:MWD,
author = "Yi Qin and Xiaohua Tian and Weijie Wu and Xinbing
Wang",
title = "Mobility weakens the distinction between multicast and
unicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1350--1363",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Comparing with the unicast technology, multiple flows
from the same source in multicast scenario can be
aggregated even if their destinations are different.
This paper evaluates such distinction by the multicast
gain on per-node capacity and delay, which are defined
as the per-node capacity and delay ratios between
multi-unicast and multicast ( m destinations for each
multicast session). Particularly, the restricted
mobility model is proposed, which is a representative
mobility model characterizing a class of mobility
models with different average moving speeds. The
theoretical analysis of this model indicates that the
mobility significantly decreases the multicast gain on
per-node capacity and delay, though the per-node
capacity of both unicast and multicast can be enhanced
by mobility. This finding suggests that mobility
weakens the distinction between multicast and unicast.
Finally, a general framework of multicast study is
constituted by analyzing the upper-bound ($ \Theta
(m)$), the lower-bound ($ \Theta (1)$) and the main
determinants of the multicast gain on both per-node
capacity and delay regardless of mobility model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2016:QAR,
author = "Yu Lu and Mehul Motani and Wai-Choong Wong",
title = "A {QoE}-aware resource distribution framework
incentivizing context sharing and moderate
competition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1364--1377",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We contend that context information of Internet
clients can help to efficiently manage a variety of
underlying resources for different Internet services
and systems. We therefore propose a resource
distribution framework that provides quality of
experience (QoE) aware service differentiation, which
means that starving clients are prioritized in resource
allocation to enhance the corresponding end-user's QoE.
The framework also actively motivates each Internet
client to consistently provide its actual context
information and to adopt moderate competition policies,
given that all clients are selfish but rational in
nature. We analyze the Internet client's behavior by
formulating a non-cooperative game and prove that the
framework guides all clients (game players) towards a
unique Nash equilibrium. Furthermore, we prove that the
distribution results computed by the framework maximize
a social welfare function. Throughout this paper, we
demonstrate the motivation, operation and performance
of the framework by presenting a Web system example,
which leverages on the advanced context information
deduced by a context-aware system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{La:2016:ISS,
author = "Richard J. La",
title = "Interdependent security with strategic agents and
cascades of infection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1378--1391",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate cascades in networks consisting of
strategic agents with interdependent security. We
assume that the strategic agents have choices between
(i) investing in protecting themselves, (ii) purchasing
insurance to transfer (some) risks, and (iii) taking no
actions. Using a population game model, we study how
various system parameters, such as node degrees,
infection propagation rate, and the probability with
which infected nodes transmit infection to neighbors,
affect nodes' choices at Nash equilibria and the
resultant price of anarchy/stability. In addition, we
examine how the probability that a single infected node
can spread the infection to a significant portion of
the entire network, called cascade probability, behaves
with respect to system parameters. In particular, we
demonstrate that, at least for some parameter regimes,
the cascade probability increases with the average
degree of nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2016:SSP,
author = "Yi Gao and Wei Dong and Wenbin Wu and Chun Chen and
Xiang-Yang Li and Jiajun Bu",
title = "{Scalpel}: scalable preferential link tomography based
on graph trimming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1392--1403",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inferring per-link metrics through aggregated path
measurements, known as network tomography, is an
effective way to facilitate various network operations,
such as network monitoring, load balancing, and fault
diagnosis. We study the problem of identifying additive
link metrics of a set of interesting links from
end-to-end cycle-free path measurements among selected
monitors, i.e., preferential link tomography. Since
assigning a node as a monitor usually requires
non-negligible operational cost, we focus on assigning
the minimum number of monitors (i.e., optimal monitor
assignment) to identify all interesting links. By
modeling the network as a connected graph, we propose
Scalpel, a scalable preferential link tomography
approach. Scalpel trims the original graph by a
two-stage graph trimming algorithm and reuses an
existing method to assign monitors in the trimmed
graph. We theoretically prove Scalpel has several key
properties: (1) the graph trimming algorithm in Scalpel
is minimal in the sense that further trimming the graph
does not reduce the number of monitors; (2) the
obtained assignment is able to identify all interesting
links in the original graph; and (3) an optimal monitor
assignment in the graph after trimming is also an
optimal monitor assignment in the original graph. We
implement Scalpel and evaluate it based on both
synthetic topologies and real network topologies.
Compared with state-of-the-art, Scalpel reduces the
number of monitors by 39.0\% to 98.6\% when 50\% to 1\%
of all links are interesting links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:JCC,
author = "Jia Liu and Ness B. Shroff and Cathy H. Xia and Hanif
D. Sherali",
title = "Joint congestion control and routing optimization: an
efficient second-order distributed approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1404--1420",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed joint congestion control and routing
optimization has received a significant amount of
attention recently. To date, however, most of the
existing schemes follow a key idea called the
back-pressure algorithm. Despite having many salient
features, the first-order subgradient nature of the
back-pressure based schemes results in slow convergence
and poor delay performance. To overcome these
limitations, in this paper, we make a first attempt at
developing a second-order joint congestion control and
routing optimization framework that offers
utility-optimality, queue-stability, fast convergence,
and low delay. Our contributions in this paper are
three-fold: (i) we propose a new second-order joint
congestion control and routing framework based on a
primal-dual interior-point approach; (ii) we establish
utility-optimality and queue-stability of the proposed
second-order method; and (iii) we show how to implement
the proposed second-order method in a distributed
fashion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Schmid:2016:STL,
author = "Stefan Schmid and Chen Avin and Christian Scheideler
and Michael Borokhovich and Bernhard Haeupler and Zvi
Lotker",
title = "{SplayNet}: towards locally self-adjusting networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1421--1433",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper initiates the study of locally
self-adjusting networks: networks whose topology adapts
dynamically and in a decentralized manner, to the
communication pattern $ \sigma $. Our vision can be
seen as a distributed generalization of the
self-adjusting datastructures introduced by Sleator and
Tarjan, 1985: In contrast to their splay trees which
dynamically optimize the lookup costs from a single
node (namely the tree root), we seek to minimize the
routing cost between arbitrary communication pairs in
the network. As a first step, we study distributed
binary search trees (BSTs), which are attractive for
their support of greedy routing. We introduce a simple
model which captures the fundamental tradeoff between
the benefits and costs of self-adjusting networks. We
present the SplayNet algorithm and formally analyze its
performance, and prove its optimality in specific case
studies. We also introduce lower bound techniques based
on interval cuts and edge expansion, to study the
limitations of any demand-optimized network. Finally,
we extend our study to multi-tree networks, and
highlight an intriguing difference between classic and
distributed splay trees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2016:IST,
author = "Wei Dai and Scott Jordan",
title = "{ISP} service tier design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1434--1447",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet Service Provider design of service tiers are
modeled and analyzed, based on demand for web browsing
and video streaming. A basic model that considers user
willingness to pay, network capacity, and application
performance is formulated to determine when multiple
tiers maximize profit. An extended model that also
considers the time that users devote to each
application is formulated to determine the optimal
network capacity, tier rates, and tier prices. We show
that an Internet Service Provider may simplify tier and
capacity design by allowing its engineering department
to set network capacity, its marketing department to
set tier prices, and both to jointly set tier rates.
Numerical results are presented to illustrate the
magnitude of the decrease in profit compared to the
optimal profit resulting from such a simplified
design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pan:2016:TZT,
author = "Tian Pan and Ting Zhang and Junxiao Shi and Yang Li
and Linxiao Jin and Fuliang Li and Jiahai Yang and
Beichuan Zhang and Xueren Yang and Mingui Zhang and
Huichen Dai and Bin Liu",
title = "Towards zero-time wakeup of line cards in power-aware
routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1448--1461",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the network infrastructure has been consuming more
and more power, various schemes have been proposed to
improve the power efficiency of network devices. Many
schemes put links to sleep when idle and wake them up
when needed. A presumption in these schemes, though, is
that router's line cards can be waken up very quickly.
However, through systematic measurement of a major
vendor's high-end routers, we find that it takes
minutes to get a line card ready under the current
design. To address this issue, we propose a new line
card design that (1) keeps the host processor in a line
card standby, which only consumes a small fraction of
power but will save considerable wakeup time, and (2)
downloads a slim slot of popular prefixes with higher
priority, so that the line card will be ready for
forwarding most of the traffic much earlier. We design
algorithms as well as architecture that ensure fast and
correct longest prefix match during prioritized routing
prefix download. Experiments on an FPGA-based prototype
show that the customized hardware can be ready to
forward packets in 127.27 ms, which is 0.3\% of the
time the original design takes. This can better support
numerous power-saving schemes based on the sleep/wakeup
mechanism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:TUB,
author = "Kai Han and Chi Zhang and Jun Luo",
title = "Taming the uncertainty: budget limited robust
crowdsensing through online learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1462--1475",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile crowdsensing has been intensively explored
recently due to its flexible and pervasive sensing
ability. Although many crowdsensing platforms have been
built for various applications, the general issue of
how to manage such systems intelligently remains
largely open. While recent investigations mostly focus
on incentivizing crowdsensing, the robustness of
crowdsensing toward uncontrollable sensing quality,
another important issue, has been widely neglected. Due
to the non-professional personnel and devices, the
quality of crowdsensing data cannot be fully
guaranteed, hence the revenue gained from mobile
crowdsensing is generally uncertain. Moreover, the need
for compensating the sensing costs under a limited
budget has exacerbated the situation: one does not
enjoy an infinite horizon to learn the sensing ability
of the crowd and hence to make decisions based on
sufficient statistics. In this paper, we present a
novel framework, Budget LImited robuSt crowdSensing
(BLISS), to handle this problem through an online
learning approach. Our approach aims to minimize the
difference on average sense (a.k.a. regret ) between
the achieved total sensing revenue and the (unknown)
optimal one, and we show that our BLISS sensing
policies achieve logarithmic regret bounds and
Hannan-consistency. Finally, we use extensive
simulations to demonstrate the effectiveness of
BLISS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joo:2016:DGA,
author = "Changhee Joo and Xiaojun Lin and Jiho Ryu and Ness B.
Shroff",
title = "Distributed greedy approximation to maximum weighted
independent set for scheduling with fading channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1476--1488",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been known that scheduling algorithms designed
to achieve throughput optimality and good delay
performance often require solving the Maximum Weighted
Independent Set (MWIS) problem. However, under most
realistic network settings, the MWIS problem is known
to be NP-hard. In non-fading environments,
low-complexity scheduling algorithms have been provided
that converge either to the MWIS solution in time or to
a solution that achieves at least a provable fraction
of the achievable throughput. However, in more
practical systems the channel conditions can vary at
faster time-scales than convergence occurs in these
lower-complexity algorithms. Hence, these algorithms
cannot take advantage of opportunistic gains, and may
no longer result in achieving good performance. In this
paper, we propose a low-complexity scheduling scheme
that performs provably well under fading channels and
is amenable to implement in a distributed manner. To
the best of our knowledge, this is the first scheduling
scheme under fading environments that requires only
local information, has a low complexity that grows
logarithmically with the network size (provided that
the conflict graph has bounded maximum vertex degree),
and achieves provable performance guarantees
(arbitrarily close to that of the well-known
centralized Greedy Maximal Scheduler). We verify that
the throughput and the delay of our proposed scheme are
close to those of the optimal MaxWeight that solves
MWIS at each time. Further, we implement our algorithm
in a testbed by modifying the existing IEEE 802.11 DCF.
The experiment results show that our implementation
successfully accounts for wireless fading, attains the
short-term opportunistic gains in practice, and hence
substantially outperforms IEEE 802.11 DCF.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Siekkinen:2016:UVS,
author = "Matti Siekkinen and Mohammad Ashraful Hoque and Jukka
K. Nurminen",
title = "Using viewing statistics to control energy and traffic
overhead in mobile video streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1489--1503",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video streaming can drain a smartphone battery
quickly. A large part of the energy consumed goes to
wireless communication. In this article, we first study
the energy efficiency of different video content
delivery strategies used by service providers and
identify a number of sources of energy inefficiency.
Specifically, we find a fundamental tradeoff in energy
waste between prefetching small and large chunks of
video content: small chunks are bad because each
download causes a fixed tail energy to be spent
regardless of the amount of content downloaded, whereas
large chunks increase the risk of downloading data that
user will never view because of abandoning the video.
Hence, the key to optimal strategy lies in the ability
to predict when the user might abandon viewing
prematurely. We then propose an algorithm called
eSchedule that uses viewing statistics to predict
viewer behavior and computes an energy optimal download
strategy for a given mobile client. The algorithm also
includes a mechanism for explicit control of traffic
overhead, i.e., unnecessary download of content that
the user will never watch. Our evaluation results
suggest that the algorithm can cut the energy waste
down to less than half compared to other strategies. We
also present and experiment with an Android prototype
that integrates eSchedule into a YouTube downloader.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2016:ALS,
author = "Huasen Wu and Xiaojun Lin and Xin Liu and Youguang
Zhang",
title = "Application-level scheduling with probabilistic
deadline constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1504--1517",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic scheduling of delay-tolerant traffic has
been shown to substantially improve spectrum
efficiency. To encourage users to adopt delay-tolerant
scheduling for capacity-improvement, it is critical to
provide guarantees in terms of completion time. In this
paper, we study application-level scheduling with
deadline constraints, where the deadline is
pre-specified by users/applications and is associated
with a deadline violation probability. To address the
exponentially-high complexity due to temporally-varying
channel conditions and deadline constraints, we develop
a novel asymptotic approach that exploits the largeness
of the network to our advantage. Specifically, we
identify a lower bound on the deadline violation
probability, and propose simple policies that achieve
the lower bound in the large-system regime. The results
in this paper thus provide a rigorous analytical
framework to develop and analyze policies for
application-level scheduling under very general
settings of channel models and deadline requirements.
Further, based on the asymptotic approach, we propose
the notion of Application-Level Effective Capacity
region, i.e., the throughput region that can be
supported subject to deadline constraints, which allows
us to quantify the potential gain of application-level
scheduling. Simulation results show that
application-level scheduling can improve the system
capacity significantly while guaranteeing the deadline
constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Laufer:2016:CWC,
author = "Rafael Laufer and Leonard Kleinrock",
title = "The capacity of wireless {CSMA\slash CA} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1518--1532",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to a poor understanding of the interactions among
transmitters, wireless networks using carrier sense
multiple access with collision avoidance (CSMA/CA) have
been commonly stigmatized as unpredictable in nature.
Even elementary questions regarding the throughput
limitations of these networks cannot be answered in
general. In this paper, we investigate the behavior of
wireless CSMA/CA networks to understand how the
transmissions of a particular node affect the medium
access, and ultimately the throughput, of other nodes
in the network. We introduce a theory which accurately
models the behavior of these networks and show that,
contrary to popular belief, their performance is
predictable and can be described by a system of
equations. Using the proposed theory, we provide the
analytical expressions necessary to fully characterize
the capacity region of any wireless CSMA/CA network. We
show that this region is nonconvex in general and
agnostic to the probability distributions of all
network parameters, depending only on their expected
values. Our theory is also shown to extend naturally to
time division multiple access (TDMA) networks and to
predict how the network responds to infeasible input
rates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mardani:2016:ETA,
author = "Morteza Mardani and Georgios B. Giannakis",
title = "Estimating traffic and anomaly maps via network
tomography",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1533--1547",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mapping origin-destination (OD) network traffic is
pivotal for network management and proactive security
tasks. However, lack of sufficient flow-level
measurements as well as potential anomalies pose major
challenges towards this goal. Leveraging the
spatiotemporal correlation of nominal traffic, and the
sparse nature of anomalies, this paper brings forth a
novel framework to map out nominal and anomalous
traffic, which treats jointly important network
monitoring tasks including traffic estimation, anomaly
detection, and traffic interpolation. To this end, a
convex program is first formulated with nuclear and l
{$<$ sb$>$1$<$}/{sb$>$}-norm regularization to effect
sparsity and low rank for the nominal and anomalous
traffic with only the link counts and a small subset of
OD-flow counts. Analysis and simulations confirm that
the proposed estimator can exactly recover sufficiently
low-dimensional nominal traffic and sporadic anomalies
so long as the routing paths are sufficiently
``spread-out'' across the network, and an adequate
amount of flow counts are randomly sampled. The results
offer valuable insights about data acquisition
strategies and network scenaria giving rise to accurate
traffic estimation. For practical networks where the
aforementioned conditions are possibly violated, the
inherent spatiotemporal traffic patterns are taken into
account by adopting a Bayesian approach along with a
bilinear characterization of the nuclear and l$_1$
norms. The resultant nonconvex program involves
quadratic regularizers with correlation matrices,
learned systematically from (cyclo)stationary
historical data. Alternating-minimization based
algorithms with provable convergence are also developed
to procure the estimates. Insightful tests with
synthetic and real Internet data corroborate the
effectiveness of the novel schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiao:2016:TOP,
author = "Yan Qiao and Shigang Chen and Tao Li and Shiping
Chen",
title = "Tag-ordering polling protocols in {RFID} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1548--1561",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Future RFID technologies will go far beyond today's
widely used passive tags. Battery-powered active tags
are likely to gain more popularity due to their long
operational ranges and richer on-tag resources. With
integrated sensors, these tags can provide not only
static identification numbers but also dynamic,
real-time information such as sensor readings. This
paper studies a general problem of how to design
efficient polling protocols to collect such real-time
information from a subset of M tags in a large RFID
system. We show that the standard, straightforward
polling design is not energy-efficient because each tag
has to continuously monitor the wireless channel and
receive O (| M |) tag IDs, which is energy-consuming.
Existing work is able to cut the amount of data each
tag has to receive by half through a coding design. In
this paper, we propose a tag-ordering polling protocol
(TOP) that can reduce per-tag energy consumption by
more than an order of magnitude. We also reveal an
energy-time tradeoff in the protocol design: per-tag
energy consumption can be reduced to O (1) at the
expense of longer execution time of the protocol. We
then apply partitioned Bloom filters to enhance the
performance of TOP, such that it can achieve much
better energy efficiency without degradation in
protocol execution time. Finally, we show how to
configure the new protocols for time-constrained energy
minimization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kadloor:2016:MTS,
author = "Sachin Kadloor and Negar Kiyavash and Parv
Venkitasubramaniam",
title = "Mitigating timing side channel in shared schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1562--1573",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this work, we study information leakage in timing
side channels that arise in the context of shared event
schedulers. Consider two processes, one of them an
innocuous process (referred to as Alice) and the other
a malicious one (referred to as Bob), using a common
scheduler to process their jobs. There are other
innocuous users in addition to Alice and Bob using the
scheduler to process their jobs. Based on when his jobs
get processed, Bob wishes to learn about the pattern
(size and timing) of Alice's jobs. Depending on the
context, knowledge of this pattern could have serious
implications on Alice's privacy and security. For
instance, shared routers can reveal traffic patterns,
shared memory access can reveal cloud usage patterns,
and suchlike. We present a formal framework to study
the information leakage in shared resource schedulers
using the pattern estimation error as a performance
metric. The first-come-first-serve (FCFS) scheduling
policy and time-division-multiple-access (TDMA) are
identified as two extreme policies on the privacy
metric, FCFS has the least, and TDMA has the highest.
However, on performance-based metrics, such as
throughput and delay, it is well known that FCFS
significantly outperforms TDMA. We then derive two
parameterized policies, accumulate and serve, and
proportional TDMA, which take two different approaches
to offer a tunable trade-off between privacy and
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ostovari:2016:SVS,
author = "Pouya Ostovari and Jie Wu and Abdallah Khreishah and
Ness B. Shroff",
title = "Scalable video streaming with helper nodes using
random linear network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1574--1587",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video streaming generates a substantial fraction of
the traffic on the Internet. The demands of video
streaming also increase the workload on the video
server, which in turn leads to substantial slowdowns.
In order to resolve the slowdown problem, and to
provide a scalable and robust infrastructure to support
on-demand streaming, helper-assisted video-on-demand
(VoD) systems have been introduced. In this
architecture, helper nodes, which are micro-servers
with limited storage and bandwidth resources, download
and store the user-requested videos from a central
server to decrease the load on the central server.
Multi-layer videos, in which a video is divided into
different layers, can also be used to improve the
scalability of the system. In this paper, we study the
problem of utilizing the helper nodes to minimize the
pressure on the central servers. We formulate the
problem as a linear programming using joint inter- and
intra-layer network coding. Our solution can also be
implemented in a distributed manner. We show how our
method can be extended to the case of wireless live
streaming, in which a set of videos is broadcasted.
Moreover, we extend the proposed method to the case of
unreliable connections. We carefully study the
convergence and the gain of our distributed approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Beirami:2016:PLN,
author = "Ahmad Beirami and Mohsen Sardari and Faramarz Fekri",
title = "Packet-level network compression: realization and
scaling of the network-wide benefits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1588--1604",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The existence of considerable amount of redundancy in
the Internet traffic at the packet level has stimulated
the deployment of packet-level redundancy elimination
techniques within the network by enabling network nodes
to memorize data packets. Redundancy elimination
results in traffic reduction which in turn improves the
efficiency of network links. In this paper, the concept
of network compression is introduced that aspires to
exploit the statistical correlation beyond removing
large duplicate strings from the flow to better
suppress redundancy. In the first part of the paper, we
introduce ``memory-assisted compression,'' which
utilizes the memorized content within the network to
learn the statistics of the information source
generating the packets which can then be used toward
reducing the length of codewords describing the packets
emitted by the source. Using simulations on data
gathered from real network traces, we show that
memory-assisted compression can result in significant
traffic reduction. In the second part of the paper, we
study the scaling of the average network-wide benefits
of memory-assisted compression. We discuss routing and
memory placement problems in network for the reduction
of overall traffic. We derive a closed-form expression
for the scaling of the gain in Erd{\H{o}}s--R{\'e}nyi
random network graphs, where obtain a threshold value
for the number of memories deployed in a random graph
beyond which network-wide benefits start to shine.
Finally, the network-wide benefits are studied on
Internet-like scale-free networks. We show that
non-vanishing network compression gain is obtained even
when only a tiny fraction of the total number of nodes
in the network are memory-enabled.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:TDF,
author = "Jinsong Han and Chen Qian and Xing Wang and Dan Ma and
Jizhong Zhao and Wei Xi and Zhiping Jiang and Zhi
Wang",
title = "Twins: device-free object tracking using passive
tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1605--1617",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Device-free object tracking provides a promising
solution for many localization and tracking systems to
monitor non-cooperative objects, such as intruders,
which do not carry any transceiver. However, existing
device-free solutions mainly use special sensors or
active RFID tags, which are much more expensive
compared to passive tags. In this paper, we propose a
novel motion detection and tracking method using
passive RFID tags, named Twins. The method leverages a
newly observed phenomenon called critical state caused
by interference among passive tags. We contribute to
both theory and practice of this phenomenon by
presenting a new interference model that precisely
explains it and using extensive experiments to validate
it. We design a practical Twins based intrusion
detection system and implement a real prototype by
commercial off-the-shelf RFID reader and tags.
Experimental results show that Twins is effective in
detecting the moving object, with very low location
errors of 0.75 m in average (with a deployment spacing
of 0.6 m).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:DOS,
author = "Hang Li and Chuan Huang and Ping Zhang and Shuguang
Cui and Junshan Zhang",
title = "Distributed opportunistic scheduling for energy
harvesting based wireless networks: a two-stage probing
approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1618--1631",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers a heterogeneous ad hoc network
with multiple transmitter-receiver pairs, in which all
transmitters are capable of harvesting renewable energy
from the environment and compete for one shared channel
by random access. In particular, we focus on two
different scenarios: the constant energy harvesting
(EH) rate model where the EH rate remains constant
within the time of interest and the i.i.d. EH rate
model where the EH rates are independent and
identically distributed across different contention
slots. To quantify the roles of both the energy state
information (ESI) and the channel state information
(CSI), a distributed opportunistic scheduling (DOS)
framework with two-stage probing and save-then-transmit
energy utilization is proposed. Then, the optimal
throughput and the optimal scheduling strategy are
obtained via one-dimension search, i.e., an iterative
algorithm consisting of the following two steps in each
iteration: First, assuming that the stored energy level
at each transmitter is stationary with a given
distribution, the expected throughput maximization
problem is formulated as an optimal stopping problem,
whose solution is proven to exist and then derived for
both models; second, for a fixed stopping rule, the
energy level at each transmitter is shown to be
stationary and an efficient iterative algorithm is
proposed to compute its steady-state distribution.
Finally, we validate our analysis by numerical results
and quantify the throughput gain compared with the
best-effort delivery scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:DGO,
author = "Yongmin Zhang and Shibo He and Jiming Chen",
title = "Data gathering optimization by dynamic sensing and
routing in rechargeable sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1632--1646",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In rechargeable sensor networks (RSNs), energy
harvested by sensors should be carefully allocated for
data sensing and data transmission to optimize data
gathering due to time-varying renewable energy arrival
and limited battery capacity. Moreover, the dynamic
feature of network topology should be taken into
account, since it can affect the data transmission. In
this paper, we strive to optimize data gathering in
terms of network utility by jointly considering data
sensing and data transmission. To this end, we design a
data gathering optimization algorithm for dynamic
sensing and routing (DoSR), which consists of two
parts. In the first part, we design a balanced energy
allocation scheme (BEAS) for each sensor to manage its
energy use, which is proven to meet four requirements
raised by practical scenarios. Then in the second part,
we propose a distributed sensing rate and routing
control (DSR2C) algorithm to jointly optimize data
sensing and data transmission, while guaranteeing
network fairness. In DSR2C, each sensor can adaptively
adjust its transmit energy consumption during network
operation according to the amount of available energy,
and select the optimal sensing rate and routing, which
can efficiently improve data gathering. Furthermore,
since recomputing the optimal data sensing and routing
strategies upon change of energy allocation will bring
huge communications for information exchange and
computation, we propose an improved BEAS to manage the
energy allocation in the dynamic environments and a
topology control scheme to reduce computational
complexity. Extensive simulations are performed to
demonstrate the efficiency of the proposed algorithms
in comparison with existing algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kwak:2016:PNS,
author = "Jeongho Kwak and Okyoung Choi and Song Chong and
Prasant Mohapatra",
title = "Processor-network speed scaling for energy: delay
tradeoff in smartphone applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1647--1660",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many smartphone applications, e.g., file backup, are
intrinsically delay-tolerant so that data processing
and transfer can be delayed to reduce smartphone
battery usage. In the literature, these energy--delay
tradeoff issues have been addressed independently in
the forms of Dynamic Voltage and Frequency Scaling
(DVFS) problems and network selection problems when
smartphones have multiple wireless interfaces. In this
paper, we jointly optimize the CPU speed and network
speed to determine how much more energy can be saved
through the joint optimization when applications can
tolerate delays. We propose a dynamic speed scaling
scheme called SpeedControl that jointly adjusts the
processing and networking speeds using four controls:
application scheduling, CPU speed control, wireless
interface selection, and transmit power control.
Through invoking the ``Lyapunov drift-plus-penalty''
technique, the scheme is demonstrated to be near
optimal because it substantially reduces energy
consumption for a given delay constraint. This paper is
the first to reveal the energy--delay tradeoff
relationship from a holistic perspective for
smartphones with multiple wireless interfaces, DVFS,
and multitasking capabilities. The trace-driven
simulations based on real measurements of CPU power,
network power, WiFi/3G throughput, and CPU workload
demonstrate that SpeedControl can reduce battery usage
by more than 42\% through trading a 10 minutes delay
when compared with the same delay in existing schemes;
moreover, this energy conservation level increases as
the WiFi coverage extends.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Won:2016:PAA,
author = "Jongho Won and Chris Y. T. Ma and David K. Y. Yau and
Nageswara S. V. Rao",
title = "Privacy-assured aggregation protocol for smart
metering: a proactive fault-tolerant approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1661--1674",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 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 = "Smart meters are integral to demand response in
emerging smart grids, by reporting the electricity
consumption of users to serve application needs. But
reporting real-time usage information for individual
households raises privacy concerns. Existing techniques
to guarantee differential privacy (DP) of smart meter
users either are not fault tolerant or achieve
(possibly partial) fault tolerance at high
communication overheads. In this paper, we propose a
fault-tolerant protocol for smart metering that can
handle general communication failures while ensuring DP
with significantly improved efficiency and lower errors
compared with the state of the art. Our protocol
handles fail-stop faults proactively by using a novel
design of future ciphertexts, and distributes trust
among the smart meters by sharing secret keys among
them. We prove the DP properties of our protocol and
analyze its advantages in fault tolerance, accuracy,
and communication efficiency relative to competing
techniques. We illustrate our analysis by simulations
driven by real-world traces of electricity
consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guan:2016:DRM,
author = "Zhangyu Guan and Tommaso Melodia and Dongfeng Yuan and
Dimitris A. Pados",
title = "Distributed resource management for cognitive ad hoc
networks with cooperative relays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1675--1689",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is well known that the data transport capacity of a
wireless network can be increased by leveraging the
spatial and frequency diversity of the wireless
transmission medium. This has motivated the recent
surge of research in cooperative and
dynamic-spectrum-access (which we also refer to as
cognitive spectrum access) networks. Still, as of
today, a key open research challenge is to design
distributed control strategies to dynamically jointly
assign: (1) portions of the spectrum and (2)
cooperative relays to different traffic sessions to
maximize the resulting network-wide data rate. In this
paper, we make a significant contribution in this
direction. First, we mathematically formulate the
problem of joint spectrum management and relay
selection for a set of sessions concurrently utilizing
an interference-limited infrastructure-less wireless
network. We then study distributed solutions to this
(nonlinear and nonconvex) problem. The overall problem
is separated into two subproblems: (1) spectrum
management through power allocation with given relay
selection strategy; and (2) relay selection for a given
spectral profile. Distributed solutions for each of the
two subproblems are proposed, which are then analyzed
based on notions from variational inequality (VI)
theory. The distributed algorithms can be proven to
converge, under certain conditions, to VI solutions,
which are also Nash equilibrium (NE) solutions of the
equivalent NE problems. A distributed algorithm based
on iterative solution of the two subproblems is then
designed. Performance and price of anarchy of the
distributed algorithm are then studied by comparing it
to the globally optimal solution obtained with a newly
designed centralized algorithm. Simulation results show
that the proposed distributed algorithm achieves
performance that is within a few percentage points of
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{Moharir:2016:OLB,
author = "Sharayu Moharir and Sujay Sanghavi and Sanjay
Shakkottai",
title = "Online load balancing under graph constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1690--1703",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In several data center settings, each arriving job may
only be served by one of a subset of servers. Such a
graph constraint can arise due to several reasons. One
is locality of the data needed by a job; for example,
in content farms (e.g., in Netflix or YouTube) a video
request can only be served by a machine that possesses
a copy. Motivated by this, we consider a setting where
each job, on arrival, reveals a deadline and a subset
of servers that can serve it. The job needs to be
immediately allocated to one of these servers, and
cannot be moved thereafter. Our objective is to
maximize the fraction of jobs that are served before
their deadlines. For this online load balancing
problem, we prove an upper bound of 1---1/ e on the
competitive ratio of nonpreemptive online algorithms
for systems with a large number of servers. We propose
an algorithm --- INSERT RANKING --- which achieves this
upper bound. The algorithm makes decisions in a
correlated random way and it is inspired by the work of
Karp, Vazirani, and Vazirani on online matching for
bipartite graphs. We also show that two more natural
algorithms, based on independent randomness, are
strictly suboptimal, with a competitive ratio of 1/2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Avalle:2016:SAN,
author = "Matteo Avalle and Fulvio Risso and Riccardo Sisto",
title = "Scalable algorithms for {NFA} multi-striding and
{NFA}-based deep packet inspection on {GPUs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1704--1717",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
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 = "Finite state automata (FSA) are used by many network
processing applications to match complex sets of
regular expressions in network packets. In order to
make FSA-based matching possible even at the
ever-increasing speed of modern networks,
multi-striding has been introduced. This technique
increases input parallelism by transforming the
classical FSA that consumes input byte by byte into an
equivalent one that consumes input in larger units.
However, the algorithms used today for this
transformation are so complex that they often result
unfeasible for large and complex rule sets. This paper
presents a set of new algorithms that extend the
applicability of multi-striding to complex rule sets.
These algorithms can transform nondeterministic finite
automata (NFA) into their multi-stride form with
reduced memory and time requirements. Moreover, they
exploit the massive parallelism of graphical processing
units for NFA-based matching. The final result is a
boost of the overall processing speed on typical
regex-based packet processing applications, with a
speedup of almost one order of magnitude compared to
the current 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{Cohen:2016:DGT,
author = "Kobi Cohen and Amir Leshem",
title = "Distributed game-theoretic optimization and management
of multichannel {ALOHA} networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1718--1731",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of distributed rate maximization in
multichannel ALOHA networks is considered. First, we
study the problem of constrained distributed rate
maximization, where user rates are subject to total
transmission probability constraints. We propose a
best-response algorithm, where each user updates its
strategy to increase its rate according to the channel
state information and the current channel utilization.
We prove the convergence of the algorithm to a Nash
equilibrium in both homogeneous and heterogeneous
networks using the theory of potential games. The
performance of the best-response dynamic is analyzed
and compared to a simple transmission scheme, where
users transmit over the channel with the highest
collision-free utility. Then, we consider the case
where users are not restricted by transmission
probability constraints. Distributed rate maximization
under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a
distributed scheme where users adjust their
transmission probability to maximize their rates
according to the current network state, while
maintaining the desired load on the channels. We show
that our approach plays an important role in achieving
the Nash bargaining solution among users. Sequential
and parallel algorithms are proposed to achieve the
target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through
both theoretical 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{Yang:2016:IMC,
author = "Dejun Yang and Guoliang Xue and Xi Fang and Jian
Tang",
title = "Incentive mechanisms for crowdsensing: crowdsourcing
with smartphones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1732--1744",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Smartphones are programmable and equipped with a set
of cheap but powerful embedded sensors, such as
accelerometer, digital compass, gyroscope, GPS,
microphone, and camera. These sensors can collectively
monitor a diverse range of human activities and the
surrounding environment. Crowdsensing is a new paradigm
which takes advantage of the pervasive smartphones to
sense, collect, and analyze data beyond the scale of
what was previously possible. With the crowdsensing
system, a crowdsourcer can recruit smartphone users to
provide sensing service. Existing crowdsensing
applications and systems lack good incentive mechanisms
that can attract more user participation. To address
this issue, we design incentive mechanisms for
crowdsensing. We consider two system models: the
crowdsourcer-centric model where the crowdsourcer
provides a reward shared by participating users, and
the user-centric model where users have more control
over the payment they will receive. For the
crowdsourcer-centric model, we design an incentive
mechanism using a Stackelberg game, where the
crowdsourcer is the leader while the users are the
followers. We show how to compute the unique
Stackelberg Equilibrium, at which the utility of the
crowdsourcer is maximized, and none of the users can
improve its utility by unilaterally deviating from its
current strategy. For the user-centric model, we design
an auction-based incentive mechanism, which is
computationally efficient, individually rational,
profitable, and truthful. Through extensive
simulations, we evaluate the performance and validate
the theoretical properties of our incentive
mechanisms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2016:MDN,
author = "Jinsung Lee and Hojin Lee and Yung Yi and Song Chong
and Edward W. Knightly and Mung Chiang",
title = "Making {802.11 DCF} near-optimal: design,
implementation, and evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1745--1758",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a new protocol called Optimal DCF
(O-DCF). O-DCF modifies the rule of adapting CSMA
parameters, such as backoff time and transmission
length, based on a function of the demand--supply
differential of link capacity captured by the local
queue length. O-DCF is fully compatible with 802.11
hardware, so that it can be easily implemented only
with a simple device driver update. O-DCF is inspired
by the recent analytical studies proven to be optimal
under assumptions, which often generates a big gap
between theory and practice. O-DCF effectively bridges
such a gap, which is implemented in off-the-shelf
802.11 chipset. Through extensive simulations and real
experiments with a 16-node wireless network testbed, we
evaluate the performance of O-DCF and show that it
achieves near-optimality in terms of throughput and
fairness and outperforms other competitive ones, such
as 802.11 DCF, optimal CSMA, and DiffQ for various
scenarios. Also, we consider the coexistence of O-DCF
and 802.11 DCF and show that O-DCF fairly shares the
medium with 802.11 via its parameter control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:CDS,
author = "Kai Liu and Joseph K. Y. Ng and Victor C. S. Lee and
Sang H. Son and Ivan Stojmenovic",
title = "Cooperative data scheduling in hybrid vehicular ad hoc
networks: {VANET} as a software defined network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1759--1773",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents the first study on scheduling for
cooperative data dissemination in a hybrid
infrastructure-to-vehicle (I2V) and vehicle-to-vehicle
(V2V) communication environment. We formulate the novel
problem of cooperative data scheduling (CDS). Each
vehicle informs the road-side unit (RSU) the list of
its current neighboring vehicles and the identifiers of
the retrieved and newly requested data. The RSU then
selects sender and receiver vehicles and corresponding
data for V2V communication, while it simultaneously
broadcasts a data item to vehicles that are instructed
to tune into the I2V channel. The goal is to maximize
the number of vehicles that retrieve their requested
data. We prove that CDS is NP-hard by constructing a
polynomial-time reduction from the Maximum Weighted
Independent Set (MWIS) problem. Scheduling decisions
are made by transforming CDS to MWIS and using a greedy
method to approximately solve MWIS. We build a
simulation model based on realistic traffic and
communication characteristics and demonstrate the
superiority and scalability of the proposed solution.
The proposed model and solution, which are based on the
centralized scheduler at the RSU, represent the first
known vehicular ad hoc network (VANET) implementation
of software defined network (SDN) concept.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:ECP,
author = "Seon Yeong Han and Nael B. Abu-Ghazaleh and Dongman
Lee",
title = "Efficient and consistent path loss model for mobile
network simulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1774--1786",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The accuracy of wireless network packet simulation
critically depends on the quality of wireless channel
models. Path loss is the stationary component of the
channel model affected by the shadowing in the
environment. Existing path loss models are inaccurate,
require excessive measurement or computational
overhead, and/or often cannot be made to represent a
given environment. This paper contributes a flexible
path loss model that uses a novel approach for
spatially coherent interpolation from available nearby
channels to allow accurate and efficient modeling of
path loss. We show that the proposed model, called
Double Regression (DR), generates a correlated space,
allowing both the sender and the receiver to move
without abrupt change in path loss. Combining DR with a
traditional temporal fading model, such as Rayleigh
fading, provides an accurate and efficient channel
model that we integrate with the NS-2 simulator. We use
measurements to validate the accuracy of the model for
a number of scenarios. We also show that there is
substantial impact on simulation behavior when path
loss is modeled accurately. Finally, we show that
unlike statistical models, DR can make a simulation
representative of a given environment by using a small
number of seeding measurements. Thus, DR provides a
cost-effective alternative to ray tracing or detailed
site surveys.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Seferoglu:2016:SRS,
author = "Hulya Seferoglu and Eytan Modiano",
title = "Separation of routing and scheduling in backpressure:
based wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1787--1800",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Backpressure routing and scheduling, with its
throughput-optimal operation guarantee, is a promising
technique to improve throughput in wireless multihop
networks. Although backpressure is conceptually viewed
as layered, the decisions of routing and scheduling are
made jointly, which imposes several challenges in
practice. In this work, we present Diff-Max, an
approach that separates routing and scheduling and has
three strengths: (1) Diff-Max improves throughput
significantly; (2) the separation of routing and
scheduling makes practical implementation easier by
minimizing cross-layer operations; i.e., routing is
implemented in the network layer and scheduling is
implemented in the link layer; and (3) the separation
of routing and scheduling leads to modularity; i.e.,
routing and scheduling are independent modules in
Diff-Max, and one can continue to operate even if the
other does not. Our approach is grounded in a network
utility maximization (NUM) formulation and its
solution. Based on the structure of Diff-Max, we
propose two practical schemes: Diff-subMax and
wDiff-subMax. We demonstrate the benefits of our
schemes through simulation in ns-2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ouyang:2016:DSM,
author = "Wenzhuo Ouyang and Atilla Eryilmaz and Ness B.
Shroff",
title = "Downlink scheduling over {Markovian} fading channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1801--1812",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the scheduling problem in downlink
wireless networks with heterogeneous, Markov-modulated,
ON/OFF channels. It is well known that the performance
of scheduling over fading channels relies heavily on
the accuracy of the available channel state information
(CSI), which is costly to acquire. Thus, we consider
the CSI acquisition via a practical ARQ-based feedback
mechanism whereby channel states are revealed at the
end of only scheduled users' transmissions. In the
assumed presence of temporally correlated channel
evolutions, the desired scheduler must optimally
balance the exploitation --- exploration tradeoff,
whereby it schedules transmissions both to exploit
those channels with up-to-date CSI and to explore the
current state of those with outdated CSI. In earlier
works, Whittle's Index Policy had been suggested as a
low-complexity and high-performance solution to this
problem. However, analyzing its performance in the
typical scenario of statistically heterogeneous channel
state processes has remained elusive and challenging,
mainly because of the highly coupled and complex
dynamics it possesses. In this work, we overcome these
difficulties to rigorously establish the asymptotic
optimality properties of Whittle's Index Policy in the
limiting regime of many users. More specifically: (1)
we prove the local optimality of Whittle's Index
Policy, provided that the initial state of the system
is within a certain neighborhood of a carefully
selected state; (2) we then establish the global
optimality of Whittle's Index Policy under a recurrence
assumption that is verified numerically for our
problem. These results establish that Whittle's Index
Policy possesses analytically provable optimality
characteristics for scheduling over heterogeneous and
temporally correlated channels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gonzalez:2016:AEG,
author = "Roberto Gonzalez and Ruben Cuevas and Reza Motamedi
and Reza Rejaie and Angel Cuevas",
title = "Assessing the evolution of {Google+} in its first two
years",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1813--1826",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the era when Facebook and Twitter dominate the
market for social media, Google has introduced Google+
(G+) and reported a significant growth in its size
while others called it a ghost town. This begs the
question of whether G+ can really attract a significant
number of connected and active users despite the
dominance of Facebook and Twitter. This paper presents
a detailed longitudinal characterization of G+ based on
large-scale measurements. We identify the main
components of G+ structure and characterize the key
feature of their users and their evolution over time.
We then conduct detailed analysis on the evolution of
connectivity and activity among users in the largest
connected component (LCC) of G+ structure, and compare
their characteristics to other major online social
networks (OSNs). We show that despite the dramatic
growth in the size of G+, the relative size of the LCC
has been decreasing and its connectivity has become
less clustered. While the aggregate user activity has
gradually increased, only a very small fraction of
users exhibit any type of activity, and an even smaller
fraction of these users attracts any reaction. The
identity of users with most followers and reactions
reveal that most of them are related to high-tech
industry. To our knowledge, this study offers the most
comprehensive characterization of G+ based on the
largest collected datasets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:VMT,
author = "Hongxing Li and Chuan Wu and Zongpeng Li and Francis
C. M. Lau",
title = "Virtual machine trading in a federation of clouds:
individual profit and social welfare maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1827--1840",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
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 = "By sharing resources among different cloud providers,
the paradigm of federated clouds exploits temporal
availability of resources and geographical diversity of
operational costs for efficient job service. While
interoperability issues across different cloud
platforms in a cloud federation have been extensively
studied, fundamental questions on cloud economics
remain: When and how should a cloud trade resources
(e.g., virtual machines) with others, such that its net
profit is maximized over the long run, while a
close-to-optimal social welfare in the entire
federation can also be guaranteed? To answer this
question, a number of important, interrelated
decisions, including job scheduling, server
provisioning, and resource pricing, should be
dynamically and jointly made, while the long-term
profit optimality is pursued. In this work, we design
efficient algorithms for intercloud virtual machine
(VM) trading and scheduling in a cloud federation. For
VM transactions among clouds, we design a
double-auction-based mechanism that is strategy-proof,
individual-rational, ex-post budget-balanced, and
efficient to execute over time. Closely combined with
the auction mechanism is a dynamic VM trading and
scheduling algorithm, which carefully decides the true
valuations of VMs in the auction, optimally schedules
stochastic job arrivals with different service level
agreements (SLAs) onto the VMs, and judiciously turns
on and off servers based on the current electricity
prices. Through rigorous analysis, we show that each
individual cloud, by carrying out the dynamic algorithm
in the online double auction, can achieve a
time-averaged profit arbitrarily close to the offline
optimum. Asymptotic optimality in social welfare is
also achieved under homogeneous cloud settings. We
carry out simulations to verify the effectiveness of
our algorithms, and examine the achievable social
welfare under heterogeneous cloud settings, as driven
by the real-world Google cluster usage traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:QIL,
author = "Xun Gong and Negar Kiyavash",
title = "Quantifying the information leakage in timing side
channels in deterministic work-conserving schedulers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1841--1852",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "When multiple job processes are served by a single
scheduler, the queueing delays of one process are often
affected by the others, resulting in a timing side
channel that leaks the arrival pattern of one process
to the others. In this work, we study such a timing
side channel between a regular user and a malicious
attacker. Utilizing Shannon's mutual information as a
measure of information leakage between the user and
attacker, we analyze privacy-preserving behaviors of
common work-conserving schedulers. We find that the
attacker can always learn perfectly the user's arrival
process in a longest-queue-first (LQF) scheduler. When
the user's job arrival rate is very low (near zero),
first-come --- first-serve (FCFS) and round-robin
schedulers both completely reveal the user's arrival
pattern. The near-complete information leakage in the
low-rate traffic region is proven to be reduced by half
in a work-conserving version of TDMA (WC-TDMA)
scheduler, which turns out to be privacy-optimal in the
class of deterministic working-conserving (det-WC)
schedulers, according to a universal lower bound on
information leakage we derive for all det-WC
schedulers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yallouz:2016:TSS,
author = "Jose Yallouz and Ori Rottenstreich and Ariel Orda",
title = "Tunable survivable spanning trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1853--1866",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Coping with network failures has become a major
networking challenge. The concept of tunable
survivability provides a quantitative measure for
specifying any desired level (0\%--100\%) of
survivability, thus offering flexibility in the routing
choice. Previous works focused on implementing this
concept on unicast transmissions. However, vital
network information is often broadcast via spanning
trees. Accordingly, in this study, we investigate the
application of tunable survivability for efficient
maintenance of spanning trees under the presence of
failures. We establish efficient algorithmic schemes
for optimizing the level of survivability under various
QoS requirements. In addition, we derive theoretical
bounds on the number of required trees for maximum
survivability. Finally, through extensive simulations,
we demonstrate the effectiveness of the tunable
survivability concept in the construction of spanning
trees. Most notably, we show that, typically,
negligible reduction in the level of survivability
results in major improvement in the QoS performance of
the resulting spanning trees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:WSD,
author = "Bin Li and Ruogu Li and Atilla Eryilmaz",
title = "Wireless scheduling design for optimizing both service
regularity and mean delay in heavy-traffic regimes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1867--1880",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the design of throughput-optimal
scheduling policies in multihop wireless networks that
also possess good mean delay performance and provide
regular service for all links --- critical metrics for
real-time applications. To that end, we study a
parametric class of maximum-weight-type scheduling
policies, called Regular Service Guarantee (RSG)
Algorithm, where each link weight consists of its own
queue length and a counter that tracks the time since
the last service, namely Time-Since-Last-Service
(TSLS). The RSG Algorithm not only is
throughput-optimal, but also achieves a tradeoff
between the service regularity performance and the mean
delay, i.e., the service regularity performance of the
RSG Algorithm improves at the cost of increasing mean
delay. This motivates us to investigate whether
satisfactory service regularity and low mean-delay can
be simultaneously achieved by the RSG Algorithm by
carefully selecting its design parameter. To that end,
we perform a novel Lyapunov-drift-based analysis of the
steady-state behavior of the stochastic network. Our
analysis reveals that the RSG Algorithm can minimize
the total mean queue length to establish mean delay
optimality under heavily loaded conditions as long as
the design parameter weighting for the TSLS scales no
faster than the order of [EQUATION], where $
\varepsilon $ measures the closeness of the network
load to the boundary of the capacity region. To the
best of our knowledge, this is the first work that
provides regular service to all links while also
achieving heavy-traffic optimality in mean queue
lengths.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2016:GPP,
author = "Qianyi Huang and Yang Gui and Fan Wu and Guihai Chen
and Qian Zhang",
title = "A general privacy-preserving auction mechanism for
secondary spectrum markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1881--1893",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Auctions are among the best-known market-based tools
to solve the problem of dynamic spectrum
redistribution. In recent years, a good number of
strategy-proof auction mechanisms have been proposed to
improve spectrum utilization and to prevent market
manipulation. However, the issue of privacy
preservation in spectrum auctions remains open. On the
one hand, truthful bidding reveals bidders' private
valuations of the spectrum. On the other hand,
coverage/interference areas of the bidders may be
revealed to determine conflicts. In this paper, we
present PISA, which is a PrIvacy preserving and
Strategy-proof Auction mechanism for spectrum
allocation. PISA provides protection for both bid
privacy and coverage/interference area privacy
leveraging a privacy-preserving integer comparison
protocol, which is well applicable in other contexts.
We not only theoretically prove the privacy-preserving
properties of PISA, but also extensively evaluate its
performance. Evaluation results show that PISA achieves
good spectrum allocation efficiency with light
computation and communication overheads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghosh:2016:QSP,
author = "Arnob Ghosh and Saswati Sarkar",
title = "Quality-sensitive price competition in secondary
market spectrum oligopoly: single location game",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1894--1907",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate a spectrum oligopoly market where each
primary seeks to sell its channel to a secondary.
Transmission rate of a channel evolves randomly. Each
primary needs to select a price depending on the
transmission rate of its channel. Each secondary
selects a channel depending on the price and the
transmission rate of the channel. We formulate the
above problem as a noncooperative game. We show that
there exists a unique Nash equilibrium (NE) and
explicitly compute it. Under the NE strategy profile, a
primary prices its channel to render the channel that
provides high transmission rate more preferable; this
negates the perception that prices ought to be selected
to render channels equally preferable to the secondary
regardless of their transmission rates. We show the
loss of revenue in the asymptotic limit due to the
noncooperation of primaries. In the repeated version of
the game, we characterize a subgame perfect NE where a
primary can attain a payoff arbitrarily close to the
payoff it would obtain when primaries cooperate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2016:JSD,
author = "Zizhong Cao and Murali Kodialam and T. V. Lakshman",
title = "Joint static and dynamic traffic scheduling in data
center networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1908--1918",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The advent and continued growth of large data centers
has led to much interest in switch architectures that
can economically meet the high capacities needed for
interconnecting the thousands of servers in these data
centers. Various multilayer architectures employing
thousands of switches have been proposed in the
literature. We make use of the observation that the
traffic in a data center is a mixture of relatively
static and rapidly fluctuating components, and develop
a combined scheduler for both these components using a
generalization of the load-balanced scheduler. The
presence of the known static component introduces
asymmetries in the ingress-egress capacities, which
preclude the use of a load-balanced scheduler as is. We
generalize the load-balanced scheduler and also
incorporate an opportunistic scheduler that sends
traffic on a direct path when feasible to enhance the
overall switch throughput. Our evaluations show that
this scheduler works very well despite avoiding the use
of a central scheduler for making packet-by-packet
scheduling decisions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2016:AUC,
author = "Zhenzhe Zheng and Fan Wu and Shaojie Tang and Guihai
Chen",
title = "{AEGIS}: an unknown combinatorial auction mechanism
framework for heterogeneous spectrum redistribution in
noncooperative wireless networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1919--1932",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the growing deployment of wireless communication
technologies, radio spectrum is becoming a scarce
resource. Auctions are believed to be among the most
effective tools to solve or relieve the problem of
radio spectrum shortage. However, designing a practical
spectrum auction mechanism has to consider five major
challenges: strategic behaviors of unknown users,
channel heterogeneity, preference diversity, channel
spatial reusability, and social welfare maximization.
Unfortunately, none of the existing work fully
considered these five challenges. In this paper, we
model the problem of heterogeneous spectrum allocation
as a combinatorial auction, and propose AEGIS, which is
the first framework of unknown combinatorial Auction
mEchanisms for heteroGeneous spectrum redIStribution.
AEGIS contains two mechanisms, namely AEGIS-SG and
AEGIS-MP. AEGIS-SG is a direct revelation combinatorial
spectrum auction mechanism for unknown single-minded
users, achieving strategy-proofness and approximately
efficient social welfare. We further design an
iterative ascending combinatorial auction, namely
AEGIS-MP, to adapt to the scenario with unknown
multi-minded users. AEGIS-MP is implemented in a set of
undominated strategies and has a good approximation
ratio. We evaluate AEGIS on two practical datasets:
Google Spectrum Database and GoogleWiFi. Evaluation
results show that AEGIS achieves much better
performance than the state-of-the-art mechanisms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ruiz:2016:TNC,
author = "Hamlet Medina Ruiz and Michel Kieffer and Beatrice
Pesquet-Popescu",
title = "{TCP} and Network Coding: Equilibrium and Dynamic
Properties",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "1935--1947",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2477349",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper analyzes the impact on the stability of the
TCP-Reno congestion control mechanism when a network
coding NC layer is inserted in the TCP/IP stack. A
model of the dynamics of the TCP-NC protocol combined
with random early detection RED as active queue
management mechanism is considered to study the network
equilibrium and stability properties. The existence and
uniqueness of an equilibrium point is demonstrated and
characterized in terms of average throughput, loss
rate, and queue length. Global stability is proved in
absence of forward delay, and the effects of the NC
redundancy factor and of the delay on the local
stability of TCP-NC-RED are studied around the
equilibrium. The fairness of TCP-NC with respect to
TCP-Reno-like protocols is also studied. A version of
TCP-NC with adaptive redundancy factor TCP-NCAR is also
introduced. Results provided by the proposed model are
compared to those obtained by simulation for N sources
sharing a single link. TCP-NC-RED becomes unstable when
delay or capacity increases, as TCP-Reno does, but also
when the redundancy factor increases. Its stability
region is characterized as a function of the redundancy
factor. If TCP-NC and TCP-Reno share the same links,
TCP-NC is fair with TCP-Reno-like protocols when no
redundancy is added. Simulations show that TCP-NCAR is
able to compensate losses on the wireless parts 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{Liu:2016:PRD,
author = "Zhidan Liu and Zhenjiang Li and Mo Li and Wei Xing and
Dongming Lu",
title = "Path Reconstruction in Dynamic Wireless Sensor
Networks Using Compressive Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "1948--1960",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2435805",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents CSPR, a compressive-sensing-based
approach for path reconstruction in wireless sensor
networks. By viewing the whole network as a path
representation space, an arbitrary routing path can be
represented by a path vector in the space. As path
length is usually much smaller than the network size,
such path vectors are sparse, i.e., the majority of
elements are zeros. By encoding sparse path
representation into packets, the path vector and thus
the represented routing path can be recovered from a
small amount of packets using compressive sensing
technique. CSPR formalizes the sparse path
representation and enables accurate and efficient
per-packet path reconstruction. CSPR is invulnerable to
network dynamics and lossy links due to its distinct
design. A set of optimization techniques is further
proposed to improve the design. We evaluate CSPR in
both testbed-based experiments and large-scale
trace-driven simulations. Evaluation results show that
CSPR achieves high path recovery accuracy i.e., 100\%
and 96\% in experiments and simulations, respectively
and outperforms the state-of-the-art approaches in
various network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raina:2016:SPA,
author = "Gaurav Raina and Sreelakshmi Manjunath and Sai Prasad
and Krishnamurthy Giridhar",
title = "Stability and Performance Analysis of Compound {TCP}
With {REM} and Drop-Tail Queue Management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "1961--1974",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2448591",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study Compound TCP C-TCP, the default TCP in the
Windows operating system, with Random Exponential
Marking REM and the widely used Drop-Tail queue policy.
The performance metrics we consider are stability of
the queue size, queuing delay, link utilization, and
packet loss. We analyze the following models: (1) a
nonlinear model for C-TCP with Drop-Tail and small
buffers; (2) a stochastic variant of REM along with
C-TCP; and (3) the original REM proposal as a
continuous-time nonlinear model with delayed feedback.
We derive conditions to ensure local stability and show
that variations in system parameters can induce a Hopf
bifurcation, which would lead to the emergence of limit
cycles. With Drop-Tail and small buffers, the Compound
parameters and the buffer size both play a key role in
ensuring stability. In the stochastic variant of REM,
larger thresholds for marking/dropping packets can
destabilize the system. With the original REM proposal,
using Poincare\acute normal forms and the center
manifold analysis, we also characterize the type of the
Hopf bifurcation. This enables us to analytically
verify the stability of the bifurcating limit cycles.
Packet-level simulations corroborate some of the
analysis. Some design guidelines to ensure stability
and low latency are outlined.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ning:2016:FAP,
author = "Jianxia Ning and Shailendra Singh and Konstantinos
Pelechrinis and Bin Liu and Srikanth V. Krishnamurthy
and Ramesh Govindan",
title = "Forensic Analysis of Packet Losses in Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "1975--1988",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2448550",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the lossy nature of wireless links, it is
difficult to determine if packet losses are due to
wireless-induced effects or from malicious discarding.
Many prior efforts on detecting malicious packet drops
rely on evidence collected via passive monitoring by
neighbor nodes. However, they do not analyze the cause
of packet losses. In this paper, we ask: (1) Given
certain macroscopic parameters of the network like
traffic intensity and node density what is the
likelihood that evidence exists with respect to a
transmission? (2) How can these parameters be used to
perform a forensic analysis of the reason for the
losses? Toward answering the above questions, we first
build an analytical framework that computes the
likelihood that evidence we call this transmission
evidence, or TE for short exists with respect to
transmissions, in terms of a set of network parameters.
We validate our analytical framework via both
simulations as well as real-world experiments on two
different wireless testbeds. The analytical framework
is then used as a basis for a protocol within a
forensic analyzer to assess the cause of packet losses
and determine the likelihood of forwarding
misbehaviors. Through simulations, we find that our
assessments are close to the ground truth in all
examined cases, with an average deviation of 2.3\% from
the ground truth and a worst case deviation of
15.0\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qin:2016:ISR,
author = "Yi Qin and Riheng Jia and Jinbei Zhang and Weijie Wu
and Xinbing Wang",
title = "Impact of Social Relation and Group Size in Multicast
Ad Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "1989--2004",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2437955",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the multicast capacity of
static wireless social networks. We adopt the two-layer
network model, which includes the social layer and the
networking layer. In the social layer, the social group
size of each source node is modeled as power-law
distribution. Moreover, the rank-based model is
utilized to describe the relation between source and
destinations in the networking layer. Based on the
two-layer network model, the probability density
function PDF of the destination positions is analyzed
and verified by numerical simulation, which is
different from the traditional ad hoc networks.
According to the PDF, the bound of the network capacity
is derived, and we propose a Euclidean
minimum-spanning-tree-based transmission scheme, which
is proved to achieve the order of capacity bound for
most cases. Finally, the capacity of social networks is
compared to the traditional multicast ad hoc networks,
which indicates that the capacity scaling performs
better in social networks than traditional ones. To our
best knowledge, this is the first work of analyzing the
impact on the capacity of social relation and group
size in multicast ad hoc networks for the rank-based
model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Atya:2016:PAE,
author = "Ahmed Osama Fathy Atya and Ioannis Broustis and
Shailendra Singh and Dimitris Syrivelis and Srikanth V.
Krishnamurthy and Thomas F. {La Porta}",
title = "A Policy-Aware Enforcement Logic for Appropriately
Invoking Network Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2005--2018",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2438775",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding has been shown to offer significant
throughput benefits over certain wireless network
topologies. However, the application of network coding
may not always improve the network performance. In this
paper, we first provide an analytical study, which
helps in assessing when network coding is preferable to
a traditional store-and-forward approach.
Interestingly, our study reveals that in many
topological scenarios, network coding can in fact hurt
the throughput performance; in such scenarios, applying
the store-and-forward approach leads to higher network
throughput. We validate our analytical findings via
extensive testbed experiments. Guided by our findings
as our primary contribution, we design and implement
PACE, a Policy-Aware Coding Enforcement logic that
enables network coding only when it is expected to
offer performance benefits. Specifically, PACE
leverages a minimal set of periodic link quality
measurements in order to make per-flow online decisions
with regards to when network coding should be
activated, and when store-and-forward is preferable. It
can be easily embedded into network-coding-aware
routers as a user-level or kernel-level software
utility. We evaluate the efficacy of PACE via: (1) ns-3
simulations, and (2) experiments on a wireless testbed.
We observe that our scheme wisely activates network
coding only when appropriate, thereby improving the
total network throughput by as much as 350\% in some
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vyavahare:2016:OEF,
author = "Pooja Vyavahare and Nutan Limaye and D. Manjunath",
title = "Optimal Embedding of Functions for In-Network
Computation: Complexity Analysis and Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2019--2032",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2445835",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider optimal distributed computation of a given
function of distributed data. The input data nodes and
the sink node that receives the function form a
connected network that is described by an undirected
weighted network graph. The algorithm to compute the
given function is described by a weighted directed
acyclic graph and is called the computation graph. An
embedding defines the computation communication
sequence that obtains the function at the sink. Two
kinds of optimal embeddings are sought, the embedding
that: (1) minimizes delay in obtaining function at
sink, and (2) minimizes cost of one instance of
computation of function. This abstraction is motivated
by three applications --- in-network computation over
sensor networks, operator placement in distributed
databases, and module placement in distributed
computing. We first show that obtaining minimum-delay
and minimum-cost embeddings are both NP-complete
problems and that cost minimization is actually MAX
SNP-hard. Next, we consider specific forms of the
computation graph for which polynomial-time solutions
are possible. When the computation graph is a tree, a
polynomial-time algorithm to obtain the minimum-delay
embedding is described. Next, for the case when the
function is described by a layered graph, we describe
an algorithm that obtains the minimum-cost embedding in
polynomial time. This algorithm can also be used to
obtain an approximation for delay minimization. We then
consider bounded treewidth computation graphs and give
an algorithm to obtain the minimum-cost embedding in
polynomial time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chaporkar:2016:ODS,
author = "Prasanna Chaporkar and Stefan Magureanu and Alexandre
Proutiere",
title = "Optimal Distributed Scheduling in Wireless Networks
Under the {SINR} Interference Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2033--2045",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2444915",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless networks, the design of radio resource
sharing mechanisms is complicated by the complex
interference constraints among the various links. In
their seminal paper IEEE Trans. Autom. Control, vol.
37, no. 12, pp. 1936-1948, Tassiulas and Ephremides
introduced Maximum Weighted Scheduling, a centralized
resource sharing algorithm, and proved its optimality.
Since then, there have been extensive research efforts
to devise distributed implementations of this
algorithm. Recently, distributed adaptive CSMA
scheduling schemes have been proposed and shown to be
optimal, without the need of message passing among
transmitters. However, their analysis relies on the
assumption that interference can be accurately modeled
by a simple interference graph. In this paper, we
consider the more realistic and challenging
signal-to-interference-plus-noise ratio SINR
interference model. We present distributed scheduling
algorithms that: (1) are optimal under the SINR
interference model; and (2) do not require any message
passing. These algorithms are based on a combination of
a simple and efficient power allocation strategy
referred to as Power Packing and randomization
techniques. The optimality of our algorithms is
illustrated in various traffic scenarios using
numerical experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Markakis:2016:DSB,
author = "Mihalis G. Markakis and Eytan Modiano and John N.
Tsitsiklis",
title = "Delay Stability of Back-Pressure Policies in the
Presence of Heavy-Tailed Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2046--2059",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2448107",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study multihop networks with flow-scheduling
constraints, no constraints on simultaneous activation
of different links, potentially multiple
source-destination routes, and a mix of heavy-tailed
and light-tailed traffic. In this setting, we analyze
the delay performance of the widely studied class of
Back-Pressure scheduling policies, known for their
throughput optimality property, using as a performance
criterion the notion of delay stability, i.e., whether
the expected end-to-end delay in steady state is
finite. Our analysis highlights the significance of
``bottleneck links,'' i.e., links that are allowed to
serve the source queues of heavy-tailed flows. The main
idea is that traffic that has to pass through
bottleneck links experiences large delays under
Back-Pressure. By means of simple examples, we provide
insights into how the network topology, the routing
constraints, and the link capacities may facilitate or
hinder the ability of light-tailed flows to avoid
bottlenecks. Our delay-stability analysis is greatly
simplified by the use of fluid approximations, allowing
us to derive analytical results that would have been
hard to obtain through purely stochastic arguments.
Finally, we show how to achieve the best performance
with respect to the delay stability criterion, by using
a parameterized version of the Back-Pressure policy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2016:OAF,
author = "Weijie Shi and Linquan Zhang and Chuan Wu and Zongpeng
Li and Francis C. M. Lau",
title = "An Online Auction Framework for Dynamic Resource
Provisioning in Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2060--2073",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2444657",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Auction mechanisms have recently attracted substantial
attention as an efficient approach to pricing and
allocating resources in cloud computing. This work, to
the authors' knowledge, represents the first online
combinatorial auction designed for the cloud computing
paradigm, which is general and expressive enough to
both: (1) optimize system efficiency across the
temporal domain instead of at an isolated time point;
and (2) model dynamic provisioning of heterogeneous
virtual machine VM types in practice. The final result
is an online auction framework that is truthful,
computationally efficient, and guarantees a competitive
ratio \approx 3.30 in social welfare in typical
scenarios. The framework consists of three main steps:
(1) a tailored primal-dual algorithm that decomposes
the long-term optimization into a series of independent
one-shot optimization problems, with a small additive
loss in competitive ratio; (2) a randomized
subframework that applies primal-dual optimization for
translating a centralized cooperative social welfare
approximation algorithm into an auction mechanism,
retaining the competitive ratio while adding
truthfulness; and (3) a primal-dual algorithm for
approximating the one-shot optimization with a ratio
close to e. We also propose two extensions: (1) a
binary search algorithm that improves the average-case
performance; (2) an improvement to the online auction
framework when a minimum budget spending fraction is
guaranteed, which produces a better competitive ratio.
The efficacy of the online auction framework is
validated through theoretical analysis and trace-driven
simulation studies. We are also in the hope that the
framework can be instructive in auction design for
other related problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2016:RLT,
author = "Reuven Cohen and Gabi Nakibly",
title = "Restorable Logical Topology in the Face of No or
Partial Traffic Demand Knowledge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2074--2085",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2441108",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The construction of a logical network on top of a
physical optical infrastructure involves two
intertwined tasks: logical link selection-deciding
which pairs of routers will be connected by logical
links lightpaths; and logical link routing-deciding how
to route each logical link across the optical network.
The operator of such networks is often required to
maximize the available throughput while guaranteeing
its restorability. This paper is the first to combine
these seemingly conflicting goals into one optimization
criterion: maximizing the restorable throughput of the
end-to-end paths. We address this problem in three
cases: when the operator has no knowledge of the future
bandwidth demands, when it has partial knowledge, and
when it has full knowledge. We present efficient
algorithms for each of these cases and use extensive
simulations to compare their performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wildman:2016:CLP,
author = "Jeffrey Wildman and Steven Weber",
title = "On Characterizing the Local Pooling Factor of Greedy
Maximal Scheduling in Random Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2086--2099",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2451090",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The study of the optimality of low-complexity greedy
scheduling techniques in wireless communications
networks is a very complex problem. The Local Pooling
LoP factor provides a single-parameter means of
expressing the achievable capacity region and
optimality of one such scheme, greedy maximal
scheduling GMS. The exact LoP factor for an arbitrary
network graph is generally difficult to obtain, but may
be evaluated or bounded based on the network graph's
particular structure. In this paper, we provide
rigorous characterizations of the LoP factor in large
networks modeled as Erdo\ddot s-Re\acute nyi ER and
random geometric RG graphs under the primary
interference model. We employ threshold functions to
establish critical values for either the edge
probability or communication radius to yield useful
bounds on the range and expectation of the LoP factor
as the network grows large. For sufficiently dense
random graphs, we find that the LoP factor is between
1/2 and 2/3, while sufficiently sparse random graphs
permit GMS optimality the LoP factor is 1 with high
probability. We then place LoP within a larger context
of commonly studied random graph properties centered
around connectedness. We observe that edge densities
permitting connectivity generally admit cycle subgraphs
that form the basis for the LoP factor upper bound of
2/3. We conclude with simulations to explore the regime
of small networks, which suggest the probability that
an ER or RG graph satisfies LoP and is connected decays
quickly in network size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qian:2016:GRN,
author = "Chen Qian and Simon S. Lam",
title = "Greedy Routing by Network Distance Embedding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2100--2113",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2449762",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Greedy routing has been applied to both wireline and
wireless networks due to its scalability of routing
state and resiliency to network dynamics. In this work,
we solve a fundamental problem in applying greedy
routing to networks with arbitrary topologies, i.e.,
how to construct node coordinates such that greedy
routing can find near-optimal routing paths for various
routing metrics. We propose Greedy Distance Vector GDV,
the first greedy routing protocol designed to optimize
end-to-end path costs using any additive routing
metric, such as: hop count, latency, ETX, ETT, etc. GDV
requires no physical location information. Instead, it
relies on a novel virtual positioning protocol, VPoD,
which provides network distance embedding. Using VPoD,
each node assigns itself a position in a virtual space
such that the Euclidean distance between any two nodes
in the virtual space is a good estimate of the routing
cost between them. Experimental results using both real
and synthetic network topologies show that the routing
performance of GDV is better than prior geographic
routing protocols when hop count is used as metric and
much better when ETX is used as metric. As a greedy
routing protocol, the routing state of GDV per node
remains small as network size increases. We also show
that GDV and VPoD are highly resilient to dynamic
topology changes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Applegate:2016:OCP,
author = "David Applegate and Aaron Archer and Vijay
Gopalakrishnan and Seungjoon Lee and K. K.
Ramakrishnan",
title = "Optimal Content Placement for a Large-Scale {VoD}
System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2114--2127",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2461599",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IPTV service providers offering Video-on-Demand
currently use servers at each metropolitan office to
store all the videos in their library. With the rapid
increase in library sizes, it will soon become
infeasible to replicate the entire library at each
office. We present an approach for intelligent content
placement that scales to large library sizes e.g., 100
Ks of videos. We formulate the problem as a mixed
integer program MIP that takes into account constraints
such as disk space, link bandwidth, and content
popularity. To overcome the challenges of scale, we
employ a Lagrangian relaxation-based decomposition
technique combined with integer rounding. Our technique
finds a near-optimal solution e.g., within 1\%-2\% with
orders of magnitude speedup relative to solving even
the linear programming LP relaxation via standard
software. We also present simple strategies to address
practical issues such as popularity estimation, content
updates, short-term popularity fluctuation, and
frequency of placement updates. Using traces from an
operational system, we show that our approach
significantly outperforms simpler placement strategies.
For instance, our MIP-based solution can serve all
requests using only half the link bandwidth used by
least recently used LRU or least frequently used LFU
cache replacement policies. We also investigate the
tradeoff between disk space and network bandwidth.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liao:2016:LCG,
author = "Xiaofei Liao and Li Lin and Guang Tan and Hai Jin and
Xiaobin Yang and Wei Zhang and Bo Li",
title = "{LiveRender}: a Cloud Gaming System Based on
Compressed Graphics Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2128--2139",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2450254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cloud gaming systems, the game program runs at
servers in the cloud, while clients access game
services by sending input events to the servers and
receiving game scenes via video streaming. In this
paradigm, servers are responsible for all
performance-intensive operations, and thus suffer from
poor scalability. An alternative paradigm is called
graphics streaming, in which graphics commands and data
are offloaded to the clients for local rendering,
thereby mitigating the server's burden and allowing
more concurrent game sessions. Unfortunately, this
approach is bandwidth-consuming, due to large amounts
of graphic commands and geometry data. In this paper,
we present LiveRender, an open-source gaming system
that remedies the problem by implementing a suite of
bandwidth optimization techniques including intraframe
compression, interframe compression, and caching,
establishing what we call compressed graphics
streaming. Experiments results show that the new
approach is able to reduce bandwidth consumption by
52\%-73\% compared to raw graphics streaming, with no
perceptible difference in video quality and reduced
response delay. Compared to the video streaming
approach, LiveRender achieves a traffic reduction of
40\%-90\% with even improved video quality and
substantially smaller response delay, while enabling
higher concurrency at the server.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saleh:2016:PAN,
author = "Bassel Saleh and Dongyu Qiu",
title = "Performance Analysis of Network-Coding-Based {P2P}
Live Streaming Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2140--2153",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2448597",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer P2P video streaming is a scalable and
cost-effective technology to stream video content to a
large population of users and has attracted a lot of
research for over a decade now. Recently, network
coding has been introduced to improve the efficiency of
these systems and to simplify the protocol design.
There are already some successful commercial
applications that utilize network coding. However,
previous analytical studies of network-coding-based P2P
streaming systems mainly focused on fundamental
properties of the system and ignored the influence of
the protocol details. In this study, a unique
stochastic model is developed to reveal how segments of
the video stream evolve over their lifetime in the
buffer before they go into playback. Different
strategies for segment selection have been studied with
the model, and their performance has been compared. A
new approximation of the probability of linear
independence of coded blocks has been proposed to study
the redundancy of network coding. Finally, extensive
numerical results and simulations have been provided to
validate our model. From these results, in-depth
insights into how system parameters and segment
selection strategies affect the performance of the
system have been obtained.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2016:RTC,
author = "Luwei Cheng and Francis C. M. Lau",
title = "Revisiting {TCP} Congestion Control in a Virtual
Cluster Environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2154--2167",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2451161",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Virtual machines VMs are widely adopted today to
provide elastic computing services in datacenters, and
they still heavily rely on TCP for congestion control.
VM scheduling delays due to CPU sharing can cause
frequent spurious retransmit timeouts RTOs. Using
current detection methods, we find that such spurious
RTOs cannot be effectively identified because of the
retransmission ambiguity caused by the delayed ACK
DelACK mechanism. Disabling DelACK would add
significant CPU overhead to the VMs and thus degrade
the network's performance. In this paper, we first
report our practical experience about TCP's reaction to
VM scheduling delays. We then provide an analysis of
the problem that has two components corresponding to VM
preemption on the sender side and the receiver side,
respectively. Finally, we propose PVTCP, a
ParaVirtualized approach to counteract the distortion
of congestion information caused by the hypervisor
scheduler. PVTCP is completely embedded in the guest OS
and requires no modification in the hypervisor. Taking
incast congestion as an example, we evaluate our
solution in a 21-node testbed. The results show that
PVTCP has high adaptability in virtualized environments
and deals satisfactorily with the throughput collapse
problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2016:TDO,
author = "Guanfeng Liang and Ulas C. Kozat",
title = "On Throughput-Delay Optimal Access to Storage Clouds
via Load Adaptive Coding and Chunking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2168--2181",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2457834",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent literature including our past work provides
analysis and solutions for using: (1) erasure coding;
(2) parallelism; or (3) variable slicing/chunking i.e.,
dividing an object of a specific size into a variable
number of smaller chunks in speeding up the I/O
performance of storage clouds. However, a comprehensive
approach that considers all three dimensions together
to achieve the best throughput-delay tradeoff curve had
been lacking. This paper presents the first set of
solutions that can pick the best combination of coding
redundancy ratio and object chunking/slicing options as
the load dynamically changes. Our specific
contributions are as follows: (1) We establish via
measurements that combining variable redundancy ratio
and chunking is mostly feasible over a popular public
cloud. (2) We relate the delay-optimal values for
chunking level and code redundancy ratio to the queue
backlogs via an approximate queuing analysis. (3) Based
on this analysis, we propose TOFEC that adapts the
chunking level and redundancy ratio against the queue
backlogs. Our trace-driven simulation results show that
TOFEC's adaptation mechanism converges to an
appropriate code that provides the optimal
throughput-delay tradeoff without reducing system
capacity. Compared to a nonadaptive strategy optimized
for throughput, TOFEC delivers $ 2.5 \times $ lower
latency under light workloads; compared to a
nonadaptive strategy optimized for latency, TOFEC can
scale to support over $ 3 \times $ as many requests.
(4) We propose a simpler greedy solution that performs
on a par with TOFEC in average delay performance, but
exhibits significantly more performance variations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Le:2016:ADS,
author = "Anh Le and Athina Markopoulou and Alexandros G.
Dimakis",
title = "Auditing for Distributed Storage Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2182--2195",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2450761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 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 = "Distributed storage codes have recently received a lot
of attention in the community. Independently, another
body of work has proposed integrity-checking schemes
for cloud storage, none of which, however, is
customized for coding-based storage or can efficiently
support repair. In this work, we bridge the gap between
these two currently disconnected bodies of work. We
propose {\sf NC-Audit}, a novel cryptography-based
remote data integrity-checking scheme, designed
specifically for network-coding-based distributed
storage systems. {\sf NC-Audit} combines, for the first
time, the following desired properties: (1) efficient
checking of data integrity; (2) efficient support for
repairing failed nodes; and (3) protection against
information leakage when checking is performed by a
third party. The key ingredient of the design of {\sf
NC-Audit} is a novel combination of {\sf SpaceMac}, a
homomorphic message authentication code MAC scheme for
network coding, and {\sf NCrypt}, a novel
chosen-plaintext attack CPA secure encryption scheme
that preserves the correctness of {\sf SpaceMac}. Our
evaluation of {\sf NC-Audit} based on a real Java
implementation shows that the proposed scheme has
significantly lower overhead compared to the
state-of-the-art schemes for both auditing and
repairing of failed nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shamsi:2016:HSP,
author = "Zain Shamsi and Ankur Nandwani and Derek Leonard and
Dmitri Loguinov",
title = "{Hershel}: Single-Packet {OS} Fingerprinting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2196--2209",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2447492",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional TCP/IP fingerprinting tools e.g., nmap are
poorly suited for Internet-wide use due to the large
amount of traffic and intrusive nature of the probes.
This can be overcome by approaches that rely on a
single SYN packet to elicit a vector of features from
the remote server. However, these methods face
difficult classification problems due to the high
volatility of the features and severely limited amounts
of information contained therein. Since these
techniques have not been studied before, we first
pioneer stochastic theory of single-packet OS
fingerprinting, build a database of 116 OSs, design a
classifier based on our models, evaluate its accuracy
in simulations, and then perform OS classification of
37.8M hosts from an Internet-wide scan.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Peng:2016:TCT,
author = "Yang Peng and Kai Chen and Guohui Wang and Wei Bai and
Yangming Zhao and Hao Wang and Yanhui Geng and Zhiqiang
Ma and Lin Gu",
title = "Towards Comprehensive Traffic Forecasting in Cloud
Computing: Design and Application",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2210--2222",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2458892",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present our effort towards
comprehensive traffic forecasting for big data
applications using external, light-weighted file system
monitoring. Our idea is motivated by the key
observations that rich traffic demand information
already exists in the log and meta-data files of many
big data applications, and that such information can be
readily extracted through run-time file system
monitoring. As the first step, we use Hadoop as a
concrete example to explore our methodology and develop
a system called HadoopWatch to predict traffic demands
of Hadoop applications. We further implement
HadoopWatch in a small-scale testbed with 10 physical
servers and 30 virtual machines. Our experiments over a
series of MapReduce applications demonstrate that
HadoopWatch can forecast the traffic demand with almost
100\% accuracy and time advance. Furthermore, it makes
no modification on the Hadoop framework, and introduces
little overhead to the application performance.
Finally, to showcase the utility of accurate traffic
prediction made by HadoopWatch, we design and implement
a simple HadoopWatch-enabled network optimization
module into the HadoopWatch controller, and with
realistic Hadoop job benchmarks we find that even a
simple algorithm can leverage the forecasting results
provided by HadoopWatch to significantly improve the
Hadoop job completion time by up to 14.72\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neely:2016:EAW,
author = "Michael J. Neely",
title = "Energy-Aware Wireless Scheduling With Near-Optimal
Backlog and Convergence Time Tradeoffs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2223--2236",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2449323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers a wireless link with randomly
arriving data that are queued and served over a
time-varying channel. It is known that any algorithm
that comes within \varepsilon of the minimum average
power required for queue stability must incur average
queue size at least \Omega log1/\varepsilon. However,
the optimal convergence time is unknown. This paper
develops a scheduling algorithm that, for any
\varepsilon {$>$} 0, achieves the optimal
Olog1/\varepsilon average queue size tradeoff with a
convergence time of Olog1/\varepsilon /\varepsilon. An
example system is presented for which all algorithms
require convergence time at least \Omega 1/\varepsilon,
and so the proposed algorithm is within a logarithmic
factor of the optimal convergence time. The method uses
the simple drift-plus-penalty technique with an
improved convergence time analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2016:WBM,
author = "Longbo Huang and Shaoquan Zhang and Minghua Chen and
Xin Liu",
title = "When Backpressure Meets Predictive Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2237--2250",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2460749",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by the increasing popularity of learning and
predicting human user behavior in communication and
computing systems, in this paper, we investigate the
fundamental benefit of predictive scheduling, i.e.,
predicting and pre-serving arrivals, in controlled
queueing systems. Based on a lookahead-window
prediction model, we first establish a novel
queue-equivalence between the predictive queueing
system with a fully efficient scheduling scheme and an
equivalent queueing system without prediction. This
result allows us to analytically demonstrate that
predictive scheduling necessarily improves system delay
performance and drives it to zero with increasing
prediction power. It also enables us to exactly
determine the required prediction power for different
systems and study its impact on tail delay. We then
propose the Predictive Backpressure PBP algorithm for
achieving optimal utility performance in such
predictive systems. PBP efficiently incorporates
prediction into stochastic system control and avoids
the great complication due to the exponential state
space growth in the prediction window size. We show
that PBP achieves a utility performance that is within
O\varepsilon of the optimal, for any \varepsilon {$>$}
0, while guaranteeing that the system delay
distribution is a shifted-to-the-left version of that
under the original Backpressure algorithm. Hence, the
average delay under PBP is strictly better than that
under Backpressure, and vanishes with increasing
prediction window size. This implies that the resulting
utility-delay tradeoff with predictive scheduling can
beat the known optimal [O\varepsilon, Olog1/\varepsilon
] tradeoff for systems without prediction. We also
develop the Predictable-Only PBP POPBP algorithm and
show that it effectively reduces packet delay in
systems where traffic can only be predicted but not
pre-served.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fabini:2016:RTR,
author = "Joachim Fabini and Tanja Zseby",
title = "The Right Time: Reducing Effective End-to-End Delay in
Time-Slotted Packet-Switched Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2251--2263",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2451708",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern access network technologies like Long Term
Evolution LTE and High Speed Packet Access HSPA use
time-slotting mechanisms to optimize resource sharing
and overall network performance. In time-slotted
networks, the one-way delay of all packets in a packet
stream depends on the absolute point in time when the
first packet of the stream is sent. With appropriate
feedback signals, applications can exploit this effect
to reduce their effective end-to-end delay.
Time-critical applications such as real-time sensor
data acquisition or voice-over-IP VoIP communications
can shift their acquisition interval in order to adapt
to the network timing. Information about the actual
time-slotting periods can be gathered by active network
measurements or through implementation of cross-layer
information exchange. In this paper, a method is
proposed to determine the optimum send time for
particular destinations and to support applications in
adjusting their send time accordingly. Theoretical
findings are supported by the offline analysis of
measurement data and by a proof-of-concept
implementation that confirms the feasibility and
effectiveness of the proposed solution in operational
LTE and HSPA networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wei:2016:PAW,
author = "Xiaohan Wei and Michael J. Neely",
title = "Power-Aware Wireless File Downloading: a {Lyapunov}
Indexing Approach to a Constrained Restless Bandit
Problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2264--2277",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2456933",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper treats power-aware throughput maximization
in a multiuser file downloading system. Each user can
receive a new file only after its previous file is
finished. The file state processes for each user act as
coupled Markov chains that form a generalized restless
bandit system. First, an optimal algorithm is derived
for the case of one user. The algorithm maximizes
throughput subject to an average power constraint.
Next, the one-user algorithm is extended to a
low-complexity heuristic for the multiuser problem. The
heuristic uses a simple online index policy. In a
special case with no power-constraint, the multiuser
heuristic is shown to be throughput-optimal.
Simulations are used to demonstrate effectiveness of
the heuristic in the general case. For simple cases
where the optimal solution can be computed offline, the
heuristic is shown to be near-optimal for a wide range
of parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kwak:2016:HOM,
author = "Jaewook Kwak and Chul-Ho Lee and Do Young Eun",
title = "A High-Order {Markov}-Chain-Based Scheduling Algorithm
for Low Delay in {CSMA} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2278--2290",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2458703",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, several CSMA algorithms based on the Glauber
dynamics model have been proposed for wireless link
scheduling, as viable solutions to achieve the
throughput optimality, yet simple to implement.
However, their delay performance still remains
unsatisfactory, mainly due to the nature of the
underlying Markov chains that imposes a fundamental
constraint on how the link state can evolve over time.
In this paper, we propose a new approach toward better
queueing delay performance, based on our observation
that the algorithm needs not be Markovian, as long as
it can be implemented in a distributed manner. Our
approach hinges upon utilizing past state information
observed by local link and then constructing a
high-order Markov chain for the evolution of the
feasible link schedules. We show that our proposed
algorithm, named delayed CSMA, achieves the throughput
optimality, and also provides much better delay
performance by effectively ``decorrelating'' the link
state process and thus resolves link starvation. Our
simulation results demonstrate that the delay under our
algorithm can be reduced by a factor of 20 in some
cases, compared to the standard Glauber-dynamics-based
CSMA algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nikkhah:2016:MII,
author = "Mehdi Nikkhah and Roch Guerin",
title = "Migrating the {Internet} to {IPv6}: an Exploration of
the When and Why",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2291--2304",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2453338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper documents and to some extent elucidates the
progress of IPv6 across major Internet stakeholders
since its introduction in the mid 1990s. IPv6 offered
an early solution to a well-understood and
well-documented problem IPv4 was expected to encounter.
In spite of early standardization and awareness of the
issue, the Internet's march to IPv6 has been anything
but smooth, even if recent data point to an
improvement. This paper documents this progression for
several key Internet stakeholders using available
measurement data, and identifies changes in the IPv6
ecosystem that may be in part responsible for how it
has unfolded. The paper also develops a stylized model
of IPv6 adoption across those stakeholders, and
validates its qualitative predictive ability by
comparing it to measurement data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:FSR,
author = "Rui Li and Alex X. Liu and Ann L. Wang and Bezawada
Bruhadeshwar",
title = "Fast and Scalable Range Query Processing With Strong
Privacy Protection for Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2305--2318",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2457493",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Privacy has been the key road block to cloud computing
as clouds may not be fully trusted. This paper is
concerned with the problem of privacy-preserving range
query processing on clouds. Prior schemes are weak in
privacy protection as they cannot achieve index
indistinguishability, and therefore allow the cloud to
statistically estimate the values of data and queries
using domain knowledge and history query results. In
this paper, we propose the first range query processing
scheme that achieves index indistinguishability under
the indistinguishability against chosen keyword attack
IND-CKA. Our key idea is to organize indexing elements
in a complete binary tree called PBtree, which
satisfies structure indistinguishability i.e., two sets
of data items have the same PBtree structure if and
only if the two sets have the same number of data items
and node indistinguishability i.e., the values of
PBtree nodes are completely random and have no
statistical meaning. We prove that our scheme is secure
under the widely adopted IND-CKA security model. We
propose two algorithms, namely PBtree traversal width
minimization and PBtree traversal depth minimization,
to improve query processing efficiency. We prove that
the worst-case complexity of our query processing
algorithm using PBtree is O|R|logn, where n is the
total number of data items and R is the set of data
items in the query result. We implemented and evaluated
our scheme on a real-world dataset with 5 million
items. For example, for a query whose results contain
10 data items, it takes only 0.17 ms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2016:QAS,
author = "Joongheon Kim and Giuseppe Caire and Andreas F.
Molisch",
title = "Quality-Aware Streaming and Scheduling for
Device-to-Device Video Delivery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2319--2331",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2452272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "On-demand video streaming is becoming a killer
application for wireless networks. Recent
information-theoretic results have shown that a
combination of caching on the users' devices and
device-to-device D2D communications yields throughput
scalability for very dense networks, which represent
critical bottlenecks for conventional cellular and
wireless local area network WLAN technologies. In this
paper, we consider the implementation of such caching
D2D systems where each device pre-caches a subset of
video files from a library, and users requesting a file
that is not already in their library obtain it from
neighboring devices through D2D communication. We
develop centralized and distributed algorithms for the
delivery phase, encompassing a link scheduling and a
streaming component. The centralized scheduling is
based on the max-weighted independent set MWIS
principle and uses message-passing to determine
max-weight independent sets. The distributed scheduling
is based on a variant of the FlashLinQ link scheduling
algorithm, enhanced by introducing video-streaming
specific weights. In both cases, the streaming
component is based on a quality-aware stochastic
optimization approach, reminiscent of current Dynamic
Adaptive Streaming over HTTP DASH technology, for which
users sequentially request video ``chunks'' by choosing
adaptively their quality level. The streaming and the
scheduling components are coupled by the length of the
users' request queues. Through extensive system
simulation, the proposed approaches are shown to
provide sizeable gains with respect to baseline schemes
formed by the concatenation of off-the-shelf FlashLinQ
with proportional fair link scheduling and DASH at the
application layer.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hajikhani:2016:RMC,
author = "Mohammad Javad Hajikhani and Thomas Kunz and Howard
Schwartz",
title = "A Recursive Method for Clock Synchronization in
Asymmetric Packet-Based Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2332--2342",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2462772",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the context of the IEEE 1588 Precision Time
Protocol PTP, estimating the delay's bias is a problem
that appears in both one-way using transparent devices
or two-way message exchange mechanisms. For estimating
the offset via the two-way message exchange mechanism,
it is usually assumed that the expected value of delays
in forward and reverse directions are equal. However,
this is not a realistic assumption for packet-based
wide area networks, where delays in down-link and
up-link directions may have a significant difference.
In this work, we propose a solution to estimate the
random delay's bias and improve the synchronization
accuracy of IEEE 1588. Our method is easy to implement
and is compatible with the current version of the
protocol. We compared our results to no bias correction
and the Boot-strap method. In addition to the
improvement in synchronization accuracy, our method
allows us to update the slave clock recursively. The
proposed method works well even in the presence of
large frequency offsets and can also be implemented by
using different filters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2016:TLB,
author = "Cheng-Shang Chang and Wanjiun Liao and Tsung-Ying Wu",
title = "Tight Lower Bounds for Channel Hopping Schemes in
Cognitive Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2343--2356",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2453403",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the two-user multichannel
rendezvous problem in a cognitive radio network CRN and
derive tight lower bounds for maximum
time-to-rendezvous MTTR and maximum conditional
time-to-rendezvous MCTTR of various channel hopping CH
schemes under a channel loading constraint. In the
symmetric and synchronous setting, we propose a novel
Cycle-Adjustable Channel Hopping CACH scheme to achieve
the MTTR lower bound when the channel loading is
bounded above by 1/u with u being a prime power. Thus,
the MTTR lower bound is tight and the CACH scheme is
optimal in minimizing MTTR among all the symmetric and
synchronous CH schemes under the same channel loading
constraint. In the asymmetric setting, we show that the
classical wait-for-mommy strategy can be used to
achieve the MCTTR lower bound, and thus it is optimal.
In the symmetric and asynchronous setting, we also show
a hierarchical construction of an asynchronous CH
sequence by using two smaller asynchronous CH
sequences. To further understand the effect of channel
loading to the other performance metrics in a CRN, we
perform various computer simulations for various CH
schemes. Our simulation results show that the average
time-to-rendezvous of CACH is independent of the total
number of channels, and it is also robust to the
disturbance of primary users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tadrous:2016:JSP,
author = "John Tadrous and Atilla Eryilmaz and Hesham {El
Gamal}",
title = "Joint Smart Pricing and Proactive Content Caching for
Mobile Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2357--2371",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2453793",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this work, we formulate and study the profit
maximization problem for a wireless service provider SP
that encounters time-varying, yet partially
predictable, demand characteristics. The disparate
demand levels throughout the course of the day yield
excessive service cost in the peak hour that
substantially hurts the reaped profit. With the SP's
ability to track and statistically predict future
requests of its users, we propose to enable proactive
caching of the peak hour demand ahead during off-peak
times. Thus, network traffic will be smoothed out,
while end-users' activity patterns are undisturbed. In
addition, the SP is able to assign personalized pricing
policies that strike the best balance between enhancing
the certainty about the future demand for optimal
proactive caching and maximizing the revenue collected
from end-users. Comparing the proposed system's
performance to the baseline scenario of the existing
practice of no-proactive service, we show that the SP
attains profit gain that grows with number of users, at
least, as the first derivative of the cost function.
Moreover, end-users that receive proactive caching
services make strictly positive savings. Thus, we
essentially demonstrate the win-win situation to be
reaped through the exploitation of the consistent
users' activity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2016:ART,
author = "Wei Dong and Jie Yu and Jiliang Wang and Xuefeng Zhang
and Yi Gao and Chun Chen and Jiajun Bu",
title = "Accurate and Robust Time Reconstruction for Deployed
Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2372--2385",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2456214",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The notion of global time is of great importance for
many sensor network applications. Time reconstruction
methods aim to reconstruct the global time with respect
to a reference clock. To achieve microsecond accuracy,
MAC-layer timestamping is required for recording packet
transmission and reception times. The timestamps,
however, can be invalid due to multiple reasons, such
as imperfect system designs, wireless corruptions, or
timing attacks, etc. In this paper, we propose ART, an
accurate and robust time reconstruction approach to
detecting invalid timestamps and recovering the needed
information. ART is much more accurate and robust than
threshold-based approach, especially in dynamic
networks with inherently varying propagation delays. We
evaluate our approach in both testbed and a real-world
deployment. Results show that: (1) ART achieves a high
detection accuracy with low false-positive rate and low
false-negative rate; (2) ART achieves a high recovery
accuracy of less than 2 ms on average, much more
accurate than previously reported results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tian:2016:TAS,
author = "Guibin Tian and Yong Liu",
title = "Towards Agile and Smooth Video Adaptation in {HTTP}
Adaptive Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2386--2399",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2464700",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "HTTP Adaptive Streaming HAS is widely deployed on the
Internet for live and on-demand video streaming
services. Video adaptation algorithms in the existing
HAS systems are either too sluggish to respond to
congestion level shifts or too sensitive to short-term
network bandwidth variations. Both degrade user video
experience. In this paper, we formally study the
tradeoff between responsiveness and smoothness in HAS
through analysis and experiments. We show that
client-side buffered video time is a good feedback
signal to guide video adaptation. We then propose novel
video rate control algorithms that balance the needs
for video rate smoothness and high bandwidth
utilization. We show that a small video rate margin can
lead to much improved smoothness in video rate and
buffer size. We also propose HAS designs that can work
with multiple servers and wireless connections. We
develop a fully functional HAS system and evaluate its
performance through extensive experiments on a network
testbed and the Internet. We demonstrate that our HAS
designs are highly efficient and robust in realistic
network environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:OAA,
author = "Alex X. Liu and Eric Torng",
title = "Overlay Automata and Algorithms for Fast and Scalable
Regular Expression Matching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2400--2415",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2533605",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Regular expression RegEx matching, the core operation
of intrusion detection and prevention systems, remains
a fundamentally challenging problem. A desired RegEx
matching scheme should satisfy four requirements:
deterministic finite state automata DFA speed,
nondeterministic finite state automata NFA size,
automated construction, and scalable construction.
Despite lots of work on RegEx matching, no prior scheme
satisfies all four of these requirements. In this
paper, we approach this holy grail by proposing
OverlayCAM, a RegEx matching scheme that satisfies all
four requirements. The theoretical underpinning of our
scheme is overlay delayed input DFA, a new automata
model proposed in this paper that captures both state
replication and transition replication, which are
inherent in DFAs. Our RegEx matching solution processes
one input character per lookup like a DFA, requires
only the space of an NFA, is grounded in sound automata
models, is easy to deploy in existing network devices,
and comes with scalable and automated construction
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jeong:2016:EEW,
author = "Jaeseong Jeong and Yung Yi and Jeong-Woo Cho and Do
Young Eun and Song Chong",
title = "Energy-Efficient {Wi-Fi} Sensing Policy Under
Generalized Mobility Patterns With Aging",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2416--2428",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2468590",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An essential condition precedent to the success of
mobile applications based on Wi-Fi e.g., iCloud is an
energy-efficient Wi-Fi sensing. Clearly, a good Wi-Fi
sensing policy should factor in both inter-access point
AP arrival time IAT and contact duration time CDT
distributions of each individual. However, prior work
focuses on limited cases of those two distributions
e.g., exponential or proposes heuristic approaches such
as Additive Increase AI. In this paper, we first
formulate a generalized functional optimization problem
on Wi-Fi sensing under general inter-AP and contact
duration distributions and investigate how each
individual should sense Wi-Fi APs to strike a good
balance between energy efficiency and performance,
which is in turn intricately linked with users mobility
patterns. We then derive a generic optimal condition
that sheds insights into the aging property,
underpinning energy-aware Wi-Fi sensing polices. In
harnessing our analytical findings and the implications
thereof, we develop a new sensing algorithm, called
Wi-Fi Sensing with AGing WiSAG, and demonstrate that
WiSAG outperforms the existing sensing algorithms up to
37\% through extensive trace-driven simulations for
which real mobility traces gathered from hundreds of
smartphones is used.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nencioni:2016:SEG,
author = "Gianfranco Nencioni and Nishanth Sastry and Gareth
Tyson and Vijay Badrinarayanan and Dmytro Karamshuk and
Jigna Chandaria and Jon Crowcroft",
title = "{SCORE}: Exploiting Global Broadcasts to Create
Offline Personal Channels for On-Demand Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2429--2442",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2456186",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The last 5 years have seen a dramatic shift in media
distribution. For decades, TV and radio were solely
provisioned using push-based broadcast technologies,
forcing people to adhere to fixed schedules. The
introduction of catch-up services, however, has now
augmented such delivery with online pull-based
alternatives. Typically, these allow users to fetch
content for a limited period after initial broadcast,
allowing users flexibility in accessing content.
Whereas previous work has investigated both of these
technologies, this paper explores and contrasts them,
focusing on the network consequences of moving towards
this multifaceted delivery model. Using traces from
nearly 6 million users of BBC iPlayer, one of the
largest catch-up TV services, we study this shift from
push- to pull-based access. We propose a novel
technique for unifying both push- and pull-based
delivery: the Speculative Content Offloading and
Recording Engine SCORE. SCORE operates as a set-top
box, which interacts with both broadcast push and
online pull services. Whenever users wish to access
media, it automatically switches between these
distribution mechanisms in an attempt to optimize
energy efficiency and network resource utilization.
SCORE also can predict user viewing patterns,
automatically recording certain shows from the
broadcast interface. Evaluations using our BBC iPlayer
traces show that, based on parameter settings, an
oracle with complete knowledge of user consumption can
save nearly 77\% of the energy, and over 90\% of the
peak bandwidth, of pure IP streaming. Optimizing for
energy consumption, SCORE can recover nearly half of
both traffic and energy savings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiang:2016:JLC,
author = "Yu Xiang and Tian Lan and Vaneet Aggarwal and Yih-Farn
R. Chen",
title = "Joint Latency and Cost Optimization for Erasure-Coded
Data Center Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2443--2457",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2466453",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern distributed storage systems offer large
capacity to satisfy the exponentially increasing need
of storage space. They often use erasure codes to
protect against disk and node failures to increase
reliability, while trying to meet the latency
requirements of the applications and clients. This
paper provides an insightful upper bound on the average
service delay of such erasure-coded storage with
arbitrary service time distribution and consisting of
multiple heterogeneous files. Not only does the result
supersede known delay bounds that only work for a
single file or homogeneous files, it also enables a
novel problem of joint latency and storage cost
minimization over three dimensions: selecting the
erasure code, placement of encoded chunks, and
optimizing scheduling policy. The problem is
efficiently solved via the computation of a sequence of
convex approximations with provable convergence. We
further prototype our solution in an open-source cloud
storage deployment over three geographically
distributed data centers. Experimental results validate
our theoretical delay analysis and show significant
latency reduction, providing valuable insights into the
proposed latency-cost tradeoff in erasure-coded
storage.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hariharan:2016:SPO,
author = "Srikanth Hariharan and Ness B. Shroff",
title = "On Sample-Path Optimal Dynamic Scheduling for
Sum-Queue Minimization in Trees Under the {$K$}-Hop
Interference Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2458--2471",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2464723",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
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 tree topology. Nodes send their packets
to the tree's root sink. We consider a time-slotted
system and a K-hop interference model. We characterize
the existence of causal sample-path optimal scheduling
policies in these networks, i.e., we wish to find a
policy such that at each time-slot, for any traffic
arrival pattern, the sum of the queue lengths of all
the nodes is minimum among all policies. We provide an
algorithm that takes any tree and K as inputs, and
outputs whether a causal sample-path optimal policy
exists for this tree under the K-hop interference
model. We show that when this algorithm returns FALSE,
there exists a traffic arrival pattern for which no
causal sample-path optimal policy exists for the given
tree structure. We further show that for certain tree
structures, even noncausal sample-path optimal policies
do not exist. We provide causal sample-path optimal
policies for those tree structures for which the
algorithm returns TRUE. Thus, we completely
characterize the existence of such policies for all
trees under the K-hop interference model. The
nonexistence of sample-path optimal policies in a large
class of tree structures implies that we need to study
other relatively weaker metrics for this problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:SEG,
author = "Chen Wang and Hongbo Jiang and Tianlong Yu and John C.
S. Lui",
title = "{SLICE}: Enabling Greedy Routing in High Genus {$3$-D}
{WSNs} With General Topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2472--2484",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2464312",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a highly efficient scheme,
SLICE a scalable and low stretch routing scheme,
enabling greedy routing for wireless sensor networks
WSNs deployed in complex-connected 3-D settings, whose
topologies are often theoretically modeled as high
genus 3-D WSNs. Compared to previous 3-D greedy
embedding techniques, SLICE improves both the
robustness and applicability. (1) It achieves a smaller
distance distortion and a lower routing stretch with
guaranteed delivery. While it follows the basic idea to
embed the surface network to a planar topology to
enable greedy routing, the embedding method proposed in
SLICE is novel. We first slice the surface network to a
genus-0 open surface with exactly one boundary. Then,
to achieve a lower distance distortion, we purposely
propose a variation of the Ricci flow algorithm, by
which this open surface is flattened not to a planar
annulus, but to a planar convex polygon, resulting in a
lower routing stretch. (2) This is the first work, to
the best of our knowledge, that enables greedy routing
in high genus 3-D WSNs with general topologies. SLICE
not only works for high genus 3-D surface WSNs, but
also can be easily adapted to more general cases: high
genus 3-D surface networks with holes, and high genus
3-D volume networks. For a high genus 3-D surface
network with holes, SLICE embeds it to a planar convex
polygon with circular holes, where our proposed greedy
routing variation can be applied. For a high genus 3-D
volume network, SLICE embeds the inner nodes to a
height structure attached to the convex polygon, and a
variation of greedy routing scheme with guaranteed
delivery is proposed in this structure. The
effectiveness of SLICE is validated 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{Dong:2016:DAD,
author = "Wei Dong and Swati Rallapalli and Lili Qiu and K. K.
Ramakrishnan and Yin Zhang",
title = "Double Auctions for Dynamic Spectrum Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2485--2497",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2476497",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless spectrum is a precious resource and must be
allocated and used efficiently. Conventional spectrum
allocations let a government agency e.g., FCC sell a
portion of spectrum to one provider. This is not only
restrictive, but also limits spectrum reuse and may
lead to significant under-utilization of spectrum. In
this paper, we develop a novel truthful double-auction
scheme to let any resource owner e.g., a cellular
provider, who has spare spectrum at a given time
period, sell to one or more providers that need
additional spectrum at that time. Spectrum auctions are
fundamentally different from conventional auction
problems since spectrum can be reused and competition
among buyers is complex due to wireless interference.
Our proposal is the first double-auction design for
spectrum allocation that explicitly decouples the
buyer-side and seller-side auction design while
achieving: (1) truthfulness; (2) individual
rationality; and (3) budget-balance. To accurately
capture wireless interference and support spectrum
reuse, we partition the conflict graph so that buyers
with strong direct and indirect interference are put
into the same subgraph, and buyers with no interference
or weak interference are put into separate subgraphs.
Then, we compute pricing independently within each
subgraph. We then develop a scheme to combine spectrum
allocation results from different subgraphs and resolve
potential conflicts. We further extend our approach to
support local sellers whose spectrum can only be sold
to buyers within certain regions, instead of all
buyers. Using conflict graphs generated from real cell
tower locations, we extensively evaluate our approach
and demonstrate that it achieves high efficiency,
revenue, and utilization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Du:2016:RDE,
author = "Wan Du and Zhenjiang Li and Jansen Christian Liando
and Mo Li",
title = "From Rateless to Distanceless: Enabling Sparse Sensor
Network Deployment in Large Areas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2498--2511",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2476349",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a distanceless networking approach
for wireless sensor networks sparsely deployed in large
areas. By leveraging rateless codes, we provide
distanceless transmission to expand the communication
range of sensor motes and fully exploit network
diversity. We address a variety of practical challenges
to accommodate rateless coding on resource-constrained
sensor motes and devise a communication protocol to
efficiently coordinate the distanceless link
transmissions. We propose a new metric expected
distanceless transmission time for routing selection
and further adapt the distanceless transmissions to low
duty-cycled sensor networks. We implement the proposed
scheme in TinyOS on the TinyNode platform and deploy
the sensor network in a real-world project, in which 12
wind measurement sensors are installed around a large
urban reservoir of $ 2.5 \times 3.0 {\rm km}^2 $ to
monitor the field wind distribution. Extensive
experiments show that our proposed scheme significantly
outperforms the state-of-the-art approaches for data
collection in sparse sensor networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wong:2016:ESR,
author = "Felix Ming Fai Wong and Zhenming Liu and Mung Chiang",
title = "On the Efficiency of Social Recommender Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2512--2524",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2475616",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study a fundamental question that arises in social
recommender systems: whether it is possible to
simultaneously maximize: (1) an individual's benefit
from using a social network, and (2) the efficiency of
the network in disseminating information. To tackle
this question, our study consists of three components.
First, we introduce a stylized stochastic model for
recommendation diffusion. Such a model allows us to
highlight the connection between user experience at the
individual level, and network efficiency at the
macroscopic level. We also propose a set of metrics for
quantifying both user experience and network
efficiency. Second, based on these metrics, we
extensively study the tradeoff between the two factors
in a Yelp dataset, concluding that Yelp's social
network is surprisingly efficient, though not optimal.
Finally, we design a friend recommendation and news
feed curation algorithm that can simultaneously address
individuals' need to connect to high-quality friends,
and service providers' need to maximize network
efficiency in information propagation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Donvito:2016:NNM,
author = "Lidia Donvito and Laura Galluccio and Alfio Lombardo
and Giacomo Morabito",
title = "{$ \mu $-NET}: a Network for Molecular Biology
Applications in Microfluidic Chips",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2525--2538",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2472564",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces \mu -NET, a microfluidic LAN
that supports the exchange of both digital information
and biochemical information carried by droplets moving
across molecular processors in a microfluidic chip. The
\mu -NET can be used to support molecular biology
applications like DNA, RNA, and protein biosynthesis.
The \mu -NET is the first realization of a microfluidic
networking paradigm that controls movements of droplets
in microfluidic chips by exploiting hydrodynamic
phenomena only and builds on recent solutions to
achieve communications in the microfluidic domain. The
\mu -NET integrates techniques to represent addressing
information, as well as switching and medium access
control solutions. In fact, in \mu -NET, the address of
the molecular processor where a droplet should be sent
to is encoded into the distance between droplets;
switching is executed to steer the droplets inside the
microfluidic device; medium access control is applied
to avoid collisions between droplets that may result in
their fusion and, thus, loss of the biochemical
information. In this paper, the design of \mu -NET is
presented in detail, and simulation results validating
\mu -NET operations are shown.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Malboubi:2016:DNI,
author = "Mehdi Malboubi and Cuong Vu and Chen-Nee Chuah and
Puneet Sharma",
title = "Decentralizing Network Inference Problems With
Multiple-Description Fusion Estimation {MDFE}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2539--2552",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2475362",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network inference or tomography problems, such as
traffic matrix estimation or completion and link loss
inference, have been studied rigorously in different
networking applications. These problems are often posed
as under-determined linear inverse UDLI problems and
solved in a centralized manner, where all the
measurements are collected at a central node, which
then applies a variety of inference techniques to
estimate the attributes of interest. This paper
proposes a novel framework for decentralizing these
large-scale under-determined network inference problems
by intelligently partitioning it into smaller
subproblems and solving them independently and in
parallel. The resulting estimates, referred to as
multiple descriptions, can then be fused together to
compute the global estimate. We apply this Multiple
Description and Fusion Estimation MDFE framework to
three classical problems: traffic matrix estimation,
traffic matrix completion, and loss inference. Using
real topologies and traces, we demonstrate how MDFE can
speed up computation while maintaining even improving
the estimation accuracy and how it enhances robustness
against noise and failures. We also show that our MDFE
framework is compatible with a variety of existing
inference techniques used to solve the UDLI problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Harks:2016:RGP,
author = "Tobias Harks and Martin Hoefer and Kevin Schewior and
Alexander Skopalik",
title = "Routing Games With Progressive Filling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2553--2562",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2468571",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Max-min fairness MMF is a widely known approach to a
fair allocation of bandwidth to each of the users in a
network. This allocation can be computed by uniformly
raising the bandwidths of all users without violating
capacity constraints. We consider an extension of these
allocations by raising the bandwidth with arbitrary and
not necessarily uniform time-depending velocities
allocation rates. These allocations are used in a
game-theoretic context for routing choices, which we
formalize in progressive filling games PFGs. We present
a variety of results for equilibria in PFGs. We show
that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard,
there are polynomial-time algorithms for prominent
classes of Max-Min-Fair Games MMFG, including the case
when all users have the same source-destination pair.
We characterize prices of anarchy and stability for
pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination
pairs. In addition, we show that when a designer can
adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on
polynomial-time algorithms in this direction are also
derived.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2016:SCV,
author = "Richard T. B. Ma",
title = "Subsidization Competition: Vitalizing the Neutral
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2563--2576",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2466603",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Unlike telephone operators, which pay termination fees
to reach the users of another network, Internet content
providers CPs do not pay the Internet service providers
ISPs of users they reach. While the consequent cross
subsidization to CPs has nurtured content innovations
at the edge of the Internet, it reduces the investment
incentives for the access ISPs to expand capacity. As
potential charges for terminating CPs' traffic are
criticized under the net neutrality debate, we propose
to allow CPs to voluntarily subsidize the usage-based
fees induced by their content traffic for end-users. We
model the regulated subsidization competition among the
CPs under a neutral network and show how deregulation
of subsidization could increase an access ISP's
utilization and revenue, strengthening its investment
incentives. Our results suggest that subsidization
competition will increase the competitiveness and
welfare of the Internet content market. However,
regulators might need to: (1) regulate access prices if
the access ISP market is not competitive enough; and
(2) regulate subsidies if network is highly congested.
We envision that subsidization competition could become
a viable net-neutral model for the future Internet.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2016:CCS,
author = "Huasen Wu and Xiaojun Lin and Xin Liu and Kun Tan and
Yongguang Zhang",
title = "{CoSchd}: Coordinated Scheduling With Channel and Load
Awareness for Alleviating Cellular Congestion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2579--2592",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2470076",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although cellular networks can be provisioned
according to the peak demand, they usually experience
large fluctuations in both channel conditions and
traffic load level. Scheduling with both channel and
load awareness allows us to exploit the delay tolerance
of data traffic to alleviate network congestion, and
thus reduce the peak. However, solving the optimal
scheduling problem leads to a large-scale Markov
decision process MDP with extremely high complexity. In
this paper, we propose a scalable and distributed
approach to this problem, called Coordinated Scheduling
CoSchd. CoSchd decomposes the large-scale MDP problem
into many individual MDP problems, each of which can be
solved independently by each user under a limited
amount of coordination signals from the base station
BS. We show that CoSchd is close to optimal when the
number of users becomes large. Furthermore, we propose
an approximation of CoSchd that iteratively updates the
scheduling policy based on online measurements.
Simulation results demonstrate that exploiting channel
and load awareness with CoSchd can effectively
alleviate cellular network congestion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Niu:2016:AFP,
author = "Di Niu and Baochun Li and Di Niu and Baochun Li",
title = "An Asynchronous Fixed-Point Algorithm for Resource
Sharing With Coupled Objectives",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2593--2606",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2480418",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed resource allocation and sharing can often
be formulated as a utility maximization problem, with
the objective being the sum of user utilities minus a
coupled cost. A traditional distributed solution to
such problems, called ``consistency pricing,''
decouples the objective function via dual
decomposition, which is then iteratively solved by the
subgradient method. However, such gradient-based
approaches may require many iterations of message
passing to converge, which may not be sufficient in
large-scale real-time applications. In this paper, we
propose a new fixed-point-like distributed solution to
resource sharing problems with coupled objective
functions. While preserving the simple pricing
interpretation, our approach speeds up convergence by
exploiting the structural difference between user
utilities and the coupled cost function. We
theoretically analyze the asynchronous algorithm
convergence conditions based on contraction mapping.
Through a detailed case study of cloud bandwidth
reservation based on real-world workload traces, we
demonstrate the benefits of the proposed algorithm over
state-of-the-art distributed optimization techniques
including gradient descent, dual decomposition, and
ADMM. In addition, we also extend the proposed
algorithm to approach a more general class of consensus
optimization problems with not only a coupled objective
function, but also a certain class of coupled
constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2016:CPD,
author = "Can Zhao and Jian Zhao and Xiaojun Lin and Chuan Wu",
title = "Capacity of {P2P} On-Demand Streaming With Simple,
Robust, and Decentralized Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2607--2620",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2476506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The performance of large-scale peer-to-peer P2P
video-on-demand VoD streaming systems can be very
challenging to analyze due to sparse connectivity and
complex, random dynamics. Specifically, in practical
P2P VoD systems, each peer only interacts with a small
number of other peers/neighbors. Furthermore, its
upload capacity, downloading position, and content
availability change dynamically and randomly. In this
paper, we rigorously study large-scale P2P VoD systems
with sparse connectivity among peers and investigate
simple and decentralized P2P control strategies that
can provably achieve close-to-optimal streaming
capacity. We first focus on a single streaming channel.
Using a simple algorithm that assigns each peer a
random set of $ \Theta \log N $ neighbors and allocates
upload capacity uniformly, we show that a
close-to-optimal streaming rate can be asymptotically
achieved for all peers with high probability as the
number of peers $N$ increases. Furthermore, the tracker
does not need to obtain detailed knowledge of which
chunks each peer caches, and hence incurs low overhead.
We then study multiple streaming channels where peers
watching one channel may help peers in another channel
with insufficient upload bandwidth. We propose a simple
random cache-placement strategy and show that a
close-to-optimal streaming capacity region for all
channels can be attained with high probability, again
with only $ \Theta \log N$ per-peer neighbors. These
results provide important insights into the dynamics of
large-scale P2P VoD systems, which will be useful for
guiding the design of improved P2P control protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lopes:2016:PDF,
author = "Luis Amaral Lopes and Rute Sofia and Huseyin Haci and
Huiling Zhu",
title = "A Proposal for Dynamic Frequency Sharing in Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2621--2633",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2477560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless networks are today employed as complementary
access technology, implemented on the last hop towards
the Internet end-user. The shared media that wireless
deployments provide and which is relevant to
interconnect multiple users has a limited technical
design, as only one device can be served per unit of
time, design aspect that limits the potential
applicability of wireless in dense environments. This
paper proposes and evaluates a novel MAC-layer
mechanism that extends current wireless networks with
the possibility to perform downstream transmission to
multiple devices within a single transmission
time-frame, resulting in improved fairness for all
devices. The mechanism, which is software-defined, is
backward-compatible with current wireless standards and
does not require any hardware changes. The solution has
been validated in a realistic testbed, and the paper
provides details concerning the computational aspects
of our solution; a description of the implementation;
and results extracted under different realistic
scenarios in terms of throughput, packet loss, as well
as jitter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kvaternik:2016:MDS,
author = "Karla Kvaternik and Jaime Llorca and Daniel Kilper and
Lacra Pavel",
title = "A Methodology for the Design of Self-Optimizing,
Decentralized Content-Caching Strategies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2634--2647",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2478059",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of efficient content delivery
over networks in which individual nodes are equipped
with content caching capabilities. We present a
flexible methodology for the design of cooperative,
decentralized caching strategies that can adapt to
real-time changes in regional content popularity. This
design methodology makes use of a recently proposed
reduced consensus optimization scheme, in which a
number of networked agents cooperate in locating the
optimum of the sum of their individual, privately known
objective functions. The outcome of the design is a set
of dynamic update rules that stipulate how much and
which portions of each content piece an individual
network node ought to cache. In implementing these
update rules, the nodes achieve a collectively optimal
caching configuration through nearest-neighbor
interactions and measurements of local content request
rates only. Moreover, individual nodes need not be
aware of the overall network topology or how many other
nodes are on the network. The desired caching behavior
is encoded in the design of individual nodes' costs and
can incorporate a variety of network performance
criteria. Using the proposed methodology, we develop a
set of content-caching update rules designed to
minimize the energy consumption of the network as a
whole by dynamically trading off transport and caching
energy costs in response to changes in content
demand.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garlapati:2016:SSM,
author = "Shravan Garlapati and Teja Kuruganti and Michael R.
Buehrer and Jeffrey H. Reed and Shravan Garlapati and
Teja Kuruganti and Michael R. Buehrer and Jeffrey H.
Reed",
title = "{SMAC}: a Soft {MAC} to Reduce Control Overhead and
Latency in {CDMA}-Based {AMI} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2648--2662",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2481718",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The use of state-of-the-art 3G cellular CDMA
technologies in a utility owned AMI network results in
a large amount of control traffic relative to data
traffic, increases the average packet delay and hence
are not an appropriate choice for smart grid
distribution applications. Like the CDG, we consider a
utility owned cellular like CDMA network for smart grid
distribution applications and classify the distribution
smart grid data as scheduled data and random data.
Also, we propose SMAC protocol, which changes its mode
of operation based on the type of the data being
collected to reduce the data collection latency and
control overhead when compared to 3G cellular CDMA2000
MAC. The reduction in the data collection latency and
control overhead aids in increasing the number of smart
meters served by a base station within the periodic
data collection interval, which further reduces the
number of base stations needed by a utility or reduces
the bandwidth needed to collect data from all the smart
meters. The reduction in the number of base stations
and/or the reduction in the data transmission bandwidth
reduces the CAPital EXpenditure CAPEX and OPerational
EXpenditure OPEX of the AMI network. The proposed SMAC
protocol is analyzed using Markov chain, analytical
expressions for average throughput and average packet
delay are derived, and simulation results are also
provided to verify the analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chatzipapas:2016:MGM,
author = "Angelos Chatzipapas and Vincenzo Mancuso",
title = "An {M/G/1} Model for Gigabit Energy Efficient
{Ethernet} Links With Coalescing and Real-Trace-Based
Evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2663--2675",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2477090",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we analytically model the behavior of
gigabit Energy Efficient Ethernet EEE links with
coalescing using M/G/1 queues with sleep and wake-up
periods. The particularity of gigabit EEE links is that
energy-saving operations are triggered only when links
are inactive in both transmission directions. Our model
approximates with a good accuracy both the energy
saving and the average packet delay by using a few
significant traffic descriptors. Furthermore, we use
real traffic traces to investigate on the performance
of static as well as dynamic coalescing schemes.
Surprisingly, our evaluation shows that dynamic
coalescing does not significantly outperform static
coalescing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Valls:2016:MWR,
author = "Victor Valls and Douglas J. Leith",
title = "Max-Weight Revisited: Sequences of Nonconvex
Optimizations Solving Convex Optimizations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2676--2689",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2480890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the connections between max-weight
approaches and dual subgradient methods for convex
optimization. We find that strong connections exist,
and we establish a clean, unifying theoretical
framework that includes both max-weight and dual
subgradient approaches as special cases. Our analysis
uses only elementary methods and is not asymptotic in
nature. It also allows us to establish an explicit and
direct connection between discrete queue occupancies
and Lagrange multipliers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:AMC,
author = "Bei Liu and Wei Wang and Donghyun Kim and Deying Li
and Jingyi Wang and Alade O. Tokuta and Yaolin Jiang",
title = "On Approximating Minimum $3$-Connected $m$-Dominating
Set Problem in Unit Disk Graph",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2690--2701",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2475335",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Over years, virtual backbone has attracted lots of
attention as a promising approach to deal with the
broadcasting storm problem in wireless networks.
Frequently, the problem of a quality virtual backbone
is formulated as a variation of the minimum connected
dominating set problem. However, a virtual backbone
computed in this way is not resilient against topology
change since the induced graph by the connected
dominating set is one-vertex-connected. As a result,
the minimum $k$-connected $m$-dominating set problem is
introduced to construct a fault-tolerant virtual
backbone. Currently, the best known approximation
algorithm for the problem in unit disk graph by Wang
assumes $ k \leq 3$ and $ m \geq 1$, and its
performance ratio is 280 when $ k = m = 3$. In this
paper, we use a classical result from graph theory,
Tutte decomposition, to design a new approximation
algorithm for the problem in unit disk graph for $ k
\leq 3$ and $ m \geq 1$. In particular, the algorithm
features with a a drastically simple structure and b a
much smaller performance ratio, which is nearly 62 when
$ k = m = 3$. We also conduct simulation to evaluate
the performance of our algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2016:PPL,
author = "Yuxiao Hou and Jiajue Ou and Yuanqing Zheng and Mo
Li",
title = "{PLACE}: Physical Layer Cardinality Estimation for
Large-Scale {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2702--2714",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2481999",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Estimating the number of RFID tags is a fundamental
operation in RFID systems and has recently attracted
wide attentions. Despite the subtleties in their
designs, previous methods estimate the tag cardinality
from the slot measurements, which distinguish idle and
busy slots and based on that derive the cardinality
following some probability models. In order to
fundamentally improve the counting efficiency, in this
paper we introduce PLACE, a physical layer based
cardinality estimator. We show that it is possible to
extract more information and infer integer states from
the same slots in RFID communications. We propose a
joint estimator that optimally combines multiple
sub-estimators, each of which independently counts the
number of tags with different inferred PHY states.
Extensive experiments based on the GNURadio/USRP
platform and the large-scale simulations demonstrate
that PLACE achieves approximately $ 3 \sim 4 \times $
performance improvement over state-of-the-art
cardinality estimation approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tadrous:2016:OPC,
author = "John Tadrous and Atilla Eryilmaz",
title = "On Optimal Proactive Caching for Mobile Networks With
Demand Uncertainties",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2715--2727",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2478476",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile data users are known to possess predictable
characteristics both in their interests and activity
patterns. Yet, their service is predominantly
performed, especially at the wireless edges,
``reactively'' at the time of request, typically when
the network is under heavy traffic load. This strategy
incurs excessive costs to the service providers to
sustain on-time or delay-intolerant delivery of data
content, while their resources are left underutilized
during the light-loaded hours. This motivates us in
this work to study the problem of optimal ``proactive''
caching whereby, future delay-intolerant data demands
can be served within a given prediction window ahead of
their actual time-of-arrival to minimize service costs.
To that end, we first establish fundamental bounds on
the minimum possible cost achievable by any proactive
policy, as a function of the prediction uncertainties.
These bounds provide interesting insights on the impact
of uncertainty on the maximum achievable proactive
gains. We then propose specific proactive caching
strategies, both for uniform and fluctuating demand
patterns, that are asymptotically-optimal in the limit
as the prediction window size grows while the
prediction uncertainties remain fixed. We further
establish the exponential convergence rate
characteristics of our proposed solutions to the
optimal, revealing close-to-optimal performance
characteristics of our designs even with small
prediction windows. Also, proactive design is
contrasted with its reactive and delay-tolerant
counter-parts to obtain interesting results on the
unavoidable costs of uncertainty and the potentially
remarkable gains of proactive operation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Varvello:2016:MPC,
author = "Matteo Varvello and Rafael Laufer and Feixiong Zhang
and T. V. Lakshman",
title = "Multilayer Packet Classification With Graphics
Processing Units",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2728--2741",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2491265",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The rapid growth of server virtualization has ignited
a wide adoption of software-based virtual switches,
with significant interest in speeding up their
performance. In a similar trend, software-defined
networking SDN, with its strong reliance on rule-based
flow classification, has also created renewed interest
in multi-dimensional packet classification. However,
despite these recent advances, the performance of
current software-based packet classifiers is still
limited, mostly by the low parallelism of
general-purpose CPUs. In this paper, we explore how to
accelerate packet classification using the high
parallelism and latency-hiding capabilities of graphic
processing units GPUs. We implement GPU-accelerated
versions for both linear and tuple search, currently
deployed in virtual switches, and also introduce a
novel algorithm called Bloom search. These algorithms
are integrated with high-speed packet I/O to build
GSwitch, a GPU-accelerated software switch, and also to
extend Open vSwitch. Our experimental evaluation
indicates that, under realistic rule sets, GSwitch is
at least 7 $ {\times } $ faster than an equally-priced
CPU classifier. We also show that our GPU-accelerated
Open vSwitch outperforms the classic Open vSwitch
implementation by a factor of 10, 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:2016:CNC,
author = "Sen Wang and Jun Bi and Jianping Wu and Athanasios V.
Vasilakos",
title = "{CPHR}: In-Network Caching for Information-Centric
Networking With Partitioning and Hash-Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2742--2755",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2480093",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
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 = "Recently, research on Information-Centric Networking
ICN has flourished, which attempts to shift from the
current host-oriented Internet architecture to an
information-oriented one. The built-in caching
capability is a typical feature of ICN. In this paper,
in order to fully exploit the built-in caching
capability of ICN, we propose a collaborative
in-network caching scheme with Content-space
Partitioning and Hash-Routing, which is named as CPHR.
By intelligently partitioning the content space and
assigning partitions to caches, CPHR is able to
constrain the path stretch incurred by hash-routing. We
formulate the problem of assigning partitions to caches
into an optimization problem of maximizing the overall
hit ratio and propose a heuristic algorithm to solve
it. We also formulate the partitioning proportion
problem into a min-max linear optimization problem to
balance cache workloads. By simulations with both the
characteristics of real Internet traffic and traces of
peer-to-peer P2P traffic, we show the necessity of
collaborative caching since the en-route caching mode
cannot yield a considerable overall hit ratio with
practical cache size. It is shown as well that CPHR can
significantly increase the overall hit ratio by up to
about 100\% with the practical cache policy Least
Recently Used LRU while the overhead incurred is
acceptable in terms of propagation latency and load on
links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:FCC,
author = "Wei Gong and Haoxiang Liu and Lei Chen and Kebin Liu
and Yunhao Liu",
title = "Fast Composite Counting in {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2756--2767",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2483681",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Counting the number of tags is a fundamental issue and
has a wide range of applications in RFID systems. Most
existing protocols, however, only apply to the scenario
where a single reader counts the number of tags covered
by its radio, or at most the union of tags covered by
multiple readers. They are unable to achieve more
complex counting objectives, i.e., counting the number
of tags in a composite set expression such as $ S_1
\bigcup S_2 - - - S_3 \bigcap S_4 $. This type of
counting has realistic significance as it provides more
diversity than existing counting scenario, and can be
applied in various applications. We formally introduce
the RFID composite counting problem, which aims at
counting the tags in an arbitrary set expression and
obtain its strong lower bounds on the communication
cost. We then propose a generic Composite Counting
Framework CCF that provides estimates for any set
expression with desired accuracy. The communication
cost of CCF is proved to be within a small factor from
the optimal. We build a prototype system for CCF using
USRP software defined radio and Intel WISP
computational tags. Also, extensive simulations are
conducted to evaluate the performance of CCF. The
experimental results show that CCF is generic, accurate
and time-efficient.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2016:EPC,
author = "Shuihai Hu and Kai Chen and Haitao Wu and Wei Bai and
Chang Lan and Hao Wang and Hongze Zhao and Chuanxiong
Guo",
title = "Explicit Path Control in Commodity Data Centers:
Design and Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2768--2781",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2482988",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many data center network DCN applications require
explicit routing path control over the underlying
topologies. In this paper, we present XPath, a simple,
practical and readily-deployable way to implement
explicit path control, using existing commodity
switches. At its core, XPath explicitly identifies an
end-to-end path with a path ID and leverages a two-step
compression algorithm to pre-install all the desired
paths into IP TCAM tables of commodity switches. Our
evaluation and implementation show that XPath scales to
large DCNs and is readily-deployable. Furthermore, on
our testbed, we integrate XPath into four applications
to showcase its utility.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2016:FTC,
author = "Guodong Shi and Bo Li and Mikael Johansson and Karl
Henrik Johansson",
title = "Finite-Time Convergent Gossiping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2782--2794",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2484345",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Gossip algorithms are widely used in modern
distributed systems, with applications ranging from
sensor networks and peer-to-peer networks to mobile
vehicle networks and social networks. A tremendous
research effort has been devoted to analyzing and
improving the asymptotic rate of convergence for gossip
algorithms. In this work we study finite-time
convergence of deterministic gossiping. We show that
there exists a symmetric gossip algorithm that
converges in finite time if and only if the number of
network nodes is a power of two, while there always
exists an asymmetric gossip algorithm with finite-time
convergence, independent of the number of nodes. For $
n = 2^m $ nodes, we prove that a fastest convergence
can be reached in $ n m = n \log_2 n $ node updates via
symmetric gossiping. On the other hand, under
asymmetric gossip among $ n = 2^m + r $ nodes with $ 0
\leq r < 2^m $, it takes at least $ m n + 2 r $ node
updates for achieving finite-time convergence. It is
also shown that the existence of finite-time convergent
gossiping often imposes strong structural requirements
on the underlying interaction graph. Finally, we apply
our results to gossip algorithms in quantum networks,
where the goal is to control the state of a quantum
system via pairwise interactions. We show that
finite-time convergence is never possible for such
systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2016:EMU,
author = "Xu Chen and Lei Jiao and Wenzhong Li and Xiaoming Fu",
title = "Efficient Multi-User Computation Offloading for
Mobile-Edge Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2795--2808",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2487344",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile-edge cloud computing is a new paradigm to
provide cloud computing capabilities at the edge of
pervasive radio access networks in close proximity to
mobile users. In this paper, we first study the
multi-user computation offloading problem for
mobile-edge cloud computing in a multi-channel wireless
interference environment. We show that it is NP-hard to
compute a centralized optimal solution, and hence adopt
a game theoretic approach for achieving efficient
computation offloading in a distributed manner. We
formulate the distributed computation offloading
decision making problem among mobile device users as a
multi-user computation offloading game. We analyze the
structural property of the game and show that the game
admits a Nash equilibrium and possesses the finite
improvement property. We then design a distributed
computation offloading algorithm that can achieve a
Nash equilibrium, derive the upper bound of the
convergence time, and quantify its efficiency ratio
over the centralized optimal solutions in terms of two
important performance metrics. We further extend our
study to the scenario of multi-user computation
offloading in the multi-channel wireless contention
environment. Numerical results corroborate that the
proposed algorithm can achieve superior computation
offloading performance and scale well as the user size
increases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dams:2016:JRL,
author = "Johannes Dams and Martin Hoefer and Thomas
Kesselheim",
title = "Jamming-Resistant Learning in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2809--2818",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2486622",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider capacity maximization in wireless networks
under adversarial interference conditions. There are
$n$ links, i.e., sender-receiver pairs, which
repeatedly try to perform a successful transmission. In
each time step, the success of attempted transmissions
depends on interference conditions, which are captured
by an interference model e.g., the SINR model.
Additionally, an adversarial jammer can render a $ 1 -
\delta $ -fraction of time steps in a time window
unsuccessful. For this scenario, we analyze a framework
for distributed no-regret learning algorithms to get
provable approximation guarantees. We obtain an $ O1 /
\delta $-approximation for the problem of maximizing
the number of successful transmissions. Our approach
provides even a constant-factor approximation when the
jammer exactly blocks a $ 1 - \delta $-fraction of time
steps. In addition, we consider the parameters of the
jammer being partially unknown to the algorithm, and we
also consider a stochastic jammer, for which we obtain
a constant-factor approximation after a polynomial
number of time steps. We extend our results to more
general settings, in which links arrive and depart
dynamically, and where each sender tries to reach
multiple receivers. Our algorithms perform favorably in
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:PSD,
author = "Mingyang Zhang and Changsheng You and Zuqing Zhu",
title = "On the Parallelization of Spectrum Defragmentation
Reconfigurations in Elastic Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2819--2833",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2487366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Flexible-grid elastic optical networks EONs have
attracted intensive research interests for the agile
spectrum management in the optical layer. Meanwhile,
due to the relatively small spectrum allocation
granularity, spectrum fragmentation has been commonly
recognized as one of the key factors that can
deteriorate the performance of EONs. To alleviate
spectrum fragmentation, various defragmentation DF
schemes have been considered to consolidate spectrum
utilization in EONs through connection
reconfigurations. However, most of the previous
approaches operate in the sequential manner Seq-DF,
i.e., involving a sequence of reconfigurations to
progressively migrate highly fragmented spectrum
utilization to consolidated state. In this paper, we
propose to perform the DF operations in a parallel
manner Par-DF, i.e., conducting all the DF-related
connection reconfigurations simultaneously. We first
provide a detailed analysis on the latency and
disruption of Seq-DF and Par-DF in EONs, and highlight
the benefits of Par-DF. Then, we study two types of
Par-DF approaches in EONs, i.e., reactive Par-DF
re-Par-DF and proactive Par-DF pro-Par-DF. We perform
hardness analysis on them, and prove that the problem
of re-Par-DF is $ {\cal NP}$-hard in the strong sense
while pro-Par-DF is an $ {\cal APX}$ -hard problem.
Next, we focus on pro-Par-DF and propose a
Lagrangian-relaxation LR based heuristic to solve it
time-efficiently. The proposed algorithm decomposes the
original problem into several independent subproblems
and ensures that each of them can be solved
efficiently. The LR based approach informs us the
proximity of current feasible solution to the optimal
one constantly, and offers a near-optimal performance
relative dual gap $ < 5 \% $ within 500 iterations in
most simulations. Extensive simulations also verify
that the proposed pro-Par-DF approach outperforms
Seq-DF in terms of the DF Latency, Disruption and
Cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:TSR,
author = "Jinxue Zhang and Rui Zhang and Jingchao Sun and
Yanchao Zhang and Chi Zhang and Jinxue Zhang and Rui
Zhang and Jingchao Sun and Yanchao Zhang and Chi
Zhang",
title = "{TrueTop}: a {Sybil}-Resilient System for User
Influence Measurement on {Twitter}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2834--2846",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2494059",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Influential users have great potential for
accelerating information dissemination and acquisition
on Twitter. How to measure the influence of Twitter
users has attracted significant academic and industrial
attention. Existing influence measurement techniques
are vulnerable to sybil users that are thriving on
Twitter. Although sybil defenses for online social
networks have been extensively investigated, they
commonly assume unique mappings from human-established
trust relationships to online social associations and
thus do not apply to Twitter where users can freely
follow each other. This paper presents TrueTop, the
first sybil-resilient system to measure the influence
of Twitter users. TrueTop is rooted in two observations
from real Twitter datasets. First, although non-sybil
users may incautiously follow strangers, they tend to
be more careful and selective in retweeting, replying
to, and mentioning other users. Second, influential
users usually get much more retweets, replies, and
mentions than non-influential users. Detailed
theoretical studies and synthetic simulations show that
TrueTop can generate very accurate influence
measurement results with strong resilience to sybil
attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2016:DOC,
author = "Donggyu Yun and Dongmyung Lee and Se-Young Yun and
Jinwoo Shin and Yung Yi",
title = "Delay Optimal {CSMA} With Linear Virtual Channels
Under a General Topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2847--2857",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2492602",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the past few years, an exciting progress has been
made on CSMA Carrier Sense Multiple Access algorithms
that achieve throughput and utility optimality for
wireless networks. However, most of these algorithms
are known to exhibit poor delay performance making them
impractical for implementation. Recently, several
papers have addressed the delay issue of CSMA and yet,
most of them are limited, in the sense that they focus
merely on specific network scenarios with certain
conditions rather than general network topology,
achieve low delay at the cost of throughput reduction,
or lack rigorous provable guarantees. In this paper, we
focus on the recent idea of exploiting multiple
channels actually or virtually for delay reduction in
CSMA, and prove that it is per-link delay
order-optimal, i.e., $ O1$-asymptotic-delay per link,
if the number of virtual channels is logarithmic with
respect to mixing time of the underlying CSMA Markov
chain. The logarithmic number is typically small, i.e.,
at most linear with respect to the network size. In
other words, our contribution provides not only a
provable framework for the multiple-channel based CSMA,
but also the required explicit number of
virtual-multi-channels, which is of great importance
for actual implementation. The key step of our analytic
framework lies in using quadratic Lyapunov functions in
conjunction with recursively applying Lindley equation
and Azuma's inequality for obtaining an exponential
decaying property in certain queueing dynamics. We
believe that our technique is of broader interest in
analyzing the delay performance of queueing systems
with multiple periodic schedulers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:SPS,
author = "Xiaoyong Li and Daren B. H. Cline and Dmitri
Loguinov",
title = "On Sample-Path Staleness in Lazy Data Replication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2858--2871",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2488595",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We analyze synchronization issues between two point
processes, one modeling data churn at an information
source and the other periodic downloads to its replica
e.g., search engine, web cache, distributed database.
Due to pull-based synchronization, the replica
experiences recurrent staleness, which translates into
some form of penalty stemming from its reduced ability
to perform consistent computation and/or provide
up-to-date responses to customer requests. We model
this system under non-Poisson update/refresh processes
and obtain sample-path averages of various metrics of
staleness cost, generalizing previous results and
exposing novel problems in this field.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kucera:2016:ICI,
author = "Stepan Kucera and David Lopez-Perez",
title = "Inter-Cell Interference Coordination for Control
Channels in {LTE} Heterogeneous Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2872--2884",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2495270",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In heterogeneous cellular networks for mobile
communications, small cells are deployed within the
coverage range of primary macro cells to provide for a
localized capacity boost in traffic hotspots. Sharing
of communication channels among the small-cell and
macro-cell tiers is spectrally efficient, but causes
failures of control signaling and data channels due to
unmitigated co-channel interference. Consequently, the
small-cell coverage range and capacity deteriorate. In
Long Term Evolution LTE networks, the performance of
control channels such as the physical downlink control
channels PDCCH is of particular concern because they
are protected only by simple interference averaging
based on pseudo-random subcarrier allocation. Observing
that the randomization algorithms are primarily seeded
by the physical cell identifiers PCIs and cell radio
network temporary identifier C-RNTIs, we show that
efficient interference-aware scheduling of control
transmissions can be enabled by optimized allocation of
PCIs, C-RNTIs and PDCCH resources. Simulations of a 3
GPP-compliant heterogeneous network show that the
small-cell size can be doubled for a better macro-cell
traffic offload by trading the number of active PDCCHs
for a higher small-cell expansion bias. Alternatively,
the small-cell PDCCH capacity can be at least tripled
for high-load applications such as Voice over LTE by
using selective macro-cell PDCCH muting.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2016:CCB,
author = "Jinsong Han and Han Ding and Chen Qian and Wei Xi and
Zhi Wang and Zhiping Jiang and Longfei Shangguan and
Jizhong Zhao and Jinsong Han and Han Ding and Chen Qian
and Wei Xi and Zhi Wang and Zhiping Jiang and Longfei
Shangguan and Jizhong Zhao",
title = "{CBID}: a Customer Behavior Identification System
Using Passive Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2885--2898",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2501103",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Different from online shopping, in-store shopping has
few ways to collect the customer behaviors before
purchase. In this paper, we present the design and
implementation of an on-site Customer Behavior
IDentification system based on passive RFID tags, named
CBID. By collecting and analyzing wireless signal
features, CBID can detect and track tag movements and
further infer corresponding customer behaviors. We
model three main objectives of behavior identification
by concrete problems and solve them using novel
protocols and algorithms. The design innovations of
this work include a Doppler effect based protocol to
detect tag movements, an accurate Doppler frequency
estimation algorithm, an image-based human count
estimation protocol and a tag clustering algorithm
using cosine similarity. We have implemented a
prototype of CBID in which all components are built by
off-the-shelf devices. We have deployed CBID in real
environments and conducted extensive experiments to
demonstrate the accuracy and efficiency of CBID in
customer behavior identification.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kozat:2016:OTV,
author = "Ulas C. Kozat and Guanfeng Liang and Koray Kokten and
Janos Tapolcai",
title = "On Optimal Topology Verification and Failure
Localization for Software Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2899--2912",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2494850",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a new set of solutions for topology
verification and failure localization in Software
Defined Networks SDNs. Our solutions are targeted
towards offloading the control plane as much as
possible and bringing more resilience against
congestion or partitioning in the control plane. The
core idea is to define control flows for network
diagnosis and utilize a fraction of the forwarding
table rules on the switches to serve these control
flows. For topology verification, we present provably
optimal or order-optimal solutions in total number of
static forwarding rules and control messages. For
single link failure localization, we present a solution
that requires at least $ 3 \vert {\cal {\bf E}} \vert $
but at most $ 6 \vert {\cal {\bf E}} \vert $ forwarding
rules using at most $ 1 + \log_2 { \vert {\cal {\bf E}}
\vert } $ control messages, where $ \vert {\cal {\bf
E}} \vert $ denotes the number of bidirectional links
in the forwarding plane. We analyze the latency vs.
rule and control message optimality trade-offs showing
that sub-second failure localization is possible even
in data center scale networks without significant
additional overhead in the number of static rules and
control messages. We further simulate the performance
of failure localization in identifying multiple link
failures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:PSN,
author = "Dan Li and Yirong Yu and Junxiao Shi and Beichuan
Zhang",
title = "{PALS}: Saving Network Power With Low Overhead to
{ISPs} and Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2913--2925",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2496307",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Power saving in the network infrastructure has
received great attention in recent years. Power-aware
traffic management is proposed in many works, in which
a subset of routers/links are preferentially used to
carry traffic while other links are activated only when
traffic load is high. However, it remains challenging
how to minimize the overhead to both ISPs and
applications, which is important to the successful
deployment of power-aware traffic management in a real
network. This paper presents PALS, a new Power-Aware
Link State routing based traffic management protocol.
Compared with previous solutions, PALS remarkably
reduces the overheads to ISPs and applications by the
following innovations. First, PALS minimizes the
forwarding table expansion due to dynamic power-aware
routing, by using destination based routing instead of
pairwise routing e.g., MPLS. Second, PALS limits packet
reordering for applications, by never splitting traffic
between an IE ingress-egress router pair to multiple
paths. Third, PALS significantly reduces the
computation complexity of the power-aware routing
algorithm, by running a simple path selection algorithm
at each ingress router with the knowledge of local
traffic information as well as global link utilization,
which are much easier to obtain than global traffic
matrix required by the state-of-the-art solutions e.g.,
Zhang, IEEE ICNP 2010. Extensive simulations and
testbed experiments show that, although bearing the
simplicities to minimize the overhead, PALS saves
satisfactory network power, with quick response to
traffic variance and negligible impact on the packet
delivery performance for applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:ENS,
author = "Xiang Wang and Weiqi Shi and Yang Xiang and Jun Li",
title = "Efficient Network Security Policy Enforcement With
Policy Space Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2926--2938",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2502402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network operators rely on security services to protect
their IT infrastructures. Different kinds of network
security policies are defined globally and distributed
among multiple security middleboxes deployed in
networks. However, due to the complexity of security
policy, it is inefficient to directly employ existing
path-wise enforcement approaches. This paper models the
enforcement of network security policy as the
set-covering problem, and designs a
computational-geometry-based policy space analysis PSA
tool for set operations of security policy. Leveraging
the PSA, this paper first investigates the topological
characteristics of different types of policies. This
heuristic information reveals intrinsic complexities of
security policy and guides the design of our
enforcement approach. Then the paper proposes a
scope-wise policy enforcement algorithm that selects a
modest number of enforcement network nodes to deploy
multiple policy subsets in a greedy manner. This
approach can be employed on network topologies of both
datacenter and service provider. The efficiencies of
the PSA tool and the enforcement algorithm are also
evaluated. Compared with the header space analysis, the
PSA achieves much better memory and time efficiencies
on set operations of security policy. Additionally, the
proposed enforcement algorithm is able to guarantee
network security within a reasonable number of
enforcement network nodes, without introducing many
extra rules.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhaskar:2016:LCB,
author = "Sonia A. Bhaskar and Sonia A. Bhaskar",
title = "Localization From Connectivity: a $1$-bit Maximum
Likelihood Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2939--2953",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2495171",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of determining the location of
sensor nodes in a wireless sensor ad hoc network when
only connectivity information is available, i.e., one
only knows if a pair of nodes is within a fixed radio
range distance of each other but does not have access
to exact or even approximate distance information. We
propose a maximum likelihood based reconstruction
algorithm to reconstruct the node positions in a
d-dimensional Euclidean space. For an n-node network,
the constrained maximum likelihood estimation problem
is non-convex in both the d $ \times $ n node position
matrix X and in the Gram matrix Q$_X$ =X$^T$ X. We
derive an upperbound on the average Frobenius norm of
the estimation error in Q, which is of the order of the
reciprocal of square root of n for a fixed radio range.
We present a set of algorithms for finding the maximum
likelihood estimate of X by first embedding d $ \times
$ n X into m $ \times $ n Y, factorizing Q$_Y$ = Y$^T$
Y, d \le m \le n, and then optimizing in Y. We relate
local minima in Y to the global minimum of a relaxed
convex formulation in Q$_Y$ to provide global
convergence guarantees, despite the nonconvexity of the
negative log-likelihood function in Y. We demonstrate
that our algorithm is empirically successful for both
uniform and irregular networks, using only a few anchor
nodes. Finally, numerical experiments demonstrate
improved performance of the proposed algorithm relative
to the MDS algorithm and a variant.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chattopadhyay:2016:SDA,
author = "Arpan Chattopadhyay and Marceau Coupechoux and Anurag
Kumar",
title = "Sequential Decision Algorithms for Measurement-Based
Impromptu Deployment of a Wireless Relay Network Along
a Line",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2954--2968",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2496721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We are motivated by the need, in some applications,
for impromptu or as-you-go deployment of wireless
sensor networks. A person walks along a line, starting
from a sink node e.g., a base-station, and proceeds
towards a source node e.g., a sensor which is at an a
priori unknown location. At equally spaced locations,
he makes link quality measurements to the previous
relay, and deploys relays at some of these locations,
with the aim to connect the source to the sink by a
multihop wireless path. In this paper, we consider two
approaches for impromptu deployment: i the deployment
agent can only move forward which we call a pure
as-you-go approach, and ii the deployment agent can
make measurements over several consecutive steps before
selecting a placement location among them the
explore-forward approach. We consider a very light
traffic regime, and formulate the problem as a Markov
decision process, where the trade-off is among the
power used by the nodes, the outage probabilities in
the links, and the number of relays placed per unit
distance. We obtain the structures of the optimal
policies for the pure as-you-go approach as well as for
the explore-forward approach. We also consider natural
heuristic algorithms, for comparison. Numerical
examples show that the explore-forward approach
significantly outperforms the pure as-you-go approach
in terms of network cost. Next, we propose two learning
algorithms for the explore-forward approach, based on
Stochastic Approximation, which asymptotically converge
to the set of optimal policies, without using any
knowledge of the radio propagation model. We
demonstrate numerically that the learning algorithms
can converge as deployment progresses to the set of
optimal policies reasonably fast and, hence, can be
practical model-free algorithms for deployment over
large regions. Finally, we demonstrate the end-to-end
traffic carrying capability of such networks via field
deployment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Song:2016:IAR,
author = "Yang Song and Arun Venkataramani and Lixin Gao",
title = "Identifying and Addressing Reachability and Policy
Attacks in {``Secure'' BGP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2969--2982",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2503642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "BGP is known to have many security vulnerabilities due
to the very nature of its underlying assumptions of
trust among independently operated networks. Most prior
efforts have focused on attacks that can be addressed
using traditional cryptographic techniques to ensure
authentication or integrity, e.g., BGPSec and related
works. Although augmenting BGP with authentication and
integrity mechanisms is critical, they are, by design,
far from sufficient to prevent attacks based on
manipulating the complex BGP protocol itself. In this
paper, we identify two serious attacks on two of the
most fundamental goals of BGP --- to ensure
reachability and to enable ASes to pick routes
available to them according to their routing policies
--- even in the presence of BGPSec-like mechanisms. Our
key contributions are to 1 formalize a series of
critical security properties, 2 experimentally validate
using commodity router implementations that BGP fails
to achieve those properties, 3 quantify the extent of
these vulnerabilities in the Internet's AS topology,
and 4 propose simple modifications to provably ensure
that those properties are satisfied. Our experiments
show that, using our attacks, a single malicious AS can
cause thousands of other ASes to become disconnected
from thousands of other ASes for arbitrarily long,
while our suggested modifications almost completely
eliminate such attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Le:2016:MCV,
author = "Anh Le and Lorenzo Keller and Hulya Seferoglu and
Blerim Cici and Christina Fragouli and Athina
Markopoulou",
title = "{MicroCast}: Cooperative Video Streaming Using
Cellular and Local Connections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2983--2999",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2501349",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a group of mobile users, within proximity
of each other, who are interested in watching the same
online video. The common practice today is that each
user downloads the video independently on her mobile
device using her own cellular connection, which wastes
access bandwidth and may also lead to poor video
quality. We propose a novel cooperative system where
each mobile device uses simultaneously two network
interfaces: i cellular to connect to the video server
and download parts of the video and ii WiFi to connect
locally to all other devices in the group to exchange
those parts. Devices cooperate to efficiently utilize
all network resources and to adapt to varying wireless
network conditions. In the local WiFi network, we
exploit overhearing, which we further combine with
network coding. The end result is savings in cellular
bandwidth and improved user experience. We follow a
complete approach, from theory to practice. First, we
formulate the problem using a network utility
maximization NUM framework, decompose the problem, and
provide a distributed solution. Then, based on the
structure of the NUM solution, we design a system
called MicroCast, and we implement a prototype as an
Android application. We provide both simulation results
of the NUM solution and experimental evaluation. We
demonstrate that the proposed approach brings
significant performance benefits namely, faster
download on the order of the group size without battery
penalty.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yun:2016:DMA,
author = "Se-Young Yun and Jinwoo Shin and Yung Yi",
title = "Distributed Medium Access Over Time-Varying Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3000--3013",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2503394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent studies on MAC scheduling have shown that
carrier sense multiple access CSMA algorithms can be
throughput optimal for arbitrary wireless network
topology. However, these results are highly sensitive
to the underlying assumption on \lq static' or \lq
fixed' system conditions. For example, if channel
conditions are time-varying, it is unclear how each
node can adjust its CSMA parameters, so-called backoff
and channel holding times, using its local channel
information for the desired high performance. In this
paper, we study \lq channel-aware' CSMA A-CSMA
algorithms in time-varying channels, where they adjust
their parameters as some function of the current
channel capacity. First, we assume that backoff rates
can be arbitrary large and show that the achievable
rate region of A-CSMA equals to the maximum rate region
if and only if the function is exponential.
Furthermore, given an exponential function in A-CSMA,
we design updating rules for their parameters, which
achieve throughput optimality for an arbitrary wireless
network topology. They are the first CSMA algorithms in
the literature which are proved to be throughput
optimal under time-varying channels. Moreover, we also
consider the case when back-off rates of A-CSMA are
restricted compared to the speed of channel variations,
and characterize the throughput performance of A-CSMA
in terms of the underlying wireless network topology.
Our results not only guide a high-performance design on
MAC scheduling under highly time-varying scenarios, but
also provide new insights on the performance of CSMA
algorithms in relation to their backoff rates and
underlying network topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Elhourani:2016:IFR,
author = "Theodore Elhourani and Abishek Gopalan and Srinivasan
Ramasubramanian and Theodore Elhourani and Abishek
Gopalan and Srinivasan Ramasubramanian",
title = "{IP} Fast Rerouting for Multi-Link Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3014--3025",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2516442",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IP fast reroute methods are used to recover packets in
the data plane upon link failures. Previous work
provided methods that guarantee failure recovery from
at most two-link failures. We develop an IP fast
reroute method that employs rooted arc-disjoint
spanning trees to guarantee recovery from up to k-1
link failures in a k-edge-connected network. As
arc-disjoint spanning trees may be constructed in
sub-quadratic time in the size of the network, our
approach offers excellent scalability. Through
experimental results, we show that employing
arc-disjoint spanning trees to recover from multiple
failures reduces path stretch in comparison with
previously known techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Roy:2016:DQE,
author = "Nirmalya Roy and Archan Misra and Sajal K. Das and
Christine Julien",
title = "Determining Quality- and Energy-Aware Multiple
Contexts in Pervasive Computing Environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3026--3042",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2502580",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In pervasive computing environments, understanding the
context of an entity is essential for adapting the
application behavior to changing situations. In our
view, context is a high-level representation of a user
or entity's state and can capture location, activities,
social relationships, capabilities, etc. Inherently,
however, these high-level context metrics are difficult
to capture using uni-modal sensors only and must
therefore be inferred using multi-modal sensors. A key
challenge in supporting context-aware pervasive
computing is how to determine multiple high-level
context metrics simultaneously and energy-efficiently
using low-level sensor data streams collected from the
environment and the entities present therein. A key
challenge is addressing the fact that the algorithms
that determine different high-level context metrics may
compete for access to low-level sensors. In this paper,
we first highlight the complexities of determining
multiple context metrics as compared to a single
context and then develop a novel framework and
practical implementation for this problem. The proposed
framework captures the tradeoff between the accuracy of
estimating multiple context metrics and the overhead
incurred in acquiring the necessary sensor data
streams. In particular, we develop two variants of a
heuristic algorithm for multi-context search that
compute the optimal set of sensors contributing to the
multi-context determination as well as the associated
parameters of the sensing tasks e.g., the frequency of
data acquisition. Our goal is to satisfy the
application requirements for a specified accuracy at a
minimum cost. We compare the performance of our
heuristics with a brute-force based approach for
multi-context determination. Experimental results with
SunSPOT, Shimmer and Smartphone sensors in smart home
environments demonstrate the potential impact of the
proposed framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Paschos:2016:NCC,
author = "Georgios S. Paschos and Chih-Ping Li and Eytan Modiano
and Kostas Choumas and Thanasis Korakis",
title = "In-Network Congestion Control for Multirate
Multicast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3043--3055",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2503261",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a novel control scheme that dynamically
optimizes multirate multicast. By computing the
differential backlog at every node, our scheme
adaptively allocates transmission rates per
session/user pair in order to maximize throughput. An
important feature of the proposed scheme is that it
does not require source cooperation or centralized
calculations. This methodology leads to efficient and
distributed algorithms that scale gracefully and can be
embraced by low-cost wireless devices. Additionally, it
is shown that maximization of sum utility is possible
by the addition of a virtual queue at each destination
node of the multicast groups. The virtual queue
captures the desire of the individual user and helps in
making the correct resource allocation to optimize
total utility. Under the operation of the proposed
schemes backlog sizes are deterministically bounded,
which provides delay guarantees on delivered packets.
To illustrate its practicality, we present a prototype
implementation in the NITOS wireless testbed. The
experimental results verify that the proposed schemes
achieve maximum performance while maintaining low
complexity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rouayheb:2016:SDC,
author = "Salim {El Rouayheb} and Sreechakra Goparaju and Han
Mao Kiah and Olgica Milenkovic",
title = "Synchronization and Deduplication in Coded Distributed
Storage Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3056--3069",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2502274",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of synchronizing coded data in
distributed storage networks undergoing insertion and
deletion edits. We present modifications of distributed
storage codes that allow updates in the parity-check
values to be performed with one round of communication
at low bit rates and with small storage overhead. Our
main contributions are novel protocols for
synchronizing frequently updated and semi-static data
based on functional intermediary coding involving
permutation and Vandermonde matrices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahmed:2016:RN,
author = "Reaz Ahmed and Faizul Bari and Shihabur Rahman
Chowdhury and Golam Rabbani and Raouf Boutaba and
Bertrand Mathieu and Reaz Ahmed and Faizul Bari and
Shihabur Rahman Chowdhury and Golam Rabbani and Raouf
Boutaba and Bertrand Mathieu",
title = "$ \alpha ${Route}: Routing on Names",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3070--3083",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2506617",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
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 = "One of the crucial building blocks for Information
Centric Networking ICN is a name based routing scheme
that can route directly on content names instead of IP
addresses. However, moving the address space from IP
addresses to content names brings the scalability
issues to a whole new level, due to two reasons. First,
name aggregation is not as trivial a task as the IP
address aggregation in BGP routing. Second, the number
of addressable contents in the Internet is several
orders of magnitude higher than the number of IP
addresses. With the current size of the Internet, name
based, anycast routing is very challenging specially
when routing efficiency is of prime importance. We
propose a name-based routing scheme \alpha Route for
ICN that offers efficient bandwidth usage, guaranteed
content lookup and scalable routing table size. \alpha
Route consists of two components: an alphanumeric
Distributed Hash Table DHT and an overlay to underlay
Internet topology mapping algorithm. Simulation results
show that \alpha Route performs significantly better
than Content Centric Network CCN in terms of network
bandwidth usage, lookup latency and load balancing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2016:UBP,
author = "Richard T. B. Ma",
title = "Usage-Based Pricing and Competition in Congestible
Network Service Markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3084--3097",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2500589",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As Internet traffic grows exponentially due to the
pervasive Internet accesses via mobile devices and
increasing adoptions of cloud-based applications,
broadband providers start to shift from flat-rate to
usage-based pricing, which has gained support from
regulators such as the FCC. We consider generic
congestion-prone network services and study usage-based
pricing of service providers under market competition.
Based on a novel model that captures users' preferences
over price and congestion alternatives, we derive the
induced congestion and market share of the service
providers under a market equilibrium and design
algorithms to calculate them. By analyzing different
market structures, we reveal how users' value on usage
and sensitivity to congestion influence the optimal
price, revenue, and competition of service providers,
as well as the social welfare. We also obtain the
conditions under which monopolistic providers have
strong incentives to implement service differentiation
via Paris Metro Pricing and whether regulators should
encourage such practices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2016:RBD,
author = "Yuanqing Zheng and Mo Li and Yuanqing Zheng and Mo
Li",
title = "Read Bulk Data From Computational {RFIDs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3098--3108",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2502979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Without the need of local energy supply, computational
RFID CRFID sensors are emerging as important platforms
enabling a variety of sensing and computing
applications. Nevertheless, the data throughput of
CRFIDs is very low. This paper aims at efficiently
reading bulk data from CRFIDs using commodity RFID
readers. We carry out thorough experiment studies to
investigate the root cause of the low data throughput
of CRFIDs. The experiment results suggest that the
fundamental problem of data transfer stems from the
mismatch between the stringent timing requirement of
commodity standard and the limited packet handling
capability of CRFIDs. We further propose several simple
yet effective techniques to allow CRFIDs to meet
stringent timing requirement of commodity RFID readers
and achieve efficient data transfer. We implement a
prototype system based on the WISP CRFIDs and
commercial off-the-self RFID readers. We carry out
extensive experiments on the prototype systems, which
show that the proposed scheme works well with the
commodity RFID readers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guan:2016:DAJ,
author = "Zhangyu Guan and G. Enrico Santagati and Tommaso
Melodia",
title = "Distributed Algorithms for Joint Channel Access and
Rate Control in Ultrasonic Intra-Body Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3109--3122",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2510294",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most research in body area networks to date has
focused on traditional RF wireless communications,
typically along the body surface. However, the core
challenge of enabling networked intra-body
communications through body tissues is substantially
unaddressed. RF waves are in fact known to suffer from
high absorption and to potentially lead to overheating
of human tissues. In this paper, we consider the
problem of designing optimal network control algorithms
for distributed networked systems of implantable
medical devices wirelessly interconnected by means of
ultrasonic waves, which are known to propagate better
than radio-frequency electromagnetic waves in aqueous
media such as human tissues. Specifically, we propose
lightweight, asynchronous, and distributed algorithms
for joint rate control and stochastic channel access
designed to maximize the throughput of ultrasonic
intra-body area networks under energy constraints. We
first develop and validate through testbed experiments
a statistical model of the ultrasonic channel and of
the spatial and temporal variability of ultrasonic
interference. Compared to in-air radio frequency RF,
human tissues are characterized by a much lower
propagation speed, which further causes unaligned
interference at the receiver. It is therefore
inefficient to perform adaptation based on
instantaneous channel state information CSI. Based on
this model, we formulate the problem of maximizing the
network throughput by jointly controlling the
transmission rate and the channel access probability
over a finite time horizon based only on a statistical
characterization of interference. We then propose a
fully distributed solution algorithm, and through both
simulation and testbed results, we show that the
algorithm achieves considerable throughput gains
compared with traditional algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2016:TCD,
author = "Lin Chen and Wei Wang and Hua Huang and Shan Lin and
Lin Chen and Wei Wang and Hua Huang and Shan Lin",
title = "On Time-Constrained Data Harvesting in Wireless Sensor
Networks: Approximation Algorithm Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3123--3135",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2504603",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wireless sensor networks, data harvesting using
mobile data ferries has recently emerged as a promising
alternative to the traditional multi-hop communication
paradigm. The use of data ferries can significantly
reduce energy consumption at sensor nodes and increase
network lifetime. However, it usually incurs long data
delivery latency as the data ferry needs to travel
through the network to collect data, during which some
delay-sensitive data may become obsolete. Therefore, it
is important to optimize the trajectory of the data
ferry with data delivery latency bound for this
approach to be effective in practice. To address this
problem, we formally define the time-constrained data
harvesting problem, which seeks an optimal data
harvesting path in a network to collect as much data as
possible within a time duration. We then investigate
the formulated data harvesting problem in the generic
m-dimensional context, of which the cases of m=1, 2, 3
are particularly pertinent. We first characterize the
performance bound given by the optimal data harvesting
algorithm and show that the optimal algorithm
significantly outperforms the random algorithm,
especially when network scales. However, we
mathematically prove that finding the optimal data
harvesting path is NP-hard. We therefore devise an
approximation algorithm and mathematically prove the
output being a constant-factor approximation of the
optimal solution. Our experimental results also
demonstrate that our approximation algorithm
significantly outperforms the random algorithm in a
wide range of network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shah:2016:SAR,
author = "Virag Shah and Gustavo de Veciana and George Kesidis",
title = "A Stable Approach for Routing Queries in Unstructured
{P2P} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3136--3147",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2509967",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Finding a document or resource in an unstructured
peer-to-peer network can be an exceedingly difficult
problem. In this paper we propose a query routing
approach that accounts for arbitrary overlay
topologies, nodes with heterogeneous processing
capacity, e.g., reflecting their degree of altruism,
and heterogeneous class-based likelihoods of query
resolution at nodes which may reflect query loads and
the manner in which files/resources are distributed
across the network. The approach is shown to be
stabilize the query load subject to a grade of service
constraint, i.e., a guarantee that queries' routes meet
pre-specified class-based bounds on their associated a
priori probability of query resolution. An explicit
characterization of the capacity region for such
systems is given and numerically compared to that
associated with random walk based searches. Simulation
results further show the performance benefits, in terms
of mean delay, of the proposed approach. Additional
aspects associated with reducing complexity, estimating
parameters, and adaptation to class-based query
resolution probabilities and traffic loads are
studied.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2016:NLN,
author = "Lin Chen and Kaigui Bian and Meng Zheng",
title = "Never Live Without Neighbors: From Single- to
Multi-Channel Neighbor Discovery for Mobile Sensing
Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3148--3161",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2505170",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Neighbor discovery is of paramount importance in
mobile sensing applications and is particularly
challenging if the operating frequencies of mobile
devices span multiple channels. In this paper, we
formulate the multi-channel neighbor discovery problem
and establish a theoretical framework of it, under
which we derive the performance bound of any neighbor
discovery protocol guaranteeing discovery. We then
develop a multi-channel discovery protocol that
achieves guaranteed discovery with order-minimum
worst-case discovery delay and fine-grained control of
energy conservation levels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2016:GCF,
author = "Yi Xie and Yu Wang and Haitao He and Yang Xiang and
Shunzheng Yu and Xincheng Liu",
title = "A General Collaborative Framework for Modeling and
Perceiving Distributed Network Behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3162--3176",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2512609",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Collaborative Anomaly Detection CAD is an emerging
field of network security in both academia and
industry. It has attracted a lot of attention, due to
the limitations of traditional fortress-style defense
modes. Even though a number of pioneer studies have
been conducted in this area, few of them concern about
the universality issue. This work focuses on two
aspects of it. First, a unified collaborative detection
framework is developed based on network virtualization
technology. Its purpose is to provide a generic
approach that can be applied to designing specific
schemes for various application scenarios and
objectives. Second, a general behavior perception model
is proposed for the unified framework based on hidden
Markov random field. Spatial Markovianity is introduced
to model the spatial context of distributed network
behavior and stochastic interaction among
interconnected nodes. Algorithms are derived for
parameter estimation, forward prediction, backward
smooth, and the normality evaluation of both global
network situation and local behavior. Numerical
experiments using extensive simulations and several
real datasets are presented to validate the proposed
solution. Performance-related issues and comparison
with related works are discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:ERG,
author = "Jia Liu and Min Chen and Bin Xiao and Feng Zhu and
Shigang Chen and Lijun Chen",
title = "Efficient {RFID} Grouping Protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3177--3190",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2514361",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The grouping problem in RFID systems is to efficiently
group all tags according to a given partition such that
tags in the same group will have the same group ID.
Unlike previous research on unicast transmission from a
reader to a tag, grouping provides a fundamental
mechanism for efficient multicast transmissions and
aggregate queries in large RFID-enabled applications. A
message can be transmitted to a group of $m$ tags
simultaneously in multicast, which improves the
efficiency by $m$ times when comparing with unicast.
This paper studies this practically important but not
yet thoroughly investigated grouping problem in large
RFID system. We start with a straightforward solution
called the Enhanced Polling Grouping EPG protocol. We
then propose a time-efficient Filter Grouping FIG
protocol that uses Bloom filters to remove the costly
ID transmissions. We point out the limitation of the
Bloom-filter based solution due to its intrinsic false
positive problem, which leads to our final ConCurrent
Grouping CCG protocol. With a drastically different
design, CCG is able to outperform FIG by exploiting
collisions to inform multiple tags of their group ID
simultaneously and by removing any wasteful slots in
its frame-based execution. We further enhance CCG to
make it perform better with very large groups.
Simulation results demonstrate that our best protocol
CCG can reduce the execution time by a factor of 11
when comparing with a baseline polling protocol.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nyang:2016:RCC,
author = "DaeHun Nyang and DongOh Shin",
title = "Recyclable Counter With Confinement for Real-Time
Per-Flow Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3191--3203",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2514523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
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 = "With the amount of Internet traffic increasing
substantially, measuring per-flow traffic accurately is
an important task. Because of the nature of high-speed
routers, a measurement algorithm should be fast enough
to process every packet going through them, and should
be executable with only a limited amount of memory, as
well. In this paper, we use two techniques to solve
memory/speed constraints: 1 recycling a memory block by
resetting it for memory constraint, and 2 confinement
of virtual vectors to one word for speed constraint.
These techniques allow our measurement algorithm,
called a recyclable counter with confinement RCC, to
accurately measure all individual flow sizes with a
small amount of memory. In terms of encoding speed, it
uses about one memory access and one hash computation.
Unlike other previously proposed schemes, RCC decodes
very quickly, demanding about three memory accesses and
two hash calculations. This fast decoding enables
real-time detection of a high uploader/downloader.
Finally, RCC's data structure includes flow labels for
large flows, so it is possible to quickly retrieve a
list of large-flow names and sizes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kandhway:2016:ORA,
author = "Kundan Kandhway and Joy Kuri",
title = "Optimal Resource Allocation Over Time and Degree
Classes for Maximizing Information Dissemination in
Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3204--3217",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2512541",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the optimal control problem of allocating
campaigning resources over the campaign duration and
degree classes in a social network. Information
diffusion is modeled as a Susceptible-Infected epidemic
and direct recruitment of susceptible nodes to the
infected informed class is used as a strategy to
accelerate the spread of information. We formulate an
optimal control problem for optimizing a net reward
function, a linear combination of the reward due to
information spread and cost due to application of
controls. The time varying resource allocation and
seeds for the epidemic are jointly optimized. A problem
variation includes a fixed budget constraint. We prove
the existence of a solution for the optimal control
problem, provide conditions for uniqueness of the
solution, and prove some structural results for the
controls e.g., controls are non-increasing functions of
time. The solution technique uses Pontryagin's Maximum
Principle and the forward-backward sweep algorithm and
its modifications for numerical computations. Our
formulations lead to large optimality systems with up
to about 200 differential equations and allow us to
study the effect of network topology
Erdos-R{\'e}nyi/scale-free on the controls. Results
reveal that the allocation of campaigning resources to
various degree classes depends not only on the network
topology but also on system parameters such as
cost/abundance of resources. The optimal strategies
lead to significant gains over heuristic strategies for
various model parameters. Our modeling approach assumes
uncorrelated network, however, we find the approach
useful for real networks as well. This work is useful
in product advertising, political and crowdfunding
campaigns in social networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ayoubi:2016:TPB,
author = "Sara Ayoubi and Yiheng Chen and Chadi Assi",
title = "Towards Promoting Backup-Sharing in Survivable Virtual
Network Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3218--3231",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2510864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a virtualized infrastructure where multiple virtual
networks or tenants are running atop the same physical
network e.g., a data center network, a single facility
node e.g., a server failure can bring down multiple
virtual machines, disconnecting their corresponding
services and leading to millions of dollars in penalty
cost. To overcome losses, tenants or virtual networks
can be augmented with a dedicated set of backup nodes
and links provisioned with enough backup resources to
assume any single facility node failure. This approach
is commonly referred to as Survivable Virtual Network
SVN design. The achievable reliability guarantee of the
resultant SVN could come at the expense of lowering the
substrate network utilization efficiency, and
subsequently its admissibility, since the provisioned
backup resources are reserved and remain idle until
failures occur. Backup-sharing can replace the
dedicated survivability scheme to circumvent the
inconvenience of idle resources and reduce the
footprints of backup resources. Indeed the problem of
SVN design with backup-sharing has recurred multiple
times in the literature. In most of the existing work,
designing an SVN is bounded to a fixed number of backup
nodes; further backup-sharing is only explored and
optimized during the embedding phase. This renders the
existing redesign techniques agnostic to the backup
resource sharing in the substrate network, and highly
dependent on the efficiency of the adopted mapping
approach. In this paper, we diverge from this dogmatic
approach, and introduce ProRed, a novel prognostic
redesign technique that promotes the backup resource
sharing at the virtual network level, prior to the
embedding phase. Our numerical results prove that this
redesign technique achieves lower-cost mapping
solutions and greatly enhances the achievable backup
sharing, boosting the overall network's
admissibility.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:CTL,
author = "Huiyuan Zhang and Dung T. Nguyen and Soham Das and
Huiling Zhang and My T. Thai",
title = "Corrections to {``Least Cost Influence Maximization
Across Multiple Social Networks'' [Apr 16 929--939]}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "3232--3232",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2600025",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the above paper [1], one author was inadvertently
left out of the byline of the paper. The byline should
have read as follows \ldots{}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:PPC,
author = "Wei Wang and Qian Zhang",
title = "Privacy Preservation for Context Sensing on
{Smartphone}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3235--3247",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2512301",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The proliferation of sensor-equipped smartphones has
enabled an increasing number of context-aware
applications that provide personalized services based
on users' contexts. However, most of these applications
aggressively collect users' sensing data without
providing clear statements on the usage and disclosure
strategies of such sensitive information, which raises
severe privacy concerns and leads to some initial
investigation on privacy preservation mechanisms
design. While most prior studies have assumed static
adversary models, we investigate the context dynamics
and call attention to the existence of intelligent
adversaries. In this paper, we identify the context
privacy problem with consideration of the context
dynamics and malicious adversaries with capabilities of
adjusting their attacking strategies. Then, we
formulate the interactive competition between users and
adversaries as a competitive Markov decision process
MDP, in which the users attempt to preserve the
context-based service quality and their context privacy
in the long-term defense against the strategic
adversaries with the opposite interests. In addition,
we propose an efficient minimax learning algorithm to
obtain the optimal policy of the users and prove that
the algorithm quickly converges to the unique Nash
equilibrium point. Our evaluations on real smartphone
context traces of 94 users demonstrate that the
proposed algorithm largely improves the convergence
speed by three orders of magnitude compared with
traditional algorithm and the optimal policy obtained
by our minimax learning algorithm outperforms the
baseline algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baron:2016:OMD,
author = "Benjamin Baron and Promethee Spathis and Herve Rivano
and Marcelo Dias de Amorim",
title = "Offloading Massive Data Onto Passenger Vehicles:
Topology Simplification and Traffic Assignment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3248--3261",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2518926",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Offloading is a promising technique for alleviating
the ever-growing traffic load from infrastructure-based
networks such as the Internet. Offloading consists of
using alternative methods of transmission as a
cost-effective solution for network operators to extend
their transport capacity. In this paper, we advocate
the use of conventional vehicles equipped with storage
devices as data carriers whilst being driven for daily
routine journeys. The road network can be turned into a
large-capacity transmission system to offload bulk
transfers of delay-tolerant data from the Internet. One
of the challenges we address is assigning data to flows
of vehicles while coping with the complexity of the
road network. We propose an embedding algorithm that
computes an offloading overlay where each logical link
spans over multiple stretches of road from the
underlying road infrastructure. We then formulate the
data transfer assignment problem as a novel linear
programming model we solve to determine the optimal
logical paths matching the performance requirements of
a data transfer. We evaluate our road traffic
allocation scheme using actual road traffic counts in
France. The numerical results show that 20\% of
vehicles in circulation in France equipped with only
one Terabyte of storage can offload Petabyte transfers
in a week.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Afek:2016:MDE,
author = "Yehuda Afek and Anat Bremler-Barr and Yotam Harchol
and David Hay and Yaron Koral",
title = "Making {DPI} Engines Resilient to Algorithmic
Complexity Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3262--3275",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2518712",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper starts by demonstrating the vulnerability
of Deep Packet Inspection DPI mechanisms, which are at
the core of security devices, to algorithmic complexity
denial of service attacks, thus exposing a weakness in
the first line of defense of enterprise networks and
clouds. A system and a multi-core architecture to
defend from these algorithmic complexity attacks is
presented in the second part of the paper. The
integration of this system with two different DPI
engines is demonstrated and discussed. The
vulnerability is exposed by showing how a simple low
bandwidth cache-miss attack takes down the
Aho--Corasick AC pattern matching algorithm that lies
at the heart of most DPI engines. As a first step in
the mitigation of the attack, we have developed a
compressed variant of the AC algorithm that improves
the worst case performance under an attack. Still,
under normal traffic its running-time is worse than
classical AC implementations. To overcome this problem,
we introduce $ {\rm MCA}^2 $ --- Multi-Core
Architecture to Mitigate Complexity Attacks, which
dynamically combines the classical AC algorithm with
our compressed implementation, to provide a robust
solution to mitigate this cache-miss attack. We
demonstrate the effectiveness of our architecture by
examining cache-miss algorithmic complexity attacks
against DPI engines and show a goodput boost of up to
73\%. Finally, we show that our architecture may be
generalized to provide a principal solution to a wide
variety of algorithmic complexity attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:SEP,
author = "Xinlei Wang and Amit Pande and Jindan Zhu and Prasant
Mohapatra",
title = "{STAMP}: Enabling Privacy-Preserving Location Proofs
for Mobile Users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3276--3289",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2515119",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Location-based services are quickly becoming immensely
popular. In addition to services based on users'
current location, many potential services rely on
users' location history, or their spatial-temporal
provenance. Malicious users may lie about their
spatial-temporal provenance without a carefully
designed security system for users to prove their past
locations. In this paper, we present the
Spatial-Temporal provenance Assurance with Mutual
Proofs STAMP scheme. STAMP is designed for ad-hoc
mobile users generating location proofs for each other
in a distributed setting. However, it can easily
accommodate trusted mobile users and wireless access
points. STAMP ensures the integrity and
non-transferability of the location proofs and protects
users' privacy. A semi-trusted Certification Authority
is used to distribute cryptographic keys as well as
guard users against collusion by a light-weight
entropy-based trust evaluation approach. Our prototype
implementation on the Android platform shows that STAMP
is low-cost in terms of computational and storage
resources. Extensive simulation experiments show that
our entropy-based trust model is able to achieve high $
> 0.9 $ collusion detection accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:CCV,
author = "Le Zhang and Shahrokh Valaee",
title = "Congestion Control for Vehicular Networks With
Safety-Awareness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3290--3299",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2521365",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Vehicular safety applications require reliable and
up-to-date knowledge of the local neighborhood. Under
IEEE 802.11p, this is attained through single-hop
broadcasts of safety beacons in the control channel.
However, high transmission power and node mobility can
cause regions of node density to form rapidly. In such
situations, excessive load on the control channel must
be avoided to prevent performance degradation for
safety applications. Existing congestion control
schemes aim to reach a fair distribution of available
channel resources, but fail to account for the
differing quality of service QoS requirements of
vehicles in different driving contexts. This context
depends on many factors, including the relative
position and velocity of its neighbors. The problem of
adapting each vehicle's transmission probability under
a slotted p-persistent vehicular broadcast medium
access control MAC protocol is formulated as a network
utility maximization NUM problem which takes the
driving context into account. A distributed algorithm
is proposed to solve this problem in a decentralized
manner, its convergence is analyzed, and its
performance is evaluated through simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:TRS,
author = "Wenping Liu and Tianping Deng and Yang and Hongbo
Jiang and Xiaofei Liao and Jiangchuan Liu and Bo Li and
Guoyin Jiang",
title = "Towards Robust Surface Skeleton Extraction and Its
Applications in {$3$D} Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3300--3313",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2516343",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The in-network data storage and retrieval are
fundamental functions of sensor networks. Among many
proposals, geographical hash table GHT is perhaps most
appealing as it is very simple yet powerful with low
communication cost, where the key is to correctly
define the bounding box. It is envisioned that the
skeleton has the power to facilitate computing a
precise bounding box. In existing works, the focus has
been on skeleton extraction algorithms targeting for 2D
sensor networks, which usually deliver a 1-manifold
skeleton consisting of 1D curves. It faces a set of
non-trivial challenges when 3D sensor networks are
considered, in order to properly extract the surface
skeleton composed of a set of 2-manifolds and possibly
1D curves. In this paper, we study the problem of
surface skeleton extraction in 3D sensor networks. We
propose a scalable and distributed connectivity-based
algorithm to extract the surface skeleton of 3D sensor
networks. First, we propose a novel approach to
identifying surface skeleton nodes by computing the
extended feature nodes such that it is robust against
boundary noise, etc. We then find the maximal
independent set of the identified skeleton nodes and
triangulate them to form a coarse-grained surface
skeleton, followed by a refining process to generate
the fine-grained surface skeleton. Furthermore, we
design an efficient updating scheme to react to the
network dynamics caused by node failure, insertion,
etc. We also investigate the impact of boundary
incompleteness and present a scheme to extract the
surface skeleton under incomplete boundary. Finally, we
apply the extracted surface skeleton to facilitate the
design of data storage protocol and curve skeleton
extraction algorithm. Extensive simulations show the
robustness of the proposed algorithm to shape
variation, node density, node distribution,
communication radio model and boundary incompleteness,
and its effectiveness for data storage and retrieval
application with respect to load balancing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:FAC,
author = "Wei Gong and Haoxiang Liu and Xin Miao and Kebin Liu
and Wenbo He and Lan Zhang and Yunhao Liu",
title = "Fast and Adaptive Continuous Scanning in Large-Scale
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3314--3325",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2521333",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio Frequency Identification RFID technology plays
an important role in supply chain logistics and
inventory control. In these applications, a series of
scanning operations at different locations are often
needed to cover the entire inventory tags. In such
continuous scanning scenario, adjacent scans inevitably
read overlapping tags multiple times. Most existing
methods suffer from low scanning efficiency when the
overlap is small, since they do not distinguish the
size of overlap which is an important factor of
scanning performance. In this paper, we analytically
unveil the fundamental relationship between the
performance of continuous scanning and the size of
overlap, deriving a critical threshold for the
selection of scanning strategy. Further, we design an
accurate estimator to approximate the overlap.
Combining the estimate and a compact data structure, an
adaptive scanning scheme is introduced to achieve low
communication time. Through detailed analysis and
extensive simulations, we demonstrate that the proposed
scheme significantly outperforms previous approach in
total scanning time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiao:2016:WBF,
author = "Yan Qiao and Shigang Chen and Zhen Mo and Myungkeun
Yoon",
title = "When {Bloom} Filters Are No Longer Compact: Multi-Set
Membership Lookup for Network Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3326--3339",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2536618",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many important network functions require online
membership lookup against a large set of addresses,
flow labels, signatures, and so on. This paper studies
a more difficult, yet less investigated problem, called
multi-set membership lookup, which involves multiple
sometimes in hundreds or even thousands sets. The
lookup determines not only whether an element is a
member of the sets but also which set it belongs to. To
facilitate the implementation of multi-set membership
lookup in on-die memory of a network processor for
line-speed packet inspection, the existing work uses
the variants of Bloom filters to encode set IDs.
However, through a thorough analysis of the mechanism
and the performance of the prior art, much to our
surprise, we find that Bloom filters --- which were
originally designed for encoding binary membership
information --- are actually not efficient for encoding
set IDs. This paper takes a different solution path by
separating membership encoding and set ID storage in
two data structures, called index filter and set-id
table, respectively. With a new ID placement strategy
called uneven candidate-entry distribution and a
two-level design of an index filter, we demonstrate
through analysis and simulation that when compared with
the best existing work, our new approach is able to
achieve significant memory saving under the same lookup
accuracy requirement, or achieve significantly better
lookup accuracy under the same memory constraint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:FCD,
author = "Huazi Zhang and Kairan Sun and Qiuyuan Huang and
Yonggang Wen and Dapeng Wu",
title = "{FUN} Coding: Design and Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3340--3353",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2516819",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Joint FoUntain coding and Network coding FUN is
proposed to boost information spreading over multi-hop
lossy networks. The novelty of our FUN approach lies in
combining the best features of fountain coding,
intra-session network coding, and cross-next-hop
network coding. This paper provides an in-depth study
of FUN codes. First, we theoretically analyze the
throughput of FUN codes. Second, we identify several
practical issues that may undermine the actual
performance, such as buffer overflow, and quantify the
resulting throughput degradation. Finally, we propose a
systematic design to overcome these issues. Simulation
results in TDMA multi-hop networks show that our
methods yield near-optimal throughput and are
significantly better than fountain codes and existing
network coding schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sermpezis:2016:ECP,
author = "Pavlos Sermpezis and Thrasyvoulos Spyropoulos",
title = "Effects of Content Popularity on the Performance of
Content-Centric Opportunistic Networking: an Analytical
Approach and Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3354--3368",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2523123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile users are envisioned to exploit direct
communication opportunities between their portable
devices, in order to enrich the set of services they
can access through cellular or WiFi networks. Sharing
contents of common interest or providing access to
resources or services between peers can enhance a
mobile node's capabilities, offload the cellular
network, and disseminate information to nodes without
Internet access. Interest patterns, i.e., how many
nodes are interested in each content or service
popularity, as well as how many users can provide a
content or service availability impact the performance
and feasibility of envisioned applications. In this
paper, we establish an analytical framework to study
the effects of these factors on the delay and success
probability of a content/service access request through
opportunistic communication. We also apply our
framework to the mobile data offloading problem and
provide insights for the optimization of its
performance. We validate our model and results through
realistic simulations, using datasets of real
opportunistic networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hoque:2016:AAT,
author = "Endadul Hoque and Hyojeong Lee and Rahul Potharaju and
Charles Killian and Cristina Nita-Rotaru",
title = "Automated Adversarial Testing of Unmodified Wireless
Routing Implementations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3369--3382",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2520474",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Numerous routing protocols have been designed and
subjected to model checking and simulations. However,
model checking the design or testing the
simulator-based prototype of a protocol does not
guarantee that the implementation is free of bugs and
vulnerabilities. Testing implementations beyond their
basic functionality also known as adversarial testing
can increase protocol robustness. We focus on automated
adversarial testing of real-world implementations of
wireless routing protocols. In our previous work we
created Turret, a platform that uses a network emulator
and virtualization to test unmodified binaries of
general distributed systems. Based on Turret, we create
Turret-W designed specifically for wireless routing
protocols. Turret-W includes new functionalities such
as differentiating routing messages from data messages
to enable evaluation of attacks on the control plane
and the data plane separately, support for several
additional protocols e.g., those that use
homogeneous\slash heterogeneous packet formats, those
that run on geographic forwarding not just IP, those
that operate at the data link layer instead of the
network layer, support for several additional attacks
e.g., replay attacks and for establishment of
adversarial side-channels that allow for collusion.
Turret-W can test not only general routing attacks, but
also wireless specific attacks such as wormhole. Using
Turret-W on publicly available implementations of five
representative routing protocols, we re-discovered 37
attacks and 3 bugs. All these bugs and 5 of the total
attacks were not previously reported to the best of our
knowledge.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yagan:2016:WSN,
author = "Osman Yagan and Armand M. Makowski",
title = "Wireless Sensor Networks Under the Random Pairwise Key
Predistribution Scheme: Can Resiliency Be Achieved With
Small Key Rings?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3383--3396",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2527742",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the resiliency of wireless sensor
networks against sensor capture attacks when the
network uses the random pairwise key distribution
scheme of Chan et al. We present conditions on the
model parameters so that the network is: 1 unassailable
and 2 unsplittable, both with high probability, as the
number $n$ of sensor nodes becomes large. Both notions
are defined against an adversary who has unlimited
computing resources and full knowledge of the network
topology, but can only capture a negligible fraction $
o n$ of sensors. We also show that the number of
cryptographic keys needed to ensure unassailability and
unsplittability under the pairwise key predistribution
scheme is an order of magnitude smaller than it is
under the key predistribution scheme of Eschenauer and
Gligor.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2016:LBT,
author = "Dongmyoung Kim and Taejun Park and Seongwon Kim and
Hyoil Kim and Sunghyun Choi",
title = "Load Balancing in Two-Tier Cellular Networks With Open
and Hybrid Access Femtocells",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3397--3411",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2527835",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Femtocell base station BS is a low-power, low-price BS
based on the cellular communication technology. It is
expected to become a cost-effective solution for
improving the communication performance of indoor
users, whose traffic demands are large in general. We
propose long-term parameter optimization schemes for
open and hybrid femtocells, which maximize the average
throughput of macrocell users by offloading the macro
users' downlink traffic to femtocells. To achieve this
goal, load balancing between femtocells and macrocells
is needed, and hence, we jointly optimize the ratio of
dedicated resources for femtocells as well as the
femtocell service area in open access femtocell
networks by numerical analysis. Then, we extend our
algorithm to hybrid access femtocells, where some
intra-femtocell resources are dedicated only for
femtocell owners, while remaining resources are shared
with foreign macrocell users. Our evaluation results
show that the proposed parameter optimization schemes
significantly enhance the performance of macrocell
users because of the large offloading gain. The
benefits provided to femtocell users are also
adaptively maintained according to the femtocell users'
requirements. The results in this paper also provide
insights about the situations where femtocell
deployment on dedicated channels is preferred to the
cochannel deployment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mizrahi:2016:TCN,
author = "Tal Mizrahi and Efi Saat and Yoram Moses",
title = "Timed Consistent Network Updates in Software-Defined
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3412--3425",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2529058",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network updates, such as policy and routing changes,
occur frequently in software-defined networks SDNs.
Updates should be performed consistently, preventing
temporary disruptions, and should require as little
overhead as possible. Scalability is increasingly
becoming an essential requirement in SDNs. In this
paper, we propose to use time-triggered network updates
to achieve consistent updates. Our proposed solution
requires lower overhead than the existing update
approaches, without compromising the consistency during
the update. We demonstrate that accurate time enables
far more scalable consistent updates in the SDN than
previously available. In addition, it provides the SDN
programmer with fine-grained control over the tradeoff
between consistency and scalability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:EPC,
author = "Jiliang Wang and Shuo Lian and Wei Dong and Xiang-Yang
Li and Yunhao Liu",
title = "Every Packet Counts: Loss and Reordering
Identification and Its Application in Delay
Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3426--3438",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2523127",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Delay is an important metric to understand and improve
system performance. While existing approaches focus on
aggregated delay statistics in pre-programmed
granularity and provide results such as average and
deviation, those approaches may not provide
fine-grained delay measurement and thus may miss
important delay characteristics. For example, delay
anomaly, which is a critical system performance
indicator, may not be captured by coarse-grained
approaches. We propose a new measurement structure
design called order preserving aggregator OPA. Based on
OPA, we can efficiently encode and recover the ordering
and loss information by exploiting inherent data
characteristics. We then propose a two-layer design to
convey both ordering and time stamp, and efficiently
derive per-packet delay/loss measurement. We evaluate
our approach both analytically and experimentally. The
results show that our approach can achieve per-packet
delay measurement with an average of per-packet
relative error at 2\%, and an average of aggregated
relative error at $ 10^{-5} $, while introducing
additional communication overhead in the order of $
10^{-4} $ in terms of number of packets. While at a low
data rate, the computation overhead of OPA is
acceptable. Reducing the computation and communication
overhead under high data rate, to make OPA more
practical in real applications, will be our future
direction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:DSL,
author = "Wenping Liu and Hongbo Jiang and Jiangchuan Liu and
Xiaofei Liao and Hongzhi Lin and Tianping Deng",
title = "On the Distance-Sensitive and Load-Balanced
Information Storage and Retrieval for {$3$D} Sensor
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3439--3449",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2523242",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient in-network information storage and retrieval
is of paramount importance to sensor networks and has
attracted a large number of studies while most of them
focus on 2D fields. In this paper, we propose novel
Reeb graph based information storage and retrieval
schemes for 3D sensor networks. The key is to extract
the line-like skeleton from the Reeb graph of a
network, based on which two distance-sensitive
information storage and retrieval schemes are
developed: one devoted to shorter retrieval path and
the other devoted to more balanced load. Desirably, the
proposed algorithms have no reliance on the geographic
location or boundary information, and have no
constraint on the network shape or communication graph.
The extensive simulations also show their efficiency in
terms of sensor storage load and retrieval path
length.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oh:2016:FBP,
author = "Bong-Hwan Oh and Jaiyong Lee",
title = "Feedback-Based Path Failure Detection and Buffer
Blocking Protection for {MPTCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3450--3461",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2527759",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A multipath TCP MPTCP is a promising protocol that has
been standardized by the Internet Engineering Task
Force to support multipath operations in the transport
layer. However, although the MPTCP can provide multiple
transmission paths and aggregate the bandwidth of
multiple paths, it does not consistently achieve more
throughput goodput nor a greater connection resilience.
Currently, the MPTCP is vulnerable to path failure or
underperforming subflows, which cause transmission
interruption or throughput goodput degradation.
Unfortunately, there is no exact rule for declaring a
path failure or preventing the usage of underperforming
subflows in the MPTCP. In this paper, we propose a
novel path failure detection method referred to as
feedback-based path failure FPF detection. In addition,
we propose a new decision method called buffer blocking
protection BBP to address the underperforming subflows
for the MPTCP. Measurement results indicate that the
FPF detection reduces transmission interruption time by
the fast path failure decision, which can prevent
duplicate transmission interruption events and
unnecessary retransmissions. Furthermore, the FPF
detection is sufficiently robust in terms of packet
loss and the delay difference between paths. The
results additionally show that the BBP method prevents
goodput degradation due to underperforming subflows.
Consequently, the MPTCP with the BBP method can at
least achieve the throughput performance of a single
Transmission Control Protocol TCP, which uses the best
path regardless of the delay difference between
paths.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sobrinho:2016:SIR,
author = "Joao Luis Sobrinho and Laurent Vanbever and Franck Le
and Andre Sousa and Jennifer Rexford",
title = "Scaling the {Internet} Routing System Through
Distributed Route Aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3462--3476",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2527842",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet routing system faces serious scalability
challenges due to the growing number of IP prefixes
that needs to be propagated throughout the network.
Although IP prefixes are assigned hierarchically and
roughly align with geographic regions, today's Border
Gateway Protocol BGP and operational practices do not
exploit opportunities to aggregate routing information.
We present DRAGON, a distributed route-aggregation
technique whereby nodes analyze BGP routes across
different prefixes to determine which of them can be
filtered while respecting the routing policies for
forwarding data-packets. DRAGON works with BGP, can be
deployed incrementally, and offers incentives for
Autonomous Systems ASs to upgrade their router
software. We illustrate the design of DRAGON through a
number of examples, prove its properties while
developing a theoretical model of route aggregation,
and evaluate its performance. Our experiments with
realistic AS-level topologies, assignments of IP
prefixes, and routing policies show that DRAGON reduces
the number of prefixes in each AS by at least 70\% with
minimal stretch in the lengths of AS-paths traversed by
data packets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shahzad:2016:AEP,
author = "Muhammad Shahzad and Alex X. Liu",
title = "Accurate and Efficient Per-Flow Latency Measurement
Without Probing and Time Stamping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3477--3492",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2533544",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the growth in number and significance of the
emerging applications that require extremely low
latencies, network operators are facing increasing need
to perform latency measurement on per-flow basis for
network monitoring and troubleshooting. In this paper,
we propose COLATE, the first per-flow latency
measurement scheme that requires no probe packets and
time stamping. Given a set of observation points,
COLATE records packet timing information at each point
so that later, for any two points, it can accurately
estimate the average and the standard deviation of the
latencies experienced by the packets of any flow in
passing the two points. The key idea is that when
recording packet timing information, COLATE purposely
allows noise to be introduced for minimizing storage
space, and when querying the latency of a target flow,
COLATE uses statistical techniques to denoise and
obtain an accurate latency estimate. COLATE is designed
to be efficiently implementable on network middleboxes.
In terms of processing overhead, COLATE performs only
one hash and one memory update per packet. In terms of
storage space, COLATE uses less than 0.1-b/packet,
which means that, on a backbone link with half a
million packets per second, using a 256-GB drive,
COLATE can accumulate time stamps of packets traversing
the link for over 1.5 years. We evaluated COLATE using
three real traffic traces, namely, a backbone traffic
trace, an enterprise network traffic trace, and a data
center traffic trace. Results show that COLATE always
achieves the required reliability for any given
confidence interval.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Blocq:2016:HGB,
author = "Gideon Blocq and Ariel Orda",
title = "How Good is Bargained Routing?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3493--3507",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2530308",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the context of networking, research has focused on
non-cooperative games, where the selfish agents cannot
reach a binding agreement on the way they would share
the infrastructure. Many approaches have been proposed
for mitigating the typically inefficient operating
points. However, in a growing number of networking
scenarios, selfish agents are able to communicate and
reach an agreement. Hence, the degradation of
performance should be considered at an operating point
of a cooperative game. Accordingly, our goal is to lay
foundations for the application of the cooperative game
theory to fundamental problems in networking. We
explain our choice of the Nash bargaining scheme NBS as
the solution concept, and introduce the price of
selfishness PoS, which considers the degradation of
performance at the worst NBS. We focus on the
fundamental load balancing game of routing over
parallel links. First, we consider agents with
identical performance objectives. We show that, while
the price of anarchy PoA here can be large, through
bargaining, all agents, and the system, strictly
improve their performance. Interestingly, in a
two-agent system or when all the agents have identical
demands, we establish that they reach social
optimality. We then consider agents with different
performance objectives and demonstrate that the PoS and
PoA can be unbounded, yet we explain why both measures
are unsuitable. Accordingly, we introduce the price of
heterogeneity PoH, as an extension of the PoA. We
establish an upper bound on the PoH and indicate its
further motivation for bargaining. Finally, we discuss
network design guidelines that follow from our
findings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2016:ISA,
author = "Xin Sun and Geoffrey G. Xie",
title = "An Integrated Systematic Approach to Designing
Enterprise Access Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3508--3522",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2535468",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today, the network design process remains ad hoc and
largely complexity agnostic, often resulting in
suboptimal networks characterized by excessive amounts
of dependence and commands in device configurations.
The unnecessary high configuration complexity can lead
to a huge increase in both the amount of manual
intervention required for managing the network and the
likelihood of configuration errors, and thus must be
avoided. In this paper, we present an integrated
top--down design approach and show how it can minimize
the unnecessary configuration complexity in realizing
reachability-based access control, a key network design
objective that involves designing three distinct
network elements: virtual local-area network VLAN, IP
address, and packet filter. Capitalizing on newly
developed abstractions, our approach integrates the
design of these three elements into a unified framework
by systematically modeling how the design of one
element may impact the complexity of other elements.
Our approach goes substantially beyond the current
divide-and-conquer approach that designs each element
in complete isolation, and enables minimizing the
combined complexity of all elements. Specifically, two
new optimization problems are formulated, and novel
algorithms and heuristics are developed to solve the
formulated problems. Evaluation on a large campus
network shows that our approach can effectively reduce
the packet filter complexity and VLAN trunking
complexity by more than 85\% and 70\%, respectively,
when compared with the ad hoc approach currently used
by the operators.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ji:2016:SDA,
author = "Shouling Ji and Weiqing Li and Mudhakar Srivatsa and
Raheem Beyah",
title = "Structural Data De-Anonymization: Theory and
Practice",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3523--3536",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2536479",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the quantification, practice,
and implications of structural data de-anonymization,
including social data, mobility traces, and so on.
First, we answer several open questions in structural
data de-anonymization by quantifying perfect and $ 1 -
\epsilon $ -perfect structural data de-anonymization,
where $ \epsilon $ is the error tolerated by a
de-anonymization scheme. To the best of our knowledge,
this is the first work on quantifying structural data
de-anonymization under a general data model, which
closes the gap between the structural data
de-anonymization practice and theory. Second, we
conduct the first large-scale study on the
de-anonymizability of 26 real world structural data
sets, including social networks, collaborations
networks, communication networks, autonomous systems,
peer-to-peer networks, and so on. We also
quantitatively show the perfect and $ 1 - \epsilon $
-perfect de-anonymization conditions of the 26 data
sets. Third, following our quantification, we present a
practical attack [a novel single-phase cold start
optimization-based de-anonymization ODA algorithm]. An
experimental analysis of ODA shows that $ \sim 77.7 $
\%--83.3\% of the users in Gowalla 196 591 users and
950 327 edges and 86.9\%--95.5\% of the users in
Google+ 4 692 671 users and 90 751 480 edges are
de-anonymizable in different scenarios, which implies
that the structure-based de-anonymization is powerful
in practice. Finally, we discuss the implications of
our de-anonymization quantification and our ODA attack
and provide some general suggestions for future secure
data publishing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2016:CCC,
author = "Ming Zhu and Dan Li and Fangxin Wang and Anke Li and
K. K. Ramakrishnan and Ying Liu and Jianping Wu and Nan
Zhu and Xue Liu",
title = "{CCDN}: Content-Centric Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3537--3550",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2530739",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data center networks continually seek higher network
performance to meet the ever increasing application
demand. Recently, researchers are exploring the method
to enhance the data center network performance by
intelligent caching and increasing the access points
for hot data chunks. Motivated by this, we come up with
a simple yet useful caching mechanism for generic data
centers, i.e., a server caches a data chunk after an
application on it reads the chunk from the file system,
and then uses the cached chunk to serve subsequent
chunk requests from nearby servers. To turn the basic
idea above into a practical system and address the
challenges behind it, we design content-centric data
center networks CCDNs, which exploits an innovative
combination of content-based forwarding and location
[Internet Protocol IP]-based forwarding in switches, to
correctly locate the target server for a data chunk on
a fully distributed basis. Furthermore, CCDN enhances
traditional content-based forwarding to determine the
nearest target server, and enhances traditional
location IP-based forwarding to make high utilization
of the precious memory space in switches. Extensive
simulations based on real-world workloads and
experiments on a test bed built with NetFPGA prototypes
show that, even with a small portion of the server's
storage as cache e.g., 3\% and with a modest content
forwarding information base size e.g., 1000 entries in
switches, CCDN can improve the average throughput to
get data chunks by 43\% compared with a pure Hadoop
File System HDFS system in a real data center.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qi:2016:SID,
author = "Saiyu Qi and Yuanqing Zheng and Mo Li and Yunhao Liu
and Jinli Qiu",
title = "Scalable Industry Data Access Control in
{RFID}-Enabled Supply Chain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3551--3564",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2536626",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "By attaching RFID tags to products, supply chain
participants can identify products and create product
data to record the product particulars in transit.
Participants along the supply chain share their product
data to enable information exchange and support
critical decisions in production operations. Such an
information sharing essentially requires a data access
control mechanism when the product data relate to
sensitive business issues. However, existing access
control solutions are ill-suited to the RFID-enabled
supply chain, as they are not scalable in handling a
huge number of tags, introduce vulnerability to the
product data, and perform poorly to support privilege
revocation of product data. We present a new scalable
industry data access control system that addresses
these limitations. Our system provides an item-level
data access control mechanism that defines and enforces
access policies based on both the participants' role
attributes and the products' RFID tag attributes. Our
system further provides an item-level privilege
revocation mechanism by allowing the participants to
delegate encryption updates in revocation operation
without disclosing the underlying data contents. We
design a new updatable encryption scheme and integrate
it with ciphertext policy-attribute-based encryption to
implement the key components of our system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2016:ISI,
author = "Bing Hu and Kwan L. Yeung and Qian Zhou and Chunzhi
He",
title = "On Iterative Scheduling for Input-Queued Switches With
a Speedup of {$ 2 - 1 / N $}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3565--3577",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2541161",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An efficient iterative scheduling algorithm for
input-queued switches, called round robin with longest
queue first RR/LQF, is proposed in this paper. RR/LQF
consists of three phases: report, grant, and accept. In
each phase, only a single-bit message per port is sent
for reporting a packet arrival, granting an input for
packet sending, or accepting a grant. In both the grant
and accept phases, scheduling priority is given to the
preferred input--output pairs first and the longest
virtual output queuing VOQ next. The notion of the
preferred input--output pair is to keep a global RR
schedule among all the inputs and the outputs. By
serving the preferred input--output pairs first, the
match size tends to be maximized. By serving the
longest VOQ next, the match weight is also boosted.
When RR/LQF is executed for a single iteration i.e.,
RR/LQF-1, we show by simulations that RR/LQF-1
outperforms all the existing
single-bit-single-iteration scheduling algorithms. When
RR/LQF is executed up to $N$ iterations i.e., RR/LQF-
$N$, we prove that under any admissible traffic
pattern, RR/LQF- $N$ is stable with a speedup of $ 2 -
1 / N$, where $N$ is the switch size. To the best of
our knowledge, this is the first work showing that an
iterative scheduling algorithm is stable with a speedup
less than 2. We then generalize RR/LQF to become a
class of algorithms that have the same speedup bound of
$ 2 - 1 / N$. Efforts are then made to further reduce
the implementation complexity of RR/LQF. To this end,
the pipelined RR/LQF and RR/RR, a simpler variant of
RR/LQF, are proposed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Archambault:2016:RSA,
author = "Emile Archambault and Nabih Alloune and Marija Furdek
and Zhenyu Xu and Christine Tremblay and Ajmal Muhammad
and Jiajia Chen and Lena Wosinska and Paul Littlewood
and Michel P. Belanger",
title = "Routing and Spectrum Assignment in Elastic Filterless
Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3578--3592",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2528242",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Elastic optical networking is considered a promising
candidate to improve the spectral efficiency of optical
networks. One of the most important planning challenges
of elastic optical networks is the NP-hard routing and
spectrum assignment RSA problem. In this paper, we
investigate offline RSA in elastic filterless optical
networks, which use a passive broadcast-and-select
architecture to offer network agility. Here, an elastic
optical network is referred to as the optical network
that can adapt the channel bandwidth, data rate, and
transmission format for each traffic demand in order to
offer maximum throughput. In elastic filterless
networks, the presence of unfiltered signals resulting
from the drop-and-continue node architecture must be
considered as an additional constraint in the RSA
problem. In this paper, first, the RSA problem in
elastic filterless networks is formulated by using an
integer linear program to obtain optimal solutions for
small networks. Due to the problem complexity, two
efficient RSA heuristics are also proposed to achieve
suboptimal solutions for larger networks in reasonable
time. Simulation results show that significant
bandwidth savings in elastic filterless networks can be
achieved compared with the fixed-grid filterless
solutions. The proposed approach is further tested in
multi-period traffic scenarios and combined with
periodical spectrum defragmentation, leading to
additional improvement in spectrum utilization of
elastic filterless optical networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2016:EST,
author = "Xu Chen and Xiaowen Gong and Lei Yang and Junshan
Zhang",
title = "Exploiting Social Tie Structure for Cooperative
Wireless Networking: a Social Group Utility
Maximization Framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3593--3606",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2530070",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop a social group utility maximization SGUM
framework for cooperative wireless networking that
takes into account both social relationships and
physical coupling among users. Specifically, instead of
maximizing its individual utility or the overall
network utility, each user aims to maximize its social
group utility that hinges heavily on its social tie
structure with other users. We show that this framework
provides rich modeling flexibility and spans the
continuum between non-cooperative game and network
utility maximization NUM --- two traditionally disjoint
paradigms for network optimization. Based on this
framework, we study three important applications of
SGUM, in database assisted spectrum access, power
control, and random access control, respectively. For
the case of database assisted spectrum access, we show
that the SGUM game is a potential game and always
admits a socially-aware Nash equilibrium SNE. We also
develop a distributed spectrum access algorithm that
can converge to the SNE and also quantify the trade-off
between the performance and convergence time of the
algorithm. For the cases of power control and random
access control, we show that there exists a unique SNE
and the network performance improves as the strength of
social ties increase. Numerical results corroborate
that the SGUM solutions can achieve superior
performance using real social data trace. Furthermore,
we show that the SGUM framework can be generalized to
take into account both positive and negative social
ties among users, which can be a useful tool for
studying network security problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:IFB,
author = "Qing Wang and Domenico Giustiniano",
title = "Intra-Frame Bidirectional Transmission in Networks of
Visible {LEDs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3607--3619",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2530874",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The optical antenna's directionality of nodes forming
a visible light communication VLC network, i.e., their
field-of-view FOV, varies greatly from device to
device. This encompasses wide FOVs of ambient light
infrastructure and directional FOVs of light from
low-end embedded devices. This variety of light
propagation can severely affect the transmission
reliability, despite pointing the devices to each other
may seem enough for a reliable communication. The
presence of interference among nodes with different
FOVs makes traditional access protocols in VLC
unreliable, and it also exacerbates the hidden-node
problem. In this paper, we propose a carrier sensing
multiple access/collision detection and hidden
avoidance CSMA/CD-HA medium access control protocol for
a network, where each node solely uses one
light-emitting diode to transmit and receive data. The
CSMA/CD-HA can enable in-band intra-frame bidirectional
transmission with just one optical antenna. The key
idea is to exploit the intra-frame data symbols without
the emission of light to introduce an embedded
communication channel. This approach enables the
transmission of additional data while receiving in the
same optical frequency band, and it makes the
communication robust to different types of FOVs. We
implement the CSMA/CD-HA protocol in a software-defined
embedded platform running Linux, and evaluate its
performance through analysis and experiments. Results
show that collisions caused by hidden nodes can largely
be reduced, and our protocol can increase the
saturation throughput by nearly up to 50\% and 100\%
under the two- and four-node scenarios, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2016:AML,
author = "Zhao Zhang and James Willson and Zaixin Lu and Weili
Wu and Xuding Zhu and Ding-Zhu Du",
title = "Approximating Maximum Lifetime $k$-Coverage Through
Minimizing Weighted $k$-Cover in Homogeneous Wireless
Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3620--3633",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2531688",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Energy efficiency is an important issue in the study
of wireless sensor networks. Given a set of targets and
a set of sensors with bounded lifetime, the maximum
lifetime $k$ -coverage problem is to schedule
active/sleeping status of sensors to maximize the time
period during which every target is covered by at least
$k$ active sensors. Previously, it was known that when
the sensing ranges are uniform, this problem has a
polynomial-time $ 4 + \varepsilon $ -approximation for
$ k = 1$ and $ 6 + \varepsilon $ -approximation for $ k
= 2$. In this paper, we make significant progress by
showing that for any positive integer $k$, there exists
a polynomial-time $ 3 + \varepsilon $ -approximation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2016:ALO,
author = "Di Wu and Qiang Liu and Yong Li and Julie A. McCann
and Amelia C. Regan and Nalini Venkatasubramanian",
title = "Adaptive Lookup of Open {WiFi} Using Crowdsensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3634--3647",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2533399",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Open WiFi access points APs are demonstrating that
they can provide opportunistic data services to moving
vehicles. We present CrowdWiFi, a novel system to look
up roadside WiFi APs located outdoors or inside
buildings. CrowdWiFi consists of two components: online
compressive sensing CS and offline crowdsourcing.
Online CS presents an efficient framework for the
coarse-grained estimation of nearby APs along the
driving route, where received signal strength RSS
values are recorded at runtime, and the number and
location of the APs are recovered immediately based on
limited RSS readings and adaptive CS operations.
Offline crowdsourcing assigns the online CS tasks to
crowd-vehicles and aggregates answers on a bipartite
graphical model. Crowd-server also iteratively infers
the reliability of each crowd-vehicle from the
aggregated sensing results, and then refines the
estimation of the APs using weighted centroid
processing. Extensive simulation results and real
testbed experiments confirm that CrowdWiFi can
successfully reduce the computation cost and energy
consumption of roadside WiFi lookup, while maintaining
satisfactory localization accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:NLC,
author = "Long Gong and Huihui Jiang and Yixiang Wang and Zuqing
Zhu",
title = "Novel Location-Constrained Virtual Network Embedding
{LC-VNE} Algorithms Towards Integrated Node and Link
Mapping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3648--3661",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2533625",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper tries to solve the location-constrained
virtual network embedding LC-VNE problem efficiently.
We first investigate the complexity of LC-VNE, and by
leveraging the graph bisection problem, we provide the
first formal proof of the $ \mathcal {NP} $
-completeness and inapproximability result of LC-VNE.
Then, we propose two novel LC-VNE algorithms based on a
compatibility graph CG to achieve integrated node and
link mapping. In particular, in the CG, each node
represents a candidate substrate path for a virtual
link, and each link indicates the compatible relation
between its two endnodes. Our theoretical analysis
proves that the maximal clique in the CG is also the
maximum one when the substrate network has sufficient
resources. With CG, we reduce LC-VNE to the
minimum-cost maximum clique problem, which inspires us
to propose two efficient LC-VNE heuristics. Extensive
numerical simulations demonstrate that compared with
the existing ones, our proposed LC-VNE algorithms have
significantly reduced time complexity and can provide
smaller gaps to the optimal solutions, lower blocking
probabilities, and higher time-average revenue as
well.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oya:2016:DPM,
author = "Simon Oya and Fernando Perez-Gonzalez and Carmela
Troncoso",
title = "Design of Pool Mixes Against Profiling Attacks in Real
Conditions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3662--3675",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2547391",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current implementations of high-latency anonymous
communication systems are based on pool mixes. These
tools act as routers that apply a random delay to the
messages traversing them, making it hard for an
eavesdropper to guess the correspondences between
incoming and outgoing messages. This hides the
identities of communicating partners in the network,
but it does not prevent an adversary continuously
monitoring the network from unveiling the communication
profiles of the users. In this paper, we tackle the
problem of designing the delay characteristic of pool
mixes so as to maximize the protection of the users
against profiling attacks. First, we propose a
theoretical model for users' sending behavior which we
validate using three real data sets of a different
nature. Then, we use this model to perform a privacy
analysis of the system and obtain the delay function of
the mix, which is optimal in the sense of protecting
the users. Since computing the delay characteristic of
this optimal pool mix requires information about the
users' behavior, we also propose a user-independent but
less effective mix design. We evaluate these pool
mixes, comparing them with one of the most studied
existing designs, the binomial pool mix. Our
experiments show that an adversary against our optimal
design may need up to 30 times as long to achieve the
same level of disclosure as for a binomial pool mix.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2016:AER,
author = "Long Cheng and Jianwei Niu and Yu Gu and Chengwen Luo
and Tian He",
title = "Achieving Efficient Reliable Flooding in
Low-Duty-Cycle Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3676--3689",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2549017",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reliable flooding in wireless sensor networks WSNs is
desirable for a broad range of applications and network
operations. However, relatively little work has been
done for reliable flooding in low-duty-cycle WSNs with
unreliable wireless links. It is a challenging problem
to efficiently ensure 100\% flooding coverage
considering the combined effects of low-duty-cycle
operation and unreliable wireless transmission. In this
paper, we propose a novel dynamic switching-based
reliable flooding DSRF framework, which is designed as
an enhancement layer to provide efficient and reliable
delivery for a variety of existing flooding tree
structures in low-duty-cycle WSNs. The key novelty of
DSRF lies in the dynamic switching decision making when
encountering a transmission failure, where a flooding
tree structure is dynamically adjusted based on the
packet reception results for energy saving and delay
reduction. DSRF distinguishes itself from the existing
works in that it explores both poor links and good
links on demand. In addition, we define the optimal
wakeup schedule-ranking problem in order to maximize
the switching gain in DSRF. We prove the
NP-completeness of this problem and present a heuristic
algorithm with a low computational complexity. Through
comprehensive performance comparisons, including the
simulation of large-scale scenarios and small-scale
experiments on a WSN testbed, we demonstrate that
compared with the flooding protocol without DSRF
enhancement, the DSRF effectively reduces the flooding
delay and the total number of packet transmission by
12--25 and 10--15, respectively. Remarkably, the
achieved performance is close to the theoretical lower
bound.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pacifici:2016:CSD,
author = "Valentino Pacifici and Gyorgy Dan",
title = "Coordinated Selfish Distributed Caching for Peering
Content-Centric Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3690--3701",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2541320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A future content-centric Internet would likely consist
of autonomous systems ASes just like today's Internet.
It would thus be a network of interacting cache
networks, each of them optimized for local performance.
To understand the influence of interactions between
autonomous cache networks, in this paper, we consider
ASes that maintain peering agreements with each other
for mutual benefit and engage in content-level peering
to leverage each others' cache contents. We propose a
model of the interaction between the caches managed by
peering ASes. We address whether stable and efficient
content-level peering can be implemented without
explicit coordination between the neighboring ASes. We
show that content-level peering leads to stable cache
configurations, both with and without coordination.
However, peering Internet Service Providers ISPs that
coordinate to avoid simultaneous updates converge to a
stable configuration more efficiently. Furthermore, if
the content popularity estimates are inaccurate,
content-level peering is likely to lead to cost
efficient cache allocations. We validate our analytical
results using simulations on the measured peering
topology of more than 600 ASes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Agra:2016:MCD,
author = "Agostinho Agra and Amaro de Sousa and Mahdi
Doostmohammadi",
title = "The Minimum Cost Design of Transparent Optical
Networks Combining Grooming, Routing, and Wavelength
Assignment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3702--3713",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2544760",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As client demands grow, optical network operators are
required to introduce lightpaths of higher line rates
in order to groom more demand into their network
capacity. For a given fiber network and a given set of
client demands, the minimum cost network design is the
task of assigning routing paths and wavelengths for a
minimum cost set of lightpaths able to groom all client
demands. The variant of the optical network design
problem addressed in this paper considers a transparent
optical network, single hop grooming, client demands of
a single interface type, and lightpaths of two line
rates. We discuss two slightly different mixed integer
linear programming models that define the network
design problem combining grooming, routing, and
wavelength assignment. Then, we propose a parameters
increase rule and three types of additional constraints
that, when applied to the previous models, make their
linear relaxation solutions closer to the integer
solutions. Finally, we use the resulting models to
derive a hybrid heuristic method, which combines a
relax-and-fix approach with an integer linear
programming-based local search approach. We present the
computational results showing that the proposed
heuristic method is able to find solutions with cost
values very close to the optimal ones for a real
nation-wide network and considering a realistic fiber
link capacity of 80 wavelengths. Moreover, when
compared with other approaches used in the problem
variants close to the one addressed here, our heuristic
is shown to compute solutions, on average, with better
cost values and/or in shorter runtimes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chau:2016:OAI,
author = "Chi-Kin Chau and Majid Khonji and Muhammad Aftab",
title = "Online Algorithms for Information Aggregation From
Distributed and Correlated Sources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3714--3725",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2552083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There is a fundamental tradeoff between the
communication cost and the latency in information
aggregation. Aggregating multiple communication
messages over time can alleviate overhead and improve
energy efficiency on one hand, but inevitably incurs
information delay on the other hand. In the presence of
uncertain future inputs, this tradeoff should be
balanced in an online manner, which is studied by the
classical dynamic TCP ACK problem for a single
information source. In this paper, we extend dynamic
TCP ACK problem to a general setting of collecting
aggregate information from distributed and correlated
information sources. In this model, distributed sources
observe correlated events, whereas only a small number
of reports are required from the sources. The sources
make online decisions about their reporting operations
in a distributed manner without prior knowledge of the
local observations at others. Our problem captures a
wide range of applications, such as in-situ sensing,
anycast acknowledgement, and distributed caching. We
present simple threshold-based competitive distributed
online algorithms under different settings of
intercommunication. Our algorithms match the
theoretical lower bounds in order of magnitude. We
observe that our algorithms can produce satisfactory
performance in simulations and practical test bed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Berrocal-Plaza:2016:EWA,
author = "Victor Berrocal-Plaza and Miguel A. Vega-Rodriguez and
Juan M. Sanchez-Perez",
title = "An Efficient Way of Assigning Paging Areas by Using
Mobility Models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3726--3739",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2550488",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper discusses how a mobility model can be used
jointly with a mobile activity trace and evolutionary
computation to reduce the signaling load related to
mobility management, an important and fundamental task
in any public land mobile network. For this purpose, a
mobility model is used to determine the most probable
locations of each mobile subscriber, and this
information, in turn, is used to assign paging areas.
This paging strategy is evaluated by taking into
account different probability thresholds and time-delay
constraints, and in a multiobjective way. Thus, we
study the whole objective space of the problem, ensure
the results that are not dependent on the configuration
of registration areas used in the analysis, and take
into account the signaling traffic of both paging and
location updates in contrast to other published works,
in which only the reduction in the paging load is
considered. The feasibility of this paging scheme is
evaluated by means of a performance analysis, in which
it is compared with other paging schemes widely used in
the recent literature. Results show that this paging
strategy can reduce the blanket paging load by an
average of $ \sim 56.73 $ \%. Furthermore, the
performance analysis also shows that using evolutionary
computation jointly with a paging procedure based on a
mobility model is a very useful strategy for managing
mobility in a public land mobile network, because it
allows the total signaling load obtained by blanket
paging to be reduced by $ \sim 67.03 $ \%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2016:BEN,
author = "Zhenhua Li and Zhiyang Guo and Yuanyuan Yang",
title = "{BCCC}: an Expandable Network for Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3740--3755",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2547438",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designing a cost-effective network topology for data
centers that can deliver sufficient bandwidth and
consistent latency performance to a large number of
servers has been an important and challenging problem.
Many server-centric data center network topologies have
been proposed recently due to their significant
advantage in cost efficiency and data center agility,
such as BCube, FiConn, and Bidimensional Compound
Network BCN. However, existing server-centric
topologies are either not expandable or demanding
prohibitive expansion cost. As the scale of data
centers increases rapidly, the lack of expandability in
existing server-centric data center networks imposes a
severe obstacle for data center upgrade. In this paper,
we present a novel server-centric data center network
topology called BCube connected crossbars BCCCs, which
can provide good network performance using inexpensive
commodity off-the-shelf switches and commodity servers
with only two network interface card NIC ports. A
significant advantage of BCCC is its good
expandability. When there is a need for expansion, we
can easily add new servers and switches into the
existing BCCC with little alteration of the existing
structure. Meanwhile, BCCC can accommodate a large
number of servers while keeping a very small network
diameter. A desirable property of BCCC is that its
diameter increases only linearly to the network order
i.e., the number of dimensions, which is superior to
most of the existing server-centric networks, such as
FiConn and BCN, whose diameters increase exponentially
with network order. In addition, there are a rich set
of parallel paths with similar length between any pair
of servers in BCCC, which enables BCCC to not only
deliver sufficient bandwidth capacity and predictable
latency to end hosts, but also provide graceful
performance degradation in case of component failure.
We conduct comprehensive comparisons between BCCC with
other popular server-centric network topologies, such
as FiConn and BCN. We also propose an effective
addressing scheme and routing algorithms for BCCC. We
show that BCCC has significant advantages over the
existing server-centric topologies in many important
metrics, such as expandability, server port
utilization, and network diameter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiasserini:2016:SNA,
author = "Carla-Fabiana Chiasserini and Michele Garetto and
Emilio Leonardi",
title = "Social Network {De}-Anonymization Under Scale-Free
User Relations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3756--3769",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2553843",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We tackle the problem of user de-anonymization in
social networks characterized by scale-free
relationships between users. The network is modeled as
a graph capturing the impact of power-law node degree
distribution, which is a fundamental and quite common
feature of social networks. Using this model, we
present a de-anonymization algorithm that exploits an
initial set of users, called seeds, that are known $
{\textit {a priori}} $. By employing the bootstrap
percolation theory and a novel graph slicing technique,
we develop a rigorous analysis of the proposed
algorithm under asymptotic conditions. Our analysis
shows that large inhomogeneities in the node degree
lead to a dramatic reduction in the size of the seed
set that is necessary to successfully identify all the
other users. We characterize this set size when seeds
are properly selected based on the node degree as well
as when seeds are uniformly distributed. We prove that,
given $n$ nodes, the number of seeds required for
network de-anonymization can be as small as $
n^\epsilon $, for any small $ \epsilon > 0$. In
addition, we discuss the complexity of our
de-anonymization algorithm and validate our results
through numerical experiments on a real social network
graph.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shahzad:2016:FRD,
author = "Muhammad Shahzad and Alex X. Liu",
title = "Fast and Reliable Detection and Identification of
Missing {RFID} Tags in the Wild",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3770--3784",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2559539",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio-frequency identification RFID systems have been
deployed to detect and identify missing products by
affixing them with cheap passive RFID tags and
monitoring them with RFID readers. Existing missing tag
detection and identification protocols require the tag
population to contain only those tags whose IDs are
already known to the reader. However, in reality, tag
populations often contain tags with unknown IDs, called
unexpected tags. These unexpected tags cause unexpected
false positives, i.e., due to them, missing tags are
detected as present. We take the first step toward
addressing the problem of detecting and identifying
missing tags from a population that contains unexpected
tags. Our protocol, RUN, uses standardized frame
slotted Aloha for communication between tags and
readers. It executes multiple frames with different
seeds to reduce the effects of unexpected false
positives. At the same time, it minimizes the missing
tag detection and identification time by first
estimating the number of unexpected tags in the
population and then using it along with the
false-positive probability to obtain optimal frame
sizes and minimum number of times Aloha frames should
be executed to mitigate the effects of false positives.
RUN works with multiple readers with overlapping
regions. It is easy to deploy, because it is
implemented on readers as a software module and does
not require any modifications to tags or to the
communication protocol between the tags and the
readers. We implemented RUN along with four major
missing tag detection and identification protocols,
namely, TRP, IIP, MTI, and SFMTI, and the fastest tag
ID collection protocol TH and compared them side by
side. Our performance evaluation results show that RUN
is the only protocol that achieves required reliability
in the presence of unexpected tags, whereas the best
existing protocol achieves a maximum reliability of
only 67\%. RUN identifies 100\% of missing tags in the
presence of unexpected tags, whereas the best existing
protocol identifies a maximum of only 60\% of missing
tags.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lim:2016:PME,
author = "Wan-Seon Lim and Kang G. Shin",
title = "{POEM}: Minimizing Energy Consumption for {WiFi}
Tethering Service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3785--3797",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2556689",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Despite the rapidly increasing number of public WiFi
hotspots, their coverage is still limited to indoor and
office/business environments. WiFi tethering is thus a
useful and economic means of providing on-the-go mobile
users' Internet connection. One of the main problems of
WiFi tethering is the excessive power consumption of
mobile access points APs, or tethered smartphones.
Since the power-saving mechanism, defined and deployed
in the IEEE 802.11 standard, is intended for clients
only, the WiFi interface of a mobile AP never enters
the sleep mode. In this paper, we propose a simple but
effective system, called power-efficient mobile POEM,
which reduces energy consumption of a mobile AP by
allowing its WiFi interface to sleep even during data
transfer. The POEM exploits the inherent bandwidth
asymmetry between the WiFi and the WWAN interfaces of a
mobile AP by buffering the data packets received via
the WWAN interface at the mobile AP, thereby allowing
the WiFi interface to enter the sleep mode. Compared
with the other power-saving solutions for WiFi
tethering, the POEM is able to handle various types of
applications, such as video steaming and file download,
designed to support legacy clients i.e., clients
without POEM, and is also efficient in reducing the
clients' energy consumption. We have implemented and
conducted an extensive evaluation of the POEM's
effectiveness in an Android/Linux-based test bed. Our
experimental results show that the POEM can allow the
WiFi interface of a mobile AP to sleep for up to 90\%
of the total transfer time without significantly
affecting system throughput or 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",
}
@Article{Ok:2016:MDS,
author = "Jungseul Ok and Youngmi Jin and Jinwoo Shin and Yung
Yi",
title = "On Maximizing Diffusion Speed Over Social Networks
With Strategic Users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3798--3811",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2556719",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A variety of models have been proposed and analyzed to
understand how a new innovation e.g., a technology, a
product, or even a behavior diffuses over a social
network, broadly classified into either of
epidemic-based or game-based ones. In this paper, we
consider a game-based model, where each individual
makes a selfish, rational choice in terms of its payoff
in adopting the new innovation, but with some noise. We
address the following two questions on the diffusion
speed of a new innovation under the game-based model: 1
what is a good subset of individuals to seed for
reducing the diffusion time significantly, i.e.,
convincing them to preadopt a new innovation and 2 how
much diffusion time can be reduced by such a good
seeding. For 1, we design near-optimal polynomial-time
seeding algorithms for three representative classes of
social network models, Erd{\H{o}}s-R{\'e}nyi, planted
partition and geometrically structured graphs, and
provide their performance guarantees in terms of
approximation and complexity. For 2, we asymptotically
quantify the diffusion time for these graph topologies;
further derive the seed budget threshold above which
the diffusion time is dramatically reduced, i.e., phase
transition of diffusion time. Furthermore, based on our
theoretical findings, we propose a practical seeding
algorithm, called Practical Partitioning and Seeding
PrPaS and demonstrate that PrPaS outperforms other
baseline algorithms in terms of the diffusion speed
over a real social network topology. We believe that
our results provide new insights on how to seed over a
social network depending on its connectivity structure,
where individuals rationally adopt a new innovation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Larrnaaga:2016:DCB,
author = "Maialen Larrnaaga and Urtzi Ayesta and Ina Maria
Verloop",
title = "Dynamic Control of Birth-and-Death Restless Bandits:
Application to Resource-Allocation Problems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3812--3825",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2562564",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop a unifying framework to obtain efficient
index policies for restless multi-armed bandit problems
with birth-and-death state evolution. This is a broad
class of stochastic resource allocation problems whose
objective is to determine efficient policies to share
resources among competing projects. In a seminal work,
Whittle developed a methodology to derive
well-performing Whittle's index policies that are
obtained by solving a relaxed version of the original
problem. Our first main contribution is the derivation
of a closed-form expression for Whittle's index as a
function of the steady-state probabilities. In some
particular cases, qualitative insights can be obtained
from its expression; nevertheless, it requires several
technical conditions to be verified. We, therefore,
formulate a fluid version of the relaxed optimization
problem, and in our second main contribution, we
develop a fluid index policy. The latter does provide
qualitative insights and it is equivalent to Whittle's
index policy in the light-traffic regime. The
applicability of our approach is illustrated by two
important problems: optimal class selection and optimal
load balancing. Allowing state-dependent capacities, we
can model important phenomena, e.g., power-aware
server-farms and opportunistic scheduling in wireless
systems. Whittle's index and our fluid index policy
show remarkably good performance in numerical
simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gupta:2016:LWF,
author = "Varun Gupta and Yigal Bejerano and Craig Gutterman and
Jaime Ferragut and Katherine Guo and Thyaga Nandagopal
and Gil Zussman",
title = "Light-Weight Feedback Mechanism for {WiFi} Multicast
to Very Large Groups --- Experimental Evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3826--3840",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2560806",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "WiFi networks have been globally deployed and most
mobile devices are currently WiFi-enabled. While WiFi
has been proposed for multimedia content distribution,
its lack of adequate support for multicast services
hinders its ability to provide multimedia content
distribution to a large number of devices. In this
paper, we present the AMuSe system, whose objective is
to enable scalable and adaptive WiFi multicast
services. AMuSe is based on accurate receiver feedback
and incurs a small control overhead. In particular, we
develop an algorithm for dynamic selection of a subset
of the multicast receivers as feedback nodes, which
periodically send information about the channel quality
to the multicast sender. This feedback information can
be used by the multicast sender to optimize multicast
service quality, e.g., by dynamically adjusting
transmission bitrate. AMuSe does not require any
changes to the standards or any modifications to the
WiFi devices. We implemented AMuSe on the ORBIT testbed
and evaluated its performance in large groups with
approximately 200 WiFi devices, both with and without
interference sources. Our extensive experiments
demonstrate that AMuSe can provide accurate feedback in
a dense multicast environment. It outperforms several
alternatives even in the case of external interference
and changing network conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2016:TTO,
author = "Li Yan and Haiying Shen and Kang Chen",
title = "{TSearch}: Target-Oriented Low-Delay Node Searching in
{DTNs} With Social Network Properties",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3841--3855",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2586446",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Node searching in delay tolerant networks is of great
importance for different applications, in which a
locator node finds a target node in person. In the
previous distributed node searching method, a locator
traces the target along its movement path from its most
frequently visited location. For this purpose, nodes
leave traces during their movements and also store
their long-term movement patterns in their frequently
visited locations i.e., preferred locations. However,
such tracing leads to a long delay and high overhead on
the locator by long-distance moving. Our trace data
study confirms these problems and provides the
foundation of our design of a new node searching
method, called target-oriented method TSearch. By
leveraging social network properties, TSearch aims to
enable a locator to directly move toward the target.
Nodes create encounter records ERs indicating the
locations and times of their encounters and make the
ERs easily accessible by locators through message
exchanges or a hierarchical structure. In node
searching, a locator follows the target's latest ER,
the latest ERs of its friends i.e., frequently meeting
nodes, its preferred locations, and the target's
possible locations deduced from additional information
for node searching. Extensive trace-driven and
real-world experiments show that TSearch achieves
significantly higher success rate and lower delay in
node searching compared with previous methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2016:BAC,
author = "Tiantian Zhu and Hongyu Gao and Yi Yang and Kai Bu and
Yan Chen and Doug Downey and Kathy Lee and Alok N.
Choudhary",
title = "Beating the Artificial Chaos: Fighting {OSN} Spam
Using Its Own Templates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3856--3869",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2557849",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Online social networks OSNs are extremely popular
among Internet users. However, spam originating from
friends and acquaintances not only reduces the joy of
Internet surfing but also causes damage to less
security-savvy users. Prior countermeasures combat OSN
spam from different angles. Due to the diversity of
spam, there is hardly any existing method that can
independently detect the majority or most of OSN spam.
In this paper, we empirically analyze the textual
pattern of a large collection of OSN spam. An inspiring
finding is that the majority e.g., 76.4\% in 2015 of
the collected spam is generated with underlying
templates. Based on the analysis, we propose tangram,
an OSN spam filtering system that performs online
inspection on the stream of user-generated messages.
Tangram extracts the templates of spam detected by
existing methods and then matching messages against the
templates toward the accurate and the fast spam
detection. It automatically divides the OSN spam into
segments and uses the segments to construct templates
to filter future spam. Experimental results on Twitter
and Facebook data sets show that tangram is highly
accurate and can rapidly generate templates to throttle
newly emerged campaigns. Furthermore, we analyze the
behavior of detected OSN spammers. We find a series of
spammer properties --- such as spamming accounts are
created in bursts and a single active organization
orchestrates more spam than all other spammers combined
--- that promise more comprehensive spam
countermeasures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:ISR,
author = "Jian Li and Rajarshi Bhattacharyya and Suman Paul and
Srinivas Shakkottai and Vijay Subramanian",
title = "Incentivizing Sharing in Realtime {D2D} Streaming
Networks: a Mean Field Game Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "3--17",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2562028",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of streaming live content to a
cluster of co-located wireless devices that have both
an expensive unicast base-station-to-device B2D
interface, as well as an inexpensive broadcast
device-to-device D2D interface, which can be used
simultaneously. Our setting is a streaming system that
uses a block-by-block random linear coding approach to
achieve a target percentage of on-time deliveries with
minimal B2D usage. Our goal is to design an incentive
framework that would promote such cooperation across
devices, while ensuring good quality of service. Based
on the ideas drawn from truth-telling auctions, we
design a mechanism that achieves this goal via
appropriate transfers monetary payments or rebates in a
setting with a large number of devices, and with peer
arrivals and departures. Here, we show that a mean
field game can be used to accurately approximate our
system. Furthermore, the complexity of calculating the
best responses under this regime is low. We implement
the proposed system on an Android testbed, and
illustrate its efficient performance using real world
experiments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:NCF,
author = "Wei Wang and Bei Liu and Donghyun Kim and Deying Li
and Jingyi Wang and Wei Gao",
title = "A New Constant Factor Approximation to Construct
Highly Fault-Tolerant Connected Dominating Set in Unit
Disk Graph",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "18--28",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2561901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a new polynomial time constant
factor approximation algorithm for a more-a-decade-long
open NP-hard problem, the minimum four-connected $m$
-dominating set problem in unit disk graph UDG with any
positive integer $ m \geq 1$ for the first time in the
literature. We observe that it is difficult to modify
the existing constant factor approximation algorithm
for the minimum three-connected $m$ -dominating set
problem to solve the minimum four-connected $m$
-dominating set problem in UDG due to the structural
limitation of Tutte decomposition, which is the main
graph theory tool used by Wang et al. to design their
algorithm. To resolve this issue, we first reinvent a
new constant factor approximation algorithm for the
minimum three-connected $m$ -dominating set problem in
UDG and later use this algorithm to design a new
constant factor approximation algorithm for the minimum
four-connected $m$ -dominating set problem in UDG.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2017:VIM,
author = "Longbo Huang",
title = "The Value-of-Information in Matching With Queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "29--42",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2564700",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of optimal matching with
queues in dynamic systems and investigate the
value-of-information. In such systems, operators match
tasks and resources stored in queues, with the
objective of maximizing the system utility of the
matching reward profile, minus the average matching
cost. This problem appears in many practical systems
and the main challenges are the no-underflow
constraints, and the lack of matching-reward
information and system dynamics statistics. We develop
two online matching algorithms: Learning-aided Reward
optimAl Matching {LRAM} and Dual-{LRAM} {DRAM} to
effectively resolve both challenges. Both algorithms
are equipped with a learning module for estimating the
matching-reward information, while DRAM incorporates an
additional module for learning the system dynamics. We
show that both algorithms achieve an $ O(\epsilon +
\delta_r) $ close-to-optimal utility performance for
any $ \epsilon > 0 $, while DRAM achieves a faster
convergence speed and a better delay compared with
LRAM, i.e., $ O(\delta_\pi / \epsilon + \log 1 /
\epsilon^2) $ delay and $ O(\delta_\pi / \epsilon) $
convergence under DRAM compared with $ O(1 / \epsilon)
$ delay and convergence under $ \mathtt {LRAM} $ $
\delta_r $ and $ \delta_\pi $ are maximum estimation
errors for reward and system dynamics. Our results show
that the information of different system components can
play very different roles in algorithm performance and
provide a novel way for designing the joint
learning-control algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2017:ENA,
author = "Zhuo Lu and Cliff Wang",
title = "Enabling Network Anti-Inference via Proactive
Strategies: a Fundamental Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "43--55",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2553666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network inference is an effective mechanism to infer
end-to-end flow rates and has enabled a variety of
applications e.g., network surveillance and diagnosis.
This paper is focused on the opposite side of network
inference, i.e., how to make inference inaccurate,
which we call network anti-inference. As most research
efforts have been focused on developing efficient
inference methods, a design of anti-inference is
largely overlooked. Anti-inference scenarios can rise
when network inference is not desirable, such as in
clandestine communication and military applications.
Our objective is to explore network dynamics to provide
anti-inference. In particular, we consider two
proactive strategies that cause network dynamics:
transmitting deception traffic and changing routing to
mislead the inference. We build an analytical framework
to quantify the induced inference errors of the
proactive strategies that maintain limited costs. We
find by analysis and simulations that for deception
traffic, a simple random transmission strategy can
achieve inference errors on the same order of the best
coordinated transmission strategy, while changing
routing can cause the inference errors of higher order
than any deception traffic strategy. Our results not
only reveal the fundamental perspective on proactive
strategies, but also offer the guidance into the
practical design of anti-inference.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kornycky:2017:RFT,
author = "Joe Kornycky and Omar Abdul-Hameed and Ahmet Kondoz
and Brian C. Barber",
title = "Radio Frequency Traffic Classification Over {WLAN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "56--68",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2562259",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network traffic classification is the process of
analyzing traffic flows and associating them to
different categories of network applications. Network
traffic classification represents an essential task in
the whole chain of network security. Some of the most
important and widely spread applications of traffic
classification are the ability to classify encrypted
traffic, the identification of malicious traffic flows,
and the enforcement of security policies on the use of
different applications. Passively monitoring a network
utilizing low-cost and low-complexity wireless local
area network WLAN devices is desirable. Mobile devices
can be used or existing office desktops can be
temporarily utilized when their computational load is
low. This reduces the burden on existing network
hardware. The aim of this paper is to investigate
traffic classification techniques for wireless
communications. To aid with intrusion detection, the
key goal is to passively monitor and classify different
traffic types over WLAN to ensure that network security
policies are adhered to. The classification of
encrypted WLAN data poses some unique challenges not
normally encountered in wired traffic. WLAN traffic is
analyzed for features that are then used as an input to
six different machine learning ML algorithms for
traffic classification. One of these algorithms a
Gaussian mixture model incorporating a universal
background model has not been applied to wired or
wireless network classification before. The authors
also propose a ML algorithm that makes use of the
well-known vector quantization algorithm in conjunction
with a decision tree --- referred to as a TRee Adaptive
Parallel Vector Quantiser. This algorithm has a number
of advantages over the other ML algorithms tested and
is suited to wireless traffic classification. An
average F-score harmonic mean of precision and recall $
> 0.84 $ was achieved when training and testing on the
same day across six distinct traffic types.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:RH,
author = "Zhenjiang Li and Wan Du and Yuanqing Zheng and Mo Li
and Dapeng Wu",
title = "From Rateless to Hopless",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "69--82",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2561304",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a hopless networking paradigm.
Incorporating recent techniques of rateless codes,
senders break packets into rateless information streams
and each single stream automatically adapts to diverse
channel qualities at all potential receivers,
regardless of their hop distances. The receivers are
capable of accumulating rateless information pieces
from different senders and jointly decoding the packet,
largely improving throughput. We develop a practical
protocol, called HOPE, which instantiates the hopless
networking paradigm. Compared with the existing
opportunistic routing protocol family, HOPE best
exploits the wireless channel diversity and takes full
advantage of the wireless broadcast effect. HOPE incurs
minimum protocol overhead and serves general networking
applications. We extensively evaluate the performance
of HOPE with indoor network traces collected from USRP
N210s and Intel 5300 NICs. The results show that HOPE
achieves $ 1.7 \times $ and $ 1.3 \times $ goodput gain
over EXOR and MIXIT, respectively. We further implement
HOPE on a sensor network testbed, achieving the goodput
gains over CTP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Naday:2017:ICM,
author = "Mays F. Al-Naday and Nikolaos Thomos and Martin J.
Reed",
title = "Information-Centric Multilayer Networking: Improving
Performance Through an {ICN\slash WDM} Architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "83--97",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2571659",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information-centric networking ICN facilitates content
identification in networks and offers parametric
representation of content semantics. This paper
proposes an ICN/WDM network architecture that uses
these features to offer superior network utilization,
in terms of performance and power consumption. The
architecture introduces an ICN publish/subscribe
communication approach to the wavelength layer, whereby
content is aggregated according to its popularity rank
into wavelength-size groups that can be published and
subscribed to by multiple nodes. Consequently, routing
and wavelength assignment RWA algorithms benefit from
anycast to identify multiple sources of aggregate
content and allow optimization of the source selection
of light paths. A power-aware algorithm, maximum degree
of connectivity, has been developed with the objective
of exploiting this flexibility to address the tradeoff
between power consumption and network performance. The
algorithm is also applicable to IP architectures,
albeit with less flexibility. Evaluation results
indicate the superiority of the proposed ICN
architecture, even when utilizing conventional routing
methods, compared with its IP counterpart. The results
further highlight the performance improvement achieved
by the proposed algorithm, compared with the
conventional RWA methods, such as shortest-path first
fit.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pananjady:2017:OAC,
author = "Ashwin Pananjady and Vivek Kumar Bagaria and Rahul
Vaze",
title = "Optimally Approximating the Coverage Lifetime of
Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "98--111",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2574563",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address a classical problem concerning energy
efficiency in sensor networks. In particular, we
consider the problem of maximizing the lifetime of
coverage of targets in a wireless sensor network with
battery-limited sensors. We first show that the problem
cannot be approximated within a factor less than $ \ln
n $ by any polynomial time algorithm, where $n$ is the
number of targets. This provides closure to the
long-standing open problem of showing optimality of
previously known $ \ln n$ approximation algorithms. We
also derive a new $ \ln n$ approximation to the problem
by showing the $ \ln n$ approximation to the related
maximum disjoint set cover problem. We show that this
approach has many advantages over algorithms in the
literature, including a simple and optimal extension
that solves the problem with multiple coverage
constraints. For the 1-D network topology, where
sensors can monitor contiguous line segments of
possibly different lengths, we show that the optimal
coverage lifetime can be found in polynomial time.
Finally, for the 2-D topology in which coverage regions
are unit squares, we combine the existing results to
derive a $ 1 + \epsilon $ approximation algorithm for
the problem. Extensive simulation experiments validate
our theoretical results, showing that our algorithms
not only have optimal worst case guarantees but also
match the performance of the existing algorithms on
special network topologies. In addition, our algorithms
sometimes run orders of magnitude faster than the
existing 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{Tong:2017:AIM,
author = "Guangmo Tong and Weili Wu and Shaojie Tang and
Ding-Zhu Du",
title = "Adaptive Influence Maximization in Dynamic Social
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "112--125",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2563397",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For the purpose of propagating information and ideas
through a social network, a seeding strategy aims to
find a small set of seed users that are able to
maximize the spread of the influence, which is termed
influence maximization problem. Despite a large number
of works have studied this problem, the existing
seeding strategies are limited to the models that
cannot fully capture the characteristics of real-world
social networks. In fact, due to high-speed data
transmission and large population of participants, the
diffusion processes in real-world social networks have
many aspects of uncertainness. As shown in the
experiments, when taking such uncertainness into
account, the state-of-the-art seeding strategies are
pessimistic as they fail to trace the influence
diffusion. In this paper, we study the strategies that
select seed users in an adaptive manner. We first
formally model the dynamic independent Cascade model
and introduce the concept of adaptive seeding strategy.
Then, based on the proposed model, we show that a
simple greedy adaptive seeding strategy finds an
effective solution with a provable performance
guarantee. Besides the greedy algorithm, an efficient
heuristic algorithm is provided for better scalability.
Extensive experiments have been performed on both the
real-world networks and synthetic power-law networks.
The results herein demonstrate the superiority of the
adaptive seeding strategies to other baseline
methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rad:2017:DNT,
author = "Neshat Etemadi Rad and Yariv Ephraim and Brian L.
Mark",
title = "Delay Network Tomography Using a Partially Observable
Bivariate {Markov} Chain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "126--138",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2583463",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Estimation of link delay densities in a computer
network, from source-destination delay measurements, is
of great importance in analyzing and improving the
operation of the network. In this paper, we develop a
general approach for estimating the density of the
delay in any link of the network, based on
continuous-time bivariate Markov chain modeling. The
proposed approach also provides the estimates of the
packet routing probability at each node, and the
probability of each source-destination path in the
network. In this approach, the states of one process of
the bivariate Markov chain are associated with nodes of
the network, while the other process serves as an
underlying process that affects statistical properties
of the node process. The node process is not Markov,
and the sojourn time in each of its states is
phase-type. Phase-type densities are dense in the set
of densities with non-negative support. Hence, they can
be used to approximate arbitrarily well any sojourn
time distribution. Furthermore, the class of phase-type
densities is closed under convolution and mixture
operations. We adopt the expectation-maximization EM
algorithm of Asmussen, Nerman, and Olsson for
estimating the parameter of the bivariate Markov chain.
We demonstrate the performance of the approach in a
numerical study.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yallouz:2017:TQA,
author = "Jose Yallouz and Ariel Orda",
title = "Tunable {QoS}-Aware Network Survivability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "139--149",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2606342",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Coping with network failures has been recognized as an
issue of major importance in terms of social security,
stability, and prosperity. It has become clear that
current networking standards fall short of coping with
the complex challenge of surviving failures. The need
to address this challenge has become a focal point of
networking research. In particular, the concept of
tunable survivability offers major performance
improvements over traditional approaches. Indeed, while
the traditional approach aims at providing full 100\%
protection against network failures through disjoint
paths, it was realized that this requirement is too
restrictive in practice. Tunable survivability provides
a quantitative measure for specifying the desired level
0\%--100\% of survivability and offers flexibility in
the choice of the routing paths. Previous work focused
on the simpler class of ``bottleneck'' criteria, such
as bandwidth. In this paper, we focus on the important
and much more complex class of additive criteria, such
as delay and cost. First, we establish some in part,
counter-intuitive properties of the optimal solution.
Then, we establish efficient algorithmic schemes for
optimizing the level of survivability under additive
end-to-end quality of service QoS bounds. Subsequently,
through extensive simulations, we show that, at the
price of negligible reduction in the level of
survivability, a major improvement up to a factor of 2
is obtained in terms of end-to-end QoS performance.
Finally, we exploit the above findings in the context
of a network design problem, in which, for a given
investment budget, we aim to improve the survivability
of the network links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sobrinho:2017:CRV,
author = "Joao Luis Sobrinho",
title = "Correctness of Routing Vector Protocols as a Property
of Network Cycles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "150--163",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2567600",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most analyses of routing vector protocols, such as the
Border Gateway Protocol BGP, are conducted in the
context of a single destination in a given network. In
that context, for arbitrary routing policies, it is
computationally intractable to determine whether or not
a routing vector protocol behaves correctly. In this
paper, we consider the common scenario where routing
policies are specified independently of the
destination. In this scenario, we demonstrate that the
correctness of a routing vector protocol for all
destinations in a given network equates to a property
of routing policies around its cycles, designated
strict absorbency, similarly to the way that the
correctness of a distance vector protocol equates to
cycles of positive length. A number of pragmatic
conclusions can be derived from this theoretical
result. For example, we show that all next-hop routing
policies, which are popular in inter-domain routing and
in the interconnection of routing instances, cannot
fully exploit the physical redundancy of a network. As
another example, we show how sibling autonomous systems
of the Internet can share all routes between them
without introducing oscillations into BGP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Moharir:2017:SDN,
author = "Sharayu Moharir and Subhashini Krishnasamy and Sanjay
Shakkottai",
title = "Scheduling in Densified Networks: Algorithms and
Performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "164--178",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2580614",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With increasing data demand, wireless networks are
evolving to a hierarchical architecture where coverage
is provided by both wide-area base stations BS and
dense deployments of short-range access nodes ANs e.g.,
small cells. The dense scale and mobility of users
provide new challenges for scheduling: 1 high flux in
mobile-to-AN associations, where mobile nodes quickly
change associations with ANs time scale of seconds due
to their small footprint and 2 multi-point
connectivity, where mobile nodes are simultaneously
connected to several ANs at any time. We study such a
densified scenario with multi-channel wireless links
e.g., multi-channel OFDM between nodes BS/AN/mobile. We
first show that traditional algorithms that forward
each packet at most once, either to a single AN or a
mobile user, do not have good delay performance. We
argue that the fast association dynamics between ANs
and mobile users necessitate a multi-point relaying
strategy, where multiple ANs have duplicate copies of
the data, and coordinate to deliver data to the mobile
user. Surprisingly, despite data replication and no
coordination between ANs, we show that our algorithm a
distributed scheduler --- DIST can approximately
stabilize the system in large-scale instantiations of
this setting, and further, performs well from a
queue-length/delay perspective shown via large
deviation bounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:HMC,
author = "An Liu and Vincent K. N. Lau",
title = "How Much Cache is Needed to Achieve Linear Capacity
Scaling in Backhaul-Limited Dense Wireless Networks?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "179--188",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2569420",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Dense wireless networks are a promising solution to
meet the huge capacity demand in 5G wireless systems.
However, there are two implementation issues, namely,
the interference and backhaul issues. To resolve these
issues, we propose a novel network architecture called
the backhaul-limited cached dense wireless network
C-DWN, where a physical layer PHY caching scheme is
employed at the base stations BSs, but only a fraction
of the BSs have wired payload backhauls. The PHY
caching can replace the role of wired backhauls to
achieve both the cache-induced
multiple-input--multiple-output MIMO cooperation gain
and cache-assisted multihopping gain. Two fundamental
questions are addressed. Can we exploit the PHY caching
to achieve linear capacity scaling with limited payload
backhauls? If so, how much cache is needed? We show
that the capacity of the backhaul-limited C-DWN indeed
scales linearly with the number of BSs if the BS cache
size is larger than a threshold that depends on the
content popularity. We also quantify the throughput
gain due to cache-induced MIMO cooperation over
conventional caching schemes which exploit purely the
cached-assisted multihopping. Interestingly, the
minimum BS cache size needed to achieve a significant
cache-induced MIMO cooperation gain is the same as that
needed to achieve the linear capacity scaling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hari:2017:POP,
author = "Adiseshu Hari and Urs Niesen and Gordon Wilfong",
title = "On the Problem of Optimal Path Encoding for
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "189--198",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2571300",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet networks need to maintain the state in the form
of forwarding tables at each switch. The cost of this
state increases as networks support ever more
sophisticated per-flow routing, traffic engineering,
and service chaining. Per-flow or per-path state at the
switches can be eliminated by encoding each packet's
desired path in its header. A key component of such a
method is an efficient encoding of paths through the
network. We introduce a mathematical formulation of
this optimal path-encoding problem. We prove that the
problem is APX-hard, by showing that approximating it
to within a factor less than $ 8 / 7 $ is NP-hard.
Thus, at best, we can hope for a constant-factor
approximation algorithm. We then present such an
algorithm, approximating the optimal path-encoding
problem to within a factor 2. Finally, we provide the
empirical results illustrating the effectiveness 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",
}
@Article{Cao:2017:OTO,
author = "Zizhong Cao and Paul Claisse and Rene-Jean Essiambre
and Murali Kodialam and T. V. Lakshman",
title = "Optimizing Throughput in Optical Networks: The Joint
Routing and Power Control Problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "199--209",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2578321",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is well established that physical layer impairments
significantly affect the performance of optical
networks. The management of these impairments is
critical for successful transmission, and may
significantly affect network layer routing decisions.
Hence, the traditional divide-and-conquer layered
approach is sub-optimal, which has led to work on
cross-layer techniques for routing in optical networks.
Apart from fiber loss, one critical physical layer
impairment that limits the capacity of optical networks
is fiber nonlinearity. Handling nonlinearity introduces
significant complexity to the traditional cross-layer
approaches. We formulate and solve a joint routing and
power control problem to optimize the system throughput
that takes into consideration both fiber loss and
nonlinearity. The joint power control and routing
problem considered is a nonlinear integer programming
problem. By characterizing the feasible solution space
of the power control problem, we find a set of
universal power settings that transform the complex
power control and routing problem into a constrained
path routing problem. We then propose an efficient
fully polynomial time approximation scheme to solve the
constrained path routing problem. Simulation results
show that our proposed algorithm significantly improves
network throughput and greatly outperforms greedy
heuristics by providing a guaranteed performance
bound.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2017:OMA,
author = "Wei Dong and Yi Gao and Wenbin Wu and Jiajun Bu and
Chun Chen and Xiang-Yang Li",
title = "Optimal Monitor Assignment for Preferential Link
Tomography in Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "210--223",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2581176",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inferring fine-grained link metrics by using
aggregated path measurements, known as network
tomography, is an effective and efficient way to
facilitate various network operations, such as network
monitoring, load balancing, and failure diagnosis.
Given the network topology and a set of interesting
links, we study the problem of calculating the link
metrics of these links by end-to-end cycle-free path
measurements among selected monitors, i.e.,
preferential link tomography. Since assigning nodes as
monitors usually requires non-negligible operational
cost, we focus on assigning a minimum number of
monitors to identify these interesting links. We
propose an optimal monitor assignment OMA algorithm for
preferential link tomography in communication networks.
OMA first partitions the graph representing the network
topology into multiple graph components. Then, OMA
carefully assigns monitors inside each graph component
and at the boundaries of multiple graph components. We
theoretically prove the optimality of OMA by proving: 1
the monitors assigned by OMA are able to identify all
interesting links and 2 the number of monitors assigned
by OMA is minimal. We also implement OMA and evaluate
it through extensive simulations based on both real
topologies and synthetic topologies. Compared with two
baseline approaches, OMA reduces the number of monitors
assigned significantly in various network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:REB,
author = "Xiulong Liu and Bin Xiao and Keqiu Li and Alex X. Liu
and Jie Wu and Xin Xie and Heng Qi",
title = "{RFID} Estimation With Blocker Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "224--237",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2595571",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing popularization of radio frequency
identification RFID technology in the retail and
logistics industry, RFID privacy concern has attracted
much attention, because a tag responds to queries from
readers no matter they are authorized or not. An
effective solution is to use a commercially available
blocker tag that behaves as if a set of tags with known
blocking IDs are present. However, the use of blocker
tags makes the classical RFID estimation problem much
more challenging, as some genuine tag IDs are covered
by the blocker tag and some are not. In this paper, we
propose RFID estimation scheme with blocker tags REB,
the first RFID estimation scheme with the presence of
blocker tags. REB uses the framed slotted Aloha
protocol specified in the EPC C1G2 standard. For each
round of the Aloha protocol, REB first executes the
protocol on the genuine tags and the blocker tag, and
then virtually executes the protocol on the known
blocking IDs using the same Aloha protocol parameters.
REB conducts statistical inference from the two sets of
responses and estimates the number of genuine tags.
Rigorous theoretical analysis of parameter settings is
proposed to guarantee the required estimation accuracy,
meanwhile minimizing the time cost and energy cost of
REB. We also reveal a fundamental tradeoff between the
time cost and energy cost of REB, which can be flexibly
adjusted by the users according to the practical
requirements. Extensive experimental results reveal
that REB significantly outperforms the state-of-the-art
identification protocols in terms of both time
efficiency and energy efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hao:2017:OAV,
author = "Fang Hao and Murali Kodialam and T. V. Lakshman and
Sarit Mukherjee",
title = "Online Allocation of Virtual Machines in a Distributed
Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "238--249",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2575779",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the primary functions of a cloud service
provider is to allocate cloud resources to users upon
request. Requests arrive in real-time and resource
placement decisions must be made as and when a request
arrives, without any prior knowledge of future
arrivals. In addition, when a cloud service provider
operates a geographically diversified cloud that
consists of a large number of small data centers, the
resource allocation problem becomes even more complex.
This is due to the fact that resource request can have
additional constraints on data center location, service
delay guarantee, and so on, which is especially true
for the emerging network function virtualization
application. In this paper, we propose a generalized
resource placement methodology that can work across
different cloud architectures, resource request
constraints, with real-time request arrivals and
departures. The proposed algorithms are online in the
sense that allocations are made without any knowledge
of resource requests that arrive in the future, and the
current resource allocations are made in such a manner
as to permit the acceptance of as many future arrivals
as possible. We derive worst case competitive ratio for
the algorithms. We show through experiments and case
studies the superior performance of the algorithms in
practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vlachou:2017:HCC,
author = "Christina Vlachou and Albert Banchs and Julien Herzen
and Patrick Thiran",
title = "How {CSMA\slash CA} With Deferral Affects Performance
and Dynamics in Power-Line Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "250--263",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2580642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Power-line communications PLC are becoming a key
component in home networking, because they provide easy
and high-throughput connectivity. The dominant MAC
protocol for high data-rate PLC, the IEEE 1901, employs
a CSMA/CA mechanism similar to the backoff process of
802.11. Existing performance evaluation studies of this
protocol assume that the backoff processes of the
stations are independent the so-called decoupling
assumption. However, in contrast to 802.11, 1901
stations can change their state after sensing the
medium busy, which is regulated by the so-called
deferral counter. This mechanism introduces strong
coupling between the stations and, as a result, makes
existing analyses inaccurate. In this paper, we propose
a performance model for 1901, which does not rely on
the decoupling assumption. We prove that our model
admits a unique solution for a wide range of
configurations and confirm the accuracy of the model
using simulations. Our results show that we outperform
current models based on the decoupling assumption. In
addition to evaluating the performance in steady state,
we further study the transient dynamics of 1901, which
is also affected by the deferral counter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:MCR,
author = "Xiulong Liu and Keqiu Li and Alex X. Liu and Song Guo
and Muhammad Shahzad and Ann L. Wang and Jie Wu",
title = "Multi-Category {RFID} Estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "264--277",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2594481",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper concerns the practically important problem
of multi-category radio frequency identification RFID
estimation: given a set of RFID tags, we want to
quickly and accurately estimate the number of tags in
each category. However, almost all the existing RFID
estimation protocols are dedicated to the estimation
problem on a single set, regardless of tag categories.
A feasible solution is to separately execute the
existing estimation protocols on each category. The
execution time of such a serial solution is
proportional to the number of categories, and cannot
satisfy the delay-stringent application scenarios.
Simultaneous RIFD estimation over multiple categories
is desirable, and hence, this paper proposes an
approach called simultaneous estimation for
multi-category RFID systems SEM. SEM exploits the
Manchester-coding mechanism, which is supported by the
ISO 18000-6 RFID standard, to decode the combined
signals, thereby simultaneously obtaining the reply
status of tags from each category. As a result,
multiple bit vectors are decoded from just one physical
slotted frame. Built on our SEM, many existing
excellent estimation protocols can be used to estimate
the tag cardinality of each category in a simultaneous
manner. To ensure the predefined accuracy, we calculate
the variance of the estimate in one round, as well as
the variance of the average estimate in multiple
rounds. To find the optimal frame size, we propose an
efficient binary search-based algorithm. To address
significant variance in category sizes, we propose an
adaptive partitioning AP strategy to group categories
of similar sizes together and execute the estimation
protocol for each group separately. Compared with the
existing protocols, our approach is much faster,
meanwhile satisfying the predefined estimation
accuracy. For example, with 20 categories, the proposed
SEM+AP is about seven times faster than prior
estimation schemes. Moreover, our approach is the only
one whose normalized estimation time i.e., time per
category decreases as the number of categories
increases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:FTP,
author = "Xiulong Liu and Xin Xie and Keqiu Li and Bin Xiao and
Jie Wu and Heng Qi and Dawei Lu",
title = "Fast Tracking the Population of Key Tags in
Large-Scale Anonymous {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "278--291",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2576904",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In large-scale radio frequency identification
RFID-enabled applications, we sometimes only pay
attention to a small set of key tags, instead of all.
This paper studies the problem of key tag population
tracking, which aims at estimating how many key tags in
a given set exist in the current RFID system and how
many of them are absent. Previous work is slow to solve
this problem due to the serious interference replies
from a large number of ordinary i.e., non-key tags.
However, time-efficiency is a crucial metric to the
studied key tag tracking problem. In this paper, we
propose a singleton slot-based estimator, which is
time-efficient, because the RFID reader only needs to
observe the status change of expected singleton slots
corresponding to key tags instead of the whole time
frame. In practice, the ratio of key tags to all
current tags is small, because key members are usually
rare. As a result, even when the whole time frame is
long, the number of expected singleton slots is limited
and the running of our protocol is very fast. To obtain
good scalability in large-scale RFID systems, we
exploit the sampling idea in the estimation process. A
rigorous theoretical analysis shows that the proposed
protocol can provide guaranteed estimation accuracy to
end users. Extensive simulation results demonstrate
that our scheme outperforms the prior protocols by
significantly reducing the time cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Marasevic:2017:RAR,
author = "Jelena Marasevic and Jin Zhou and Harish Krishnaswamy
and Yuan Zhong and Gil Zussman",
title = "Resource Allocation and Rate Gains in Practical
Full-Duplex Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "292--305",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2575016",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Full-duplex FD communication has the potential to
substantially increase the throughput in wireless
networks. However, the benefits of FD are still not
well understood. In this paper, we characterize the FD
rate gains in both single-channel and multi-channel use
cases. For the single-channel case, we quantify the
rate gain as a function of the remaining
self-interference SI and signal-to-noise ratio values.
We also provide a sufficient condition under which the
sum of uplink and downlink rates on an FD channel is
biconcave in the transmission power levels. Building on
these results, we consider the multi-channel case. For
that case, we introduce a new realistic model of a
compact e.g., smartphone FD receiver and demonstrate
its accuracy via measurements. We study the problem of
jointly allocating power levels to different channels
and selecting the frequency of maximum SI suppression,
where the objective is to maximize the sum of the rates
over uplink and downlink orthogonal frequency division
multiplexing channels. We develop a polynomial time
algorithm, which is nearly optimal, in practice, under
very mild restrictions. To reduce the running time, we
develop an efficient nearly optimal algorithm under the
high SINR approximation. Finally, we demonstrate via
numerical evaluations the capacity gains in different
use cases and obtain insights into the impact of the
remaining SI and wireless channel states on the
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lovewell:2017:PSC,
author = "Rebecca Lovewell and Qianwen Yin and Tianrong Zhang
and Jasleen Kaur and Frank Donelson Smith",
title = "Packet-Scale Congestion Control Paradigm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "306--319",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2591018",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents the packet-scale paradigm for
designing end-to-end congestion control protocols for
ultra-high speed networks. The paradigm discards the
legacy framework of RTT-scale protocols, and instead
builds upon two revolutionary foundations --- that of
continually probing for available bandwidth at short
timescales, and that of adapting the data sending rate
so as to avoid overloading the network. Through
experimental evaluations with a prototype, we report
high performance gains along several dimensions in
high-speed networks --- the steady-state throughput,
adaptability to dynamic cross-traffic, RTT-fairness,
and co-existence with the conventional TCP traffic
mixes. The paradigm also opens up several issues that
are less of a concern for traditional protocols --- we
summarize our approaches for addressing these.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Munir:2017:PSE,
author = "Ali Munir and Ghufran Baig and Syed Mohammad Irteza
and Ihsan Ayyub Qazi and Alex X. Liu and Fahad Rafique
Dogar",
title = "{PASE}: Synthesizing Existing Transport Strategies for
Near-Optimal Data Center Transport",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "320--334",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2586508",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Several data center transport protocols have been
proposed in recent years e.g., DCTCP, PDQ, and pFabric.
In this paper, we first identify the underlying
strategies used by the existing data center transports,
namely, in-network Prioritization used in pFabric,
Arbitration used in PDQ, and Self-adjusting at
Endpoints PASE used in DCTCP. We show that these
strategies are complimentary to each other, rather than
substitutes, as they have different strengths and can
address each other's limitations. Unfortunately, prior
data center transports use only one of these
strategies. As a result, they either achieve
near-optimal performance or deployment friendliness
i.e., require no changes to the data plane but not
both. Based on this insight, we design a data center
transport protocol called PASE, which carefully
synthesizes these strategies by assigning different
transport responsibilities to each strategy. The key
advantage of PASE over prior art is that it achieves
both near-optimal performance as well as deployment
friendliness. PASE does not require any changes in
network switches hardware or software; yet, it achieves
comparable, or even better, performance than the
state-of-the-art protocols such as pFabric that require
changes to network elements. Our evaluation results
show that the PASE performs well for a wide range of
application workloads and network settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2017:DLB,
author = "Changhyun Lee and Chunjong Park and Keon Jang and Sue
Moon and Dongsu Han",
title = "{DX}: Latency-Based Congestion Control for
Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "335--348",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2587286",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Since the advent of datacenter networking, achieving
low latency within the network has been a primary goal.
Many congestion control schemes have been proposed in
recent years to meet the datacenters' unique
performance requirement. The nature of congestion
feedback largely governs the behavior of congestion
control. In datacenter networks, where round trip times
are in hundreds of microseconds, accurate feedback is
crucial to achieve both high utilization and low
queueing delay. Proposals for datacenter congestion
control predominantly leverage explicit congestion
notification ECN or even explicit in-network feedback
to minimize the queuing delay. In this paper, we
explore latency-based feedback as an alternative and
show its advantages over ECN. Against the common belief
that such implicit feedback is noisy and inaccurate, we
demonstrate that latency-based implicit feedback is
accurate enough to signal a single packet's queuing
delay in 10 Gb/s networks. Such high accuracy enables
us to design a new congestion control algorithm, DX,
that performs fine-grained control to adjust the
congestion window just enough to achieve very low
queuing delay while attaining full utilization. Our
extensive evaluation shows that: 1 the latency
measurement accurately reflects the one-way queuing
delay in single packet level; 2 the latency feedback
can be used to perform practical and fine-grained
congestion control in high-speed datacenter networks;
and 3 DX outperforms DCTCP with 5.33 times smaller
median queueing delay at 1 Gb/s and 1.57 times at 10
Gb/s.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DAronco:2017:IUB,
author = "Stefano D'Aronco and Laura Toni and Sergio Mena and
Xiaoqing Zhu and Pascal Frossard",
title = "Improved Utility-Based Congestion Control for
Delay-Constrained Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "349--362",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2587579",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the presence of buffers in the inner network
nodes, each congestion event leads to buffer queueing
and thus to an increasing end-to-end delay. In the case
of delay sensitive applications, a large delay might
not be acceptable and a solution to properly manage
congestion events while maintaining a low end-to-end
delay is required. Delay-based congestion algorithms
are a viable solution as they target to limit the
experienced end-to-end delay. Unfortunately, they do
not perform well when sharing the bandwidth with
congestion control algorithms not regulated by delay
constraints e.g., loss-based algorithms. Our target is
to fill this gap, proposing a novel congestion control
algorithm for delay-constrained communication over best
effort packet switched networks. The proposed algorithm
is able to maintain a bounded queueing delay when
competing with other delay-based flows, and avoid
starvation when competing with loss-based flows. We
adopt the well-known price-based distributed mechanism
as congestion control, but: 1 we introduce a novel
non-linear mapping between the experienced delay and
the price function and 2 we combine both delay and loss
information into a single price term based on packet
interarrival measurements. We then provide a stability
analysis for our novel algorithm and we show its
performance in the simulation results carried out in
the NS3 framework. Simulation results demonstrate that
the proposed algorithm is able to: achieve good
intra-protocol fairness properties, control efficiently
the end-to-end delay, and finally, protect the flow
from starvation when other flows cause the queuing
delay to grow excessively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:TUD,
author = "Xiaoyong Li and Daren B. H. Cline and Dmitri
Loguinov",
title = "Temporal Update Dynamics Under Blind Sampling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "363--376",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2577680",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network applications commonly maintain local copies of
remote data sources in order to provide caching,
indexing, and data-mining services to their clients.
Modeling performance of these systems and predicting
future updates usually requires knowledge of the
inter-update distribution at the source, which can only
be estimated through blind sampling --- periodic
downloads and comparison against previous copies. In
this paper, we first introduce a stochastic modeling
framework for this problem, where updates and sampling
follow independent point processes. We then show that
all previous approaches are biased unless the
observation rate tends to infinity or the update
process is Poisson. To overcome these issues, we
propose four new algorithms that achieve various levels
of consistency, which depend on the amount of temporal
information revealed by the source and capabilities of
the download process.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sinha:2017:TOMa,
author = "Abhishek Sinha and Georgios Paschos and Chih-Ping Li
and Eytan Modiano",
title = "Throughput-Optimal Multihop Broadcast on Directed
Acyclic Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "377--391",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2582907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of efficiently disseminating
packets in multi-hop wireless networks. At each time
slot, the network controller activates a set of
non-interfering links and forward selected copies of
packets on each activated link. The maximum rate of
commonly received packets is referred to as the
broadcast capacity of the network. Existing policies
achieve the broadcast capacity by balancing traffic
over a set of spanning trees, which are difficult to
maintain in a large and time-varying wireless network.
In this paper, we propose a new dynamic algorithm that
achieves the broadcast capacity when the underlying
network topology is a directed acyclic graph DAG. This
algorithm is decentralized, utilizes local information
only, and does not require the use of spanning trees.
The principal methodological challenge inherent in this
problem is the absence of work-conservation principle
due to the duplication of packets, which renders usual
queuing modeling inapplicable. We overcome this
difficulty by studying relative packet deficits and
imposing in-order delivery constraints to every node in
the network. We show that in-order delivery is
throughput-optimal in DAGs and can be exploited to
simplify the design and analysis of optimal algorithms.
Our capacity characterization also leads to a
polynomial time algorithm for computing the broadcast
capacity of any wireless DAG under the primary
interference constraints. In addition, we propose a
multiclass extension of our algorithm, which can be
effectively used for broadcasting in any network with
arbitrary topology. Simulation results show that the
our algorithm has a superior delay performance as
compared with the traditional tree-based approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2017:CAC,
author = "Qingjun Xiao and Bin Xiao and Shigang Chen and Jiming
Chen",
title = "Collision-Aware Churn Estimation in Large-Scale
Dynamic {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "392--405",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2586308",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "RFID technology has been widely adopted for real-world
applications, such as warehouse management, logistic
control, and object tracking. This paper focuses on a
new angle of applying RFID technology --- monitoring
the temporal change of a tag set in a certain region,
which is called churn estimation. This problem is to
provide quick estimations on the number of new tags
that have entered a monitored region, and the number of
pre-existing tags that have departed from the region,
within a predefined time interval. The traditional
cardinality estimator for a single tag set cannot be
applied here, and the conventional tag identification
protocol that collects all tag IDs takes too much time,
especially when the churn estimation needs to perform
frequently to support real-time monitoring. This paper
will take a new solution path, in which a reader
periodically scans the tag set in a region to collect
their compressed aggregate information in the form of
empty/singleton/collision time slots. This protocol can
reduce the time cost of attaining pre-set accuracy by
at least 35\%, when comparing with a previous work that
uses only the information of idle/busy slots. Such a
dramatic improvement is due to our awareness of
collision slot state and the full utilization of slot
state changes. Our proposed churn estimator, as shown
by the extensive analysis and simulation studies, can
be configured to meet any pre-set accuracy requirement
with a statistical error bound that can be made
arbitrarily small.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keshavarz-Haddad:2017:HSC,
author = "Alireza Keshavarz-Haddad and Ehsan Aryafar and Michael
Wang and Mung Chiang",
title = "{HetNets} Selection by Clients: Convergence,
Efficiency, and Practicality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "406--419",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2587622",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the dynamics of network selection in
heterogeneous wireless networks based on client-side
control. Clients in such networks selfishly select the
best radio access technology RAT that maximizes their
own throughputs. We study two general classes of
throughput models that capture the basic properties of
random access e.g., Wi-Fi and scheduled access e.g.,
WiMAX, LTE, and 3G networks. Formulating the problem as
a non-cooperative game, we study its existence of
equilibria, convergence time, efficiency, and
practicality. Our results reveal that: 1 single-class
RAT selection games converge to Nash equilibria, while
an improvement path can be repeated infinitely with a
mixture of classes; 2 we provide tight bounds on the
convergence time of these games; 3 we analyze the
Pareto-efficiency of the Nash equilibria of these
games, deriving the conditions under which Nash
equilibria are Pareto-optimal, and quantifying the
distance of equilibria with respect to the set of
Pareto-dominant points when the conditions are not
satisfied; and 4 with extensive measurement-driven
simulations, we show that RAT selection games converge
to Nash equilibria in a small number of steps, and are
amenable to practical implementation. We also
investigate the impact of noisy throughput estimates,
and propose solutions to handle them.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nadendla:2017:OSA,
author = "V. Sriram Siddhardh Nadendla and Swastik K. Brahma and
Pramod K. Varshney",
title = "Optimal Spectrum Auction Design With {$2$-D} Truthful
Revelations Under Uncertain Spectrum Availability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "420--433",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2589278",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a novel sealed-bid auction
framework to address the problem of dynamic spectrum
allocation in cognitive radio CR networks. We design an
optimal auction mechanism that maximizes the
moderator's expected utility, when the spectrum is not
available with certainty. We assume that the moderator
employs collaborative spectrum sensing in order to make
a reliable inference about spectrum availability. Due
to the presence of a collision cost whenever the
moderator makes an erroneous inference, and a sensing
cost at each CR, we investigate feasibility conditions
that guarantee a non-negative utility at the moderator.
Since the moderator fuses CRs' sensing decisions to
obtain a global inference regarding spectrum
availability, we propose a novel strategy-proof fusion
rule that encourages the CRs to simultaneously reveal
truthful sensing decisions, along with truthful
valuations to the moderator. We also present tight
theoretical bounds on instantaneous network throughput
achieved by our auction mechanism. Numerical examples
are presented to provide insights into the performance
of the proposed auction under different scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2017:NCL,
author = "Liang Ma and Ting He and Ananthram Swami and Don
Towsley and Kin K. Leung",
title = "Network Capability in Localizing Node Failures via
End-to-End Path Measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "434--450",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2584544",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the capability of localizing node
failures in communication networks from binary states
normal/failed of end-to-end paths. Given a set of nodes
of interest, uniquely localizing failures within this
set requires that different observable path states
associate with different node failure events. However,
this condition is difficult to test on large networks
due to the need to enumerate all possible node
failures. Our first contribution is a set of
sufficient/necessary conditions for identifying a
bounded number of failures within an arbitrary node set
that can be tested in polynomial time. In addition to
network topology and locations of monitors, our
conditions also incorporate constraints imposed by the
probing mechanism used. We consider three probing
mechanisms that differ according to whether measurement
paths are: i arbitrarily controllable; ii controllable
but cycle-free; or iii uncontrollable determined by the
default routing protocol. Our second contribution is to
quantify the capability of failure localization
through: 1 the maximum number of failures anywhere in
the network such that failures within a given node set
can be uniquely localized and 2 the largest node set
within which failures can be uniquely localized under a
given bound on the total number of failures. Both
measures in 1 and 2 can be converted into the functions
of a per-node property, which can be computed
efficiently based on the above sufficient/necessary
conditions. We demonstrate how measures 1 and 2
proposed for quantifying failure localization
capability can be used to evaluate the impact of
various parameters, including topology, number of
monitors, and probing mechanisms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2017:SSD,
author = "Yongquan Fu and Xu Xiaoping",
title = "Self-Stabilized Distributed Network Distance
Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "451--464",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2581592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The network distance service obtains the network
latency among large-scale nodes. With increasing
numbers of participating nodes, the network distance
service has to balance the accuracy and the
scalability. The network-coordinate methods scale well
by embedding the pairwise latency into a
low-dimensional coordinate system. The prediction
errors are iteratively optimized by adjusting the
coordinates with respect to neighbors. Unfortunately,
the optimization process is vulnerable to the
inaccurate coordinates, leading to destabilized
positions. In this paper, we propose RMF, a relative
coordinate-based distributed sparse-preserving
matrix-factorization method to provide guaranteed
stability for the coordinate system. In RMF, each node
maintains a low-rank square matrix that is
incrementally adjusted with respect to its neighbors'
relative coordinates. The optimization is
self-stabilizing, guaranteeing to converge and not
interfered by inaccurate coordinates, since the
relative coordinates do not have computational errors.
By exploiting the sparse structure of the square
matrix, the optimization enforces the $ L_1 $ -norm
regularization to preserve the sparseness of the square
matrix. Simulation results and a PlanetLab-based
experiment confirm that RMF converges to stable
positions within 10 to 15 rounds, and decreases the
prediction errors by 10\% to 20\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kuo:2017:ROO,
author = "Wei-Cheng Kuo and Chih-Chun Wang",
title = "Robust and Optimal Opportunistic Scheduling for
Downlink Two-Flow Network Coding With Varying Channel
Quality and Rate Adaptation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "465--479",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2583488",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the downlink traffic from a base
station to two different clients. When assuming
infinite backlog, it is known that inter-session
network coding INC can significantly increase the
throughput. However, the corresponding scheduling
solution when assuming dynamic arrivals instead and
requiring bounded delay is still nascent. For the
two-flow downlink scenario, we propose the first
opportunistic INC + scheduling solution that is
provably optimal for time-varying channels, i.e., the
corresponding stability region matches the optimal
Shannon capacity. In particular, we first introduce a
new binary INC operation, which is distinctly different
from the traditional wisdom of XORing two overheard
packets. We then develop a queue-length-based
scheduling scheme and prove that it, with the help of
the new INC operation, achieves the optimal stability
region with time-varying channel quality. The proposed
algorithm is later generalized to include the
capability of rate adaptation. Simulation results show
that it again achieves the optimal throughput with rate
adaptation. A byproduct of our results is a scheduling
scheme for stochastic processing networks with random
departure, which relaxes the assumption of
deterministic departure in the existing results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2017:APP,
author = "Yi Gao and Wei Dong and Chun Chen and Xiaoyu Zhang and
Jiajun Bu and Xue Liu",
title = "Accurate Per-Packet Delay Tomography in Wireless Ad
Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "480--491",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2594188",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of decomposing the
end-to-end delay into the per-hop delay for each
packet, in multi-hop wireless ad hoc networks.
Knowledge on the per-hop per-packet delay can greatly
improve the network visibility and facilitate network
measurement and management. We propose Domo, a passive,
lightweight, and accurate delay tomography approach to
decomposing the packet end-to-end delay into each hop.
We first formulate the per packet delay tomography
problem into a set of optimization problems by
carefully considering the constraints among various
timing quantities. At the network side, Domo attaches a
small overhead to each packet for constructing
constraints of the optimization problems. By solving
these optimization problems by semi-definite relaxation
at the PC side, Domo is able to estimate the per-hop
delays with high accuracy as well as give a upper bound
and lower bound for each unknown per-hop delay. We
implement Domo and evaluate its performance extensively
using both trace-driven studies and large-scale
simulations. Results show that Domo significantly
outperforms two existing methods, nearly tripling the
accuracy 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{Sanabria-Russo:2017:HEM,
author = "Luis Sanabria-Russo and Jaume Barcelo and Boris
Bellalta and Francesco Gringoli",
title = "A High Efficiency {MAC} Protocol for {WLANs}:
Providing Fairness in Dense Scenarios",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "492--505",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2587907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Collisions are a main cause of throughput degradation
in wireless local area networks. The current contention
mechanism used in the IEEE 802.11 networks is called
carrier sense multiple access with collision avoidance
CSMA/CA. It uses a binary exponential backoff technique
to randomize each contender attempt of transmitting,
effectively reducing the collision probability.
Nevertheless, CSMA/CA relies on a random backoff that
while effective and fully decentralized, in principle
is unable to completely eliminate collisions, therefore
degrading the network throughput as more contenders
attempt to share the channel. To overcome these
situations, carrier sense multiple access with enhanced
collision avoidance CSMA/ECA is able to create a
collision-free schedule in a fully decentralized manner
using a deterministic backoff after successful
transmissions. Hysteresis and fair share are two
extensions of CSMA/ECA to support a large number of
contenders in a collision-free schedule. CSMA/ECA
offers better throughput than CSMA/CA and short-term
throughput fairness. This paper describes CSMA/ECA and
its extensions. In addition, it provides the first
evaluation results of CSMA/ECA with non-saturated
traffic, channel errors, and its performance when
coexisting with CSMA/CA nodes. Furthermore, it
describes the effects of imperfect clocks over CSMA/ECA
and presents a mechanism to leverage the impact of
channel errors and the addition/withdrawal of nodes
over collision-free schedules. Finally, the
experimental results on throughput and lost frames from
a CSMA/ECA implementation using commercial hardware and
open-source firmware are presented.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:EEB,
author = "Fangming Liu and Jian Guo and Xiaomeng Huang and John
C. S. Lui",
title = "{eBA}: Efficient Bandwidth Guarantee Under Traffic
Variability in Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "506--519",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2594295",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Datacenter networks suffer unpredictable performance
due to a lack of application level bandwidth
guarantees. A lot of attention has been drawn to solve
this problem such as how to provide bandwidth
guarantees for virtualized machines VMs, proportional
bandwidth share among tenants, and high network
utilization under peak traffic. However, existing
solutions fail to cope with highly dynamic traffic in
datacenter networks. In this paper, we propose eBA, an
efficient solution to bandwidth allocation that
provides end-to-end bandwidth guarantee for VMs under
large numbers of short flows and massive bursty traffic
in datacenters. eBA leverages a novel distributed
VM-to-VM rate control algorithm based on the logistic
model under the control-theoretic framework. eBA 's
implementation requires no changes to hardware or
applications and can be deployed in standard protocol
stack. The theoretical analysis and the experimental
results show that eBA not only guarantees the bandwidth
for VMs, but also provides fast convergence to
efficiency and fairness, as well as smooth response to
bursty traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:ECA,
author = "Hao Zhou and Yusheng Ji and Xiaoyan Wang and Shigeki
Yamada",
title = "{eICIC} Configuration Algorithm with Service
Scalability in Heterogeneous Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "520--535",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2588507",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Interference management is one of the most important
issues in heterogeneous cellular networks with multiple
macro and pico cells. The enhanced inter cell
interference coordination eICIC has been proposed to
protect downlink pico cell transmissions by mitigating
interference from neighboring macro cells. Therefore,
the adaptive eICIC configuration problem is critical,
which adjusts the parameters including the ratio of
almost blank subframes ABS and the bias of cell range
expansion RE. This problem is challenging especially
for the scenario with multiple coexisting network
services, since different services have different user
scheduling strategies and different evaluation metrics.
By using a general service model, we formulate the
eICIC configuration problem with multiple coexisting
services as a general form consensus problem with
regularization and solve the problem by proposing an
efficient optimization algorithm based on the
alternating direction method of multipliers. In
particular, we perform local RE bias adaptation at
service layer, local ABS ratio adaptation at BS layer,
and coordination among local solutions for a global
solution at a network layer. To provide the service
scalability, we encapsulate the service details into
the local RE bias adaptation subproblem, which is
isolated from the other parts of the algorithm, and we
also introduce some implementation examples of the
subproblem for different services. The extensive
simulation results demonstrate the efficiency of the
proposed algorithm and verify the convergence
property.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:AWS,
author = "Xu Chen and Xiaowen Gong and Lei Yang and Junshan
Zhang",
title = "{Amazon} in the White Space: Social Recommendation
Aided Distributed Spectrum Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "536--549",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2587736",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed spectrum access DSA is challenging, since
an individual secondary user often has limited sensing
capabilities only. One key insight is that channel
recommendation among secondary users can help to take
advantage of the inherent correlation structure of
spectrum availability in both time and space, and
enable users to obtain more informed spectrum
opportunities. With this insight, we advocate to
leverage the wisdom of crowds, and devise social
recommendation aided DSA mechanisms to orient secondary
users to make more intelligent spectrum access
decisions, for both strong and weak network information
cases. We start with the strong network information
case where secondary users have the statistical
information. To mitigate the difficulty due to the
curse of dimensionality in the stochastic game
approach, we take the one-step Nash approach and cast
the social recommendation aided DSA decision making
problem at each time slot as a strategic game. We show
that it is a potential game, and then devise an
algorithm to achieve the Nash equilibrium by exploiting
its finite improvement property. For the weak
information case where secondary users do not have the
statistical information, we develop a distributed
reinforcement learning mechanism for social
recommendation aided DSA based on the local
observations of secondary users only. Appealing to the
maximum-norm contraction mapping, we also derive the
conditions under which the distributed mechanism
converges and characterize the equilibrium therein.
Numerical results reveal that the proposed social
recommendation aided DSA mechanisms can achieve a
superior performance using real social data traces and
its performance loss in the weak network information
case is insignificant, compared with the strong network
information case.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mehmeti:2017:PMA,
author = "Fidan Mehmeti and Thrasyvoulos Spyropoulos",
title = "Performance Modeling, Analysis, and Optimization of
Delayed Mobile Data Offloading for Mobile Users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "550--564",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2590320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Operators have recently resorted to Wi-Fi offloading
to deal with increasing data demand and induced
congestion. Researchers have further suggested the use
of delayed offloading: if no Wi-Fi connection is
available, some traffic can be delayed up to a given
deadline or until WiFi becomes available. Nevertheless,
there is no clear consensus as to the benefits of
delayed offloading, with a couple of recent
experimental studies largely diverging in their
conclusions, nor is it clear how these benefits depend
on network characteristics e.g., Wi-Fi availability,
user traffic load, and so on. In this paper, we propose
a queueing analytic model for delayed offloading, and
derive the mean delay, offloading efficiency, and other
metrics of interest, as a function of the user's
patience, and key network parameters for two different
service disciplines First Come First Served and
Processor Sharing. We validate the accuracy of our
results using a range of realistic scenarios and real
data traces. Finally, we use these expressions to show
how the user could optimally choose deadlines by
solving the variations of a constrained optimization
problem, in order to maximize her own benefits.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chai:2017:PBE,
author = "Wei Koong Chai and George Pavlou",
title = "Path-Based Epidemic Spreading in Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "565--578",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2594382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Conventional epidemic models assume omni-directional
contact -based infection. This strongly associates the
epidemic spreading process with node degrees. The role
of the infection transmission medium is often
neglected. In real-world networks, however, the
infectious agent as the physical contagion medium
usually flows from one node to another via specific
directed routes path-based infection. Here, we use
continuous-time Markov chain analysis to model the
influence of the infectious agent and routing paths on
the spreading behavior by taking into account the state
transitions of each node individually, rather than the
mean aggregated behavior of all nodes. By applying a
mean field approximation, the analysis complexity of
the path-based infection mechanics is reduced from
exponential to polynomial. We show that the structure
of the topology plays a secondary role in determining
the size of the epidemic. Instead, it is the routing
algorithm and traffic intensity that determine the
survivability and the steady-state of the epidemic. We
define an infection characterization matrix that
encodes both the routing and the traffic information.
Based on this, we derive the critical path-based
epidemic threshold below which the epidemic will die
off, as well as conditional bounds of this threshold
which network operators may use to promote/suppress
path-based spreading in their networks. Finally,
besides artificially generated random and scale-free
graphs, we also use real-world networks and traffic, as
case studies, in order to compare the behaviors of
contact- and path-based epidemics. Our results further
corroborate the recent empirical observations that
epidemics in communication networks are highly
persistent.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:GDI,
author = "Hong Zhang and Kai Chen and Wei Bai and Dongsu Han and
Chen Tian and Hao Wang and Haibing Guan and Ming
Zhang",
title = "Guaranteeing Deadlines for Inter-Data Center
Transfers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "579--595",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2594235",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inter-data center wide area networks inter-DC WANs
carry a significant amount of data transfers that
require to be completed within certain time periods, or
deadlines. However, very little work has been done to
guarantee such deadlines. The crux is that the current
inter-DC WAN lacks an interface for users to specify
their transfer deadlines and a mechanism for provider
to ensure the completion while maintaining high WAN
utilization. In this paper, we address the problem by
introducing a deadline-based network abstraction DNA
for inter-DC WANs. DNA allows users to explicitly
specify the amount of data to be delivered and the
deadline by which it has to be completed. The
malleability of DNA provides flexibility in resource
allocation. Based on this, we develop a system called
Amoeba that implements DNA. Our simulations and test
bed experiments show that Amoeba, by harnessing DNA's
malleability, accommodates 15\% more user requests with
deadlines, while achieving 60\% higher WAN utilization
than prior solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shangguan:2017:SST,
author = "Longfei Shangguan and Zheng Yang and Alex X. Liu and
Zimu Zhou and Yunhao Liu",
title = "{STPP}: Spatial-Temporal Phase Profiling-Based Method
for Relative {RFID} Tag Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "596--609",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2590996",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many object localization applications need the
relative locations of a set of objects as oppose to
their absolute locations. Although many schemes for
object localization using radio frequency
identification RFID tags have been proposed, they
mostly focus on absolute object localization and are
not suitable for relative object localization because
of large error margins and the special hardware that
they require. In this paper, we propose an approach
called spatial-temporal phase profiling STPP to
RFID-based relative object localization. The basic idea
of STPP is that by moving a reader over a set of tags
during which the reader continuously interrogating the
tags, for each tag, the reader obtains a sequence of RF
phase values, which we call a phase profile, from the
tag's responses over time. By analyzing the
spatial-temporal dynamics in the phase profiles, STPP
can calculate the spatial ordering among the tags. In
comparison with prior absolute object localization
schemes, STPP requires neither dedicated infrastructure
nor special hardware. We implemented STPP and evaluated
its performance in two real-world applications:
locating misplaced books in a library and determining
the baggage order in an airport. The experimental
results show that STPP achieves about 84\% ordering
accuracy for misplaced books and 95\% ordering accuracy
for baggage handling. We further leverage the
controllable reader antenna and upgrade STPP to infer
the spacing between each pair of tags. The result shows
that STPP could achieve promising performance on
distance ranging.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vasiliadis:2017:DIS,
author = "Giorgos Vasiliadis and Lazaros Koromilas and Michalis
Polychronakis and Sotiris Ioannidis",
title = "Design and Implementation of a Stateful Network Packet
Processing Framework for {GPUs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "610--623",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2597163",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Graphics processing units GPUs are a powerful platform
for building the high-speed network traffic processing
applications using low-cost hardware. The existing
systems tap the massively parallel architecture of GPUs
to speed up certain computationally intensive tasks,
such as cryptographic operations and pattern matching.
However, they still suffer from significant overheads
due to critical-path operations that are still being
carried out on the CPU, and redundant inter-device data
transfers. In this paper, we present GASPP, a
programmable network traffic processing framework
tailored to modern graphics processors. GASPP
integrates optimized GPU-based implementations of a
broad range of operations commonly used in the network
traffic processing applications, including the first
purely GPU-based implementation of network flow
tracking and TCP stream reassembly. GASPP also employs
novel mechanisms for tackling the control flow
irregularities across SIMT threads, and for sharing the
memory context between the network interfaces and the
GPU. Our evaluation shows that GASPP can achieve
multigigabit traffic forwarding rates even for complex
and computationally intensive network operations, such
as stateful traffic classification, intrusion
detection, and packet encryption. Especially when
consolidating multiple network applications on the same
system, GASPP achieves up to $ 16.2 \times $ speedup
compared with different monolithic GPU-based
implementations of the same applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:ISN,
author = "Xiaohang Li and Chih-Chun Wang and Xiaojun Lin",
title = "Inter-Session Network Coding Schemes for $1$-to-$2$
Downlink Access-Point Networks With Sequential Hard
Deadline Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "624--638",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2599116",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Next generation wireless networks will carry traffic
from a wide range of applications, and many of them may
require packets to be delivered before their respective
deadlines. In this paper, we investigate using
inter-session network coding to send packets wirelessly
for two deadline-constrained unicast sessions. In
particular, each unicast session aims to transmit a
file, whose packets have hard sequential deadline
constraints. We first characterize the corresponding
deadline-constrained capacity region under
heterogeneous channel conditions and heterogeneous
deadline constraints. We show that this
deadline-constrained capacity region can be achieved
asymptotically by modifying the existing
generation-based G-B schemes. However, despite its
asymptotic optimality, the G-B scheme has very poor
performance for small and medium file sizes. To address
these problems, we develop a new immediately-decodable
network coding IDNC scheme that empirically
demonstrates much better performance for short file
sizes, and we prove analytically its asymptotic
optimality when used to send large files. Our analysis
uses a novel version of drift analysis, which could
also be of independent interest to other IDNC
schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Moon:2017:CNA,
author = "YoungGyoun Moon and Donghwi Kim and Younghwan Go and
Yeongjin Kim and Yung Yi and Song Chong and KyoungSoo
Park",
title = "{Cedos}: a Network Architecture and Programming
Abstraction for Delay-Tolerant Mobile Apps",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "646--661",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2603523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Delay-tolerant Wi-Fi offloading is known to improve
overall mobile network bandwidth at low delay and low
cost. Yet, in reality, we rarely find mobile apps that
fully support opportunistic Wi-Fi access. This is
mainly because it is still challenging to develop
delay-tolerant mobile apps due to the complexity of
handling network disruptions and delays. In this paper,
we present Cedos, a practical delay-tolerant mobile
network access architecture in which one can easily
build a mobile app. Cedos consists of three components.
First, it provides a familiar socket API whose
semantics conforms to TCP, while the underlying
protocol, $ \text {D}^2 $ TP, transparently handles
network disruptions and delays in mobility. Second,
Cedos allows the developers to explicitly exploit
delays in mobile apps. App developers can express
maximum user-specified delays in content download or
use the API for real-time buffer management at
opportunistic Wi-Fi usage. Third, for backward
compatibility to existing TCP-based servers, Cedos
provides $ \text {D}^2 $ Prox, a protocol-translation
Web proxy. $ \text {D}^2 $ Prox allows intermittent
connections on the mobile device side, but correctly
translates Web transactions with traditional TCP
servers. We demonstrate the practicality of Cedos by
porting mobile Firefox and VLC video streaming client
to using the API. We also implement
delay/disruption-tolerant podcast client and run a
field study with 50 people for eight weeks. We find
that up to 92.4\% of the podcast traffic is offloaded
to Wi-Fi, and one can watch a streaming video in a
moving train while offloading 48\% of the content to
Wi-Fi without a single pause.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2017:PRL,
author = "Qiaomin Xie and Mayank Pundir and Yi Lu and Cristina
L. Abad and Roy H. Campbell",
title = "{Pandas}: Robust Locality-Aware Scheduling With
Stochastic Delay Optimality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "662--675",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2606900",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data locality is a fundamental problem to
data-parallel applications where data-processing tasks
consume different amounts of time and resources at
different locations. The problem is especially
prominent under stressed conditions such as hot spots.
While replication based on data popularity relieves hot
spots due to contention for a single file, hot spots
caused by skewed node popularity, due to contention for
files co-located with each other, are more complex,
unpredictable, hence more difficult to deal with. We
propose Pandas, a light-weight acceleration engine for
data-processing tasks that is robust to changes in load
and skewness in node popularity. Pandas is a stochastic
delay-optimal algorithm. Trace-driven experiments on
Hadoop show that Pandas accelerates the data-processing
phase of jobs by 11 times with hot spots and 2.4 times
without hot spots over existing schedulers. When the
difference in processing times due to location is
large, such as applicable to the case of
memory-locality, the acceleration by Pandas is 22
times.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Le:2017:RPL,
author = "Anh Le and Arash Saber Tehrani and Alexandros Dimakis
and Athina Markopoulou",
title = "Recovery of Packet Losses in Wireless Broadcast for
Real-Time Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "676--689",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2604282",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the scenario of broadcasting for real-time
applications, such as multi-player games and video
streaming, and loss recovery via instantly decodable
network coding. The source has a single time slot or
multiple time slots to broadcast potentially coded
recovery packets, and the application does not need to
recover all losses. Our goal is to find packets that
are instantly decodable and maximize the number of lost
packets that the users can recover. First, we show that
this problem is equivalent to the unique coverage
problem in the general case, and therefore, it is hard
to approximate. Then, we consider the practical
probabilistic scenario, where users have i.i.d. loss
probability and the number of packets is either
constant video streaming, linear multi-player games, or
polynomial in the number of users, and we provide two
polynomial-time in the number of users algorithms. For
the single-slot case, we propose Max Clique, an
algorithm that provably finds the optimal coded packet
w.h.p. For the case where there is a small constant
number of slots, we propose Multi-Slot Max Clique, an
algorithm that provably finds a near-optimal solution
w.h.p. when the number of packets is sufficiently
large. The proposed algorithms are evaluated using both
simulation and real network traces from an Android
multi-player game. And they are shown to perform near
optimally and to significantly outperform the
state-of-the-art baselines.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Beyranvand:2017:TFE,
author = "Hamzeh Beyranvand and Martin Levesque and Martin Maier
and Jawad A. Salehi and Christos Verikoukis and David
Tipper",
title = "Toward {5G}: {FiWi} Enhanced {LTE-A HetNets} With
Reliable Low-Latency Fiber Backhaul Sharing and {WiFi}
Offloading",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "690--707",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2599780",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To cope with the unprecedented growth of mobile data
traffic, we investigate the performance gains obtained
from unifying coverage-centric 4G mobile networks and
capacity-centric fiber-wireless FiWi broadband access
networks based on data-centric Ethernet technologies
with resulting fiber backhaul sharing and WiFi
offloading capabilities. Despite recent progress on
backhaul-aware 4G studies with capacity-limited
backhaul links, the performance-limiting impact of
backhaul latency and reliability has not been examined
in sufficient detail previously. In this paper, we
evaluate the maximum aggregate throughput, offloading
efficiency, and in particular, the delay performance of
FiWi enhanced LTE-Advanced LTE-A heterogeneous networks
HetNets, including the beneficial impact of various
localized fiber-lean backhaul redundancy and wireless
protection techniques, by means of probabilistic
analysis and verifying simulation, paying close
attention to fiber backhaul reliability issues and WiFi
offloading limitations due to WiFi mesh node failures
as well as temporal and spatial WiFi coverage
constraints. We use recent and comprehensive smartphone
traces of the PhoneLab data set to verify whether the
previously reported assumption that the complementary
cumulative distribution function of both WiFi
connection and interconnection times fit a truncated
Pareto distribution is still valid. In this paper, we
put a particular focus on the 5G key attributes of very
low latency and ultra-high reliability and investigate
how they can be achieved in FiWi enhanced LTE-A
HetNets. Furthermore, given the growing interest in
decentralization of future 5G networks e.g., user
equipment assisted mobility, we develop a decentralized
routing algorithm for FiWi enhanced LTE-A HetNets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:PSD,
author = "Shaoquan Zhang and Longbo Huang and Minghua Chen and
Xin Liu",
title = "Proactive Serving Decreases User Delay Exponentially:
The Light-Tailed Service Time Case",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "708--723",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2607840",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In online service systems, the delay experienced by
users from service request to service completion is one
of the most critical performance metrics. To improve
user delay experience, recent industrial practices
suggest a modern system design mechanism: proactive
serving, where the service system predicts future user
requests and allocates its capacity to serve these
upcoming requests proactively. This approach
complements the conventional mechanism of capability
boosting. In this paper, we propose queuing models for
online service systems with proactive serving
capability and characterize the user delay reduction by
proactive serving. In particular, we show that
proactive serving decreases average delay exponentially
as a function of the prediction window size in the
cases where service time follows light-tailed
distributions. Furthermore, the exponential decrease in
user delay is robust against prediction errors in terms
of miss detection and false alarm and user demand
fluctuation. Compared with the conventional mechanism
of capability boosting, proactive serving is more
effective in decreasing delay when the system is in the
light-load regime. Our trace-driven evaluations
demonstrate the practical power of proactive serving:
for example, for the data trace of light-tailed YouTube
videos, the average user delay decreases by 50\% when
the system predicts 60 s ahead. Our results provide,
from a queuing-theoretical perspective, justifications
for the practical application of proactive serving in
online service systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2017:NLE,
author = "Rui Zhu and Bang Liu and Di Niu and Zongpeng Li and
Hong Vicky Zhao",
title = "Network Latency Estimation for Personal Devices: a
Matrix Completion Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "724--737",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2612695",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network latency prediction is important for server
selection and quality-of-service estimation in
real-time applications on the Internet. Traditional
network latency prediction schemes attempt to estimate
the latencies between all pairs of nodes in a network
based on sampled round-trip times, through either
Euclidean embedding or matrix factorization. However,
these schemes become less effective in terms of
estimating the latencies of personal devices, due to
unstable and time-varying network conditions, triangle
inequality violation and the unknown ranks of latency
matrices. In this paper, we propose a matrix completion
approach to network latency estimation. Specifically,
we propose a new class of low-rank matrix completion
algorithms, which predicts the missing entries in an
extracted ``network feature matrix'' by iteratively
minimizing a weighted Schatten-$p$ norm to approximate
the rank. Simulations on true low-rank matrices show
that our new algorithm achieves better and more robust
performance than multiple state-of-the-art matrix
completion algorithms in the presence of noise. We
further enhance latency estimation based on multiple
``frames'' of latency matrices measured in the past,
and extend the proposed matrix completion scheme to the
case of 3-D tensor completion. Extensive performance
evaluations driven by real-world latency measurements
collected from the Seattle platform show that our
proposed approaches significantly outperform various
state-of-the-art network latency estimation techniques,
especially for networks that contain personal
devices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{vanRijswijk-Deij:2017:PIE,
author = "Roland van Rijswijk-Deij and Kaspar Hageman and Anna
Sperotto and Aiko Pras",
title = "The Performance Impact of Elliptic Curve Cryptography
on {DNSSEC} Validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "738--750",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2605767",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
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 = "The domain name system DNS is a core Internet
infrastructure that translates names to
machine-readable information, such as IP addresses.
Security flaws in DNS led to a major overhaul, with the
introduction of the DNS security DNSSEC extensions.
DNSSEC adds integrity and authenticity to the DNS using
digital signatures. DNSSEC, however, has its own
concerns. It suffers from availability problems due to
packet fragmentation and is a potent source of
distributed denial-of-service attacks. In earlier work,
we argued that many issues with DNSSEC stem from the
choice of RSA as default signature algorithm. A switch
to alternatives based on elliptic curve cryptography
ECC can resolve these issues. Yet switching to ECC
introduces a new problem: ECC signature validation is
much slower than RSA validation. Thus, switching DNSSEC
to ECC imposes a significant additional burden on DNS
resolvers, pushing load toward the edges of the
network. Therefore, in this paper, we study the
question: will switching DNSSEC to ECC lead to problems
for DNS resolvers, or can they handle the extra load?
To answer this question, we developed a model that
accurately predicts how many signature validations DNS
resolvers have to perform. This allows us to calculate
the additional CPU load ECC imposes on a resolver.
Using real-world measurements from four DNS resolvers
and with two open-source DNS implementations, we
evaluate future scenarios where DNSSEC is universally
deployed. Our results conclusively show that switching
DNSSEC to ECC signature schemes does not impose an
insurmountable load on DNS resolvers, even in worst
case scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2017:WCO,
author = "Luoyi Fu and Xinbing Wang and P. R. Kumar",
title = "Are We Connected? Optimal Determination of
Source--Destination Connectivity in Random Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "751--764",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2604278",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the problem of optimally
determining source-destination connectivity in random
networks. Viewing the network as a random graph, we
start by investigating the Erdos--Renyi ER graph, as
well as a structured graph where, interesting, the
problem appears to be open. The problem examined is
that of determining whether a given pair of nodes, a
source $S$, and a destination $D$ are connected by a
path. Assuming that at each step one edge can be tested
to see if it exists or not, we determine an optimal
policy that minimizes the total expected number of
steps. The optimal policy has several interesting
features. In order to establish the connectivity of $S$
and $D$, a policy needs to check all edges on some path
to see if they all exist, but to establish the
disconnectivity it has to check all edges on some cut
to see if none of them exists. The optimal policy has
the following form. At each step, it examines the
condensation multigraph formed by contracting each
known connected component to a single node, and then
checks an edge that is simultaneously on a shortest $S$
--- $D$ path as well as in a minimum $S$ --- $D$ cut.
Among such edges, it chooses that which lead to the
most opportunities for connection. Interestingly, for
an ER graph with $n$ nodes, where there is an edge
between two nodes with probability $p$, the optimal
strategy does not depend on $p$ or $n$, even though the
entire graph itself undergoes a sharp transition from
disconnectivity to connectivity around $ p = \ln n /
n$. The policy is efficiently implementable, requiring
no more than $ 30 \log_2 n$ operations to determine
which edge to test next. The result also extends to
some more general graphs and, meanwhile, provide useful
insights into the connectivity determination in random
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{VanHoudt:2017:EBR,
author = "Benny {Van Houdt}",
title = "Explicit Back-Off Rates for Achieving Target
Throughputs in {CSMA\slash CA} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "765--778",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2604462",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Carrier-sense multiple access/collision avoidance
networks have often been analyzed using a stylized
model that is fully characterized by a vector of
back-off rates and a conflict graph. Furthermore, for
any achievable throughput vector $ \vec \theta $, the
existence of a unique vector $ \vec \nu \vec \theta $
of back-off rates that achieves this throughput vector
was proven. Although this unique vector can in
principle be computed iteratively, the required time
complexity grows exponentially in the network size,
making this only feasible for small networks. In this
paper, we present an explicit formula for the unique
vector of back-off rates $ \vec \nu \vec \theta $
needed to achieve any achievable throughput vector $
\vec \theta $ provided that the network has a chordal
conflict graph. This class of networks contains a
number of special cases of interest such as
inhomogeneous line networks and networks with an
acyclic conflict graph. Moreover, these back-off rates
are such that the back-off rate of a node only depends
on its own target throughput and the target throughput
of its neighbors and can be determined in a distributed
manner. We further indicate that back-off rates of this
form cannot be obtained in general for networks with
non-chordal conflict graphs. For general conflict
graphs, we nevertheless show how to adapt the back-off
rates when a node is added to the network when its
interfering nodes form a clique in the conflict graph.
Finally, we introduce a distributed chordal
approximation algorithm for general conflict graphs,
which is shown using numerical examples to be more
accurate than the Bethe approximation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiesa:2017:TEE,
author = "Marco Chiesa and Guy Kindler and Michael Schapira",
title = "Traffic Engineering With {Equal-Cost-MultiPath}: an
Algorithmic Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "779--792",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614247",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To efficiently exploit the network resources
operators, do traffic engineering TE, i.e., adapt the
routing of traffic to the prevailing demands. TE in
large IP networks typically relies on configuring
static link weights and splitting traffic between the
resulting shortest paths via the Equal-Cost-MultiPath
ECMP mechanism. Yet, despite its vast popularity,
crucial operational aspects of TE via ECMP are still
little-understood from an algorithmic viewpoint. We
embark upon a systematic algorithmic study of TE with
ECMP. We consider the standard model of TE with ECMP
and prove that, in general, even approximating the
optimal link-weight configuration for ECMP within any
constant ratio is an intractable feat, settling a
long-standing open question. We establish, in contrast,
that ECMP can provably achieve optimal traffic flow for
the important category of Clos datacenter networks. We
last consider a well-documented shortcoming of ECMP:
suboptimal routing of large ``elephant'' flows. We
present algorithms for scheduling ``elephant'' flows on
top of ECMP as in, e.g., Hedera with provable
approximation guarantees. Our results complement and
shed new light on past experimental and empirical
studies of the performance of TE with ECMP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:ECM,
author = "Ruiting Zhou and Zongpeng Li and Chuan Wu and Zhiyi
Huang",
title = "An Efficient Cloud Market Mechanism for Computing Jobs
With Soft Deadlines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "793--805",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2609844",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the cloud market for computing jobs
with completion deadlines, and designs efficient online
auctions for cloud resource provisioning. A cloud user
bids for future cloud resources to execute its job.
Each bid includes: 1 a utility, reflecting the amount
that the user is willing to pay for executing its job
and 2 a soft deadline, specifying the preferred finish
time of the job, as well as a penalty function that
characterizes the cost of violating the deadline. We
target cloud job auctions that executes in an online
fashion, runs in polynomial time, provides truthfulness
guarantee, and achieves optimal social welfare for the
cloud ecosystem. Towards these goals, we leverage the
following classic and new auction design techniques.
First, we adapt the posted pricing auction framework
for eliciting truthful online bids. Second, we address
the challenge posed by soft deadline constraints
through a new technique of compact exponential-size LPs
coupled with dual separation oracles. Third, we develop
efficient social welfare approximation algorithms using
the classic primal-dual framework based on both LP
duals and Fenchel duals. Empirical studies driven by
real-world traces verify the efficacy of our online
auction design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2017:CAE,
author = "Fangfang Yan and Tony T. Lee and Weisheng Hu",
title = "Congestion-Aware Embedding of Heterogeneous Bandwidth
Virtual Data Centers With Hose Model Abstraction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "806--819",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2606480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
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 = "Predictable network performance is critical for cloud
applications and can be achieved by providing tenants a
dedicated virtual data center VDC with bandwidth
guarantee. Recently, the extended Hose model was
applied to the VDC abstraction to characterize the
tradeoff between cost and network performance. The
acceptability determination problem of a VDC with
heterogeneous bandwidth demand was proved to be
NP-complete, even in the simple tree topology. In this
paper, we investigate the embedding problem for
heterogeneous bandwidth VDC in substrate networks of
general topology. The embedding problem involves two
coupled sub-problems: virtual machine VM placement and
multipath route assignment. First, we formulate the
route assignment problem with linear programming to
minimize the maximum link utilization, and provide $K$
-widest path load-balanced routing with controllable
splitting paths. Next, we propose a polynomial-time
heuristic algorithm, referred to as the perturbation
algorithm, for the VM placement. The perturbation
algorithm is congestion-aware as it detects the
bandwidth bottlenecks in the placement process and then
selectively relocates some assigned VMs to eliminate
congestion. Simulation results show that our algorithm
performs better in comparison with the existing
well-known algorithms: first-fit, next-fit, and greedy,
and very close to the exponential-time complexity
backtracking algorithm in typical data center network
architectures. For the tree substrate network, the
perturbation algorithm performs better than the
allocation-range algorithm. For the homogeneous
bandwidth VDC requests, the perturbation algorithm
produces a higher success rate than the recently
proposed HVC-ACE algorithm. Therefore, it provides a
compromised solution between time complexity and
network performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Du:2017:PFE,
author = "Wan Du and Jansen Christian Liando and Huanle Zhang
and Mo Li",
title = "Pando: {Fountain}-Enabled Fast Data Dissemination With
Constructive Interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "820--833",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614707",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents Pando, a completely
contention-free data dissemination protocol for
wireless sensor networks. Pando encodes data by
Fountain codes and disseminates the rateless stream of
encoded packets along the fast and parallel pipelines
built on constructive interference and channel
diversity. Since every encoded packet contains
innovative information to the original data object,
Pando avoids duplicate retransmissions and fully
exploits the wireless broadcast effect in data
dissemination. To transform Pando into a practical
system, we devise several techniques, including the
integration of Fountain coding with the timing-critical
operations of constructive interference and pipelining,
a silence-based feedback scheme for the one-way
pipelined dissemination, and packet-level adaptation of
network density and channel diversity. Based on these
techniques, Pando can accomplish data dissemination
entirely over the fast and parallel pipelines. We
implement Pando in Contiki and for TelosB motes. We
evaluate Pando with various settings on two large-scale
open test beds, Indriya and Flocklab. Our experimental
results show that Pando can provide 100\% reliability
and reduce the dissemination time of state of the art
by $ 3.5 \times $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2017:CHW,
author = "Ronghui Hou and Yu Cheng and Jiandong Li and Min Sheng
and King-Shan Lui",
title = "Capacity of Hybrid Wireless Networks With Long-Range
Social Contacts Behavior",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "834--848",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2611606",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Hybrid wireless network is composed of both ad hoc
transmissions and cellular transmissions. Under the $L$
-maximum-hop routing policy, flow is transmitted in the
ad hoc mode if its source and destination are within
$L$ hops away; otherwise, it is transmitted in the
cellular mode. Existing works study the hybrid wireless
network capacity as a function of $L$ so as to find the
optimal $L$ to maximize the network capacity. In this
paper, we consider two more factors: traffic model and
base station access mode. Different from existing
works, which only consider the uniform traffic model,
we consider a traffic model with social behavior. We
study the impact of traffic model on the optimal
routing policy. Moreover, we consider two different
access modes: one-hop access each node directly
communicates with base station and multi-hop access
node may access base station through multiple hops due
to power constraint. We study the impact of access mode
on the optimal routing policy. Our results show that: 1
the optimal $L$ does not only depend on traffic
pattern, but also the access mode; 2 one-hop access
provides higher network capacity than multi-hop access
at the cost of increasing transmitting power; and 3
under the one-hop access mode, network capacity grows
linearly with the number of base stations; however, it
does not hold with the multi-hop access mode, and the
number of base stations has different effects on
network capacity for different traffic models.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mizrahi:2017:TUT,
author = "Tal Mizrahi and Ori Rottenstreich and Yoram Moses",
title = "{TimeFlip}: Using Timestamp-Based {TCAM} Ranges to
Accurately Schedule Network Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "849--863",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2608441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network configuration and policy updates occur
frequently, and must be performed in a way that
minimizes transient effects caused by intermediate
states of the network. It has been shown that accurate
time can be used for coordinating network-wide updates,
thereby reducing temporary inconsistencies. However,
this approach presents a great challenge; even if
network devices have perfectly synchronized clocks, how
can we guarantee that updates are performed at the
exact time for which they were scheduled? In this
paper, we present a practical method for implementing
accurate time-based updates, using TimeFlips. A
TimeFlip is a time-based update that is implemented
using a timestamp field in a ternary content
addressable memory TCAM entry. TimeFlips can be used to
implement atomic bundle updates, and to coordinate
network updates with high accuracy. We analyze the
amount of TCAM resources required to encode a TimeFlip,
and show that if there is enough flexibility in
determining the scheduled time, a TimeFlip can be
encoded by a single TCAM entry, using a single bit to
represent the timestamp, while allowing a very high
degree of accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rottenstreich:2017:ORC,
author = "Ori Rottenstreich and Janos Tapolcai",
title = "Optimal Rule Caching and Lossy Compression for Longest
Prefix Matching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "864--878",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2611482",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is a building block in many
network services, such as routing, monitoring, and
policy enforcement. In commodity switches,
classification is often performed by memory components
of various rule matching patterns longest prefix match,
ternary matches, exact match, and so on. The memory
components are fast but expensive and power-hungry with
power consumption proportional to their size. In this
paper, we study the applicability of rule caching and
lossy compression to create packet classifiers
requiring much less memory than the theoretical size
limits of the semantically-equivalent representations,
enabling significant reduction in their cost and power
consumption. This paper focuses on the longest prefix
matching. Our objective is to find a limited-size
longest prefix match classifier that can correctly
classify a high portion of the traffic, so that it can
be implemented in commodity switches with
classification modules of restricted size. While for
the lossy compression scheme a small amount of traffic
might observe classification errors, a special
indication is returned for traffic that cannot be
classified in the rule caching scheme. We develop
optimal dynamic-programming algorithms for both
problems and describe how to treat the small amount of
traffic that cannot be classified. We generalize our
solutions for a wide range of classifiers with
different similarity metrics. We evaluate their
performance on real classifiers and traffic traces and
show that in some cases we can reduce a classifier size
by orders of magnitude while still classifying almost
all traffic correctly.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2017:DCB,
author = "Tong Ye and Jinghui Zhang and Tony T. Lee and Weisheng
Hu",
title = "Deflection-Compensated {Birkhoff--von-Neumann}
Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "879--895",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2606766",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Despite the high throughput and low complexity
achieved by input scheduling based on
Birkhoff-von-Neumann BvN decomposition, the performance
of the BvN switch becomes less predictable when the
input traffic is bursty. In this paper, we propose a
deflection-compensated BvN D-BvN switch architecture to
enhance the quasistatic scheduling based on BvN
decomposition. D-BvN switches provide capacity
guarantee for virtual circuits VCs and deflect bursty
traffic when overflow occurs. The deflection scheme is
devised to offset the excessive buffer requirement of
each VC when input traffic is bursty. The design of our
conditional deflection mechanism is based on the fact
that it is unlikely that the traffic input to VCs is
all bursty at the same time; most likely, some starving
VCs have spare capacities when some other VCs are in
the overflow state. The proposed algorithm makes full
use of the spare capacities of those starving VCs to
deflect the overflow traffic to other inputs and
provide bandwidth for the deflected traffic to
re-access the desired VC. Our analysis and simulation
results show that this deflection-compensated mechanism
can support BvN switches to achieve close to 100\%
throughput of offered load even with bursty input
traffic, and reduces the average end-to-end delay and
delay jitter. Also, our result indicates that the
packet out-of-sequence probability due to deflection of
overflow traffic is negligible, and thus, only a small
re-sequencing buffer is needed at each output port. We
also compare D-BvN with the well-established online
scheduling algorithm iSLIP, and the result demonstrates
that D-BvN outperforms iSLIP in terms of the throughput
of offered load when the traffic is non-uniform or the
traffic load is not very high.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2017:EHW,
author = "Liansheng Tan and Shengda Tang",
title = "Energy Harvesting Wireless Sensor Node With Temporal
Death: Novel Models and Analyses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "896--909",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2607229",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Energy harvesting wireless sensor net-work EH-WSN is
promising in applications, however the frequent
occurrence of temporal death of nodes, due to the
limited harvesting capability, presents a difficulty in
meeting the quality-of-service requirements of the
network. For a node with temporal death in an EH-WSN,
this paper presents a new model, which consists of, a
Markov model to trace the energy harvesting process, a
queuing analytical model to model the working mechanism
of the sensor node and a continuous fluid process to
capture the evolution of the residual energy in the
EH-WSN node. Using the Markov fluid queue MFQ theory,
we discuss various performance aspects of the EH-WSN
node with temporal death, including the temporal death
occurrence probability, the probability density of the
residual energy, the stationary energy consumption, the
queue length distribution in the data buffer, the
packet blocking probability, and so on. In order to
obtain the dropping probability of a given packet,
based on the structure of the MFQ, we develop an
auxiliary MFQ and derive the formulations of two types
of the packet dropping probabilities, i.e., the packet
dropping probability due to energy depletion and that
due to channel error. Numerical examples are provided
to illustrate the theoretical findings, and new
insights into understanding the impacts of the
parameters on the performance metrics are presented.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Singh:2017:TTW,
author = "Shailendra Singh and Karthikeyan Sundaresan and
Srikanth V. Krishnamurthy and Xinyu Zhang and Mohammad
Ali Amir Khojastepour and Sampath Rangarajan",
title = "{TRINITY}: Tailoring Wireless Transmission Strategies
to User Profiles in Enterprise Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "910--924",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2619376",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The proliferation of smartphones and tablet devices is
changing the landscape of user connectivity and data
access from predominantly static users to a mix of
static and mobile users. While significant advances
have been made in wireless transmission strategies
e.g., beamforming and network MIMO to meet the
increased demand for capacity, such strategies
primarily cater to static users. To cope with growing
heterogeneity in data access, it is critical to
identify and optimize strategies that can cater to
users of various profiles to maximize system
performance and more importantly, improve users'
quality of experience. Toward this goal, we first show
that users can be profiled into three distinct
categories based on their data access mobility and
channel coherence characteristics. Then, with
real-world experiments, we show that the strategy that
best serves users in these categories varies distinctly
from one profile to another and belongs to the class of
strategies that emphasize either multiplexing e.g.,
network MIMO, diversity e.g., distributed antenna
systems or reuse e.g., conventional CSMA. Two key
challenges remain in translating these inferences to a
practical system, namely: 1 how to profile users and 2
how to combine strategies to communicate with users of
different profiles simultaneously. In addressing these
challenges, we present the design of TRINITY --- a
practical system that effectively caters to a
heterogeneous set of users. We implement and evaluate a
prototype of TRINITY on our WARP radio testbed. Our
extensive experiments show that TRINITY's intelligent
combining of transmission strategies improves the total
network rate by 50\%--150\%, satisfies the QoS
requirements of thrice as many users, and improves PSNR
for video traffic by 10 dB compared with individual
transmission strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2017:AAM,
author = "Yishuo Shi and Zhao Zhang and Yuchang Mo and Ding-Zhu
Du",
title = "Approximation Algorithm for Minimum Weight
Fault-Tolerant Virtual Backbone in Unit Disk Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "925--933",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2607723",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a wireless sensor network, the virtual backbone
plays an important role. Due to accidental damage or
energy depletion, it is desirable that the virtual
backbone is fault-tolerant. A fault-tolerant virtual
backbone can be modeled as a $k$ -connected $m$ -fold
dominating set $ k, m$ -CDS for short. In this paper,
we present a constant approximation algorithm for the
minimum weight $ k, m$ -CDS problem in unit disk graphs
under the assumption that $k$ and $m$ are two fixed
constants with $ m \geq k$. Prior to this paper,
constant approximation algorithms are known for $ k =
1$ with weight and $ 2 \leq k \leq 3$ without weight.
Our result is the first constant approximation
algorithm for the $ k, m$ -CDS problem with general $
k, m$ and with weight. The performance ratio is $
\alpha + 5 \rho $ for $ k \geq 3$ and $ \alpha + 2.5
\rho $ for $ k = 2$, where $ \alpha $ is the
performance ratio for the minimum weight $m$ -fold
dominating set problem and $ \rho $ is the performance
ratio for the subset $k$ -connected subgraph problem
both problems are known to have constant performance
ratios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2017:DDC,
author = "Jie Cheng and Yaning Liu and Qiang Ye and Hongwei Du
and Athanasios V. Vasilakos",
title = "{DISCS}: a Distributed Coordinate System Based on
Robust Nonnegative Matrix Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "934--947",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2615889",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many distributed applications, such as BitTorrent,
need to know the distance between each pair of network
hosts in order to optimize their performance. For
small-scale systems, explicit measurements can be
carried out to collect the distance information. For
large-scale applications, this approach does not work
due to the tremendous amount of measurements that have
to be completed. To tackle the scalability problem,
network coordinate system NCS was proposed to solve the
scalability problem by using partial measurements to
predict the unknown distances. However, the existing
NCS schemes suffer seriously from either low prediction
precision or unsatisfactory convergence speed. In this
paper, we present a novel distributed network
coordinate system DISCS that utilizes a limited set of
distance measurements to achieve high-precision
distance prediction at a fast convergence speed.
Technically, DISCS employs the innovative robust
nonnegative matrix completion method to improve the
prediction accuracy. Through extensive experiments
based on various publicly-available data sets, we found
that DISCS outperforms the state-of-the-art NCS schemes
in terms of prediction precision and convergence speed,
which clearly shows the high usability of DISCS in
real-life Internet applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2017:AGS,
author = "Zhiwei Zhao and Wei Dong and Jiajun Bu and Tao Gu and
Geyong Min",
title = "Accurate and Generic Sender Selection for Bulk Data
Dissemination in Low-Power Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "948--959",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614129",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data dissemination is a fundamental service offered by
low-power wireless networks. Sender selection is the
key to the dissemination performance and has been
extensively studied. Sender impact metric plays a
significant role in sender selection, since it
determines which senders are selected for transmission.
Recent studies have shown that spatial link diversity
has a significant impact on the efficiency of
broadcast. However, the existing metrics overlook such
impact. Besides, they consider only gains but ignore
the costs of sender candidates. As a result, existing
works cannot achieve accurate estimation of the sender
impact. Moreover, they cannot well support data
dissemination with network coding, which is commonly
used for lossy environments. In this paper, we first
propose a novel sender impact metric, namely, $ \gamma
$, which jointly exploits link quality and spatial link
diversity to calculate the gain/cost ratio of the
sender candidates. Then, we develop a generic sender
selection scheme based on the $ \gamma $ metric called
$ \gamma $ -component that can generally support both
types of dissemination using native packets and network
coding. Extensive evaluations are conducted through
real testbed experiments and large-scale simulations.
The performance results and analysis show that $ \gamma
$ achieves far more accurate impact estimation than the
existing works. In addition, the dissemination
protocols based on $ \gamma $ -component outperform the
existing protocols in terms of completion time and
transmissions by 20.5\% and 23.1\%, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Santagati:2017:SDU,
author = "G. Enrico Santagati and Tommaso Melodia",
title = "A Software-Defined Ultrasonic Networking Framework for
Wearable Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "960--973",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2616724",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See corrections \cite{Santagati:2019:CSD}.",
abstract = "Wearable medical devices with wireless capabilities
have become the cornerstone of many revolutionary
digital health applications that promise to predict and
treat major diseases by acquiring and processing
physiological information. Existing wireless wearable
devices are connected through radio frequency
electromagnetic wave carriers based on standards, such
as Bluetooth or Wi-Fi. However, these solutions tend to
almost blindly scale down traditional wireless
technologies to the body environment, with little or no
attention to the peculiar characteristics of the human
body and the severe privacy and security requirements
of patients. We contend that this is not the only
possible approach, and we introduce U-Wear, the first
networking framework for wearable medical devices based
on ultrasonic communications. U-Wear encloses a set of
physical, data link, and network layer functionalities
that can flexibly adapt to application and system
requirements to efficiently distribute information
between ultrasonic wearable devices. U-Wear also offers
reconfiguration functionalities at the application
layer to provide a flexible platform to develop medical
applications. We design two prototypes that implement
U-Wear and operate in the near-ultrasonic frequency
range using commercial-off-the-shelf COTS speakers and
microphones. Despite the limited bandwidth, i.e., about
2 kHz, and COTS hardware components not optimized for
operating at high frequency, our prototypes: (1)
achieve data rates up to 2.76 kbit / s with
bit-error-rate lower than $ 10^-5 $ using a
transmission power of 13 dBm 20 mW; (2) enable multiple
nodes to share the medium; and (3) implement
reconfigurable processing to extract medical parameters
from sensors with high accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Datta:2017:CPS,
author = "Amitava Datta",
title = "Construction of Polynomial-Size Optical Priority
Queues Using Linear Switches and Fiber Delay Lines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "974--987",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614549",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the main problems in all-optical packet
switched networks is the buffering of packets. A
popular solution for buffering packets is to use a set
of fiber delay lines attached to a switch. A priority
queue is one of the most general buffering schemes that
allows the packet with the highest priority to depart
the buffer on a departure request and dropping of the
lowest priority packet if a new packet arrives when the
buffer is full. We present a recursive algorithm for
constructing optical priority queues of polynomial size
from a switch with linear number of inputs/outputs and
fiber delay lines. The best known lower bound allows
the construction of a priority queue of size $ 2^M $
using a switch of size $M$. However, the best known
upper bound constructs a priority queue of size $ M^3$
using a switch of size $M$. We show that it is possible
to construct a priority queue of size $ O M^c$ for a
fixed constant $c$ using a switch of size $ O M$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dao:2017:MRC,
author = "Tuan Dao and Amit K. Roy-Chowdhury and Harsha V.
Madhyastha and Srikanth V. Krishnamurthy and Tom {La
Porta}",
title = "Managing Redundant Content in Bandwidth Constrained
Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "988--1003",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2616901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Images/videos are often uploaded in situations like
disasters. This can tax the network in terms of
increased load and thereby upload latency, and this can
be critical for response activities. In such scenarios,
prior work has shown that there is significant
redundancy in the content e.g., similar photos taken by
users transferred. By intelligently
suppressing/deferring transfers of redundant content,
the load can be significantly reduced, thereby
facilitating the timely delivery of unique, possibly
critical information. A key challenge here however, is
detecting ``hat content is similar,'' given that the
content is generated by uncoordinated user devices.
Toward addressing this challenge, we propose a
framework, wherein a service to which the content is to
be uploaded first solicits metadata e.g., image
features from any device uploading content. By
intelligently comparing this metadata with that
associated with previously uploaded content, the
service effectively identifies and thus enables the
suppression of redundant content. Our evaluations on a
testbed of 20 Android smartphones and via ns3
simulations show that we can identify similar content
with a 70\% true positive rate and a 1\% false positive
rate. The resulting reduction in redundant content
transfers translates to a latency reduction of 44 \%
for unique content.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ferrari:2017:CRP,
author = "Lorenzo Ferrari and Anna Scaglione and Reinhard Gentz
and Yao-Win Peter Hong",
title = "Convergence Results on Pulse Coupled Oscillator
Protocols in Locally Connected Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1004--1019",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2611379",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper provides new insights on the convergence of
a locally connected network of pulse coupled oscillator
PCOs i.e., a bioinspired model for communication
networks to synchronous and desynchronous states, and
their implication in terms of the decentralized
synchronization and scheduling in communication
networks. Bioinspired techniques have been advocated by
many as fault-tolerant and scalable alternatives to
produce self-organization in communication networks.
The PCO dynamics, in particular, have been the source
of inspiration for many network synchronization and
scheduling protocols. However, their convergence
properties, especially in locally connected networks,
have not been fully understood, prohibiting the
migration into mainstream standards. This paper
provides further results on the convergence of PCOs in
locally connected networks and the achievable
convergence accuracy under propagation delays. For
synchronization, almost sure convergence is proved for
three nodes and accuracy results are obtained for
general locally connected networks, whereas for
scheduling or desynchronization, results are derived
for locally connected networks with mild conditions on
the overlapping set of maximal cliques. These issues
have not been fully addressed before 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{Chavan:2017:TVQ,
author = "Santosh Chavan and Nizar Malangadan and Gaurav Raina",
title = "{TCP} With Virtual Queue Management Policies:
Stability and Bifurcation Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1020--1033",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2620602",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we analyze a model for transport
control protocol TCP along with a non-adaptive virtual
queue VQ and an adaptive virtual queue AVQ management
policy. In the class of transport protocols, we focus
on compound TCP as it is the default protocol in the
Windows operating system. We start by conducting a
local stability analysis for the underlying fluid
models. For the VQ policy, we show that small virtual
buffers play an important role in ensuring stability,
whereas the AVQ policy could readily lose local
stability as the link capacity, the feedback delay, or
the link's damping factor gets large. With both the
queue policies, the protocol parameters of compound TCP
also influence stability. Furthermore, in both the
models, we explicitly show that as parameters vary the
loss of local stability would occur via a Hopf
bifurcation. For the AVQ policy, we are also able to
analytically verify if the Hopf bifurcation is
super-critical, and determine the stability of the
bifurcating limit cycles. Packet-level simulations,
conducted over two topologies, using the network
simulator NS2 confirm the existence of stable limit
cycles in the queue size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:OAI,
author = "Xiaoxi Zhang and Zhiyi Huang and Chuan Wu and Zongpeng
Li and Francis C. M. Lau",
title = "Online Auctions in {IaaS} Clouds: Welfare and Profit
Maximization With Server Costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1034--1047",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2619743",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Auction design has recently been studied for dynamic
resource bundling and virtual machine VM provisioning
in IaaS clouds, but is mostly restricted to one-shot or
offline setting. This paper targets a more realistic
case of online VM auction design, where: 1 cloud users
bid for resources into the future to assemble
customized VMs with desired occupation durations,
possibly located in different data centers; 2 the cloud
provider dynamically packs multiple types of resources
on heterogeneous physical machines servers into the
requested VMs; 3 the operational costs of servers are
considered in resource allocation; and 4 both social
welfare and the cloud provider's net profit are to be
maximized over the system running span. We design
truthful, polynomial time auctions to achieve social
welfare maximization and/or the provider's profit
maximization with good competitive ratios. Our
mechanisms consist of two main modules: 1 an online
primal-dual optimization framework for VM allocation to
maximize the social welfare with server costs, and for
revealing the payments through the dual variables to
guarantee truthfulness and 2 a randomized reduction
algorithm to convert the social welfare maximizing
auctions to ones that provide a maximal expected profit
for the provider, with competitive ratios comparable to
those for social welfare. We adopt a new application of
Fenchel duality in our primal-dual framework, which
provides richer structures for convex programs than the
commonly used Lagrangian duality, and our optimization
framework is general and expressive enough to handle
various convex server cost functions. The efficacy of
the online auctions is validated through careful
theoretical analysis and trace-driven simulation
studies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vural:2017:CTD,
author = "Serdar Vural and Ning Wang and Pirabakaran Navaratnam
and Rahim Tafazolli",
title = "Caching Transient Data in {Internet} Content Routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1048--1061",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2616359",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet-of-Things IoT paradigm envisions billions
of devices all connected to the Internet, generating
low-rate monitoring and measurement data to be
delivered to application servers or end-users.
Recently, the possibility of applying in-network data
caching techniques to IoT traffic flows has been
discussed in research forums. The main challenge as
opposed to the typically cached content at routers,
e.g., multimedia files, is that IoT data are transient
and therefore require different caching policies. In
fact, the emerging location-based services can also
benefit from new caching techniques that are
specifically designed for small transient data. This
paper studies in-network caching of transient data at
content routers, considering a key temporal data
property: data item lifetime. An analytical model that
captures the trade-off between multihop communication
costs and data item freshness is proposed. Simulation
results demonstrate that caching transient data are a
promising information-centric networking technique that
can reduce the distance between content requesters and
the location in the network where the content is
fetched from. To the best of our knowledge, this is a
pioneering research work aiming to systematically
analyze the feasibility and benefit of using Internet
routers to cache transient data generated by IoT
applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mokhtarian:2017:FCA,
author = "Kianoosh Mokhtarian and Hans-Arno Jacobsen",
title = "Flexible Caching Algorithms for Video Content
Distribution Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1062--1075",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2621067",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Global video content distribution networks CDNs serve
a significant fraction of the entire Internet traffic.
Effective caching at the edge is vital for the
feasibility of these CDNs, which can otherwise incur
substantial costs and overloads in the Internet. We
analyze the challenges and requirements for content
caching on the servers of these CDNs which cannot be
addressed by standard solutions. We design multiple
algorithms for this problem: a LRU-based baseline to
address the requirements; a flexible ingress-efficient
algorithm; an offline cache aware of future requests
greedy to estimate the maximum efficiency we can expect
from any online algorithm; an optimal offline cache for
limited scales; and an adaptive ingress control
algorithm for reducing the server's peak upstream
traffic. We use anonymized actual data from a global
video CDN to evaluate the algorithms and draw
conclusions on their suitability for different
settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Partov:2017:UFR,
author = "Bahar Partov and Douglas J. Leith",
title = "Utility Fair Rate Allocation in {LTE\slash 802.11}
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1076--1088",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614252",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider proportional fair rate allocation in a
heterogeneous network with a mix of LTE and 802.11
cells which supports multipath and multihomed operation
simultaneous connection of a user device to multiple
LTE base stations and 802.11 access points. We show
that the utility fair optimization problem is
non-convex but that a global optimum can be found by
solving a sequence of convex optimizations in a
distributed fashion. The result is a principled
approach to offload from LTE to 802.11 and for
exploiting LTE/802.11 path diversity to meet user
traffic demands.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Posch:2017:SSA,
author = "Daniel Posch and Benjamin Rainer and Hermann
Hellwagner",
title = "{SAF}: Stochastic Adaptive Forwarding in Named Data
Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1089--1102",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2614710",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Forwarding decisions in classical IP-based networks
are predetermined by routing. This is necessary to
avoid loops, inhibiting opportunities to implement an
adaptive and intelligent forwarding plane.
Consequently, content distribution efficiency is
reduced due to a lack of inherent multi-path
transmission. In Named Data Networking NDN instead,
routing shall hold a supporting role to forwarding,
providing sufficient potential to enhance content
dissemination at the forwarding plane. In this paper,
we design, implement, and evaluate a novel
probability-based forwarding strategy, called
Stochastic Adaptive Forwarding SAF for NDN. SAF
imitates a self-adjusting water pipe system,
intelligently guiding and distributing interests
through network crossings circumventing link failures
and bottlenecks. Just as real pipe systems, SAF employs
overpressure valves enabling congested nodes to lower
pressure autonomously. Through an implicit feedback
mechanism, it is ensured that the fraction of the
traffic forwarded via congested nodes decreases. By
conducting simulations, we show that our approach
outperforms existing forwarding strategies in terms of
the interest satisfaction ratio in the majority of the
evaluated scenarios. This is achieved by extensive
utilization of NDN's multipath and content-lookup
capabilities without relying on the routing plane. SAF
explores the local environment by redirecting requests
that are likely to be dropped anyway. This enables SAF
to identify new paths to the content origin or to
cached replicas, circumventing link failures, and
resource shortages without relying on routing
updates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2017:AAC,
author = "Jingjing Luo and Jinbei Zhang and Ying Cui and Li Yu
and Xinbing Wang",
title = "Asymptotic Analysis on Content Placement and Retrieval
in {MANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1103--1118",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2621060",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recently, performance analysis for large-scale
content-centric mobile ad hoc networks MANETs has
received intense attention. In content-centric MANETs,
content delivery consists of two operations, i.e.,
content placement and content retrieval, which may
involve different network costs. However, the existing
performance studies in content-centric MANETs mainly
focus on content retrieval, and hence may not reflect
the impact of content placement. In this paper, we
investigate the asymptotic throughput and delay
performance by considering the two operations of
possibly different network costs. In particular, we
introduce a general weighted sum delay cost of content
placement and content retrieval as the delay
performance metric. We consider an arbitrary content
popularity distribution and study two mobility models
in different time scales, i.e., fast and slow mobility.
For each mobility model, we characterize the impacts of
the network parameters on the network performance. By
optimizing the content placement and retrieval for
contents of different popularities, we design a general
near-optimal scheme, the parameters of which reflect
the delay weights of the two phases. We show that the
network performance improves as the number of cached
replicas increases until the number reaches a
threshold. Finally, we show that our results are
general and can incorporate some existing results as
special cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fernandez:2017:EDR,
author = "Alvaro Fernandez and Norvald Stol",
title = "Economic, Dissatisfaction, and Reputation Risks of
Hardware and Software Failures in {PONs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1119--1132",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2619062",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "When pondering on the deployment and business cases of
passive optical networks PONs, dependability risk
assessment is starting to play a key role. Not only
entailing cost due to repairs or breaching service
level agreements SLAs, dependability risks also cover
customer dissatisfaction and large outages affecting
operators' reputation. This paper proposes a risk
assessment approach to evaluate the effect of hardware
and software dependability in PONs with respect to
these three aspects. First, a network geometric model
Manhattan model captures the PON deployment, while
software is modeled through a reliability growth model
Duane's model based on empirical data. Dynamic
dependability behavior, combining both these models, is
captured by a Markov cost model, solved by means of
simulations. Thus, the probability distributions of the
dependability-related costs and client dissatisfaction
are shown, and also scatter plots of the clients
affected by a failure versus the down time, for
different time division multiplexed-PON protection
schemes. By considering the probability distribution,
menaces that may go unnoticed with asymptotic analyses
can be identified. Hence, risks threatening a
successful PON in a business context with respect to
costs, dissatisfaction, and large outages are
pinpointed. Results show that, with stringent SLAs or
high desired customer satisfaction, software failures
are a threat to a successful PON deployment. Yet,
hardware failures may lead to high costs and large
outages sullying an operator's reputation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiesa:2017:RSF,
author = "Marco Chiesa and Ilya Nikolaevskiy and Slobodan
Mitrovic and Andrei Gurtov and Aleksander Madry and
Michael Schapira and Scott Shenker",
title = "On the Resiliency of Static Forwarding Tables",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1133--1146",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2619398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fast reroute and other forms of immediate failover
have long been used to recover from certain classes of
failures without invoking the network control plane.
While the set of such techniques is growing, the level
of resiliency to failures that this approach can
provide is not adequately understood. In this paper, we
embarked upon a systematic algorithmic study of the
resiliency of forwarding tables in a variety of models
i.e., deterministic/probabilistic routing, with
packet-header-rewriting, with packet-duplication. Our
results show that the resiliency of a routing scheme
depends on the ``connectivity'' $k$ of a network, i.e.,
the minimum number of link deletions that partition a
network. We complement our theoretical result with
extensive simulations. We show that resiliency to four
simultaneous link failures, with limited path stretch,
can be achieved without any packet
modification/duplication or randomization. Furthermore,
our routing schemes provide resiliency against $ k - 1$
failures, with limited path stretch, by storing $ \log
k$ bits in the packet header, with limited packet
duplication, or with randomized forwarding technique.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2017:UMT,
author = "Fengli Xu and Yong Li and Huandong Wang and Pengyu
Zhang and Depeng Jin",
title = "Understanding Mobile Traffic Patterns of Large Scale
Cellular Towers in Urban Environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1147--1161",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2623950",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Understanding mobile traffic patterns of large scale
cellular towers in urban environment is extremely
valuable for Internet service providers, mobile users,
and government managers of modern metropolis. This
paper aims at extracting and modeling the traffic
patterns of large scale towers deployed in a
metropolitan city. To achieve this goal, we need to
address several challenges, including lack of
appropriate tools for processing large scale traffic
measurement data, unknown traffic patterns, as well as
handling complicated factors of urban ecology and human
behaviors that affect traffic patterns. Our core
contribution is a powerful model which combines three
dimensional information time, locations of towers, and
traffic frequency spectrum to extract and model the
traffic patterns of thousands of cellular towers. Our
empirical analysis reveals the following important
observations. First, only five basic time-domain
traffic patterns exist among the 9600 cellular towers.
Second, each of the extracted traffic pattern maps to
one type of geographical locations related to urban
ecology, including residential area, business district,
transport, entertainment, and comprehensive area.
Third, our frequency-domain traffic spectrum analysis
suggests that the traffic of any tower among 9600 can
be constructed using a linear combination of four
primary components corresponding to human activity
behaviors. We believe that the proposed traffic
patterns extraction and modeling methodology, combined
with the empirical analysis on the mobile traffic, pave
the way toward a deep understanding of the traffic
patterns of large scale cellular towers in modern
metropolis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Javidbakht:2017:DAT,
author = "Omid Javidbakht and Parv Venkitasubramaniam",
title = "Delay Anonymity Tradeoff in Mix Networks: Optimal
Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1162--1175",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2624023",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Anonymous systems on the Internet aim to protect users
from revealing to an external unauthorized entity their
identities and their network activities. Despite using
layered encryption, these systems are still vulnerable
to timing analysis, wherein an eavesdropper can use
traffic correlation mechanisms to identify the source
of packets arriving at a destination. Mixes are
intelligent routers or proxy servers that aim to
provide packet source anonymity from timing analysis by
delaying and shuffling the order of received packets
prior to transmission. Such shuffling strategies
naturally increase latency and result in a tradeoff
between anonymity and latency. This paper investigates
this tradeoff in a network of mixes, by deriving the
optimal routing for sources which maximizes weighted
sum of anonymity and delay. The achievable anonymity is
characterized analytically for a general multipath
model, and it is shown that under light traffic
conditions, there exists a unique single route
strategy, which achieves the optimal delay anonymity
tradeoff. A low complexity algorithm is presented that
derives the optimal routes to achieve a desired
tradeoff. The light traffic results are specialized for
a graphical model of existing practical anonymous
systems, and optimal scaling behavior with the size of
such networks is characterized. In the heavy traffic
regime, it is shown that optimal anonymity is achieved
for any allocation of rates across the different
routes. Simulations on example networks are presented
where it is shown that the optimal routes derived under
light traffic performs quite well in general traffic
regime.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:FAN,
author = "Kang Chen and Haiying Shen",
title = "{FaceChange}: Attaining Neighbor Node Anonymity in
Mobile Opportunistic Social Networks With Fine-Grained
Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1176--1189",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2623521",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In mobile opportunistic social networks MOSNs, mobile
devices carried by people communicate with each other
directly when they meet for proximity-based MOSN
services e.g., file sharing without the support of
infrastructures. In current methods, when nodes meet,
they simply communicate with their real IDs, which
leads to privacy and security concerns. Anonymizing
real IDs among neighbor nodes solves such concerns.
However, this prevents nodes from collecting real
ID-based encountering information, which is needed to
support MOSN services. Therefore, in this paper, we
propose FaceChange that can support both anonymizing
real IDs among neighbor nodes and collecting real
ID-based encountering information. For node anonymity,
two encountering nodes communicate anonymously. Only
when the two nodes disconnect with each other, each
node forwards an encrypted encountering evidence to the
encountered node to enable encountering information
collection. A set of novel schemes are designed to
ensure the confidentiality and uniqueness of
encountering evidences. FaceChange also supports
fine-grained control over what information is shared
with the encountered node based on attribute similarity
i.e., trust, which is calculated without disclosing
attributes. Advanced extensions for sharing real IDs
between mutually trusted nodes and more efficient
encountering evidence collection are also proposed.
Extensive analysis and experiments show the
effectiveness of FaceChange on protecting node privacy
and meanwhile supporting the encountering information
collection in MOSNs. Implementation on smartphones also
demonstrates its energy efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2017:EMS,
author = "Lailong Luo and Deke Guo and Jie Wu and Ori
Rottenstreich and Qian He and Yudong Qin and Xueshan
Luo",
title = "Efficient Multiset Synchronization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1190--1205",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2618006",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Set synchronization is an essential job for
distributed applications. In many cases, given two sets
$A$ and $B$, applications need to identify those
elements that appear in set $A$ but not in set $B$, and
vice versa. Bloom filter, a space-efficient data
structure for representing a set and supporting
membership queries, has been employed as a lightweight
method to realize set synchronization with a low false
positive probability. Unfortunately, bloom filters and
their variants can only be applied to simple sets
rather than more general multisets, which allow
elements to appear multiple times. In this paper, we
first examine the potential of addressing the multiset
synchronization problem based on two existing variants
of the bloom filters: the IBF and the counting bloom
filter CBF. We then design a novel data structure,
invertible CBF ICBF, which represents a multiset using
a vector of cells. Each cell contains two fields, {\tt
id} and {\tt count}, which record the identifiers and
number of elements mapped into them, respectively.
Given two multisets, based on the encoding results, the
ICBF can execute the dedicated subtracting and decoding
operations to recognize the different elements and
differences in the multiplicities of elements between
the two multisets. We conduct comprehensive experiments
to evaluate and compare the three dedicated multiset
synchronization approaches proposed in this paper. The
evaluation results indicate that the ICBF-based
approach outperforms the other two approaches in terms
of synchronization accuracy, time-consumption, and
communication overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ambrosin:2017:LTC,
author = "Moreno Ambrosin and Mauro Conti and Fabio {De Gaspari}
and Radha Poovendran",
title = "{LineSwitch}: Tackling Control Plane Saturation
Attacks in Software-Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1206--1219",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2626287",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software defined networking SDN is a new networking
paradigm that in recent years has revolutionized
network architectures. At its core, SDN separates the
data plane, which provides data forwarding
functionalities, and the control plane, which
implements the network control logic. The separation of
these two components provides a virtually centralized
point of control in the network, and at the same time
abstracts the complexity of the underlying physical
infrastructure. Unfortunately, while promising, the SDN
approach also introduces new attacks and
vulnerabilities. Indeed, previous research shows that,
under certain traffic conditions, the required
communication between the control and data plane can
result in a bottleneck. An attacker can exploit this
limitation to mount a new, network-wide, type of denial
of service attack, known as the control plane
saturation attack. This paper presents LineSwitch, an
efficient and effective data plane solution to tackle
the control plane saturation attack. LineSwitch employs
probabilistic proxying and blacklisting of network
traffic to prevent the attack from reaching the control
plane, and thus preserve network functionality. We
implemented LineSwitch as an extension of the reference
SDN implementation, OpenFlow, and run a thorough set of
experiments under different traffic and attack
scenarios. We compared LineSwitch to the state of the
art, and we show that it provides at the same time, the
same level of protection against the control plane
saturation attack, and a reduced time overhead by up to
30\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2017:ISA,
author = "Zuqing Zhu and Xiahe Liu and Yixiang Wang and Wei Lu
and Long Gong and Shui Yu and Nirwan Ansari",
title = "Impairment- and Splitting-Aware Cloud-Ready Multicast
Provisioning in Elastic Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1220--1234",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2615942",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is known that multicast provisioning is important
for supporting cloud-based applications, and as the
traffics from these applications are increasing
quickly, we may rely on optical networks to realize
high-throughput multicast. Meanwhile, the flexible-grid
elastic optical networks EONs achieve agile access to
the massive bandwidth in optical fibers, and hence can
provision variable bandwidths to adapt to the dynamic
demands from the cloud-based applications. In this
paper, we consider all-optical multicast in EONs in a
practical manner and focus on designing impairment- and
splitting-aware multicast provisioning schemes. We
first study the procedure of adaptive modulation
selection for a light-tree, and point out that the
multicast scheme in EONs is fundamentally different
from that in the fixed-grid wavelength-division
multiplexing networks. Then, we formulate the problem
of impairment- and splitting-aware routing, modulation
and spectrum assignment ISa-RMSA for all-optical
multicast in EONs and analyze its hardness. Next, we
analyze the advantages brought by the flexibility of
routing structures and discuss the ISa-RMSA schemes
based on light-trees and light-forests. This paper
suggests that for ISa-RMSA, the light-forest-based
approach can use less bandwidth than the
light-tree-based one, while still satisfying the
quality of transmission requirement. Therefore, we
establish the minimum light-forest problem for
optimizing a light-forest in ISa-RMSA. Finally, we
design several time-efficient ISa-RMSA algorithms, and
prove that one of them can solve the minimum
light-forest problem with a fixed approximation
ratio.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2017:BHS,
author = "Huichen Dai and Jianyuan Lu and Yi Wang and Tian Pan
and Bin Liu",
title = "{BFAST}: High-Speed and Memory-Efficient Approach for
{NDN} Forwarding Engine",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1235--1248",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2623379",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Named data networking NDN is a future Internet
architecture that directly emphasizes accessible
content by assigning each piece of content a unique
name. Data transmission in NDN is realized via
name-based routing and forwarding. Name-based
forwarding information base FIB usually has much more
and longer prefixes than IP-based ones, and therefore,
name-based forwarding brings more challenges on the NDN
router in terms of high forwarding throughput, low
memory consumption, and fast FIB update. In this paper,
we present an index data structure called BFAST for the
name-based FIB. BFAST is designed based on a basic hash
table, it employs a counting Bloom filter to balance
the load among hash table slots, so that the number of
items in each non-empty slot is close to 1, leading to
low searching time in each slot. Meanwhile, the
first-rank-indexed scheme is proposed to effectively
reduce the massive memory consumption required by the
pointers in all the hash table slots. Evaluation
results show that, for the longest prefix match FIB
lookup, BFAST achieves a speed of 2.14 MS/S using one
thread, and meanwhile, the memory consumption is
reasonably low. By leveraging the parallelism of
today's multi-core CPU, BFAST arrives at an FIB lookup
speed of 33.64 MS/S using 24 threads, and the latency
is around 0.71 $ m u $ s.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:CTS,
author = "Min Chen and Shigang Chen and Zhiping Cai",
title = "{Counter Tree}: a Scalable Counter Architecture for
Per-Flow Traffic Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1249--1262",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2621159",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Per-flow traffic measurement, which is to count the
number of packets for each active flow during a certain
measurement period, has many applications in traffic
engineering, classification of routing distribution or
network usage pattern, service provision, anomaly
detection, and network forensics. In order to keep up
with the high throughput of modern routers or switches,
the online module for per-flow traffic measurement
should use high-bandwidth SRAM that allows fast memory
accesses. Due to limited SRAM space, exact counting,
which requires to keep a counter for each flow, does
not scale to large networks consisting of numerous
flows. Some recent work takes a different approach to
estimate the flow sizes using counter architectures
that can fit into tight SRAM. However, existing counter
architectures have limitations, either still requiring
considerable SRAM space or having a small estimation
range. In this paper, we design a scalable counter
architecture called Counter Tree, which leverages a 2-D
counter sharing scheme to achieve far better memory
efficiency and in the meantime extend estimation range
significantly. Furthermore, we improve the performance
of Counter Tree by adding a status bit to each counter.
Extensive experiments with real network traces
demonstrate that our counter architecture can produce
accurate estimates for flows of all sizes under very
tight memory space.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jaumard:2017:ESU,
author = "Brigitte Jaumard and Maryam Daryalal",
title = "Efficient Spectrum Utilization in Large Scale {RWA}
Problems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1263--1278",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2628838",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "While the routing and wavelength assignment RWA has
been widely studied, a very few studies attempt to
solve realistic size instances, namely, with 100
wavelengths per fiber and a few hundred nodes. Indeed,
state of the art is closer to around 20 nodes and 30
wavelengths, regardless of what the authors consider,
heuristics or exact methods with a very few exceptions.
In this paper, we are interested in reducing the gap
between realistic data sets and test bed instances that
are often used, using exact methods. Even if exact
methods may fail to solve in reasonable time very large
instances, they can, however, output $ \varepsilon $
-solutions with a very good and proven accuracy. The
novelty of this paper is to exploit the observations
that optimal solutions contain a very large number of
light paths associated with shortest paths or $k$
-shortest paths with a small $k$. We propose different
RWA algorithms that lead to solve exactly or near
exactly much larger instances than in the literature,
i.e., with up to 150 wavelengths and 90 nodes.
Extensive numerical experiments are conducted on both
the static and dynamic incremental planning RWA
problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2017:SRR,
author = "Kangwook Lee and Ramtin Pedarsani and Kannan
Ramchandran",
title = "On Scheduling Redundant Requests With Cancellation
Overheads",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "1279--1290",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2622248",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reducing latency in distributed computing and data
storage systems is gaining increasing importance.
Several empirical works have reported on the efficacy
of scheduling redundant requests in such systems. That
is, one may reduce job latency by: 1 scheduling the
same job at more than one server and 2 waiting only
until the fastest of them responds. Several theoretical
models have been proposed to explain the power of using
redundant requests, and all of the existing results
rely heavily on a common assumption: all redundant
requests of a job can be immediately cancelled as soon
as one of them is completed. We study how one should
schedule redundant requests when such assumption does
not hold. This is of great importance in practice,
since cancellation of running jobs typically incurs
non-negligible delays. In order to bridge the gap
between the existing models and practice, we propose a
new queueing model that captures such cancellation
delays. We then find how one can schedule redundant
requests to achieve the optimal average job latency
under the new model. Our results show that even with a
small cancellation overhead, the actual optimal
scheduling policy differs significantly from the
optimal scheduling policy when the overhead is zero.
Furthermore, we study optimal dynamic scheduling
policies, which appropriately schedule redundant
requests based on the number of jobs in the system. Our
analysis reveals that for the two-server case, the
optimal dynamic scheduler can achieve 7\%--16\% lower
average job latency, compared with the optimal static
scheduler.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Voskoboynik:2017:NCS,
author = "Niv Voskoboynik and Haim H. Permuter and Asaf Cohen",
title = "Network Coding Schemes for Data Exchange Networks With
Arbitrary Transmission Delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1293--1309",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2619721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we introduce construction techniques
for network coding in bidirectional networks with
arbitrary transmission delays. These coding schemes
reduce the number of transmissions and achieve the
optimal rate region in the corresponding broadcast
model for both multiple unicast and multicast cases
with up to three users, under the equal rate
constraint. The coding schemes are presented in two
phases; first, coding schemes for line, star and
line-star topologies with arbitrary transmission delays
are provided and second, any general topology with
multiple bidirectional unicast and multicast sessions
is shown to be decomposable into these canonical
topologies to reduce the number of transmissions. As a
result, the coding schemes developed for the line,
star, and line-star topologies serve as building blocks
for the construction of more general coding schemes for
all networks. The proposed schemes are proved to be
real time in the sense that they achieve the minimum
decoding delay. With a negligible size header, these
coding schemes are shown to be applicable to
unsynchronized networks, i.e., networks with arbitrary
transmission delays. Finally, we demonstrate the
applicability of these schemes by extensive
simulations. The implementation of such coding schemes
on a wireless network with arbitrary transmission
delays can improve performance and power efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DOro:2017:OPA,
author = "Salvatore D'Oro and Eylem Ekici and Sergio Palazzo",
title = "Optimal Power Allocation and Scheduling Under Jamming
Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1310--1323",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2622002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider a jammed wireless scenario
where a network operator aims to schedule users to
maximize network performance while guaranteeing a
minimum performance level to each user. We consider the
case where no information about the position and the
triggering threshold of the jammer is available. We
show that the network performance maximization problem
can be modeled as a finite-horizon joint power control
and user scheduling problem, which is NP-hard. To find
the optimal solution of the problem, we exploit dynamic
programming techniques. We show that the obtained
problem can be decomposed, i.e., the power control
problem and the user scheduling problem can be
sequentially solved at each slot. We investigate the
impact of uncertainty on the achievable performance of
the system and we show that such uncertainty leads to
the well-known exploration-exploitation tradeoff. Due
to the high complexity of the optimal solution, we
introduce an approximation algorithm by exploiting
state aggregation techniques. We also propose a
performance-aware online greedy algorithm to provide a
low-complexity sub-optimal solution to the joint power
control and user scheduling problem under minimum
quality-of-service requirements. The efficiency of both
solutions is evaluated through extensive simulations,
and our results show that the proposed solutions
outperform other traditional scheduling policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ren:2017:CDP,
author = "Runtian Ren and Xueyan Tang and Yusen Li and Wentong
Cai",
title = "Competitiveness of Dynamic Bin Packing for Online
Cloud Server Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1324--1331",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2630052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cloud-based systems often face the problem of
dispatching a stream of jobs to run on cloud servers in
an online manner. Each job has a size that defines the
resource demand for running the job. Each job is
assigned to run on a cloud server upon its arrival and
the job departs after it completes. The departure time
of a job, however, is not known at the time of its
arrival. Each cloud server has a fixed resource
capacity and the total resource demand of all the jobs
running on a server cannot exceed its capacity at all
times. The objective of job dispatching is to minimize
the total cost of the servers used, where the cost of
renting each cloud server is proportional to its
running hours by ``pay-as-you-go'' billing. The above
job dispatching problem can be modeled as a variant of
the dynamic bin packing DBP problem known as
MinUsageTime DBP. In this paper, we study the
competitiveness bounds of MinUsageTime DBP. We
establish an improved lower bound on the competitive
ratio of Any Fit family of packing algorithms, and a
new upper bound of $ \mu + 3 $ on the competitive ratio
of the commonly used First Fit packing algorithm, where
$ \mu $ is the max/min job duration ratio. Our result
significantly reduces the gap between the upper and
lower bounds for the MinUsageTime DBP problem to a
constant value independent of $ \mu $, and shows that
First Fit packing is near optimal for MinUsageTime
DBP.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rottenstreich:2017:PPS,
author = "Ori Rottenstreich and Mario {Di Francesco} and Yoram
Revah",
title = "Perfectly Periodic Scheduling of Collective Data
Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1332--1346",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2629092",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the problem of scheduling a
single resource to handle requests for time-sensitive
periodic services i.e., data streams jointly realizing
a distributed application. We specifically consider the
case, where the demand of each data stream is expressed
as a weight relative to a network-wide cyclic schedule.
Within this context, we consider the problem of
minimizing the schedule length while satisfying the
perfect periodicity constraints: the service intervals
for the same data stream are fixed and each data stream
is cyclically served exactly as many times as its
demand. This problem is challenging, as serving a data
stream in one time slot might enforce serving it at
some specific time slots in the future. As a result,
most of the existing solutions have relaxed either the
periodicity or the demand constraints of the data
streams. In contrast, we study the strict enforcement
of both requirements through perfectly periodic
schedules. We show that the considered problem is
NP-hard and address special cases for which optimal
schedules can be derived. We further discuss the more
generic instance of the problem represented by an
arbitrary number of data streams and demands.
Specifically, we provide an approximation algorithm and
an efficient greedy solution for such a general case of
arbitrary weights. We conduct extensive simulations to
evaluate the performance of the proposed solutions.
Finally, we show that it is possible to relax the input
demands to improve the communication performance at the
cost of some other overhead e.g., in terms of energy
consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2017:TMR,
author = "Wei Gong and Jiangchuan Liu and Kebin Liu and Yunhao
Liu",
title = "Toward More Rigorous and Practical Cardinality
Estimation for Large-Scale {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1347--1358",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2634551",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cardinality estimation is one of the fundamental
problems in large-scale radio frequency identification
systems. While many efforts have been made to achieve
faster approximate counting, the accuracy of estimates
itself has not received enough attention. Specifically,
most state-of-the-art schemes share a two-phase
paradigm implicitly or explicitly, which needs a rough
estimate first and then refines it to a final estimate
meeting the desired accuracy; we observe that the final
estimate can largely deviate from the expectation due
to the skewed rough estimate, i.e., the accuracy of
final estimates is not rigorously bounded. This
negative impact is hidden because former solutions
either assume perfect rough estimates or rough
estimates that can be produced by uniform random data
or perfect hash functions that can turn any data into
uniform random data. Unfortunately, both of them are
hard to meet in practice. To address the above issues,
we propose a novel scheme, namely, ``rigorous and
practical cardinality RPC'' estimation. RPC adopts the
two-phase paradigm, in which the rough estimate is
derived in the first phase using pairwise-independent
hashing. In the second phase, we employ
$t$-wise-independent hashing to reinforce the rough
estimate to meet arbitrary accuracy requirements. We
validate the effectiveness and performance of RPC
through theoretical analysis and extensive simulations.
The results show that the RPC can meet the desired
accuracy all the time with diverse practical settings
while previous designs fail with non-uniform data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Iosifidis:2017:DSC,
author = "George Iosifidis and Iordanis Koutsopoulos and
Georgios Smaragdakis",
title = "Distributed Storage Control Algorithms for Dynamic
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1359--1372",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2633370",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent technological advances have rendered storage a
readily available resource, yet there exist few
examples that use it for enhancing network performance.
We revisit in-network storage and we evaluate its usage
as an additional degree of freedom in network
optimization. We consider the network design problem of
maximizing the volume of end-to-end transferred data
and we derive storage allocation placement solutions.
We show that different storage placements have
different impact on the performance of the network and
we introduce a systematic methodology for the
derivation of the optimal one. Accordingly, we provide
a framework for the joint optimization of routing and
storage control usage in dynamic networks for the case
of a single commodity transfer. The derived policies
are based on time-expanded graphs and ensure maximum
performance improvement with minimum possible storage
usage. We also study the respective multiple commodity
problem, where the network link capacities and node
storage resources are shared by the different
commodities. A key advantage of our methodology is that
it employs algorithms that are applicable to both
centralized as well as to distributed execution in an
asynchronous fashion, and thus, no tight
synchronization is required among the various involved
storage and routing devices in an operational network.
We also present an extensive performance evaluation
study using the backbone topology and actual traffic
traces from a large European Internet Service Provider,
and a number of synthetic network topologies. Our
results show that indeed our approach offers
significant improvements in terms of delivery time and
transferred traffic volume.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gharakheili:2017:EFS,
author = "Hassan Habibi Gharakheili and Vijay Sivaraman and Tim
Moors and Arun Vishwanath and John Matthews and Craig
Russell",
title = "Enabling Fast and Slow Lanes for Content Providers
Using Software Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1373--1385",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2627005",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Residential broadband consumption is growing rapidly,
increasing the gap between Internet service provider
ISP costs and revenues. Meanwhile, proliferation of
Internet-enabled devices is congesting access networks,
degrading end-user experience, and affecting content
provider monetization. In this paper, we propose a new
model whereby the content provider explicitly signals
fast- and slow-lane requirements to the ISP on a
per-flow basis, using open APIs supported through
software defined networking SDN. Our first contribution
is to develop an architecture that supports this model,
presenting arguments on why this benefits consumers
better user experience, ISPs two-sided revenue, and
content providers fine-grained control over peering
arrangement. Our second contribution is to evaluate our
proposal using a real trace of over 10 million flows to
show that video flow quality degradation can be nearly
eliminated by the use of dynamic fast-lanes, and
web-page load times can be hugely improved by the use
of slow-lanes for bulk transfers. Our third
contribution is to develop a fully functional prototype
of our system using open-source SDN components Openflow
switches and POX controller modules and instrumented
video/file-transfer servers to demonstrate the
feasibility and performance benefits of our approach.
Our proposal is a first step towards the long-term goal
of realizing open and agile access network service
quality management that is acceptable to users, ISPs,
and content providers alike.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Iosifidis:2017:EFC,
author = "George Iosifidis and Lin Gao and Jianwei Huang and
Leandros Tassiulas",
title = "Efficient and Fair Collaborative Mobile {Internet}
Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1386--1400",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2638939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The surging global mobile data traffic challenges the
economic viability of cellular networks and calls for
innovative solutions to reduce the network congestion
and improve user experience. In this context,
user-provided networks UPNs, where mobile users share
their Internet access by exploiting their diverse
network resources and needs, turn out to be very
promising. Heterogeneous users with advanced handheld
devices can form connections in a distributed fashion
and unleash dormant network resources at the network
edge. However, the success of such services heavily
depends on users' willingness to contribute their
resources, such as network access and device battery
energy. In this paper, we introduce a general framework
for UPN services and design a bargaining-based
distributed incentive mechanism to ensure users'
participation. The proposed mechanism determines the
resources that each user should contribute in order to
maximize the aggregate data rate in UPN, and fairly
allocate the benefit among the users. The numerical
results verify that the service can always improve
users' performance, and such improvement increases with
the diversity of the users' resources. Quantitatively,
it can reach an average 30\% increase of the total
served traffic for a typical scenario even with only
six mobile users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:FAF,
author = "Shu Wang and Vignesh Venkateswaran and Xinyu Zhang",
title = "Fundamental Analysis of Full-Duplex Gains in Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1401--1416",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2633563",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Full-duplex radio technology is becoming mature and
holds potential to boost the spectrum efficiency of a
point-to-point wireless link. However, a fundamental
understanding is still lacking, with respect to its
advantages over half-duplex in multi-cell wireless
networks with contending links. In this paper, we
establish a spatial stochastic framework to analyze the
mean network throughput gain from full duplex, and
pinpoint the key factors that determine the gain. Our
framework extends classical stochastic geometry
analysis with a new tool set, which allows us to model
a tradeoff between the benefit from concurrent
full-duplex transmissions and the loss of spatial
reuse, particularly for CSMA-based transmitters with
random backoff. We analytically derive closed-form
expressions for the full-duplex gain as a function of
link distance, interference range, network density, and
carrier sensing schemes. It can be easily applied to
guide the deployment choices in the early stage of
network planning.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DiFrancesco:2017:SAS,
author = "Paolo {Di Francesco} and Jacek Kibilda and Francesco
Malandrino and Nicholas J. Kaminski and Luiz A.
DaSilva",
title = "Sensitivity Analysis on Service-Driven Network
Planning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1417--1430",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2633417",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Service providers are expected to play an increasingly
central role in the mobile market and their
relationship with the traditional mobile network
operators MNOs is starting to change. The dilemma faced
by over-the-top service-providers OTTs is now whether
to enter into a service level agreement with the MNOs
in the same spirit of mobile virtual network operator
agreements or to invest in deploying their own network
infrastructure to serve their demand. The purpose of
this paper is to study the factors shaping the
agreements between OTTs and MNOs and how these factors
impact network planning decisions. To this end, we
build a synthetic model of cellular network deployment
that explores how traditional mobile operators and OTTs
compete in deploying new infrastructure. Using our
model in conjunction with real-world data, we find that
service-driven networks are heavily influenced by
regulatory decisions, and that cost structures and
demand characteristics play non-marginal roles in the
definition of service-driven networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2017:EMN,
author = "Zizhong Cao and Shivendra S. Panwar and Murali
Kodialam and T. V. Lakshman",
title = "Enhancing Mobile Networks With Software Defined
Networking and Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1431--1444",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2638463",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the past decade, mobile devices and applications
have experienced an explosive growth, and users are
expecting higher data rates and better quality services
every year. In this paper, we propose several ideas to
increase the functionality and capacity of wireless
networks using software-defined networking SDN and
cloud computing technologies. Connections between users
and services in mobile networks typically have to pass
through a required set of middleboxes. The complex
routing is one of the major impetus for the SDN
paradigm, which enables flexible policy-aware routing
in the next generation mobile networks. In addition,
the high costs of middleboxes and limited capabilities
of mobile devices call for revolutionary virtualization
technologies enabled by cloud computing. Based on
these, we consider an online routing problem for mobile
networks with SDN and cloud computing. In this problem,
connection requests are given one at a time as in a
real mobile system, and the objective is to steer
traffic flows to maximize the total amount of traffic
accepted over time, subject to capacity, budget,
policy, and quality of service constraints. A fast
log-competitive approximation algorithm is developed
based on time-dependent duals.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:PAR,
author = "You-Chiun Wang and Tzung-Yu Tsai",
title = "A Pricing-Aware Resource Scheduling Framework for
{LTE} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1445--1458",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2629501",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Long term evolution LTE is a standard widely used in
cellular networks today. Both resource scheduling and
pricing are two critical issues. However, existing
studies address them separately, making the goals of
improving system performance and increasing operator
revenue conflicting. This paper proposes a
pricing-aware resource scheduling PARS framework to
conquer this conflict. It classifies users into three
levels and has scheduling and pricing modules, which
are installed in a base station and the core network of
LTE, respectively. The scheduling module uses
three-layer schedulers to assign resource to a flow by
considering its packet delay, traffic amount, channel
condition, and user level. The pricing module uses
price elasticity of demand in economics to adaptively
adjust the amount of money charged to users. Through
experiments by LTE-Sim, we show that PARS achieves a
good balance between performance and revenue, and
provides quality of service for the flows with strict
delay concerns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dao:2017:TUC,
author = "Tuan A. Dao and Indrajeet Singh and Harsha V.
Madhyastha and Srikanth V. Krishnamurthy and Guohong
Cao and Prasant Mohapatra",
title = "{TIDE}: a User-Centric Tool for Identifying Energy
Hungry Applications on {Smartphones}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1459--1474",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2639061",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today, many smartphone users are unaware of what
applications apps they should stop using to prevent
their battery from running out quickly. The problem is
identifying such apps is hard due to the fact that
there exist hundreds of thousands of apps and their
impact on the battery is not well understood. We show
via extensive measurement studies that the impact of an
app on battery consumption depends on both
environmental wireless factors and usage patterns.
Based on this, we argue that there exists a critical
need for a tool that allows a user to: 1 identify apps
that are energy hungry and 2 understand why an app is
consuming energy, on her phone. Toward addressing this
need, we present TIDE, a tool to detect high energy
apps on any particular smartphone. TIDE's key
characteristic is that it accounts for usage-centric
information while identifying energy hungry apps from
among a multitude of apps that run simultaneously on a
user's phone. Our evaluation of TIDE on a test bed of
Android-based smartphones, using week-long smartphone
usage traces from 17 real users, shows that TIDE
correctly identifies over 94\% of energy-hungry apps
and has a false positive rate of {$<$} 6\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:LAA,
author = "Min Chen and Shigang Chen and Yuguang Fang",
title = "Lightweight Anonymous Authentication Protocols for
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1475--1488",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2631517",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio-frequency identification RFID technologies are
making their way into retail products, library books,
debit cards, passports, driver licenses, car plates,
medical devices, and so on. The widespread use of tags
in traditional ways of deployment raises a privacy
concern: they make their carriers trackable. To protect
the privacy of the tag carriers, we need to invent new
mechanisms that keep the usefulness of tags while doing
so anonymously. Many tag applications, such as toll
payment, require authentication. This paper studies the
problem of anonymous authentication. Since low-cost
tags have extremely limited hardware resource, we
propose an asymmetric design principle that pushes most
complexity to more powerful RFID readers. With this
principle, we develop a lightweight technique that
generates dynamic tokens for anonymous authentication.
Instead of implementing complicated and
hardware-intensive cryptographic hash functions, our
authentication protocol only requires tags to perform
several simple and hardware-efficient operations such
as bitwise XOR, one-bit left circular shift, and bit
flip. The theoretical analysis and randomness tests
demonstrate that our protocol can ensure the privacy of
the tags. Moreover, our protocol reduces the
communication overhead and online computation overhead
to $ O1 $ per authentication for both tags and readers,
which compares favorably with the prior art.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aoudia:2017:GFM,
author = "Faycal Ait Aoudia and Matthieu Gautier and Michele
Magno and Olivier Berder and Luca Benini",
title = "A Generic Framework for Modeling {MAC} Protocols in
Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1489--1500",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2631642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks are employed in many
applications, such as health care, environmental
sensing, and industrial monitoring. An important
research issue is the design of efficient medium access
control MAC protocols, which have an essential role for
the reliability, latency, throughput, and energy
efficiency of communication, especially as
communication is typically one of the most energy
consuming tasks. Therefore, analytical models providing
a clear understanding of the fundamental limitations of
the different MAC schemes, as well as convenient way to
investigate their performance and optimize their
parameters, are required. In this paper, we propose a
generic framework for modeling MAC protocols, which
focuses on energy consumption, latency, and
reliability. The framework is based on absorbing Markov
chains, and can be used to compare different schemes
and evaluate new approaches. The different steps
required to model a specific MAC using the proposed
framework are illustrated through a study case.
Moreover, to exemplify how the proposed framework can
be used to evaluate new MAC paradigms, evaluation of
the novel pure-asynchronous approach, enabled by
emerging ultra-low-power wake-up receivers, is done
using the proposed framework. Experimental measurements
on real hardware were performed to set framework
parameters with accurate energy consumption and latency
values, to validate the framework, and to support our
results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bhowmik:2017:HPP,
author = "Sukanya Bhowmik and Muhammad Adnan Tariq and Boris
Koldehofe and Frank Durr and Thomas Kohler and Kurt
Rothermel",
title = "High Performance {Publish\slash} Subscribe Middleware
in Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1501--1516",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2632970",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing popularity of software-defined
networking SDN, ternary content-addressable memory of
switches can be directly accessed by a
publish/subscribe middleware to perform filtering
operations at low latency. In this way, three important
requirements for a publish/subscribe middleware can be
fulfilled, namely, bandwidth efficiency, line-rate
performance, and low latency in forwarding messages
between producers and consumers. Nevertheless, it is
challenging to sustain line-rate performance in the
presence of dynamically changing interests of producers
and consumers. In this paper, we realize a scalable,
SDN-based publish/subscribe middleware, called PLEROMA,
that performs efficient forwarding at line-rate.
Moreover, PLEROMA offers methods to efficiently
reconfigure a deployed topology in the presence of
dynamic subscriptions and advertisements. We evaluate
the performance of both the data plane and the control
plane of PLEROMA to support our claim. Furthermore, we
evaluate and benchmark the performances of
SDN-compliant hardware and software switches in the
context of our middleware.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Houmansadr:2017:SSW,
author = "Amir Houmansadr and Wenxuan Zhou and Matthew Caesar
and Nikita Borisov",
title = "{SWEET}: Serving the {Web} by Exploiting Email
Tunnels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1517--1527",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2640238",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Open communications over the Internet pose serious
threats to countries with repressive regimes, leading
them to develop and deploy censorship mechanisms within
their networks. Unfortunately, existing censorship
circumvention systems do not provide high availability
guarantees to their users, as censors can easily
identify, hence disrupt, the traffic belonging to these
systems using today's advanced censorship technologies.
In this paper, we propose Serving the Web by Exploiting
Email Tunnels SWEET, a highly available
censorship-resistant infrastructure. SWEET works by
encapsulating a censored user's traffic inside email
messages that are carried over public email services
like Gmail and Yahoo Mail. As the operation of SWEET is
not bound to any specific email provider, we argue that
a censor will need to block email communications all
together in order to disrupt SWEET, which is unlikely
as email constitutes an important part of today's
Internet. Through experiments with a prototype of our
system, we find that SWEET's performance is sufficient
for Web browsing. In particular, regular Websites are
downloaded within couple of seconds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ouyang:2017:LOH,
author = "Wenzhuo Ouyang and Jingwen Bai and Ashutosh
Sabharwal",
title = "Leveraging One-Hop Information in Massive {MIMO}
Full-Duplex Wireless Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1528--1539",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2648878",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a single-cell massive multiple input
multiple output full-duplex wireless communication
system, where the base-station BS is equipped with a
large number of antennas. We consider the setup where
the single-antenna mobile users operate in half-duplex,
while each antenna at the BS is capable of full-duplex
transmissions, i.e., it can transmit and receive
simultaneously using the same frequency spectrum. The
fundamental challenge in this system is intra-cell
inter-node interference, generated by the transmissions
of uplink users to the receptions at the downlink
users. The key operational challenge is estimating and
aggregating inter-mobile channel estimates, which can
potentially overwhelm any gains from full-duplex
operation. In this paper, we propose a scalable and
distributed scheme to optimally manage the inter-node
interference by utilizing a ``one-hop information
architecture''. In this architecture, the BS only needs
to know the signal-to-interference-plus-noise ratio
from the downlink users. Each uplink user needs its own
SINR, along with a weighted signal-plus-noise metric
from its one-hop neighboring downlink users, which are
the downlink users, that it interferes with. The
proposed one-hop information architecture does not
require any network devices to comprehensively gather
the vast inter-node interference channel knowledge, and
hence significantly reduces the overhead. Based on the
one-hop information architecture, we design a
distributed power control algorithm and implement such
architecture using overheard feedback information. We
show that, in typical asymptotic regimes with many
users and antennas, the proposed distributed power
control scheme improves the overall network utility and
reduces the transmission power of the uplink users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Papanikos:2017:DBR,
author = "Nikolaos Papanikos and Evangelos Papapetrou",
title = "Deterministic Broadcasting and Random Linear Network
Coding in Mobile Ad Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1540--1554",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2641680",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding has been successfully used in the past
for efficient broadcasting in wireless multi-hop
networks. Two coding approaches are suitable for mobile
networks; random linear network coding RLNC and
XOR-based coding. In this paper, we focus on the
problem of multiple source broadcasting in mobile ad
hoc networks. We make the observation that RLNC
provides increased resilience to packet losses compared
with XOR-based coding. We develop an analytical model
that justifies our intuition. However, the model also
reveals that combining RLNC with probabilistic
forwarding, which is the approach taken in the
literature, may significantly impact RLNC's
performance. Therefore, we take the novel approach to
combine RLNC with a deterministic broadcasting
algorithm in order to prune transmissions. More
specifically, we propose a connected dominating
set-based algorithm that works in synergy with RLNC on
the ``packet generation level.'' Since managing packet
generations is a key issue in RLNC, we propose a
distributed scheme, which is also suitable for mobile
environments and does not compromise the coding
efficiency. We show that the proposed algorithm
outperforms XOR-based as well as RLNC-based schemes
even when global knowledge is used for managing packet
generations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:APS,
author = "Chang-Heng Wang and Tara Javidi",
title = "Adaptive Policies for Scheduling With Reconfiguration
Delay: an End-to-End Solution for All-Optical Data
Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1555--1568",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2644617",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "All-optical switching networks have been considered a
promising candidate for the next generation data center
networks thanks to its scalability in data bandwidth
and power efficiency. However, the bufferless nature
and the nonzero reconfiguration delay of optical
switches remain great challenges in deploying
all-optical networks. This paper considers the
end-to-end scheduling for all-optical data center
networks with no in-network buffer and nonzero
reconfiguration delay. A framework is proposed to deal
with the nonzero reconfiguration delay. The proposed
approach constructs an adaptive variant of any given
scheduling policy. It is shown that if a scheduling
policy guarantees its schedules to have schedule
weights close to the MaxWeight schedule and thus is
throughput optimal in the zero reconfiguration regime,
then the throughput optimality is inherited by its
adaptive variant in any nonzero reconfiguration delay
regime. As a corollary, a class of adaptive variants of
the well-known MaxWeight policy is shown to achieve
throughput optimality without prior knowledge of the
traffic load. Furthermore, through numerical
simulations, the simplest such policy, namely, the
Adaptive MaxWeight, is shown to exhibit better delay
performance than all prior work.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ou:2017:CSP,
author = "Jiajue Ou and Mo Li and Yuanqing Zheng",
title = "Come and Be Served: Parallel Decoding for {COTS RFID}
Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1569--1581",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2645232",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Current commodity RFID systems incur high
communication overhead due to severe tag-to-tag
collisions. Although some recent works have been
proposed to support parallel decoding for concurrent
tag transmissions, they require accurate channel
measurements, tight tag synchronization, or
modifications to standard RFID tag operations. In this
paper, we present BiGroup, a novel RFID communication
paradigm that allows the reader to decode the collision
from multiple commodity-off-the-shelf COTS RFID tags in
one communication round. In BiGroup, COTS tags can
directly join ongoing communication sessions and get
decoded in parallel. The collision resolution
intelligence is solely put at the reader side. To this
end, BiGroup examines the tag collisions at RFID
physical layer from constellation domain as well as
time domain, exploits the under-utilized channel
capacity due to low tag transmission rate, and
leverages tag diversities. We implement BiGroup with
USRP N210 software radio that is able to read and
decode multiple concurrent transmissions from COTS
passive tags. Our experimental study gives encouraging
results that BiGroup greatly improves RFID
communication efficiency, i.e., 11 times performance
improvement compared with the alternative decoding
scheme for COTS tags.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tune:2017:CST,
author = "Paul Tune and Matthew Roughan",
title = "Controlled Synthesis of Traffic Matrices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1582--1592",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2639066",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The traffic matrix TM is a chief input in many network
design and planning applications. In this paper, we
propose a model, called the spherically additive noise
model SANM. In conjunction with iterative proportional
fitting IPF, it enables fast generation of synthetic
TMs around a predicted TM. We analyze SANM and IPF's
action on the model to show theoretical guarantees on
asymptotic convergence, in particular, convergence to
the well-known gravity model.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Papadogiannaki:2017:ESP,
author = "Eva Papadogiannaki and Lazaros Koromilas and Giorgos
Vasiliadis and Sotiris Ioannidis",
title = "Efficient Software Packet Processing on Heterogeneous
and Asymmetric Hardware Architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1593--1606",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2642338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Heterogeneous and asymmetric computing systems are
composed by a set of different processing units, each
with its own unique performance and energy
characteristics. Still, the majority of current network
packet processing frameworks targets only a single
device the CPU or some accelerator, leaving the rest
processing resources unused and idle. In this paper, we
propose an adaptive scheduling approach that supports
the heterogeneous and asymmetric hardware, tailored for
network packet processing applications. Our scheduler
is able to respond quickly to dynamic performance
fluctuations that occur at real time, such as traffic
bursts, application overloads, and system changes. The
experimental results show that our system is able to
match the peak throughput of a diverse set of packet
processing applications, while consuming up to $ 3.5
\times $ less energy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:ISF,
author = "Min Chen and Shigang Chen and You Zhou and Youlin
Zhang",
title = "Identifying State-Free Networked Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1607--1620",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2638862",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional radio frequency identification RFID
technologies allow tags to communicate with a reader
but not among themselves. By enabling peer
communications between nearby tags, the emerging
networked tags represent a fundamental enhancement to
today's RFID systems. They support applications in
previously infeasible scenarios where the readers
cannot cover all tags due to cost or physical
limitations. This paper is the first study on
identifying state-free networked tags, which is a
basic, fundamental function for most tagged systems. To
prolong the lifetime of networked tags and make
identification protocols scalable to large systems,
energy efficiency and time efficiency are most
critical. Our investigation reveals that the
traditional contention-based protocol design will incur
too much energy overhead in multihop tag systems.
Surprisingly, a reader-coordinated design that
serializes tag transmissions performs much better. In
addition, we show that load balancing is important in
reducing the worst case energy cost to the tags, and we
present a solution based on serial numbers. We also
show that, by leveraging the request aggregation and
transmission pipelining techniques, the time efficiency
of serialized ID collection can be greatly improved.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kotnis:2017:ICS,
author = "Bhushan Kotnis and Albert Sunny and Joy Kuri",
title = "Incentivized Campaigning in Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1621--1634",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2645281",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Campaigners, advertisers, and activists are
increasingly turning to social recommendation
mechanisms, provided by social media, for promoting
their products, services, brands, and even ideas.
However, many a time, such social network-based
campaigns perform poorly in practice, because the
intensity of recommendations drastically reduces beyond
a few hops from the source. A natural strategy for
maintaining the intensity is to provide incentives. In
this paper, we address the problem of minimizing the
cost incurred by the campaigner for incentivizing a
fraction of individuals in the social network, while
ensuring that the campaign message reaches a given
expected fraction of individuals. We also address the
dual problem of maximizing the campaign penetration for
a resource constrained campaigner. To help us
understand and solve the above-mentioned problems, we
use percolation theory to formally state them as
optimization problems. These problems are not amenable
to traditional approaches because of a fixed point
equation that needs to be solved numerically. However,
we use results from reliability theory to establish
some key properties of the fixed point, which in turn
enables us to solve these problems using algorithms
that are linearithmic in maximum node degree.
Furthermore, we evaluate the efficacy of the analytical
solutions by performing simulations on 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{Dehghan:2017:COR,
author = "Mostafa Dehghan and Bo Jiang and Anand Seetharam and
Ting He and Theodoros Salonidis and Jim Kurose and Don
Towsley and Ramesh Sitaraman",
title = "On the Complexity of Optimal Request Routing and
Content Caching in Heterogeneous Cache Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1635--1648",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2636843",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In-network content caching has been deployed in both
the Internet and cellular networks to reduce
content-access delay. We investigate the problem of
developing optimal joint routing and caching policies
in a network supporting in-network caching with the
goal of minimizing expected content-access delay. Here,
needed content can either be accessed directly from a
back-end server where content resides permanently or be
obtained from one of multiple in-network caches. To
access content, users must thus decide whether to route
their requests to a cache or to the back-end server. In
addition, caches must decide which content to cache. We
investigate two variants of the problem, where the
paths to the back-end server can be considered as
either congestion-sensitive or congestion-insensitive,
reflecting whether or not the delay experienced by a
request sent to the back-end server depends on the
request load, respectively. We show that the problem of
optimal joint caching and routing is NP-complete in
both cases. We prove that under the
congestion-insensitive delay model, the problem can be
solved optimally in polynomial time if each piece of
content is requested by only one user, or when there
are at most two caches in the network. We also identify
the structural property of the user-cache graph that
makes the problem NP-complete. For the
congestion-sensitive delay model, we prove that the
problem remains NP-complete even if there is only one
cache in the network and each content is requested by
only one user. We show that approximate solutions can
be found for both cases within a $ 1 - 1 / e $ factor
from the optimal, and demonstrate a greedy solution
that is numerically shown to be within 1\% of optimal
for small problem sizes. Through trace-driven
simulations, we evaluate the performance of our greedy
solutions to joint caching and routing, which show up
to 50\% reduction in average delay over the solution of
optimized routing to least recently used caches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vissicchio:2017:SUH,
author = "Stefano Vissicchio and Laurent Vanbever and Luca
Cittadini and Geoffrey G. Xie and Olivier Bonaventure",
title = "Safe Update of Hybrid {SDN} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1649--1662",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2642586",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The support for safe network updates, i.e., live
modification of device behavior without service
disruption, is a critical primitive for current and
future networks. Several techniques have been proposed
by previous works to implement such a primitive.
Unfortunately, existing techniques are not generally
applicable to any network architecture, and typically
require high overhead e.g., additional memory to
guarantee strong consistency i.e., traversal of either
initial or final paths, but never a mix of them during
the update. In this paper, we deeply study the problem
of computing operational sequences to safely and
quickly update arbitrary networks. We characterize
cases, for which this computation is easy, and revisit
previous algorithmic contributions in the new light of
our theoretical findings. We also propose and
thoroughly evaluate a generic sequence-computation
approach, based on two new algorithms that we combine
to overcome limitations of prior proposals. Our
approach always finds an operational sequence that
provably guarantees strong consistency throughout the
update, with very limited overhead. Moreover, it can be
applied to update networks running any combination of
centralized and distributed control-planes, including
different families of IGPs, OpenFlow or other SDN
protocols, and hybrid SDN networks. Our approach
therefore supports a large set of use cases, ranging
from traffic engineering in IGP-only or SDN-only
networks to incremental SDN roll-out and advanced
requirements e.g., per-flow path selection or dynamic
network function virtualization in partial SDN
deployments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:SWF,
author = "Wei Wang and Yingjie Chen and Lu Wang and Qian Zhang",
title = "{Sampleless Wi-Fi}: Bringing Low Power to {Wi-Fi}
Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1663--1672",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2643160",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The high sampling rate in Wi-Fi is set to support
bandwidth-hungry applications. It becomes energy
inefficient in the post-PC era in which the emerging
low-end smart devices increase the disparity in
workloads. Recent advances scale down the receiver's
sampling rates by leveraging the redundancy in the
physical layer, which, however, requires packet
modifications or very high signal-to-noise ratio. To
overcome these limitations, we propose Sampleless
Wi-Fi, a standard compatible solution that allows
energy-constrained devices to scale down their sampling
rates regardless of channel conditions. Inspired by
rateless codes, Sampleless Wi-Fi recovers under-sampled
packets by accumulating redundancy in packet
retransmissions. To harvest the diversity gain as
rateless codes without modifying legacy packets,
Sampleless Wi-Fi creates new constellation diversity by
exploiting the time shift effect at receivers. Our
evaluation using GNURadio/USRP platform and real Wi-Fi
traces has demonstrated that Sampleless Wi-Fi
significantly outperforms the state-of-the-art
downclocking technique in both decoding performance and
energy efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:NSL,
author = "Zhili Zhou and Tachun Lin and Krishnaiyan Thulasiraman
and Guoliang Xue",
title = "Novel Survivable Logical Topology Routing by Logical
Protecting Spanning Trees in {IP}-Over-{WDM} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1673--1685",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2639362",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The survivable logical topology mapping routing
problem in IP-over-wavelength-division multiplexing
networks is to map each link in the logical topology IP
layer onto a lightpath in the physical topology optical
layer, such that failure of a physical link does not
cause the logical topology to become disconnected. In
this paper, we propose a novel approach based on the
concept of protecting spanning tree set of the logical
topology. We present necessary and sufficient
conditions based on this concept and study three
optimization problems with varying degrees of
difficulty. We study a generalized logical routing
problem with the objective to protect the logical
topology against maximal number of physical link
failures. The new problem aims to find a survivable
routing if one exists, or achieve maximal protection of
physical link failures otherwise. We also show that the
problem is equivalent to the minimum dominating set
problem in bipartite graphs. We discuss how one can use
the column generation technique to speed up the
execution of this formulation, which obviates the need
to find all spanning trees at the beginning of the
execution of this formulation. In addition, we also
present which has several nice features a heuristic
approach, which incorporates a method to augment the
logical topology with additional links to guarantee a
survivable routing, which only requires a shortest path
algorithm and an algorithm to generate an appropriate
spanning tree. We provide the results of extensive
simulations conducted to evaluate our formulations and
demonstrate the effectiveness of our new approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2017:CEI,
author = "Fan Wu and Dongxin Liu and Zhihao Wu and Yuan Zhang
and Guihai Chen",
title = "Cost-Efficient Indoor White Space Exploration Through
Compressive Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1686--1702",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2651116",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Exploring the utilization of white spaces vacant VHF
and UHF TV channels is a promising way to satisfy the
rapidly growing radio frequency RF demand. Although a
few white space exploration methods have been proposed
in the past few years, they mainly focused on outdoor
scenarios. In this paper, we propose a novel
cost-efficient indoor white space exploration method by
exploiting the location dependence and channel
dependence of TV spectrum in indoor environments. We
first measure the UHF TV channels in a building, and
study the spatial and spectral features of indoor white
spaces. Then, we design a cost-eFficient Indoor White
space EXploration FIWEX mechanism based on the
extracted features. Furthermore, we build a prototype
of FIWEX and extensively evaluate its performance in
real-world environments. The evaluation results show
that FIWEX can identify 30.0\% more indoor white spaces
with 51.2\% less false alarms compared with the best
known existing solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2017:SGU,
author = "Xiaowen Gong and Xu Chen and Kai Xing and Dong-Hoon
Shin and Mengyuan Zhang and Junshan Zhang",
title = "From Social Group Utility Maximization to Personalized
Location Privacy in Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1703--1716",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2653102",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With increasing popularity of location-based services
LBSs, there have also been growing concerns for
location privacy. To protect location privacy in an
LBS, mobile users in physical proximity can work in
concert to collectively change their pseudonyms, in
order to hide spatial-temporal correlation in their
location traces. In this paper, we leverage mobile
users' social tie structure to motivate them to
participate in pseudonym change. Drawing on a social
group utility maximization framework, we cast users'
decision making of whether to change pseudonyms as a
socially aware pseudonym change game SA-PCG. The SA-PCG
further assumes a general anonymity model that allows a
user to have its specific anonymity set for
personalized location privacy. For the SA-PCG, we show
that there exists a socially aware Nash equilibrium
SNE, and quantify the system efficiency of SNEs with
respect to the optimal social welfare. Then, we develop
a greedy algorithm that myopically determines users'
strategies, based on the social group utility derived
from only the users whose strategies have already been
determined. We show that this algorithm efficiently
finds an SNE that enjoys desirable properties: 1 it is
socially aware coalition-proof, and thus is also
Pareto-optimal; 2 it achieves higher social welfare
than any SNE for the socially oblivious pseudonym
change game. We further quantify the system efficiency
of this SNE with respect to the optimal social welfare.
We also show that this SNE can be achieved in a
distributed manner. Numerical results using real data
corroborate that social welfare can be significantly
improved by exploiting social ties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ba:2017:DSB,
author = "Seydou Ba and Bijoy Chand Chatterjee and Eiji Oki",
title = "Defragmentation Scheme Based on Exchanging Primary and
Backup Paths in $ 1 + 1 $ Path Protected Elastic
Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1717--1731",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2650212",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In elastic optical networks EONs, a major obstacle to
using the spectrum resources efficiently is the
spectrum fragmentation. In the literature, several
defragmentation approaches have been presented. For 1+1
path protection, conventional defragmentation
approaches consider designated primary and backup
paths. This exposes the spectrum to fragmentations
induced by the primary lightpaths, which are not to be
disturbed in order to achieve hitless defragmentation.
This paper proposes a defragmentation scheme using path
exchanging in 1+1 path protected EONs. We exchange the
path function of the 1+1 protection with the primary
toggling to the backup state, while the backup becomes
the primary. This allows both lightpaths to be
reallocated during the defragmentation process, while
they work as backup, offering hitless defragmentation.
Considering path exchanging, we define a static
spectrum reallocation optimization problem that
minimizes the spectrum fragmentation while limiting the
number of path exchanging and reallocation operations.
We then formulate the problem as an integer linear
programming ILP problem. We prove that a decision
version of the defined static reallocation problem is
NP-complete. We present a spectrum defragmentation
process for dynamic traffic, and introduce a heuristic
algorithm for the case that the ILP problem is not
tractable. The simulation results show that the
proposed scheme outperforms the conventional one and
improves the total admissible traffic up to 10\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2017:REM,
author = "Ting He and Athanasios Gkelias and Liang Ma and Kin K.
Leung and Ananthram Swami and Don Towsley",
title = "Robust and Efficient Monitor Placement for Network
Tomography in Dynamic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1732--1745",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2642185",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of placing the minimum number
of monitors in a dynamic network to identify additive
link metrics from path metrics measured along
cycle-free paths between monitors. Our goal is robust
monitor placement, i.e., the same set of monitors can
maintain network identifiability under topology
changes. Our main contribution is a set of monitor
placement algorithms with different
performance-complexity tradeoffs that can
simultaneously identify multiple topologies occurring
during the network lifetime. In particular, we show
that the optimal monitor placement is the solution to a
generalized hitting set problem, for which we provide a
polynomial-time algorithm to construct the input and a
greedy algorithm to select the monitors with
logarithmic approximation. Although the optimal
placement is NP-hard in general, we identify
non-trivial special cases that can be solved
efficiently. Our secondary contribution is a dynamic
triconnected decomposition algorithm to compute the
input needed by the monitor placement algorithms, which
is the first such algorithm that can handle edge
deletions. Our evaluations on mobility-induced dynamic
topologies verify the efficiency and the 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{Cui:2017:SDC,
author = "Yong Cui and Jian Song and Kui Ren and Minming Li and
Zongpeng Li and Qingmei Ren and Yangjun Zhang",
title = "Software Defined Cooperative Offloading for Mobile
Cloudlets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1746--1760",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2650964",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Device to Device communication enables the deployment
of mobile cloudlets in LTE-advanced networks. The
distributed nature of mobile users and dynamic task
arrivals makes it challenging to schedule tasks fairly
among multiple devices. Leveraging the idea of software
defined networking, we propose a software defined
cooperative offloading model SDCOM, where the SDCOM
controller is deployed at the PDN gateway and schedules
tasks in a centralized manner to save the energy of
mobile devices and reduce the traffic on access links.
We formulate the minimum-energy task scheduling problem
as a 0-1 knapsack problem and prove its NP-hardness. To
compute the optimal solution as a benchmark, we design
the conditioned optimal algorithm based on the
aggregated analysis of energy consumption. The greedy
algorithm with a polynominal-time complexity is
proposed to solve large-scale problems efficiently. To
address the problem without predicting future
information on task arrivals, we further design an
online task scheduling algorithm OTS. It can minimize
the energy consumption arbitrarily close to the optimal
solution by appropriately setting the tradeoff
coefficient. Moreover, we extend OTS to design a
proportional fair online task scheduling algorithm to
achieve the fair energy consumption among mobile
devices. Extensive trace-based simulations demonstrate
the effectiveness of SDCOM for a variety of typical
mobile devices and applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2017:SNI,
author = "Chuchu Wu and Mario Gerla and Mihaela van der Schaar",
title = "Social Norm Incentives for Network Coding in
{Manets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1761--1774",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2656059",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The performance of mobile ad hoc network transmissions
subject to disruption, loss, interference, and jamming
can be significantly improved with the use of network
coding NC. However, NC requires extra work for
forwarders, including additional bandwidth consumption
due to transmitting overheads for redundant NC packets
and additional processing due to generating the NC
packets. Selfish forwarders may prefer to simply
forward packets without coding them to avoid such
overhead. This is especially true when network coding
must be protected from pollution attacks, which
involves additional, often processor intensive,
pollution detection procedures. To drive selfish nodes
to cooperate and encode the packets, this paper
introduces social norm-based incentives. The social
norm consists of a social strategy and a reputation
system with reward and punishment connected with node
behavior. Packet coding and forwarding are modeled and
formalized as a repeated NC forwarding game. The
conditions for the sustainability or compliance of the
social norm are identified, and a sustainable social
norm that maximizes the social utility is designed via
selecting the optimal design parameters, including the
social strategy, reputation threshold, reputation
update frequency, and the generation size of network
coding. For this game, the impacts of packet loss rate
and transmission patterns on performance are evaluated,
and their impacts on the decision of selecting the
optimal social norm are discussed. Finally, practical
issues, including distributed reputation dissemination
and the existence of altruistic and malicious users,
are discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Johnston:2017:CPW,
author = "Matthew Johnston and Eytan Modiano",
title = "Controller Placement in Wireless Networks With Delayed
{CSI}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1775--1788",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2651808",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the impact of delayed state information on
the performance of centralized wireless scheduling
algorithms. Since state updates must be collected from
throughout the network, they are inevitably delayed,
and this delay is proportional to the distance of each
respective node to the controller. In this paper, we
analyze the optimal controller placement resulting from
this delayed state information. We propose a dynamic
controller placement framework, in which the controller
is relocated using delayed queue length information at
each node, and transmissions are scheduled based on
channel and queue length information. We characterize
the throughput region under such policies, and find a
policy that stabilizes the system for all arrival rates
within the throughput region.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2017:TPS,
author = "Jun Zhao",
title = "Topological Properties of Secure Wireless Sensor
Networks Under the $q$-Composite Key Predistribution
Scheme With Unreliable Links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1789--1802",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2653109",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Security is an important issue in wireless sensor
networks WSNs, which are often deployed in hostile
environments. The $q$ -composite key predistribution
scheme has been recognized as a suitable approach to
secure WSNs. Although the $q$ -composite scheme has
received much attention in the literature, there is
still a lack of rigorous analysis for secure WSNs
operating under the $q$ -composite scheme in
consideration of the unreliability of links. One main
difficulty lies in analyzing the network topology,
whose links are not independent. Wireless links can be
unreliable in practice due to the presence of physical
barriers between sensors or because of harsh
environmental conditions severely impairing
communications. In this paper, we resolve the difficult
challenge and investigate topological properties
related to node degree in WSNs operating under the $q$
-composite scheme with unreliable communication links
modeled as independent ON/OFF channels. Specifically,
we derive the asymptotically exact probability for the
property of minimum degree being at least $k$, present
the asymptotic probability distribution for the minimum
degree, and demonstrate that the number of nodes with a
fixed degree is in distribution asymptotically
equivalent to a Poisson random variable. We further use
the theoretical results to provide useful design
guidelines for secure WSNs. Experimental results also
confirm the validity of our analytical findings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2017:ECD,
author = "Tuo Shi and Siyao Cheng and Zhipeng Cai and Yingshu Li
and Jianzhong Li",
title = "Exploring Connected Dominating Sets in Energy Harvest
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1803--1817",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2657688",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Duty-cycle scheduling is an effective way to balance
energy consumptions and prolong network lifetime of
wireless sensor networks WSNs, which usually requires a
connected dominating set CDS to guarantee network
connectivity and coverage. Therefore, the problem of
finding the largest number of CDSs is important for
WSNs. The previous works always assume all the nodes
are non-rechargeable. However, WSNs are now taking
advantages of rechargeable nodes to become energy
harvest networks EHNs. To find the largest number of
CDSs then becomes completely different. This is the
first work to investigate, how to identify the largest
number of CDSs in EHNs to prolong network lifetime. The
investigated novel problems are proved to be
NP-Complete and we propose four approximate algorithms,
accordingly. Both the solid theoretical analysis and
the extensive simulations are performed to evaluate our
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ceselli:2017:MEC,
author = "Alberto Ceselli and Marco Premoli and Stefano Secci",
title = "Mobile Edge Cloud Network Design Optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1818--1831",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2652850",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Major interest is currently given to the integration
of clusters of virtualization servers, also referred to
as \lq cloudlets' or \lq edge clouds', into the access
network to allow higher performance and reliability in
the access to mobile edge computing services. We tackle
the edge cloud network design problem for mobile access
networks. The model is such that the virtual machines
VMs are associated with mobile users and are allocated
to cloudlets. Designing an edge cloud network implies
first determining where to install cloudlet facilities
among the available sites, then assigning sets of
access points, such as base stations to cloudlets,
while supporting VM orchestration and considering
partial user mobility information, as well as the
satisfaction of service-level agreements. We present
link-path formulations supported by heuristics to
compute solutions in reasonable time. We qualify the
advantage in considering mobility for both users and
VMs as up to 20\% less users not satisfied in their SLA
with a little increase of opened facilities. We compare
two VM mobility modes, bulk and live migration, as a
function of mobile cloud service requirements,
determining that a high preference should be given to
live migration, while bulk migrations seem to be a
feasible alternative on delay-stringent tiny-disk
services, such as augmented reality support, and only
with further relaxation on network constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2017:SGE,
author = "Xueqing Huang and Tao Han and Nirwan Ansari",
title = "Smart Grid Enabled Mobile Networks: Jointly Optimizing
{BS} Operation and Power Distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1832--1845",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2655462",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the development of green energy technologies,
base stations BSs can be readily powered by green
energy in order to reduce the on-grid power
consumption, and subsequently reduce the carbon
footprints. As smart grid advances, power trading among
distributed power generators and energy consumers will
be enabled. In this paper, we investigate the
optimization of smart grid-enabled mobile networks, in
which green energy is generated in individual BSs and
can be shared among the BSs. In order to minimize the
on-grid power consumption of this network, we propose
to jointly optimize the BS operation and the power
distribution. The joint BS operation and power
distribution optimization BPO problem is challenging
due to the complex coupling of the optimization of
mobile networks and that of the power grid. We propose
an approximate solution that decomposes the BPO problem
into two subproblems and solves the BPO by addressing
these subproblems. The simulation results show that by
jointly optimizing the BS operation and the power
distribution, the network achieves about 18\% on-grid
power savings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kang:2017:ACN,
author = "Nanxi Kang and Ori Rottenstreich and Sanjay G. Rao and
Jennifer Rexford",
title = "Alpaca: Compact Network Policies With
Attribute-Encoded Addresses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1846--1860",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2657123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In enterprise networks, policies e.g., QoS or security
are often defined based on the categorization of hosts
along dimensions, such as the organizational role of
the host faculty versus student and department
engineering versus sales. While current best practices
virtual local area networks help when hosts are
categorized along a single dimension, policy may often
need to be expressed along multiple orthogonal
dimensions. In this paper, we make three contributions.
First, we argue for attribute-encoded IPs ACIPs, where
the IP address allocation process in enterprises
considers attributes of a host along all policy
dimensions. ACIPs enable flexible policy specification
in a manner that may not otherwise be feasible owing to
the limited size of switch rule-tables. Second, we
present Alpaca, algorithms for realizing ACIPs under
practical constraints of limited-length IP addresses.
Our algorithms can be applied to different switch
architectures, and we provide bounds on their
performance. Third, we demonstrate the importance and
viability of ACIPs on data collected from real campus
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2017:IDT,
author = "Hongli Xu and Xiang-Yang Li and Liusheng Huang and Hou
Deng and He Huang and Haibo Wang",
title = "Incremental Deployment and Throughput Maximization
Routing for a Hybrid {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1861--1875",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2657643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To explore the advantages of software defined network
SDN, while preserving the legacy networking systems, a
natural deployment strategy is to deploy a hybrid SDN
incrementally to improve the network performance. In
this paper, we address two technical challenges: an
incremental deployment strategy and a
throughput-maximization routing, for deploying a hybrid
network incrementally. For incremental deployment, we
propose a heuristic algorithm for deploying a hybrid
SDN under the budget constraint, and prove the
approximate factor of $ 1 - \frac {1}{e} $. For
throughput-maximization routing, we apply a
depth-first-search method and a randomized rounding
mechanism to solve the multi-commodity $h$ -splittable
flow routing problem in a hybrid SDN, where $ h \ge 1$.
We also prove that our method has approximation ratio $
O \left {\frac {1}{\log N}} \right $, where $N$ is the
number of links in a hybrid SDN. We then show, by both
analysis and simulations, that our algorithms can
obtain significant performance gains and perform better
than the theoretical worst-case bound. For example, our
incremental deployment scheme helps to enhance the
throughout about 40\% compared with the previous
deployment scheme by deploying a small number of SDN
devices, and the proposed routing algorithm can improve
the throughput about 31\% compared with ECMP in hybrid
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pokhrel:2017:AMM,
author = "Shiva Raj Pokhrel and Manoj Panda and Hai L. Vu",
title = "Analytical Modeling of Multipath {TCP} Over Last-Mile
Wireless",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1876--1891",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2663524",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop a comprehensive analytical model for
multiple long-lived multipath Transmission Control
Protocol TCP connections downloading content from a
remote server in the Internet using parallel paths with
Wi-Fi and cellular last-miles. This is the first
analytical model developed in the literature that
captures the coupling between the paths through
heterogeneous wireless networks where the coupling
arises due to the multipath TCP coupled congestion
control protocol. The model also takes into account the
impact of the shared nature of the wireless medium and
the finite access point AP buffer in the Wi-Fi
last-mile. The accuracy of the proposed model is
demonstrated via extensive ns-2 simulations.
Furthermore, we discover a new type of throughput
unfairness among the competing regular and multipath
TCP connections going through the same AP with a
droptail buffer; the regular TCP connections
essentially steal almost all the Wi-Fi bandwidth away
from the multipath TCP connections. To tackle this
problem, we present two simple solutions utilizing our
analytical model and achieve fairness.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ge:2017:MRW,
author = "Mao Ge and Tong Ye and Tony T. Lee and Weisheng Hu",
title = "Multicast Routing and Wavelength Assignment in
{AWG}-Based {Clos} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1892--1909",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2659385",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In wavelength-division-multiplexing WDM switches, such
as arrayed-waveguide-grating AWG-based Clos networks,
the supporting of multicast traffic must rise to the
challenge of route and wavelength assignment RWA
problem. In this paper, we study the non-blocking
multicast RWA problem in two phases with respect to the
cascaded combination of an AWG-based broadcast Clos
network, called copy network, and a point-to-point
AWG-based Clos network. In phase one, input requests
generate broadcast trees in the copy network, and then
point-to-point connections are established in the
AWG-based Clos network in the second phase. The
Clos-type AWG-based multicast networks can be
constructed from modular AWGs of smaller sizes with the
purpose of minimizing the number of wavelengths
required and reducing the tuning range of the
wavelength selective converters WSCs. For solving the
multicast RWA problem, we extend the rank-based routing
algorithm for traditional space-division broadcast Clos
networks such that broadcast trees can also be
generated in the WDM copy network in a contention-free
manner. However, due to wavelength routing properties
of AWGs, the subset of requests input to each
subnetwork in the middle stage may not satisfy the
precondition of the rank-based RWA algorithm.
Nevertheless, we prove that this problem can be solved
by cyclically shifting the indices of wavelengths in
each subnetwork, which provides the key to recursively
route the multicast requests in a non-blocking and
contention-free manner in the decomposed AWG-based
broadcast Clos network. The time complexity of the
proposed multicast RWA algorithm is comparable to that
of an AWG-based unicast Clos network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2017:UCN,
author = "Kate Ching-Ju Lin and Wei-Liang Shen and Ming-Syan
Chen and Kun Tan",
title = "User-Centric Network {MIMO} With Dynamic Clustering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1910--1923",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2671742",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent advances have demonstrated the potential of
network MIMO netMIMO, which combines a practical number
of distributed antennas as a virtual netMIMO AP nAP to
improve spatial multiplexing of an WLAN. Existing
solutions, however, either simply cluster nearby
antennas as static nAPs, or dynamically cluster
antennas on a per-packet basis so as to maximize the
sum rate of the scheduled clients. To strike the
balance between the above two extremes, in this paper,
we present the design, implementation and evaluation of
FlexNEMO, a practical two-phase netMIMO clustering
system. Unlike previous per-packet clustering
approaches, FlexNEMO only clusters antennas when client
distribution and traffic pattern change, as a result
being more practical to be implemented. A medium access
control protocol customized for uplink transmissions is
then designed to allow the clients at the center of
nAPs to have a higher probability to gain uplink access
opportunities, but still ensure long-term fairness
among clients. By combining on-demand clustering and
priority-based access control, FlexNEMO not only
improves antenna utilization, but also optimizes the
channel condition for every individual client. We
evaluated our design via both test bed experiments on
USRPs and trace-driven emulations. The results
demonstrate that FlexNEMO can deliver 94.7\% and 93.7\%
throughput gains over static antenna clustering in a
4-antenna test bed and 16-antenna emulation,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiaraviglio:2017:LAI,
author = "Luca Chiaraviglio and Lavinia Amorosi and Paolo
DellOlmo and William Liu and Jairo A. Gutierrez and
Antonio Cianfrani and Marco Polverini and Esther {Le
Rouzic} and Marco Listanti",
title = "Lifetime-Aware {ISP} Networks: Optimal Formulation and
Solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1924--1937",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2665782",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a framework to manage the link lifetime in
an IP backbone network by exploiting the sleep mode SM.
In particular, when an SM feature is available, two
different effects coexist: 1 during the SM state, the
lifetime tends to be increased and 2 however, when the
link changes its power state from SM to full power or
vice-versa, the lifetime tends to be decreased. We,
therefore, define an optimal formulation of the
lifetime-aware network problem. Moreover, we propose a
heuristic, called Acceleration Factor Algorithm, to
practically manage the device lifetime. We solve the
problem both optimally and with our heuristic,
considering two representative case studies. Results
show that our approach outperforms the previous
energy-aware algorithms, which instead do not consider
the lifetime decrease triggered by the power state
change. Thus, we argue that a lifetime-aware network
management should be pursued when deciding to set an SM
state for each device in an Internet Service Provider
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:TRF,
author = "Guo Chen and Youjian Zhao and Hailiang Xu and Dan Pei
and Dan Li",
title = "{$ {\rm F}^2 $} Tree: Rapid Failure Recovery for
Routing in Production Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "1940--1953",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2672678",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Failures are not uncommon in production data center
networks DCNs nowadays. It takes long time for the DCN
routing to recover from a failure and find new
forwarding paths, significantly impacting realtime and
interactive applications at the upper layer. In this
paper, we present a fault-tolerant DCN solution, called
$ {\mathrm {F^2}} $ Tree, which is readily deployed in
existing DNCs. $ {\mathrm {F^2}} $ Tree can
significantly improve the failure recovery time only
through a small amount of link rewiring and switch
configuration changes. Through testbed and emulation
experiments, we show that $ {\mathrm {F^2}} $ Tree can
greatly reduce the routing recovery time after failure
by 78\% and improve the performance of upper layer
applications when routing failure happens 96\% less
deadline-missing requests.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bai:2017:PPI,
author = "Wei Bai and Li Chen and Kai Chen and Dongsu Han and
Chen Tian and Hao Wang",
title = "{PIAS}: Practical Information-Agnostic Flow Scheduling
for Commodity Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "1954--1967",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2669216",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many existing data center network DCN flow scheduling
schemes, that minimize flow completion times FCT assume
prior knowledge of flows and custom switch functions,
making them superior in performance but hard to
implement in practice. By contrast, we seek to minimize
FCT with no prior knowledge and existing commodity
switch hardware. To this end, we present PIAS, a DCN
flow scheduling mechanism that aims to minimize FCT by
mimicking shortest job first SJF on the premise that
flow size is not known a priori. At its heart, PIAS
leverages multiple priority queues available in
existing commodity switches to implement a multiple
level feedback queue, in which a PIAS flow is gradually
demoted from higher-priority queues to lower-priority
queues based on the number of bytes it has sent. As a
result, short flows are likely to be finished in the
first few high-priority queues and thus be prioritized
over long flows in general, which enables PIAS to
emulate SJF without knowing flow sizes beforehand. We
have implemented a PIAS prototype and evaluated PIAS
through both testbed experiments and ns-2 simulations.
We show that PIAS is readily deployable with commodity
switches and backward compatible with legacy TCP/IP
stacks. Our evaluation results show that PIAS
significantly outperforms existing information-agnostic
schemes, for example, it reduces FCT by up to 50\%
compared to DCTCP [11] and L2DCT [32]; and it only has
a 1.1\% performance gap to an ideal information-aware
scheme, pFabric [13], for short flows under a
production DCN workload.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Swamy:2017:ACU,
author = "Peruru Subrahmanya Swamy and Radha Krishna Ganti and
Krishna Jagannathan",
title = "Adaptive {CSMA} Under the {SINR} Model: Efficient
Approximation Algorithms for Throughput and Utility
Maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "1968--1981",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2674801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a carrier sense multiple access CSMA-based
scheduling algorithm for a single-hop wireless network
under a realistic signal-to-interference-plus-noise
ratio model for the interference. We propose two local
optimization-based approximation algorithms to
efficiently estimate certain attempt rate parameters of
CSMA called fugacities. It is known that adaptive CSMA
can achieve throughput optimality by sampling feasible
schedules from a Gibbs distribution, with appropriate
fugacities. Unfortunately, obtaining these optimal
fugacities is an NP-hard problem. Furthermore, the
existing adaptive CSMA algorithms use a stochastic
gradient descent-based method, which usually entails an
impractically slow exponential in the size of the
network convergence to the optimal fugacities. To
address this issue, we first propose an algorithm to
estimate the fugacities, that can support a given set
of desired service rates. The convergence rate and the
complexity of this algorithm are independent of the
network size, and depend only on the neighborhood size
of a link. Furthermore, we show that the proposed
algorithm corresponds exactly to performing the
well-known Bethe approximation to the underlying Gibbs
distribution. Then, we propose another local algorithm
to estimate the optimal fugacities under a utility
maximization framework, and characterize its accuracy.
Numerical results indicate that the proposed methods
have a good degree of accuracy, and achieve extremely
fast convergence to near-optimal fugacities, and often
outperform the convergence rate of the stochastic
gradient descent by a few orders of magnitude.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:OND,
author = "Lin Chen and Yong Li and Athanasios V. Vasilakos",
title = "On Oblivious Neighbor Discovery in Distributed
Wireless Networks With Directional Antennas:
Theoretical Foundation and Algorithm Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "1982--1993",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2673862",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Neighbor discovery, one of the most fundamental
bootstrapping networking primitives, is particularly
challenging in decentralized wireless networks where
devices have directional antennas. In this paper, we
study the following fundamental problem, which we term
oblivious neighbor discovery: How can neighbor nodes
with heterogeneous antenna configurations discover each
other within a bounded delay in a fully decentralised
manner without any prior coordination or
synchronisation? We establish a theoretical framework
on the oblivious neighbor discovery and the performance
bound of any neighbor discovery algorithm achieving
oblivious discovery. Guided by the theoretical results,
we then devise an oblivious neighbor discovery
algorithm, which achieves guaranteed oblivious
discovery with order-minimal worst case discovery delay
in the asynchronous and heterogeneous environment. We
further demonstrate how our algorithm can be configured
to achieve a desired tradeoff between average and worst
case performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2017:FFG,
author = "Liqiong Chang and Xiaojiang Chen and Yu Wang and
Dingyi Fang and Ju Wang and Tianzhang Xing and Zhanyong
Tang",
title = "{FitLoc}: Fine-Grained and Low-Cost Device-Free
Localization for Multiple Targets Over Various Areas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "1994--2007",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2669339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many emerging applications driven the fast development
of the device-free localization DfL technique, which
does not require the target to carry any wireless
devices. Most current DfL approaches have two main
drawbacks in practical applications. First, as the
pre-calibrated received signal strength RSS in each
location i.e., radio-map of a specific area cannot be
directly applied to the new areas, the manual
calibration for different areas will lead to a high
human effort cost. Second, a large number of RSS are
needed to accurately localize the targets, thus causes
a high communication cost and the areas variety will
further exacerbate this problem. This paper proposes
FitLoc, a fine-grained and low cost DfL approach that
can localize multiple targets over various areas,
especially in the outdoor environment and similar
furnitured indoor environment. FitLoc unifies the
radio-map over various areas through a rigorously
designed transfer scheme, thus greatly reduces the
human effort cost. Furthermore, benefiting from the
compressive sensing theory, FitLoc collects a few RSS
and performs a fine-grained localization, thus reduces
the communication cost. Theoretical analyses validate
the effectivity of the problem formulation and the
bound of localization error is provided. Extensive
experimental results illustrate the effectiveness and
robustness of FitLoc.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Eramo:2017:ASF,
author = "Vincenzo Eramo and Emanuele Miucci and Mostafa Ammar
and Francesco Giacinto Lavacca",
title = "An Approach for Service Function Chain Routing and
Virtual Function Network Instance Migration in Network
Function Virtualization Architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2008--2025",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2668470",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
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 = "Network function virtualization foresees the
virtualization of service functions and their execution
on virtual machines. Any service is represented by a
service function chain SFC that is a set of VNFs to be
executed according to a given order. The running of
VNFs needs the instantiation of VNF Instances VNFIs
that in general are software modules executed on
virtual machines. The virtualization challenges
include: 1 where to instantiate VNFIs; ii how many
resources to allocate to each VNFI; iii how to route
SFC requests to the appropriate VNFIs in the right
sequence; and iv when and how to migrate VNFIs in
response to changes to SFC request intensity and
location. We develop an approach that uses three
algorithms that are used back-to-back resulting in VNFI
placement, SFC routing, and VNFI migration in response
to changing workload. The objective is to first
minimize the rejection of SFC bandwidth and second to
consolidate VNFIs in as few servers as possible so as
to reduce the energy consumed. The proposed
consolidation algorithm is based on a migration policy
of VNFIs that considers the revenue loss due to QoS
degradation that a user suffers due to information loss
occurring during the migrations. The objective is to
minimize the total cost given by the energy consumption
and the revenue loss due to QoS degradation. We
evaluate our suite of algorithms on a test network and
show performance gains that can be achieved over using
other alternative naive algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qu:2017:MMC,
author = "Yuben Qu and Chao Dong and Haipeng Dai and Fan Wu and
Shaojie Tang and Hai Wang and Chang Tian",
title = "Multicast in Multihop {CRNs} Under Uncertain Spectrum
Availability: a Network Coding Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2026--2039",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2666788",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The benefits of network coding on multicast in
traditional multihop wireless networks have already
been extensively demonstrated in previous works.
However, most existing approaches cannot be directly
applied to multihop cognitive radio networks CRNs,
given the unpredictable primary user occupancy on
licensed channels. Specifically, due to the
unpredictable occupancy, the channel's available
bandwidth is time-varying and uncertain. Accordingly,
the capacity of the link using that channel is also
uncertain, which can significantly affect the network
coding subgraph optimization and may result in severe
throughput loss if not properly handled. In this paper,
we study the problem of network coding-based multicast
in multihop CRNs while considering the uncertain
spectrum availability. To capture the uncertainty of
spectrum availability, we first formulate our problem
as a chance-constrained program. Given the
computational intractability of the above-mentioned
program, we then transform the original problem into a
tractable convex optimization problem, through
appropriate Bernstein approximation with relaxation on
link scheduling. We further leverage Lagrangian
relaxation-based optimization techniques to propose an
efficient distributed algorithm for the original
problem. Extensive simulation results show that the
proposed algorithm achieves higher multicast rates,
compared with a state-of-the-art non-network coding
algorithm in multihop CRNs, and a conservative robust
network coding algorithm that treats the link capacity
as a constant value in the optimization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:CEN,
author = "Yiming Zhang and Dongsheng Li and Chuanxiong Guo and
Haitao Wu and Yongqiang Xiong and Xicheng Lu",
title = "{CubicRing}: Exploiting Network Proximity for
Distributed In-Memory Key-Value Store",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2040--2053",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2669215",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In-memory storage has the benefits of low I/O latency
and high I/O throughput. Fast failure recovery is
crucial for large-scale in-memory storage systems,
bringing network-related challenges, including false
detection due to transient network problems, traffic
congestion during the recovery, and top-of-rack switch
failures. In order to achieve fast failure recovery, in
this paper, we present CubicRing, a distributed
structure for cube-based networks, which exploits
network proximity to restrict failure detection and
recovery within the smallest possible one-hop range. We
leverage the CubicRing structure to address the
aforementioned challenges and design a network-aware
in-memory key-value store called MemCube. In a 64-node
10GbE testbed, MemCube recovers 48 GB of data for a
single server failure in 3.1 s. The 14 recovery servers
achieve 123.9 Gb/s aggregate recovery throughput, which
is 88.5\% of the ideal aggregate bandwidth and several
times faster than RAMCloud with the same
configurations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Monti:2017:HPN,
author = "Massimo Monti and Manolis Sifalakis and Christian F.
Tschudin and Marco Luise",
title = "On Hardware Programmable Network Dynamics With a
Chemistry-Inspired Abstraction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2054--2067",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2674690",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Chemical algorithms are statistical control algorithms
described and represented as chemical reaction
networks. They are analytically tractable, they
reinforce a deterministic state-to-dynamics relation,
they have configurable stability properties, and they
are directly implemented in state space using a
high-level visual representation. These properties make
them attractive solutions for traffic shaping and
generally the control of dynamics in computer networks.
In this paper, we present a framework for deploying
chemical algorithms on field programmable gate arrays.
Besides substantial computational acceleration, we
introduce a low-overhead approach for hardware-level
programmability and re-configurability of these
algorithms at runtime, and without service
interruption. We believe that this is a promising
approach for expanding the control-plane
programmability of software defined networks SDN, to
enable programmable network dynamics. To this end, the
simple high-level abstractions of chemical algorithms
offer an ideal northbound interface to the hardware,
aligned with other programming primitives of SDN e.g.,
flow rules.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lotfi:2017:EQS,
author = "Mohammad Hassan Lotfi and Karthikeyan Sundaresan and
Saswati Sarkar and Mohammad Ali Khojastepour",
title = "Economics of Quality Sponsored Data in Non-Neutral
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2068--2081",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2675626",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The growing demand for data has driven the service
providers SPs to provide differential treatment of
traffic to generate additional revenue streams from
content providers CPs. While SPs currently only provide
best-effort services to their CPs, it is plausible to
envision a model in near future, where CPs are willing
to sponsor quality of service for their content in
exchange of sharing a portion of their profit with SPs.
This quality sponsoring becomes invaluable especially
when the available resources are scarce, such as in
wireless networks, and can be accommodated in a
non-neutral network. In this paper, we consider the
problem of quality-sponsored data QSD in a non-neutral
network. In our model, SPs allow CPs to sponsor a
portion of their resources, and price it appropriately
to maximize their payoff. The payoff of the SP depends
on the monetary revenue and the satisfaction of
end-users both for the non-sponsored and sponsored
content, while CPs generate revenue through
advertisement. Note that in this setting, end-users
still pay for the data they use. We analyze the market
dynamics and equilibria in two different frameworks,
i.e., sequential and bargaining game frameworks, and
provide strategies for: 1 SPs --- to determine if and
how to price resources and 2 CPs --- to determine if
and what quality to sponsor. The frameworks
characterize different sets of equilibrium strategies
and market outcomes depending on the parameters of the
market.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2017:SAD,
author = "Bo Cheng and Ming Wang and Shuai Zhao and Zhongyi Zhai
and Da Zhu and Junliang Chen",
title = "Situation-Aware Dynamic Service Coordination in an
{IoT} Environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2082--2095",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2705239",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet of Things IoT infrastructure with
numerous diverse physical devices are growing up
rapidly, which need a dynamic services coordination
approach that can integrate those heterogeneous
physical devices into the context-aware IoT
infrastructure. This paper proposes a situation-aware
dynamic IoT services coordination approach. First,
focusing on the definition of formal situation event
pattern with event selection and consumption strategy,
an automaton-based situational event detection
algorithm is proposed. Second, the enhanced
event-condition-action is used to coordinate the IoT
services effectively, and also the collaboration
process decomposing algorithm and the rule mismatch
detection algorithms are proposed. Third, the typical
scenarios of IoT services coordination for smart
surgery process are also illustrated and the
measurement and analysis of the platform's performance
are reported. Finally, the conclusions and future works
are given.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:AAR,
author = "Daibo Liu and Zhichao Cao and Yi Zhang and Mengshu
Hou",
title = "Achieving Accurate and Real-Time Link Estimation for
Low Power Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2096--2109",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2682276",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Link estimation is a fundamental component of
forwarding protocols in wireless sensor networks. In
low power forwarding, however, the asynchronous nature
of widely adopted duty-cycled radio control brings new
challenges to achieve accurate and real-time
estimation. First, the repeatedly transmitted frames
called wake-up frame increase the complexity of
accurate statistic, especially with bursty channel
contention and coexistent interference. Second,
frequent update of every link status will soon exhaust
the limited energy supply. In this paper, we propose
meter, which is a distributed wake-up frame counter.
Meter takes the opportunities of link overhearing to
update link status in real time. Furthermore, meter
does not only depend on counting the successfully
decoded wake-up frames, but also counts the corrupted
ones by exploiting the feasibility of ZigBee
identification based on short-term sequence of the
received signal strength. We implement meter in TinyOS
and further evaluate the performance through extensive
experiments on indoor and outdoor test beds. The
results demonstrate that meter can significantly
improve the performance of the state-of-the-art link
estimation scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2017:PWF,
author = "Haoran Yu and Man Hon Cheung and Lin Gao and Jianwei
Huang",
title = "Public {Wi-Fi} Monetization via Advertising",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2110--2121",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2675944",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The proliferation of public Wi-Fi hotspots has brought
new business potentials for Wi-Fi networks, which carry
a significant amount of global mobile data traffic
today. In this paper, we propose a novel Wi-Fi
monetization model for venue owners VOs deploying
public Wi-Fi hotspots, where the VOs can generate
revenue by providing two different Wi-Fi access schemes
for mobile users MUs: 1 the premium access, in which
MUs directly pay VOs for their Wi-Fi usage, and 2 the
advertising sponsored access, in which MUs watch
advertisements in exchange of the free usage of Wi-Fi.
VOs sell their ad spaces to advertisers ADs via an ad
platform, and share the ADs' payments with the ad
platform. We formulate the economic interactions among
the ad platform, VOs, MUs, and ADs as a three-stage
Stackelberg game. In Stage I, the ad platform announces
its advertising revenue sharing policy. In Stage II,
VOs determine the Wi-Fi prices for MUs and advertising
prices for ADs. In Stage III, MUs make access choices
and ADs purchase advertising spaces. We analyze the
sub-game perfect equilibrium SPE of the proposed game
systematically, and our analysis shows the following
useful observations. First, the ad platform's
advertising revenue sharing policy in Stage I will
affect only the VOs' Wi-Fi prices but not the VOs'
advertising prices in Stage II. Second, both the VOs'
Wi-Fi prices and advertising prices are non-decreasing
in the advertising concentration level and
non-increasing in the MU visiting frequency. Numerical
results further show that the VOs are capable of
generating large revenues through mainly providing one
type of Wi-Fi access the premium access or advertising
sponsored access, depending on their advertising
concentration levels and MU visiting frequencies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shin:2017:CGI,
author = "Kyuyong Shin and Carlee Joe-Wong and Sangtae Ha and
Yung Yi and Injong Rhee and Douglas S. Reeves",
title = "{T-Chain}: a General Incentive Scheme for Cooperative
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2122--2137",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2685560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a simple, distributed, but
highly efficient fairness-enforcing incentive mechanism
for cooperative computing. The proposed mechanism,
called triangle chaining T-Chain, enforces reciprocity
to avoid the exploitable aspects of the schemes that
allow free-riding. In T-Chain, symmetric key
cryptography provides the basis for a lightweight,
almost-fair exchange protocol, which is coupled with a
pay-it-forward mechanism. This combination increases
the opportunity for multi-lateral exchanges and further
maximizes the resource utilization of participants,
each of whom is assumed to operate solely for his or
her own benefit. T-Chain also provides barrier-free
entry to newcomers with flexible resource allocation,
allowing them to immediately benefit, and, therefore,
is suitable for dynamic environments with high churn
i.e., turnover. T-Chain is distributed and simple to
implement, as no trusted third party is required to
monitor or enforce the scheme, nor is there any
reliance on reputation information or tokens.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2017:DSC,
author = "Dongxiao Yu and Li Ning and Yifei Zou and Jiguo Yu and
Xiuzhen Cheng and Francis C. M. Lau",
title = "Distributed Spanner Construction With Physical
Interference: Constant Stretch and Linear Sparseness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2138--2151",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2684831",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents the first distributed algorithm to
construct a spanner for arbitrary ad hoc networks under
the physical signal-to-interference-and-noise-ratio
SINR interference model. Spanner construction is one of
the most important techniques for topology control in
wireless networks, which intends to find a sparse
topology in which only a small number of links need to
be maintained, without substantially degrading the path
connecting any pair of the nodes in the network. Due to
the non-local property of interference, constructing a
spanner is challenging under the SINR model, especially
when a local distributed algorithm is desired. We meet
this challenge by proposing an efficient randomized
distributed algorithm that can construct a spanner in $
O \log n \log \Gamma $ timeslots with a high
probability, where $n$ is the total number of nodes and
$ \Gamma $ describes the ratio of the maximum distance
to the minimum distance between nodes. The constructed
spanner concurrently satisfies two most desirable
properties: constant stretch and linear sparseness. Our
algorithm employs a novel maximal independent set MIS
procedure as a subroutine, which is crucial in
achieving the time efficiency of spanner construction.
The MIS algorithm improves the best known result of $ O
\log^2 n$ [33] to $ O \log n$ and is of independent
interest as the algorithm is applicable also to many
other applications. We conduct simulations to verify
the proposed spanner construction algorithm, and the
results show that our algorithm also performs well in
realistic environments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fontugne:2017:SIT,
author = "Romain Fontugne and Patrice Abry and Kensuke Fukuda
and Darryl Veitch and Kenjiro Cho and Pierre Borgnat
and Herwig Wendt",
title = "Scaling in {Internet} Traffic: a 14 Year and 3 Day
Longitudinal Study, With Multiscale Analyses and Random
Projections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2152--2165",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2675450",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the mid 1990s, it was shown that the statistics of
aggregated time series from Internet traffic departed
from those of traditional short range-dependent models,
and were instead characterized by asymptotic
self-similarity. Following this seminal contribution,
over the years, many studies have investigated the
existence and form of scaling in Internet traffic. This
contribution first aims at presenting a methodology,
combining multiscale analysis wavelet and wavelet
leaders and random projections or sketches, permitting
a precise, efficient and robust characterization of
scaling, which is capable of seeing through
non-stationary anomalies. Second, we apply the
methodology to a data set spanning an unusually long
period: 14 years, from the MAWI traffic archive,
thereby allowing an in-depth longitudinal analysis of
the form, nature, and evolutions of scaling in Internet
traffic, as well as network mechanisms producing them.
We also study a separate three-day long trace to obtain
complementary insight into intra-day behavior. We find
that a biscaling two ranges of independent scaling
phenomena regime is systematically observed: long-range
dependence over the large scales, and multifractal-like
scaling over the fine scales. We quantify the actual
scaling ranges precisely, verify to high accuracy the
expected relationship between the long range dependent
parameter and the heavy tail parameter of the flow size
distribution, and relate fine scale multifractal
scaling to typical IP packet inter-arrival and to
round-trip time distributions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:OLA,
author = "Yang Liu and Mingyan Liu",
title = "An Online Learning Approach to Improving the Quality
of Crowd-Sourcing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2166--2179",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2680245",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a crowd-sourcing problem where in the
process of labeling massive data sets, multiple
labelers with unknown annotation quality must be
selected to perform the labeling task for each incoming
data sample or task, with the results aggregated using
for example simple or weighted majority voting rule. In
this paper, we approach this labeler selection problem
in an online learning framework, whereby the quality of
the labeling outcome by a specific set of labelers is
estimated so that the learning algorithm over time
learns to use the most effective combinations of
labelers. This type of online learning in some sense
falls under the family of multi-armed bandit MAB
problems, but with a distinct feature not commonly
seen: since the data is unlabeled to begin with and the
labelers' quality is unknown, their labeling outcome or
reward in the MAB context cannot be readily verified;
it can only be estimated against the crowd and be known
probabilistically. We design an efficient online
algorithm LS$_O$L using a simple majority voting rule
that can differentiate high and low quality labelers
over time, and is shown to have a regret with respect
to always using the optimal set of labelers of $ O
\log^2 T $ uniformly in time under mild assumptions on
the collective quality of the crowd, thus regret free
in the average sense. We discuss further performance
improvement by using a more sophisticated majority
voting rule, and show how to detect and filter out
``bad'' dishonest, malicious or very incompetent
labelers to further enhance the quality of
crowd-sourcing. Extension to the case when a labeler's
quality is task-type dependent is also discussed using
techniques from the literature on continuous arms. We
establish a lower bound on the order of $ O \log T D_2
T $, where $ D_2 T $ is an arbitrary function such that
$ D_2 T > O1 $. We further provide a matching upper
bound through a minor modification of the algorithm we
proposed and studied earlier on. We present numerical
results using both simulation and set of images labeled
by amazon mechanic turks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wei:2017:DCS,
author = "Xiaohan Wei and Michael J. Neely",
title = "Data Center Server Provision: Distributed Asynchronous
Control for Coupled Renewal Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2180--2194",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2693407",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
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 = "This paper considers a cost minimization problem for
data centers with $N$ servers and randomly arriving
service requests. A central router decides which server
to use for each new request. Each server has three
types of states active, idle, and setup with different
costs and time durations. The servers operate
asynchronously over their own states and can choose one
of multiple sleep modes when idle. We develop an online
distributed control algorithm so that each server makes
its own decisions. The request queues are bounded and
the overall time average cost is near optimal with
probability 1. First the algorithm does not need
probability information for the arrival rate or job
sizes. Finally, an improved algorithm that uses a
single queue is developed via a ``virtualization''
technique, which is shown to provide the same near
optimal costs. Simulation experiments on a real data
center traffic trace demonstrate the efficiency of our
algorithm compared with 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{Li:2017:LMS,
author = "Li and Ke Xu and Dan Wang and Chunyi Peng and Kai
Zheng and Rashid Mijumbi and Qingyang Xiao",
title = "A Longitudinal Measurement Study of {TCP} Performance
and Behavior in {3G\slash 4G} Networks Over High Speed
Rails",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2195--2208",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2689824",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "While TCP has been extensively studied in static and
low speed mobility situations, it has not yet been well
explored in high speed mobility scenarios. Given the
increasing deployment of high speed transport systems
such as high speed rails, there is an urgent need to
understand the performance and behavior of TCP in such
high speed mobility environments. In this paper, we
conduct a comprehensive study to investigate the
performance and behavior of TCP in a high speed
environment with a peak speed of 310 km/h. Over a
16-month period spanning four years, we collect 500 GB
of performance data on 3/4G networks in high speed
trains in China, covering a distance of 108,490 km. We
start by analyzing performance metrics, such as RTT,
packet loss rate, and throughput. We then evaluate the
challenges posed on the main TCP operations
establishment, transmission, congestion control, flow
control, and termination by such high speed mobility.
This paper shows that RTT and packet loss rate increase
significantly and throughput drops considerably in high
speed situations. Moreover, TCP fails to adapt well to
such extremely high speed leading to abnormal behavior,
such as high spurious retransmission time out rate,
aggressive congestion window reduction, long delays
during connection establishment and closure, and
transmission interruption. As we prepare to move into
the era of 5G, and as the need for high speed travel
continues to increase, our findings indicate a critical
need for efforts to develop more adaptive transport
protocols for such high speed environments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:ENR,
author = "Jianan Zhang and Eytan Modiano and David Hay",
title = "Enhancing Network Robustness via Shielding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2209--2222",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2689019",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider shielding critical links to enhance the
robustness of a network, in which shielded links are
resilient to failures. We first study the problem of
increasing network connectivity by shielding links that
belong to small cuts of a network, which improves the
network reliability under random link failures. We then
focus on the problem of shielding links to guarantee
network connectivity under geographical and general
failure models. We develop a mixed integer linear
program MILP to obtain the minimum cost shielding to
guarantee the connectivity of a single
source--destination pair under a general failure model,
and exploit geometric properties to decompose the
shielding problem under a geographical failure model.
We extend our MILP formulation to guarantee the
connectivity of the entire network, and use Benders
decomposition to significantly reduce the running time.
We also apply simulated annealing to obtain
near-optimal solutions in much shorter time. Finally,
we extend the algorithms to guarantee partial network
connectivity, and observe significant reduction in the
shielding cost, especially when the geographical
failure region is small.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2017:NAM,
author = "Xiaofeng Gao and Xudong Zhu and Jun Li and Fan Wu and
Guihai Chen and Ding-Zhu Du and Shaojie Tang",
title = "A Novel Approximation for Multi-Hop Connected
Clustering Problem in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2223--2234",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2690359",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks WSNs have been widely used in
a plenty of applications. To achieve higher efficiency
for data collection, WSNs are often partitioned into
several disjointed clusters, each with a representative
cluster head in charge of the data gathering and
routing process. Such a partition is balanced and
effective, if the distance between each node and its
cluster head can be bounded within a constant number of
hops, and any two cluster heads are connected. Finding
such a cluster partition with minimum number of
clusters and connectors between cluster heads is
defined as minimum connected $d$ -hop dominating set$d$
-MCDS problem, which is proved to be NP-complete. In
this paper, we propose a distributed approximation
named CS-Cluster to address the $d$ -MCDS problem under
unit disk graph. CS-Cluster constructs a sparser $d$
-hop maximal independent set $d$ -MIS, connects the $d$
-MIS, and finally checks and removes redundant nodes.
We prove the approximation ratio of CS-Cluster is $ 2 d
+ 1 \lambda $, where $ \lambda $ is a parameter related
with $d$ but is no more than 18.4. Compared with the
previous best result $ O d^2$, our approximation ratio
is a great improvement. Our evaluation results
demonstrate the outstanding performance of our
algorithm compared with previous works.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bartolini:2017:CSR,
author = "Novella Bartolini and Stefano Ciavarella and Thomas F.
{La Porta} and Simone Silvestri",
title = "On Critical Service Recovery After Massive Network
Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2235--2249",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2688330",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the problem of efficiently
restoring sufficient resources in a communications
network to support the demand of mission critical
services after a large-scale disruption. We give a
formulation of the problem as a mixed integer linear
programming and show that it is NP-hard. We propose a
polynomial time heuristic, called iterative split and
prune ISP that decomposes the original problem
recursively into smaller problems, until it determines
the set of network components to be restored. ISP's
decisions are guided by the use of a new notion of
demand-based centrality of nodes. We performed
extensive simulations by varying the topologies, the
demand intensity, the number of critical services, and
the disruption model. Compared with several greedy
approaches, ISP performs better in terms of total cost
of repaired components, and does not result in any
demand loss. It performs very close to the optimal when
the demand is low with respect to the supply network
capacities, thanks to the ability of the algorithm to
maximize sharing of repaired resources.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2017:JCT,
author = "Guiyuan Jiang and Siew-Kei Lam and Yidan Sun and Lijia
Tu and Jigang Wu",
title = "Joint Charging Tour Planning and Depot Positioning for
Wireless Sensor Networks Using Mobile Chargers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2250--2266",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2684159",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent breakthrough in wireless energy transfer
technology has enabled wireless sensor networks WSNs to
operate with zero-downtime through the use of mobile
energy chargers MCs, that periodically replenish the
energy supply of the sensor nodes. Due to the limited
battery capacity of the MCs, a significant number of
MCs and charging depots are required to guarantee
perpetual operations in large scale networks. Existing
methods for reducing the number of MCs and charging
depots treat the charging tour planning and depot
positioning problems separately even though they are
inter-dependent. This paper is the first to jointly
consider charging tour planning and MC depot
positioning for large-scale WSNs. The proposed method
solves the problem through the following three stages:
charging tour planning, candidate depot identification
and reduction, and depot deployment and charging tour
assignment. The proposed charging scheme also considers
the association between the MC charging cycle and the
operational lifetime of the sensor nodes, in order to
maximize the energy efficiency of the MCs. This
overcomes the limitations of existing approaches,
wherein MCs with small battery capacity ends up
charging sensor nodes more frequently than necessary,
while MCs with large battery capacity return to the
depots to replenish themselves before they have fully
transferred their energy to the sensor nodes. Compared
with existing approaches, the proposed method leads to
an average reduction in the number of MCs by 64\%, and
an average increase of 19.7 times on the ratio of total
charging time over total traveling time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gu:2017:WFB,
author = "Fei Gu and Jianwei Niu and Lingjie Duan",
title = "{WAIPO}: a Fusion-Based Collaborative Indoor
Localization System on {Smartphones}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2267--2280",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2680448",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Indoor localization based on smartphone can enhance
user's experiences in indoor environments. Although
some innovative solutions have been proposed in the
past two decades, how to accurately and efficiently
localize users in indoor environments is still a
challenging problem. Traditional indoor positioning
systems based on Wi-Fi fingerprints or dead reckoning
suffer from the variation of Wi-Fi signals and the
drift of dead reckoning problems, respectively.
Crowdsourcing and ambient sensing stimulate new ways to
improve existing localization systems' accuracy. Using
human social factors to calibrate the accuracy of
localization is practical and awarding. In this paper,
we propose WAIPO, a collaborative indoor localization
system with the fusion of Wi-Fi and magnetic
fingerprints, image-matching, and people co-occurrence.
Specifically, we could obtain the most likely top-$n$
locations based on Wi-Fi fingerprints. We utilize the
statistics of users' historical locations known by
image-matching, for which we propose a photo-room
matching algorithm, to reduce estimating areas. In
order to further improve the accuracy of localization,
we propose a co-occurrence and non-co-occurrence
detection algorithm to detect users' spatial-temporal
co-occurrence and determine users' locations with
magnetic calibration. We have fully implemented WAIPO
on the Android platform and perform testbed
experiments. The experimental results demonstrate that
WAIPO achieves an accuracy of 87.3\% on average, which
outperforms the state-of-the-art indoor localization
systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:TSF,
author = "Kai Chen and Xitao Wen and Xingyu Ma and Yan Chen and
Yong Xia and Chengchen Hu and Qunfeng Dong and
Yongqiang Liu",
title = "Toward A Scalable, Fault-Tolerant, High-Performance
Optical Data Center Architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2281--2294",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2688376",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Optical data center networks DCNs are becoming
increasingly attractive due to their technological
strengths compared with the traditional electrical
networks. However, existing optical DCNs are either
hard to scale, vulnerable to single point of failure,
or provide limited network bisection bandwidth for many
practical data center workloads. To this end, we
present WaveCube, a scalable, fault-tolerant,
high-performance optical DCN architecture. To scale,
WaveCube removes MEMS,1 a potential bottleneck, from
its design. WaveCube is fault-tolerant, since it does
not have single point of failure and there are multiple
node-disjoint parallel paths between any pair of
top-of-rack switches. WaveCube delivers high
performance by exploiting multi-pathing and dynamic
link bandwidth along the path. For example, our
evaluation results show that, in terms of network
bisection bandwidth, WaveCube outperforms prior optical
DCNs by up to 400\% and is 70\%--85\% of the ideal
non-blocking network, i.e., theoretical upper bound
under both realistic and synthetic traffic patterns.
WaveCube's performance degrades gracefully under
failures --- it drops 20\% even with 20\% links cut.
WaveCube also holds promise in practice --- its wiring
complexity is orders of magnitude lower than Fattree,
BCube, and c-Through at scale, and its power
consumption is 35\% of
them.1Micro-Electro-Mechanical-System--one of the most
popular optical circuit switches used as the main
component by many recently-proposed optical DCNs [15],
[18], [39].",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Einziger:2017:TAE,
author = "Gil Einziger and Roy Friedman",
title = "{TinySet} --- An Access Efficient Self Adjusting
{Bloom} Filter Construction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2295--2307",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2685530",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Bloom filters are a very popular and efficient data
structure for approximate set membership queries.
However, Bloom filters have several key limitations as
they require 44\% more space than the lower bound,
their operations access multiple memory words, and they
do not support removals. This paper presents TinySet,
an alternative Bloom filter construction that is more
space efficient than Bloom filters for false positive
rates smaller than 2.8\%, accesses only a single memory
word and partially supports removals. TinySet is
mathematically analyzed and extensively tested and is
shown to be fast and more space efficient than a
variety of Bloom filter variants. TinySet also has low
sensitivity to configuration parameters and is
therefore more flexible than a Bloom filter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Babarczi:2017:DCT,
author = "Peter Babarczi and Janos Tapolcai and Alija Pasic and
Lajos Ronyai and Erika R. Berczi-Kovacs and Muriel
Medard",
title = "Diversity Coding in Two-Connected Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2308--2319",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2684909",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a new proactive recovery
scheme against single edge failures for unicast
connections in transport networks. The new scheme is a
generalization of diversity coding where the source
data $ A B $ are split into two parts $A$ and $B$ and
three data flows $A$, $B$, and their exclusive OR XOR $
A \oplus B$ are sent along the network between the
source and the destination node of the connection. By
ensuring that two data flows out of the three always
operate even if a single edge fails, the source data
can be instantaneously recovered at the destination
node. In contrast with diversity coding, we do not
require the three data flows to be routed along three
disjoint paths; however, in our scheme, a data flow is
allowed to split into two parallel segments and later
merge back. Thus, our generalized diversity coding GDC
scheme can be used in sparse but still two-connected
network topologies. Our proof improves an earlier
result of network coding, by using purely graph
theoretical tool set instead of algebraic argument. In
particular, we show that when the source data are
divided into two parts, robust intra-session network
coding against single edge failures is always possible
without any in-network algebraic operation. We present
linear-time robust code construction algorithms for
this practical special case in minimal coding graphs.
We further characterize this question, and show that by
increasing the number of edge failures and source data
parts, we lose these desired properties.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2017:SDL,
author = "Chao Wu and Xu Chen and Wenwu Zhu and Yaoxue Zhang",
title = "Socially-Driven Learning-Based Prefetching in Mobile
Online Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2320--2333",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2681121",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile online social networks OSNs are emerging as the
popular mainstream platform for information and content
sharing among people. In order to provide the quality
of experience support for mobile OSN services, in this
paper, we propose a socially-driven learning-based
framework, namely Spice, for the media content
prefetching to reduce the access delay and enhance
mobile user's satisfaction. Through a large-scale
data-driven analysis over real-life mobile Twitter
traces from over 17 000 users during a period of five
months, we reveal that the social friendship has a
great impact on user's media content click behavior. To
capture this effect, we conduct the social friendship
clustering over the set of user's friends, and then
develop a cluster-based Latent Bias Model for
socially-driven learning-based prefetching prediction.
We then propose a usage-adaptive prefetching scheduling
scheme by taking into account that different users may
possess heterogeneous patterns in the mobile OSN app
usage. We comprehensively evaluate the performance of
Spice framework using trace-driven emulations on
smartphones. Evaluation results corroborate that the
Spice can achieve superior performance, with an average
80.6\% access delay reduction at the low cost of
cellular data and energy consumption. Furthermore, by
enabling users to offload their machine learning
procedures to a cloud server, our design can achieve up
to a factor of 1000 speed-up over the local data
training execution on smartphones.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:PIP,
author = "Rui Li and Alex X. Liu and Sheng Xiao and Hongyue Xu
and Bezawada Bruhadeshwar and Ann L. Wang",
title = "Privacy and Integrity Preserving Top-$k$ Query
Processing for Two-Tiered Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2334--2346",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2693364",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Privacy and integrity have been the main road block to
the applications of two-tiered sensor networks. The
storage nodes, which act as a middle tier between the
sensors and the sink, could be compromised and allow
attackers to learn sensitive data and manipulate query
results. Prior schemes on secure query processing are
weak, because they reveal non-negligible information,
and therefore, attackers can statistically estimate the
data values using domain knowledge and the history of
query results. In this paper, we propose the first
top-$k$ query processing scheme that protects the
privacy of sensor data and the integrity of query
results. To preserve privacy, we build an index for
each sensor collected data item using pseudo-random
hash function and Bloom filters and transform top-$k$
queries into top-range queries. To preserve integrity,
we propose a data partition algorithm to partition each
data item into an interval and attach the partition
information with the data. The attached information
ensures that the sink can verify the integrity of query
results. We formally prove that our scheme is secure
under IND-CKA security model. Our experimental results
on real-life data show that our approach is accurate
and practical for large network sizes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wen:2017:RIF,
author = "Xitao Wen and Kai Bu and Bo Yang and Yan Chen and Li
Erran Li and Xiaolin Chen and Jianfeng Yang and Xue
Leng",
title = "{RuleScope}: Inspecting Forwarding Faults for
Software-Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2347--2360",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2686443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-defined networking SDN promises
unprecedentedly flexible network management but it is
susceptible to forwarding faults. Such faults originate
from data-plane rules with missing faults and priority
faults. Yet existing fault detection ignores priority
faults, because they are not discovered on commercial
switches until recently. In this paper, we present
RuleScope, a more comprehensive solution for inspecting
SDN forwarding. RuleScope offers a series of accurate
and efficient algorithms for detecting and
troubleshooting rule faults. They inspect forwarding
behavior using customized probe packets to exercise
data-plane rules. The detection algorithm exposes not
only missing faults but also priority faults and the
troubleshooting algorithm uncover actual forwarding
states of data-plane flow tables. Both of them help
track real-time forwarding status and benefit reliable
network monitoring. Furthermore, toward fast inspection
of dynamic networks, we propose incremental algorithms
for rapidly evolving network policies to amortize
detection and troubleshooting overhead without
sacrificing accuracy. Experiments with our prototype on
the Ryu SDN controller and Pica8 P-3297 switch show
that the RuleScope achieves accurate fault detection on
320-entry flow tables with a cost of 1500+ probe
packets within 16 s.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ao:2017:AAO,
author = "Weng Chon Ao and Konstantinos Psounis",
title = "Approximation Algorithms for Online User Association
in Multi-Tier Multi-Cell Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2361--2374",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2686839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The constantly growing wireless bandwidth demand is
pushing wireless networks to multi-tier architectures
consisting of a macrocell tier and a number of dense
small cell deployment tiers. In such a multi-tier
multi-cell environment, the classic problem of
associating users to base stations becomes both more
challenging and more critical to the overall network
performance. Most previous analytical work is focused
on designing static user-cell association algorithms,
which, to achieve optimality, are periodically applied
whenever there are new user arrivals, thus potentially
inducing a large number of re-associations for
previously arrived users. On the other hand, practical
online algorithms that do not allow any such user
re-association are often based on heuristics and may
not have any performance guarantees. In this paper, we
propose online algorithms for the multi-tier multi-cell
user association problem that have provable performance
guarantees, which improve previously known bounds by a
sizable amount. The proposed algorithms are motivated
by online combinatorial auctions, while capturing and
leveraging the relative sparsity of choices in wireless
networks as compared with auction setups. Our champion
algorithm is a $ \frac {1}{2 - a^{-1}} $ approximation
algorithm, where $a$ is the maximum number of feasible
associations for a user and is, in general, small due
to path loss. Our analysis considers the
state-of-the-art wireless technologies, such as massive
and multiuser MIMO, and practical aspects of the system
such as the fact that highly mobile users have a
preference to connect to larger cell tiers to keep the
signaling overhead low. In addition to establishing
formal performance bounds, we also conduct simulations
under realistic assumptions, which establish the
superiority of the proposed algorithm over existing
approaches under real-world scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:CAW,
author = "Jinbei Zhang and Luoyi Fu and Qi Wang and Liang Liu
and Xinyu Wang and Xinbing Wang",
title = "Connectivity Analysis in Wireless Networks With
Correlated Mobility and Cluster Scalability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2375--2390",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2692774",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Since it was found that real mobility processes
exhibit significant degree of correlation correlated
mobility and nodes are often heterogeneously
distributed in clustered networks cluster scalability,
there has been a great interest in studying their
impact on network performance, such as throughput and
delay. However, limited works have been done to
investigate their impact jointly, which may due to the
challenges in capturing both features under a unified
network model. In this paper, we focus on their impact
on asymptotic connectivity and propose correlated
mobile$k$ -hop clustered network model. Two
connectivity metrics are considered. One is network
connectivity with probability w.p.. The other is
connectivity almost surely a.s., which requires a
stronger condition than connectivity with probability.
With mobility correlation and cluster scalability vary,
we show that there are three distinct states for
network connectivity, i.e., cluster-sparse,
cluster-dense state, and cluster-inferior dense state,
respectively. We first prove the exact value of the
critical transmission range for each state,
respectively, and then further generalize the three
states into a unified one, which we call it cluster
mixed state. The critical transmission range for
connectivity almost surely is $ \sqrt {2}$ times the
range for connectivity with probability. Our main
contribution lies in how to group correlated nodes into
independent ones in various settings, and reveals the
interrelated relationship between correlated mobility
and cluster scalability through state transitions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2017:DSA,
author = "Haitao Wu and Fen Zhou and Zuqing Zhu and Yaojun
Chen",
title = "On the Distance Spectrum Assignment in Elastic Optical
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2391--2404",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2685688",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In elastic optical networks, two lightpaths sharing
common fiber links might have to be isolated in the
spectrum domain with a proper guard-band to prevent
crosstalk and/or reduce physical-layer security
threats. Meanwhile, the actual requirements on
guard-band sizes can vary for different lightpath
pairs, because of various reasons. Therefore, in this
paper, we consider the situation in which the actual
guard-band requirements for different lightpath pairs
are different, and formulate the distance spectrum
assignment DSA problem to investigate how to assign the
spectrum resources efficiently in such a situation. We
first define the DSA problem formally and prove its $
\mathcal {NP} $ -hardness and inapproximability. Then,
we analyze and provide the upper and lower bounds for
the optimal solution of DSA, and prove that they are
tight. In order to solve the DSA problem
time-efficiently, we develop a two-phase algorithm. In
its first phase, we obtain an initial solution and then
the second phase improves the quality of the initial
solution with random optimization. We prove that the
proposed two-phase algorithm can get the optimal
solution in bipartite DSA conflict graphs and can
ensure an approximate ratio of $ \mathcal {O} \log |V|
$ in complete DSA conflict graphs, where $ |V| $ is the
number of vertices in the conflict graph, i.e., the
number of lightpaths to be considered. Numerical
results demonstrate our proposed algorithm can find
near-optimal solutions for DSA in various conflict
graphs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:DIR,
author = "Zimu Zhou and Longfei Shangguan and Xiaolong Zheng and
Lei Yang and Yunhao Liu",
title = "Design and Implementation of an {RFID}-Based Customer
Shopping Behavior Mining System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2405--2418",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2689063",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Shopping behavior data is of great importance in
understanding the effectiveness of marketing and
merchandising campaigns. Online clothing stores are
capable of capturing customer shopping behavior by
analyzing the click streams and customer shopping
carts. Retailers with physical clothing stores,
however, still lack effective methods to
comprehensively identify shopping behaviors. In this
paper, we show that backscatter signals of passive RFID
tags can be exploited to detect and record how
customers browse stores, which garments they pay
attention to, and which garments they usually pair up.
The intuition is that the phase readings of tags
attached to items will demonstrate distinct yet stable
patterns in a time-series when customers look at, pick
out, or turn over desired items. We design ShopMiner, a
framework that harnesses these unique spatial-temporal
correlations of time-series phase readings to detect
comprehensive shopping behaviors. We have implemented a
prototype of ShopMiner with a COTS RFID reader and four
antennas, and tested its effectiveness in two typical
indoor environments. Empirical studies from two-week
shopping-like data show that ShopMiner is able to
identify customer shopping behaviors with high accuracy
and low overhead, and is robust to interference.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2017:BSA,
author = "Hung T. Nguyen and My T. Thai and Thang N. Dinh",
title = "A Billion-Scale Approximation Algorithm for Maximizing
Benefit in Viral Marketing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2419--2429",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2691544",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Online social networks have been one of the most
effective platforms for marketing and advertising.
Through the ``world-of-mouth'' exchanges, so-called
viral marketing, the influence and product adoption can
spread from few key influencers to billions of users in
the network. To identify those key influencers, a great
amount of work has been devoted for the influence
maximization IM problem that seeks a set of $k$ seed
users that maximize the expected influence.
Unfortunately, IM encloses two impractical assumptions:
1 any seed user can be acquired with the same cost and
2 all users are equally interested in the
advertisement. In this paper, we propose a new problem,
called cost-aware targeted viral marketing CTVM, to
find the most cost-effective seed users, who can
influence the most relevant users to the advertisement.
Since CTVM is NP-hard, we design an efficient $ 1 - 1 /
\sqrt {e} - \epsilon $ -approximation algorithm, named
Billion-scale Cost-award Targeted algorithm BCT, to
solve the problem in billion-scale networks. Comparing
with IM algorithms, we show that BCT is both
theoretically and experimentally faster than the
state-of-the-arts while providing better solution
quality. Moreover, we prove that under the linear
threshold model, BCT is the first sub-linear time
algorithm for CTVM and IM in dense networks. We carry a
comprehensive set of experiments on various
real-networks with sizes up to several billion edges in
diverse disciplines to show the absolute superiority of
BCT on both CTVM and IM domains. Experiments on Twitter
data set, containing 1.46 billions of social relations
and 106 millions tweets, show that BCT can identify key
influencers in trending topics in only few minutes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shamsi:2017:UCU,
author = "Zain Shamsi and Dmitri Loguinov",
title = "Unsupervised Clustering Under Temporal Feature
Volatility in Network Stack Fingerprinting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2430--2443",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2690641",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Maintaining and updating signature databases are
tedious tasks that normally require a large amount of
user effort. The problem becomes harder when features
can be distorted by observation noise, which we call
volatility. To address this issue, we propose
algorithms and models to automatically generate
signatures in the presence of noise, with a focus on
single-probe stack fingerprinting, which is a research
area that aims to discover the operating system of
remote hosts using their response to a TCP SYN packet.
Armed with this framework, we construct a database with
420 network stacks, label the signatures, develop a
robust classifier for this database, and fingerprint
66M visible webservers on the Internet. We compare the
obtained results against Nmap and discover interesting
limitations of its classification process that prevent
correct operation when its auxiliary probes e.g., TCP
rainbow, TCP ACK, and UDP to a closed port are blocked
by firewalls.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vyavahare:2017:MRN,
author = "Pooja Vyavahare and Nutan Limaye and Ajit A. Diwan and
D. Manjunath",
title = "On the Maximum Rate of Networked Computation in a
Capacitated Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2444--2458",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2695578",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We are given a capacitated communication network and
several infinite sequences of source data each of which
is available at some node in the network. A function of
the source data is to be computed in the network and
made available at a sink node that is also on the
network. The schema to compute the function is given as
a directed acyclic graph DAG. We want to generate a
computation and communication schedule in the network
to maximize the rate of computation of the function for
an arbitrary function represented by DAG. We first
analyze the complexity of finding the rate maximizing
schedule for the general DAG. We show that finding an
optimal schedule is equivalent to solving a packing
linear program LP. We then prove that finding the
maximum rate is MAX SNP-hard by analyzing this packing
LP even when the DAG has bounded degree, bounded edge
weights and the network has three vertices. We then
consider special cases arising in practical situations.
First, a polynomial time algorithm for the network with
two vertices is presented. This algorithm is a
reduction to a version of a submodular function
minimization problem. Next, for the general network we
describe a restricted class of schedules and its
equivalent packing LP. By relating this LP to minimum
cost embedding problem, we present approximation
algorithms for special classes of DAGs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:LAY,
author = "Xiujuan Zhang and Jiguo Yu and Wei Li and Xiuzhen
Cheng and Dongxiao Yu and Feng Zhao",
title = "Localized Algorithms for {Yao} Graph-Based Spanner
Construction in Wireless Networks Under {SINR}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2459--2472",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2688484",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Spanner construction is one of the most important
techniques for topology control in wireless networks. A
spanner can help not only to decrease the number of
links and to maintain connectivity but also to ensure
that the distance between any pair of communication
nodes is within some constant factor from the shortest
possible distance. Due to the non-locality,
constructing a spanner is especially challenging under
the physical interference model
signal-to-interference-and-noise-ratio SINR. In this
paper, we develop two localized randomized algorithms
SINR-directed-YG and SINR-undirected-YG to construct a
directed Yao graph YG and an undirected YG in $ O(\log
n) $, $n$ is the number of wireless nodes time slots
with a high probability, in which each node is capable
of performing successful local broadcasts to gather
neighborhood information within a certain region and
the SINR constraint is satisfied at all the steps of
the algorithms. The resultant graph of
SINR-undirected-YG, which is based on SINR-directed-YG,
possesses a constant stretch factor $ \frac {1}{1 - 2
\sin \pi / c}$, where $ c > 6$ is a constant. To the
best of our knowledge, SINR-undirected-YG is the first
spanner construction algorithm under SINR. We also
obtain Yao-Yao graph under SINR. Extensive theoretical
performance analysis and simulation study are carried
out to verify the effectiveness and the efficiency of
our proposed algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:SLL,
author = "Haifeng Zhou and Chunming Wu and Qiumei Cheng and
Qianjun Liu",
title = "{SDN--LIRU}: a Lossless and Seamless Method for {SDN}
Inter-Domain Route Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2473--2483",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2689240",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Maintaining service availability during an
inter-domain route update is a challenge in both
conventional networks and software-defined networks
SDNs. In the update process, asynchronous
reconfigurations to border forwarding devices in
different domains will incur transient anomalies with
numerous packet losses and service disruptions. Based
on current SDN inter-domain routing mechanisms, we in
this paper propose a lossless and seamless method for
SDN inter-domain route updates. This method is
lightweight, and it has no requirement to add extra
switch functionality or to extend SDN southbound
protocols. The primary idea of this method is to
achieve a lossless inter-domain route update by
communications and collaborations among relevant
domains. Motivated by this idea, we first identify
three different domain categories for the update, i.e.,
domains only on the new inter-domain route, domains on
both the old and new inter-domain routes, and domains
only on the old inter-domain route. We further find
that the transient anomalies are able to be avoided by
reconfiguring the related border switches of the three
categories of domains in order. Four update steps are
then designed to keep the orderly update. Furthermore,
we present the theoretical proof of the effectiveness
of this method. Finally, based on our prototype
implementation, the proposed method is also validated
by simulation studies, and the simulation results
indicate that this method succeeds in avoiding packet
loss and maintaining service availability during the
update.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{La:2017:EDC,
author = "Richard J. La",
title = "Effects of Degree Correlations in Interdependent
Security: Good or Bad?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2484--2497",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2691605",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the influence of degree correlations or
network mixing on interdependent security. We model the
interdependence in security among agents using a
dependence graph and employ a population game model to
capture the interaction among many agents when they are
strategic and have various security measures they can
choose to defend themselves. The overall network
security is measured by what we call the average risk
exposure ARE from neighbors, which is proportional to
the total expected number of attacks in the network. We
first show that there exists a unique pure-strategy
Nash equilibrium of a population game. Then, we prove
that as the agents with larger degrees in the
dependence graph see higher risks than those with
smaller degrees, the overall network security
deteriorates in that the ARE experienced by agents
increases and there are more attacks in the network.
Finally, using this finding, we demonstrate that the
effects of network mixing on ARE depend on the cost
effectiveness of security measures available to agents;
if the security measures are not effective, increasing
assortativity of dependence graph results in higher
ARE. On the other hand, if the security measures are
effective at fending off the damages and losses from
attacks, increasing assortativity reduces the ARE
experienced by agents.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:MCC,
author = "Guoxin Liu and Haiying Shen",
title = "Minimum-Cost Cloud Storage Service Across Multiple
Cloud Providers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2498--2513",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2693222",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many cloud service providers CSPs provide data storage
services with datacenters distributed worldwide. These
datacenters provide different get/put latencies and
unit prices for resource utilization and reservation.
Thus, when selecting different CSPs' datacenters, cloud
customers of globally distributed applications e.g.,
online social networks face two challenges: 1 how to
allocate data to worldwide datacenters to satisfy
application service level objective SLO requirements,
including both data retrieval latency and availability
and2 how to allocate data and reserve resources in
datacenters belonging to different CSPs to minimize the
payment cost. To handle these challenges, we first
model the cost minimization problem under SLO
constraints using the integer programming. Due to its
NP-hardness, we then introduce our heuristic solution,
including a dominant-cost-based data allocation
algorithm and an optimal resource reservation
algorithm. We further propose three enhancement methods
to reduce the payment cost and service latency: 1
coefficient-based data reallocation; 2 multicast-based
data transferring; and 3 request redirection-based
congestion control. We finally introduce an
infrastructure to enable the conduction of the
algorithms. Our trace-driven experiments on a
supercomputing cluster and on real clouds i.e., Amazon
S3, Windows Azure Storage, and Google Cloud Storage
show the effectiveness of our algorithms for SLO
guaranteed services and customer cost minimization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rea:2017:FNT,
author = "Maurizio Rea and Aymen Fakhreddine and Domenico
Giustiniano and Vincent Lenders",
title = "Filtering Noisy 802.11 Time-of-Flight Ranging
Measurements From Commoditized {WiFi} Radios",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2514--2527",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2700430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Time-of-flight ToF echo techniques have been recently
suggested for ranging mobile devices over WiFi radios.
However, these techniques have yielded only moderate
accuracy in indoor environments because WiFi ToF
measurements suffer from extensive device-related noise
which makes it challenging to differentiate between
direct path from non-direct path signal components when
estimating the ranges. Existing multipath mitigation
techniques tend to fail at identifying the direct path
when the device-related Gaussian noise is in the same
order of magnitude, or larger than the multipath noise.
In order to address this challenge, we propose a new
method for filtering ranging measurements that is
better suited for the inherent large noise as found in
WiFi radios. Our technique combines statistical
learning and robust statistics in a single filter. The
filter is lightweight in the sense that it does not
require specialized hardware, the intervention of the
user, or cumbersome on-site manual calibration. This
makes our method particularly suitable for indoor
localization in large-scale deployments using existing
legacy WiFi infrastructures. We evaluate our technique
for indoor mobile tracking scenarios in multipath
environments and, through extensive evaluations across
four different testbeds covering areas up to 1000m2,
the filter is able to achieve a median 2-D positioning
error between 2 and 3.4 m.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2017:EUT,
author = "Wei Gong and Jiangchuan Liu and Zhe Yang",
title = "Efficient Unknown Tag Detection in Large-Scale {RFID}
Systems With Unreliable Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2528--2539",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2699683",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the most important applications of radio
frequency identification RFID technology is to detect
unknown tags brought by new tagged items, misplacement,
or counterfeit tags. While unknown tag identification
is able to pinpoint all the unknown tags, probabilistic
unknown tag detection is preferred in large-scale RFID
systems that need to be frequently checked up, e.g.,
real-time inventory monitoring. Nevertheless, most of
the previous solutions are neither efficient nor
reliable. The communication efficiency of former
schemes is not well optimized due to the transmission
of unhelpful data. Furthermore, they do not consider
characteristics of unreliable wireless channels in RFID
systems. In this paper, we propose a fast and reliable
method for probabilistic unknown tag detection, white
paper WP protocol. The key novelty of WP is to build a
new data structure of composite message that consists
of all the informative data from several independent
detection synopses; thus it excludes useless data from
communication. Furthermore, we employ packet loss
differentiation and adaptive channel hopping techniques
to combat unreliable backscatter channels. We implement
a prototype system using USRP software-defined radio
and WISP tags to show the feasibility of this design.
We also conduct extensive simulations and comparisons
to show that WP outperforms previous methods. Compared
with the state-of-the-art protocols, WP achieves more
than $ 2 \times $ performance gain in terms of
time-efficiency when all the channels are assumed free
of errors and the number of tags is 10 000, and
achieves up to $ 12 \times $ success probability gain
when the burstiness is more than 80\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2017:DBM,
author = "Shih-Chun Lin and Pu Wang and Ian F. Akyildiz and Min
Luo",
title = "Delay-Based Maximum Power-Weight Scheduling With
Heavy-Tailed Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2540--2555",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2706743",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Heavy-tailed HT traffic e.g., the Internet and
multimedia traffic fundamentally challenges the
validity of classic scheduling algorithms, designed
under conventional light-tailed LT assumptions. To
address such a challenge, this paper investigates the
impact of HT traffic on delay-based maximum weight
scheduling DMWS algorithms, which have been proven to
be throughput-optimal with enhanced delay performance
under the LT traffic assumption. First, it is proven
that the DMWS policy is not throughput-optimal anymore
in the presence of hybrid LT and HT traffic by inducing
unbounded queuing delay for LT traffic. Then, to solve
the unbounded delay problem, a delay-based maximum
power-weight scheduling DMPWS policy is proposed that
makes scheduling decisions based on queuing delay
raised to a certain power. It is shown by the fluid
model analysis that DMPWS is throughput-optimal with
respect to moment stability by admitting the largest
set of traffic rates supportable by the network, while
guaranteeing bounded queuing delay for LT traffic.
Moreover, a variant of the DMPWS algorithm, namely the
IU-DMPWS policy, is proposed, which operates with
infrequent queue state updates. It is also shown that
compared with DMPWS, the IU-DMPWS policy preserves the
throughput optimality with much less signaling
overhead, thus expediting its practical
implementation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiao:2017:SOR,
author = "Lei Jiao and Antonia Maria Tulino and Jaime Llorca and
Yue Jin and Alessandra Sala",
title = "Smoothed Online Resource Allocation in Multi-Tier
Distributed Cloud Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2556--2570",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2707142",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See correction \cite{Jiao:2018:CSO}.",
abstract = "The problem of dynamic resource allocation for service
provisioning in multi-tier distributed clouds is
particularly challenging due to the coexistence of
several factors: the need for joint allocation of cloud
and network resources, the need for online
decision-making under time-varying service demands and
resource prices, and the reconfiguration cost
associated with changing resource allocation decisions.
We study this problem from an online optimization
perspective to address all these challenges. We design
an online algorithm that decouples the original offline
problem over time by constructing a series of
regularized subproblems, solvable at each corresponding
time slot using the output of the previous time slot.
We prove that, without prediction beyond the current
time slot, our algorithm achieves a parameterized
competitive ratio for arbitrarily dynamic workloads and
resource prices. If prediction is available, we
demonstrate that existing prediction-based control
algorithms lack worst case performance guarantees for
our problem, and we design two novel predictive control
algorithms that inherit the theoretical guarantees of
our online algorithm, while exhibiting improved
practical performance. We conduct evaluations in a
variety of settings based on real-world dynamic inputs
and show that, without prediction, our online algorithm
achieves up to nine times total cost reduction compared
with the sequence of greedy one-shot optimizations and
at most three times the offline optimum; with moderate
predictions, our control algorithms can achieve two
times total cost reduction compared with existing
prediction-based algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vargaftik:2017:NPL,
author = "Shay Vargaftik and Isaac Keslassy and Ariel Orda",
title = "No Packet Left Behind: Avoiding Starvation in Dynamic
Topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2571--2584",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2706366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Backpressure schemes are known to stabilize stochastic
networks through the use of congestion gradients in
routing and resource allocation decisions. Nonetheless,
these schemes share a significant drawback, namely, the
delay guarantees are obtained only in terms of average
values. As a result, arbitrary packets may never reach
their destination due to both the starvation and
last-packet problems. These problems occur because in
backpressure schemes, packet scheduling needs a
subsequent stream of packets to produce the required
congestion gradient for scheduling. To solve these
problems, we define a starvation-free stability
criterion that ensures a repeated evacuation of all
network queues. Then, we introduce SF-BP, the first
backpressure routing and resource allocation algorithm
that is starvation-free stable. We further present
stronger per-queue service guarantees and provide tools
to enhance weak streams. We formally prove that our
algorithm ensures that all packets reach their
destination for wide families of networks. Finally, we
verify our results by extensive simulations using
challenging topologies as well as random static and
dynamic topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:TQC,
author = "Xiulong Liu and Keqiu Li and Song Guo and Alex X. Liu
and Peng Li and Kun Wang and Jie Wu and Xiulong Liu and
Keqiu Li and Song Guo and Alex X. Liu and Peng Li and
Kun Wang and Jie Wu",
title = "Top-$k$ Queries for Categorized {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2587--2600",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2722480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For categorized RFID systems, this paper studies the
practically important problem of top-k queries, which
is to find the top-k smallest and or the top-k largest
categories, as well as the sizes of such categories. In
this paper, we propose a Top-k Query TKQ protocol and
two supplementary techniques called segmented perfect
hashing SPH and switching to framed slotted aloha STA
for optimizing TKQ. First, TKQ lets each tag choose a
time slot to respond to the reader with a single-one
geometric string using the ON-OFF Keying modulation.
TKQ leverages the length of continuous leading 1 s in
the combined signal to estimate the corresponding
category size. TKQ can quickly eliminate most
categories whose sizes are significantly different from
the top-k boundary, and only needs to perform accurate
estimation on a limited number of categories that may
be within the top-k set. We conduct rigorous analysis
to guarantee the predefined accuracy constraints on the
query results. Second, to alleviate the low frame
utilization of TKQ, we propose the SPH scheme, which
improves its average frame utilization from 36.8\% to
nearly 100\% by establishing a bijective mapping
between tag categories and slots. To minimize the
overall time cost, we optimize the key parameter that
trades off between communication cost and computation
cost. Third, we observed from the simulation traces
that TKQ+SPH pays most execution time on querying a
small number of remaining categories whose sizes are
close to the top-k boundary, which sometimes even
exceeds the time cost for precisely identifying these
remaining tags. Motivated by this observation, we
propose the STA scheme to dynamically determine when we
should terminate TKQ+SPH and switch to use FSA to
finish the rest of top-k query. Experimental results
show that TKQ+SPH+STA not only achieves the required
accuracy constraints, but also achieves several times
faster speed than the existing protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Valenza:2017:CAC,
author = "Fulvio Valenza and Cataldo Basile and Daniele Canavese
and Antonio Lioy and Fulvio Valenza and Cataldo Basile
and Daniele Canavese and Antonio Lioy",
title = "Classification and Analysis of Communication
Protection Policy Anomalies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2601--2614",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2708096",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents a classification of the anomalies
that can appear when designing or implementing
communication protection policies. Together with the
already known intra- and inter-policy anomaly types, we
introduce a novel category, the inter-technology
anomalies, related to security controls implementing
different technologies, both within the same network
node and among different network nodes. Through an
empirical assessment, we prove the practical
significance of detecting this new anomaly class.
Furthermore, this paper introduces a formal model,
based on first-order logic rules that analyses the
network topology and the security controls at each node
to identify the detected anomalies and suggest the
strategies to resolve them. This formal model has
manageable computational complexity and its
implementation has shown excellent performance and good
scalability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jones:2017:OAT,
author = "Nathaniel M. Jones and Georgios S. Paschos and Brooke
Shrader and Eytan Modiano and Nathaniel M. Jones and
Georgios S. Paschos and Brooke Shrader and Eytan
Modiano",
title = "An Overlay Architecture for Throughput Optimal
Multipath Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2615--2628",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703867",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Legacy networks are often designed to operate with
simple single-path routing, like the shortest path,
which is known to be throughput suboptimal. On the
other hand, previously proposed throughput optimal
policies i.e., backpressure require every device in the
network to make dynamic routing decisions. In this
paper, we study an overlay architecture for dynamic
routing, such that only a subset of devices overlay
nodes need to make the dynamic routing decisions. We
determine the essential collection of nodes that must
bifurcate traffic for achieving the maximum
multi-commodity network throughput. We apply our
optimal node placement algorithm to several graphs and
the results show that a small fraction of overlay nodes
is sufficient for achieving maximum throughput.
Finally, we propose a threshold-based policy BP-T and a
heuristic policy OBP, which dynamically control traffic
bifurcations at overlay nodes. Policy BP-T is proved to
maximize throughput for the case when underlay paths do
no overlap. In all studied simulation scenarios, OBP
not only achieves full throughput but also reduces
delay in comparison to the throughput optimal
backpressure routing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Carlucci:2017:CCW,
author = "Gaetano Carlucci and Luca {De Cicco} and Stefan Holmer
and Saverio Mascolo",
title = "Congestion Control for {Web} Real-Time Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2629--2642",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703615",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Applications requiring real-time communication RTC
between Internet peers are ever increasing. RTC
requires not only congestion control but also
minimization of queuing delays to provide
interactivity. It is known that the well-established
transmission control protocol congestion control is not
suitable for RTC due to its retransmissions and
in-order delivery mechanisms, which induce significant
latency. In this paper, we propose a novel congestion
control algorithm for RTC, which is based on the main
idea of estimating-using a Kalman Filter-the end-to-end
one-way delay variation which is experienced by packets
traveling from a sender to a destination. This estimate
is compared with a dynamic threshold and drives the
dynamics of a controller located at the receiver, which
aims at maintaining queuing delays low, while a
loss-based controller located at the sender acts when
losses are detected. The proposed congestion control
algorithm has been adopted by Google Chrome. Extensive
experimental evaluations have shown that the algorithm
contains queuing delays while providing intra and inter
protocol fairness along with full link utilization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:SFW,
author = "Songze Li and Qian Yu and Mohammad Ali Maddah-Ali and
A. Salman Avestimehr and Songze Li and Qian Yu and
Mohammad Ali Maddah-Ali and A. Salman Avestimehr",
title = "A Scalable Framework for Wireless Distributed
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2643--2654",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2702605",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a wireless distributed computing system,
in which multiple mobile users, connected wirelessly
through an access point, collaborate to perform a
computation task. In particular, users communicate with
each other via the access point to exchange their
locally computed intermediate computation results,
which is known as data shuffling. We propose a scalable
framework for this system, in which the required
communication bandwidth for data shuffling does not
increase with the number of users in the network. The
key idea is to utilize a particular repetitive pattern
of placing the data set thus a particular repetitive
pattern of intermediate computations, in order to
provide the coding opportunities at both the users and
the access point, which reduce the required uplink
communication bandwidth from users to the access point
and the downlink communication bandwidth from access
point to users by factors that grow linearly with the
number of users. We also demonstrate that the proposed
data set placement and coded shuffling schemes are
optimal i.e., achieve the minimum required shuffling
load for both a centralized setting and a decentralized
setting, by developing tight information-theoretic
lower bounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2017:TNS,
author = "Yuanqing Zheng and Guobin Shen and Liqun Li and
Chunshui Zhao and Mo Li and Feng Zhao and Yuanqing
Zheng and Guobin Shen and Liqun Li and Chunshui Zhao
and Mo Li and Feng Zhao",
title = "{Travi-Navi}: Self-Deployable Indoor Navigation
System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2655--2669",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2707101",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present Travi-Navi --- a vision-guided navigation
system that enables a self-motivated user to easily
bootstrap and deploy indoor navigation services,
without comprehensive indoor localization systems or
even the availability of floor maps. Travi-Navi records
high-quality images during the course of a guider's
walk on the navigation paths, collects a rich set of
sensor readings, and packs them into a navigation
trace. The followers track the navigation trace, get
prompt visual instructions and image tips, and receive
alerts when they deviate from the correct paths.
Travi-Navi also finds shortcuts whenever possible. In
this paper, we describe the key techniques to solve
several practical challenges, including robust
tracking, shortcut identification, and high-quality
image capture while walking. We implement Travi-Navi
and conduct extensive experiments. The evaluation
results show that Travi-Navi can track and navigate
users with timely instructions, typically within a
four-step offset, and detect deviation events within
nine steps. We also characterize the power consumption
of Travi-Navi on various mobile phones.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2017:AJE,
author = "Qingjun Xiao and Shigang Chen and Min Chen and Yian
Zhou and Zhiping Cai and Junzhou Luo and Qingjun Xiao
and Shigang Chen and Min Chen and Yian Zhou and Zhiping
Cai and Junzhou Luo",
title = "Adaptive Joint Estimation Protocol for Arbitrary Pair
of Tag Sets in a Distributed {RFID} System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2670--2685",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2709979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification RFID technology has
been widely used in Applications, such as inventory
control, object tracking, and supply chain management.
In this domain, an important research problem is called
RFID cardinality estimation, which focuses on
estimating the number of tags in a certain area covered
by one or multiple readers. This paper extends the
research in both temporal and spatial dimensions to
provide much richer information about the dynamics of
distributed RFID systems. Specifically, we focus on
estimating the cardinalities of the
intersection/differences/union of two arbitrary tag
sets called joint properties for short that exist in
different spatial or temporal domains. With many
practical applications, there is, however, little prior
work on this problem. We will propose a joint RFID
estimation protocol that supports adaptive snapshot
construction. Given the snapshots of any two tag sets,
although their lengths may be very different depending
on the sizes of tag sets they encode, we design a way
to combine their information and more importantly,
derive closed-form formulas to use the combined
information and estimate the joint properties of the
two tag sets, with an accuracy that can be arbitrarily
set. By formal analysis, we also determine the optimal
system parameters that minimize the execution time of
taking snapshots, under the constraints of a given
accuracy requirement. We have performed extensive
simulations, and the results show that our protocol can
reduce the execution time by multiple folds, as
compared with the best alternative approach in
literature.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:MCC,
author = "Liang Wang and Gareth Tyson and Jussi Kangasharju and
Jon Crowcroft and Liang Wang and Gareth Tyson and Jussi
Kangasharju and Jon Crowcroft",
title = "Milking the Cache Cow With Fairness in Mind",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2686--2700",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2707131",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information-centric networking ICN is a popular
research topic. At its heart is the concept of
in-network caching. Various algorithms have been
proposed for optimizing ICN caching, many of which rely
on collaborative principles, i.e. multiple caches
interacting to decide what to store. Past work has
assumed altruistic nodes that will sacrifice their own
performance for the global optimum. We argue that this
assumption is insufficient and oversimplifies the
reality. We address this problem by modeling the
in-network caching problem as a Nash bargaining game.
We develop optimal and heuristic caching solutions that
consider both performance and fairness. We argue that
only algorithms that are fair to all parties involved
in caching will encourage engagement and cooperation.
Through extensive simulations, we show our heuristic
solution, FairCache, ensures that all collaborative
caches achieve performance gains without undermining
the performance of others.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2017:QAE,
author = "Jiyan Wu and Bo Cheng and Ming Wang and Junliang Chen
and Jiyan Wu and Bo Cheng and Ming Wang and Junliang
Chen",
title = "Quality-Aware Energy Optimization in Wireless Video
Communication With Multipath {TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2701--2718",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2701153",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The advancements in wireless communication
technologies prompt the bandwidth aggregation for
mobile video delivery over heterogeneous access
networks. Multipath TCP MPTCP is the transport protocol
recommended by IETF for concurrent data transmission to
multihomed terminals. However, it still remains
challenging to deliver user-satisfied video services
with the existing MPTCP schemes because of the
contradiction between energy consumption and received
video quality in mobile devices. To enable the
energy-efficient and quality-guaranteed video
streaming, this paper presents an
energy-distortion-aware MPTCP EDAM solution. First, we
develop an analytical framework to characterize the
energy-distortion tradeoff for multipath video
transmission over heterogeneous wireless networks.
Second, we propose a video flow rate allocation
algorithm to minimize the energy consumption while
achieving target video quality based on utility
maximization theory. The performance of the proposed
EDAM is evaluated through both experiments in real
wireless networks and extensive emulations in exata.
Experimental results show that EDAM exhibits
performance advantages over existing MPTCP schemes in
energy conservation and video quality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:CBS,
author = "Qi Li and Patrick P. C. Lee and Peng Zhang and Purui
Su and Liang He and Kui Ren and Qi Li and Patrick P. C.
Lee and Peng Zhang and Purui Su and Liang He and Kui
Ren",
title = "Capability-Based Security Enforcement in Named Data
Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2719--2730",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2715822",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Named data networking NDN enhances traditional IP
networking by supporting in-network content caching for
better bandwidth usage and location-independent data
accesses for multi-path forwarding. However, NDN also
brings new security challenges. For example, an
adversary can arbitrarily inject packets to NDN to
poison content cache, or access content packets without
any restrictions. We propose capability-based security
enforcement architecture CSEA, a capability-based
security enforcement architecture that enables data
authenticity in NDN in a distributed manner. CSEA
leverages capabilities to specify the access rights of
forwarded packets. It allows NDN routers to verify the
authenticity of forwarded packets, and throttles
flooding-based DoS attacks from unsolicited packets. We
further develop a lightweight one-time signature scheme
for CSEA to ensure the timeliness of packets and
support efficient verification. We prototype CSEA on
the open-source CCNx platform, and evaluate CSEA via
testbed and Planetlab experiments. Our experimental
results show that CSEA only incurs around 4\% of
additional delays in retrieving data packets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{FischereSilva:2017:EEE,
author = "Renan {Fischer e Silva} and Paul M. Carpenter",
title = "Energy Efficient {Ethernet} on {MapReduce} Clusters:
Packet Coalescing To Improve {10GbE} Links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2731--2742",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2707859",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "An important challenge of modern data centers is to
reduce energy consumption, of which a substantial
proportion is due to the network. Switches and NICs
supporting the recent energy efficient Ethernet EEE
standard are now available, but current practice is to
disable EEE in production use, since its effect on real
world application performance is poorly understood.
This paper contributes to this discussion by analyzing
the impact of EEE on MapReduce workloads, in terms of
performance overheads and energy savings. MapReduce is
the central programming model of Apache Hadoop, one of
the most widely used application frameworks in modern
data centers. We find that, while 1GbE links edge links
achieve good energy savings using the standard EEE
implementation, optimum energy savings in the 10 GbE
links aggregation and core links are only possible, if
these links employ packet coalescing. Packet coalescing
must, however, be carefully configured in order to
avoid excessive performance degradation. With our new
analysis of how the static parameters of packet
coalescing perform under different cluster loads, we
were able to cover both idle and heavy load periods
that can exist on this type of environment. Finally, we
evaluate our recommendation for packet coalescing for
10 GbE links using the energy-delay metric. This paper
is an extension of our previous work [1], which was
published in the Proceedings of the 40th Annual IEEE
Conference on Local Computer Networks LCN 2015.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Courcoubetis:2017:CCB,
author = "Costas A. Courcoubetis and Antonis Dimakis and
Michalis Kanakakis and Costas A. Courcoubetis and
Antonis Dimakis and Michalis Kanakakis",
title = "Congestion Control for Background Data Transfers With
Minimal Delay Impact",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2743--2758",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2710879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Congestion control protocols for background data are
commonly conceived and designed to emulate low priority
traffic, which yields to transmission control protocol
TCP flows. In the presence of even a few very long TCP
flows, this behavior can cause bandwidth starvation,
and hence, the accumulation of large numbers of
background data flows for prolonged periods of time,
which may ultimately have an adverse effect on the
download delays of delay-sensitive TCP flows. In this
paper, we look at the fundamental problem of designing
congestion control protocols for background traffic
with the minimum impact on short TCP flows while
achieving a certain desired average throughput over
time. The corresponding optimal policy under various
assumptions on the available information is obtained
analytically. We give tight bounds of the distance
between TCP-based background transfer protocols and the
optimal policy, and identify the range of system
parameters for which more sophisticated congestion
control makes a noticeable difference. Based on these
results, we propose an access control algorithm for
systems where control on aggregates of background flows
can be exercised, as in file servers. Simulations of
simple network topologies suggest that this type of
access control performs better than protocols emulating
low priority over a wide range of parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kanizo:2017:OVB,
author = "Yossi Kanizo and Ori Rottenstreich and Itai Segall and
Jose Yallouz and Yossi Kanizo and Ori Rottenstreich and
Itai Segall and Jose Yallouz",
title = "Optimizing Virtual Backup Allocation for Middleboxes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2759--2772",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703080",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "In enterprise networks, network functions, such as
address translation, firewall, and deep packet
inspection, are often implemented in middleboxes. Those
can suffer from temporary unavailability due to
misconfiguration or software and hardware malfunction.
Traditionally, middlebox survivability is achieved by
an expensive active-standby deployment where each
middlebox has a backup instance, which is activated in
case of a failure. Network function virtualization NFV
is a novel networking paradigm allowing flexible,
scalable and inexpensive implementation of network
services. In this paper, we suggest a novel approach
for planning and deploying backup schemes for network
functions that guarantee high levels of survivability
with significant reduction in resource consumption. In
the suggested backup scheme, we take advantage of the
flexibility and resource-sharing abilities of the NFV
paradigm in order to maintain only a few backup
servers, where each can serve one of multiple functions
when corresponding middleboxes are unavailable. We
describe different goals that network designers can
consider when determining which functions to implement
in each of the backup servers. We rely on a graph
theoretical model to find properties of efficient
assignments and to develop algorithms that can find
them. Extensive experiments show, for example, that
under realistic function failure probabilities, and
reasonable capacity limitations, one can obtain 99.9\%
survival probability with half the number of servers,
compared with standard techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pan:2017:PED,
author = "Xiaodan Pan and Tong Ye and Tony T. Lee and Weisheng
Hu and Xiaodan Pan and Tong Ye and Tony T. Lee and
Weisheng Hu",
title = "Power Efficiency and Delay Tradeoff of {10GBase-T}
Energy Efficient {Ethernet} Protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2773--2787",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703928",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the power efficiency and delay
performance of the burst mode transmission BTR strategy
for the IEEE 802.3az energy efficient Ethernet EEE
protocol. In the BTR strategy, the Ethernet interface
goes to sleep once its transmission buffer becomes
empty and wakes up as soon as the first arrival has
waited for time r or the N-th frame arrives at the
interface. Based on the number of arrivals during the
vacation time, a new approach is proposed to analyze
the M/G/1 queue with vacation times that are governed
by the arrival process and the r and N parameters of
BTR strategy. Our key idea is to establish the
connection between the vacation time and the arrival
process to account for their dependency. We first
derive the distribution of the number of arrivals
during a vacation time based on an event tree of the
BTR strategy, from which, we obtain the mean vacation
time and the power efficiency. Next, from the condition
on the number of arrivals at the end of a vacation
period, we derive a generalized P-K formula of the mean
delay for EEE systems, and prove that the classical P-K
formula of the vacation model is only a special case
when the vacation time is independent of the arrival
process. Our analysis demonstrates that the r policy
and N policy of the BTR strategy are compensating each
other. The r policy ensures the frame delay is bounded
when the traffic load is light, while the N policy
ensures the queue length at the end of vacation times
is bounded when the traffic load is heavy. These
results, in turn, provide the rules to select
appropriate r and N. Our analytical results are
confirmed by simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:EOA,
author = "Tao Wang and Fangming Liu and Hong Xu and Tao Wang and
Fangming Liu and Hong Xu",
title = "An Efficient Online Algorithm for Dynamic {SDN}
Controller Assignment in Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2788--2801",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2711641",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software defined networking is increasingly prevalent
in data center networks for it enables centralized
network configuration and management. However, since
switches are statically assigned to controllers and
controllers are statically provisioned, traffic
dynamics may cause long response time and incur high
maintenance cost. To address these issues, we formulate
the dynamic controller assignment problem DCAP as an
online optimization to minimize the total cost caused
by response time and maintenance on the cluster of
controllers. By applying the randomized fixed horizon
control framework, we decompose DCAP into a series of
stable matching problems with transfers, guaranteeing a
small loss in competitive ratio. Since the matching
problem is NP-hard, we propose a hierarchical two-phase
algorithm that integrates key concepts from both
matching theory and coalitional games to solve it
efficiently. Theoretical analysis proves that our
algorithm converges to a near-optimal Nash stable
solution within tens of iterations. Extensive
simulations show that our online approach reduces total
cost by about 46\%, and achieves better load balancing
among controllers compared with static assignment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2017:CIT,
author = "Rami Cohen and Yuval Cassuto and Rami Cohen and Yuval
Cassuto",
title = "Coding for Improved Throughput Performance in Network
Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2802--2814",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703118",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network switches and routers need to serve packet
writes and reads at rates that challenge the most
advanced memory technologies. As a result, scaling the
switching rates is commonly done by parallelizing the
packet I/Os using multiple memory units. For improved
read rates, packets can be coded upon write, thus
giving more flexibility at read time to achieve higher
utilization of the memory units. This paper presents a
detailed study of coded network switches, and in
particular, how to design them to maximize the
throughput advantages over standard uncoded switches.
Toward that objective, the paper contributes a variety
of algorithmic and analytical tools to improve and
evaluate the throughput performance. The most
interesting finding of this paper is that the placement
of packets in the switch memory is the key to both high
performance and algorithmic efficiency. One particular
placement policy we call \textquotedblleft design
placement\textquotedblright is shown to enjoy the best
combination of throughput performance and
implementation feasibility.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gomez-Vilardebo:2017:RAM,
author = "Jesus Gomez-Vilardebo and Jesus Gomez-Vilardebo",
title = "Routing in Accumulative Multi-Hop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2815--2828",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2703909",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper investigates the problem of finding optimal
paths in single-source single-destination accumulative
multi-hop networks. We consider a single source that
communicates to a single destination assisted by
several relays through multiple hops. At each hop, only
one node transmits, while all the other nodes receive
the transmitted signal, and store it after
processing/decoding and mixing it with the signals
received in previous hops. That is, we consider that
terminals make use of advanced energy accumulation
transmission/reception techniques, such as maximal
ratio combining reception of repetition codes, or
information accumulation with rateless codes.
Accumulative techniques increase communication
reliability, reduce energy consumption, and decrease
latency. We investigate the properties that a routing
metric must satisfy in these accumulative networks to
guarantee that optimal paths can be computed with
Dijkstra's algorithm. We model the problem of routing
in accumulative multi-hop networks, as the problem of
routing in a hypergraph. We show that optimality
properties in a traditional multi-hop network
monotonicity and isotonicity are no longer useful and
derive a new set of sufficient conditions for
optimality. We illustrate these results by studying the
minimum energy routing problem in static accumulative
multi-hop networks for different forwarding strategies
at relays.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:TCD,
author = "Xiaomei Zhang and Guohong Cao and Xiaomei Zhang and
Guohong Cao",
title = "Transient Community Detection and Its Application to
Data Forwarding in Delay Tolerant Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2829--2843",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2708090",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Community detection has received considerable
attention because of its applications to many practical
problems in mobile networks. However, when considering
temporal information associated with a community i.e.,
transient community, most existing community detection
methods fail due to their aggregation of contact
information into a single weighted or unweighted
network. In this paper, we propose a
contact-burst-based clustering method to detect
transient communities by exploiting pairwise contact
processes. In this method, we formulate each pairwise
contact process as a regular appearance of contact
bursts, during which most contacts between the pair of
nodes happen. Based on this formulation, we detect
transient communities by clustering the pairs of nodes
with similar contact bursts. Since it is difficult to
collect global contact information at individual nodes,
we further propose a distributed method to detect
transient communities. In addition to transient
community detection, we also propose a new data
forwarding strategy for delay tolerant networks, in
which transient communities serve as the data
forwarding unit. Evaluation results show that our
strategy can achieve a much higher data delivery ratio
than traditional community-based strategies with
comparable network overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Naribole:2017:SMH,
author = "Sharan Naribole and Edward Knightly and Sharan
Naribole and Edward Knightly",
title = "Scalable Multicast in Highly-Directional {$ 60$-GHz}
{WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2844--2857",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2717901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The 60-GHz bands target multi-gigabit rate
applications, such as high definition video streaming.
Unfortunately, to provide multicast service, the strong
directionality required at 60 GHz precludes serving all
clients in a multicast group with a single
transmission. Instead, a multicast transmission is
comprised of a sequence of beam-formed transmissions a
beam group that together cover all multicast group
members. In this paper, we design, implement, and
experimentally evaluate scalable directional multicast
SDM as a technique to 1 train the access point with
per-beam per-client RSSI measurements via partially
traversing a codebook tree. The training balances the
objectives of limiting overhead with collecting
sufficient data to form efficient beam groups. 2 Using
the available training information, we design a
scalable beam grouping algorithm that approximates the
minimum multicast group data transmission time. We
implement the key components of SDM and evaluate with a
combination of over-the-air experiments and
trace-driven simulations. Our results show that the
gains provided by SDM increase with group size and
provide near-optimal group selection with significantly
reduced training time, yielding up to 1.8 times
throughput gains over exhaustive-search training and
grouping.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nikkhah:2017:SEP,
author = "Mehdi Nikkhah and Aman Mangal and Constantine Dovrolis
and Roch Guerin and Mehdi Nikkhah and Aman Mangal and
Constantine Dovrolis and Roch Guerin",
title = "A Statistical Exploration of Protocol Adoption",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2858--2871",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2711642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The development and adoption of new protocols or of
extensions to existing protocols is arguably central to
the Internet's evolution. However, and in spite of over
40 years of experience with this process, we have
limited understanding of what factors may contribute to
a protocol's success. A sound technical design and a
well-grounded purpose are obviously important, but we
have many examples of failures that met those two
criteria. What other factors affect a protocol's
likelihood of success, and under what circumstances? We
investigate this question through a statistical
approach, based on analyzing a set of about 250
Internet standard documents, Internet engineering task
force request for comments RFCs. We characterize these
RFCs using a number of key features, which we then seek
to associate with positive or negative odds when it
comes to success. Our high-level results are intuitive,
e.g., protocols that call for Internet-wide adoption
face greater challenges. Focusing on more targeted
subsets of protocols reveals more subtle and possibly
more interesting differences between areas of the
Internet landscape. We also apply our prediction
framework to IPv6, and use different \textquotedblleft
what-if\textquotedblright scenarios to explore what
might have affected its deployment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2017:CTC,
author = "Zhichao Cao and Daibo Liu and Jiliang Wang and
Xiaolong Zheng",
title = "{Chase}: Taming Concurrent Broadcast for Flooding in
Asynchronous Duty Cycle Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2872--2885",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2712671",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Asynchronous duty cycle is widely used for energy
constraint wireless nodes to save energy. The basic
flooding service in asynchronous duty cycle networks,
however, is still far from efficient due to severe
packet collisions and contentions. We present Chase, an
efficient and fully distributed concurrent broadcast
layer for flooding in asynchronous duty cycle networks.
The main idea of Chase is to meet the strict signal
time and strength requirements e.g., Capture Effect for
concurrent broadcast while reducing contentions and
collisions. We propose a distributed random
inter-preamble packet interval adjustment approach to
constructively satisfy the requirements. Even when
requirements cannot be satisfied due to physical
constraints e.g., the difference of signal strength is
less than a 3 dB, we propose a lightweight signal
pattern recognition-based approach to identify such a
circumstance and extend radio-on time for packet
delivery. We implement Chase in TinyOS with TelosB
nodes and extensively evaluate its performance. The
implementation does not have any specific requirement
on the hardware and can be easily extended to other
platforms. The evaluation results also show that Chase
can significantly improve flooding efficiency in
asynchronous duty cycle networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:PNW,
author = "Huazhe Wang and Chen Qian and Ye Yu and Hongkun Yang
and Simon S. Lam and Huazhe Wang and Chen Qian and Ye
Yu and Hongkun Yang and Simon S. Lam",
title = "Practical Network-Wide Packet Behavior Identification
by {AP} Classifier",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2886--2899",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2720637",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Identifying the network-wide forwarding behaviors of a
packet is essential for many network management
applications, including rule verification, policy
enforcement, attack detection, traffic engineering, and
fault localization. Current tools that can perform
packet behavior identification either incur large time
and memory costs or do not support real-time updates.
In this paper, we present AP Classifier, a control
plane tool for packet behavior identification. AP
Classifier is developed based on the concept of atomic
predicates, which can be used to characterize the
forwarding behaviors of packets. Experiments using the
data plane network state of two real networks show that
the processing speed of AP Classifier is faster than
existing tools by at least an order of magnitude.
Furthermore, AP Classifier uses very small memory and
is able to support 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{Yang:2017:SVN,
author = "Hongkun Yang and Simon S. Lam and Hongkun Yang and
Simon S. Lam",
title = "Scalable Verification of Networks With Packet
Transformers Using Atomic Predicates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2900--2915",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2720172",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet transformers are widely used in ISPs,
datacenter infrastructures, and layer-2 networks.
Existing network verification tools do not scale to
large networks with transformers e.g., MPLS, IP-in-IP,
and NAT. Toward scalable verification, we conceived a
novel packet equivalence relation. For networks with
packet transformers, we first present a formal
definition of the packet equivalence relation. Our
transformer model is general, including most
transformers used in real networks. We also present a
new definition of atomic predicates that specify the
coarsest equivalence classes of packets in the packet
space. We designed an algorithm for computing these
atomic predicates. We built a verifier, named Atomic
Predicates for Transformers, and evaluated its
performance using four network data sets with MPLS
tunnels, IP-in-IP tunnels, and NATs. For a provider
cone data set with 11.6 million forwarding rules, 92
routers, 1920 duplex ports, and 40 MPLS tunnels which
use 170 transformers, APT used only 0.065 s, on
average, to compute the reachability tree from a source
port to all other ports for all packets and perform
loop detection as well. For the Stanford and Internet2
data sets with NATs, APT is faster than HSA Hassel in C
implementation by two to three orders of magnitude. By
working with atomic predicates instead of individual
packets, APT achieves verification performance gains by
orders of magnitude.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:ABF,
author = "Zhenghao Zhang and Zhenghao Zhang",
title = "Analog {Bloom} Filter and Contention-Free Multi-Bit
Simultaneous Query for Centralized Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2916--2929",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2715017",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, novel simultaneous query techniques are
proposed for wireless networks, which allow the access
point AP of the network to gather key control
information from active nodes in the network at low
overhead. The query techniques are based on OFDM, and
include the analog bloom filter ABF, with which active
nodes send signals simultaneously on randomly selected
subcarriers to inform the AP about their identities, as
well as the collision-free multi-bit CFM query, with
which nodes send signals simultaneously on
non-overlapping subcarriers to inform the AP about
their queue lengths. Both the ABF and CFM queries
require just one OFDM symbol as the response, and
therefore incur very low overhead. Based on ABF and
CFM, a simple medium access control MAC protocol,
called Muqmac, is also proposed, with which the AP can
obtain the queue states of the nodes and schedule data
transmissions in a centralized manner. ABF and CFM are
first evaluated with the 802.11n channel model and are
shown to achieve desirable performance. Both ABF and
CFM, as well as Muqmac, are also implemented on the
Microsoft Sora software-defined radio. The experimental
results show that after removing some obvious overhead
specific to the testbed, the MAC layer throughput of
Muqmac is over 75\% of the physical layer data rate
even under very challenging traffic conditions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Asadi:2017:DEF,
author = "Arash Asadi and Vincenzo Mancuso and Rohit Gupta and
Arash Asadi and Vincenzo Mancuso and Rohit Gupta",
title = "{DORE}: an Experimental Framework to Enable Outband
{D$2$D} Relay in Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2930--2943",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2712285",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Device-to-Device D2D communications represent a
paradigm shift in cellular networks. In particular,
analytical results on D2D performance for offloading
and relay are very promising, but no experimental
evidence validates these results to date. This paper is
the first to provide an experimental analysis of
outband D2D relay schemes. Moreover, we design D2D
opportunistic relay with QoS enforcement DORE, a
complete framework for handling channel opportunities
offered by outband D2D relay nodes. DORE consists of
resource allocation optimization tools and protocols
suitable to integrate QoS-aware opportunistic D2D
communications within the architecture of 3GPP
Proximity-based Services. We implement DORE using an
SDR framework to profile cellular network dynamics in
the presence of opportunistic outband D2D communication
schemes. Our experiments reveal that outband D2D
communications are suitable for relaying in a large
variety of delay-sensitive cellular applications, and
that DORE enables notable gains even with a few active
D2D relay nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2017:RRS,
author = "Tie Qiu and Aoyang Zhao and Feng Xia and Weisheng Si
and Dapeng Oliver Wu and Tie Qiu and Aoyang Zhao and
Feng Xia and Weisheng Si and Dapeng Oliver Wu",
title = "{ROSE}: Robustness Strategy for Scale-Free Wireless
Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2944--2959",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2713530",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the recent proliferation of cyber-attacks,
improving the robustness of wireless sensor networks
WSNs, so that they can withstand node failures has
become a critical issue. Scale-free WSNs are important,
because they tolerate random attacks very well;
however, they can be vulnerable to malicious attacks,
which particularly target certain important nodes. To
address this shortcoming, this paper first presents a
new modeling strategy to generate scale-free network
topologies, which considers the constraints in WSNs,
such as the communication range and the threshold on
the maximum node degree. Then, ROSE, a novel robustness
enhancing algorithm for scale-free WSNs, is proposed.
Given a scale-free topology, ROSE exploits the position
and degree information of nodes to rearrange the edges
to resemble an onion-like structure, which has been
proven to be robust against malicious attacks.
Meanwhile, ROSE keeps the degree of each node in the
topology unchanged such that the resulting topology
remains scale-free. The extensive experimental results
verify that our new modeling strategy indeed generates
scale-free network topologies for WSNs, and ROSE can
significantly improve the robustness of the network
topologies generated by our modeling strategy.
Moreover, we compare ROSE with two existing robustness
enhancing algorithms, showing that ROSE outperforms
both.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2017:ISS,
author = "Longbo Huang and Longbo Huang",
title = "Intelligence of Smart Systems: Model, Bounds, and
Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2960--2973",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2723300",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a general framework for understanding
system intelligence, i.e., the level of system
smartness perceived by users, and propose a novel
metric for measuring the intelligence levels of
dynamical human-in-the-loop systems, defined to be the
maximum average reward obtained by proactively serving
user demands, subject to a resource constraint. Our
metric captures two important elements of smartness,
i.e., being able to know what users want and pre-serve
them, and achieving good resource management while
doing so. We provide an explicit characterization of
the system intelligence, and show that it is jointly
determined by user demand volume opportunity to
impress, demand correlation user predictability, and
system resource and action costs flexibility to
pre-serve. We then propose an online learning-aided
control algorithm called learningaided budget-limited
intelligent system control LBISC, and show that LBISC
achieves an intelligence level that is within ONT -12+
\epsilon of the highest level, where NT represents the
number of data samples collected within a learning
period T and is proportional to the user population
size, while guaranteeing an OmaxNT -12 /\epsilon,
log1/\epsilon2 aver age resource deficit. Moreover, we
show that LBISC possesses an OmaxNT-12/\epsilon,
log1/\epsilon2 + T convergence time, which is smaller
compared with the \Theta 1/\epsilon time required for
existing non-learning-based algorithms. Our analysis
rigorously quantifies the impact of data and user
population captured by NT, learning captured by our
learning method, and control captured by LBISC on the
achievable system intelligence, and provides novel
insight and guideline into designing future smart
systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2017:FSC,
author = "Song Min Kim and Shigemi Ishida and Shuai Wang and
Tian He and Song Min Kim and Shigemi Ishida and Shuai
Wang and Tian He",
title = "Free Side-Channel Cross-Technology Communication in
Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2974--2987",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2724539",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Enabling direct communication between wireless
technologies immediately brings significant benefits
including, but not limited to, cross-technology
interference mitigation and context-aware smart
operation. To explore the opportunities, we propose
FreeBee --- a novel cross-technology communication
technique for direct unicast as well as
cross-technology/channel broadcast among three popular
technologies of WiFi, ZigBee, and Bluetooth. The key
concept of FreeBee is to modulate symbol messages by
shifting the timings of periodic beacon frames already
mandatory for diverse wireless standards. This keeps
our design generically applicable across technologies
and avoids additional bandwidth consumption i.e., does
not incur extra traffic, allowing continuous broadcast
to safely reach mobile and/or duty-cycled devices. A
new interval multiplexing technique is proposed to
enable concurrent broadcasts from multiple senders or
boost the transmission rate of a single sender.
Theoretical and experimental exploration reveals that
FreeBee offers a reliable symbol delivery under a
second and supports mobility of 30 mph and low
duty-cycle operations of under 5\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rai:2017:LFB,
author = "Anurag Rai and Chih-ping Li and Georgios Paschos and
Eytan Modiano and Anurag Rai and Chih-ping Li and
Georgios Paschos and Eytan Modiano",
title = "Loop-Free Backpressure Routing Using Link-Reversal
Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2988--3002",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2715807",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The backpressure routing policy is known to be a
throughput optimal policy that supports any feasible
traffic demand, but may have poor delay performance
when packets traverse loops in the network. In this
paper, we study loop-free backpressure routing policies
that forward packets along directed acyclic graphs DAGs
to avoid the looping problem. These policies use link
reversal algorithms to improve the DAGs in order to
support any achievable traffic demand. For a network
with a single commodity, we show that a DAG that
supports a given traffic demand can be found after a
finite number of iterations of the link-reversal
process. We use this to develop a joint link-reversal
and backpressure routing policy, called the loop free
backpressure LFBP algorithm. This algorithm forwards
packets on the DAG, while the DAG is dynamically
updated based on the growth of the queue backlogs. We
show by simulations that such a DAG-based policy
improves the delay over the classical backpressure
routing policy. We also propose a multicommodity
version of the LFBP algorithm and via simulation show
that its delay performance is better than that of
backpressure.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Brown:2017:MCC,
author = "Michael Brown and Colin Marshall and Dejun Yang and
Ming Li and Jian Lin and Guoliang Xue and Michael Brown
and Colin Marshall and Dejun Yang and Ming Li and Jian
Lin and Guoliang Xue",
title = "Maximizing Capacity in Cognitive Radio Networks Under
Physical Interference Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3003--3015",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2718022",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A fundamental problem in cognitive radio networks CRN
is the following capacity maximization in CRN CM-CRN
problem: given a set of primary links with a common
transmitter, together with a set of secondary links,
select a maximum cardinality subset of the links that
can concurrently transmit successfully under the
constraint that all primary links are selected. This
problem is intrinsically different from the well-known
link scheduling LS problem in wireless mesh networks,
which does not have the constraint to select all
primary links. In this paper, we make both theoretical
and practical contributions to the CM-CRN problem. To
achieve deep theoretical understanding of the problem,
we show that CM-CRN is NP-hard and design a polynomial
time approximation algorithm with a constant
approximation ratio. In addition, we extend the
designed algorithm to find approximate solutions to two
variations of CM-CRN, one with the objective of
maximizing the number of selected secondary links and
the other with multiple primary users. To achieve good
performance in practice, we design a simple but
effective heuristic algorithm based on a greedy
strategy. We also design an optimal algorithm based on
integer linear programming, which serves as a benchmark
for evaluating the performance of the approximation
algorithm and heuristic algorithm, for problem
instances of small sizes. Extensive evaluations show
that our proved constant ratio of the approximation
algorithm is considerably conservative and our
heuristic algorithm produces results that are very
close to the optimal solution. Our approximation
algorithm for CM-CRN is motivated by and can be viewed
as a non-trivial extension of the elegant approximation
algorithm for the LS problem by Wan et al. to CRNs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2017:MSA,
author = "Yongquan Fu and Ernst Biersack and Yongquan Fu and
Ernst Biersack",
title = "{MCR}: Structure-Aware Overlay-Based Latency-Optimal
Greedy Relay Search",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3016--3029",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2715331",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Geo-distributed network applications typically use
relays to process and forward timely messages among
clients. The state-of-the-art approaches greedily
locate a relay that is closer to clients based on an
overlay that favors neighbors in the immediate vicinity
of the current node. Unfortunately, as clients are
unknown a priori, the optimal relay is generally
outside of the immediate vicinity of the current node.
Consequently, the search process often terminates at a
poor local minimum. In this paper, we address these
challenges by designing and implementing a distributed
relay-search system called MCR. In order to accurately
locate a relay closer to clients, by observing that the
latency space exhibits a proximity clustering
phenomenon where nodes in the same cluster are
typically within close proximity, we propose an overlay
called MCRing that is aware of global proximity
clusters. In order to scale well under dynamic relays,
we maintain the proximity clusters via a
gossiping-based clustering process. Furthermore, we
propose a series of algorithms to accurately locate a
relay that is closer to clients and satisfies the load
constraints. We prove that the relay-search process
achieves close to optimal results based on a doubling
dimension-based analysis in an inframetric model.
Finally, extensive evaluation via simulation and
PlanetLab experiments shows that MCRing is able to
locate near-optimal relays.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mahdian:2017:TDS,
author = "Milad Mahdian and Edmund M. Yeh and Milad Mahdian and
Edmund M. Yeh",
title = "Throughput and Delay Scaling of Content-Centric Ad Hoc
and Heterogeneous Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3030--3043",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2718021",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the throughput and delay characteristics of
wireless caching networks, where users are mainly
interested in retrieving content stored in the network,
rather than in maintaining source-destination
communication. Nodes are assumed to be uniformly
distributed in the network area. Each node has a
limited-capacity content store, which it uses to cache
contents. We propose an achievable caching and
transmission scheme whereby requesters retrieve content
from the caching point, which is closest in the
Euclidean distance. We establish the throughput and
delay scaling of the achievable scheme, and show that
the throughput and delay performance are order-optimal
within a class of schemes. We then solve the caching
optimization problem, and evaluate the network
performance for a Zipf content popularity distribution,
letting the number of content types and the network
size both go to infinity. Finally, we extend our
analysis to heterogeneous wireless networks where, in
addition to wireless nodes, there are a number of base
stations uniformly distributed at random in the network
area. We show that in order to achieve a better
performance in a heterogeneous network in the order
sense, the number of base stations needs to be greater
than the ratio of the number of nodes to the number of
content types. Furthermore, we show that the
heterogeneous network does not yield performance
advantages in the order sense if the Zipf content
popularity distribution exponent exceeds 3/2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Caballero:2017:MTR,
author = "Pablo Caballero and Albert Banchs and Gustavo de
Veciana and Xavier Costa-Perez and Pablo Caballero and
Albert Banchs and Gustavo de Veciana and Xavier
Costa-Perez",
title = "Multi-Tenant Radio Access Network Slicing: Statistical
Multiplexing of Spatial Loads",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3044--3058",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2720668",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the slicing of radio access
network resources by multiple tenants, e.g., virtual
wireless operators and service providers. We consider a
criterion for dynamic resource allocation amongst
tenants, based on a weighted proportionally fair
objective, which achieves desirable fairness/protection
across the network slices of the different tenants and
their associated users. Several key properties are
established, including: the Pareto-optimality of user
association to base stations, the fair allocation of
base stations' resources, and the gains resulting from
dynamic resource sharing across slices, both in terms
of utility gains and capacity savings. We then address
algorithmic and practical challenges in realizing the
proposed criterion. We show that the objective is
NP-hard, making an exact solution impractical, and
design a distributed semi-online algorithm, which meets
performance guarantees in equilibrium and can be shown
to quickly converge to a region around the equilibrium
point. Building on this algorithm, we devise a
practical approach with limited computational
information and handoff overheads. We use detailed
simulations to show that our approach is indeed
near-optimal and provides substantial gains both to
tenants in terms of capacity savings and end users in
terms of improved performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mohaisen:2017:LOD,
author = "Aziz Mohaisen and Kui Ren and Aziz Mohaisen and Kui
Ren",
title = "Leakage of {.onion} at the {DNS} Root: Measurements,
Causes, and Countermeasures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3059--3072",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2717965",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Tor hidden services, one of the features of the
Tor anonymity network, are widely used for providing
anonymity to services within the Tor network. Tor uses
the .onion pseudo-top-level domain for naming
convention and to route requests to these hidden
services. The .onion namespace is not delegated to the
global domain name system DNS, and Tor is designed in
such a way that all .onion queries are routed within
the Tor network. However, and despite the careful
design of Tor, numerous .onion requests are still today
observed in the global DNS infrastructure, thus calling
for further investigation. In this paper, we present
the state of .onion requests received at the global DNS
and as viewed from two large DNS traces: a continuous
period of observation at the A and J DNS root nodes
over a longitudinal period of time and a synthesis of
Day In The Life of the Internet data repository that
gathers a synchronized DNS capture of two days per year
over multiple years. We found that .onion leakage in
the DNS infrastructure to be both prevalent and
persistent. Our characterization of the leakage shows
various features, including high volumes of leakage
that are diverse, geographically distributed, and
targeting various types of hidden services.
Furthermore, we found that various spikes in the .onion
request volumes can be correlated with various global
events, including geopolitical events. We attribute the
leakage to various causes that are plausible based on
various assessments, and provide various remedies with
varying benefits.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2017:JRS,
author = "Hongli Xu and Zhuolong Yu and Xiang-Yang Li and
Liusheng Huang and Chen Qian and Taeho Jung and Hongli
Xu and Zhuolong Yu and Xiang-Yang Li and Liusheng Huang
and Chen Qian and Taeho Jung",
title = "Joint Route Selection and Update Scheduling for
Low-Latency Update in {SDNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3073--3087",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2717441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to flow dynamics, a software defined network SDN
may need to frequently update its data plane so as to
optimize various performance objectives, such as load
balancing. Most previous solutions first determine a
new route configuration based on the current flow
status, and then update the forwarding paths of
existing flows. However, due to slow update operations
of Ternary Content Addressable Memory-based flow
tables, unacceptable update delays may occur,
especially in a large or frequently changed network.
According to recent studies, most flows have short
duration and the workload of the entire network will
vary significantly after a long duration. As a result,
the new route configuration may be no longer efficient
for the workload after the update, if the update
duration takes too long. In this paper, we address the
real-time route update, which jointly considers the
optimization of flow route selection in the control
plane and update scheduling in the data plane. We
formulate the delay-satisfied route update problem, and
prove its NP-hardness. Two algorithms with bounded
approximation factors are designed to solve this
problem. We implement the proposed methods on our SDN
test bed. The experimental results and extensive
simulation results show that our method can reduce the
route update delay by about 60\% compared with previous
route update methods while preserving a similar routing
performance with link load ratio increased less than
3\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sinha:2017:TOMb,
author = "Abhishek Sinha and Georgios Paschos and Eytan Modiano
and Abhishek Sinha and Georgios Paschos and Eytan
Modiano",
title = "Throughput-Optimal Multi-Hop Broadcast Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3088--3101",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2718534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We design throughput-optimal dynamic broadcast
algorithms for multi-hop networks with arbitrary
topologies. Most of the previous broadcast algorithms
route packets along spanning trees. For large
time-varying networks, computing and maintaining a set
of spanning trees is not efficient, as the
network-topology may change frequently. In this paper,
we design a class of dynamic algorithms, which make
simple packet-by-packet scheduling and routing
decisions, and hence obviate the need for maintaining
any global topological structures, such as spanning
trees. Our algorithms may be conveniently understood as
a non-trivial generalization of the familiar
back-pressure algorithm for unicast traffic, which
performs packet routing and scheduling based on queue
lengths. However, in the broadcast setting, due to
packet duplications, it is difficult to define
appropriate queuing structures. We design and prove the
optimality of a virtual queue-based algorithm, where
virtual queues are defined for subsets of nodes. We
then propose a multi-class broadcast policy, which
combines the above scheduling algorithm with
in-class-in-order packet forwarding, resulting in
significant reduction in complexity. Finally, we
evaluate the performance of the proposed algorithms via
extensive numerical simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vissicchio:2017:SER,
author = "Stefano Vissicchio and Luca Cittadini and Stefano
Vissicchio and Luca Cittadini",
title = "Safe, Efficient, and Robust {SDN} Updates by Combining
Rule Replacements and Additions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3102--3115",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2723461",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Disruption-free updates are a key primitive to
effectively operate SDN networks and maximize the
benefits of their programmability. In this paper, we
study how to implement this primitive safely with
respect to forwarding correctness and policies,
efficiently in terms of consumed network resources and
robustly to unpredictable factors, such as delayed
message delivery and processing. First, we analyze the
fundamental limitations of prior proposals, which
either: 1 progressively replace initial flow rules with
new ones or 2 instruct switches to maintain both
initial and final rules. Second, we show that safe,
efficient, and robust updates can be achieved by
leveraging a more general approach. We indeed unveil a
dualism between rule replacements and additions that
opens new degrees of freedom for supporting SDN
updates. Third, we demonstrate how to build upon this
dualism. We propose FLIP, an algorithm that computes
operational sequences combining the efficiency of rule
replacements with the applicability of rule additions.
FLIP identifies constraints on rule replacements and
additions that independently prevent safety violations
from occurring during the update. Then, it explores the
solution space by swapping constraints that prevent the
same safety violations, until it reaches a satisfiable
set of constraints. Fourth, we perform extensive
simulations, showing that FLIP can significantly
outperform prior work. In the average case, it
guarantees a much higher success rate than algorithms
only based on rule replacements, and massively reduces
the memory overhead needed by techniques solely using
rule additions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2017:SFS,
author = "Tong Yang and Alex X. Liu and Muhammad Shahzad and
Dongsheng Yang and Qiaobin Fu and Gaogang Xie and
Xiaoming Li and Tong Yang and Alex X. Liu and Muhammad
Shahzad and Dongsheng Yang and Qiaobin Fu and Gaogang
Xie and Xiaoming Li",
title = "A Shifting Framework for Set Queries",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3116--3131",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2730227",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Set queries are fundamental operations in computer
networks. This paper addresses the fundamental problem
of designing a probabilistic data structure that can
quickly process set queries using a small amount of
memory. We propose a shifting bloom filter ShBF
framework for representing and querying sets. We
demonstrate the effectiveness of ShBF using three types
of popular set queries: membership, association, and
multiplicity queries. The key novelty of ShBF is on
encoding the auxiliary information of a set element in
a location offset. In contrast, prior BF-based set data
structures allocate additional memory to store
auxiliary information. We further extend our shifting
framework from BF-based data structures to sketch-based
data structures, which are widely used to store
multiplicities of items. We conducted experiments using
real-world network traces, and results show that ShBF
significantly advances the state-of-the-art on all
three types of set queries.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2017:ESC,
author = "Song Min Kim and Shuai Wang and Tian He and Song Min
Kim and Shuai Wang and Tian He",
title = "Exploiting Spatiotemporal Correlation for Wireless
Networks Under Interference",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3132--3145",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2732238",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper starts from an empirical observation on the
existence of spatiotemporal correlation among nearby
wireless links within short time intervals. The
phenomenon due to correlated interference has become
pervasive with densely deployed wireless devices,
causing potential errors in existing popular metrics
built upon the assumption of link independence. To this
end, we propose correlated ETX cETX, which generalizes
the widely-adopted ETX to maintain the accuracy under
correlated links. To the best of our knowledge, this is
the first work to introduce a unified metric embracing
both temporal and spatiotemporal correlations. As a
generalized metric, the highlight of our work is the
broad applicability and effectiveness-extensive
evaluations on ZigBee 802.15.4 and Wi-Fi 802.11b/g/n
testbeds deployed in a lab, corridor, and on a bridge
reveal that: simply replacing ETX with cETX: 1 cuts
down the error by 62.1\%-70.2\% and 2 saves averages of
22\% and 37\% communication cost in three unicast and
nine broadcast protocols, respectively, under only
0.7\% additional overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cianfrani:2017:IDS,
author = "Antonio Cianfrani and Marco Listanti and Marco
Polverini and Antonio Cianfrani and Marco Listanti and
Marco Polverini",
title = "Incremental Deployment of Segment Routing Into an
{ISP} Network: a Traffic Engineering Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3146--3160",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2731419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Segment routing SR is a new routing paradigm to
provide traffic engineering TE capabilities in an IP
network. The main feature of SR is that no signaling
protocols are needed, since extensions of the interior
gateway protocol routing protocols are used. Despite
the benefit that SR brings, introducing a new
technology into an operational network presents many
difficulties. In particular, the network operators
consider both capital expenditure and performance
degradation as drawbacks for the deployment of the new
technology; for this reason, an incremental approach is
preferred. In this paper, we face the challenge of
managing the transition between a pure IP network to a
full SR one while optimizing the network performances.
We focus our attention on a network scenario where: 1
only a subset of nodes are SR-capable and 2 the TE
objective is the minimization of the maximum link
utilization. For such a scenario, we propose an
architectural solution, named SR domain SRD, to
guarantee the proper interworking between the IP
routers and the SR nodes. We propose a mixed integer
linear programming formulation to solve the SRD design
problem, consisting in identifying the subset of SR
nodes; moreover, a strategy to manage the routing
inside the SRD is defined. The performance evaluation
shows that the hybrid IP/SR network based on SRD offers
TE opportunities comparable to the one of a full SR
network. Finally, a heuristic method to identify nodes
to be inserted in the set of nodes composing the SRD is
discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liang:2017:AAC,
author = "Weifa Liang and Zichuan Xu and Wenzheng Xu and Jiugen
Shi and Guoqiang Mao and Sajal K. Das",
title = "Approximation Algorithms for Charging Reward
Maximization in Rechargeable Sensor Networks via a
Mobile Charger",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3161--3174",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2723605",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless energy transfer has emerged as a promising
technology for wireless sensor networks to power
sensors with controllable yet perpetual energy. In this
paper, we study sensor energy replenishment by
employing a mobile charger charging vehicle to charge
sensors wirelessly in a rechargeable sensor network, so
that the sum of charging rewards collected from all
charged sensors by the mobile charger per tour is
maximized, subject to the energy capacity of the mobile
charger, where the amount of reward received from a
charged sensor is proportional to the amount of energy
charged to the sensor. The energy of the mobile charger
will be spent on both its mechanical movement and
sensor charging. We first show that this problem is
NP-hard. We then propose approximation algorithms with
constant approximation ratios under two different
settings: one is that a sensor will be charged to its
full energy capacity if it is charged; another is that
a sensor can be charged multiple times per tour but the
total amount of energy charged is no more than its
energy demand prior to the tour. We finally evaluate
the performance of the proposed algorithms through
experimental simulations. The simulation results
demonstrate that the proposed algorithms are very
promising, and the solutions obtained are fractional of
the optimum. To the best of our knowledge, the proposed
algorithms are the very first approximation algorithms
with guaranteed approximation ratios for the mobile
charger scheduling in a rechargeable sensor network
under the energy capacity constraint on the mobile
charger.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:ECA,
author = "Peng Wang and Hong Xu and Zhixiong Niu and Dongsu Han
and Yongqiang Xiong and Peng Wang and Hong Xu and
Zhixiong Niu and Dongsu Han and Yongqiang Xiong",
title = "{Expeditus}: Congestion-Aware Load Balancing in {Clos}
Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3175--3188",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2731986",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data center networks often use multi-rooted Clos
topologies to provide a large number of equal cost
paths between two hosts. Thus, load balancing traffic
among the paths is important for high performance and
low latency. However, it is well known that ECMP-the de
facto load balancing scheme-performs poorly in data
center networks. The main culprit of ECMP's problems is
its congestion agnostic nature, which fundamentally
limits its ability to deal with network dynamics. We
propose Expeditus, a novel distributed congestion-aware
load balancing protocol for general 3-tier Clos
networks. The complex 3-tier Clos topologies present
significant scalability challenges that make a simple
per-path feedback approach infeasible. Expeditus
addresses the challenges by using simple local
information collection, where a switch only monitors
its egress and ingress link loads. It further employs a
novel two-stage path selection mechanism to aggregate
relevant information across switches and make path
selection decisions. Testbed evaluation on Emulab and
large-scale ns-3 simulations demonstrate that,
Expeditus outperforms ECMP by up to 45\% in tail flow
completion times FCT for mice flows, and by up to 38\%
in mean FCT for elephant flows in 3-tier Clos
networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Buratti:2017:EET,
author = "Chiara Buratti and Roberto Verdone and Chiara Buratti
and Roberto Verdone",
title = "End-to-End Throughput of Ad Hoc Multi-Hop Networks in
a {Poisson} Field of Interferers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3189--3202",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2729165",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a novel approach to assess the
performance in terms of end-to-end throughput of an ad
hoc multi-hop wireless network, where each link is
affected by interference coming from other multi-hop
paths nearby. The approach captures the mutual impact
of each path on all others. It can be applied to both,
contention-based and scheduled, medium access control
MAC protocols. Sources have data to send to destination
nodes through n relays. Nodes are assumed to be
uniformly and randomly distributed in the 2-D infinite
plane. The model shows the impact on the end-to-end
throughput of n; it also captures the influence of node
density, traffic generated, number of retransmissions,
and other MAC parameters. Finally, the model provides
the throughput-delay tradeoff. Unlike most previous
approaches, the mathematical tool proposed appears to
be scalable, allowing easy extension to any number of
hops. Comparison with simulation results is provided to
prove that the impact of the approximations introduced
in the analysis is almost negligible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fukuda:2017:DMA,
author = "Kensuke Fukuda and John Heidemann and Abdul Qadeer and
Kensuke Fukuda and John Heidemann and Abdul Qadeer",
title = "Detecting Malicious Activity With {DNS} Backscatter
Over Time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3203--3218",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2724506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network-wide activity is when one computer the
originator touches many others the targets. Motives for
activity may be benign mailing lists, content-delivery
networks, and research scanning, malicious spammers and
scanners for security vulnerabilities, or perhaps
indeterminate ad trackers. Knowledge of malicious
activity may help anticipate attacks, and understanding
benign activity may set a baseline or characterize
growth. This paper identifies domain name system DNS
backscatter as a new source of information about
network-wide activity. Backscatter is the reverse DNS
queries caused when targets or middleboxes
automatically look up the domain name of the
originator. Queries are visible to the authoritative
DNS servers that handle reverse DNS. While the fraction
of backscatter they see depends on the server's
location in the DNS hierarchy, we show that activity
that touches many targets appear even in sampled
observations. We use information about the queriers to
classify originator activity using machine-learning.
Our algorithm has reasonable accuracy and precision
70-80\% as shown by data from three different
organizations operating DNS servers at the root or
country level. Using this technique, we examine nine
months of activity from one authority to identify
trends in scanning, identifying bursts corresponding to
Heartbleed, and broad and continuous scanning of secure
shell.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dau:2017:LNF,
author = "Hoang Dau and Olgica Milenkovic and Hoang Dau and
Olgica Milenkovic",
title = "Latent Network Features and Overlapping Community
Discovery via {Boolean} Intersection Representations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "3219--3234",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2728638",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a new latent Boolean feature model for
complex networks that capture different types of node
interactions and network communities. The model is
based on a new concept in graph theory, termed the
Boolean intersection representation of a graph, which
generalizes the notion of an intersection
representation. We mostly focus on one form of Boolean
intersection, termed cointersection, and describe how
to use this representation to deduce node feature sets
and their communities. We derive several general bounds
on the minimum number of features used in
cointersection representations and discuss graph
families for which exact cointersection
characterizations are possible. Our results also
include algorithms for finding optimal and approximate
cointersection representations of a graph.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2017:DSD,
author = "Luoyi Fu and Xinzhe Fu and Zhiying Xu and Qianyang
Peng and Xinbing Wang and Songwu Lu",
title = "Determining Source--Destination Connectivity in
Uncertain Networks: Modeling and Solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3237--3252",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2725905",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Determination of source--destination connectivity in
networks has long been a fundamental problem, where
most existing works are based on deterministic graphs
that overlook the inherent uncertainty in network
links. To overcome such limitation, this paper models
the network as an uncertain graph, where each edge $e$
exists independently with some probability $ p e$. The
problem examined is that of determining whether a given
pair of nodes, a source $s$ and a destination $t$, are
connected by a path or separated by a cut. Assuming
that during each determining process we are associated
with an underlying graph, the existence of each edge
can be unraveled through edge testing at a cost of $ c
e$. Our goal is to find an optimal strategy incurring
the minimum expected testing cost with the expectation
taken over all possible underlying graphs that form a
product distribution. Formulating it into a
combinatorial optimization problem, we first
characterize the computational complexity of optimally
determining source--destination connectivity in
uncertain graphs. Specifically, through proving the
NP-hardness of two closely related problems, we show
that, contrary to its counterpart in deterministic
graphs, this problem cannot be solved in polynomial
time unless P = NP. Driven by the necessity of
designing an exact algorithm, we then apply the Markov
decision process framework to give a dynamic
programming algorithm that derives the optimal
strategies. As the exact algorithm may have prohibitive
time complexity in practical situations, we further
propose two more efficient approximation schemes
compromising the optimality. The first one is a simple
greedy approach with linear approximation ratio.
Interestingly, we show that naive as it is, and it
enjoys significantly better performance guarantee than
some other seemingly more sophisticated algorithms.
Second, by harnessing the submodularity of the problem,
we further design a more elaborate algorithm with
better approximation ratio. The effectiveness of the
proposed algorithms is justified through extensive
simulations on three real network data sets, from which
we demonstrate that the proposed algorithms yield
strategies with smaller expected cost than conventional
heuristics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bedogni:2017:DAV,
author = "Luca Bedogni and Angelo Trotta and Marco {Di Felice}
and Yue Gao and Xingjian Zhang and Qianyun Zhang and
Fabio Malabocchia and Luciano Bononi",
title = "Dynamic Adaptive Video Streaming on Heterogeneous
{TVWS} and {Wi-Fi} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3253--3266",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2728320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Nowadays, people usually connect to the Internet
through a multitude of different devices. Video
streaming takes the lion's share of the bandwidth, and
represents the real challenge for the service providers
and for the research community. At the same time, most
of the connections come from indoor, where Wi-Fi
already experiences congestion and coverage holes,
directly translating into a poor experience for the
user. A possible relief comes from the TV white space
TVWS networks, which can enhance the communication
range thanks to sub-GHz frequencies and favorable
propagation characteristics, but offer slower datarates
compared with other 802.11 protocols. In this paper, we
show the benefits that TVWS networks can bring to the
end user, and we present CABA, a connection aware
balancing algorithm able to exploit multiple radio
connections in the favor of a better user experience.
Our experimental results indicate that the TVWS network
can effectively provide a wider communication range,
but a load balancing middleware between the available
connections on the device must be used to achieve
better performance. We conclude this paper by
presenting real data coming from field trials in which
we streamed an MPEG dynamic adaptive streaming over
HTTP video over TVWS and Wi-Fi. Practical quantitative
results on the achievable quality of experience for the
end user are then reported. Our results show that
balancing the load between Wi-Fi and TVWS can provide a
higher playback quality up to 15\% of average quality
index in scenarios in which the Wi-Fi is received at a
low strength.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cano:2017:FCS,
author = "Cristina Cano and Douglas J. Leith and Andres
Garcia-Saavedra and Pablo Serrano",
title = "Fair Coexistence of Scheduled and Random Access
Wireless Networks: Unlicensed {LTE\slash WiFi}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3267--3281",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2731377",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the fair coexistence of scheduled and random
access transmitters sharing the same frequency channel.
Interest in coexistence is topical due to the need for
emerging unlicensed LTE technologies to coexist fairly
with WiFi. However, this interest is not confined to
LTE/WiFi as coexistence is likely to become
increasingly commonplace in IoT networks and beyond 5G.
In this paper, we show that mixing scheduled and random
access incurs an inherent throughput/delay cost and the
cost of heterogeneity. We derive the joint proportional
fair rate allocation, which casts useful light on
current LTE/WiFi discussions. We present experimental
results on inter-technology detection and consider the
impact of imperfect carrier sensing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sankaran:2017:DAS,
author = "Ganesh C. Sankaran and Krishna M. Sivalingam",
title = "Design and Analysis of Scheduling Algorithms for
Optically Groomed Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3282--3293",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2724081",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data center networks generate high volumes of traffic.
In order to reduce packet latency, packet transmissions
are often centrally scheduled. Such approaches have
been proposed for both packet-switched and hybrid
optical-packet switched networks. This paper
investigates algorithm design choices for transmission
scheduling in a tightly synchronized hybrid optical
packet data center network. This problem is studied in
two cases: with precedence where the requests are
scheduled in the order of arrival, and without
precedence, where the requests can be reordered in
time. It is shown that the problem without any
precedence constraints is NP-complete. For scheduling
with precedence constraints, a greedy algorithm is
proposed and shown to be optimal. Theoretical
approximation for the performance of scheduling with
the greedy algorithm is presented. Simulation
experiments were performed on a two-tier network with
1024 servers and 64 wavelengths. Parallel
implementation aspects of the scheduling algorithm are
also discussed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2017:STS,
author = "Chen Sun and Jun Bi and Haoxian Chen and Hongxin Hu
and Zhilong Zheng and Shuyong Zhu and Chenghui Wu",
title = "{SDPA}: Toward a Stateful Data Plane in
Software-Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3294--3308",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2726550",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the prevailing technique of software-defined
networking SDN, open flow introduces significant
programmability, granularity, and flexibility for many
network applications to effectively manage and process
network flows. However, open flow only provides a
simple ``match-action'' paradigm and lacks the
functionality of stateful forwarding for the SDN data
plane, which limits its ability to support advanced
network applications. Heavily relying on SDN
controllers for all state maintenance incurs both
scalability and performance issues. In this paper, we
propose a novel stateful data plane architecture SDPA
for the SDN data plane. A co-processing unit,
forwarding processor FP, is designed for SDN switches
to manage state information through new instructions
and state tables. We design and implement an extended
open flow protocol to support the communication between
the controller and FP. To demonstrate the practicality
and feasibility of our approach, we implement both
software and hardware prototypes of SDPA switches, and
develop a sample network function chain with stateful
firewall, domain name system DNS reflection defense,
and heavy hitter detection applications in one
SDPA-based switch. Experimental results show that the
SDPA architecture can effectively improve the
forwarding efficiency with manageable processing
overhead for those applications that need stateful
forwarding in SDN-based networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kogan:2017:EFR,
author = "Kirill Kogan and Sergey I. Nikolenko and Patrick
Eugster and Alexander Shalimov and Ori Rottenstreich",
title = "Efficient {FIB} Representations on Distributed
Platforms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3309--3322",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2728642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet routing ecosystem is facing substantial
scalability challenges due to continuous, significant
growth of the state represented in the data plane.
Distributed switch architectures introduce additional
constraints on efficiency of implementations from both
lookup time and memory footprint perspectives. In this
paper we explore efficient forwarding information base
FIB representations in common distributed switch
architectures. Our approach introduces substantial
savings in memory footprint transparently for existing
hardware. Our results are supported by an extensive
simulation study on real IPv4 and IPv6 FIBs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2017:EEU,
author = "Cheng-Shang Chang and Cheng-Yu Chen and Duan-Shin Lee
and Wanjiun Liao",
title = "Efficient Encoding of User {IDs} for Nearly Optimal
Expected Time-To-Rendezvous in Heterogeneous Cognitive
Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3323--3337",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2734695",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The multichannel rendezvous problem in cognitive radio
networks CRNs has been a hot research topic lately. One
of the most challenging settings of the multichannel
rendezvous problem is the oblivious rendezvous problem
in heterogeneous CRNs, where: 1 there are no
distinguishable roles of users; 2 users' clocks are not
synchronized; 3 users may have different available
channel sets; and 4 there is no universal labelling of
the channels. Most existing works in the literature
focus on achieving deterministic bounds for the maximum
conditional time-to-rendezvous MCTTR and perform poorly
in comparison with the random algorithm for the
expected time-to-rendezvous ETTR due to the ``stay''
modes in these works. In this paper, we tackle the
oblivious rendezvous problem by taking both MCTTR and
ETTR into consideration. In order to have guaranteed
rendezvous, we only make two assumptions: A1 there is
at least one common available channel and A2 there is a
unique ID for each user. We first propose a new class
of strong symmetrization mappings to encode user IDs
for speeding up the rendezvous process. Two efficient
and yet simple encoding schemes are proposed by
utilizing the $ \cal C $-transform and the existing
4B5B encoding. Based on the new class of strong
symmetrization mappings, we propose the two-prime
modular clock algorithm for the two-user rendezvous
problem. The ETTR of our algorithm is almost the same
as that of the random algorithm and its MCTTR is also
comparable to the best existing bound. We also extend
the two-prime modular clock algorithm for multiuser
rendezvous by proposing the stick together algorithm
and the spread out algorithm. One interesting finding
for the multiuser rendezvous problem is that the spread
out algorithm is not always better than the stick
together algorithm as commonly claimed 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{Fu:2017:DAS,
author = "Tom Z. J. Fu and Jianbing Ding and Richard T. B. Ma
and Marianne Winslett and Yin Yang and Zhenjie Zhang",
title = "{DRS}: Auto-Scaling for Real-Time Stream Analytics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3338--3352",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2741969",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a stream data analytics system, input data arrive
continuously and trigger the processing and updating of
analytics results. We focus on applications with
real-time constraints, in which, any data unit must be
completely processed within a given time duration. To
handle fast data, it is common to place the stream data
analytics system on top of a cloud infrastructure.
Because stream properties, such as arrival rates can
fluctuate unpredictably, cloud resources must be
dynamically provisioned and scheduled accordingly to
ensure real-time responses. It is essential, for
existing systems or future developments, to possess the
ability of scaling resources dynamically according to
the instantaneous workload, in order to avoid wasting
resources or failing in delivering the correct
analytics results on time. Motivated by this, we
propose DRS, a dynamic resource scaling framework for
cloud-based stream data analytics systems. DRS
overcomes three fundamental challenges: 1 how to model
the relationship between the provisioned resources and
the application performance, 2 where to best place
resources, and 3 how to measure the system load with
minimal overhead. In particular, DRS includes an
accurate performance model based on the theory of
Jackson open queueing networks and is capable of
handling arbitrary operator topologies, possibly with
loops, splits, and joins. Extensive experiments with
real data show that DRS is capable of detecting
sub-optimal resource allocation and making quick and
effective resource adjustment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gardner:2017:BMJ,
author = "Kristen Gardner and Mor Harchol-Balter and Alan
Scheller-Wolf and Benny {Van Houdt}",
title = "A Better Model for Job Redundancy: Decoupling Server
Slowdown and Job Size",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3353--3367",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2744607",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent computer systems research has proposed using
redundant requests to reduce latency. The idea is to
replicate a request so that it joins the queue at
multiple servers. The request is considered complete as
soon as any one of its copies completes. Redundancy
allows us to overcome server-side variability--the fact
that a server might be temporarily slow due to factors
such as background load, network interrupts, and
garbage collection to reduce response time. In the past
few years, queueing theorists have begun to study
redundancy, first via approximations, and, more
recently, via exact analysis. Unfortunately, for
analytical tractability, most existing theoretical
analysis has assumed an Independent Runtimes IR model,
wherein the replicas of a job each experience
independent runtimes service times at different
servers. The IR model is unrealistic and has led to
theoretical results that can be at odds with computer
systems implementation results. This paper introduces a
much more realistic model of redundancy. Our model
decouples the inherent job size $X$ from the
server-side slowdown $S$, where we track both $S$ and
$X$ for each job. Analysis within the $S$ \& $X$ model
is, of course, much more difficult. Nevertheless, we
design a dispatching policy, Redundant-to-Idle-Queue,
which is both analytically tractable within the $S$ \&
$X$ model and has provably excellent performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tran:2017:AOR,
author = "Tien Tran and Min Kyung An and Dung T. Huynh",
title = "Antenna Orientation and Range Assignment Algorithms in
Directional {WSNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3368--3381",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2743008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Consider a set $S$ of nodes in the plane such that the
unit-disk graph $ G(S)$ spanning all nodes is
connected. Each node in $S$ is equipped with a
directional antenna with beam-width $ \theta = \pi / 2
$. The objective of the directional antenna orientation
AO problem concerning symmetric connectivity is to
determine an orientation of the antennas with a minimum
transmission power range $ r = O(1) $ such that the
induced symmetric communication graph is connected.
Another related problem is the AO and power assignment
AOPA problem whose objective is to assign each node $ u
\in S $ an orientation of its antenna as well as a
range $ r(u) $ such that the induced symmetric
communication graph is connected and the total power
assigned $ \Sigma_{u \in S} r u^\beta $ is minimized,
where $ \beta \geq 1 $ is the distance-power gradient
typically $ 2 \leq \beta \leq 5 $. In this paper, we
study both problems by first proving that they are
NP-hard. We then propose two algorithms for the AO
problem that orient the antennas to yield a symmetric
connected communication graph where the transmission
power ranges are bounded by 9 and 7, respectively,
which are currently the best results for this problem.
We also propose constant-factor approximation
algorithms for the AOPA problem where our constants are
smaller than Aschner et al's. Finally, we study the
performance of our algorithms through simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2017:CDO,
author = "Zongqing Lu and Xiao Sun and Thomas {La Porta}",
title = "Cooperative Data Offload in Opportunistic Networks:
From Mobile Devices to Infrastructure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3382--3395",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2747621",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Opportunistic mobile networks consisting of
intermittently connected mobile devices have been
exploited for various applications, such as
computational offloading and mitigating cellular
traffic load. In contrast to existing work, in this
paper, we focus on cooperatively offloading data among
mobile devices to maximally improve the probability of
data delivery from a mobile device to intermittently
connected infrastructure within a given time
constraint, which is referred to as the cooperative
offloading problem. Unfortunately, the estimation of
data delivery probability over an opportunistic path is
difficult and cooperative offloading is NP-hard. To
this end, we first propose a probabilistic framework
that provides the estimation of such probability. Based
on the proposed probabilistic framework, we design a
heuristic algorithm to solve cooperative offloading at
a low computation cost. Due to the lack of global
information, a distributed algorithm is further
proposed. The performance of the proposed approaches is
evaluated based on both synthetic networks and real
traces. Experimental results show that the
probabilistic framework can accurately estimate the
data delivery probability, cooperative offloading
greatly improves the delivery probability, the
heuristic algorithm approximates the optimum, and the
performance of both the heuristic algorithm and
distributed algorithm outperforms other approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sapountzis:2017:UAH,
author = "Nikolaos Sapountzis and Thrasyvoulos Spyropoulos and
Navid Nikaein and Umer Salim",
title = "User Association in {HetNets}: Impact of Traffic
Differentiation and Backhaul Limitations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3396--3410",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2746011",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Operators, struggling to continuously add capacity and
upgrade their architecture to keep up with data traffic
increase, are turning their attention to denser
deployments that improve spectral efficiency. Denser
deployments make the problem of user association
challenging, and much work has been devoted to finding
algorithms that strike a tradeoff between user quality
of service, and network-wide performance
load-balancing. Nevertheless, the majority of these
algorithms typically consider simple setups with a
single type of traffic, usually elastic non-guaranteed
bit rate GBR. They also focus on the radio access part,
ignoring the backhaul topology and potential capacity
limitations. Backhaul constraints are emerging as a key
performance bottleneck in future networks, partly due
to the continuous improvement of the radio interface,
and partly due to the need for inexpensive backhaul
links to reduce capital and operational expenditures.
To this end, we propose an analytical framework for
user association that jointly considers radio access
and backhaul network performance. Specifically, we
derive an algorithm that takes into account spectral
efficiency, base station load, backhaul link capacities
and topology, and two traffic classes GBR and non-GBR
in both the uplink and downlink directions. We prove
analytically an optimal user association rule that ends
up maximizing either an arithmetic or a weighted
harmonic mean of the achieved performance along
different dimensions e.g., uplink and downlink
performances or GBR and non-GBR performances. We then
use extensive simulations to study the impact of: 1
traffic differentiation; and 2 backhaul capacity
limitations and topology on key performance metrics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:SOM,
author = "Mingwei Zhang and Jun Li and Scott Brooks",
title = "{I-Seismograph}: Observing, Measuring, and Analyzing
{Internet} Earthquakes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3411--3426",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2748902",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Disruptive events, such as large-scale power outages,
undersea cable cuts, or security attacks, could have an
impact on the Internet and cause the Internet to
deviate from its normal state of operation, which we
also refer to as an ``Internet earthquake.'' As the
Internet is a large, complex moving target,
unfortunately little research has been done to define,
observe, quantify, and analyze such impact on the
Internet, whether it is during a past event period or
in real time. In this paper, we devise an Internet
seismograph, or I-seismograph, to fill this gap. Since
routing is the most basic function of the Internet and
the Border Gateway Protocol BGP is the de facto
standard inter-domain routing protocol, we focus on BGP
to observe, measure, and analyze the Internet
earthquakes. After defining what an impact to BGP
entails, we describe how I-seismograph observes and
measures the impact, exemplify its usage during both
old and recent disruptive events, and further validate
its accuracy and convergency. Finally, we show that
I-seismograph can further be used to help analyze what
happened to BGP while BGP experienced an impact,
including which autonomous systems AS were affected
most or which AS paths or path segments surged
significantly in BGP updates during an Internet
earthquake.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2017:TAV,
author = "Yong Cui and Zhenjie Yang and Shihan Xiao and Xin Wang
and Shenghui Yan",
title = "Traffic-Aware Virtual Machine Migration in
Topology-Adaptive {DCN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3427--3440",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2744643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Virtual machine VM migration is a key technique for
network resource optimization in modern data center
networks. Previous work generally focuses on how to
place the VMs efficiently in a static network topology
by migrating the VMs with large traffic demands to
close servers. As the flow demands between VMs change,
however, a great cost will be paid for the VM
migration. In this paper, we propose a new paradigm for
VM migration by dynamically constructing adaptive
topologies based on the VM demands to lower the cost of
both VM migration and communication. We formulate the
traffic-aware VM migration problem in an adaptive
topology and show its NP-hardness. For periodic
traffic, we develop a novel
progressive-decompose-rounding algorithm to schedule VM
migration in polynomial time with a proved
approximation ratio. For highly dynamic flows, we
design an online decision-maker ODM algorithm with
proved performance bound. Extensive trace-based
simulations show that PDR and ODM can achieve about
four times flow throughput among VMs with less than a
quarter of the migration cost compared to other
state-of-art VM migration solutions. We finally
implement an OpenvSwitch-based testbed and demonstrate
the efficiency 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{Cui:2017:LNC,
author = "Ying Cui and Muriel Medard and Edmund Yeh and Douglas
Leith and Fan Lai and Ken R. Duffy",
title = "A Linear Network Code Construction for General Integer
Connections Based on the Constraint Satisfaction
Problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3441--3454",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2746755",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of finding network codes for general
connections is inherently difficult in capacity
constrained networks. Resource minimization for general
connections with network coding is further complicated.
Existing methods for identifying solutions mainly rely
on highly restricted classes of network codes, and are
almost all centralized. In this paper, we introduce
linear network mixing coefficients for code
constructions of general connections that generalize
random linear network coding for multicast connections.
For such code constructions, we pose the problem of
cost minimization for the subgraph involved in the
coding solution and relate this minimization to a
path-based constraint satisfaction problem CSP and an
edge-based CSP. While CSPs are NP-complete in general,
we present a path-based probabilistic distributed
algorithm and an edge-based probabilistic distributed
algorithm with almost sure convergence in finite time
by applying communication free learning. Our approach
allows fairly general coding across flows, guarantees
no greater cost than routing, and shows a possible
distributed implementation. Numerical results
illustrate the performance improvement of our approach
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{Bhattacharya:2017:AMI,
author = "Abhijit Bhattacharya and Anurag Kumar",
title = "Analytical Modeling of {IEEE 802.11}-Type {CSMA\slash
CA} Networks With Short Term Unfairness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3455--3472",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2747406",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider single-hop topologies with saturated
transmitting nodes, using carrier-sense multiple access
with collision avoidance CSMA/CA for medium access, as
standardized under the IEEE 802.11 distributed
coordination function. We study systems where one or
more backoff parameters of the CSMA/CA protocol the
initial backoff, the backoff multiplier, and the number
of retries are different from the standard. It is known
that, for several classes of these protocol parameters,
such systems exhibit a certain performance anomaly
known as short term unfairness. We also find that the
phenomenon of short term unfairness is observed in
systems where the propagation delays among the
participating nodes are not negligible compared with
the duration of a backoff slot, even when the nodes use
the default backoff parameters of the standard. It also
turns out that the standard fixed point analysis
technique and its simple extensions does not predict
the system behavior well in such cases. For systems
with large propagation delays, we observe that, as
propagation delay increases, the collision probability
of a node initially increases, but then flattens out,
contrary to what is predicted by the standard fixed
point approximation. Our study of several example
systems reveals some interesting connections between
the protocol parameters, the number of nodes, the
propagation delay, and the degree of unfairness. This
paper reveals that the inability of the standard fixed
point model to capture the performance in such cases is
due to its state-independent attempt rate assumption.
In this paper, we develop a novel approximate, but
accurate, analysis that uses state-dependent attempt
rates with a parsimonious state representation for
computational tractability. The analytical method is
also able to quantify the extent of short term
unfairness in the system, something not possible with
existing analytical techniques, and can, therefore, be
used to tune the protocol parameters to achieve desired
throughput and fairness objectives.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deng:2017:TWF,
author = "Lei Deng and Chih-Chun Wang and Minghua Chen and
Shizhen Zhao",
title = "Timely Wireless Flows With General Traffic Patterns:
Capacity Region and Scheduling Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3473--3486",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2749513",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most existing wireless networking solutions are
best-effort and do not provide any delay guarantee
required by important applications, such as mobile
multimedia conferencing and real-time control of
cyber-physical systems. Recently, Hou and Kumar
provided a novel framework for analyzing and designing
delay-guaranteed wireless networking solutions. While
inspiring, their idle-time-based analysis applies only
to flows with a special traffic pattern called the
frame-synchronized setting. The problem remains largely
open for general traffic patterns. This paper addresses
this challenge by proposing a general framework that
characterizes and achieves the complete
delay-constrained capacity region with general traffic
patterns in single-hop downlink access-point wireless
networks. We first show that the timely wireless flow
problem is fundamentally an infinite-horizon Markov
decision process MDP. Then, we judiciously combine
different simplification methods to prove that the
timely capacity region can be characterized by a
finite-size convex polygon. This for the first time
allows us to characterize the timely capacity region of
wireless flows with general traffic patterns. We then
design three scheduling policies to optimize network
utility and/or support feasible timely throughput
vectors for general traffic patterns. The first policy
achieves the optimal network utility and supports any
feasible timely throughput vector but suffers from the
curse of dimensionality. The second and third policies
are inspired by our MDP framework and are of much lower
complexity. Simulation results show that both achieve
near-optimal performance and outperform other existing
alternatives.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2017:FTV,
author = "Jiao Zhou and Zhao Zhang and Shaojie Tang and Xiaohui
Huang and Yuchang Mo and Ding-Zhu Du",
title = "Fault-Tolerant Virtual Backbone in Heterogeneous
Wireless Sensor Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3487--3499",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2740328",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To save energy and alleviate interference, connected
dominating set CDS was proposed to serve as a virtual
backbone of wireless sensor networks WSNs. Because
sensor nodes may fail due to accidental damages or
energy depletion, it is desirable to construct a fault
tolerant virtual backbone with high redundancy in both
coverage and connectivity. This can be modeled as a
$k$-connected $m$-fold dominating set abbreviated as $
k, m$-CDS problem. A node set $ C \subseteq V G$ is a $
k, m$-CDS of graph $G$ if every node in $ V G
\backslash C$ is adjacent with at least $m$ nodes in
$C$ and the subgraph of $G$ induced by $C$ is
$k$-connected. Constant approximation algorithm is
known for $ 3, m$-CDS in unit disk graph, which models
homogeneous WSNs. In this paper, we present the first
performance guaranteed approximation algorithm for $ 3,
m$-CDS in a heterogeneous WSN. In fact, our performance
ratio is valid for any topology. The performance ratio
is at most $ \gamma $, where $ \gamma = \alpha + 8 + 2
\ln 2 \alpha - 6$ for $ \alpha \geq 4$ and $ \gamma = 3
\alpha + 2 \ln 2$ for $ \alpha < 4$, and $ \alpha $ is
the performance ratio for the minimum $ 2, m$-CDS
problem. Using currently best known value of $ \alpha
$, the performance ratio is $ \ln \delta + o \ln \delta
$, where $ \delta $ is the maximum degree of the graph,
which is asymptotically best possible in view of the
non-approximability of the problem. Applying our
algorithm on a unit disk graph, the performance ratio
is less than 27, improving previous ratio 62.3 by a
large amount for the $ 3, m$-CDS problem on a unit disk
graph.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2017:GTD,
author = "Ye Liu and Chung Shue Chen and Chi Wan Sung and
Chandramani Singh",
title = "A Game Theoretic Distributed Algorithm for {FeICIC}
Optimization in {LTE-A HetNets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3500--3513",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2748567",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See corrections \cite{Liu:2018:CGT}.",
abstract = "To obtain good network performance in Long Term
Evolution-Advanced LTE-A heterogeneous networks
HetNets, enhanced inter-cell interference coordination
eICIC and further eICIC FeICIC have been proposed by
LTE standardization bodies to address the entangled
inter-cell interference and the user association
problems. We propose the distributed algorithms based
on the exact potential game framework for both eICIC
and FeICIC optimizations. We demonstrate via
simulations a 64\% gain on energy efficiency EE
achieved by eICIC and another 17\% gain on EE achieved
by FeICIC. We also show that FeICIC can bring other
significant gains in terms of cell-edge throughput,
spectral efficiency, and fairness among user
throughputs. Moreover, we propose a downlink scheduler
based on a cake-cutting algorithm that can further
improve the performance of the optimization algorithms
compared with conventional schedulers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yoon:2017:FWS,
author = "Changhoon Yoon and Seungsoo Lee and Heedo Kang and
Taejune Park and Seungwon Shin and Vinod Yegneswaran
and Phillip Porras and Guofei Gu",
title = "Flow Wars: Systemizing the Attack Surface and Defenses
in Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3514--3530",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2748159",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Emerging software defined network SDN stacks have
introduced an entirely new attack surface that is
exploitable from a wide range of launch points. Through
an analysis of the various attack strategies reported
in prior work, and through our own efforts to enumerate
new and variant attack strategies, we have gained two
insights. First, we observe that different SDN
controller implementations, developed independently by
different groups, seem to manifest common sets of
pitfalls and design weakness that enable the extensive
set of attacks compiled in this paper. Second, through
a principled exploration of the underlying design and
implementation weaknesses that enables these attacks,
we introduce a taxonomy to offer insight into the
common pitfalls that enable SDN stacks to be broken or
destabilized when fielded within hostile computing
environments. This paper first captures our
understanding of the SDN attack surface through a
comprehensive survey of existing SDN attack studies,
which we extend by enumerating 12 new vectors for SDN
abuse. We then organize these vulnerabilities within
the well-known confidentiality, integrity, and
availability model, assess the severity of these
attacks by replicating them in a physical SDN testbed,
and evaluate them against three popular SDN
controllers. We also evaluate the impact of these
attacks against published SDN defense solutions.
Finally, we abstract our findings to offer the research
and development communities with a deeper understanding
of the common design and implementation pitfalls that
are enabling the abuse of SDN networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2017:SCW,
author = "Haipeng Dai and Yunhuai Liu and Guihai Chen and
Xiaobing Wu and Tian He and Alex X. Liu and Huizhen
Ma",
title = "Safe Charging for Wireless Power Transfer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3531--3544",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2750323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As battery-powered mobile devices become more popular
and energy hungry, wireless power transfer technology,
which allows the power to be transferred from a charger
to ambient devices wirelessly, receives intensive
interests. Existing schemes mainly focus on the power
transfer efficiency but overlook the health impairments
caused by RF exposure. In this paper, we study the safe
charging problem SCP of scheduling power chargers so
that more energy can be received while no location in
the field has electromagnetic radiation EMR exceeding a
given threshold $ R_t $. We show that SCP is NP-hard
and propose a solution, which provably outperforms the
optimal solution to SCP with a relaxed EMR threshold $
1 - \epsilon R_t $. Testbed results based on 8
Powercast TX91501 chargers validate our results.
Extensive simulation results show that the gap between
our solution and the optimal one is only 6.7\% when $
\epsilon = 0.1 $, while a naive greedy algorithm is
34.6\% below our solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2017:CNF,
author = "Ruozhou Yu and Guoliang Xue and Xiang Zhang",
title = "The Critical Network Flow Problem: Migratability and
Survivability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3545--3558",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2747588",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a new network abstraction,
termed critical network flow, which models the
bandwidth requirement of modern Internet applications
and services. A critical network flow defines a
conventional flow in a network with explicit
requirement on its aggregate bandwidth, or the flow
value as commonly termed. Unlike common
bandwidth-guaranteed connections whose bandwidth is
only guaranteed during normal operations, a critical
network flow demands strictly enforced bandwidth
guarantee during various transient network states, such
as network reconfiguration or network failures. Such a
demand is called the bandwidth criticality of a
critical network flow, which is characterized both by
its flow value and capability to satisfy bandwidth
guarantee in the transient states.We study algorithmic
solutions to the accommodation of critical network
flows with different bandwidth criticalities, including
the basic case with no transient network state
considered, the case with network reconfiguration, and
the case with survivability against link failures. We
present a polynomial-time optimal algorithm for each
case. For the survivable case, we further present a
faster heuristic algorithm. We have conducted extensive
experiments to evaluate our model and validate our
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:DWE,
author = "Ju Wang and Jie Xiong and Hongbo Jiang and Xiaojiang
Chen and Dingyi Fang",
title = "{D-Watch}: Embracing {``Bad''} Multipaths for
Device-Free Localization With {COTS RFID} Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3559--3572",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2747583",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Device-free localization, which does not require any
device attached to the target, is playing a critical
role in many applications, such as intrusion detection,
elderly monitoring and so on. This paper introduces
D-Watch, a device-free system built on the top of low
cost commodity-off-the-shelf RFID hardware. Unlike
previous works which consider multipaths detrimental,
D-Watch leverages the ``bad'' multipaths to provide a
decimeter-level localization accuracy without offline
training. D-Watch harnesses the angle-of-arrival
information from the RFID tags' backscatter signals.
The key intuition is that whenever a target blocks a
signal's propagation path, the signal power experiences
a drop which can be accurately detected by the proposed
novel P-MUSIC algorithm. The proposed wireless phase
calibration scheme does not interrupt the ongoing data
communication and thus reduces the deployment burden.
We implement and evaluate D-Watch with extensive
experiments in three different environments. D-Watch
achieves a median accuracy of 16.5 cm for library, 25.5
cm for laboratory, and 31.2 cm for hall environment,
outperforming the state-of-the-art systems. In a table
area of 2 $ \text {m} \times 2 $ m, D-Watch can track a
user's fist at a median accuracy of 5.8 cm. D-Watch is
also capable of localizing multiple targets which is
well known to be challenging in passive localization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:CDD,
author = "Quan Chen and Hong Gao and Siyao Cheng and Xiaolin
Fang and Zhipeng Cai and Jianzhong Li",
title = "Centralized and Distributed Delay-Bounded Scheduling
Algorithms for Multicast in Duty-Cycled Wireless Sensor
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3573--3586",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2754405",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multicast is an important way to diffuse data in
duty-cycled wireless sensor networks WSNs, where nodes
can receive data only in active state. The
communication delay can be extremely large if
inappropriate schedules are adopted. Unfortunately,
most previous methods do not consider controlling
multicast delay energy-efficiently. This paper studies
the minimum active time slot augmentation for
delay-bounded multicast MAADM problem in duty-cycled
WSNs. The MAADM problem is proved to be NP-hard even
under the node-exclusive interference model. An optimal
algorithm is proposed for the MAADM problem when $ K =
2 $ and a heuristic latency bounding algorithm is
proposed for source-to-all communications, where $K$
denotes the number of the destination nodes. When $ K >
2$, two $ K - 1$-approximation algorithms are designed
for the MAADM problem. In addition, a low
computation-complexity distributed algorithm is
proposed. To the best of our knowledge, this is the
first work that develops a series of efficient
centralized and distributed algorithms for the MAADM
problem in duty-cycled WSNs. The theoretical analysis
and experimental results verify that all the proposed
algorithms have high performance in terms of delivery
delay 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{Xu:2017:MFS,
author = "Hongli Xu and Zhuolong Yu and Chen Qian and Xiang-Yang
Li and Zichun Liu and Liusheng Huang",
title = "Minimizing Flow Statistics Collection Cost Using
Wildcard-Based Requests in {SDNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3587--3601",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2748588",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a software-defined network SDN, the control plane
needs to frequently collect flow statistics measured at
the data plane switches for different applications,
such as traffic engineering, QoS routing, and attack
detection. However, existing solutions for flow
statistics collection may result in large bandwidth
cost in the control channel and long processing delay
on switches, which significantly interfere with the
basic functions, such as packet forwarding and route
update. To address this challenge, we propose a
cost-optimized flow statistics collection CO-FSC scheme
and a cost-optimized partial flow statistics collection
CO-PFSC scheme using wildcard-based requests, and prove
that both the CO-FSC and CO-PFSC problems are NP-hard.
For CO-FSC, we present a rounding-based algorithm with
an approximation factor $f$, where $f$ is the maximum
number of switches visited by each flow. For CO-PFSC,
we present an approximation algorithm based on
randomized rounding for collecting statistics
information of a part of flows in a network. Some
practical issues are discussed to enhance our
algorithms, for example, the applicability of our
algorithms. Moreover, we extend CO-FSC to achieve the
control link cost optimization FSC problem, and also
design an algorithm with an approximation factor $f$
for this problem. We implement our designed flow
statistics collection algorithms on the open virtual
switch-based SDN platform. The testing and extensive
simulation results show that the proposed algorithms
can reduce the bandwidth overhead by over 39\% and
switch processing delay by over 45\% compared with the
existing solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2017:RDC,
author = "Xin Wang and Richard T. B. Ma and Yinlong Xu",
title = "The Role of Data Cap in Optimal Two-Part Network
Pricing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3602--3615",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2750173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet services are traditionally priced at flat
rates; however, many Internet service providers ISPs
have recently shifted toward two-part tariffs where a
data cap is imposed to restrain data demand from heavy
users. Although the two-part tariff could generally
increase the revenue for ISPs and has been supported by
the U.S. FCC, the role of data cap and its optimal
pricing structures are not well understood. In this
paper, we study the impact of data cap on the optimal
two-part pricing schemes for congestion-prone service
markets. We model users' demand and preferences over
pricing and congestion alternatives and derive the
market share and congestion of service providers under
a market equilibrium. Based on the equilibrium model,
we characterize the two-part structures of the revenue-
and welfare-optimal pricing schemes. Our results reveal
that: 1 the data cap provides a mechanism for ISPs to
make a transition from the flat-rate to pay-as-you-go
type of schemes; 2 both of the revenue and welfare
objectives will drive ISP's pricing toward more
usage-based schemes with diminishing data caps; and 3
the welfare-optimal tariff comprises lower fees than
the revenue-optimal counterpart, suggesting that
regulators might want to promote usage-based pricing
but regulate the lump-sum and per-unit fees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2017:EEA,
author = "Xiaofeng Gao and Zhiyin Chen and Fan Wu and Guihai
Chen",
title = "Energy Efficient Algorithms for $k$-Sink Minimum
Movement Target Coverage Problem in Mobile Sensor
Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3616--3627",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2756925",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Energy consumption is a fundamental and critical issue
in wireless sensor networks. Mobile sensors consume
much more energy during the movement than that during
the communication or sensing process. Thus how to
schedule mobile sensors and minimize their moving
distance, while keeping the coverage requirement has
great significance to researchers. In this paper, we
study the target coverage problem in mobile sensor
networks where all the targets need to be covered by
sensors continuously. Our goal is to minimize the
moving distance of sensors to cover all targets in the
surveillance region, which is in Euclidean space. Here
initially all the sensors are located at $k$ base
stations. Thus, we define this problem as $k$-Sink
Minimum Movement Target Coverage. To solve this
problem, we propose a polynomial-time approximation
scheme, named Energy Effective Movement Algorithm EEMA.
We prove that the approximation ratio of EEMA is $ 1 +
\varepsilon $ and the time complexity is $ n^{O1 /
\varepsilon^2}$. We also propose a distributed version
of EEMA D-EEMA for large-scale networks where EEMA is
not efficient enough in practice. Finally, we conduct
experiments to validate the efficiency and
effectiveness of EEMA and D-EEMA.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Checco:2017:FRD,
author = "Alessandro Checco and Doug J. Leith",
title = "Fast, Responsive Decentralized Graph Coloring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3628--3640",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2751544",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Graph coloring problem arises in numerous networking
applications. We solve it in a fully decentralized way
i.e., with no message passing. We propose a novel
algorithm that is automatically responsive to topology
changes, and we prove that it converges to a proper
coloring in $ \mathcal {O}(N \log N) $ time with high
probability for generic graphs, when the number of
available colors is greater than $ \Delta $, the
maximum degree of the graph, and in $ \mathcal {O}(\log
N) $ time if $ \Delta = \mathcal {O}(1) $. We believe
the proof techniques used in this paper are of
independent interest and provide new insight into the
properties required to ensure fast convergence of
decentralized algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chatterjee:2017:WCR,
author = "Avhishek Chatterjee and Lav R. Varshney and Sriram
Vishwanath",
title = "Work Capacity of Regulated Freelance Platforms:
Fundamental Limits and Decentralized Schemes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3641--3654",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2766280",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Crowdsourcing of jobs to online freelance platforms is
rapidly gaining popularity. Most crowdsourcing
platforms are uncontrolled and offer freedom to
customers and freelancers to choose each other. This
works well for unskilled jobs e.g., image
classification with no specific quality requirement
since freelancers are functionally identical. For
skilled jobs e.g., software development with specific
quality requirements, however, this does not ensure
that the maximum number of job requests is satisfied.
In this paper, we determine the capacity of regulated
freelance systems, in terms of maximum satisfied job
requests, and propose centralized schemes that achieve
capacity. To ensure decentralized operation and freedom
for customers and freelancers, we propose simple
schemes compatible with the operation of current
crowdsourcing platforms that approximately achieve
capacity. Furthermore, for settings where the number of
job requests exceeds capacity, we propose a scheme that
is agnostic of that information, but is optimal and
fair in declining jobs without wait.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fiessler:2017:HEH,
author = "Andreas Fiessler and Claas Lorenz and Sven Hager and
Bjorn Scheuermann and Andrew W. Moore",
title = "{HyPaFilter+}: Enhanced Hybrid Packet Filtering Using
Hardware Assisted Classification and Header Space
Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3655--3669",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2749699",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Firewalls, key components for secured network
infrastructures, are faced with two different kinds of
challenges: first, they must be fast enough to classify
network packets at line speed, and second, their packet
processing capabilities should be versatile in order to
support complex filtering policies. Unfortunately, most
existing classification systems do not qualify equally
well for both requirements: systems built on
special-purpose hardware are fast, but limited in their
filtering functionality. In contrast, software filters
provide powerful matching semantics, but struggle to
meet line speed. This motivates the combination of
parallel, yet complexity-limited specialized circuitry
with a slower, but versatile software firewall. The key
challenge in such a design arises from the dependencies
between classification rules due to their relative
priorities within the rule set: complex rules requiring
software-based processing may be interleaved at
arbitrary positions between those where hardware
processing is feasible. Therefore, we discuss
approaches for partitioning and transforming rule sets
for hybrid packet processing. As a result, we propose
HyPaFilter+, a hybrid classification system consisting
of an FPGA-based hardware matcher and a Linux netfilter
firewall, which provides a simple, yet effective
hardware/software packet shunting algorithm. Our
evaluation shows up to 30-fold throughput gains over
software packet processing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shafiee:2017:SCA,
author = "Mehrnoosh Shafiee and Javad Ghaderi",
title = "A Simple Congestion-Aware Algorithm for Load Balancing
in Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3670--3682",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2751251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of load balancing in datacenter
networks, namely, assigning the end-to-end data flows
among the available paths in order to efficiently
balance the load in the network. The solutions used
today rely typically on an equal-cost multi path ECMP
mechanism, which essentially attempts to balance the
load in the network by hashing the flows to the
available shortest paths. However, it is well-known
that the ECMP performs poorly when there is asymmetry
either in the network topology or the flow sizes, and
thus, there has been much interest recently in
alternative mechanisms to address these shortcomings.
In this paper, we consider a general network topology
where each link has a cost, which is a convex function
of the link congestions. Flows among the various
source--destination pairs are generated dynamically
over time, each with a size bandwidth requirement and a
duration. Once a flow is assigned to a path in the
network, it consumes bandwidth equal to its size from
all the links along its path for its duration. We
consider low-complexity congestion-aware algorithms
that assign the flows to the available paths in an
online fashion and without splitting. Specifically, we
propose a myopic algorithm that assigns every arriving
flow to an available path with the minimum marginal
cost i.e., the path which yields the minimum increase
in the network cost after assignment and prove that it
asymptotically minimizes the total network cost.
Extensive simulation results are presented to verify
the performance of the myopic algorithm under a wide
range of traffic conditions and under different
datacenter architectures. Furthermore, we propose
randomized versions of our myopic algorithm, which have
much lower complexity and empirically show that they
can still perform very well in symmetric network
topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aggarwal:2017:SFC,
author = "Vaneet Aggarwal and Yih-Farn Robin Chen and Tian Lan
and Yu Xiang",
title = "{Sprout}: a Functional Caching Approach to Minimize
Service Latency in Erasure-Coded Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3683--3694",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2749879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern distributed storage systems often use erasure
codes to protect against disk and node failures to
increase reliability, while trying to meet the latency
requirements of the applications and clients. Storage
systems may have caches at the proxy or client ends in
order to reduce the latency. In this paper, we consider
a novel caching framework with erasure code called
functional caching. Functional caching involves using
erasure-coded chunks in the cache such that the code
formed by the chunks in storage nodes and cache
combined are maximal-distance-separable erasure codes.
Based on the arrival rates of different files,
placement of file chunks on the servers, and the
service time distribution of storage servers, an
optimal functional caching placement and the access
probabilities of the file request from different disks
are considered. The proposed algorithm gives
significant latency improvement in both simulations and
a prototyped solution in an open-source, cloud storage
deployment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Munari:2017:SGA,
author = "Andrea Munari and Petri Mahonen and Marina Petrova",
title = "A Stochastic Geometry Approach to Asynchronous {Aloha}
Full-Duplex Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3695--3708",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2750908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In-band full-duplex is emerging as a promising
solution to enhance throughput in wireless networks.
Allowing nodes to simultaneously send and receive data
over the same bandwidth can potentially double the
system capacity, and a good degree of maturity has been
reached for physical layer design, with practical
demonstrations in simple topologies. However, the true
potential of full-duplex at a system level is yet to be
fully understood. In this paper, we introduce an
analytical framework based on stochastic geometry that
captures the behavior of large full-duplex networks
implementing an asynchronous random access policy based
on Aloha. Via exact expressions, we discuss the key
tradeoffs that characterize these systems, exploring
among the rest the role of transmission duration,
imperfect self-interference cancellation, and fraction
of full-duplex nodes in the network. We also provide
protocol design principles, and our comparison with
slotted systems sheds light on the performance loss
induced by the lack of synchronism.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahmed:2017:DLE,
author = "Faraz Ahmed and Jeffrey Erman and Zihui Ge and Alex X.
Liu and Jia Wang and He Yan",
title = "Detecting and Localizing End-to-End Performance
Degradation for Cellular Data Services Based on {TCP}
Loss Ratio and Round Trip Time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3709--3722",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2761758",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Providing high end-to-end E2E performance experienced
by users is critical for cellular service providers to
best serve their customers. This paper focuses on the
detection and localization of E2E performance
degradation such as slow webpage page loading and
unsmooth video playing at cellular service providers.
Detecting and localizing E2E performance degradation is
crucial for cellular service providers, content
providers, device manufactures, and application
developers to jointly troubleshoot root causes. To the
best of our knowledge, the detection and localization
of E2E performance degradation at cellular service
providers has not been previously studied. In this
paper, we propose a holistic approach to detecting and
localizing E2E performance degradation at cellular
service providers across the four dimensions of user
locations, content providers, device types, and
application types. Our approach consists of three
steps: modeling, detection, and localization. First, we
use training data to build models that can capture the
normal performance of every E2E instance, which means
the flows corresponding to a specific location, content
provider, device type, and application type. Second, we
use our models to detect performance degradation for
each E2E instance on an hourly basis. Third, after each
E2E instance has been labeled as non-degrading or
degrading, we use association rule mining techniques to
localize the source of performance degradation. Our
system detected performance degradation instances over
a period of one week. In 80\% of the detected degraded
instances, content providers, device types, and
application types were the only factors of performance
degradation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:FTA,
author = "Chaoli Zhang and Fan Wu and Xiaofeng Gao and Guihai
Chen",
title = "Free Talk in the Air: a Hierarchical Topology for {60
GHz} Wireless Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3723--3737",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2755670",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the development of 60 GHz technology, data
centers are going to be wireless. A fundamental
challenge in wireless data center networking is how to
efficiently use 60 GHz wireless technology to improve
the performance. Many existing works have been proposed
for this, but most of them do not perform well in
connectivity or may not be flexible for different
environments in data centers. This paper presents
Graphite, a novel network structure that has many
desirable features for wireless data centers. The whole
architecture can be suitable for several different
deployments of data centers. In Graphite, the problem
of link blockage can be properly solved. Graphite makes
best use of the propagation distance of 60 GHz and
allows one server to communicate with as many other
servers as possible. Graphite also improves the average
node degree, which is more than any other existing
wireless topologies on the same condition. Furthermore,
Graphite can be suitable for data center with different
deployments. We build a small testbed of Graphite to
demonstrate its ability to solve the problem of link
blockage. Results from theoretical analysis and
extensive evaluations show that Graphite is a viable
wireless topology for data center networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2017:CEE,
author = "Qingjun Xiao and Shigang Chen and You Zhou and Min
Chen and Junzhou Luo and Tengli Li and Yibei Ling",
title = "Cardinality Estimation for Elephant Flows: a Compact
Solution Based on Virtual Register Sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3738--3752",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2753842",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For many practical applications, it is a fundamental
problem to estimate the flow cardinalities over big
network data consisting of numerous flows especially a
large quantity of mouse flows mixed with a small number
of elephant flows, whose cardinalities follow a
power-law distribution. Traditionally the research on
this problem focused on using a small amount of memory
to estimate each flow's cardinality from a large range
up to $ 10^9 $. However, although the memory needed for
each individual flow has been greatly compressed, when
there is an extremely large number of flows, the
overall memory demand can still be very high, exceeding
the availability under some important scenarios, such
as implementing online measurement modules in network
processors using only on-chip cache memory. In this
paper, instead of allocating a separated data structure
called estimator for each flow, we take a different
path by viewing all the flows together as a whole: Each
flow is allocated with a virtual estimator, and these
virtual estimators share a common memory space. We
discover that sharing at the multi-bit register level
is superior than sharing at the bit level. We propose a
unified framework of virtual estimators that allows us
to apply the idea of sharing to an array of cardinality
estimation solutions, e.g., HyperLogLog and PCSA,
achieving far better memory efficiency than the best
existing work. Our experiment shows that the new
solution can work in a tight memory space of less than
1 bit per flow or even one tenth of a bit per flow ---
a quest that has never been realized before.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fan:2017:SSP,
author = "Jingyuan Fan and Chaowen Guan and Kui Ren and Yong Cui
and Chunming Qiao",
title = "{SPABox}: Safeguarding Privacy During Deep Packet
Inspection at a {MiddleBox}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3753--3766",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2753044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Widely used over the Internet to encrypt traffic,
HTTPS provides secure and private data communication
between clients and servers. However, to cope with
rapidly changing and sophisticated security attacks,
network operators often deploy middleboxes to perform
deep packet inspection DPI to detect attacks and
potential security breaches, using techniques ranging
from simple keyword matching to more advanced machine
learning and data mining analysis. But this creates a
problem: how can middleboxes, which employ DPI, work
over HTTPS connections with encrypted traffic while
preserving privacy? In this paper, we present SPABox, a
middlebox-based system that supports both keyword-based
and data analysis-based DPI functions over encrypted
traffic. SPABox preserves privacy by using a novel
protocol with a limited connection setup overhead. We
implement SPABox on a standard server and show that
SPABox is practical for both long-lived and short-lived
connection. Compared with the state-of-the-art Blindbox
system, SPABox is more than five orders of magnitude
faster and requires seven orders of magnitude less
bandwidth for connection setup while SPABox can achieve
a higher security level.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2017:EAC,
author = "Tingwei Zhu and Dan Feng and Fang Wang and Yu Hua and
Qingyu Shi and Jiahao Liu and Yongli Cheng and Yong
Wan",
title = "Efficient Anonymous Communication in {SDN}-Based Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3767--3780",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2751616",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the rapid growth of application migration, the
anonymity in data center networks becomes important in
breaking attack chains and guaranteeing user privacy.
However, existing anonymity systems are designed for
the Internet environment, which suffer from high
computational and network resource consumption and
deliver low performance, thus failing to be directly
deployed in data centers. In order to address this
problem, this paper proposes an efficient and easily
deployed anonymity scheme for software defined
networking-based data centers, called mimic channel
MIC. The main idea behind MIC is to conceal the
communication participants by modifying the
source/destination addresses, such as media access
control MAC and Internet protocol IP address at switch
nodes, so as to achieve anonymity. Compared with the
traditional overlay-based approaches, our in-network
scheme has shorter transmission paths and less
intermediate operations, thus achieving higher
performance with less overhead. We also propose a
collision avoidance mechanism to ensure the correctness
of routing, and three mechanisms to enhance the
traffic-analysis resistance. To enhance the
practicality, we further propose solutions to enable
MIC co-existing with some MIC-incompatible systems,
such as packet analysis systems, intrusion detection
systems, and firewall systems. Our security analysis
demonstrates that MIC ensures unlinkability and
improves traffic-analysis resistance. Our experiments
show that MIC has extremely low overhead compared with
the base-line transmission control protocol TCP or
secure sockets layer SSL, e.g., less than 1\% overhead
in terms of throughput. Experiments on MIC-based
distributed file system show the applicability and
efficiency of MIC.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2017:DIC,
author = "Xiaolong Zheng and Jiliang Wang and Longfei Shangguan
and Zimu Zhou and Yunhao Liu",
title = "Design and Implementation of a {CSI}-Based Ubiquitous
Smoking Detection System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3781--3793",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2752367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Even though indoor smoking ban is being put into
practice in civilized countries, existing vision or
sensor-based smoking detection methods cannot provide
ubiquitous detection service. In this paper, we take
the first attempt to build a ubiquitous passive smoking
detection system, Smokey, which leverages the patterns
smoking leaves on WiFi signal to identify the smoking
activity even in the non-line-of-sight and through-wall
environments. We study the behaviors of smokers and
leverage the common features to recognize the series of
motions during smoking, avoiding the target-dependent
training set to achieve the high accuracy. We design a
foreground detection-based motion acquisition method to
extract the meaningful information from multiple noisy
subcarriers even influenced by posture changes. Without
the requirement of target's compliance, we leverage the
rhythmical patterns of smoking to detect the smoking
activities. We also leverage the diversity of multiple
antennas to enhance the robustness of Smokey. Due to
the convenience of integrating new antennas, Smokey is
scalable in practice for ubiquitous smoking detection.
We prototype Smokey with the commodity WiFi
infrastructure and evaluate its performance in real
environments. Experimental results show Smokey is
accurate and robust in various scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2017:FTF,
author = "Kun Xie and Xiaocan Li and Xin Wang and Gaogang Xie
and Jigang Wen and Jiannong Cao and Dafang Zhang",
title = "Fast Tensor Factorization for Accurate {Internet}
Anomaly Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3794--3807",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2761704",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Detecting anomalous traffic is a critical task for
advanced Internet management. Many anomaly detection
algorithms have been proposed recently. However,
constrained by their matrix-based traffic data model,
existing algorithms often suffer from low accuracy in
anomaly detection. To fully utilize the
multi-dimensional information hidden in the traffic
data, this paper takes the initiative to investigate
the potential and methodologies of performing tensor
factorization for more accurate Internet anomaly
detection. More specifically, we model the traffic data
as a three-way tensor and formulate the anomaly
detection problem as a robust tensor recovery problem
with the constraints on the rank of the tensor and the
cardinality of the anomaly set. These constraints,
however, make the problem extremely hard to solve.
Rather than resorting to the convex relaxation at the
cost of low detection performance, we propose TensorDet
to solve the problem directly and efficiently. To
improve the anomaly detection accuracy and tensor
factorization speed, TensorDet exploits the
factorization structure with two novel techniques,
sequential tensor truncation and two-phase anomaly
detection. We have conducted extensive experiments
using Internet traffic trace data Abilene and
G{\`E}ANT. Compared with the state of art algorithms
for tensor recovery and matrix-based anomaly detection,
TensorDet can achieve significantly lower false
positive rate and higher true positive rate.
Particularly, benefiting from our well designed
algorithm to reduce the computation cost of tensor
factorization, the tensor factorization process in
TensorDet is 5 Abilene and 13 G{\`E}ANT times faster
than that of the traditional Tucker decomposition
solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2017:TAT,
author = "Tao Zhang and Jianxin Wang and Jiawei Huang and Jianer
Chen and Yi Pan and Geyong Min",
title = "Tuning the Aggressive {TCP} Behavior for Highly
Concurrent {HTTP} Connections in Intra-Datacenter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3808--3822",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2759300",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern data centers host diverse hyper text transfer
protocol HTTP-based services, which employ persistent
transmission control protocol TCP connections to send
HTTP requests and responses. However, the ON/OFF
pattern of HTTP traffic disturbs the increase of TCP
congestion window, potentially triggering packet loss
at the beginning of ON period. Furthermore, the
transmission performance becomes worse due to severe
congestion in the concurrent transfer of HTTP response.
In this paper, we provide the first extensive study to
investigate the root cause of performance degradation
of highly concurrent HTTP connections in data center
network. We further present the design and
implementation of TCP-TRIM, which employs probe packets
to smooth the aggressive increase of congestion window
in persistent TCP connection and leverages congestion
detection and control at end-host to limit the growth
of switch queue length under highly concurrent TCP
connections. The experimental results of at-scale
simulations and real implementations demonstrate that
TCP-TRIM reduces the completion time of HTTP response
by up to 80\%, while introducing little deployment
overhead only at the end hosts.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2017:TSM,
author = "Lei Yang and Yao Li and Qiongzheng Lin and Huanyu Jia
and Xiang-Yang Li and Yunhao Liu",
title = "{Tagbeat}: Sensing Mechanical Vibration Period With
{COTS RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3823--3835",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2769138",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional vibration inspection systems, equipped
with separated sensing and communication modules, are
either very expensive e.g., hundreds of dollars and/or
suffer from occlusion and narrow field of view e.g.,
laser. In this paper, we present an RFID-based
solution, Tagbeat, to inspect mechanical vibration
using COTS RFID tags and readers. Making sense of micro
and high-frequency vibration using random and
low-frequency readings of tag has been a daunting task,
especially challenging for achieving sub-millisecond
period accuracy. Our system achieves these three goals
by discerning the change pattern of backscatter signal
replied from the tag, which is attached on the
vibrating surface and displaced by the vibration within
a small range. This paper introduces three main
innovations. First, it shows how one can utilize COTS
RFID to sense mechanical vibration and accurately
discover its period with a few periods of short and
noisy samples. Second, a new digital microscope is
designed to amplify the micro-vibration-induced weak
signals. Third, Tagbeat introduces compressive reading
to inspect high-frequency vibration with relatively low
RFID read rate. We implement Tagbeat using a COTS RFID
device and evaluate it with a commercial centrifugal
machine. Empirical benchmarks with a prototype show
that Tagbeat can inspect the vibration period with a
mean accuracy of 0.36 ms and a relative error rate of
0.03\%. We also study three cases to demonstrate how to
associate our inspection solution with the specific
domain requirements.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2017:DAV,
author = "Haiying Shen and Liuhua Chen",
title = "Distributed Autonomous Virtual Resource Management in
Datacenters Using Finite-{Markov} Decision Process",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3836--3849",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2759276",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "To provide robust infrastructure as a service, clouds
currently perform load balancing by migrating virtual
machines VMs from heavily loaded physical machines PMs
to lightly loaded PMs. Previous reactive load balancing
algorithms migrate VMs upon the occurrence of load
imbalance, while previous proactive load balancing
algorithms predict PM overload to conduct VM migration.
However, both methods cannot maintain long-term load
balance and produce high overhead and delay due to
migration VM selection and destination PM selection. To
overcome these problems, in this paper, we propose a
proactive Markov Decision Process MDP-based load
balancing algorithm. We handle the challenges of
allying MDP in virtual resource management in cloud
datacenters, which allows a PM to proactively find an
optimal action to transit to a lightly loaded state
that will maintain for a longer period of time. We also
apply the MDP to determine destination PMs to achieve
long-term PM load balance state. Our algorithm reduces
the numbers of service level agreement SLA violations
by long-term load balance maintenance, and also reduces
the load balancing overhead e.g., CPU time and energy
and delay by quickly identifying VMs and destination
PMs to migrate. We further propose enhancement methods
for higher performance. First, we propose a cloud
profit oriented reward system in the MDP model so that
when the MDP tries to maximize the rewards for load
balance, it concurrently improves the actual profit of
the datacenter. Second, we propose a new MDP model,
which considers the actions for both migrating a VM out
of a PM and migrating a VM into a PM, in order to
reduce the overhead and improve the effectiveness of
load balancing. Our trace-driven experiments show that
our algorithm outperforms both previous reactive and
proactive load balancing algorithms in terms of SLA
violation, load balancing efficiency, and long-term
load balance maintenance. Our experimental results also
show the effectiveness of our proposed enhancement
methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sharifnassab:2017:PNS,
author = "Arsalan Sharifnassab and S. Jamaloddin Golestani",
title = "On the Possibility of Network Scheduling With
Polynomial Complexity and Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3850--3862",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2761191",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Considering the collection of all networks with
independent set interference model, Shah, Tse, and
Tsitsiklis showed that there exist scheduling
algorithms with polynomial complexity and delay, only
if the maximum independent set problem can be solved in
polynomial time equivalently, P=NP. In this paper, we
extend this result to arbitrary collections of networks
and present a clear-cut criterion for the existence of
polynomial complexity and delay scheduling algorithms
relative to a given collection of networks with
arbitrary interference models, not confined to
independent set interference or SINR models, and not
necessarily encompassing all network topologies. This
amounts to the equivalence of polynomial scheduling and
effective approximation of maximum weighted actions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gomez-Vilardebo:2017:CDE,
author = "Jesus Gomez-Vilardebo",
title = "Competitive Design of Energy Harvesting Communications
in Wireless Fading Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3863--3872",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2757515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the design of online transmission
strategies for slotted energy harvesting point-to-point
communication systems in wireless fading channels.
Online transmission strategies decide the amount of
energy allocated to each transmission slot based on the
energy harvested amounts and channel gains observed in
the current and previous time slots. Offline
strategies, in contrast, assume non-causal knowledge of
future energy arrivals and channel gains. We adopt a
worst case design objective. For a given online policy,
we are interested in computing its maximum rate gap
that is defined as the difference between the offline
and online rates, maximized over all possible energy
arrivals and channel states. The competitive rate gap
is then defined as the minimum maximum rate gap over
all possible online strategies. Here, we obtain, within
a constant, the maximum rate gap for the Myopic policy,
which equally distributes the available energy over the
remaining slots, and provide an upper and a lower bound
on the competitive rate gap. Moreover, we propose a new
online policy targeting the competitive rate gap.
Numerical results show that the policy proposed
performs close to the competitive rate gap lower bound
in constant and arbitrarily varying channels, and
obtains good performance with real energy harvesting
traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:TCB,
author = "Haiyang Wang and Tong Li and Ryan Shea and Xiaoqiang
Ma and Feng Wang and Jiangchuan Liu and Ke Xu",
title = "Toward Cloud-Based Distributed Interactive
Applications: Measurement, Modeling, and Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "3--16",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2765246",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "With the prevalence of broadband network and wireless
mobile network accesses, distributed interactive
applications DIAs such as online gaming have attracted
a vast number of users over the Internet. The
deployment of these systems, however, comes with
peculiar hardware/software requirements on the user
consoles. Recently, such industrial pioneers as Gaikai,
Onlive, and Ciinow have offered a new generation of
cloud-based DIAs CDIAs, which shifts the necessary
computing loads to cloud platforms and largely relieves
the pressure on individual user's consoles. In this
paper, we aim to understand the existing CDIA framework
and highlight its design challenges. Our measurement
reveals the inside structures as well as the operations
of real CDIA systems and identifies the critical role
of cloud proxies. While its design makes effective use
of cloud resources to mitigate client's workloads, it
may also significantly increase the interaction latency
among clients if not carefully handled. Besides the
extra network latency caused by the cloud proxy
involvement, we find that computation-intensive tasks
e.g., game video encoding and bandwidth-intensive tasks
e.g., streaming the game screens to clients together
create a severe bottleneck in CDIA. Our experiment
indicates that when the cloud proxies are virtual
machines VMs in the cloud, the computation-intensive
and bandwidth-intensive tasks may seriously interfere
with each other. We accordingly capture this feature in
our model and present an interference-aware solution.
This solution not only smartly allocates workloads but
also dynamically assigns capacities across VMs based on
their arrival/departure patterns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dressler:2018:AVB,
author = "Falko Dressler and Florian Klingler and Christoph
Sommer and Reuven Cohen",
title = "Not All {VANET} Broadcasts Are the Same: Context-Aware
Class Based Broadcast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "17--30",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2763185",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A major building block of Vehicular Ad Hoc Networks
VANETs is broadcasting: the use of wireless
communication for sharing information among vehicles,
or between the vehicles and infrastructure. Dozens of
broadcast protocols have been developed in recent
years, including protocols for 1-hop broadcasting of
vehicle status information beaconing and for
geocasting-based applications. However, most of these
protocols were designed for one application and cannot
co-exist, nor can one broadcast solution meet the
demands of all applications. These observations
motivated our effort to develop a holistic network
layer for VANETs. We identify the need for making VANET
broadcast context-aware, and for supporting four
different classes of broadcast protocols, each with its
own properties. These classes are not only able to
co-exist on the same network layer, but also to
complement one another's functionality. Thus, large
applications as well as more holistic Transport
protocols can be designed by combining two or more
broadcast classes. We discuss the specific
characteristics of these classes and design candidate
protocols for each class.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2018:PFS,
author = "Cheng-Shang Chang and Duan-Shin Lee and Li-Heng Liou
and Sheng-Min Lu and Mu-Huan Wu",
title = "A Probabilistic Framework for Structural Analysis and
Community Detection in Directed Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "31--46",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2762403",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There is growing interest in structural analysis of
directed networks. Two major points that need to be
addressed are: 1 a formal and precise definition of the
graph clustering and community detection problem in
directed networks and 2 algorithm design and evaluation
of community detection algorithms in directed networks.
Motivated by these, we develop a probabilistic
framework for structural analysis and community
detection in directed networks based on our previous
work in undirected networks. By relaxing the assumption
from symmetric bivariate distributions in our previous
work to bivariate distributions that have the same
marginal distributions in this paper, we can still
formally define various notions for structural analysis
in directed networks, including centrality, relative
centrality, community, and modularity. We also extend
three commonly used community detection algorithms in
undirected networks to directed networks: the
hierarchical agglomerative algorithm, the partitional
algorithm, and the fast unfolding algorithm. These are
made possible by two modularity preserving and sparsity
preserving transformations. In conjunction with the
probabilistic framework, we show these three algorithms
converge in a finite number of steps. In particular, we
show that the partitional algorithm is a linear time
algorithm for large sparse graphs. Moreover, the
outputs of the hierarchical agglomerative algorithm and
the fast unfolding algorithm are guaranteed to be
communities. These three algorithms can also be
extended to general bivariate distributions with some
minor modifications. We also conduct various
experiments by using two sampling methods in directed
networks: 1 PageRank and 2 random walks with self-loops
and backward jumps.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Diakonikolas:2018:RRS,
author = "Jelena Diakonikolas and Gil Zussman",
title = "On the Rate Regions of Single-Channel and
Multi-Channel Full-Duplex Links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "47--60",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2764907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the achievable rate regions of full-duplex
links in the single- and multi-channel cases in the
latter case, the channels are assumed to be orthogonal,
e.g., OFDM. We present analytical results that
characterize the uplink and downlink rate region and
efficient algorithms for computing rate pairs at the
region's boundary. We also provide near-optimal and
heuristic algorithms that ``convexify'' the rate region
when it is not convex. The convexified region
corresponds to a combination of a few full-duplex rates
i.e., to time sharing between different operation
modes. The algorithms can be used for theoretical
characterization of the rate region as well as for
resource time, power, and channel allocation with the
objective of maximizing the sum of the rates when one
of them uplink or downlink must be guaranteed e.g., due
to QoS considerations. We numerically illustrate the
rate regions and the rate gains compared with time
division duplex for various channel and cancellation
scenarios. The analytical results provide insights into
the properties of the full-duplex rate region and are
essential for future development of scheduling, channel
allocation, and power control algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Michaloliakos:2018:ACM,
author = "Antonios Michaloliakos and Weng Chon Ao and
Konstantinos Psounis and Yonglong Zhang",
title = "Asynchronously Coordinated Multi-Timescale Beamforming
Architecture for Multi-Cell Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "61--75",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2766562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern wireless devices such as smartphones are
pushing the demand for higher wireless data rates. The
ensuing increase in wireless traffic demand can be met
by a denser deployment of access points, coupled with a
coordinated deployment of advanced physical layer
techniques to reduce inter-cell interference.
Unfortunately, advanced physical layer techniques,
e.g., multi-user MU MIMO found in 802.11ac and
LTE-advanced, are not designed to operate efficiently
in a coordinated fashion across multiple densely
deployed transmitters. In this paper, we introduce a
new coordination architecture, which can achieve high
performance gains without the high overhead and
deployment cost that usually comes with coordination,
thus making the vision of high capacity wireless access
via densely deployed transmitters practical. The basic
idea is to loosely coordinate nearby transmitters using
slow varying channel statistics, while keeping all the
functionality which depends on fast varying channel
state information and has tight time deadlines locally.
We achieve this via a smart combination of analog and
digital beamforming using inexpensive front ends, a
provably efficient algorithm to select compatible users
and analog beams across all transmitters, and backward
compatible protocol extensions. Our performance
results, which include analysis, simulations, and
experiments with software defined radios and
directional antennas, show that our approach can
achieve the $ 10 \times $ gains of the theoretically
optimal coordinated MU-MIMO approach, without the need
to either tightly coordinate the clocks of the remote
transmitters or meet tight delay constraints.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ahmed:2018:OIT,
author = "Faraz Ahmed and M. Zubair Shafiq and Amir R. Khakpour
and Alex X. Liu",
title = "Optimizing {Internet} Transit Routing for Content
Delivery Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "76--89",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2761752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Content delivery networks CDNs maintain multiple
transit routes from content distribution servers to
eyeball ISP networks which provide Internet
connectivity to end users. Due to the dynamics of
varying performance and pricing on transit routes, CDNs
need to implement a transit route selection strategy to
optimize performance and cost tradeoffs. In this paper,
we formalize the transit routing problem using a
multi-attribute objective function to simultaneously
optimize end-to-end performance and cost. Our approach
allows CDNs to navigate the cost and performance
tradeoff in transit routing through a single control
knob. We evaluate our approach using real-world
measurements from CDN servers located at 19
geographically distributed Internet exchange points.
Using our approach, CDNs can reduce transit costs on
average by 57\% without sacrificing performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2018:ETC,
author = "Yongquan Fu and Pere Barlet-Ros and Dongsheng Li",
title = "Every Timestamp Counts: Accurate Tracking of Network
Latencies Using Reconcilable Difference Aggregator",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "90--103",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2762328",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "User-facing services deployed in data centers must
respond quickly to user actions. The measurement of
network latencies is of paramount importance. Recently,
a new family of compact data structures has been
proposed to estimate one-way latencies. In order to
achieve scalability, these new methods rely on
timestamp aggregation. Unfortunately, this approach
suffers from serious accuracy problems in the presence
of packet loss and reordering, given that a single lost
or out-of-order packet may invalidate a huge number of
aggregated samples. In this paper, we unify the problem
to detect lost and reordered packets within the set
reconciliation framework. Although the set
reconciliation approach and the data structures for
aggregating packet timestamps are previously known, the
combination of these two principles is novel. We
present a space-efficient synopsis called reconcilable
difference aggregator RDA. RDA maximizes the percentage
of useful packets for latency measurement by mapping
packets to multiple banks and repairing aggregated
samples that have been damaged by lost and reordered
packets. RDA simultaneously obtains the average and the
standard deviation of the latency. We provide a formal
guarantee of the performance and derive optimized
parameters. We further design and implement a
user-space passive latency measurement system that
addresses practical issues of integrating RDA into the
network stack. Our extensive evaluation shows that
compared with existing methods, our approach improves
the relative error of the average latency estimation in
10--15 orders of magnitude, and the relative error of
the standard deviation in 0.5--6 orders of magnitude.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Alasadi:2018:SSU,
author = "Emad Alasadi and Hamed S. Al-Raweshidy",
title = "{SSED}: Servers Under Software-Defined Network
Architectures to Eliminate Discovery Messages",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "104--117",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2763131",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The high speed, low cost, sharing of peripheral
devices and central administration features of the
Ethernet have led to it being widely trusted as the
backbone for recent networks. However, it suffers from
many practical limitations leading to a lack of
scalability, owing to its broadcast and multicast
mechanisms, particularly in relation to the discovery
processes. Whilst software-defined networks SDN have
overcome many legacy network problems, scalability
remains a major issue, because broadcasting and
multicasting have been inherited. Moreover, the problem
is exacerbated with increasing network traffic, which
results in higher bandwidth consumption, congestion,
and increased probability of a single point of failure.
To address this, servers under software-defined network
architectures to eliminate discovery messages SSED is
designed in this paper, and a backbone of floodless
packets in an SDN LAN network is introduced. For SSED,
flood discovery packets created by the dynamic host
configuration protocol in the application layer and the
address resolution protocol in the data link layer are
considered, respectively. SSED eliminates any broadcast
discovery packets with better performance, lowers peak
overhead, and introduces an innovative mechanism for
defining the relationship between the servers and SDN
architecture. Experimental results after constructing
and applying an authentic testbed verify that our
proposed model has the ability to improve the
scalability by removing broadcast packets from the data
plane, reduction of control packets in the control
plane, lessening peak overhead on the controller,
preventing it experiencing failed requests, offering
better response time, and providing more efficient
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2018:BGN,
author = "Bo Li and Junfeng Wu and Hongsheng Qi and Alexandre
Proutiere and Guodong Shi",
title = "{Boolean} Gossip Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "118--130",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2763964",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes and investigates a Boolean gossip
model as a simplified but non-trivial probabilistic
Boolean network. With positive node interactions, in
view of standard theories from Markov chains, we prove
that the node states asymptotically converge to an
agreement at a binary random variable, whose
distribution is characterized for large-scale networks
by mean-field approximation. Using combinatorial
analysis, we also successfully count the number of
communication classes of the positive Boolean network
explicitly in terms of the topology of the underlying
interaction graph, where remarkably minor variation in
local structures can drastically change the number of
network communication classes. With general Boolean
interaction rules, emergence of absorbing network
Boolean dynamics is shown to be determined by the
network structure with necessary and sufficient
conditions established regarding when the Boolean
gossip process defines absorbing Markov chains.
Particularly, it is shown that for the majority of the
Boolean interaction rules, except for nine out of the
total $ 2^{16} - 1 $ possible nonempty sets of binary
Boolean functions, whether the induced chain is
absorbing has nothing to do with the topology of the
underlying interaction graph, as long as connectivity
is assumed. These results illustrate the possibilities
of relating dynamical properties of Boolean networks to
graphical properties of the underlying interactions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nevat:2018:ADA,
author = "Ido Nevat and Dinil Mon Divakaran and Sai Ganesh
Nagarajan and Pengfei Zhang and Le Su and Li Ling Ko
and Vrizlynn L. L. Thing",
title = "Anomaly Detection and Attribution in Networks With
Temporally Correlated Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "131--144",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2765719",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Anomaly detection in communication networks is the
first step in the challenging task of securing a
network, as anomalies may indicate suspicious
behaviors, attacks, network malfunctions, or failures.
In this paper, we address the problem of not only
detecting the anomalous events but also of attributing
the anomaly to the flows causing it. To this end, we
develop a new statistical decision theoretic framework
for temporally correlated traffic in networks via
Markov chain modeling. We first formulate the optimal
anomaly detection problem via the generalized
likelihood ratio test GLRT for our composite model.
This results in a combinatorial optimization problem
which is prohibitively expensive. We then develop two
low-complexity anomaly detection algorithms. The first
is based on the cross entropy CE method, which detects
anomalies as well as attributes anomalies to flows. The
second algorithm performs anomaly detection via GLRT on
the aggregated flows transformation --- a compact
low-dimensional representation of the raw traffic
flows. The two algorithms complement each other and
allow the network operator to first activate the flow
aggregation algorithm in order to quickly detect
anomalies in the system. Once an anomaly has been
detected, the operator can further investigate which
specific flows are anomalous by running the CE-based
algorithm. We perform extensive performance evaluations
and experiment our algorithms on synthetic and
semi-synthetic data, as well as on real Internet
traffic data obtained from the MAWI archive, and
finally make recommendations regarding their
usability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2018:DND,
author = "Yong Cui and Shihan Xiao and Xin Wang and Zhenjie Yang
and Shenghui Yan and Chao Zhu and Xiang-Yang Li and
Ning Ge",
title = "Diamond: Nesting the Data Center Network With Wireless
Rings in {$3$-D} Space",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "145--160",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2773539",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The introduction of wireless transmissions into the
data center has shown to be promising in improving cost
effectiveness of data center networks DCNs. For high
transmission flexibility and performance, a fundamental
challenge is to increase the wireless availability and
enable fully hybrid and seamless transmissions over
both wired and wireless DCN components. Rather than
limiting the number of wireless radios by the size of
top-of-rack switches, we propose a novel DCN
architecture, Diamond, which nests the wired DCN with
radios equipped on all servers. To harvest the gain
allowed by the rich reconfigurable wireless resources,
we propose the low-cost deployment of scalable 3-D ring
reflection spaces RRSs which are interconnected with
streamlined wired herringbone to enable large number of
concurrent wireless transmissions through
high-performance multi-reflection of radio signals over
metal. To increase the number of concurrent wireless
transmissions within each RRS, we propose a precise
reflection method to reduce the wireless interference.
We build a 60-GHz-based testbed to demonstrate the
function and transmission ability of our proposed
architecture. We further perform extensive simulations
to show the significant performance gain of diamond, in
supporting up to five times higher server-to-server
capacity, enabling network-wide load balancing, and
ensuring high fault tolerance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2018:OMT,
author = "Fu Xiao and Zhongqin Wang and Ning Ye and Ruchuan Wang
and Xiang-Yang Li",
title = "One More Tag Enables Fine-Grained {RFID} Localization
and Tracking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "161--174",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2766526",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Exploiting radio frequency signals is promising for
locating and tracking objects. Prior works focus on
per-tag localization, in which each object is attached
with one tag. In this paper, we propose a comprehensive
localization and tracking scheme by attaching two RFID
tags to one object. Instead of using per-tag
localization pattern, adding one-more RFID tag to the
object exhibits several benefits: 1 providing rich
freedom in RFID reader's antenna spacing and placement;
2 supporting accurate calibration of the reader's
antenna location and spacing, and 3 enabling
fine-grained calculation on the orientation of the
tags. All of these advantages ultimately improve the
localization/tracking accuracy. Our extensive
experimental results demonstrate that the average
errors of localization and orientation of target tags
are 6.415 cm and 1.330\degree, respectively. Our
results also verify that the reader's antenna geometry
does have impact on tag positioning performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{G:2018:SMP,
author = "David Gonzalez G. and Harri Hakula and Antti Rasila
and Jyri Hamalainen",
title = "Spatial Mappings for Planning and Optimization of
Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "175--188",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2768561",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cellular networks, users are grouped into different
cells and served by different access points base
stations that provide wireless access to services and
applications. In general, the service demand is very
heterogeneous, non-uniformly distributed, and dynamic.
Consequently, radio access networks create very
irregular topologies with more access points, where
service demand is concentrated. While this dynamism
requires networks with the ability to adapt to
time-varying conditions, the non-uniformity of the
service demand makes the planning, analysis, and
optimization difficult. In order to help with these
tasks, a framework based on canonical domains and
spatial mappings e.g., conformal mapping have recently
been proposed. The idea is to carry out part of the
planning in a canonical perfectly symmetric domain that
is connected to the physical one real-scenario by means
of a spatial transformation designed to map the access
points consistently with the service demand. This paper
continues the research in that direction by introducing
additional tools and possibilities to that framework,
namely the use of centroidal Voronoi algorithms and
non-conformal composite mappings. Moreover, power
optimization is also introduced to the framework. The
results show the usability and effectiveness of the
proposed method and its promising research
perspectives.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:EPP,
author = "Fei Chen and Chunming Wu and Xiaoyan Hong and Bin
Wang",
title = "Easy Path Programming: Elevate Abstraction Level for
Network Functions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "189--202",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2778179",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As datacenter networks become increasingly
programmable with proliferating network functions,
network programming languages have emerged to simplify
the program development of the network functions. While
network functions exhibit high level abstraction over
operations on the traffic flow and the interconnections
among the operations, the existing languages usually
require programming with detailed knowledge about the
packet processing patterns at the switches. Such a
mismatch between the program abstraction and
development details makes developing network functions
a nontrivial task. To solve the problem, this paper
introduces the easy path programming EP2 framework. EP2
offers a high-level abstraction to simplify the program
design process of the network functions. EP2 also
provides a language that captures the common properties
of network functions and uses predicates and primitives
as basic language components. Specifically, predicates
describe when to handle a flow with a global view of
the flow dynamics; and primitives describe how to
choose a path for a specific flow. Furthermore, EP2 has
its own runtime system to support the language and the
abstraction model, especially to hide the low level
packet-processing behavior at the data plane from the
programmers. Throughout this paper, cases are given to
illustrate the EP2 abstraction model, language details
and benefits. The expressiveness of EP2, the potential
overhead of the runtime system and the efficiency of
the network functions generated by EP2 are evaluated.
The results show that EP2 can achieve comparable
performance while reducing programming efforts.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rahman:2018:UAH,
author = "M. Saifur Rahman and Md. Yusuf Sarwar Uddin and Tahmid
Hasan and M. Sohel Rahman and M. Kaykobad",
title = "Using Adaptive Heartbeat Rate on Long-Lived {TCP}
Connections",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "203--216",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2774275",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose techniques for dynamically
adjusting heartbeat or keep-alive interval of
long-lived TCP connections, particularly the ones that
are used in push notification service in mobile
platforms. When a device connects to a server using
TCP, often times the connection is established through
some sort of middle-box, such as NAT, proxy, firewall,
and so on. When such a connection is idle for a long
time, it may get torn down due to binding timeout of
the middle-box. To keep the connection alive, the
client device needs to send keep-alive packets through
the connection when it is otherwise idle. To reduce
resource consumption, the keep-alive packet should
preferably be sent at the farthest possible time within
the binding timeout. Due to varied settings of
different network equipments, the binding timeout will
not be identical in different networks. Hence, the
heartbeat rate used in different networks should be
changed dynamically. We propose a set of iterative
probing techniques, namely binary, exponential, and
composite search, that detect the middle-box binding
timeout with varying degree of accuracy; and in the
process, keeps improving the keep-alive interval used
by the client device. We also analytically derive
performance bounds of these techniques. To the best of
our knowledge, ours is the first work that
systematically studies several techniques to
dynamically improve keep-alive interval. To this end,
we run experiments in simulation as well as make a real
implementation on Android to demonstrate the
proof-of-concept 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",
}
@Article{He:2018:POT,
author = "Peng He and Wenyuan Zhang and Hongtao Guan and Kave
Salamatian and Gaogang Xie",
title = "Partial Order Theory for Fast {TCAM} Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "217--230",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2776565",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ternary content addressable memories TCAMs are
frequently used for fast matching of packets against a
given ruleset. While TCAMs can achieve fast matching,
they are plagued by high update costs that can make
them unusable in a high churn rate environment. We
present, in this paper, a systematic and in-depth
analysis of the TCAM update problem. We apply partial
order theory to derive fundamental constraints on any
rule ordering on TCAMs, which ensures correct checking
against a given ruleset. This theoretical insight
enables us to fully explore the TCAM update algorithms
design space, to derive the optimal TCAM update
algorithm though it might not be suitable to be used in
practice, and to obtain upper and lower bounds on the
performance of practical update algorithms. Having
lower bounds, we checked if the smallest update costs
are compatible with the churn rate observed in
practice, and we observed that this is not always the
case. We therefore developed a heuristic based on
ruleset splitting, with more than a single TCAM chip,
that achieves significant update cost reductions $ 1.05
\sim 11.3 \times $ compared with state-of-the-art
techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:MTA,
author = "Lei Xie and Chuyu Wang and Alex X. Liu and Jianqiang
Sun and Sanglu Lu",
title = "Multi-Touch in the Air: Concurrent Micromovement
Recognition Using {RF} Signals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "231--244",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2772781",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The human--computer interactions have moved from the
conventional approaches of entering inputs into the
keyboards/touchpads to the brand-new approaches of
performing interactions in the air. In this paper, we
propose RF-glove, a system that recognizes concurrent
multiple finger micromovement using RF signals, so as
to realize the vision of ``multi-touch in the air.'' It
uses a commercial-off-the-shelf COTS RFID reader with
three antennas and five COTS tags attached to the five
fingers of a glove, one tag per finger. During the
process of a user performing finger micromovements, we
let the RFID reader continuously interrogate these tags
and obtain the backscattered RF signals from each tag.
For each antenna--tag pair, the reader obtains a
sequence of RF phase values called a phase profile from
the tag's responses over time. To tradeoff between
accuracy and robustness in terms of matching
resolution, we propose a two phase approach, including
coarse-grained filtering and fine-grained matching. To
tackle the variation of template phase profiles at
different positions, we propose a phase-model-based
solution to reconstruct the template phase profiles
based on the exact locations. Experiment results show
that we achieve an average accuracy of 92.1\% under
various moving speeds, orientation deviations, and so
on.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Phan:2018:UCN,
author = "Truong Khoa Phan and David Griffin and Elisa Maini and
Miguel Rio",
title = "Utility-Centric Networking: Balancing Transit Costs
With Quality of Experience",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "245--258",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2780257",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper is focused on techniques for maximizing
utility across all users within a total network transit
cost budget. We present a new method for selecting
between replicated servers distributed over the
Internet. First, we introduce a novel utility framework
that factors in quality of service metrics. Then we
design an optimization algorithm, solvable in
polynomial time, to allocate user requests to servers
based on utility while satisfying network transit cost
constraints, mapping service names to service instance
locators. We then describe an efficient, low overhead
distributed model which only requires knowledge of a
fraction of the data required by the global
optimization formulation. Next, a load-balancing
variant of the algorithm is explored that substantially
reduces blocking caused by congested servers. Extensive
simulations show that our method is scalable and leads
to higher user utility compared with mapping user
requests to the closest service replica, while meeting
network traffic cost constraints. We discuss several
options for real-world deployment that require no
changes to end-systems based on either the use of SDN
controllers or extensions to the current DNS system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Clark:2018:TUP,
author = "Matthew A. Clark and Konstantinos Psounis",
title = "Trading Utility for Privacy in Shared Spectrum Access
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "259--273",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2778260",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In an effort to meet growing demands on the radio
frequency spectrum, regulators are exploring methods to
enable band sharing among a diverse set of user
devices. Proposed spectrum access systems would
dynamically assign spectrum resources to users,
maintaining databases of spectrum use information.
While these systems are anticipated to increase the
efficiency of spectrum sharing, incumbent users have
raised concerns about exposing details of their
operations and have questioned whether their privacy
can be protected. In this paper, we explore whether
primary users can retain a critical level of privacy in
a spectrum access system setting, where they must
reveal some information to enable dynamic access to the
spectrum by other users. Under a variety of operational
scenarios and user models, we examine adversary
techniques to exploit the spectrum access system and
obfuscation strategies to protect user privacy. We
develop analytical methods to quantify the resulting
privacy and validate our results through simulation. To
the best of our knowledge, this is the first paper that
considers inference attacks on primary users in the
setting of a highly dynamic spectrum access system.
Privacy analysis of this kind will help to enable the
adoption of shared spectrum access systems by allowing
incumbent users to quantify and mitigate risks to their
privacy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:JRA,
author = "Qingxia Chen and F. Richard Yu and Tao Huang and
Renchao Xie and Jiang Liu and Yunjie Liu",
title = "Joint Resource Allocation for Software-Defined
Networking, Caching, and Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "274--287",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2782216",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although some excellent works have been done on
networking, caching, and computing, these three
important areas have traditionally been addressed
separately in the literature. In this paper, we
describe the recent advances in jointing networking,
caching, and computing and present a novel integrated
framework: software-defined networking, caching, and
computing SD-NCC. SD-NCC enables dynamic orchestration
of networking, caching, and computing resources to
efficiently meet the requirements of different
applications and improve the end-to-end system
performance. Energy consumption is considered as an
important factor when performing resource placement in
this paper. Specifically, we study the joint caching,
computing, and bandwidth resource allocation for SD-NCC
and formulate it as an optimization problem. In
addition, to reduce computational complexity and
signaling overhead, we propose a distributed algorithm
to solve the formulated problem, based on recent
advances in alternating direction method of multipliers
ADMM, in which different network nodes only need to
solve their own problems without exchange of
caching/computing decisions with fast convergence rate.
Simulation results show the effectiveness of our
proposed framework and ADMM-based algorithm with
different system parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2018:ASC,
author = "Woong-Hee Lee and Jeong-Sik Choi and Yong-Hwa Kim and
Jong-Ho Lee and Seong-Cheol Kim",
title = "Adaptive Sector Coloring Game for Geometric Network
Information-Based Inter-Cell Interference Coordination
in Wireless Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "288--301",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2780187",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inter-cell interference coordination ICIC is a
promising technique to improve the performance of
frequency-domain packet scheduling FDPS in downlink
LTE/LTE-A networks. However, it is difficult to
maximize the performance of FDPS using static ICIC
schemes because of insufficient consideration of
signal-to-interference-and-noise ratio distribution and
user fairness. On the other hand, dynamic ICIC schemes
based on channel state information CSI also have
difficulty presented in the excessive signaling
overhead and X2 interface latency. In order to overcome
these drawbacks, we introduce a new concept of ICIC
problem based on geometric network information GNI and
propose an adaptive sector coloring game ASCG as a
decentralized solution of the GNI-based ICIC problem.
Furthermore, we develop an ASCG with a dominant
strategy space noted as ASCG-D to secure a stable
solution through proving the existence of Nash
equilibrium. The proposed scheme provides better
performance in terms of system throughput gain of up to
about 44.1\%, and especially of up to about 221\% for
the worst 10\% users than static ICIC schemes.
Moreover, the performance of the CSI-based ICIC, which
require too much computational load and signaling
overhead, is only 13.0\% and 5.6\% higher than that of
ASCG-D regarding the total user throughput and the
worst 10\% user throughput, respectively. The most
interesting outcome is that the signaling overhead of
ASCG-D is 1/144 of dynamic ICIC schemes' one.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neglia:2018:CPL,
author = "Giovanni Neglia and Damiano Carra and Pietro
Michiardi",
title = "Cache Policies for Linear Utility Maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "302--313",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2783623",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cache policies to minimize the content retrieval cost
have been studied through competitive analysis when the
miss costs are additive and the sequence of content
requests is arbitrary. More recently, a cache utility
maximization problem has been introduced, where
contents have stationary popularities and utilities are
strictly concave in the hit rates. This paper bridges
the two formulations, considering linear costs and
content popularities. We show that minimizing the
retrieval cost corresponds to solving an online
knapsack problem, and we propose new dynamic policies
inspired by simulated annealing, including DynqLRU, a
variant of qLRU. We prove that DynqLRU asymptotically
asymptotic converges to the optimum under the
characteristic time approximation. In a real scenario,
popularities vary over time and their estimation is
very difficult. DynqLRU does not require popularity
estimation, and our realistic, trace-driven evaluation
shows that it significantly outperforms
state-of-the-art policies, with up to 45\% cost
reduction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2018:RCS,
author = "Haipeng Dai and Huizhen Ma and Alex X. Liu and Guihai
Chen",
title = "Radiation Constrained Scheduling of Wireless Charging
Tasks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "314--327",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2786463",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of Radiation
cOnstrained scheduling of wireless Charging tasKs ROCK,
that is, given wireless charging tasks with required
charging energy and charging deadline for rechargeable
devices, scheduling the power of wireless chargers to
maximize the overall effective charging energy for all
rechargeable devices, and further to minimize the total
charging time, while guaranteeing electromagnetic
radiation EMR safety, i.e., no point on the considered
2-D area has EMR intensity exceeding a given threshold.
To address ROCK, we first present a centralized
algorithm. We transform ROCK from nonlinear problem to
linear problem by applying two approaches of area
discretization and solution regularization, and then
propose a linear programming-based greedy test
algorithm to solve it. We also propose a distributed
algorithm that is scalable with network size by
presenting an area partition scheme and two approaches
called area-scaling and EMR-scaling, and prove that it
achieves effective charging energy no less than $ 1 -
\varepsilon $ of that of the optimal solution, and
charging time no more than that of the optimal
solution. We conduct both simulation and field
experiments to validate our theoretical findings. The
results show that our algorithm achieves 94.9\% of the
optimal effective charging energy and requires 47.1\%
smaller charging time compared with the optimal one
when $ {\varepsilon } \geq 0.2 $, and outperforms the
other algorithms by at least 350.1\% in terms of
charging time with even more effective charging
energy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Foerster:2018:LFR,
author = "Klaus-Tycho Foerster and Arne Ludwig and Jan
Marcinkowski and Stefan Schmid",
title = "Loop-Free Route Updates for Software-Defined
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "328--341",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2778426",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the fundamental problem of updating
arbitrary routes in a software-defined network in a
transiently loop-free manner. Our objective is to
compute fast network update schedules which minimize
the number of interactions i.e., rounds between the
controller and the network nodes. We first prove that
this problem is difficult in general: The problem of
deciding whether a $k$ -round update schedule exists is
NP-complete already for $ k = 3$, and there are problem
instances requiring $ \Omega n$ rounds, where $n$ is
the network size. Given these negative results, we
introduce an attractive, relaxed notion of
loop-freedom. We show that relaxed loop-freedom admits
for much shorter update schedules up to a factor $
\Omega n$ in the best case, and present a scheduling
algorithm which requires at most $ \Theta \log n$
rounds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chuprikov:2018:PQP,
author = "Pavel Chuprikov and Sergey I. Nikolenko and Alex
Davydow and Kirill Kogan",
title = "Priority Queueing for Packets With Two
Characteristics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "342--355",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2782771",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Modern network elements are increasingly required to
deal with heterogeneous traffic. Recent works consider
processing policies for buffers that hold packets with
different processing requirements number of processing
cycles needed before a packet can be transmitted out
but uniform value, aiming to maximize the throughput,
i.e., the number of transmitted packets. Other
developments deal with packets of varying value but
uniform processing requirement each packet requires one
processing cycle; the objective here is to maximize the
total transmitted value. In this paper, we consider a
more general problem, combining packets with both
nonuniform processing and nonuniform values in the same
queue. We study the properties of various processing
orders in this setting. We show that in the general
case, natural processing policies have poor performance
guarantees, with linear lower bounds on their
competitive ratio. Moreover, we show several
adversarial lower bounds for every priority queue and
even for every online policy. On the positive side, in
the special case when only two different values are
allowed, 1 and $V$, we present a policy that achieves
competitive ratio $ \left {1 + {W + 2} / {V}} \right $,
where $W$ is the maximal number of required processing
cycles. We also consider copying costs during
admission.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Aguirre-Guerrero:2018:WGC,
author = "Daniela Aguirre-Guerrero and Miguel Camelo and Lluis
Fabrega and Pere Vila",
title = "{WMGR}: a Generic and Compact Routing Scheme for Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "356--369",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2779866",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data center networks DCNs connect hundreds and
thousands of computers and, as a result of the
exponential growth in their number of nodes, the design
of scalable compact routing schemes plays a pivotal
role in the optimal operation of the DCN. Traditional
trends in the design of DCN architectures have led to
solutions, where routing schemes and network topologies
are interdependent, i.e., specialized routing schemes.
Unlike these, we propose a routing scheme that is
compact and generic, i.e., independent of the DCN
topology, the word-metric-based greedy routing. In this
scheme, each node is assigned to a coordinate or label
in the word-metric space WMS of an algebraic group and
then nodes forward packets to the closest neighbor to
the destination in this WMS. We evaluate our scheme and
compare it with other routing schemes in several
topologies. We prove that the memory space requirements
in nodes and the forwarding decision time grow
sub-linearly with respect to $n$, the number of nodes
in all of these topologies. The scheme finds the
shortest paths in topologies based on Cayley graphs and
trees e.g. Fat tree, while in the rest of topologies,
the length of any path is stretched by a factor that
grows logarithmically with respect to $n$. Moreover,
the simulation results show that many of the paths
remain far below this upper bound.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Keshtkarjahromi:2018:DDN,
author = "Yasaman Keshtkarjahromi and Hulya Seferoglu and Rashid
Ansari and Ashfaq Khokhar",
title = "Device-to-Device Networking Meets Cellular via Network
Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "370--383",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2787961",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Utilizing device-to-device D2D connections among
mobile devices is promising to meet the increasing
throughput demand over cellular links. In particular,
when mobile devices are in close proximity of each
other and are interested in the same content, D2D
connections such as Wi-Fi Direct can be
opportunistically used to construct a cooperative and
jointly operating cellular and D2D networking system.
However, it is crucial to understand, quantify, and
exploit the potential of network coding for cooperating
mobile devices in the joint cellular and D2D setup. In
this paper, we consider this problem, and: 1 develop a
network coding framework, namely NCMI, for cooperative
mobile devices in the joint cellular and D2D setup,
where cellular and D2D link capacities are the same;
and 2 characterize the performance of the proposed
network coding framework, where we use packet
completion time, which is the number of transmission
slots to recover all packets, as a performance metric.
We demonstrate the benefits of our network coding
framework through simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2018:FRA,
author = "Yuan Yang and Mingwei Xu and Qi Li",
title = "Fast Rerouting Against Multi-Link Failures Without
Topology Constraint",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "384--397",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2780852",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multi-link failures may incur heavy packet loss and
degrade the network performance. Fast rerouting has
been proposed to address this issue by enabling routing
protections. However, the effectiveness and efficiency
issues of fast rerouting are not well addressed. In
particular, the protection performance of existing
approaches is not satisfactory even if the overhead is
high, and topology constraints need to be met for the
approaches to achieve a complete protection. To
optimize the efficiency, we first answer the question
that whether label-free routing can provide a complete
protection against arbitrary multi-link failures in any
networks. We propose a model for
interface-specific-routing which can be seen as a
general label-free routing. We analyze the conditions
under which a multi-link failure will induce routing
loops. And then, we present that there exist some
networks in which no interface-specific-routing ISR can
be constructed to protect the routing against any $k$
-link failures $ k \geq 2$. Then, we propose a
tunneling on demand TOD approach, which covers most
failures with ISR, and activate tunneling only when
failures cannot be detoured around by ISR. We develop
algorithms to compute ISR properly so as to minimize
the number of activated tunnels, and compute the
protection tunnels if necessary. We prove that TOD can
protect routing against any single-link failures and
dual-link failures. We evaluate TOD by simulations with
real-world topologies. The results show that TOD can
achieve a near 100\% protection ratio with small
tunneling overhead for multi-link failures, making a
better tradeoff than the state-of-the-art label-based
approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rager:2018:SSQ,
author = "Scott T. Rager and Ertugrul N. Ciftcioglu and Ram
Ramanathan and Thomas F. {La Porta} and Ramesh
Govindan",
title = "Scalability and Satisfiability of
Quality-of-Information in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "398--411",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2781202",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Quality of information QoI provides a
context-dependent measure of the utility that a network
delivers to its users by incorporating non-traditional
information attributes. Quickly and easily predicting
performance and limitations of a network using QoI
metrics is a valuable tool for network design. Even
more useful is an understanding of how network
components like topology, bandwidth, and protocols,
impact these limitations. In this paper, we develop a
QoI-based framework that can provide accurate estimates
for limitations on network size and achievable QoI
requirements, focusing on completeness and timeliness.
We extend this framework to model competing flows and
data loads as random variables to capture the
stochastic nature of real networks. We show that our
framework can provide a characterization of delays for
satisfied queries to further analyze performance when
some late arrivals are acceptable. Analysis shows that
the large tradeoffs exist between network parameters,
such as QoI requirements, topology, and network size.
Simulation results also provide evidence that the
developed framework can estimate network limits and
delays with high accuracy. Finally, this paper also
introduces scalably feasible QoI regions, which provide
upper bounds on QoI requirements that can be supported
for certain network applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2018:PCQ,
author = "Bei Liu and Wei Wang and Donghyun Kim and Yingshu Li
and Sung-Sik Kwon and Yaolin Jiang",
title = "On Practical Construction of Quality Fault-Tolerant
Virtual Backbone in Homogeneous Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "412--421",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2780262",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Over years, many efforts are made for the problem of
constructing quality fault-tolerant virtual backbones
in wireless network. In case that a wireless network
consists of physically equivalent nodes, e.g., with the
same communication range, unit disk graph UDG is widely
used to abstract the wireless network and the problem
is formulated as the minimum $k$ -connected $m$
-dominating set problem on the UDG. So far, most
results are focused on designing a constant factor
approximation algorithm for this NP-hard problem under
two positive integers $k$ and $m$ satisfying $ m \geq k
\geq 1$ and $ k \leq 3$. This paper introduces an
approximation algorithm for the problem with $ m \geq k
\geq 1$. This algorithm is simple to implement; it
connects the components by adding a bounded number of
paths, which first computes a 1-connected $m$
-dominating set $D$ and repeats the following steps: a
search the separators arbitrarily in $ i - 1, m$ -CDS
with $ i = 2, 3, \cdots, k$, b add a bounded number of
paths connecting the components separated by separators
in $ i - 1, m$ -CDS to improve the connectivity of $ i
- 1, m$ -CDS, until it becomes $k$ -connected, and c
remove redundant paths if there exist at every
iteration. We provide a rigorous theoretical analysis
to prove that the proposed algorithm is correct and its
approximation ratio is a constant, for any fixed $k$.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fuerst:2018:KOE,
author = "Carlo Fuerst and Stefan Schmid and Lalith Suresh and
Paolo Costa",
title = "Kraken: Online and Elastic Resource Reservations for
Cloud Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "422--435",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2782006",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cloud environments, the absence of strict network
performance guarantees leads to unpredictable job
execution times. To address this issue, recently, there
have been several proposals on how to provide
guaranteed network performance. These proposals,
however, rely on computing resource reservation
schedules a priori. Unfortunately, this is not
practical in today's cloud environments, where
application demands are inherently unpredictable, e.g.,
due to differences in the input data sets or phenomena,
such as failures and stragglers. To overcome these
limitations, we designed Kraken, a system that allows
to dynamically update minimum guarantees for both
network bandwidth and compute resources at runtime.
Unlike previous work, Kraken does not require prior
knowledge about the resource needs of the applications
but allows to modify reservations at runtime. Kraken
achieves this through an online resource reservation
scheme, which comes with provable optimality
guarantees. In this paper, we motivate the need for
dynamic resource reservation schemes, present how this
is provided by Kraken, and evaluate Kraken via
extensive simulations and a preliminary Hadoop
prototype.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2018:SFC,
author = "Ruiting Zhou and Zongpeng Li and Chuan Wu",
title = "Scheduling Frameworks for Cloud Container Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "436--450",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2781200",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Compared with traditional virtual machines, cloud
containers are more flexible and lightweight, emerging
as the new norm of cloud resource provisioning. We
exploit this new algorithm design space, and propose
scheduling frameworks for cloud container services. Our
offline and online schedulers permit partial execution,
and allow a job to specify its job deadline, desired
cloud containers, and inter-container dependence
relations. We leverage the following classic and new
techniques in our scheduling algorithm design. First,
we apply the compact-exponential technique to express
and handle nonconventional scheduling constraints.
Second, we adopt the primal-dual framework that
determines the primal solution based on its dual
constraints in both the offline and online algorithms.
The offline scheduling algorithm includes a new
separation oracle to separate violated dual
constraints, and works in concert with the randomized
rounding technique to provide a near-optimal solution.
The online scheduling algorithm leverages the online
primal-dual framework with a learning-based scheme for
obtaining dual solutions. Both theoretical analysis and
trace-driven simulations validate that our scheduling
frameworks are computationally efficient and achieve
close-to-optimal aggregate job valuation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Barletta:2018:TAD,
author = "Luca Barletta and Flaminio Borgonovo and Ilario
Filippini",
title = "The Throughput and Access Delay of Slotted-Aloha With
Exponential Backoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "451--464",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2782696",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The behavior of exponential backoff EB has challenged
researchers ever since its introduction, but only
approximate and partial results have been produced up
to this date. This paper presents accurate results
about the effect of protocol parameters on throughput
and delay, assuming queues in saturation. Among the
manifold results, we first introduce a simple model
that provides close-form results for the approximated
model known as ``decoupling assumption.'' Since the
latter fails to provide well approximated results in
many cases, we also introduce a Markovian model able to
trade the precision of the results with complexity even
with an infinite number of users, enabling us to get
definite throughput results, such as 0.3706 with binary
EB, and 0.4303 with an optimized base. Analytical
considerations allow to derive the tail of the
access-delay distribution, found to be slowly
decreasing and with no variance as the number of users
goes to infinity. Taking into account the overall
performance, preliminary results seem to indicate that
the exponential base $ b = 1.35 $ is more appealing
than the standard value $ b = 2 $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2018:FEC,
author = "Chi-Han Lin and Yi-Ting Chen and Kate Ching-Ju Lin and
Wen-Tsuen Chen",
title = "{FDoF}: Enhancing Channel Utilization for 802.11ac",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "465--477",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2785880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multi-user multiple input multiple output MU-MIMO
enables a multi-antenna access point to serve multiple
users simultaneously, and has been adopted as the IEEE
802.11ac standard. While several PHY-MAC designs have
recently been proposed to improve the throughput
performance of a MU-MIMO WLAN, they, however, usually
assume that all the concurrent streams are of roughly
equal length. In reality, users usually have frames
with heterogeneous lengths even after aggregation,
leading to different lengths of a transmission time.
Hence, the concurrent transmission opportunities might
not always be fully utilized when some streams finish
earlier than the others in a transmission opportunity.
To resolve this inefficiency, this paper presents full
degree-of-freedom FDoF, a PHY-MAC design that exploits
a novel power allocation scheme to reduce the idle
channel time and further leverages frame padding to
better utilize the spatial multiplexing gain. Unlike
traditional MIMO power allocation, which aims at
maximizing the theoretical sum-rate, FDoF's power
allocation explicitly considers heterogeneous frame
lengths and minimizes the channel time required to
finish concurrent frames, as a result improving the
effective throughput. FDoF's padding protocol then
identifies proper users to reuse the remaining idle
channel time, while preventing this padding from
harming all the ongoing streams. Our evaluation via
large-scale trace-driven simulations demonstrates that
FDoF's improves the throughput by up to $ 2.83 \times
$, or by $ 1.36 \times $ on average, as compared to the
conventional 802.11ac. By combining FDoF's power
allocation with frame padding, the average throughput
gain can be further increased to $ 1.75 \times $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cai:2018:ISF,
author = "Kechao Cai and Hong Xie and John C. S. Lui",
title = "Information Spreading Forensics via Sequential
Dependent Snapshots",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "478--491",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2791412",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mining the characteristics of information spreading in
networks is crucial in communication studies, network
security management, epidemic investigations, etc.
Previous works are restrictive because they mainly
focused on the information source detection using
either a single observation, or multiple but
independent observations of the underlying network
while assuming a homogeneous information spreading
rate. We conduct a theoretical and experimental study
on information spreading, and propose a new and novel
estimation framework to estimate 1 information
spreading rates, 2 start time of the information
source, and 3 the location of information source by
utilizing multiple sequential and dependent snapshots
where information can spread at heterogeneous rates.
Our framework generalizes the current state-of-the-art
rumor centrality [1] and the union rumor centrality
[2]. Furthermore, we allow heterogeneous information
spreading rates at different branches of a network. Our
framework provides conditional maximum likelihood
estimators for the above three metrics and is more
accurate than rumor centrality and Jordan center in
both synthetic networks and real-world networks.
Applying our framework to the Twitter's retweet
networks, we can accurately determine who made the
initial tweet and at what time the tweet was sent.
Furthermore, we also validate that the rates of
information spreading are indeed heterogeneous among
different parts of a retweet network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2018:SCS,
author = "Jie Zhao and Qiang Liu and Xin Wang and Shiwen Mao",
title = "Scheduling of Collaborative Sequential Compressed
Sensing Over Wide Spectrum Band",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "492--505",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2787647",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The cognitive radio CR technology holds promise to
significantly increase spectrum availability and
wireless network capacity. With more spectrum bands
opened up for CR use, it is critical yet challenging to
perform efficient wideband sensing. We propose an
integrated sequential wideband sensing scheduling
framework that concurrently exploits sequential
detection and compressed sensing CS techniques for more
accurate and lower-cost spectrum sensing. First, to
ensure more timely detection without incurring high
overhead involved in periodic recovery of CS signals,
we propose smart scheduling of a CS-based sequential
wideband detection scheme to effectively detect the PU
activities in the wideband of interest. Second, to
further help users under severe channel conditions
identify the occupied sub-channels, we develop two
collaborative strategies, namely, joint reconstruction
of the signals among neighboring users and wideband
sensing-map fusion. Third, to achieve robust wideband
sensing, we propose the use of anomaly detection in our
framework. Extensive simulations demonstrate that our
approach outperforms peer schemes significantly in
terms of sensing delay, accuracy and overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sinha:2018:OCG,
author = "Abhishek Sinha and Eytan Modiano",
title = "Optimal Control for Generalized Network-Flow
Problems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "506--519",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2783846",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of throughput-optimal packet
dissemination, in the presence of an arbitrary mix of
unicast, broadcast, multicast, and anycast traffic, in
an arbitrary wireless network. We propose an online
dynamic policy, called Universal Max-Weight UMW, which
solves the problem efficiently. To the best of our
knowledge, UMW is the first known throughput-optimal
policy of such versatility in the context of
generalized network flow problems. Conceptually, the
UMW policy is derived by relaxing the precedence
constraints associated with multi-hop routing and then
solving a min-cost routing and max-weight scheduling
problem on a virtual network of queues. When
specialized to the unicast setting, the UMW policy
yields a throughput-optimal cycle-free routing and link
scheduling policy. This is in contrast with the
well-known throughput-optimal back-pressure BP policy
which allows for packet cycling, resulting in excessive
latency. Extensive simulation results show that the
proposed UMW policy incurs a substantially smaller
delay as compared with the BP policy. The proof of
throughput-optimality of the UMW policy combines ideas
from the stochastic Lyapunov theory with a sample path
argument from adversarial queueing theory and may be of
independent theoretical interest.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2018:SSC,
author = "Haipeng Dai and Yunhuai Liu and Guihai Chen and
Xiaobing Wu and Tian He and Alex X. Liu and Yang Zhao",
title = "{SCAPE}: Safe Charging With Adjustable Power",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "520--533",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2793949",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless power transfer technology is considered as
one of the promising solutions to address the energy
limitation problems for end-devices, but its incurred
potential risk of electromagnetic radiation EMR
exposure is largely overlooked by most existing works.
In this paper, we consider the Safe Charging with
Adjustable PowEr SCAPE problem, namely, how to adjust
the power of chargers to maximize the charging utility
of devices, while assuring that EMR intensity at any
location in the field does not exceed a given threshold
$ R_t $. We present novel techniques to reformulate
SCAPE into a traditional linear programming problem,
and then remove its redundant constraints as much as
possible to reduce computational effort. Next, we
propose a series of distributed algorithms, including a
fully distributed algorithm that provably achieves $ 1
- \epsilon $ approximation ratio and requires only
communications with neighbors within a constant
distance for each charger. Through extensive simulation
and testbed experiments, we demonstrate that our
proposed algorithms can outperform the set-cover
algorithm by up to 17.05\%, and has an average
performance gain of 41.1\% over the existing algorithm
in terms of the overall charging utility.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Peresini:2018:DFG,
author = "Peter Peresini and Maciej Kuzniar and Dejan Kostic",
title = "Dynamic, Fine-Grained Data Plane Monitoring With
Monocle",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "534--547",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2793765",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ensuring network reliability is important for
satisfying service-level objectives. However,
diagnosing network anomalies in a timely fashion is
difficult due to the complex nature of network
configurations. We present Monocle --- a system that
uncovers forwarding problems due to hardware or
software failures in switches, by verifying that the
data plane corresponds to the view that an SDN
controller installs via the control plane. Monocle
works by systematically probing the switch data plane;
the probes are constructed by formulating the switch
forwarding table logic as a Boolean satisfiability SAT
problem. Our SAT formulation quickly generates probe
packets targeting a particular rule considering both
existing and new rules. Monocle can monitor not only
static flow tables as is currently typically the case,
but also dynamic networks with frequent flow table
changes. Our evaluation shows that Monocle is capable
of fine-grained monitoring for the majority of rules,
and it can identify a rule suddenly missing from the
data plane or misbehaving in a matter of seconds. In
fact, during our evaluation Monocle uncovered problems
with two hardware switches that we were using in our
evaluation. Finally, during network updates Monocle
helps controllers cope with switches that exhibit
transient inconsistencies between their control and
data plane states.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Araldo:2018:CEC,
author = "Andrea Araldo and Gyorgy Dan and Dario Rossi",
title = "Caching Encrypted Content Via Stochastic Cache
Partitioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "548--561",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2793892",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In-network caching is an appealing solution to cope
with the increasing bandwidth demand of video, audio,
and data transfer over the Internet. Nonetheless, in
order to protect consumer privacy and their own
business, content providers CPs increasingly deliver
encrypted content, thereby preventing Internet service
providers ISPs from employing traditional caching
strategies, which require the knowledge of the objects
being transmitted. To overcome this emerging tussle
between security and efficiency, in this paper we
propose an architecture in which the ISP partitions the
cache space into slices, assigns each slice to a
different CP, and lets the CPs remotely manage their
slices. This architecture enables transparent caching
of encrypted content and can be deployed in the very
edge of the ISP's network i.e., base stations and
femtocells, while allowing CPs to maintain exclusive
control over their content. We propose an algorithm,
called SDCP, for partitioning the cache storage into
slices so as to maximize the bandwidth savings provided
by the cache. A distinctive feature of our algorithm is
that ISPs only need to measure the aggregated miss
rates of each CP, but they need not know the individual
objects that are requested. We prove that the SDCP
algorithm converges to a partitioning that is close to
the optimal, and we bound its optimality gap. We use
simulations to evaluate SDCP's convergence rate under
stationary and nonstationary content popularity.
Finally, we show that SDCP significantly outperforms
traditional reactive caching techniques, considering
both CPs with perfect and with imperfect knowledge of
their content popularity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:MCR,
author = "Pengzhan Wang and Hongli Xu and Liusheng Huang and
Chen Qian and Shaowei Wang and Yanjing Sun",
title = "Minimizing Controller Response Time Through Flow
Redirecting in {SDNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "562--575",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2786268",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software defined networking SDN is becoming
increasingly prevalent for its programmability that
enables centralized network configuration and
management. With the growth of SDNs, a cluster of
controllers cooperatively manages more and more
switches/flows in a network to avoid the
single-controller congestion/failure and improve the
control-plane robustness. Under the architecture with
multiple controllers, it is expected to minimize the
maximum response time on these controllers to provide
better QoS for users. To achieve this target, two
previous methods are mainly used, the static scheme and
the dynamic scheme. However, these methods may lead to
an increase of the control-plane communication
overhead/delay. In this paper, we propose to minimize
the maximum response time on controllers through flow
redirecting, which is implemented by installing
wildcard rules on switches. We formulate the minimum
controller response time problem, which takes the
flow-table size and link capacity constraints into
account, as an integer linear program, and prove its
NP-Hardness. Two algorithms with bounded approximation
factors are designed to solve this problem. We
implement the proposed methods on our SDN testbed. The
testing results and extensive simulation results show
that our proposed algorithm can reduce the maximum
controller response time by about 50\%--80\% compared
with the static/dynamic methods under the same
controller cost, or reduce the number of controllers by
30\% compared with the dynamic method while preserving
almost the same controller response time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2018:AMW,
author = "Guang Yang and Ming Xiao and Hussein Al-Zubaidy and
Yongming Huang and James Gross",
title = "Analysis of Millimeter-Wave Multi-Hop Networks With
Full-Duplex Buffered Relays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "576--590",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2786341",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The abundance of spectrum in the millimeter-wave
mm-wave bands makes it an attractive alternative for
future wireless communication systems. Such systems are
expected to provide data transmission rates in the
order of multi-gigabits per second in order to satisfy
the ever-increasing demand for high rate data
communication. Unfortunately, mm-wave radio is subject
to severe path loss, which limits its usability for
long-range outdoor communication. In this paper, we
propose a multi-hop mm-wave wireless network for
outdoor communication, where multiple full-duplex
buffered relays are used to extend the communication
range, while providing end-to-end performance
guarantees to the traffic traversing the network. We
provide a cumulative service process characterization
for the mm-wave propagation channel with
self-interference in terms of the moment generating
function of its channel capacity. Then, we then use
this characterization to compute probabilistic upper
bounds on the overall network performance, i.e., total
backlog and end-to-end delay. Furthermore, we study the
effect of self-interference on the network performance
and propose an optimal power allocation scheme to
mitigate its impact in order to enhance network
performance. Finally, we investigate the relation
between relay density and network performance under a
sum power constraint. We show that increasing relay
density may have adverse effects on network
performance, unless the self-interference can be kept
sufficiently small.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bienkowski:2018:OAF,
author = "Marcin Bienkowski and Nadi Sarrar and Stefan Schmid
and Steve Uhlig",
title = "Online Aggregation of the Forwarding Information Base:
Accounting for Locality and Churn",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "591--604",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2787419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of compressing the
forwarding information base FIB, but taking a wider
perspective. Indeed, FIB compression goes beyond sheer
compression, as the gain in memory use obtained from
the compression has consequences on the updates that
will have to be applied to the compressed FIB. We are
interested in the situation where forwarding rules can
change over time, e.g., due to border gateway protocol
BGP route updates. Accordingly, we frame FIB
compression as an online problem and design competitive
online algorithms to solve it. In contrast to prior
work which mostly focused on static optimizations, we
study an online variant of the problem where routes can
change over time and where the number of updates to the
FIB is taken into account explicitly. The reason to
consider this version of the problem is that leveraging
temporal locality while accounting for the number of
FIB updates helps to keep routers CPU load low and
reduces the number of FIB updates to be transferred,
e.g., from the network-attached software-defined
network controller to a remote switch. This paper
introduces a formal model which is an interesting
generalization of several classic online aggregation
problems. Our main contribution is an Ow-competitive
algorithm, where $ {w} $ is the length of an IP
address. We also derive a lower bound which shows that
our result is asymptotically optimal within a natural
class of algorithms, based on so-called sticks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2018:LAC,
author = "Bin Tang and Shenghao Yang",
title = "An {LDPC} Approach for Chunked Network Codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "605--617",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2787726",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Efficient communication through a multi-hop network
with packet loss requires random linear network coding
schemes with low computation cost and high throughput.
In this paper, we propose a low-density parity-check
LDPC-based framework for constructing chunked code, a
variation of random linear network code with low
encoding/decoding computational cost and small
coefficient vector overhead. Two classes of chunked
codes with LDPC structures, named uniform LDPC-chunked
codes and overlapped LDPC-chunked OLC codes, are
studied under a general chunk transfer matrix model.
ULC codes achieve rates close to the optimum and
perform better than existing chunked codes that employ
parity-check constraints. OLC codes are overlapped
chunked codes, where it is not necessary to generate
new packets for encoding, and demonstrate much higher
rates in certain scenarios than the state-of-the-art
designs of overlapped chunked codes. These results
justifies the feasibility of this LDPC approach for
communication through multi-hop networks with packet
loss.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2018:AHS,
author = "Hongli Xu and He Huang and Shigang Chen and Gongming
Zhao and Liusheng Huang",
title = "Achieving High Scalability Through Hybrid Switching in
Software-Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "618--632",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2789339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional networks rely on aggregate routing and
decentralized control to achieve scalability. On the
contrary, software-defined networks achieve near
optimal network performance and policy-based management
through per-flow routing and centralized control,
which, however, face scalability challenge due to: 1
limited ternary content addressable memory and on-die
memory for storing the forwarding table and 2 per-flow
communication/computation overhead at the controller.
This paper presents a novel hybrid switching HS design,
which integrates traditional switching and
software-defined networking SDN switching for the
purpose of achieving both scalability and optimal
performance. We show that the integration also leads to
unexpected benefits of making both types of switching
more efficient under the hybrid design. We also design
the general optimization framework via HS and propose
an approximation algorithm for load-balancing
optimization as a case study. Testing and numerical
evaluation demonstrate the superior performance of HS
when comparing with the state-of-the-art SDN design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2018:JOM,
author = "Luoyi Fu and Xinzhe Fu and Zesen Zhang and Zhiying Xu
and Xudong Wu and Xinbing Wang and Songwu Lu",
title = "Joint Optimization of Multicast Energy in
Delay-Constrained Mobile Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "633--646",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2790639",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of optimizing multicast
energy consumption in delay-constrained mobile wireless
networks, where information from the source needs to be
delivered to all the $k$ destinations within an imposed
delay constraint. Most existing works simply focus on
deriving transmission schemes with the minimum
transmitting energy, overlooking the energy consumption
at the receiver side. Therefore, in this paper, we
propose ConMap, a novel and general framework for
efficient transmission scheme design that jointly
optimizes both the transmitting and receiving energy.
In doing so, we formulate our problem of designing
minimum energy transmission scheme, called DeMEM, as a
combinatorial optimization one, and prove that the
approximation ratio of any polynomial time algorithm
for DeMEM cannot be better than $ 1 / 4 \ln k$. Aiming
to provide more efficient approximation schemes, the
proposed ConMap first converts DeMEM into an equivalent
directed Steiner tree problem through creating
auxiliary graph gadgets to capture energy consumption,
then maps the computed tree back into a transmission
scheme. The advantages of ConMap are threefolded: 1
Generality-- ConMap exhibits strong applicability to a
wide range of energy models; 2 Flexibility-- Any
algorithm designed for the problem of directed Steiner
tree can be embedded into our ConMap framework to
achieve different performance guarantees and
complexities; 3 Efficiency-- ConMap preserves the
approximation ratio of the embedded Steiner tree
algorithm, to which only slight overhead will be
incurred. The three features are then empirically
validated, with ConMap also yielding near-optimal
transmission schemes compared to a brute-force exact
algorithm. To our best knowledge, this is the first
work that jointly considers both the transmitting and
receiving energy in the design of multicast
transmission schemes in mobile wireless networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Norige:2018:TUF,
author = "Eric Norige and Alex X. Liu and Eric Torng and Eric
Torng and Eric Norige and Alex X. Liu",
title = "A Ternary Unification Framework for Optimizing
{TCAM}-Based Packet Classification Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "657--670",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2809583",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is the key mechanism for
enabling many networking and security services. Ternary
content addressable memory TCAM has been the industrial
standard for implementing high-speed packet
classification because of its constant classification
time. However, TCAM chips have small capacity, high
power consumption, high heat generation, and large
area-size. This paper focuses on the TCAM-based
classifier compression problem: given a classifier $C$,
we want to construct the smallest possible list of TCAM
entries $T$ that implement $C$. In this paper, we
propose the ternary unification framework TUF for this
compression problem and three concrete compression
algorithms within this framework. The framework allows
us to find more optimization opportunities and design
new TCAM-based classifier compression algorithms. Our
experimental results show that the TUF can speed up the
prior algorithm TCAM Razor by 20 times or more and
leads to new algorithms that improve compression
performance over prior algorithms by an average of
13.7\% on our largest real-life classifiers. The
experimental results show that our algorithms can
improve both the runtime and the compression ratio over
prior work.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2018:USH,
author = "Desheng Zhang and Tian He and Fan Zhang and Chengzhong
Xu and Tian He and Fan Zhang and Desheng Zhang and
Chengzhong Xu",
title = "Urban-Scale Human Mobility Modeling With Multi-Source
Urban Network Data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "671--684",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2801598",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Expanding our knowledge about human mobility is
essential for building efficient wireless protocols and
mobile applications. Previous mobility studies have
typically been built upon empirical single-source data
e.g., cellphone or transit data, which inevitably
introduces a bias against residents not contributing
this type of data, e.g., call detail records cannot be
obtained from the residents without cellphone
activities, and transit data cannot cover the residents
who walk or ride private vehicles. To address this
issue, we propose and implement a novel architecture
mPat to explore human mobility using multi-source urban
network data. A reference implementation of mPat was
developed at an unprecedented scale upon the urban
infrastructures of Shenzhen, China. The novelty and
uniqueness of mPat lie in its three layers: 1 a data
feed layer consisting of real-time data feeds from
various urban networks with 24 thousand vehicles, 16
million smart cards, and 10 million cellphones; 2 a
mobility abstraction layer exploring correlation and
divergence among multi-source data to infer human
mobility with a context-aware optimization model based
on block coordinate decent; and 3 an application layer
to improve urban efficiency based on the human mobility
findings of the study. The evaluation shows that mPat
achieves a 79\% inference accuracy, and that its
real-world application reduces passenger travel time by
36\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ding:2018:SBC,
author = "Haichuan Ding and Chi Zhang and Xuanheng Li and
Jianqing Liu and Miao Pan and Yuguang Fang and Shigang
Chen and Yuguang Fang and Chi Zhang and Miao Pan and
Xuanheng Li and Jianqing Liu and Haichuan Ding and
Shigang Chen",
title = "Session-Based Cooperation in Cognitive Radio Networks:
a Network-Level Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "685--698",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2794261",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Currently, the cooperation-based spectrum access in
cognitive radio networks CRNs is implemented via
cooperative communications based on link-level
frame-based cooperative LLC approach, where individual
secondary users SUs independently serve as relays for
primary users PUs in order to gain spectrum access
opportunities. Unfortunately, this LLC approach cannot
fully exploit spectrum access opportunities to enhance
the throughput of CRNs and fails to motivate PUs to
join the spectrum sharing processes. To address these
challenges, we propose a network-level session-based
cooperative NLC approach, where SUs are grouped
together to cooperate with PUs session by session,
instead of frame by frame, for spectrum access
opportunities of the corresponding group. To articulate
our NLC approach, we further develop an NLC scheme
under a cognitive capacity harvesting network
architecture. We formulate the cooperative mechanism
design as a cross-layer optimization problem with
constraints on primary session selection, flow routing
and link scheduling. Through extensive simulations, we
demonstrate the effectiveness of the proposed NLC
approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jia:2018:OSN,
author = "Yongzheng Jia and Chuan Wu and Zongpeng Li and Franck
Le and Alex Liu and Zongpeng Li and Yongzheng Jia and
Chuan Wu and Franck Le and Alex Liu",
title = "Online Scaling of {NFV} Service Chains Across
Geo-Distributed Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "699--710",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2800400",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Network Function Virtualization NFV is an emerging
paradigm that turns hardware-dependent implementation
of network functions i.e., middleboxes into software
modules running on virtualized platforms, for
significant cost reduction and ease of management. Such
virtual network functions VNFs commonly constitute
service chains, to provide network services that
traffic flows need to go through. Efficient deployment
of VNFs for network service provisioning is a key to
realize the NFV goals. Existing efforts on VNF
placement mostly deal with offline or one-time
placement, ignoring the fundamental, dynamic deployment
and scaling need of VNFs to handle practical
time-varying traffic volumes. This work investigates
dynamic placement of VNF service chains across
geo-distributed datacenters to serve flows between
dispersed source and destination pairs, for operational
cost minimization of the service chain provider over
the entire system span. An efficient online algorithm
is proposed, which consists of two main components: 1 A
regularization-based approach from online learning
literature to convert the offline optimal deployment
problem into a sequence of one-shot regularized
problems, each to be efficiently solved in one time
slot and 2 An online dependent rounding scheme to
derive feasible integer solutions from the optimal
fractional solutions of the one-shot problems, and to
guarantee a good competitive ratio of the online
algorithm over the entire time span. We verify our
online algorithm with solid theoretical analysis and
trace-driven simulations under realistic settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hou:2018:PTP,
author = "Yuxiao Hou and Yuanqing Zheng and Yuxiao Hou and
Yuanqing Zheng",
title = "{PHY-Tree}: Physical Layer Tree-Based {RFID}
Identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "711--723",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2791938",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Tree-based RFID identification adopts a binary-tree
structure to collect IDs of an unknown set. Tag IDs
locate at the leaf nodes and the reader queries through
intermediate tree nodes and converges to these IDs
using feedback from tag responses. Existing works
cannot function well under the scenario of non-uniform
ID distribution as they ignore those ID distribution
information hidden in the physical-layer signal of
colliding tags. Different from them, we introduce
PHY-Tree, a novel tree-based scheme that collects two
types of information regarding ID distribution from
every encountered colliding signal. First, we can
detect if all colliding tags send the same bit content
at each bit index by looking into inherent temporal
features of the tag modulation schemes. If such
resonant states are detected, either left or right
branch of a certain sub-tree can be trimmed
horizontally. Second, we estimate the number of
colliding tags in a slot by computing a related metric
defined over the signal's constellation map, based on
which nodes in the same layers of a certain sub-tree
can be skipped vertically. We thus call the two types
of information as horizontal and vertical info.
Evaluations from both experiments and simulations
demonstrate that PHY-Tree outperforms the
state-of-the-art schemes by at least $ 1.79 \times $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deng:2018:OCP,
author = "Han Deng and I-Hong Hou and I-Hong Hou and Han Deng",
title = "Optimal Capacity Provisioning for Online Job
Allocation With Hard Allocation Ratio Requirement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "724--736",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2794394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of allocating jobs to appropriate servers
in cloud computing is studied in this paper. We
consider that the jobs of various types arrive in some
unpredictable pattern and the system is required to
allocate a certain ratio of jobs. In order to meet the
hard allocation ratio requirement in the presence of
unknown arrival patterns, one can increase the capacity
of servers by expanding the size of data centers. We
then aim to find the minimum capacity needed to meet a
given allocation ratio requirement. We study this
problem for both systems with persistent jobs, such as
video streaming, and systems with dynamic jobs, such as
database queries. For both systems, we propose online
job allocation policies with low complexity. For
systems with persistent jobs, we prove that our
policies can achieve a given hard allocation ratio
requirement with the least capacity. For systems with
dynamic jobs, the capacity needed for our policies to
achieve the hard allocation ratio requirement is close
to a theoretical lower bound. Two other popular
policies are studied, and we demonstrate that they need
at least an order higher capacity to meet the same hard
allocation ratio requirement. Simulation results
demonstrate that our policies remain far superior than
the other two even, when the jobs arrive according to
some random process.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ioannidis:2018:ACN,
author = "Stratis Ioannidis and Edmund Yeh and Edmund Yeh and
Stratis Ioannidis",
title = "Adaptive Caching Networks With Optimality Guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "737--750",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2793581",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the optimal placement of content over a
network of caches, a problem naturally arising in
several networking applications. Given a demand of
content request rates and paths followed, we wish to
determine the content placement that maximizes the
expected caching gain, i.e., the reduction of routing
costs due to intermediate caching. The offline version
of this problem is NP-hard and, in general, the demand
and topology may be a priori unknown. Hence, a
distributed, adaptive approximation algorithm for
placing contents into caches is desired. We show that
path replication, a simple algorithm frequently
encountered in literature, can be arbitrarily
suboptimal when combined with traditional eviction
policies. We propose a distributed, adaptive algorithm
that performs stochastic gradient ascent on a concave
relaxation of the expected caching gain, and constructs
a probabilistic content placement within a $ 1 - 1 / e
$ factor from the optimal, in expectation. Motivated by
our analysis, we also propose a novel greedy eviction
policy to be used with path replication, and show
through numerical evaluations that both algorithms
significantly outperform path replication with
traditional eviction policies over a broad array of
network topologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2018:CAR,
author = "Wei Gong and Haoxiang Liu and Jiangchuan Liu and
Xiaoyi Fan and Kebin Liu and Qiang Ma and Xiaoyu Ji and
Kebin Liu and Jiangchuan Liu and Xiaoyi Fan and Qiang
Ma and Haoxiang Liu and Wei Gong and Xiaoyu Ji",
title = "Channel-Aware Rate Adaptation for Backscatter
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "751--764",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2802323",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Backscatter communication networks receive much
attention recently due to the small size and low power
of backscatter nodes. As backscatter communication is
often influenced by the dynamic wireless channel
quality, rate adaptation becomes necessary. Most
existing approaches share a common drawback: they fail
to take both spatial and frequency diversity into
consideration at the same time. Consequently, the
transmission rate may be improperly selected, resulting
in low network throughput. In this paper, we propose a
channel-aware rate adaptation framework CARA for
backscatter networks. CARA incorporates three essential
modules, a lightweight channel probing scheme that
differentiates collisions from packet losses, a
burstiness-aware channel selection mechanism benefiting
as many backscatter nodes as possible, a rate selection
method choosing the optimal rate, and a mobility
detection that discovers location changes. We implement
CARA on commercial readers, and the experiment results
show that CARA achieves up to $ 4 \times $ goodput gain
compared with the state-of-the-art rate adaptation
scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2018:PTE,
author = "Yue Cao and Zhiyun Qian and Zhongjie Wang and Tuan Dao
and Srikanth V. Krishnamurthy and Lisa M. Marvel and
Yue Cao and Tuan Dao and Lisa M. Marvel and Zhongjie
Wang and Zhiyun Qian and Srikanth V. Krishnamurthy",
title = "Off-Path {TCP} Exploits of the Challenge {ACK} Global
Rate Limit",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "765--778",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2797081",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we report a subtle yet serious side
channel vulnerability CVE-2016-5696 introduced in a
recent transmission control protocol TCP specification.
The specification is faithfully implemented in Linux
kernel version 3.6 from 2012 and beyond, and affects a
wide range of devices and hosts. In a nutshell, the
vulnerability allows a blind off-path attacker to infer
if any two arbitrary hosts on the Internet are
communicating using a TCP connection. Further, if the
connection is present, such an off-path attacker can
also infer the TCP sequence numbers in use, from both
sides of the connection; this in turn allows the
attacker to cause connection termination and perform
data injection attacks. We illustrate how the attack
can be leveraged to disrupt or degrade the privacy
guarantees of an anonymity network such as Tor, and
perform web connection hijacking. Through extensive
experiments, we show that the attack is fast and
reliable. On average, it takes about 40 to 60 s to
finish and the success rate is 88\% to 97\%. Finally,
we propose changes to both the TCP specification and
implementation to eliminate the root cause of the
problem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:MBT,
author = "Tingjun Chen and Javad Ghaderi and Dan Rubenstein and
Gil Zussman and Dan Rubenstein and Tingjun Chen and
Javad Ghaderi and Gil Zussman",
title = "Maximizing Broadcast Throughput Under Ultra-Low-Power
Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "779--792",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2805185",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless object-tracking applications are gaining
popularity and will soon utilize emerging
ultra-low-power device-to-device communication.
However, severe energy constraints require much more
careful accounting of energy usage than what prior art
provides. In particular, the available energy, the
differing power consumption levels for listening,
receiving, and transmitting, as well as the limited
control bandwidth must all be considered. Therefore, we
formulate the problem of maximizing the throughput
among a set of heterogeneous broadcasting nodes with
differing power consumption levels, each subject to a
strict ultra-low-power budget. We obtain the oracle
throughput i.e., maximum throughput achieved by an
oracle and use Lagrangian methods to design EconCast
--- a simple asynchronous distributed protocol in which
nodes transition between sleep, listen, and transmit
states, and dynamically change the transition rates.
EconCast can operate in groupput or anyput mode to
respectively maximize two alternative throughput
measures. We show that EconCast approaches the oracle
throughput. The performance is also evaluated
numerically and via extensive simulations and it is
shown that EconCast outperforms prior art by $ 6 \times
$ --$ 17 \times $ under realistic assumptions.
Moreover, we evaluate EconCast's latency performance
and consider design tradeoffs when operating in
groupput and anyput modes. Finally, we implement
EconCast using the TI eZ430-RF2500-SEH energy
harvesting nodes and experimentally show that in
realistic environments it obtains 57\%--77\% of the
achievable throughput.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:ARIa,
author = "Kun Xie and Lele Wang and Xin Wang and Gaogang Xie and
Jigang Wen and Guangxing Zhang and Jiannong Cao and
Dafang Zhang and Kun Xie and Xin Wang and Dafang Zhang
and Jiannong Cao and Lele Wang and Gaogang Xie and
Jigang Wen and Guangxing Zhang",
title = "Accurate Recovery of {Internet} Traffic Data: a
Sequential Tensor Completion Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "793--806",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2797094",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The inference of traffic volume of the whole network
from partial traffic measurements becomes increasingly
critical for various network engineering tasks, such as
capacity planning and anomaly detection. Previous
studies indicate that the matrix completion is a
possible solution for this problem. However, as a 2-D
matrix cannot sufficiently capture the spatial-temporal
features of traffic data, these approaches fail to work
when the data missing ratio is high. To fully exploit
hidden spatial-temporal structures of the traffic data,
this paper models the traffic data as a 3-way traffic
tensor and formulates the traffic data recovery problem
as a low-rank tensor completion problem. However, the
high computation complexity incurred by the
conventional tensor completion algorithms prevents its
practical application for the traffic data recovery. To
reduce the computation cost, we propose a novel
sequential tensor completion algorithm, which can
efficiently exploit the tensor decomposition result
based on the previous traffic data to derive the tensor
decomposition upon arriving of new data. Furthermore,
to better capture the changes of data correlation over
time, we propose a dynamic sequential tensor completion
algorithm. To the best of our knowledge, we are the
first to propose sequential tensor completion
algorithms to significantly speed up the traffic data
recovery process. This facilitates the modeling of
Internet traffic with the tensor to well exploit the
hidden structures of traffic data for more accurate
missing data inference. We have done extensive
simulations with the real traffic trace as the input.
The simulation results demonstrate that our algorithms
can achieve significantly better performance compared
with the literature tensor and matrix completion
algorithms even when the data missing ratio is high.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Du:2018:PDS,
author = "Jian Du and Xue Liu and Lei Rao and Jian Du and Lei
Rao and Xue Liu",
title = "Proactive {Doppler} Shift Compensation in Vehicular
Cyber-Physical Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "807--818",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2797107",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In vehicular cyber-physical systems CPS, safety
information, including vehicular speed and location
information, is shared among vehicles via wireless
waves at specific frequency. This helps control vehicle
to alleviate traffic congestion and road accidents.
However, Doppler shift existing between vehicles with
high relative speed causes an apparent frequency shift
for the received wireless wave, which consequently
decreases the reliability of the recovered safety
information and jeopardizes the safety of vehicular
CPS. Passive confrontation of Doppler shift at the
receiver side is not applicable due to multiple Doppler
shifts at each receiver. In this paper, we provide a
proactive Doppler shift compensation algorithm based on
the probabilistic graphical model. Each vehicle
pre-compensates its carrier frequency individually, so
that there is no frequency shift from the desired
carrier frequency between each pair of transceiver. The
pre-compensated offset for each vehicle is computed in
a distributed fashion in order to be adaptive to the
distributed and dynamic topology of vehicular CPS.
Besides, the updating procedure is designed in a
broadcasting fashion to reduce communication burden. It
is rigorously proved that the proposed algorithm is
convergence guaranteed even for systems with packet
drops and random communication delays. Simulations
based on real map and transportation data verify the
accuracy and convergence property of the proposed
algorithm. It is shown that this method achieves almost
the optimal frequency compensation accuracy with an
error approaching the Cram{\'e}r--Rao lower bound.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Desmouceaux:2018:SAA,
author = "Yoann Desmouceaux and Pierre Pfister and Jerome Tollet
and Mark Townsley and Thomas Clausen and Jerome Tollet
and Mark Townsley and Yoann Desmouceaux and Thomas
Clausen and Pierre Pfister",
title = "{6LB}: Scalable and Application-Aware Load Balancing
with Segment Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "819--834",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2799242",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network load-balancers generally either do not take
the application state into account, or do so at the
cost of a centralized monitoring system. This paper
introduces a load-balancer running exclusively within
the IP forwarding plane, i.e., in an application
protocol agnostic fashion --- yet which still provides
application-awareness and makes real-time,
decentralized decisions. To that end, IPv6 Segment
Routing is used to direct data packets from a new flow
through a chain of candidate servers, until one decides
to accept the connection, based solely on its local
state. This way, applications themselves naturally
decide on how to fairly share incoming connections,
while incurring minimal network overhead, and no
out-of-band signaling. A consistent hashing algorithm,
as well as an in-band stickiness protocol, allow for
the proposed solution to be able to be reliably
distributed across a large number of instances.
Performance evaluation by means of an analytical model
and actual tests on different workloads including a
Wikipedia replay as a realistic workload show
significant performance benefits in terms of shorter
response times, when compared with the traditional
random load-balancer. In addition, this paper
introduces and compares kernel bypass high-performance
implementations of both 6LB and the state-of-the-art
load-balancer, showing that the significant
system-level benefits of 6LB are achievable with a
negligible data-path CPU overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bremler-Barr:2018:ESR,
author = "Anat Bremler-Barr and Yotam Harchol and David Hay and
Yacov Hel-Or and Yotam Harchol and Anat Bremler-Barr
and David Hay and Yacov Hel-Or",
title = "Encoding Short Ranges in {TCAM} Without Expansion:
Efficient Algorithm and Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "835--850",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2797690",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present range encoding with no expansion REN{\'E}
--- a novel encoding scheme for short ranges on Ternary
content addressable memory TCAM, which, unlike previous
solutions, does not impose row expansion, and uses bits
proportionally to the maximal range length. We provide
theoretical analysis to show that our encoding is the
closest to the lower bound of number of bits used. In
addition, we show several applications of our technique
in the field of packet classification, and also, how
the same technique could be used to efficiently solve
other hard problems, such as the nearest-neighbor
search problem and its variants. We show that using
TCAM, one could solve such problems in much higher
rates than previously suggested solutions, and
outperform known lower bounds in traditional memory
models. We show by experiments that the translation
process of REN{\'E} on switch hardware induces only a
negligible 2.5\% latency overhead. Our nearest neighbor
implementation on a TCAM device provides search rates
that are up to four orders of magnitude higher than
previous best prior-art solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2018:CAL,
author = "Jiayi Liu and Qinghai Yang and Gwendal Simon and Jiayi
Liu and Gwendal Simon and Qinghai Yang",
title = "Congestion Avoidance and Load Balancing in Content
Placement and Request Redirection for Mobile {CDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "851--863",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2804979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "With the development of network function
virtualization and software-defined network standards,
the mobile network operators are interested in
integrating content delivery network CDN
functionalities into the mobile network to enhance
their capability for supporting content oriented
services. We consider a mobile CDN system, where Base
Stations BSs are equipped with storage for replicating
content. In such a system, BSs cooperation in replying
user requests through backhaul links is a widely
adopted mechanism. Blindly redirect user requests upon
content placement can cause traffic congestion. As a
result, congestion avoidance and load balancing is an
important issue to be tackled in this scenario. We
investigated the joint optimization problem of content
placement and request redirection for the BS-based
mobile CDN. Specifically, each BS maintains a
transmission queue for replying requests issued from
other BSs. Network congestion and BSs load balancing
can be jointly considered through guaranteeing network
stability. We employ the stochastic optimization model
to minimize the long-term time-average transmission
cost under network stability constraints. By using the
Lyapunov optimization technique, we transform the
long-term problem into a set of linear programs solved
in each short time duration, and we develop an on-line
algorithm to efficiently decide content placement and
request redirection without requiring a priori
knowledge on the random network state information.
Through our theoretical analysis, the performance of
the algorithm on optimality and network stability is
given. The evaluation confirms that our solution can
achieve low transmission cost, whilst avoiding
congestion and balancing traffic loads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pokhrel:2018:MCT,
author = "Shiva Raj Pokhrel and Carey Williamson and Carey
Williamson and Shiva Raj Pokhrel",
title = "Modeling Compound {TCP} Over {WiFi} for {IoT}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "864--878",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2806352",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Compound TCP will play a central role in future home
WiFi networks supporting Internet of Things IoT
applications. Compound TCP was designed to be fair but
can manifest throughput unfairness in
infrastructure-based IEEE 802.11 networks when devices
at different locations experience different wireless
channel quality. In this paper, we develop a
comprehensive analytical model for compound TCP over
WiFi. Our model captures the flow and congestion
control dynamics of multiple competing long-lived
compound TCP connections as well as the medium access
control layer dynamics i.e., contention, collisions,
and retransmissions that arise from different
signal-to-noise ratios SNRs perceived by the devices.
Our model provides accurate estimates for TCP packet
loss probabilities and steady-state throughputs for IoT
devices with different SNRs. More importantly, we
propose a simple adaptive control algorithm to achieve
better fairness without compromising the aggregate
throughput of the system. The proposed real-time
algorithm monitors the access point queue, drives the
system dynamics to the desired operating point which
mitigates the adverse impacts of SNR differences, and
accommodates the sporadically transmitting IoT sensors
in the system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chatterjee:2018:EFC,
author = "Avhishek Chatterjee and Michael Borokhovich and Lav R.
Varshney and Sriram Vishwanath and Lav R. Varshney and
Avhishek Chatterjee and Sriram Vishwanath and Michael
Borokhovich",
title = "Efficient and Flexible Crowdsourcing of Specialized
Tasks With Precedence Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "879--892",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2811736",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many companies now use crowdsourcing to leverage
external as well as internal crowds to perform
specialized work, and so methods of improving
efficiency are critical. Tasks in crowdsourcing systems
with specialized work have multiple steps and each step
requires multiple skills. Steps may have different
flexibilities in terms of obtaining service from one or
multiple agents due to varying levels of dependency
among parts of steps. Steps of a task may have
precedence constraints among them. Moreover, there are
variations in loads of different types of tasks
requiring different skill sets and availabilities of
agents with different skill sets. Considering these
constraints together necessitate the design of novel
schemes to allocate steps to agents. In addition, large
crowdsourcing systems require allocation schemes that
are simple, fast, decentralized, and offer customers
task requesters the freedom to choose agents. In this
paper, we study the performance limits of such
crowdsourcing systems and propose efficient allocation
schemes that provably meet the performance limits under
these additional requirements. We demonstrate our
algorithms on data from a crowdsourcing platform run by
a nonprofit company and show significant improvements
over current practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ren:2018:DMD,
author = "Xiaoqi Ren and Palma London and Juba Ziani and Adam
Wierman and Palma London and Juba Ziani and Adam
Wierman and Xiaoqi Ren",
title = "{Datum}: Managing Data Purchasing and Data Placement
in a Geo-Distributed Data Market",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "893--905",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2811374",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies two design tasks faced by a
geo-distributed cloud data market: which data to
purchase data purchasing and where to place/replicate
the data for delivery data placement. We show that the
joint problem of data purchasing and data placement
within a cloud data market can be viewed as a facility
location problem and is thus NP-hard. However, we give
a provably optimal algorithm for the case of a data
market made up of a single data center and then
generalize the structure from the single data center
setting in order to develop a near-optimal,
polynomial-time algorithm for a geo-distributed data
market. The resulting design, $ \mathsf {Datum} $,
decomposes the joint purchasing and placement problem
into two subproblems, one for data purchasing and one
for data placement, using a transformation of the
underlying bandwidth costs. We show, via a case study,
that $ \mathsf {Datum} $ is near optimal within 1.6\%
in practical settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2018:GPS,
author = "Cheng-Shang Chang and Duan-Shin Lee and Chia-Kai Su
and Cheng-Shang Chang and Chia-Kai Su and Duan-Shin
Lee",
title = "{Greenput}: a Power-Saving Algorithm That Achieves
Maximum Throughput in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "906--919",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2808920",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The dynamic frame sizing algorithm is a
throughput-optimal algorithm that can achieve maximum
network throughput without the knowledge of arrival
rates. Motivated by the need for energy-efficient
communication in wireless networks, in this paper, we
propose a new dynamic frame sizing algorithm, called
the Greenput algorithm, that takes power allocation
into account. In our Greenput algorithm, time is
partitioned into frames, and the frame size of each
frame is determined based on the backlogs presented at
the beginning of a frame. To obtain a good delay-energy
efficiency tradeoff, the key insight of our Greenput
algorithm is to reduce transmit power to save energy
when the backlogs are low so as not to incur too much
packet delay. For this, we define a threshold parameter
$ T_{\max } $ for the minimum time to empty the
backlogs with maximum power allocation, and the
Greenput algorithm enters the mixed power-saving mode
when the backlogs are below the threshold. Using a
large deviation bound, we prove that our Greenput
algorithm is still throughput optimal. In addition to
the stability result, we also perform a fluid
approximation analysis for energy efficiency and
average packet delay when $ T_{\max } $ is very large.
To show the delay-energy efficiency tradeoff, we
conduct extensive computer simulations by using the
Shannon formula as the channel model in a wireless
network. Our simulation results show that both energy
efficiency and average packet delay are quite close to
their fluid approximations even when $ T_{\max } $ is
moderately large.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Blasius:2018:EES,
author = "Thomas Blasius and Tobias Friedrich and Anton Krohmer
and Soren Laue and Anton Krohmer and Soren Laue and
Tobias Friedrich and Thomas Blasius",
title = "Efficient Embedding of Scale-Free Graphs in the
Hyperbolic Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "920--933",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2810186",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Hyperbolic geometry appears to be intrinsic in many
large real networks. We construct and implement a new
maximum likelihood estimation algorithm that embeds
scale-free graphs in the hyperbolic space. All previous
approaches of similar embedding algorithms require at
least a quadratic runtime. Our algorithm achieves
quasi-linear runtime, which makes it the first
algorithm that can embed networks with hundreds of
thousands of nodes in less than one hour. We
demonstrate the performance of our algorithm on
artificial and real networks. In all typical metrics,
such as log-likelihood and greedy routing, our
algorithm discovers embeddings that are very close to
the ground truth.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kleinheksel:2018:EFT,
author = "Cory J. Kleinheksel and Arun K. Somani and Arun K.
Somani and Cory J. Kleinheksel",
title = "Enhancing Fault Tolerance and Resource Utilization in
Unidirectional Quorum-Based Cycle Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "934--947",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2811386",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cycle-based optical network routing, whether using
synchronous optical networking rings or p-cycles,
provides sufficient reliability in the network. Light
trails forming a cycle allow broadcasts within a cycle
to be used for efficient multicasts. Optimal
communication quorum sets forming optical cycles based
on light trails have been shown to flexibly and
efficiently route both point-to-point and
multipoint-to-multipoint traffic requests. Commonly,
cycle routing techniques use pairs of cycles to achieve
both routing and fault tolerance, which use substantial
resources and create the potential for
underutilization. Instead, we intentionally utilize $R$
redundancy within the quorum cycles for fault tolerance
such that every point-to-point communication pairs
occur in at least $R$ cycles. We develop a generalized
$R$ redundancy cycle technique that provides optical
networks high fault-tolerant communications capability.
When applied using only the single unidirectional
cycles rather than the standard paired cycles, the
generalized $R$ redundancy technique has been shown to
almost halve the necessary light-trail resources in the
network. However, due to unidirectional nature, a small
percentage of node pairs for one-to-one communication
may not have exactly two paths. For this reason, we
further develop a greedy cycle direction heuristic and
show a reduction of missing pairs. More importantly, we
show that the resource requirement is reduced while
maintaining the fault tolerance and dependability
expected from cycle-based routing. The result is a set
of cycles with 96.6\%--99.37\% fault coverage, while
using 42.9\%--47.18\% fewer resources.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basta:2018:ELF,
author = "Arsany Basta and Andreas Blenk and Szymon Dudycz and
Arne Ludwig and Stefan Schmid and Stefan Schmid and
Szymon Dudycz and Andreas Blenk and Arne Ludwig and
Arsany Basta",
title = "Efficient Loop-Free Rerouting of Multiple {SDN}
Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "948--961",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2810640",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Computer networks such as the Internet or datacenter
networks have become a crucial infrastructure for many
critical services. Accordingly, it is important that
such networks preserve the correctness criteria, even
during transitions from one correct configuration to a
new correct configuration. This paper initiates the
study of how to simultaneously update, i.e., reroute
multiple policies i.e., flows in a software-defined
network in a transiently consistent and efficient
manner. In particular, we consider the problem of
minimizing the number of controller--switch
interactions, henceforth called touches, while
preserving fundamental properties, in particular loop
freedom, at any time. Indeed, we empirically show that
the number of such interactions affects the resource
consumption at the switches. Our main result is a
negative one: we rigorously prove that jointly
optimizing multiple route updates in a consistent and
efficient manner is $ \mathcal {NP} $ -hard, already
for two routing policies. However, we also present an
efficient polynomial-time algorithm that, given a fixed
number of correct update schedules for independent
policies, computes an optimal global schedule with
minimal touches. This algorithm applies to any per-flow
independent consistency property, not only loop
freedom.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2018:AWR,
author = "Bo Yan and Yang Xu and H. Jonathan Chao and H.
Jonathan Chao and Yang Xu and Bo Yan",
title = "Adaptive Wildcard Rule Cache Management for
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "962--975",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2815983",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-Defined Networking enables flexible flow
control by caching rules at OpenFlow switches. Wildcard
rule caching enables management of traffic aggregates,
reduces flow setup queries, and simplifies policy
management. However, to guarantee correct packet
matching, some rules that depend on the requested rule
need to be cached as well, which leads to unnecessary
flow table bloat and potential overflow. We have
proposed a scheme called CAching rules in Buckets CAB
to mitigate the dependency issue by partitioning the
field space into buckets and caching rules associated
with the requested buckets. In this paper, we propose
the Adaptive Cache ManagEment ACME for CAB, which
dynamically adjusts the sizes and shapes of buckets
according to incoming traffic to achieve more efficient
flow table utilization. The improvement also includes
preloading rules that span a wide field space to reduce
bandwidth usage in the control channel. We formalize
the caching policies for CAB-ACME to guarantee the
semantic correctness of packet classification. We
evaluate the performance of CAB-ACME through
software-based simulations and a prototype built with
the OpenDaylight controller and hardware switches from
multiple vendors. The results show that, compared with
other rule caching schemes, CAB-ACME reduces the cache
miss rate by one order of magnitude and the control
channel bandwidth usage by a half. ACME also helps
maintain a steadier performance under dynamic traffic
changes compared with the baseline CAB design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2018:TBI,
author = "Jhih-Yu Huang and Pi-Chung Wang and Jhih-Yu Huang and
Pi-Chung Wang",
title = "{TCAM}-Based {IP} Address Lookup Using Longest Suffix
Split",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "976--989",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2815999",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Ternary content addressable memory TCAM plays an
important role in modern routers due to its capability
of performing fast IP address lookup. However, it is
expensive, space limited, and a major source of power
consumption in a router. In addition, because TCAM only
reports the first matching entry, updating TCAM entries
would be slow due to necessary entry reordering. In
this paper, we present a trie-based algorithm, longest
suffix split, to reduce the number of TCAM entries for
IP address lookup. The algorithm divides route prefixes
into two portions, subprefix and suffix. The route
prefixes with the same subprefix and similar suffix
portions can then be represented by one TCAM entry and
one SRAM entry. Each SRAM entry stores one of two
succinct data structures, depending on the threshold
number of similar suffixes. The experimental results
show that our scheme can reduce 50\% to 95\% TCAM
entries for the original routing tables. Our scheme
also supports incremental updates. Because the
drawbacks of TCAM are related to the number of required
entries, our scheme significantly improves the
feasibility of TCAM-based IP address lookup. While
network virtualization may store multiple forwarding
information bases in a router, the number of supported
virtual routers can be increased by our scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2018:AAS,
author = "Xiaofeng Gao and Jiahao Fan and Fan Wu and Guihai Chen
and Jiahao Fan and Guihai Chen and Xiaofeng Gao and Fan
Wu",
title = "Approximation Algorithms for Sweep Coverage Problem
With Multiple Mobile Sensors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "990--1003",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2815630",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sweep coverage plays an important role in many
applications like data gathering, sensing coverage, and
devices control. In this paper, we deal with the sweep
coverage problem with multiple mobile sensors to
periodically cover $n$ targets in the surveillance
region. We propose three constant-factor
approximations, namely, CycleSplit, HeteroCycleSplit,
and PathSplit, to minimize the longest sweep period of
mobile sensors under different scenarios, respectively.
CycleSplit deals with the min-period sweep coverage
problem MPSC, in which each mobile sensor works
independently along a predetermined trajectory cycle.
It has an approximation ratio of $ 5 - {2} / {n - m +
1}$, which improves the best known approximation ratio
of 5. HeteroCycleSplit is a $ 5 \alpha $
-approximation. It computes the sensor routes for
heterogeneous velocity min-period sweep coverage
problem HVMPSC, where each mobile sensor has a
different velocity. PathSplit is a 2-approximation for
connected path min-period sweep coverage problem
CPMPSC. It solves a variant problem of sweep coverage
where we need to cover all the given edges. Besides, we
also propose an optimal algorithm DP-MPSC for
min-period sweep coverage problem in 1-D case. Finally,
we provide various numerical experiments and
comparisons with several previous work to validate the
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{Kao:2018:DUT,
author = "Sheng-Chun Kao and Ding-Yuan Lee and Ting-Sheng Chen
and An-Yeu Wu and Sheng-Chun Kao and Ding-Yuan Lee and
An-Yeu Wu and Ting-Sheng Chen",
title = "Dynamically Updatable Ternary Segmented Aging {Bloom}
Filter for {OpenFlow}-Compliant Low-Power Packet
Processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "1004--1017",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2813425",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "OpenFlow, the main protocol for software-defined
networking, requires large-sized rule tables and
frequent updating. For fast packet processing, rule
tables are often implemented with ternary
content-addressable memory TCAM in the OpenFlow. To
deal with TCAM power problems, many network
applications employ bloom filters BFs to reduce the
redundant operations of table-lookup and for low power
consumption. However, applying traditional BFs to an
OpenFlow switch leads to problems, such as unsupported
dynamic update, large space overhead, and the rule-set
expansion of ternary data. In this paper, we propose a
dynamically updatable ternary segmented aging bloom
filter TSA-BF. The TSA-BF consists of two parts: a
segmented aging BF algorithm SA-BF and a ternary
prefix-tagging encoder TPE. First, in the SA-BF, we
develop an automatic update scheme using the mechanisms
of content-aging and buffer-segmenting. The SA-BF ages
and deletes its contents automatically, thus
eliminating the costly communication overhead and
enabling dynamic updating. It also achieves space
efficiency by the developed partial-deletion mechanism.
Second, in the TPE, we encode ternary prefix-rules into
uniquely decodable binary code words. The TPE prevents
the rule-set expansion of ternary-data in the OpenFlow
environment. Simulation results show that the SA-BF
alone can save 37\% of space overhead, compared with
state-of-the-art techniques. In an environment with the
ternary prefix-rules, the TSA-BF can save another 93\%
of space overhead, compared with the best-performance
scheme. Hence, the proposed TSA-BF is highly suited to
the requirements of emerging high-performance
TCAM-based packet processing in the OpenFlow, which
considers dynamic update and power efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2018:RTR,
author = "Hongbo Jiang and Ping Zhao and Chen Wang and Chen Wang
and Hongbo Jiang and Ping Zhao",
title = "{RobLoP}: Towards Robust Privacy Preserving Against
Location Dependent Attacks in Continuous {LBS}
Queries",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "1018--1032",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2812851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing popularity of location-based
services LBS, how to preserve one's location privacy
has become a key issue to be concerned. The commonly
used approach $k$ -anonymity, originally designed for
protecting a user's snapshot location privacy,
inherently fails to preserve the user from
location-dependent attacks LDA that include the maximum
movement boundary MMB attacks and maximum arrival
boundary MAB attacks, when the user continuously
requests LBS. This paper presents RobLoP, a robust
location privacy preserving algorithm against LDA in
continuous LBS queries. The key insight of RobLoP is to
theoretically derive the constraints of both MMB and
MAB in a uniform way. It provides a necessary condition
of the pairwise user to be safely cloaked against LDA.
On top of that, RobLoP first identifies those candidate
users who can be cloaked with the requesting user.
RobLoP then searches for a so-called strict point set
including the candidate set and other auxiliary points,
as a sufficient condition under which RobLoP can
finally generate the cloaked region successfully. To
the best of our knowledge, RobLoP is the first work
that can preserve location privacy against LDA
thoroughly and closely with a theoretical guarantee.
The effectiveness and superiority of RobLoP to
state-of-the-art studies are validated via extensive
simulations on the real trucks data, the synthetic
data, as well as the measured data collected by
ourselves.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2018:CGT,
author = "Ye Liu and Chung Shue Chen and Chi Wan Sung and
Chandramani Singh and Ye Liu and Chi Wan Sung and Chung
Shue Chen and Chandramani Singh",
title = "Corrections to {``A Game Theoretic Distributed
Algorithm for FeICIC Optimization in LTE-A HetNets''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "2",
pages = "1033--1033",
month = apr,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2813638",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 20 17:34:21 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Liu:2017:GTD}.",
abstract = "In [1], the Acknowledgment section was inadvertently
left out of the paper. The Acknowledgment should read
as follows: \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2018:IWF,
author = "Qian Ma and Lin Gao and Ya-Feng Liu and Jianwei
Huang",
title = "Incentivizing {Wi-Fi} Network Crowdsourcing: a
Contract Theoretic Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1035--1048",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2812785",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Crowdsourced wireless community network enables the
individual users to share their private Wi-Fi access
points APs with each other, hence it can achieve a
large Wi-Fi coverage with a small deployment cost via
crowdsourcing. This paper presents a novel
contract-based incentive framework to incentivize such
a Wi-Fi network crowdsourcing under incomplete
information where each user has certain private
information such as mobility pattern and Wi-Fi access
quality. In the proposed framework, the network
operator designs and offers a set of contract items to
users, each consisting of a Wi-Fi access price that a
user can charge others for accessing his AP and a
subscription fee that a user needs to pay the operator
for joining the community. Different from the existing
contracts in the literature, in our contract model,
each user's best choice depends not only on his private
information but also on other user's choices. This
greatly complicates the contract design, as the
operator needs to analyze the equilibrium choices of
all users, rather than the best choice of each single
user. We first derive the feasible contract that
guarantees the user's truthful information disclosure
based on the equilibrium analysis of the user choice,
and then derive the optimal and feasible contract that
yields a maximal profit for the operator. Our analysis
shows that a user who provides a higher Wi-Fi access
quality is more likely to choose a higher Wi-Fi access
price and subscription fee, regardless of the user
mobility pattern. Simulation results further show that
when increasing the average Wi-Fi access quality of
users, the operator can gain more profit, but
counter-intuitively offer lower Wi-Fi access prices and
subscription fees for users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2018:JBG,
author = "Ying Zhang and Lei Deng and Minghua Chen and Peijian
Wang",
title = "Joint Bidding and Geographical Load Balancing for
Datacenters: Is Uncertainty a Blessing or a Curse?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1049--1062",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2817525",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the scenario where a cloud service
provider CSP operates multiple geo-distributed
datacenters to provide Internet-scale service. Our
objective is to minimize the total electricity and
bandwidth cost by jointly optimizing electricity
procurement from wholesale markets and geographical
load balancing GLB, i.e., dynamically routing workloads
to locations with cheaper electricity. Under the ideal
setting where exact values of market prices and
workloads are given, this problem reduces to a simple
linear programming and is easy to solve. However, under
the realistic setting where only distributions of these
variables are available, the problem unfolds into a
non-convex infinite-dimensional one and is challenging
to solve. One of our main contributions is to develop
an algorithm that is proven to solve the challenging
problem optimally, by exploring the full design space
of strategic bidding. Trace-driven evaluations
corroborate our theoretical results, demonstrate fast
convergence of our algorithm, and show that it can
reduce the cost for the CSP by up to 20\% as compared
with baseline alternatives. This paper highlights the
intriguing role of uncertainty in workloads and market
prices, measured by their variances. While uncertainty
in workloads deteriorates the cost-saving performance
of joint electricity procurement and GLB,
counter-intuitively, uncertainty in market prices can
be exploited to achieve a cost reduction even larger
than the setting without price uncertainty.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basu:2018:ATB,
author = "Soumya Basu and Aditya Sundarrajan and Javad Ghaderi
and Sanjay Shakkottai and Ramesh Sitaraman",
title = "Adaptive {TTL}-Based Caching for Content Delivery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1063--1077",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2818468",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Content delivery networks CDNs cache and serve a
majority of the user-requested content on the Internet.
Designing caching algorithms that automatically adapt
to the heterogeneity, burstiness, and non-stationary
nature of real-world content requests is a major
challenge and is the focus of our work. While there is
much work on caching algorithms for stationary request
traffic, the work on non-stationary request traffic is
very limited. Consequently, most prior models are
inaccurate for non-stationary production CDN traffic.
We propose two TTL-based caching algorithms that
provide provable performance guarantees for request
traffic that is bursty and non-stationary. The first
algorithm called d-TTL dynamically adapts a TTL
parameter using stochastic approximation. Given a
feasible target hit rate, we show that d-TTL converges
to its target value for a general class of bursty
traffic that allows Markov dependence over time and
non-stationary arrivals. The second algorithm called
f-TTL uses two caches, each with its own TTL. The
first-level cache adaptively filters out non-stationary
traffic, while the second-level cache stores
frequently-accessed stationary traffic. Given feasible
targets for both the hit rate and the expected cache
size, f-TTL asymptotically achieves both targets. We
evaluate both d-TTL and f-TTL using an extensive trace
containing more than 500 million requests from a
production CDN server. We show that both d-TTL and
f-TTL converge to their hit rate targets with an error
of about 1.3\%. But, f-TTL requires a significantly
smaller cache size than d-TTL to achieve the same hit
rate, since it effectively filters out non-stationary
content.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2018:MDC,
author = "Li Yan and Haiying Shen and Kang Chen",
title = "{MobiT}: Distributed and Congestion-Resilient
Trajectory-Based Routing for Vehicular Delay Tolerant
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1078--1091",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2812169",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet routing is important for vehicular delay
tolerant networks VDTNs. Opportunistic routing
algorithms based on historical records are
insufficiently accurate in forwarder selection due to
movement randomness of vehicles. Trajectory-based
routing algorithms tackle vehicle movement randomness
but cannot be directly used in VDTNs due to the
dependence on APs. In this paper, we develop a
distributed trajectory-based routing algorithm called
MobiT for VDTNs. This non-trivial task faces three
challenges. First, vehicle trajectories must be
sufficiently collected. Second, the trajectories cannot
be updated frequently due to limited resources of the
repository nodes. Third, achieving high routing
performance even with partially collected trajectories.
Our real trace study lays the foundation of the design
of MobiT. Taking advantage of different roles of
vehicles, MobiT uses service vehicles that move in wide
areas to collect vehicle trajectories, and rely on the
service vehicles and roadside units called schedulers
for routing scheduling. By using regular temporal
congestion state of road segments, MobiT schedules the
packet to arrive at a roadside unit prior to the
destination vehicle to improve routing performance.
Furthermore, MobiT leverages vehicles' long-term
mobility patterns to assist routing. Our trace-driven
simulation and real experiments show the effectiveness
and efficiency of MobiT.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2018:FFD,
author = "Luoyi Fu and Songjun Ma and Lingkun Kong and Shiyu
Liang and Xinbing Wang",
title = "{FINE}: a Framework for Distributed Learning on
Incomplete Observations for Heterogeneous Crowdsensing
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1092--1109",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2814779",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In recent years, there has been a wide range of
applications of crowdsensing in mobile social networks
and vehicle networks. As centralized learning methods
lead to unreliabitlity of data collection, high cost of
central server, and concern of privacy, one important
problem is how to carry out an accurate distributed
learning process to estimate parameters of an unknown
model in crowdsensing. Motivated by this, we present
the design, analysis, and evaluation of FINE, a
distributed learning framework for incomplete-data and
non-smooth estimation. Our design, devoted to develop a
feasible framework that efficiently and accurately
learns the parameters in crowdsensing networks, well
generalizes the previous learning methods in which it
supports heterogeneous dimensions of data records
observed by different nodes, as well as minimization
based on non-smooth error functions. In particular,
FINE uses a novel distributed record completion
algorithm that allows each node to obtain the global
consensus by an efficient communication with neighbors,
and a distributed dual average algorithm that achieves
the efficiency of minimizing non-smooth error
functions. Our analysis shows that all these algorithms
converge, of which the convergence rates are also
derived to confirm their efficiency. We evaluate the
performance of our framework with experiments on
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{Yallouz:2018:MWL,
author = "Jose Yallouz and Ori Rottenstreich and Peter Babarczi
and Avi Mendelson and Ariel Orda",
title = "Minimum-Weight Link-Disjoint {Node-``Somewhat}
Disjoint'' Paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1110--1122",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2823912",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network survivability has been recognized as an issue
of major importance in terms of security, stability and
prosperity. A crucial research problem in this context
is the identification of suitable pairs of disjoint
paths. Here, ``disjointness'' can be considered in
terms of either nodes or links. Accordingly, several
studies have focused on finding pairs of either link or
node disjoint paths with a minimum sum of link weights.
In this paper, we investigate the gap between the
optimal node-disjoint and link-disjoint solutions.
Specifically, we formalize several optimization
problems that aim at finding minimum-weight
link-disjoint paths while restricting the number of its
common nodes. We establish that some of these variants
are computationally intractable, while for other
variants we establish polynomial-time algorithmic
solutions. Finally, through extensive simulations, we
show that, by allowing link-disjoint paths share a few
common nodes, a major improvement is obtained in terms
of the quality i.e., total weight of the solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:GRS,
author = "Gang Wang and Bolun Wang and Tianyi Wang and Ana Nika
and Haitao Zheng and Ben Y. Zhao",
title = "Ghost Riders: {Sybil} Attacks on Crowdsourced Mobile
Mapping Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1123--1136",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2818073",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Real-time crowdsourced maps, such as Waze provide
timely updates on traffic, congestion, accidents, and
points of interest. In this paper, we demonstrate how
lack of strong location authentication allows creation
of software-based Sybil devices that expose
crowdsourced map systems to a variety of security and
privacy attacks. Our experiments show that a single
Sybil device with limited resources can cause havoc on
Waze, reporting false congestion and accidents and
automatically rerouting user traffic. More importantly,
we describe techniques to generate Sybil devices at
scale, creating armies of virtual vehicles capable of
remotely tracking precise movements for large user
populations while avoiding detection. To defend against
Sybil devices, we propose a new approach based on
co-location edges, authenticated records that attest to
the one-time physical co-location of a pair of devices.
Over time, co-location edges combine to form large
proximity graphs that attest to physical interactions
between devices, allowing scalable detection of virtual
vehicles. We demonstrate the efficacy of this approach
using large-scale simulations, and how they can be used
to dramatically reduce the impact of the attacks. We
have informed Waze/Google team of our research
findings. Currently, we are in active collaboration
with Waze team to improve the security and privacy of
their system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:ARIb,
author = "Kun Xie and Can Peng and Xin Wang and Gaogang Xie and
Jigang Wen and Jiannong Cao and Dafang Zhang and Zheng
Qin",
title = "Accurate Recovery of {Internet} Traffic Data Under
Variable Rate Measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1137--1150",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2819504",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The inference of the network traffic matrix from
partial measurement data becomes increasingly critical
for various network engineering tasks, such as capacity
planning, load balancing, path setup, network
provisioning, anomaly detection, and failure recovery.
The recent study shows it is promising to more
accurately interpolate the missing data with a 3-D
tensor as compared with the interpolation methods based
on a 2-D matrix. Despite the potential, it is difficult
to form a tensor with measurements taken at varying
rate in a practical network. To address the issues, we
propose a Reshape-Align scheme to form the regular
tensor with data from variable rate measurements, and
introduce user-domain and temporal-domain factor
matrices which take full advantage of features from
both domains to translate the matrix completion problem
to the tensor completion problem based on
CANDECOMP/PARAFAC decomposition for more accurate
missing data recovery. Our performance results
demonstrate that our Reshape-Align scheme can achieve
significantly better performance in terms of several
metrics: error ratio, mean absolute error, and root
mean square error.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2018:MEU,
author = "Ye Yu and Djamal Belazzougui and Chen Qian and Qin
Zhang",
title = "Memory-Efficient and Ultra-Fast Network Lookup and
Forwarding Using {Othello} Hashing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1151--1164",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2820067",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network algorithms always prefer low memory cost and
fast packet processing speed. Forwarding information
base FIB, as a typical network processing component,
requires a scalable and memory-efficient algorithm to
support fast lookups. In this paper, we present a new
network algorithm, Othello hashing, and its application
of a FIB design called concise, which uses very little
memory to support ultra-fast lookups of network names.
Othello hashing and concise make use of minimal perfect
hashing and relies on the programmable network
framework to support dynamic updates. Our conceptual
contribution of concise is to optimize the memory
efficiency and query speed in the data plane and move
the relatively complex construction and update
components to the resource-rich control plane. We
implemented concise on three platforms. Experimental
results show that concise uses significantly smaller
memory to achieve much faster query speed compared to
existing solutions of network name lookups.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Einziger:2018:IBI,
author = "Gil Einziger and Benny Fellman and Roy Friedman and
Yaron Kassner",
title = "{ICE} Buckets: Improved Counter Estimation for Network
Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1165--1178",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2822734",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Measurement capabilities are essential for a variety
of network applications, such as load balancing,
routing, fairness, and intrusion detection. These
capabilities require large counter arrays in order to
monitor the traffic of all network flows. While
commodity SRAM memories are capable of operating at
line speed, they are too small to accommodate large
counter arrays. Previous works suggested estimators,
which trade precision for reduced space. However, in
order to accurately estimate the largest counter, these
methods compromise the accuracy of the smaller
counters. In this paper, we present a closed form
representation of the optimal estimation function. We
then introduce independent counter estimation buckets,
a novel algorithm that improves estimation accuracy for
all counters. This is achieved by separating the flows
to buckets and configuring the optimal estimation
function according to each bucket's counter scale. We
prove a tighter upper bound on the relative error and
demonstrate an accuracy improvement of up to 57 times
on real Internet packet traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joe-Wong:2018:SMD,
author = "Carlee Joe-Wong and Soumya Sen and Sangtae Ha",
title = "Sponsoring Mobile Data: Analyzing the Impact on
{Internet} Stakeholders",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1179--1192",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2826531",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As demand for mobile data increases, end users
increasingly need to pay more for consuming data.
Sponsored data is a new pricing model that allows
content providers CPs to subsidize some of this cost.
It potentially offers benefits to multiple Internet
stakeholders: users can enjoy lower data costs, CPs can
attract more users by subsidizing their data access,
and Internet service providers ISPs can create new
revenue streams by charging CPs for sponsored data.
However, the distribution of these benefits between
different users, CPs, and the ISP remains unclear.
Although concerns have been raised that sponsored data
disproportionately benefits larger, less cost-sensitive
CPs, little attention has been paid to analyzing
sponsored data's impact on end users. This paper does
so by first formulating an analytical model of user,
CP, and ISP interactions for heterogeneous users and
CPs and deriving their optimal behaviors. We then show
that while all three parties can benefit from sponsored
data, sponsorship benefits users more than CPs. These
disproportionate benefits are more pronounced for more
cost-sensitive users when they receive sponsorship from
less cost-sensitive CPs, indicating that sponsored data
may help to bridge the digital divide between users who
can afford the cost of mobile data and those who
cannot. We then show that sponsorship
disproportionately benefits less cost-sensitive CPs and
more cost-sensitive users, exacerbating disparities
among CPs but reducing disparities among users. We
finally illustrate these results through numerical
simulations with data from a commercial pricing
trial.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2018:TSI,
author = "Wenxin Li and Xiaobo Zhou and Keqiu Li and Heng Qi and
Deke Guo",
title = "{TrafficShaper}: Shaping Inter-Datacenter Traffic to
Reduce the Transmission Cost",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1193--1206",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2817206",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The emerging deployment of geographically distributed
data centers DCs incurs a significant amount of data
transfers over the Internet. Such transfers are
typically charged by Internet service providers with
the widely adopted $q$ th percentile charging model. In
such a charging model, the time slots with top $ 100 -
q$ percent of data transmission do not affect the total
transmission cost and can be viewed as ``free.'' This
brings the opportunity to optimize the scheduling of
inter-DC transfers to minimize the entire transmission
cost. However, a very little work has been done to
exploit those ``free'' time slots for scheduling
inter-DC transfers. The crux is that existing work
either lacks a mechanism to accumulate traffic to
``free'' time slots, or inevitably relies on prior
knowledge of future traffic arrival patterns. In this
paper, we present TrafficShaper, a new scheduler that
shapes the inter-DC traffic to exploit the ``free''
time slots involved in the $q$ th percentile charging
model, so as to reduce or even minimize the
transmission cost. When shaping traffic, TrafficShaper
advocates a simple principle: more traffic peaks should
be scheduled in ``free'' time slots, while less traffic
differentiation should be maintained among the
remaining time slots. To this end, TrafficShaper
designs a pricing-aware control framework, which makes
online decisions for inter-DC transfers without
requiring a prior knowledge of traffic arrivals. To
verify the performance of TrafficShaper, we conduct
rigorous theoretical analysis based on Lyapunov
optimization techniques, large-scale trace-driven
simulations, and small-scale testbed implementation.
Results from rigorous mathematical analyses demonstrate
that TrafficShaper can make the transmission cost
arbitrarily close to the optimum value. Extensive
trace-driven simulation results show that TrafficShaper
can reduce the transmission cost by up to 40.23\%,
compared with the state-of-the-art solutions. The
testbed experiments further verify that TrafficShaper
can realistically reduce the transmission cost by up to
19.38\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2018:RDM,
author = "Haiying Shen and Liuhua Chen",
title = "Resource Demand Misalignment: an Important Factor to
Consider for Reducing Resource Over-Provisioning in
Cloud Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1207--1221",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2823642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Previous resource provisioning strategies in cloud
datacenters allocate physical resources to virtual
machines VMs based on the predicted resource
utilization pattern of VMs. The pattern for VMs of a
job is usually derived from historical utilizations of
multiple VMs of the job. We observed that these
utilization curves are usually misaligned in time,
which would lead to resource over-prediction and hence
over-provisioning. Since this resource utilization
misalignment problem has not been revealed and studied
before, in this paper, we study the VM resource
utilization from public datacenter traces and Hadoop
benchmark jobs to verify the commonness of the
utilization misalignments. Then, to reduce resource
over-provisioning, we propose three VM resource
utilization pattern refinement algorithms to improve
the original generated pattern by lowering the cap of
the pattern, reducing cap provision duration and
varying the minimum value of the pattern. We then
extend these algorithms to further improve the resource
efficiency by considering periodical resource demand
patterns that have multiple pulses in a pattern. These
algorithms can be used in any resource provisioning
strategy that considers predicted resource utilizations
of VMs of a job. We then adopt these refinement
algorithms in an initial VM allocation mechanism and
test them in trace-driven experiments and real-world
testbed experiments. The experimental results show that
each improved mechanism can increase resource
utilization, and reduce the number of PMs needed to
satisfy tenant requests. Also, our extended refinement
algorithms are effective in improving resource
efficiency of the refinement algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:LAD,
author = "Kun Xie and Xiaocan Li and Xin Wang and Jiannong Cao
and Gaogang Xie and Jigang Wen and Dafang Zhang and
Zheng Qin",
title = "On-Line Anomaly Detection With High Accuracy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1222--1235",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2819507",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic anomaly detection is critical for advanced
Internet management. Existing detection algorithms
generally convert the high-dimensional data to a long
vector, which compromises the detection accuracy due to
the loss of spatial information of data. Moreover, they
are generally designed based on the separation of
normal and anomalous data in a time period, which not
only introduces high storage and computation cost but
also prevents timely detection of anomalies. Online and
accurate traffic anomaly detection is critical but
difficult to support. To address the challenge, this
paper directly models the monitoring data in each time
slot as a 2-D matrix, and detects anomalies in the new
time slot based on bilateral principal component
analysis B-PCA. We propose several novel techniques in
OnlineBPCA to support quick and accurate anomaly
detection in real time, including a novel B-PCA-based
anomaly detection principle that jointly considers the
variation of both row and column principal directions
for more accurate anomaly detection, an approximate
algorithm to avoid using iteration procedure to
calculate the principal directions in a close-form, and
a sequential anomaly algorithm to quickly update
principal directions with low computation and storage
cost when receiving a new data matrix at a time slot.
To the best of our knowledge, this is the first work
that exploits 2-D PCA for anomaly detection. We have
conducted extensive simulations to compare our
OnlineBPCA with the state-of-art anomaly detection
algorithms using real traffic traces Abilene and
G{\`E}ANT. Our simulation results demonstrate that,
compared with other algorithms, our OnlineBPCA can
achieve significantly better detection performance with
low false positive rate, high true positive rate, and
low computation cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2018:PPC,
author = "Xiaocong Jin and Yanchao Zhang",
title = "Privacy-Preserving Crowdsourced Spectrum Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1236--1249",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2823272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Dynamic spectrum access is promising for mitigating
worldwide wireless spectrum shortage. Crowdsourced
spectrum sensing CSS refers to recruiting ubiquitous
mobile users to perform real-time spectrum sensing at
specified locations and has great potential in
mitigating the drawbacks of current spectrum database
operations. Without strong incentives and location
privacy protection in place, however, mobile users will
be reluctant to act as mobile crowdsourcing workers for
spectrum-sensing tasks. In this paper, we first
formulate participant selection in CSS systems as a
reverse auction problem, in which each participant's
true cost for spectrum sensing is closely tied to his
current location. Then, we demonstrate how the location
privacy of CSS participants can be easily breached
under the framework. Finally, we present PriCSS, a
novel framework for a CSS service provider to select
CSS participants in a differentially privacy-preserving
manner. In this framework, we propose PriCSS\minus and
PriCSS+, two different schemes under distinct design
objectives and assumptions. PriCSS\minus is an
approximately truthful scheme that achieves
differential location privacy and an approximate
minimum payment, while PriCSS+ is a truthful scheme
that achieves differential location privacy and an
approximate minimum social cost. The detailed
theoretical analysis and simulation studies are
performed to demonstrate the efficacy of both
schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nagy:2018:NVI,
author = "Mate Nagy and Janos Tapolcai and Gabor Retvari",
title = "Node Virtualization for {IP} Level Resilience",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1250--1263",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2829399",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "For Internet protocol IP to evolve into a true
carrier-grade transport facility, it needs to support
fast resilience out-of-the-box. IP-level failure
protection based on the IP fast reroute/loop-free
alternates LFA specification has become industrial
requirement recently. The success of LFA lies in its
inherent simplicity, but this comes at the expense of
letting certain failure scenarios go unprotected.
Realizing full failure coverage with LFA so far has
only been possible through completely re-engineering
the network around LFA-compliant design patterns. In
this paper, we show that attaining high LFA coverage is
possible without any alteration to the installed IP
infrastructure, by introducing a carefully designed
virtual overlay on top of the physical network that
provides LFAs to otherwise unprotected routers. Our
main contribution is formulating the corresponding
resilient IP overlay design problem and providing
constructions that can achieve full failure coverage
against single link failures by adding at most four
virtual nodes to each physical one. We also show that
the problem of finding the minimal number of virtual
nodes achieving full failure coverage is NP-hard, and
thus propose heuristic algorithms that are guaranteed
to terminate with a fully protected topology in
polynomial time. According to the numerical evaluations
the performance of our algorithm is on par with, or
even better than, that of previous ones, lending itself
as the first practically viable option to build highly
resilient IP networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:DPF,
author = "Yitu Wang and Wei Wang and Ying Cui and Kang G. Shin
and Zhaoyang Zhang",
title = "Distributed Packet Forwarding and Caching Based on
Stochastic Network Utility Maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1264--1277",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2825460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cache-enabled network architecture has great potential
for enhancing the efficiency of content distribution as
well as reducing the network congestion. This, in turn,
has called for joint optimization of traffic
engineering and caching strategies while considering
both network congestion and content demands. In this
paper, we present a distributed framework for joint
request/data forwarding and dynamic cache placement in
cache-enabled networks. Specifically, to retrieve the
information about content demands and network
congestion over the network, we establish a dual queue
system for both requests and data, and define a dynamic
mapping between the two queues with the help of dummy
data such that the nodes can determine packet
forwarding and caching strategies based only on local
information. As the local objective function associated
with Lyapunov optimization is time-varying due to the
stochastic evolution of request/data queues, we develop
a low-complexity distributed forwarding and caching
algorithm via stochastic network utility maximization.
We also prove the proposed algorithm achieves queue
stability, and derive its region stability property for
time-varying local optimization to demonstrate the
convergence behavior. The simulation results verify
queue stability and shows the proposed algorithm
outperforms the existing ones.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2018:SLB,
author = "Dongxiao Yu and Yifei Zou and Jiguo Yu and Xiuzhen
Cheng and Qiang-Sheng Hua and Hai Jin and Francis C. M.
Lau",
title = "Stable Local Broadcast in Multihop Wireless Networks
Under {SINR}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1278--1291",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2829712",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a distributed stable protocol for local
broadcast in multi-hop wireless networks, where packets
are injected to the nodes continuously, and each node
needs to quickly disseminate the injected packets to
all its neighbors within a given communication range
$R$. We investigate the maximum packet injection rate
and the minimum packet latency that can be achieved in
a stable protocol. This paper assumes the
signal-to-interference-plus-noise-ratio SINR
interference model, which reflects more accurately the
physical characteristics of the wireless interference,
such as fading and signal accumulation, than
conventional local interference models, e.g.,
graph-based models. More specifically, we present a
stable protocol that can handle both stochastic and
adversarial injection patterns. The protocol is
asymptotically optimal in terms of both injection rate
and packet latency. To the best of our knowledge, this
paper is the first one studying the properties of
stable protocols for the basic primitive of local
broadcast in a multi-hop setting under SINR. Our
proposed protocol utilizes a static local broadcast
algorithm as a subroutine. This static algorithm is of
independent interest, and it closes the $ O \log n$ gap
between the upper and lower bounds for static local
broadcast. Simulation results indicate that our
proposed algorithms can perform well in realistic
environments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiesa:2018:ORI,
author = "Marco Chiesa and Gabor Retvari and Michael Schapira",
title = "Oblivious Routing in {IP} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1292--1305",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2832020",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To optimize the flow of traffic in IP networks,
operators do traffic engineering TE, i.e., tune
routing-protocol parameters in response to traffic
demands. TE in IP networks typically involves
configuring static link weights and splitting traffic
between the resulting shortest-paths via the
equal-cost-multipath ECMP mechanism. Unfortunately,
ECMP is a notoriously cumbersome and indirect means for
optimizing traffic flow, often leading to poor network
performance. Also, obtaining accurate knowledge of
traffic demands as the input to TE is a non-trivial
task that may require additional monitoring
infrastructure, and traffic conditions can be highly
variable, further complicating TE. We leverage recently
proposed schemes for increasing ECMP's expressiveness
via carefully disseminated bogus information lies to
design COYOTE, a readily deployable TE scheme for
robust and efficient network utilization. COYOTE
leverages new algorithmic ideas to configure static
traffic splitting ratios that are optimized with
respect to all even adversarial traffic scenarios
within the operator's ``uncertainty bounds''. Our
experimental analyses show that COYOTE significantly
outperforms today's prevalent TE schemes in a manner
that is robust to traffic uncertainty and variation. We
discuss experiments with a prototype implementation of
COYOTE.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gulcu:2018:AVP,
author = "Talha Cihad Gulcu and Vaggos Chatziafratis and Yingrui
Zhang and Osman Yagan",
title = "Attack Vulnerability of Power Systems Under an Equal
Load Redistribution Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1306--1319",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2823325",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the vulnerability of flow networks
against adversarial attacks. In particular, consider a
power system or, any system carrying a physical flow
consisting of $N$ transmission lines with initial loads
$ L_1, \ldots, L_N$ and capacities $ C_1, \ldots, C_N$,
respectively; the capacity $ C_i$ defines the maximum
flow allowed on line $i$. Under an equal load
redistribution model, where load of failed lines is
redistributed equally among all remaining lines, we
study the optimization problem of finding the best $k$
lines to attack so as to minimize the number of alive
lines at the steady-state i.e., when cascades stop.
This is done to reveal the worst-case attack
vulnerability of the system as well as to reveal its
most vulnerable lines. We derive optimal attack
strategies in several special cases of load-capacity
distributions that are practically relevant. We then
consider a modified optimization problem where the
adversary is also constrained by the total load in
addition to the number of the initial attack set, and
prove that this problem is NP-hard. Finally, we develop
heuristic algorithms for selecting the attack set for
both the original and modified problems. Through
extensive simulations, we show that these heuristics
outperform benchmark algorithms under a wide range of
settings.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huin:2018:ONS,
author = "Nicolas Huin and Brigitte Jaumard and Frederic
Giroire",
title = "Optimal Network Service Chain Provisioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1320--1333",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2833815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Service chains consist of a set of network services,
such as firewalls or application delivery controllers,
which are interconnected through a network to support
various applications. While it is not a new concept,
there has been an extremely important new trend with
the rise of software-defined network SDN and Network
Function Virtualization NFV. The combination of SDN and
NFV can make the service chain and application
provisioning process much shorter and simpler. In this
paper, we study the provisioning of service chains
jointly with the number/location of virtual network
functions VNFs. While chains are often built to support
multiple applications, the question arises as how to
plan the provisioning of service chains in order to
avoid data passing through unnecessary network devices
or servers and consuming extra bandwidth and CPU
cycles. It requires choosing carefully the number and
the location of the VNFs. We propose an exact
mathematical model using decomposition methods whose
solution is scalable in order to conduct such an
investigation. We conduct extensive numerical
experiments, and show we can solve exactly the routing
of service chain requests in a few minutes for networks
with up to 50 nodes, and traffic requests between all
pairs of nodes. Detailed analysis is then made on the
best compromise between minimizing the bandwidth
requirement and minimizing the number of VNFs and
optimizing their locations using different data sets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{KlosneeMuller:2018:CAH,
author = "Sabrina {Klos nee Muller} and Cem Tekin and Mihaela
van der Schaar and Anja Klein",
title = "Context-Aware Hierarchical Online Learning for
Performance Maximization in Mobile Crowdsourcing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1334--1347",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2828415",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In mobile crowdsourcing MCS, mobile users accomplish
outsourced human intelligence tasks. MCS requires an
appropriate task assignment strategy, since different
workers may have different performance in terms of
acceptance rate and quality. Task assignment is
challenging, since a worker's performance 1 may
fluctuate, depending on both the worker's current
personal context and the task context and 2 is not
known a priori, but has to be learned over time.
Moreover, learning context-specific worker performance
requires access to context information, which may not
be available at a central entity due to communication
overhead or privacy concerns. In addition, evaluating
worker performance might require costly quality
assessments. In this paper, we propose a context-aware
hierarchical online learning algorithm addressing the
problem of performance maximization in MCS. In our
algorithm, a local controller LC in the mobile device
of a worker regularly observes the worker's context,
her/his decisions to accept or decline tasks and the
quality in completing tasks. Based on these
observations, the LC regularly estimates the worker's
context-specific performance. The mobile crowdsourcing
platform MCSP then selects workers based on performance
estimates received from the LCs. This hierarchical
approach enables the LCs to learn context-specific
worker performance and it enables the MCSP to select
suitable workers. In addition, our algorithm preserves
worker context locally, and it keeps the number of
required quality assessments low. We prove that our
algorithm converges to the optimal task assignment
strategy. Moreover, the algorithm outperforms simpler
task assignment strategies in experiments based on
synthetic and real data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2018:CCV,
author = "Haiying Shen and Liuhua Chen",
title = "{CompVM}: a Complementary {VM} Allocation Mechanism
for Cloud Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1348--1361",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2822627",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cloud datacenters, effective resource provisioning
is needed to maximize the energy efficiency and
utilization of cloud resources while guaranteeing the
service-level agreement SLA for tenants. To address
this need, we propose an initial virtual machine VM
allocation mechanism called CompVM that consolidates
complementary VMs with spatial/ temporal awareness.
Complementary VMs are the VMs whose total demand of
each resource dimension in the spatial space nearly
reaches their host's capacity during VM lifetime period
in the temporal space. Based on our observation of the
existence of VM resource utilization patterns, the
mechanism predicts the resource utilization patterns of
VMs. Based on the predicted patterns, it coordinates
the requirements of different resources and
consolidates complementary VMs in the same physical
machine PM. This mechanism reduces the number of PMs
needed to provide VM service, hence increases energy
efficiency and resource utilization, and also reduces
the number of VM migrations and SLA violations. We
further propose a utilization variation-based
mechanism, a correlation coefficient-based mechanism,
and a VM group-based mechanism to match the
complementary VMs in order to enhance the VM
consolidation performance. Simulation based on two real
traces and real-world testbed experiments shows that
CompVM significantly reduces the number of PMs used,
SLA violations, and VM migrations of the previous
resource provisioning strategies. The results also show
the effectiveness of the enhancement mechanisms in
improving the performance of the basic CompVM.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2018:ASP,
author = "Xingliang Yuan and Huayi Duan and Cong Wang",
title = "Assuring String Pattern Matching in Outsourced
Middleboxes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1362--1375",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2822837",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Modern enterprise networks heavily rely on the
ubiquitous network middleboxes for advanced traffic
processing functions. Recent advances in software
packet processing and virtualization technologies are
further pushing forward the paradigm of migrating
middleboxes to third-party providers, e.g., clouds and
ISPs, as virtualized services, with well-understood
benefits on reduced maintenance cost and increased
service scalability. Despite promising, outsourcing
middleboxes raises new security challenges. Among
others, this new service eliminates the enterprise's
direct control on outsourced network functions.
Mechanisms assuring that those middleboxes consistently
perform network functions as intended currently do not
exist. In this paper, we propose the first practical
system that enables runtime execution assurances of
outsourced middleboxes with high confidence, helping
enterprises to extend their visibility into untrusted
service providers. As an initial effort, we target on
pattern matching-based network functions, which cover a
broad class of middlebox applications, such as
instruction detection, Web firewall, and traffic
classification. Our design follows the roadmap of
probabilistic checking mechanisms that provide a
tunable level of assurance, as in cloud and distributed
computing literature. We show how to synthesize this
design intuition in the context of outsourced
middleboxes and the dynamic network effect.
Specifically, we present diligent technical
instantiations in the cases of the single middlebox and
the composition i.e., service chaining. We deploy our
designs into off-the-shelf middlebox outsourcing
architectures with full-fledged implementation on the
click modular router. Evaluations demonstrate that high
assurance levels are achieved by pre-processing only a
few packets with marginal overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:FFM,
author = "Guo Chen and Yuanwei Lu and Yuan Meng and Bojie Li and
Kun Tan and Dan Pei and Peng Cheng and Layong Luo and
Yongqiang Xiong and Xiaoliang Wang and Youjian Zhao",
title = "{FUSO}: Fast Multi-Path Loss Recovery for Data Center
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1376--1389",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2830414",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To achieve low TCP flow completion time FCT in data
center networks DCNs, it is critical and challenging to
rapidly recover loss without adding extra congestion.
Therefore, in this paper, we propose a novel loss
recovery approach fast multi-path loss recovery FUSO
that exploits multi-path diversity in DCN for transport
loss recovery. In FUSO, when a multi-path transport
sender suspects loss on one sub-flow, recovery packets
are immediately sent over another sub-flow that is not
or less lossy and has spare congestion window slots.
FUSO is fast in that it does not need to wait for
timeout on the lossy sub-flow, and it is cautious in
that it does not violate the congestion control
algorithm. Testbed experiments and simulations show
that FUSO decreases the latency-sensitive flows' $
99^{th} $ percentile FCT by up to $ \approx $82.3\% in
a 1-Gb/s testbed, and up to $ \approx $87.9\% in a 10
Gb/s large-scale simulated network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gallardo:2018:SAC,
author = "Guillaume Artero Gallardo and Gentian Jakllari and
Lucile Canourgues and Andre-Luc Beylot",
title = "Statistical Admission Control in Multi-Hop Cognitive
Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1390--1403",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2830122",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the problem of online admission control in
multi-hop, multi-transceiver cognitive radio networks
where the channel access is regulated by a bare-bones
time-division multiple access protocol and the primary
user activity is modeled as an ON/OFF process. We show
that the problem of computing the available end-to-end
bandwidth--necessary for admission control--is
NP-Complete. Rather than working on an approximation
algorithm and analyzing its worst-case performance, we
relax the problem of online admission control by using
a randomized scheduling algorithm and analyzing its
average performance. Randomized scheduling is widely
used because of its simplicity and efficiency. However,
computing the resulting average throughput is
challenging and remains an open problem. We solve this
problem analytically and use the solution as vehicle
for BRAND--a centralized heuristic for computing the
average bandwidth available with randomized scheduling
between a source destination pair in cognitive radio
networks. Driven by practical considerations, we
introduce a distributed version of BRAND and prove its
correctness. An extensive numerical analysis
demonstrates the accuracy of BRAND and its enabling
value in performing admission control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sipos:2018:NAF,
author = "Marton Sipos and Josh Gahm and Narayan Venkat and Dave
Oran",
title = "Network-Aware Feasible Repairs for Erasure-Coded
Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1404--1417",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2830800",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A significant amount of research on using erasure
coding for distributed storage has focused on reducing
the amount of data that needs to be transferred to
replace failed nodes. This continues to be an active
topic as the introduction of faster storage devices
looks to put an even greater strain on the network.
However, with a few notable exceptions, most published
work assumes a flat, static network topology between
the nodes of the system. We propose a general framework
to find the lowest cost feasible repairs in a more
realistic, heterogeneous and dynamic network, and
examine how the number of repair strategies to consider
can be reduced for three distinct erasure codes. We
devote a significant part of the paper to determining
the set of feasible repairs for random linear network
coding RLNC and describe a system of efficient checks
using techniques from the arsenal of dynamic
programming. Our solution involves decomposing the
problem into smaller steps, memorizing, and then
reusing intermediate results. All computationally
intensive operations are performed prior to the failure
of a node to ensure that the repair can start with
minimal delay, based on up-to-date network information.
We show that all three codes benefit from being network
aware and find that the extra computations required for
RLNC can be reduced to a viable level for a wide range
of parameter values.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2018:NMM,
author = "Tao Zhao and Korok Ray and I-Hong Hou",
title = "A Non-Monetary Mechanism for Optimal Rate Control
Through Efficient Cost Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1418--1431",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2826457",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a practical non-monetary mechanism
that induces the efficient solution to the optimal rate
control problem, where each client optimizes its
request arrival rate to maximize its own net utility
individually, and at the Nash Equilibrium the total net
utility of the system is also maximized. Existing
mechanisms typically rely on monetary exchange which
requires additional infrastructure that is not always
available. Instead, the proposed mechanism is based on
efficient cost allocation, where the cost is in terms
of non-monetary metric, such as average delay or
request loss rate. Specifically, we present an
efficient cost allocation rule for the server to
determine the target cost of each client. We then
propose an intelligent policy for the server to control
the costs of the clients to achieve the efficient
allocation. Furthermore, we design a distributed rate
control protocol with provable convergence to the Nash
Equilibrium of the system. The effectiveness of our
mechanism is extensively evaluated via simulations of
both delay allocation and loss rate allocation against
baseline mechanisms with classic control policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2018:YRM,
author = "Fan Wu and Tong Meng and Aijing Li and Guihai Chen and
Nitin H. Vaidya",
title = "Have You Recorded My Voice: Toward Robust Neighbor
Discovery in Mobile Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1432--1445",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2824848",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The surge of proximity-based applications on mobile
devices has promoted the need for effective neighbor
discovery protocols in mobile wireless networks. In
contrast to existing works, which can achieve energy
efficient neighbor discovery with bounded latency only
in the scenario without strong interference, we aim at
designing techniques for practical and robust neighbor
discovery. We propose ReCorder to achieve robust
neighbor discovery in mobile wireless networks despite
the ``noisy'' communication media. Specifically, we
exploit the cross-correlation property of pseudo-random
sequences to eliminate the necessity of beacon decoding
in existing neighbor discovery protocols. In ReCorder,
a neighbor discovery message can be detected through
cross-correlation on an RCover preamble, and contains a
ReCord identity signature, which is unique for each of
the nodes. We also design algorithms for RCover
detection and ReCord recognization. The performance of
the ReCorder has been evaluated using the USRP-N210
testbed. Our evaluation results show that the ReCorder
can achieve robust neighbor discovery at an SINR lower
than the existing beaconing and decoding-based neighbor
discovery protocols by almost 10 dB. Furthermore, the
ReCorder can avoid degrading the decoding of background
IEEE 802.11 a/g transmissions with BPSK modulation,
which is important for its co-existence with concurrent
wireless streams, and it only induces limited
throughput degradation to background data flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tu:2018:NPB,
author = "Zhen Tu and Fengli Xu and Yong Li and Pengyu Zhang and
Depeng Jin",
title = "A New Privacy Breach: User Trajectory Recovery From
Aggregated Mobility Data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1446--1459",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2829173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Human mobility data have been ubiquitously collected
through cellular networks and mobile applications, and
publicly released for academic research and commercial
purposes for the last decade. Since releasing
individual's mobility records usually gives rise to
privacy issues, data sets owners tend to only publish
aggregated mobility data, such as the number of users
covered by a cellular tower at a specific timestamp,
which is believed to be sufficient for preserving
users' privacy. However, in this paper, we argue and
prove that even publishing aggregated mobility data
could lead to privacy breach in individuals'
trajectories. We develop an attack system that is able
to exploit the uniqueness and regularity of human
mobility to recover individual's trajectories from the
aggregated mobility data without any prior knowledge.
By conducting experiments on two real-world data sets
collected from both the mobile application and cellular
network, we reveal that the attack system is able to
recover users' trajectories with an accuracy of about
73\%--91\% at the scale of thousands to ten thousands
of mobile users, which indicates severe privacy leakage
in such data sets. Our extensive analysis also reveals
that by generalization and perturbation, this kind of
privacy leakage can only be mitigated. Through the
investigation on aggregated mobility data, this paper
recognizes a novel privacy problem in publishing
statistic data, which appeals for immediate attentions
from both the academy and industry.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2018:TBP,
author = "Huikang Li and Yi Gao and Wei Dong and Chun Chen",
title = "Taming Both Predictable and Unpredictable Link
Failures for Network Tomography",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1460--1473",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2834141",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Calculating fine-grained link metrics by using
aggregated path measurements, known as network
tomography, is an effective and efficient way to
facilitate various network operations, such as network
monitoring, load balancing, and fault diagnosis.
Recently, there is a growing interest in the monitor
placement problem that ensures link identifiability in
a network with link failures. Unfortunately, existing
work either assumes an ideal failure prediction model
where all failures can be predicted perfectly or makes
pessimistic assumptions that all failures are
unpredictable. In this paper, we study the problem of
placing a minimum number of monitors to identify
additive link metrics [or additive by using the log$
\cdot $ function, e.g., loss rates] from end-to-end
measurements among monitors with considering both
predictable and unpredictable link failures. We propose
a set of robust monitor placement algorithms with
different performance-complexity tradeoffs to solve
this tomography problem. In particular, we show that
the optimal i.e., minimum monitor placement is the
solution to a hitting set problem, for which, we
provide a polynomial-time algorithm to construct the
input. We formally prove that the proposed algorithms
can guarantee network identifiability against failures
based on the graph theory. Trace-driven evaluation
results show the effectiveness and the robustness of
our algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{ElAzzouni:2018:NBD,
author = "Sherif ElAzzouni and Eylem Ekici",
title = "Node-Based Distributed Channel Access With Enhanced
Delay Characteristics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1474--1487",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2834302",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent studies in wireless scheduling have shown that
carrier-sense multiple access CSMA can be made
throughput optimal by optimizing over activation rates.
However, those throughput optimal CSMA algorithms were
found to suffer from poor delay performance, especially
at high throughputs where the delay can potentially
grow exponentially in the size of the network.
Motivated by these shortcomings, in this paper we
propose a node-based version of the throughput optimal
CSMA NB-CSMA as opposed to traditional link-based CSMA
algorithms, where links were treated as separate
entities. Our algorithm is fully distributed and
corresponds to Glauber dynamics with ``Block updates''.
We show analytically and via simulations that NB-CSMA
outperforms conventional link-based CSMA in terms of
delay for any fixed-size network. We also characterize
the fraction of the capacity region for which the
average queue lengths and the average delay grow
polynomially in the size of the network, for networks
with bounded-degree conflict graphs. This fraction is
no smaller than the fraction known for link-based CSMA,
and is significantly larger for many instances of
practical wireless ad-hoc networks. Finally, we
restrict our focus to the special case of collocated
networks, analyze the mean starvation time using a
Markov chain with rewards framework and use the results
to quantitatively demonstrate the improvement of
NB-CSMA over the baseline link-based algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tian:2018:OED,
author = "Chen Tian and Ali Munir and Alex X. Liu and Jie Yang
and Yangming Zhao",
title = "{OpenFunction}: an Extensible Data Plane Abstraction
Protocol for Platform-Independent Software-Defined
Middleboxes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1488--1501",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2829882",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The data plane abstraction is central to
software-defined networking SDN. Currently, SDN data
plane abstraction has only been realized for switches
but not for middleboxes. A data plane abstraction for
middleboxes is needed to realize the vision of
software-defined middleboxes SDMs. Such a data plane
abstraction should be both platform independent and
fully extensible. The match-action abstractions in
OpenFlow/P4 have limited expression power to be
applicable to middleboxes. Modular abstraction
approaches have been proposed to implement middlebox
data plane but are not fully extensible in a
platform-independent manner. In this paper, we propose
OpenFunction, an extensible data plane abstraction
protocol for platform-independent software-defined
middleboxes. The main challenge is how to abstract
packet operations, flow states, and event generations
with elements. The key decision of OpenFunction is:
actions/states/events operations should be defined in a
uniform pattern and independent from each other. We
implemented a working SDM system including one
OpenFunction controller and three OpenFunction boxes
based on Netmap, DPDK, and FPGA, respectively, to
verify OpenFunction abstraction.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lorenzo:2018:DST,
author = "Beatriz Lorenzo and Alireza Shams Shafigh and Jianqing
Liu and Francisco J. Gonzalez-Castano and Yuguang
Fang",
title = "Data and Spectrum Trading Policies in a Trusted
Cognitive Dynamic Network Architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1502--1516",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2828460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Future wireless networks will progressively displace
service provisioning towards the edge to accommodate
increasing growth in traffic. This paradigm shift calls
for smart policies to efficiently share network
resources and ensure service delivery. In this paper,
we consider a cognitive dynamic network architecture
CDNA where primary users PUs are rewarded for sharing
their connectivities and acting as access points for
secondary users SUs. CDNA creates opportunities for
capacity increase by network-wide harvesting of unused
data plans and spectrum from different operators.
Different policies for data and spectrum trading are
presented based on centralized, hybrid, and distributed
schemes involving primary operator PO, secondary
operator SO, and their respective end users. In these
schemes, PO and SO progressively delegate trading to
their end users and adopt more flexible cooperation
agreements to reduce computational time and track
available resources dynamically. A novel
matching-with-pricing algorithm is presented to enable
self-organized SU-PU associations, channel allocation
and pricing for data and spectrum with low
computational complexity. Since connectivity is
provided by the actual users, the success of the
underlying collaborative market relies on the
trustworthiness of the connections. A behavioral-based
access control mechanism is developed to
incentivize/penalize honest/dishonest behavior and
create a trusted collaborative network. Numerical
results show that the computational time of the hybrid
scheme is one order of magnitude faster than the
benchmark centralized scheme and that the matching
algorithm reconfigures the network up to three orders
of magnitude faster than in the centralized scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2018:ELS,
author = "Kaikai Liu and Xiaolin Li",
title = "Enhancing Localization Scalability and Accuracy via
Opportunistic Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1517--1530",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2838052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Using a mobile phone for fine-grained indoor
localization remains an open problem. Low-complexity
approaches without infrastructure have not achieved
accurate and reliable results due to various
restrictions. Existing accurate solutions rely on dense
anchor nodes for infrastructure and are therefore
inconvenient and cumbersome. The problem of beacon
signal blockage further reduces the effective coverage.
In this paper, we investigate the problems associated
with improving localization scalability and accuracy of
a mobile phone via opportunistic anchor sensing, a new
sensing paradigm which leverages opportunistically
connected anchors. One key motivation is that the
scalability of the infrastructure-based localization
system can be improved by lifting the minimum
requirement for anchor numbers or constellations in
trilateration. At the same time, location accuracy
under insufficient anchor coverage will be improved by
exploring the opportunity of diverse data types rather
than deploying more anchor nodes. To enable this highly
scalable and accurate design, we leverage low-coupling
hybrid ranging using our low-cost anchor nodes with
centimeter-level relative distance estimation. Activity
patterns extracted in users' smartphones are utilized
for displacement compensation and direction estimation.
The system also scales to finer location resolution
when anchor access is improved. We introduce robust
delay-constraint semidefinite programming in location
estimation to realize optimized system scalability and
resolution flexibility. We conduct extensive
experiments in various scenarios. Compared with
existing approaches, opportunistic sensing could
improve the location accuracy and scalability, as well
as robustness, under various anchor accessibilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiao:2018:CSO,
author = "Lei Jiao and Antonia Maria Tulino and Jaime Llorca and
Yue Jin and Alessandra Sala",
title = "Corrections to {``Smoothed Online Resource Allocation
in Multi-Tier Distributed Cloud Networks''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "3",
pages = "1531--1531",
month = jun,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2830518",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Jiao:2017:SOR}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shan:2018:EMM,
author = "Danfeng Shan and Fengyuan Ren",
title = "{ECN} Marking With Micro-Burst Traffic: Problem,
Analysis, and Improvement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1533--1546",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2840722",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In data centers, batching schemes in end hosts can
introduce micro-burst traffic into the network. The
packet dropping caused by micro-bursts usually leads to
severe performance degradations. Therefore, much
attention has been paid to avoiding buffer overflow
caused by micro-burst traffic. In particular, ECN is
widely used in data centers to keep persistent queue
occupancy low, so that enough buffer space can be
available as headroom to absorb micro-burst traffic.
However, we find that current
instantaneous-queue-length-based ECN marking scheme may
cause problems in another direction --- buffer
underflow. Specifically, current ECN marking scheme in
data centers is easy to trigger spurious congestion
signals, which may result in the overreaction of
senders and queue length oscillations in switches.
Since ECN threshold is low, the buffer may underflow
and link capacity is not fully used. In this paper, we
reveal this problem by experiments. Besides, we
theoretically deduce the amplitude of queue length
oscillations. The analysis results indicate that the
overreaction of senders is caused by ECN mismarking.
Therefore, we propose combined enqueue and dequeue
marking CEDM, which can mark packets more accurately.
Through test bed experiments and extensive ns-2
simulations, we show that CEDM can significantly reduce
throughput loss and improve the flow completion time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shirali-Shahreza:2018:DIE,
author = "Sajad Shirali-Shahreza and Yashar Ganjali",
title = "Delayed Installation and Expedited Eviction: an
Alternative Approach to Reduce Flow Table Occupancy in
{SDN} Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1547--1561",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2841397",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Limited flow table size in switches is a major concern
for SDN applications. The common approach to overcome
this problem is to identify elephant flows and solely
focus on them. However, there is no gold standard to
assess the effectiveness of such greedy solutions. In
this paper, we formally define this problem by choosing
a cost function hit ratio and an objective function to
optimize the average table occupancy and present the
optimum solution i.e., theoretical gold standard for
it. We model the problem as a knapsack problem, analyze
how its solution minimizes the table occupancy, and the
similarities to and differences from the default idle
timeout mechanism used in OpenFlow. We also present a
new approach to minimize flow table occupancy based on
the insight gained from the knapsack model analysis.
Our solution expedites rule evictions by forecasting
the TCP flow termination from RST/FIN packets and
delays rule installation by incubating non-TCP flows.
It reduces average flow table occupancy between
16\%--62\% in various networks with less than 1.5\%
reduction in hit ratio. Using three real-world packet
traces, we compare the performance of our solution with
the theoretically optimum solution, the static idle
timeout approach used in current OpenFlow systems, and
heavy hitter detection approaches that are commonly
used to solve this problem. We provide in-depth
analysis of when and where our approach outperforms
other solutions, while discussing why it might be
better to use rate-based heavy hitter detection in some
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kuo:2018:DCV,
author = "Tung-Wei Kuo and Bang-Heng Liou and Kate Ching-Ju Lin
and Ming-Jer Tsai",
title = "Deploying Chains of Virtual Network Functions: On the
Relation Between Link and Server Usage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1562--1576",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2842798",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Recently, network function virtualization has been
proposed to transform from network hardware appliances
to software middleboxes. Normally, a demand needs to
invoke several virtual network functions VNFs following
the order determined by the service chain along a
routing path. In this paper, we study the joint problem
of the VNF placement and path selection to better
utilize the network. We discover that the relation
between the link and server usage plays a crucial role
in the problem. Inspired by stress testing, we first
propose a systematic way to elastically tune the link
and server usage of each demand based on the network
status and properties of demands. In particular, we
compute a proper routing path length, and decide, for
each VNF in the service chain, whether to use
additional server resources or to reuse resources
provided by existing servers. We then propose a chain
deployment algorithm that follows the guidance of this
link and server usage. Via simulations, we show that
our design effectively adapts resource allocation to
network dynamics and, hence, serves more demands 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{Destounis:2018:MCS,
author = "Apostolos Destounis and Stefano Paris and Lorenzo
Maggi and Georgios S. Paschos and Jeremie Leguay",
title = "Minimum Cost {SDN} Routing With Reconfiguration
Frequency Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1577--1590",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2845463",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-defined network SDN controllers include
mechanisms to globally reconfigure the network in order
to respond to a changing environment. As demands arrive
or leave the system, the globally optimum flow
configuration changes over time. Although the optimum
configuration can be computed with standard iterative
methods, convergence may be slower than system
variations, and hence it may be preferable to interrupt
the solver and restart. In this paper, we focus on the
class of iterative solvers with an exponential decrease
over time in the optimality gap. Assuming dynamic
arrivals and departures of demands, the computed
optimality gap at each iteration $ Q t $ is described
by an auto-regressive stochastic process. At each time
slot, the controller may choose to: 1 stop the
iterative solver and apply the best found configuration
to the network or 2 allow the solver to continue the
iterations keeping the network in its suboptimal form.
Choice 1 reduces the optimality gap leading to smaller
routing costs but requires flow reconfiguration which
hurts QoS and system stability. To limit the negative
impact of reconfigurations, we propose two control
policies that minimize the time-average routing cost
while respecting a network reconfiguration budget. We
experiment with realistic network settings using
standard linear programming tools from SDN industry. In
the experiments conducted over the GEANT networks and
fat tree networks, our policies provide a practical
means of keeping the routing cost small within a given
reconfiguration constraint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ma:2018:CUM,
author = "Yu Ma and Weifa Liang and Wenzheng Xu",
title = "Charging Utility Maximization in Wireless Rechargeable
Sensor Networks by Charging Multiple Sensors
Simultaneously",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1591--1604",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2841420",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless energy charging has been regarded as a
promising technology for prolonging sensor lifetime in
wireless rechargeable sensor networks WRSNs. Most
existing studies focused on one-to-one charging between
a mobile charger and a sensor that suffers charging
scalability and efficiency issues. A new charging
technique --- one-to-many charging scheme that allows
multiple sensors to be charged simultaneously by a
single charger can well address the issues. In this
paper, we investigate the use of a mobile charger to
charge multiple sensors simultaneously in WRSNs under
the energy capacity constraint on the mobile charger.
We aim to minimize the sensor energy expiration time by
formulating a novel charging utility maximization
problem, where the amount of utility gain by charging a
sensor is proportional to the amount of energy received
by the sensor. We also consider the charging tour
length minimization problem of minimizing the travel
distance of the mobile charger if all requested sensors
must be charged, assuming that the mobile charger has
sufficient energy to support all requested sensor
charging and itself travelling. Specifically, in this
paper, we first devise an approximation algorithm with
a constant approximation ratio for the charging utility
maximization problem if the energy consumption of the
mobile charger on its charging tour is negligible.
Otherwise, we develop an efficient heuristic for it
through a non-trivial reduction from a
length-constrained utility maximization problem. We
then, devise the very first approximation algorithm
with a constant approximation ratio for the charging
tour length minimization problem through exploiting the
combinatorial property of the problem. We finally
evaluate the performance of the proposed algorithms
through experimental simulations. Simulation results
demonstrate that the proposed algorithms are promising,
and outperform the other heuristics 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{Yu:2018:NBA,
author = "Hao Yu and Michael J. Neely",
title = "A New Backpressure Algorithm for Joint Rate Control
and Routing With Vanishing Utility Optimality Gaps and
Finite Queue Lengths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1605--1618",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2844284",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The backpressure algorithm has been widely used as a
distributed solution to the problem of joint rate
control and routing in multi-hop data networks. By
controlling an algorithm parameter, the backpressure
algorithm can achieve an arbitrarily small utility
optimality gap. However, this in turn brings in a large
queue length at each node and hence causes large
network delay. This phenomenon is known as the
fundamental utility-delay tradeoff. The best known
utility-delay tradeoff for general networks is $ [O
\epsilon, O1 / \epsilon] $ and is attained by a
backpressure algorithm based on a drift-plus-penalty
technique. This may suggest that to achieve an
arbitrarily small utility optimality gap,
backpressure-based algorithms must incur arbitrarily
large queue lengths. However, this paper proposes a new
backpressure algorithm that has a vanishing utility
optimality gap, so utility converges to exact
optimality as the algorithm keeps running, while queue
lengths are bounded throughout by a finite constant.
The technique uses backpressure and drift concepts with
a new method for convex programming.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:CPO,
author = "Lixing Chen and Sheng Zhou and Jie Xu",
title = "Computation Peer Offloading for Energy-Constrained
Mobile Edge Computing in Small-Cell Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1619--1632",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2841758",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The ultra-dense deployment of small-cell base stations
SBSs endowed with cloud-like computing functionalities
paves the way for pervasive mobile edge computing,
enabling ultra-low latency and location-awareness for a
variety of emerging mobile applications and the
Internet of Things. To handle spatially uneven
computation workloads in the network, cooperation among
SBSs via workload peer offloading is essential to avoid
large computation latency at overloaded SBSs and
provide high quality of service to end users. However,
performing effective peer offloading faces many unique
challenges due to limited energy resources committed by
self-interested SBS owners, uncertainties in the system
dynamics, and co-provisioning of radio access and
computing services. This paper develops a novel online
SBS peer offloading framework, called online peer
offloading OPEN, by leveraging the Lyapunov technique,
in order to maximize the long-term system performance
while keeping the energy consumption of SBSs below
individual long-term constraints. OPEN works online
without requiring information about future system
dynamics, yet provides provably near-optimal
performance compared with the oracle solution that has
the complete future information. In addition, this
paper formulates a peer offloading game among SBSs and
analyzes its equilibrium and efficiency loss in terms
of the price of anarchy to thoroughly understand SBSs'
strategic behaviors, thereby enabling decentralized and
autonomous peer offloading decision making. Extensive
simulations are carried out and show that peer
offloading among SBSs dramatically improves the edge
computing performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Elgabli:2018:LRR,
author = "Anis Elgabli and Vaneet Aggarwal and Shuai Hao and
Feng Qian and Subhabrata Sen",
title = "{LBP}: Robust Rate Adaptation Algorithm for {SVC}
Video Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1633--1645",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2844123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video streaming today accounts for up to 55\% of
mobile traffic. In this paper, we explore streaming
videos encoded using scalable video coding SVC scheme
over highly variable bandwidth conditions, such as
cellular networks. SVC's unique encoding scheme allows
the quality of a video chunk to change incrementally,
making it more flexible and adaptive to challenging
network conditions compared to other encoding schemes.
Our contribution is threefold. First, we formulate the
quality decisions of video chunks constrained by the
available bandwidth, the playback buffer, and the chunk
deadlines as an optimization problem. The objective is
to optimize a novel quality-of-experience metric that
models a combination of the three objectives of
minimizing the stall/skip duration of the video,
maximizing the playback quality of every chunk, and
minimizing the number of quality switches. Second, we
develop layered bin packing LBP adaptation algorithm, a
novel algorithm that solves the proposed optimization
problem. Moreover, we show that LBP achieves the
optimal solution of the proposed optimization problem
with linear complexity in the number of video chunks.
Third, we propose an online algorithm online LBP where
several challenges are addressed, including handling
bandwidth prediction errors and short prediction
duration. Extensive simulations with real bandwidth
traces of public datasets reveal the robustness of our
scheme and demonstrate its significant performance
improvement as compared with the state-of-the-art SVC
streaming algorithms. The proposed algorithm is also
implemented on a TCP/IP emulation test bed with real
LTE bandwidth traces, and the emulation confirms the
simulation results and validates that the algorithm can
be implemented and deployed on today's mobile
devices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Weng:2018:RCA,
author = "Jianping Weng and Jessie Hui Wang and Jiahai Yang and
Yang",
title = "Root Cause Analysis of Anomalies of Multitier Services
in Public Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1646--1659",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2843805",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Anomalies of multitier services of one tenant running
in cloud platform can be caused by the tenant's own
components or performance interference from other
tenants. If the performance of a multitier service
degrades, we need to find out the root causes precisely
to recover the service as soon as possible. In this
paper, we argue that the cloud providers are in a
better position than the tenants to solve this problem,
and the solution should be non-intrusive to tenants'
services or applications. Based on these two
considerations, we propose a solution for cloud
providers to help tenants to localize root causes of
any anomaly. With the help of our solution, cloud
operators can find out root causes of any anomaly no
matter the root causes are in the same tenant as the
anomaly or from other tenants. Particularly, we
elaborate a non-intrusive method to capture the
dependency relationships of components, which improves
the feasibility. During localization, we exploit
measurement data of both application layer and underlay
infrastructure, and our two-step localization algorithm
also includes a random walk procedure to model anomaly
propagation probability. These techniques improve the
accuracy of our root causes localization. Our
small-scale real-world experiments and large-scale
simulation experiments show a 15\%--71\% improvement in
mean average precision compared with the current
methods in different scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qian:2018:HMM,
author = "Jiangbo Qian and Zhipeng Huang and Qiang Zhu and
Huahui Chen",
title = "{Hamming} Metric Multi-Granularity Locality-Sensitive
{Bloom} Filter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1660--1673",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2850536",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A Bloom filter is a type of space-efficient data
structure that supports membership tests in numerous
network applications. Recently, emerging applications
require an approximate membership test AMT rather than
conventional exact-matching membership test. Some AMT
problems can be effectively solved by using a
locality-sensitive hashing LSH based Bloom filter.
However, existing work cannot handle changing Hamming
distances. In this paper, we present a new Hamming
metric locality-sensitive Bloom filter HLBF to tackle
the challenge. Each object of the data set is hashed by
bit sampling LSH functions and encoded into a standard
Bloom filter in the HLBF structure. To support AMTs
with different given Hamming distances, we propose a
multi-granularity test algorithm called the M-HLBF
based on the HLBF and virtual objects which are created
from the given test object. Theoretical analyses show
that false positive rates and false negative rates can
be controlled within low levels. To further accelerate
the processing of an AMT, we also illustrate a hardware
implementation. Extensive experimental results
demonstrate that our method is quite promising in
achieving high efficiency and flexibility for
processing AMTs with different
granularities/distances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shafiee:2018:IBM,
author = "Mehrnoosh Shafiee and Javad Ghaderi",
title = "An Improved Bound for Minimizing the Total Weighted
Completion Time of Coflows in Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1674--1687",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2845852",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In data-parallel computing frameworks, intermediate
parallel data is often produced at various stages which
needs to be transferred among servers in the datacenter
network e.g., the shuffle phase in MapReduce. A stage
often cannot start or be completed unless all the
required data pieces from the preceding stage are
received. Coflow is a recently proposed networking
abstraction to capture such communication patterns. We
consider the problem of efficiently scheduling coflows
with release dates in a shared datacenter network so as
to minimize the total weighted completion time of
coflows. Several heuristics have been proposed recently
to address this problem, as well as a few
polynomial-time approximation algorithms with provable
performance guarantees. Our main result in this paper
is a polynomial-time deterministic algorithm that
improves the prior known results. Specifically, we
propose a deterministic algorithm with approximation
ratio of 5, which improves the prior best known ratio
of 12. For the special case when all coflows are
released at time zero, our deterministic algorithm
obtains approximation ratio of 4 which improves the
prior best known ratio of 8. The key ingredient of our
approach is an improved linear program formulation for
sorting the coflows followed by a simple list
scheduling policy. Extensive simulation results, using
both synthetic and real traffic traces, are presented
that verify the performance of our algorithm and show
improvement over the prior approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:GFA,
author = "Pengjin Xie and Jingchao Feng and Zhichao Cao and
Jiliang Wang",
title = "{GeneWave}: Fast Authentication and Key Agreement on
Commodity Mobile Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1688--1700",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2848262",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Device-to-device communication is widely used for
mobile devices and Internet of Things. Authentication
and key agreement are critical to build a secure
channel between two devices. However, existing
approaches often rely on a pre-built fingerprint
database and suffer from low key generation rate. We
present GeneWave, a fast device authentication and key
agreement protocol for commodity mobile devices.
GeneWave first achieves bidirectional initial
authentication based on the physical response interval
between two devices. To keep the accuracy of interval
estimation, we eliminate time uncertainty on commodity
devices through fast signal detection and redundancy
time cancellation. Then, we derive the initial acoustic
channel response for device authentication. We design a
novel coding scheme for efficient key agreement while
ensuring security. Therefore, two devices can
authenticate each other and securely agree on a
symmetric key. GeneWave requires neither special
hardware nor pre-built fingerprint database, and thus
it is easy-to-use on commercial mobile devices. We
implement GeneWave on mobile devices i.e., Nexus 5X and
Nexus 6P and evaluate its performance through extensive
experiments. Experimental results show that GeneWave
efficiently accomplish secure key agreement on
commodity smartphones with a key generation rate 10$
\times $ faster than the state-of-the-art approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2018:NTL,
author = "Fu Xiao and Lei Chen and Chaoheng Sha and Lijuan Sun
and Ruchuan Wang and Alex X. Liu and Faraz Ahmed",
title = "Noise Tolerant Localization for Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1701--1714",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852754",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Most range-based localization approaches for wireless
sensor networks WSNs rely on accurate and sufficient
range measurements, yet noise and data missing are
inevitable in distance ranging. Existing localization
approaches often suffer from unsatisfied accuracy in
the co-existence of incomplete and corrupted range
measurements. In this paper, we propose LoMaC, a
noise-tolerant localization scheme, to address this
problem. Specifically, we first employ Frobenius-norm
and $ L_1 $ -norm to formulate the reconstruction of
noisy and missing Euclidean distance matrix EDM as a
norm-regularized matrix completion NRMC problem.
Second, we design an efficient algorithm based on
alternating direction method of multiplier to solve the
NRMC problem. Third, based on the completed EDM, we
further employ a multi-dimension scaling method to
localize unknown nodes. Meanwhile, to accelerate our
algorithm, we also adopt some acceleration techniques
to reduce the computation cost. Finally, extensive
experimental results show that our algorithm not only
achieves significantly better localization performance
than prior algorithms but also provides an accurate
position prediction of outlier, which is useful for
malfunction diagnosis 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:2018:SPV,
author = "Qi Li and Yanyu Chen and Patrick P. C. Lee and Mingwei
Xu and Kui Ren",
title = "Security Policy Violations in {SDN} Data Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1715--1727",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2853593",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-defined networking SDN utilizes a centralized
controller to distribute packet processing rules to
network switches. However, rules are often generated by
the applications developed by different organizations,
so they may conflict with each other in data plane and
lead to violations with security rules. The problem is
similar to firewall conflicts in IP networks. Rule
conflict resolution should incur negligible process
delay, such that all rules can be correctly and safely
enforced in the data plane in real time. However, since
SDN allows users to use more than 35 fields to specify
rules including field transition rules, it is much more
complicated to prevent enforcement of SDN rules from
violating with security rules than to resolve firewall
rule violation, and in particular, field transition
rules are enforced. Therefore, it is extremely
difficult to resolve such rule conflicts in real time
before the rules are installed in SDN data plane. In
this paper, we investigate the rule conflict problem in
SDN and identify new covert channel attacks due to rule
conflicts. To the end, we propose the covert channel
defender CCD that prevents covert channel attacks by
verifying and resolving rule conflicts. Specifically,
CCD tracks all rule insertion and modification messages
from applications running on the controller. It
analyzes the correlation among rules based on multiple
packet header fields and resolves any identified rule
conflict in real time before rule installation. We
implement CCD with the Floodlight controller and
evaluate its performance with the real-world Stanford
topology. We show that CCD can efficiently detect and
prevent rule conflicts in the data plane that may raise
covert channels within hundreds of microseconds and
brings small overhead to the packet delivery.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Han:2018:QAP,
author = "Kai Han and He Huang and Jun Luo",
title = "Quality-Aware Pricing for Mobile Crowdsensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1728--1741",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2846569",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile crowdsensing has been considered as a promising
approach for large scale urban data collection, but has
also posed new challenging problems, such as
incentivization and quality control. Among the other
incentivization approaches, posted pricing has been
widely adopted by commercial systems due to the reason
that it naturally achieves truthfulness and fairness
and is easy to be implemented. However, the fundamental
problem of how to set the ``right'' posted prices in
crowdsensing systems remains largely open. In this
paper, we study a quality-aware pricing problem for
mobile crowdsensing, and our goal is to choose an
appropriate posted price to recruit a group of
participants with reasonable sensing qualities for
robust crowdsensing, while the total expected payment
is minimized. We show that our problem is NP-hard and
has close ties with the well-known Poisson binomial
distributions PBDs. To tackle our problem, we first
discover some non-trivial submodular properties of PBD,
which have not been reported before, and then propose a
novel ``ironing method'' that transforms our problem
from a non-submodular optimization problem into a
submodular one by leveraging the newly discovered
properties of PBD. Finally, with the ironing method,
several approximation algorithms with provable
performance ratios are provided, and we also conduct
extensive numerical experiments to demonstrate the
effectiveness 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{Fan:2018:MBP,
author = "Jingyuan Fan and Chaowen Guan and Kui Ren and Chunming
Qiao",
title = "Middlebox-Based Packet-Level Redundancy Elimination
Over Encrypted Network Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1742--1753",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2846791",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To eliminate redundant transfers over WAN links and
improve network efficiency, middleboxes have been
deployed at ingress/egress. These middleboxes can
operate on individual packets and are application layer
protocol transparent. They can identify and remove
duplicated byte strings on the fly. However, with the
increasing use of HTTPS, current redundancy elimination
RE solution can no longer work without violating
end-to-end privacy. In this paper, we present RE over
encrypted traffic REET, the first middlebox-based
system that supports both intra-user and inter-user
packet-level RE directly over encrypted traffic. REET
realizes this by using a novel protocol with limited
overhead and protects end users from honest-but-curious
middleboxes. We implement REET and show its performance
for both end users and middleboxes using several
hundred gigabytes of network traffic traces collected
from a large U.S. university.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Otoshi:2018:HMP,
author = "Tatsuya Otoshi and Yuichi Ohsita and Masayuki Murata
and Yousuke Takahashi and Keisuke Ishibashi and Kohei
Shiomoto and Tomoaki Hashimoto",
title = "Hierarchical Model Predictive Traffic Engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1754--1767",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2850377",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Hierarchical traffic control is a promising approach
for improving scalability in the face of network size.
In this scheme, multiple controllers are introduced in
a network, and these hierarchically decide operations.
At the bottom layer, controllers decide specific
operations in a small area, while the controllers at
the upper layer decide inter-area operations using
abstracted information from the lower layers. These
controllers depend mutually on controllers in other
layers, which may cause control oscillations,
disturbing the appropriate network state. The common
way to handle such oscillations is to set the control
interval of the upper layer to a large value. This
approach, however, causes another problem: the delay of
upper level operations relative to environmental
changes. To solve this problem, we introduce the
concept of model predictive control MPC to hierarchical
network control. In this method, each controller
gradually changes operations based on the predicted
future network state. By predicting the behavior of
other controllers in the upper/lower layers, the
controller can smoothly shift to the suitable
operations. Furthermore, the impact of a prediction
error can be reduced by avoiding significant changes in
operations. In this paper, we develop MPC-based
hierarchical network control for effective hierarchical
traffic engineering TE. Through extensive simulation,
we show that the MPC-based hierarchical TE can avoid
congestion even in the cases where the existing TE
method of setting long control intervals for the upper
layer cannot accommodate dynamically changing traffic
owing to operational delay.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hsieh:2018:HTA,
author = "Ping-Chun Hsieh and I-Hong Hou",
title = "Heavy-Traffic Analysis of {QoE} Optimality for
On-Demand Video Streams Over Fading Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1768--1781",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2846518",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes online scheduling policies to
optimize quality of experience QoE for video-on-demand
applications in wireless networks. We consider wireless
systems, where an access point transmits video content
to clients over fading channels. The QoE of each flow
is measured by its duration of video playback
interruption. We are specifically interested in systems
operating in the heavy-traffic regime. We first
consider a special case of ON--OFF channels plus
constant-bit-rate videos and establish a scheduling
policy that achieves every point in the capacity region
under heavy-traffic conditions. This policy is then
extended for more general fading channels and
variable-bit-rate videos, and we prove that it remains
optimal under some mild conditions. We then formulate a
network utility maximization problem based on the QoE
of each flow. We demonstrate that our policies achieve
the optimal overall utility when their parameters are
chosen properly. Finally, we compare our policies
against three popular policies. Simulation and
experimental results validate that the proposed
policies indeed outperform existing policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kolla:2018:CLS,
author = "Ravi Kumar Kolla and Krishna Jagannathan and Aditya
Gopalan",
title = "Collaborative Learning of Stochastic Bandits Over a
Social Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1782--1795",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852361",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a collaborative online learning paradigm,
wherein a group of agents connected through a social
network are engaged in learning a stochastic
multi-armed bandit problem. Each time an agent takes an
action, the corresponding reward is instantaneously
observed by the agent, as well as its neighbors in the
social network. We perform a regret analysis of various
policies in this collaborative learning setting. A key
finding of this paper is that natural extensions of
widely studied single agent learning policies to the
network setting need not perform well in terms of
regret. In particular, we identify a class of
non-altruistic and individually consistent policies and
argue by deriving regret lower bounds that they are
liable to suffer a large regret in the networked
setting. We also show that the learning performance can
be substantially improved if the agents exploit the
structure of the network and develop a simple learning
algorithm based on dominating sets of the network.
Specifically, we first consider a star network, which
is a common motif in hierarchical social networks and
show analytically that the hub agent can be used as an
information sink to expedite learning and improve the
overall regret. We also derive network-wide regret
bounds for the algorithm applied to general networks.
We conduct numerical experiments on a variety of
networks to corroborate our analytical results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Swamy:2018:ECU,
author = "Peruru Subrahmanya Swamy and Venkata Pavan Kumar
Bellam and Radha Krishna Ganti and Krishna
Jagannathan",
title = "Efficient {CSMA} Using Regional Free Energy
Approximations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1796--1809",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852716",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed link scheduling algorithms based on
carrier sense multiple access and Gibbs sampling are
known to achieve throughput optimality, if certain
parameters called the fugacities are appropriately
chosen. However, the problem of computing these
fugacities is NP-hard. Further, the complexity of the
existing stochastic gradient descent-based algorithms
that compute the exact fugacities scales exponentially
with the network size. In this paper, we propose a
general framework to estimate the fugacities using
regional free energy approximations. In particular, we
derive explicit expressions for approximate fugacities
corresponding to any feasible service rate vector. We
further prove that our approximate fugacities are exact
for the class of chordal graphs. A distinguishing
feature of our work is that the regional approximations
that we propose are tailored to conflict graphs with
small cycles, which is a typical characteristic of
wireless networks. Numerical results indicate that the
proposed methods are quite accurate, and significantly
outperform the existing approximation techniques.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Huang:2018:LAS,
author = "Longbo Huang and Minghua Chen and Yunxin Liu",
title = "Learning-Aided Stochastic Network Optimization With
State Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1810--1820",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2854593",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the problem of stochastic network
optimization in the presence of state prediction and
non-stationarity. Based on a novel state prediction
model featured with a distribution-accuracy curve, we
develop the predictive learning-aided control PLC
algorithm, which jointly utilizes historic and
predicted network state information for decision
making. PLC is an online algorithm that consists of
three key components, namely, sequential distribution
estimation and change detection, dual learning, and
online queue-based control. We show that for stationary
networks, PLC achieves a near-optimal utility-delay
tradeoff. For non-stationary networks, PLC obtains an
utility-backlog tradeoff for distributions that last
longer than a time proportional to the square of the
prediction error, which is smaller than that needed by
backpressure BP for achieving the same utility
performance. Moreover, PLC detects distribution change
$ O w $ slots faster with high probability $w$ is the
prediction size and achieves a convergence time faster
than that under BP. Our results demonstrate that state
prediction helps: 1 achieve faster detection and
convergence and 2 obtain better utility-delay
tradeoffs. They also quantify the benefits of
prediction in four important performance metrics, i.e.,
utility efficiency, delay quality-of-service, detection
robustness, and convergence adaptability and provide
new insight for joint prediction, learning, and
optimization in stochastic networks",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2018:CIL,
author = "Tong Yang and Gaogang Xie and Alex X. Liu and Qiaobin
Fu and Yanbiao Li and Xiaoming Li and Laurent Mathy",
title = "Constant {IP} Lookup With {FIB} Explosion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1821--1836",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2853575",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the fast development of Internet, the forwarding
tables in backbone routers have been growing fast in
size. An ideal IP lookup algorithm should achieve
constant, yet small, IP lookup time, and on-chip memory
usage. However, no prior IP lookup algorithm achieves
both requirements at the same time. In this paper, we
first propose SAIL, a splitting approach to IP lookup.
One splitting is along the dimension of the lookup
process, namely finding the prefix length and finding
the next hop, and another splitting is along the
dimension of prefix length, namely IP lookup on
prefixes of length less than or equal to 24 and that
longer than 24. Second, we propose a suite of
algorithms for IP lookup based on our SAIL framework.
Third, we implemented our algorithms on four platforms:
CPU, FPGA, GPU, and many-core. We conducted extensive
experiments to evaluate our algorithms using real FIBs
and real traffic from a major ISP in China.
Experimental results show that our SAIL algorithms are
much faster than well known IP lookup algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2018:JOF,
author = "Gongming Zhao and Hongli Xu and Shigang Chen and
Liusheng Huang and Pengzhan Wang",
title = "Joint Optimization of Flow Table and Group Table for
Default Paths in {SDNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1837--1850",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2853587",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-defined networking SDN separates the control
plane from the data plane to ease network management
and provide flexibility in packet routing. The control
plane interacts with the data plane through an
interface that configures the forwarding tables,
usually including a flow table and a group table, at
each switch. Due to high cost and power consumption of
ternary content addressable memory, commodity switches
can only support flow/group tables of limited size,
which presents serious challenge for SDN to scale to
large networks. One promising approach to address the
scalability problem is to deploy aggregate default
paths specified by wildcard forwarding rules. However,
the multi-dimensional interaction among numerous system
parameters and performance/scalability considerations
makes the problem of setting up the flow/group tables
at all switches for optimal overall layout of default
paths very challenging. This paper studies the joint
optimization of flow/group tables in the complex
setting of large-scale SDNs. We formulate this problem
as an integer linear program, and prove its
NP-hardness. An efficient algorithm with bounded
approximation factors is proposed to solve the problem.
The properties of our algorithm are formally analyzed.
We implement the proposed algorithm on an SDN test bed
for experimental studies and use simulations for
large-scale investigation. The experimental results and
simulation results show that, under the same number of
flow entries, our method can achieve better network
performance than the equal cost multipath while
reducing the use of group entries by about 74\%.
Besides, our method can reduce the link load ratio and
the number of flow entries by approximately 13\% and
60\% compared with DevoFlow with 10\% additional group
entries.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Schuller:2018:TEU,
author = "Timmy Schuller and Nils Aschenbruck and Markus Chimani
and Martin Horneffer and Stefan Schnitter",
title = "Traffic Engineering Using Segment Routing and
Considering Requirements of a Carrier {IP} Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1851--1864",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2854610",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet Service Providers are challenged by
increasing traffic demands. Advanced Traffic
Engineering TE is one way to overcome this challenge.
Segment Routing SR is a relatively new approach for TE.
To decide whether SR is a good approach for deployment
in carrier IP backbone networks, it has to show its
benefits in real-world scenarios and still needs to be
feasible from the network operation and management
point of view. In this paper, we analyze traffic data
from a European tier one backbone network from 2011 to
2015. The total traffic increases significantly
throughout that period. We analyze geographic
differences to select representative traffic peak times
as reference scenarios for an evaluation of TE using SR
for real-world topologies and traffic demands. Finally,
we extend the existing SR formulations to consider
requirements from network operation and management. Our
evaluation results show that the SR yields close to
optimal results while still being deployable with
reasonable effort.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2018:WCP,
author = "Haipeng Dai and Xiaoyu Wang and Alex X. Liu and
Huizhen Ma and Guihai Chen and Wanchun Dou",
title = "Wireless Charger Placement for Directional Charging",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1865--1878",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2855398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless power transfer technology has witnessed huge
development because of its convenience and reliability.
This paper concerns the fundamental issue of wireless
charger PLacement with Optimized charging uTility PLOT,
i.e., given a fixed number of chargers and a set of
points where rechargeable devices can be placed with
orientations uniformly distributed in the range of $
[0, 2 \pi] $ positions and orientations of chargers
such that the overall expected charging utility for all
points is maximized. To address PLOT, we propose a $ 1
- 1 / e - \epsilon $ approximation algorithm. First, we
present techniques to approximate the nonlinear
charging power and the expected charging utility to
make the problem almost linear. Second, we develop a
dominating coverage set extraction method to reduce the
continuous search space of PLOT to a limited and
discrete one without a performance loss. Third, we
prove that the reformulated problem is essentially
maximizing a monotone submodular function subject to a
matroid constraint, and propose a greedy algorithm to
address this problem. We conduct both simulation and
field experiments to validate our theoretical results,
and the results show that our algorithm can outperform
comparison algorithms by at least 32.9\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Henri:2018:MAB,
author = "Sebastien Henri and Christina Vlachou and Patrick
Thiran",
title = "Multi-Armed Bandit in Action: Optimizing Performance
in Dynamic Hybrid Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1879--1892",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2856302",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Today's home networks are often composed of several
technologies such as Wi-Fi or power-line communication
PLC. Yet, current network protocols rarely fully
harness this diversity and use each technology for a
specific, pre-defined role, for example, wired media as
a backbone and the wireless medium for mobility.
Moreover, a single path is generally employed to
transmit data; this path is established in advance and
remains in use as long as it is valid, although
multiple possible paths offer more robustness against
varying environments. We introduce HyMAB, an algorithm
that explores different multipaths and finds the best
one in a mesh hybrid network, while keeping congestion
under control. We employ the multi-armed-bandit
framework and prove that HyMAB achieves optimal
throughput under a static scenario. HyMAB design also
accounts for real-network intricacies and dynamic
conditions; it adapts to varying environments and
switches multipaths when needed. We implement HyMAB on
a PLC/Wi-Fi test bed. This is, to the best of our
knowledge, the first implementation on a real test bed
of multi-armed-bandit strategies in the context of
routing. Our experimental results confirm the
optimality of HyMAB and its ability to adapt to dynamic
network conditions, as well as the gains provided by
employing multi-armed-bandit strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saifullah:2018:LPW,
author = "Abusayeed Saifullah and Mahbubur Rahman and Dali
Ismail and Chenyang Lu and Jie Liu and Ranveer
Chandra",
title = "Low-Power Wide-Area Network Over White Spaces",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1893--1906",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2856197",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As a key technology driving the Internet-of-Things,
low-power wide-area networks LPWANs are evolving to
overcome the range limits and scalability challenges in
traditional wireless sensor networks. This paper
proposes a new LPWAN architecture called sensor network
over white spaces SNOW by exploiting the TV white
spaces. The SNOW is the first highly scalable LPWAN
over TV white spaces that enable asynchronous,
bi-directional, and massively concurrent communication
between numerous sensors and a base station. This is
achieved through a set of novel techniques. The SNOW
has a new OFDM-based physical layer that allows the
base station using a single antenna-radio: 1 to send
different data to different nodes concurrently and 2 to
receive concurrent transmissions made by the sensor
nodes asynchronously. It has a lightweight media access
control protocol that: 1 efficiently implements
per-transmission acknowledgments of the asynchronous
transmissions by exploiting the adopted OFDM design and
2 combines CSMA/CA and location-aware spectrum
allocation for mitigating hidden terminal effects, thus
enhancing the flexibility of the nodes in transmitting
asynchronously. We implement the SNOW in GNU radio
using universal software radio peripheral devices.
Experiments through deployments in three radio
environments --- a large metropolitan city, a rural
area, and an indoor environment --- as well as
large-scale simulations demonstrated that the SNOW
drastically enhances the scalability of a sensor
network and outperforms existing techniques in terms of
scalability, energy, and latency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yingchareonthawornchai:2018:SPA,
author = "Sorrachai Yingchareonthawornchai and James Daly and
Alex X. Liu and Eric Torng",
title = "A Sorted-Partitioning Approach to Fast and Scalable
Dynamic Packet Classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1907--1920",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852710",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The advent of software-defined networking SDN leads to
two key challenges for packet classification on the
dramatically increased dynamism and dimensionality.
Although packet classification is a well-studied
problem, no existing solution satisfies these new
requirements without sacrificing classification speed.
Decision tree methods, such as HyperCuts, EffiCuts, and
SmartSplit can achieve high-speed packet
classification, but support neither fast updates nor
high dimensionality. The tuple space search TSS
algorithm used in Open vSwitch achieves fast updates
and high dimensionality but not high-speed packet
classification. In this paper, we propose a hybrid
approach, PartitionSort, that combines the benefits of
both TSS and decision trees achieving high-speed packet
classification, fast updates, and high dimensionality.
A key to PartitionSort is a novel notion of ruleset
sortability that provides two key benefits. First, it
results in far fewer partitions than the TSS. Second,
it allows the use of multi-dimensional interval trees
to achieve logarithmic classification and update time
for each sortable ruleset partition. Our extensive
experimental results show that The PartitionSort is an
order of magnitude faster than the TSS in classifying
packets while achieving comparable update time. The
PartitionSort is a few orders of magnitude faster in
construction time than SmartSplit, a state-of-the-art
decision tree classifier, while achieving a competitive
classification time. Finally, the PartitionSort is
scalable to an arbitrary number of fields and requires
only linear space.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Abbasi:2018:VSD,
author = "Abubakr O. Al-Abbasi and Vaneet Aggarwal",
title = "Video Streaming in Distributed Erasure-Coded Storage
Systems: Stall Duration Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1921--1932",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2851379",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The demand for global video has been burgeoning across
industries. With the expansion and improvement of
video-streaming services, cloud-based video is evolving
into a necessary feature of any successful business for
reaching internal and external audiences. This paper
considers video streaming over distributed systems
where the video segments are encoded using an erasure
code for better reliability, thus being the first work
to our best knowledge that considers video streaming
over erasure-coded distributed cloud systems. The
download time of each coded chunk of each video segment
is characterized, and the ordered statistics over the
choice of the erasure-coded chunks is used to obtain
the playback time of different video segments. Using
the playback times, bounds on the moment generating
function on the stall duration are used to bound the
mean stall duration. Moment generating function-based
bounds on the ordered statistics are also used to bound
the stall duration tail probability, which determines
the probability that the stall time is greater than a
pre-defined number. These two metrics, mean stall
duration and the stall duration tail probability, are
important quality of experience QoE measures for the
end users. Based on these metrics, we formulate an
optimization problem to jointly minimize the convex
combination of both the QoE metrics averaged over all
requests over the placement and access of the video
content. The non-convex problem is solved using an
efficient iterative algorithm. Numerical results show a
significant improvement in QoE metrics for cloud-based
video compared to the considered baselines.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2018:PPB,
author = "Ning Li and Jose-Fernan Martinez-Ortega and Vicente
Hernandez Diaz and Jose Antonio Sanchez Fernandez",
title = "Probability Prediction-Based Reliable and Efficient
Opportunistic Routing Algorithm for {VANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1933--1947",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852220",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In the vehicular ad hoc networks VANETs, due to the
high mobility of vehicles, the network parameters
change frequently and the information that the sender
maintains may outdate when it wants to transmit data
packet to the receiver, so for improving the routing
efficiency and reliability, we propose the probability
prediction-based reliable and efficient opportunistic
routing PRO algorithm for VANETs. The PRO routing
algorithm can predict the variation of
signal-to-interference-plus-noise ratio SINR and packet
queue length PQL of the receiver. The prediction
results are used to determine the utility of each
relaying vehicle in the candidate set. The calculation
of the vehicle's utility is the weight-based algorithm,
and the weights are the variances of SINR and PQL. The
relaying priority of each relaying vehicle is
determined by the value of its utility. By these
innovations, the PRO can achieve better routing
performance such as the packet delivery ratio, the
end-to-end delay, and the network throughput than the
SRPE, ExOR street-centric, and greedy perimeter
stateless routing algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2018:PPD,
author = "Zhuotao Liu and Hao Jin and Yih-Chun Hu and Michael
Bailey",
title = "Practical Proactive {DDoS}-Attack Mitigation via
Endpoint-Driven In-Network Traffic Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1948--1961",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2854795",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Volumetric attacks, which overwhelm the bandwidth of a
destination, are among the most common distributed
denial-of-service DDoS attacks today. Despite
considerable effort made by both research and industry,
our recent interviews with over 100 potential DDoS
victims in over 10 industry segments indicate that
today's DDoS prevention is far from perfect. On one
hand, few academical proposals have ever been deployed
in the Internet; on the other hand, solutions offered
by existing DDoS prevention vendors are not silver
bullet to defend against the entire attack spectrum.
Guided by such large-scale study of today's DDoS
defense, in this paper, we present MiddlePolice, the
first readily deployable and proactive DDoS prevention
mechanism. We carefully architect MiddlePolice such
that it requires no changes from both the Internet core
and the network stack of clients, yielding instant
deployability in the current Internet architecture.
Further, relying on our novel capability feedback
mechanism, MiddlePolice is able to enforce
destination-driven traffic control so that it
guarantees to deliver victim-desired traffic regardless
of the attacker strategies. We implement a prototype of
MiddlePolice and demonstrate its feasibility via
extensive evaluations in the Internet, hardware
testbed, and large-scale simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:MAB,
author = "Shuo Wang and Jiao Zhang and Tao Huang and Tian Pan
and Jiang Liu and Yunjie Liu",
title = "Multi-Attributes-Based Coflow Scheduling Without Prior
Knowledge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1962--1975",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2858801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In data centers, the coflow abstraction is proposed to
better express the requirements and communication
semantics of a group of parallel flows generated by the
jobs of cluster computing frameworks. Knowing the
coflow-level information, such as coflow size, previous
coflow scheduling proposals improve the performance
over flow-level scheduling schemes. Recently, since
some information of coflow is difficult to obtain in
cloud environments, designing coflow scheduling
mechanisms with partial or even without any information
attracts much attention. However, existing
information-agnostic mechanisms are generally built on
the least attained service heuristic algorithm that
schedules coflows only according to the sent bytes of
different coflows, and they all ignore other useful
coflow-level information like width, length, and
communication patterns. In this paper, we investigate
that the coflow completion time could be further
decreased by jointly leveraging multiple coflow-level
attributes. Based on this investigation, we present a
Multiple-attributes-based Coflow Scheduling MCS
mechanism to reduce the coflow completion time. In MCS,
at the start of a coflow, a shortest and narrowest
coflow first algorithm is designed to assign the
initial priority based on the coflow width. During the
transmission of coflows, based on the sent bytes of
coflows, we proposed a double-threshold scheme to
adjust the priorities of different classes of coflows
according to different thresholds. Accordingly, the
optimal thresholds are analyzed by using the M/M/1
queuing model. Testbed evaluations and simulations with
production workloads show that MCS outperforms the
previous information-agnostic scheduler Aalo, and
reduces the completion time of small coflows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2018:RSA,
author = "Xueying Guo and Rahul Singh and P. R. Kumar and
Zhisheng Niu",
title = "A Risk-Sensitive Approach for Packet Inter-Delivery
Time Optimization in Networked Cyber-Physical Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1976--1989",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2856883",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In networked cyber-physical systems, the
inter-delivery time of data packets becomes an
important quantity of interest. However, providing a
guarantee that the inter-delivery times of the packets
are ``small enough'' becomes a difficult task in such
systems due to the unreliable communication medium and
limited network resources. We design scheduling
policies that meet the inter-delivery time requirements
of multiple clients connected over wireless channels.
We formulate the problem as an infinite-state
risk-sensitive Markov decision process, where large
exceedances of inter-delivery times for different
clients over their design thresholds are severely
penalized. We reduce the infinite-state problem to an
equivalent finite-state problem and establish the
existence of a stationary optimal policy and an
algorithm for computing it in a finite number of steps.
However, its computational complexity makes it
intractable when the number of clients is of the order
of 100 or so that is found in applications such as
in-vehicle networks. To design computationally
efficient optimal policies, we, therefore, develop a
theory based on the high reliability asymptotic
scenario, in which the channel reliability
probabilities are close to one. We thereby obtain an
algorithm of relatively low computational complexity
for determining an asymptotically optimal policy. To
address the remaining case when the channels are not
relatively reliable, we design index-based policies for
the risk sensitive case, which extends key ideas for
index policies in risk-neutral multi-armed bandit
problems. Simulation results are provided to show the
effectiveness of our policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mehrnoush:2018:AMW,
author = "Morteza Mehrnoush and Vanlin Sathya and Sumit Roy and
Monisha Ghosh",
title = "Analytical Modeling of {Wi-Fi} and {LTE-LAA}
Coexistence: Throughput and Impact of Energy Detection
Threshold",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1990--2003",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2856901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With both small-cell LTE and Wi-Fi networks available
as alternatives for deployment in unlicensed bands
notably 5 GHz, the investigation into their coexistence
is a topic of active interest, primarily driven by
industry groups. 3GPP has recently standardized LTE
licensed assisted access LTE-LAA that seeks to make LTE
more co-existence friendly with Wi-Fi by incorporating
similar sensing and back-off features. Nonetheless, the
results presented by industry groups offer little
consensus on important issues like respective network
parameter settings that promote ``fair access'' as
required by 3GPP. Answers to such key system deployment
aspects, in turn, require credible analytical models,
on which there has been a little progress to date.
Accordingly, in one of the first works of its kind, we
develop a new framework for estimating the throughput
of Wi-Fi and LTE-LAA in coexistence scenarios via
suitable modifications to the celebrated Bianchi model.
The impact of various network parameters such as energy
detection threshold on Wi-Fi and LTE-LAA coexistence is
explored as a byproduct and corroborated via a National
Instrument experimental test bed that validates the
results for LTE-LAA access priority classes 1 and 3.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ferlin:2018:MMF,
author = "Simone Ferlin and Stepan Kucera and Holger Claussen
and Ozgu Alay",
title = "{MPTCP} Meets {FEC}: Supporting Latency-Sensitive
Applications Over Heterogeneous Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2005--2018",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2864192",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Over the past years, TCP has gone through numerous
updates to provide performance enhancement under
diverse network conditions. However, with respect to
losses, little can be achieved with legacy TCP
detection and recovery mechanisms. Both fast
retransmission and retransmission timeout take at least
one extra round trip time to perform, and this might
significantly impact the performance of
latency-sensitive applications, especially in lossy or
high delay networks. While forward error correction FEC
is not a new initiative in this direction, the majority
of the approaches consider FEC inside the application.
In this paper, we design and implement a framework,
where FEC is integrated within TCP. Our main goal with
this design choice is to enable latency sensitive
applications over TCP in high delay and lossy networks,
but remaining application agnostic. We further
incorporate this design into multipath TCP MPTCP, where
we focus particularly on heterogeneous settings,
considering the fact that TCP recovery mechanisms
further escalate head-of-line blocking in multipath. We
evaluate the performance of the proposed framework and
show that such a framework can bring significant
benefits compared with legacy TCP and MPTCP for
latency-sensitive real application traffic, such as
video streaming and web services.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2018:IMP,
author = "Haiming Jin and Lu Su and Houping Xiao and Klara
Nahrstedt",
title = "Incentive Mechanism for Privacy-Aware Data Aggregation
in Mobile Crowd Sensing Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2019--2032",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2840098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The recent proliferation of human-carried mobile
devices has given rise to mobile crowd sensing MCS
systems that outsource the collection of sensory data
to the public crowd equipped with various mobile
devices. A fundamental issue in such systems is to
effectively incentivize worker participation. However,
instead of being an isolated module, the incentive
mechanism usually interacts with other components which
may affect its performance, such as data aggregation
component that aggregates workers' data and data
perturbation component that protects workers' privacy.
Therefore, different from the past literature, we
capture such interactive effect and propose INCEPTION,
a novel MCS system framework that integrates an
incentive, a data aggregation, and a data perturbation
mechanism. Specifically, its incentive mechanism
selects workers who are more likely to provide reliable
data and compensates their costs for both sensing and
privacy leakage. Its data aggregation mechanism also
incorporates workers' reliability to generate highly
accurate aggregated results, and its data perturbation
mechanism ensures satisfactory protection for workers'
privacy and desirable accuracy for the final perturbed
results. We validate the desirable properties of
INCEPTION through theoretical analysis as well as
extensive simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2018:OBL,
author = "Ying Cui and Muriel Medard and Edmund Yeh and Douglas
Leith and Ken R. Duffy",
title = "Optimization-Based Linear Network Coding for General
Connections of Continuous Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2033--2047",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "For general connections, the problem of finding
network codes and optimizing resources for those codes
is intrinsically difficult and a little is known about
its complexity. Most of the existing methods for
identifying solutions rely on very restricted classes
of network codes in terms of the number of flows
allowed to be coded together, and are not entirely
distributed. In this paper, we consider a new method
for constructing linear network codes for general
connections of continuous flows to minimize the total
cost of the edge use based on mixing. We first
formulate the minimum-cost network coding design
problem. To solve the optimization problem, we propose
two equivalent alternative formulations with discrete
mixing and continuous mixing, respectively, and develop
distributed algorithms to solve them. Our approach
fairly allows general coding across flows and
guarantees no greater cost than existing solutions.
Numerical results illustrate the performance 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{Zhou:2018:SRR,
author = "Haifeng Zhou and Chunming Wu and Chengyu Yang and
Pengfei Wang and Qi Yang and Zhouhao Lu and Qiumei
Cheng",
title = "{SDN--RDCD}: a Real-Time and Reliable Method for
Detecting Compromised {SDN} Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2048--2061",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2859483",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A software-defined network SDN is increasingly
deployed in many practical settings, bringing new
security risks, e.g., SDN controller and switch
hijacking. In this paper, we propose a real-time method
to detect compromised SDN devices in a reliable way.
The proposed method aims at solving the detection
problem of compromised SDN devices when both the
controller and the switch are trustless, and it is
complementary with existing detection methods. Our
primary idea is to employ backup controllers to audit
the handling information of network update events
collected from the primary controller and its switches,
and to detect compromised devices by recognizing
inconsistent or unexpected handling behaviors among the
primary controller, backup controllers, and switches.
Following this idea, we first capture each network
update request and its execution result in the primary
controller, collect each received network update
instruction and the information of any state update in
switches, and deliver these four kinds of information
to those backup controllers in an auditor role. An
auditor controller is designed to create an audit
record for each received network update request and to
add its execution result of this network update request
as well as the received four kinds of matching
information to the audit record. In particular,
heterogeneous auditor controllers are proposed to avoid
the same vulnerability with the primary controller. The
audit algorithm and theoretical proof of its
effectiveness for security enhancement are then
presented. Finally, based on our prototype
implementation, our experimental results further
validate the proposed method and its low costs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2018:MDA,
author = "Ming Tang and Haitian Pang and Shou Wang and Lin Gao
and Jianwei Huang and Lifeng Sun",
title = "Multi-Dimensional Auction Mechanisms for Crowdsourced
Mobile Video Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2062--2075",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2859236",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Crowdsourced mobile video streaming enables nearby
mobile video users to aggregate network resources to
improve their video streaming performances. However,
users are often selfish and may not be willing to
cooperate without proper incentives. Designing an
incentive mechanism for such a scenario is challenging
due to the users' asynchronous downloading behaviors
and their private valuations for multi-bitrate encoded
videos. In this paper, we propose both the
single-object and multi-object multi-dimensional
auction mechanisms, through which users sell the
opportunities for downloading single and multiple video
segments with multiple bitrates, respectively. Both the
auction mechanisms can achieve truthfulness i.e.,
truthful private information revelation and efficiency
i.e., social welfare maximization. Simulations with
real traces show that crowdsourced mobile streaming
facilitated by the auction mechanisms outperforms
noncooperative streaming by 48.6\% on average in terms
of social welfare. To evaluate the real-world
performance, we also construct a demo system for
crowdsourced mobile streaming and implement our
proposed auction mechanism. Experiments over the demo
show that those users who provide resources to others
and those users who receive help can increase their
welfares by 15.5\% and 35.4\% on average via
cooperation, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Brinton:2018:EOS,
author = "Christopher G. Brinton and Swapna Buccapatnam and
Liang Zheng and Da Cao and Andrew S. Lan and Felix M.
F. Wong and Sangtae Ha and Mung Chiang and H. Vincent
Poor",
title = "On the Efficiency of Online Social Learning Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2076--2089",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2859325",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A social learning network SLN emerges when users
exchange information on educational topics with
structured interactions. The recent proliferation of
massively scaled online human learning, such as massive
open online courses MOOCs, has presented a plethora of
research challenges surrounding SLN. In this paper, we
ask: how efficient are these networks? We propose a
method in which the SLN efficiency is determined by
comparing user benefit in the observed network to a
benchmark of maximum utility achievable through
optimization. Our method defines the optimal SLN
through utility maximization subject to a set of
constraints that can be inferred from the network, and
given multiple solutions searches for the one closest
to the observed network so as to require the least
amount of change to user behavior in practice. Through
evaluation on four MOOC discussion forum data sets and
optimizing over millions of variables, we find that the
SLN efficiency can be rather low from 76\% to 90\%
depending on the specific parameters and data set,
which indicates that much can be gained through
optimization. We find that the gains in global utility
i.e., average across users can be obtained without
making the distribution of local utilities i.e.,
utility of individual users less fair. We also propose
an algorithm for realizing the optimal network through
curated news feeds in online SLN.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2018:CIN,
author = "Jianan Zhang and Eytan Modiano",
title = "Connectivity in Interdependent Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2090--2103",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2863715",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose and analyze a graph model to study the
connectivity of interdependent networks. Two
interdependent networks of arbitrary topologies are
modeled as two graphs, where every node in one graph is
supported by supply nodes in the other graph, and a
node fails if all of its supply nodes fail. Such
interdependence arises in cyber-physical systems and
layered network architectures. We study the supply node
connectivity of a network: namely, the minimum number
of supply node removals that would disconnect the
network. We develop algorithms to evaluate the supply
node connectivity given arbitrary network topologies
and interdependence between two networks. Moreover, we
develop interdependence assignment algorithms that
maximize the supply node connectivity. We prove that a
random assignment algorithm yields a supply node
connectivity within a constant factor from the optimal
for most networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2018:NSB,
author = "Yifei Yuan and Dong Lin and Siri Anil and Harsh Verma
and Anirudh Chelluri and Rajeev Alur and Boon Thau
Loo",
title = "{NetEgg}: a Scenario-Based Programming Toolkit for
{SDN} Policies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2104--2117",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2861919",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent emergence of software-defined networks offers
an opportunity to design domain-specific programming
abstractions aimed at network operators. In this paper,
we propose scenario-based programming, a framework that
allows network operators to program network policies by
describing example behaviors in representative
scenarios. Given these scenarios, our synthesis
algorithm automatically infers the controller state
that needs to be maintained along with the rules to
process network events and update state. We have
developed the NetEgg scenario-based programming tool,
which can execute the generated policy implementation
on top of a centralized controller, but also
automatically infers flow-table rules that can be
pushed to switches to improve throughput. We evaluate
the performance of NetEgg based on the computational
requirements of our synthesis algorithm as well as the
overhead introduced by the generated policy
implementation, and we study the usability of NetEgg
based on a user study. Our results show that our
synthesis algorithm can generate policy implementations
in less than a second for all policies we studied, and
the automatically generated policy implementations have
performance comparable to their hand-crafted
implementations. Our user study shows that the proposed
scenario-based programming approach can reduce the
programming time by 50\% and the error rate by 32\%
compared with an alternative programming approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Feng:2018:ODC,
author = "Hao Feng and Jaime Llorca and Antonia M. Tulino and
Andreas F. Molisch",
title = "Optimal Dynamic Cloud Network Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2118--2131",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865171",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed cloud networking enables the deployment of
a wide range of services in the form of interconnected
software functions instantiated over general purpose
hardware at multiple cloud locations distributed
throughout the network. We consider the problem of
optimal service delivery over a distributed cloud
network, in which nodes are equipped with both
communication and computation resources. We address the
design of distributed online solutions that drive flow
processing and routing decisions, along with the
associated allocation of cloud and network resources.
For a given set of services, each described by a chain
of service functions, we characterize the cloud network
capacity region and design a family of dynamic cloud
network control DCNC algorithms that stabilize any
service input rate inside the capacity region, while
achieving arbitrarily close to minimum resource cost.
The proposed DCNC algorithms are derived by extending
Lyapunov drift-plus-penalty control to a novel
multi-commodity-chain MCC queuing system, resulting in
the first throughput and cost optimal algorithms for a
general class of MCC flow problems that generalizes
traditional multi-commodity flow by including flow
chaining, flow scaling, and joint
communication/computation resource allocation. We
provide throughput and cost optimality guarantees,
convergence time analysis, and extensive simulations in
representative cloud network scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhu:2018:TOA,
author = "Yifei Zhu and Silvery D. Fu and Jiangchuan Liu and
Yong Cui",
title = "Truthful Online Auction Toward Maximized Instance
Utilization in the Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2132--2145",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2864726",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Although infrastructure as a service IaaS users are
busy scaling up/out their cloud instances to meet the
ever-increasing demands, the dynamics of their demands,
as well as the coarse-grained billing options offered
by leading cloud providers, have led to substantial
instance underutilization in both temporal and spatial
domains. This paper systematically examines an instance
subletting service, where sublettable instances can be
leased to others within predetermined periods when
underutilized, from both theoretical and practical
perspectives. The studied instance subletting service
extends and complements the existing instance market of
IaaS providers. We identify the unique challenges and
opportunities in this new service, and design online
auction mechanisms to make allocation and pricing
decisions for the instances to be sublet. For static
supplies of instances, our mechanism guarantees
truthfulness and individual rationality with the best
possible competitive ratio. We then incorporate a
multi-stage discount strategy to gracefully handle
dynamic supplies. Extensive trace-driven simulations
show that our service achieves significant performance
gains in both cost savings and social welfare. We
further pinpoint the challenges in implementing such a
service in the real-world system and validate our
modeling assumptions through a container-based
prototype implemented over Amazon EC2.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2018:SIR,
author = "Lei Xie and Qingliang Cai and Alex X. Liu and Wei Wang
and Yafeng Yin and Sanglu Lu",
title = "Synchronize Inertial Readings From Multiple Mobile
Devices in Spatial Dimension",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2146--2159",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2859246",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the problem of space
synchronization, i.e., synchronizing inertial readings
from multiple mobile devices in the spatial dimension,
in other words, multiple mobile devices are space
synchronized to have the same 3-D coordinates except
that each device is the origin of its corresponding
coordinate. We propose a scheme called MObile Space
Synchronization MOSS for devices with two sensors: an
accelerometer and a gyroscope, which are available on
most mobile devices. Accelerometer readings from
multiple mobile devices on a human subject are used to
achieve space synchronization when the human subject is
moving forward, such as walking and running. Gyroscope
readings from multiple mobile devices on a human
subject are used to maintain space synchronization when
the human subject stops moving forward, which means
that we can no longer obtain the consistent
acceleration caused by body moving forward. Experiment
results show that our MOSS scheme can achieve an
average angle deviation of 9.8\degree and an average
measurement similarity of 97\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Agarwal:2018:RBA,
author = "Satyam Agarwal and Swades De",
title = "Rural Broadband Access via Clustered Collaborative
Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2160--2173",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865464",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Broadband penetration in rural areas of the developing
countries is significantly low. The unique challenges
in enabling rural connectivity are sparsity of
population locations and modest income of the
villagers, which induce low return on investment to the
conventional cellular network providers. In this paper,
we propose a novel cluster-based network architecture
and protocols for efficient rural broadband coverage
which requires minimal infrastructure setup by the
service provider. Multiple customer premise equipments
CPEs in a village form clusters and transmit
collaboratively over unused television bands to the
base station. A two-tier uplink access protocol is
proposed and its performance in terms of network
throughput and energy efficiency are obtained
analytically. The cluster size is optimized to maximize
the uplink network throughput and energy-efficiency. A
distributed clustering algorithm is proposed for the
CPEs to form clusters, while channels are allocated to
the clusters using the proposed channel allocation
algorithm to minimize inter-cluster interference. Via
network simulation studies we demonstrate that the
proposed architecture can be cost-effective and
energy-efficient, while being scalable at the same
time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kim:2018:STS,
author = "Seongmin Kim and Juhyeng Han and Jaehyeong Ha and
Taesoo Kim and Dongsu Han",
title = "{SGX-Tor}: a Secure and Practical {Tor} Anonymity
Network With {SGX} Enclaves",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2174--2187",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2868054",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With Tor being a popular anonymity network, many
attacks have been proposed to break its anonymity or
leak information of a private communication on Tor.
However, guaranteeing complete privacy in the face of
an adversary on Tor is especially difficult, because
Tor relays are under complete control of world-wide
volunteers. Currently, one can gain private
information, such as circuit identifiers and hidden
service identifiers, by running Tor relays and can even
modify their behaviors with malicious intent. This
paper presents a practical approach to effectively
enhancing the security and privacy of Tor by utilizing
Intel SGX, a commodity trusted execution environment.
We present a design and implementation of Tor, called
SGX-Tor, that prevents code modification and limits the
information exposed to untrusted parties. We
demonstrate that our approach is practical and
effectively reduces the power of an adversary to a
traditional network-level adversary. Finally, SGX-Tor
incurs moderate performance overhead; the end-to-end
latency and throughput overheads for HTTP connections
are 3.9\% and 11.9\%, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Soule:2018:MLM,
author = "Robert Soule and Shrutarshi Basu and Parisa Jalili
Marandi and Fernando Pedone and Robert Kleinberg and
Emin Gun Sirer and Nate Foster",
title = "{Merlin}: a Language for Managing Network Resources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2188--2201",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867239",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper presents Merlin, a framework for managing
resources in software-defined networks. With Merlin,
administrators express high-level policies using
programs in a declarative language. The language
includes logical predicates to identify sets of
packets, regular expressions to encode forwarding
paths, and arithmetic formulas to specify bandwidth
constraints. The compiler maps these policies into a
constraint problem that determines bandwidth
allocations using parametrizable heuristics. It then
generates a code that can be executed on the network
elements to enforce the policies. To allow network
tenants to dynamically adapt policies to their needs,
Merlin provides mechanisms for delegating control of
sub-policies and for verifying that modifications made
to sub-policies do not violate global constraints.
Experiments demonstrate the expressiveness and
effectiveness of Merlin on realistic scenarios.
Overall, Merlin simplifies network administration by
providing high-level abstractions for specifying and
enforcing network policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Psychas:2018:RAS,
author = "Konstantinos Psychas and Javad Ghaderi",
title = "Randomized Algorithms for Scheduling Multi-Resource
Jobs in the Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2202--2215",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2863647",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of scheduling jobs with
multiple-resource requirements CPU, memory, and disk in
a distributed server platform, motivated by
data-parallel and cloud computing applications. Jobs
arrive dynamically over time and require certain amount
of multiple resources for the duration of their
service. When a job arrives, it is queued and later
served by one of the servers that has sufficient
remaining resources to serve it. The scheduling of jobs
is subject to two constraints: 1 packing constraints:
multiple jobs can be served simultaneously by a single
server if their cumulative resource requirement does
not exceed the capacity of the server, and 2
non-preemption: to avoid costly preemptions, once a job
is scheduled in a server, its service cannot be
interrupted or migrated to another server. Prior
scheduling algorithms rely on either bin packing
heuristics which have low complexity but can have a
poor throughput, or MaxWeight solutions that can
achieve maximum throughput but repeatedly require to
solve or approximate instances of a hard combinatorial
problem Knapsack over time. In this paper, we propose a
randomized scheduling algorithm for placing jobs in
servers that can achieve maximum throughput with low
complexity. The algorithm is naturally distributed and
each queue and each server needs to perform only a
constant number of operations per time unit. Extensive
simulation results, using both synthetic and real
traffic traces, are presented to evaluate the
throughput and delay performance compared to prior
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Maccari:2018:IRC,
author = "Leonardo Maccari and Renato {Lo Cigno}",
title = "Improving Routing Convergence With Centrality: Theory
and Implementation of Pop-Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2216--2229",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865886",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the key features of a routing protocol is its
ability to recover from link or node failures,
recomputing routes efficiently without creating
temporary loops. Indeed, in real conditions, there is
always a trade-off between the overhead due to the
periodic generation of control messages and route
convergence time. This paper formalizes the problem of
the choice of timers for control message generation as
an optimization problem that minimizes the route
convergence time, constrained to a constant signaling
overhead. The solution requires the knowledge of nodes'
centrality in the topology and can be obtained with a
computational complexity low enough to allow on-line
computation of the timers. Results on both synthetic
and real topologies show a significant decrease of the
transient duration with the consequent performance gain
in terms of reduced number of unreachable destinations
and routing loops. Our proposal is general and it can
be applied to enhance any link-state routing protocol,
albeit it is more suited for wireless networks. As a
concrete example, we present the extension of OLSRv2
with our proposal, named Pop-Routing, and discuss its
performance and the stability of centrality metrics in
three large-scale real wireless mesh networks. This
exhaustive analysis on traces of the topology evolution
of real networks for one entire week shows that
pop-routing outperforms the non-enhanced protocol in
every situation, even when it runs with sub-optimal
timers due to centrality computation on stale
information.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qian:2018:GRR,
author = "Zhemin Qian and Fujie Fan and Bing Hu and Kwan L.
Yeung and Liyan Li",
title = "Global Round Robin: Efficient Routing With Cut-Through
Switching in Fat-Tree Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2230--2241",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869532",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fat tree is a scalable and widely deployed data center
network topology. In this paper, a novel framework for
designing per-packet load-balanced routing algorithms
in fat tree called global round robin GRR is proposed.
Routing in fat tree consists of uprouting and
downrouting. In uprouting, a packet is sent to a switch
that is a common ancestor CA of the source server and
the destination. In downrouting, the packet is sent
from the CA switch to the destination. Assume that time
is slotted and each slot can accommodate one packet.
With GRR, in each slot, a connection configuration is
formed by establishing an uprouting path from each
server to a spine switch port such that no paths will
cross each other. Packets are sent from sources to
respective spine switches with cut-through switching.
The connection configuration is updated in a round
robin fashion such that in every $m$ slots, where $m$
is the number of spine switches, each server is
connected to each spine switch exactly once. Since a CA
does not need to be a spine switch, an improved GRR
IGRR is then proposed to allow the nearest CA to
intercept packets for downrouting. We prove that both
GRR and IGRR can guarantee 100\% throughput under a
wide class of traffic. An analytical model is also
constructed for studying their delay performance under
uniform traffic. Finally, simulation results show that
IGRR provides the best delay-throughput performance
among all the existing per-packet load-balanced routing
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2018:WWC,
author = "Tianyuan Sun and Yongcai Wang and Deying Li and
Zhaoquan Gu and Jia Xu",
title = "{WCS}: Weighted Component Stitching for Sparse Network
Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2242--2253",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2866597",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network location is one of the critical issues and a
challenge in wireless sensor and ad hoc networks, in
particular when networks are sparse. However, even in
highly sparse networks, there exist well-connected
subgraphs while the distribution of the networks is
random. This paper introduces weighted component
stitching WCS to find redundantly rigid components with
high redundant ratios, which can be used to generate
reliable local realization. Finding and ranking the
redundantly rigid components is an NP-hard problem a
reduction from maximum quasi-clique. Here, we introduce
a series of theorems and algorithms to carry out WCS
efficiently. More precisely, we prove that each graph
has a determinant number of redundantly rigid
components, each redundantly rigid component is covered
by a set of basic redundant components BRCs, and each
BRC contains one redundant edge. We apply constraints
to merge the BRCs to form components with higher
redundancy ratio and develop a greedy algorithm to
merge BRCs to form locally mostly redundant components
LMRCs. Finally, we give the approximation ratio. The
local coordinates of nodes are calculated by
optimization in each LMRC and are synchronized with
weights to produce the global coordinates of nodes in
the network to overcome the sparseness of subgraphs.
Extensive experiments demonstrate significant
improvements in accuracy 45\%--64\% using our WCS
method over the state-of-the-art algorithms under
various settings of network sparseness and ranging
noises.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2018:LCC,
author = "Jianyuan Lu and Tong Yang and Yi Wang and Huichen Dai
and Xi Chen and Linxiao Jin and Haoyu Song and Bin
Liu",
title = "Low Computational Cost {Bloom} Filters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2254--2267",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Bloom filters BFs are widely used in many network
applications but the high computational cost limits the
system performance. In this paper, we introduce a low
computational cost Bloom filter named One-Hashing Bloom
filter OHBF to solve the problem. The OHBF requires
only one base hash function plus a few simple modulo
operations to implement a Bloom filter. While keeping
nearly the same theoretical false positive ratio as a
Standard Bloom filter SBF, the OHBF significantly
reduces the computational overhead of the hash
functions. We show that the practical false positive
ratio of an SBF implementation strongly relies on the
selection of hash functions, even if these hash
functions are considered good. In contrast, the
practical false positive ratio of an OHBF
implementation is consistently close to its theoretical
bound. The stable false positive performance of the
OHBF can be precisely derived from a proved
mathematical foundation. As the OHBF has reduced
computational overhead, it is ideal for high throughput
and low-latency applications. We use a case study to
show the advantages of the OHBF. In a BF-based FIB
lookup system, the lookup throughput of OHBF-based
solution can achieve twice as fast as the SBF-based
solution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dabaghchian:2018:OLR,
author = "Monireh Dabaghchian and Amir Alipour-Fanid and Kai
Zeng and Qingsi Wang and Peter Auer",
title = "Online Learning With Randomized Feedback Graphs for
Optimal {PUE} Attacks in Cognitive Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2268--2281",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2868166",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a cognitive radio network, a secondary user learns
the spectrum environment and dynamically accesses the
channel, where the primary user is inactive. At the
same time, a primary user emulation PUE attacker can
send falsified primary user signals and prevent the
secondary user from utilizing the available channel.
The best attacking strategies that an attacker can
apply have not been well studied. In this paper, for
the first time, we study optimal PUE attack strategies
by formulating an online learning problem, where the
attacker needs to dynamically decide the attacking
channel in each time slot based on its attacking
experience. The challenge in our problem is that since
the PUE attack happens in the spectrum sensing phase,
the attacker cannot observe the reward on the attacked
channel. To address this challenge, we utilize the
attacker's observation capability. We propose online
learning-based attacking strategies based on the
attacker's observation capabilities. Through our
analysis, we show that with no observation within the
attacking slot, the attacker loses on the regret order,
and with the observation of at least one channel, there
is a significant improvement on the attacking
performance. Observation of multiple channels does not
give additional benefit to the attacker only a constant
scaling though it gives insight on the number of
observations required to achieve the minimum constant
factor. Our proposed algorithms are optimal in the
sense that their regret upper bounds match their
corresponding regret lower bounds. We show consistency
between simulation and analytical results under various
system parameters.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2018:FAD,
author = "Anfu Zhou and Teng Wei and Xinyu Zhang and Huadong
Ma",
title = "{FastND}: Accelerating Directional Neighbor Discovery
for {60-GHz} Millimeter-Wave Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2282--2295",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Neighbor discovery ND is a critical primitive for
60-GHz wireless networks with highly directional
radios. Prior work has attempted to improve the ND
efficiency but overlooks the unique properties of
60-GHz phased-array antennas and spatial channel
profile. In this paper, we first conduct a systematic
study of the ND problem using a reconfigurable 60-GHz
radio. Combined with an analytical model, we find that
environmental characteristics and client mobility
substantially affect 60-GHz ND latency, and due to
inherent spatial channel sparsity of 60-GHz channels,
even short-distance links can experience intolerable
latency. To solve these new challenges, we propose a
mechanism called FastND that accelerates ND by actively
learning the spatial channel profile. FastND leverages
steerability of 60-GHz phased-array antennas and
accumulates channel information by overhearing beacon
preambles along different beam directions. Using a
compressive sensing framework, together with a
strategical beam selection mechanism, FastND can infer
the strongest spatial angle to listen to, thereby
increasing the likelihood to quickly decode beacons and
achieve ND. Our testbed experiments and ray-tracing
tests demonstrate that FastND can reduce 802.11ad ND
latency to 1/10--1/2, with different levels of
mobility, human blockage, environmental sparsity, and
non-line-of-sight links.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Raviv:2018:MSR,
author = "Li-On Raviv and Amir Leshem",
title = "Maximizing Service Reward for Queues With Deadlines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2296--2308",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider a real-time queuing system
with rewards and deadlines. We assume that the packet
processing time is known upon arrival, as is the case
in communication networks. This assumption allows us to
demonstrate that the well-known earliest-deadline-first
policy performance can be improved. We then propose a
scheduling policy that provides excellent results for
packets with rewards and deadlines. We prove that the
policy is optimal under deterministic service time and
binomial reward distribution. In the more general case,
we prove that the policy processes the maximal number
of packets while collecting rewards higher than the
expected reward. We present simulation results that
show its high performance in more generic cases
compared to the most commonly used scheduling
policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:DJI,
author = "Chunpu Wang and Chen Feng and Julian Cheng",
title = "Distributed Join-the-Idle-Queue for Low Latency Cloud
Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2309--2319",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869092",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Low latency is highly desirable for cloud services. To
achieve a low response time, stringent timing
requirements are needed for task scheduling in a
large-scale server farm spanning thousands of servers.
In this paper, we conduct an in-depth analysis for
distributed Join-the-Idle-Queue JIQ, a promising new
approximation of an idealized task-scheduling
algorithm. In particular, we derive semi-closed form
expressions for the delay performance of distributed
JIQ, and we propose a new variant of distributed JIQ
that offers clear advantages over alternative
algorithms for large systems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2018:CHM,
author = "Yonglong Zhang and Konstantinos Psounis",
title = "Consistently High {MIMO} Rates via Switched-Beam
Antennas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2320--2333",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867576",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The demand for wireless bandwidth is rising to
unprecedented levels. The industry has responded with
the inclusion of advanced PHY techniques, most notably
multi-user MU MIMO, in the most recent Wi-Fi and LTE
standards. However, despite the theoretical promise for
large multiplexing gains, in practice the rate gains
are modest due to a combination of large overhead to
collect channel state information and
not-so-well-conditioned channel matrices. In this
paper, we propose to replace omni-directional antennas
with inexpensive switched-beam antennas to produce
well-conditioned channel matrices for MU-MIMO purposes
with very low overhead. Remarkably, the experimental
results with both software-defined radios and
commercial Wi-Fi chipsets show that, when appropriate
antenna modes are used, this leads to a $ 3.5 \times -
5 \times $ average throughput improvement in indoor
environments. What is more, our backward compatible
protocol extension coupled with an efficient algorithm
to select appropriate antenna modes, achieve the
aforementioned gains with almost zero overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hubballi:2018:NTC,
author = "Neminath Hubballi and Mayank Swarnkar",
title = "{BitCoding}: Network Traffic Classification Through
Encoded Bit Level Signatures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2334--2346",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2868816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With many network protocols using obfuscation
techniques to hide their identity, robust methods of
traffic classification are required. In traditional
deep-packet-inspection DPI methods, application
specific signatures are generated with byte-level data
from payload. Increasingly new data formats are being
used to encode the application protocols with bit-level
information which render the byte-level signatures
ineffective. In this paper, we describe BitCoding a
bit-level DPI-based signature generation technique.
BitCoding uses only a small number of initial bits from
a flow and identify invariant bits as signature.
Subsequently, these bit signatures are encoded and
transformed into a newly defined state transition
machine transition constrained counting automata. While
short signatures are efficient for processing, this
will increase the chances of collision and cross
signature matching with increase in number of
signatures applications. We describe a method for
signature similarity detection using a variant of
Hamming distance and propose to increase the length of
signatures for a subset of protocols to avoid overlaps.
We perform extensive experiments with three different
data sets consisting of 537,380 flows with a packet
count of 3,445,969 and show that, BitCoding has very
good detection performance across different types of
protocols text, binary, and proprietary making it
protocol-type agnostic. Further, to understand the
portability of signatures generated we perform cross
evaluation, i.e., signatures generated from one site
are used for testing with data from other sites to
conclude that it will lead to a small compromise in
detection performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:DLL,
author = "Quan Chen and Hong Gao and Zhipeng Cai and Lianglun
Cheng and Jianzhong Li",
title = "Distributed Low-Latency Data Aggregation for
Duty-Cycle Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2347--2360",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2868943",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Data aggregation is an essential operation for the
sink to obtain summary information in a wireless sensor
network WSN. The problem of minimum latency aggregation
schedule MLAS which seeks a fastest and conflict-free
aggregation schedule has been well studied when nodes
are always awake. However, in duty-cycle WSNs, nodes
can only receive data in the active state. In such
networks, it is of great importance to exploit the
limited active time slots to reduce aggregation
latency. Unfortunately, few studies have addressed this
issue, and most previous aggregation methods rely on
fixed structures which greatly limit the exploitation
of the active time slots from neighbors. In this paper,
we investigate the MLAS problem in duty-cycle WSNs
without considering structures. Two distributed
aggregation algorithms are proposed, in which the
aggregation tree and a conflict-free schedule are
generated simultaneously to make use of the active time
slots from all neighbors. Compared with the previous
centralized and distributed methods, the aggregation
latency and the utilization ratio of available time
slots are greatly improved. This paper also proposes
several adaptive strategies for handling network
topology changes without increasing the aggregation
latency. The theoretical analysis and simulation
results verify that the proposed algorithms have high
performance in terms of latency and communication
cost.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sciancalepore:2018:MTI,
author = "Vincenzo Sciancalepore and Ilario Filippini and
Vincenzo Mancuso and Antonio Capone and Albert Banchs",
title = "A Multi-Traffic Inter-Cell Interference Coordination
Scheme in Dense Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2361--2375",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2866410",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper proposes a novel semi-distributed and
practical ICIC scheme based on the Almost Blank
SubFrame ABSF approach specified by 3GPP. We define two
mathematical programming problems for the cases of
guaranteed and best-effort traffic, and use game theory
to study the properties of the derived ICIC distributed
schemes, which are compared in detail against
unaffordable centralized schemes. Based on the analysis
of the proposed models, we define Distributed
Multi-traffic Scheduling DMS, a unified distributed
framework for adaptive interference-aware scheduling of
base stations in future cellular networks, which
accounts for both guaranteed and best-effort traffic.
DMS follows a two-tier approach, consisting of local
ABSF schedulers, which perform the resource
distribution between the guaranteed and best effort
traffic, and a light-weight local supervisor, which
coordinates ABSF local decisions. As a result of such a
two-tier design, DMS requires very light signaling to
drive the local schedulers to globally efficient
operating points. As shown by means of numerical
results, DMS allows to: i maximize radio resources
resue; ii provide requested quality for guaranteed
traffic; iii minimize the time dedicated to guaranteed
traffic to leave room for best-effort traffic; and iv
maximize resource utilization efficiency for the
best-effort traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:PPL,
author = "Xiong Wang and Mehdi Malboubi and Zhihao Pan and Jing
Ren and Sheng Wang and Shizhong Xu and Chen-Nee Chuah",
title = "{ProgLIMI}: Programmable {LInk Metric Identification}
in Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2376--2389",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865892",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose the Programmable LInk Metric
Identification ProgLIMI infrastructure for
software-defined networking SDN networks. ProgLIMI
identifies round-trip link metrics RTLMs from
accumulated end-to-end metrics of selected measurement
paths by leveraging the flexible routing control
capability of SDN networks. ProgLIMI mainly solves
three sub-problems: 1 monitor placement; 2 linearly
independent measurement path construction; and 3 flow
rule design. To reduce measurement cost, ProgLIMI tries
to minimize the number of required monitors and flow
rules. In this paper, we address the three sub-problems
for both full and hybrid SDN networks. For full SDN
networks, ProgLIMI can achieve full RTLM identification
using only one monitor and two flow rules in each SDN
switch. In contrast, the RTLM identification in hybrid
SDN networks is more complicated due to the routing
constraint of hybrid SDN networks. We first prove that
the monitor placement problem in hybrid SDN networks is
NP-hard. We then formulate the monitor placement and
measurement path selection problem in hybrid SDN
networks and propose a greedy heuristic algorithm to
solve the problem efficiently. Our evaluations on both
physical testbed and simulation platform reveal that
ProgLIMI can accurately identify the RTLMs delay and
loss rate. Besides, ProgLIMI is also resource
efficient, i.e., it only requires two flow rules in
each SDN switch and a small number of monitors, and the
extra probing traffic load incurred by ProgLIMI is also
low.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghasempour:2018:DBS,
author = "Yasaman Ghasempour and Muhammad Kumail Haider and
Edward W. Knightly",
title = "Decoupling Beam Steering and User Selection for
{MU--MIMO} {60-GHz} {WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2390--2403",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2866037",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Multi-user transmission at 60 GHz promises to increase
the throughput of next-generation WLANs via both analog
and digital beamforming. To maximize the capacity,
analog beams need to be jointly configured with user
selection and digital weights; however, joint
maximization requires prohibitively large training and
feedback overhead. In this paper, we scale multi-user
60-GHz WLAN throughput via design of a low-complexity
structure for decoupling beam steering and user
selection such that analog beam training precedes user
selection. We introduce a two-class framework
comprising: 1 single-shot selection of users by
minimizing overlap of their idealized beam patterns
obtained from analog training and 2 interference-aware
incremental addition of users via sequential training
to better predict inter-user interference. We implement
a programmable testbed using software-defined radios
and commercial 60-GHz transceivers and conduct
over-the-air measurements to collect channel traces for
different indoor WLAN deployments. Measurements are
conducted using a 12-element phased antenna array as
well as horn antennas with different directivity gains
to evaluate the performance of practical 60-GHz
systems. Using trace-based emulations and high
resolution 60-GHz channel models, we show that our
decoupling structure experiences less than 5\%
performance loss compared with maximum achievable rates
via joint user-beam selection.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2018:BFS,
author = "Zhao Zhang and Weili Wu and Jing Yuan and Ding-Zhu
Du",
title = "Breach-Free Sleep-Wakeup Scheduling for Barrier
Coverage With Heterogeneous Wireless Sensors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2404--2413",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867156",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Barrier Coverage plays a vital role in wireless sensor
networks. Research on barrier coverage has mainly
focused on the lifetime maximization and the critical
conditions to achieve $k$ -Barrier Coverage under
various sensing models. When sensors are randomly
deployed along the boundary of an area of interest,
they may form several disjoint barrier covers. To
maximize the lifetime of barrier coverage, those
barrier covers need to be scheduled to avoid a security
problem, call breach. In a heterogeneous wireless
sensor network, given a set of barrier-covers each with
a lifetime, we study the problem of finding a
lifetime-maximizing subset with a breach-free
sleep-wakeup scheduling. We first prove that it can be
judged in polynomial time whether a given sleep-wakeup
schedule is breach-free or not, but given a set of
barrier-covers, it is NP-Complete to determine whether
there exists a breach-free schedule. Then, we show that
the problem of finding a lifetime-maximizing
breach-free schedule is equivalent to the maximum node
weighted path problem in a directed graph, and design a
parameterized algorithm. Experimental results show that
our algorithm significantly outperforms the heuristics
proposed 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{Ge:2018:HTF,
author = "Mengyao Ge and Douglas M. Blough",
title = "High Throughput and Fair Scheduling for Multi-{AP}
Multiuser {MIMO} in Dense Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2414--2427",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2867582",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the fair scheduling problem for
dense wireless networks with access point cooperation
and multiple-input-multiple-output MIMO links. The
problem is to maximize the aggregate throughput subject
to a fairness constraint that is general enough to
capture many different fairness objectives. We formally
specify a non-convex optimization problem that captures
all aspects of the problem setting, and we propose two
algorithms to approximate its solution. The first
algorithm jointly optimizes the selection of user sets,
MIMO precoders, and assignment of user sets to time
slots. The second algorithm separately optimizes first
user sets and MIMO precoders and second assignment of
user sets to time slots. The first algorithm guarantees
perfect fairness and produces a local optimum or a
saddle point for aggregate throughput at a fairly high
computational cost. The second algorithm also
guarantees perfect fairness and produces optimal
aggregate throughput for a given set of possibly
non-optimal user sets while having lower computational
complexity. The second algorithm also has a parameter
that allows throughput and fairness to be traded off
for situations where maximizing throughput is critical
and approximate fairness is acceptable. Analyses are
complemented by simulation results, which show that: 1
the first algorithm produces significantly higher
aggregate throughput than known approaches with a
running time that is practical for scenarios with up to
50 users and 2 the second algorithm produces aggregate
throughput that is very close to existing heuristics
while having significantly lower running time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dai:2018:IEP,
author = "Haipeng Dai and Muhammad Shahzad and Alex X. Liu and
Meng Li and Yuankun Zhong and Guihai Chen",
title = "Identifying and Estimating Persistent Items in Data
Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2429--2442",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2865125",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper addresses the fundamental problem of
finding persistent items and estimating the number of
times each persistent item occurred in a given data
stream during a given period of time at any given
observation point. We propose a novel scheme, PIE, that
can not only accurately identify each persistent item
with a probability greater than any desired false
negative rate FNR, but can also accurately estimate the
number of occurrences of each persistent item. The key
idea of PIE is that it uses Raptor codes to encode the
ID of each item that appears at the observation point
during a measurement period and stores only a few bits
of the encoded ID in the memory. The item that is
persistent occurs in enough measurement periods that
enough encoded bits for the ID can be retrieved from
the observation point to decode them correctly and get
the ID of the persistent item. To estimate the number
of occurrences of any given persistent item, PIE uses
maximum likelihood estimation-based statistical
techniques on the information already recorded during
the measurement periods. We implemented and evaluated
PIE using three real network traffic traces and
compared its performance with three prior schemes. Our
results show that PIE not only achieves the desire FNR
in every scenario, its average FNR can be 19.5 times
smaller than the FNR of the adapted prior scheme. Our
results also show that PIE achieves any desired success
probability in estimating the number of occurrences of
persistent items.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2018:CTA,
author = "Ning Wu and Yingjie Bi and Nithin Michael and Ao Tang
and John C. Doyle and Nikolai Matni",
title = "A Control-Theoretic Approach to In-Network Congestion
Management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2443--2456",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2866785",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "WANs are often over-provisioned to accommodate
worst-case operating conditions, with many links
typically running at only around 30\% capacity. In this
paper, we show that in-network congestion management
can play an important role in increasing network
utilization. To mitigate the effects of in-network
congestion caused by rapid variations in traffic
demand, we propose using high-frequency traffic control
HFTraC algorithms that exchange real-time flow rate and
buffer occupancy information between routers to
dynamically coordinate their link-service rates. We
show that the design of such dynamic link-service rate
policies can be cast as a distributed optimal control
problem that allows us to systematically explore an
enlarged design space of in-network congestion
management algorithms. This also provides a means of
quantitatively comparing different controller
architectures: we show, perhaps surprisingly, that
centralized control is not always better. We implement
and evaluate HFTraC in the face of rapidly varying UDP
and TCP flows and in combination with AQM algorithms.
Using a custom experimental testbed, a Mininet
emulator, and a production WAN, we show that HFTraC
leads to up to 66\% decreases in packet loss rates at
high link utilizations as compared to FIFO policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2018:TTO,
author = "Kun Chen and Longbo Huang",
title = "Timely-Throughput Optimal Scheduling With Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2457--2470",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869583",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Motivated by the increasing importance of providing
delay-guaranteed services in general computing and
communication systems, and the recent wide adoption of
learning and prediction in network control, in this
paper, we consider a general stochastic single-server
multi-user system and investigate the fundamental
benefit of predictive scheduling in improving
timely-throughput, being the rate of packets that are
delivered to destinations before their deadlines. By
adopting an error rate based prediction model, we first
derive a Markov decision process MDP solution to
optimize the timely-throughput objective subject to an
average resource consumption constraint. Based on a
packet-level decomposition of the MDP, we explicitly
characterize the optimal scheduling policy and
rigorously quantify the timely-throughput improvement
due to predictive-service, which scales as $ \Theta
p[C_1 {a - a_{\max }q} \rho^{\tau } / {p - q} + C_21 -
{1} / {p}]1 - \rho^D $, where $ a, a_{\max }, \rho \in
0, 1, C_1 > 0, C_2 \ge 0 $ are constants, $p$ is the
true-positive rate in prediction, $q$ is the
false-negative rate, $ \tau $ is the packet deadline,
and $D$ is the prediction window size. We also conduct
extensive simulations to validate our theoretical
findings. Our results provide novel insights into how
prediction and system parameters impact performance and
provide useful guidelines for designing predictive
low-latency control algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sermpezis:2018:ANB,
author = "Pavlos Sermpezis and Vasileios Kotronis and Petros
Gigis and Xenofontas Dimitropoulos and Danilo Cicalese
and Alistair King and Alberto Dainotti",
title = "{ARTEMIS}: Neutralizing {BGP} Hijacking Within a
Minute",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2471--2486",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869798",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Border gateway protocol BGP prefix hijacking is a
critical threat to Internet organizations and users.
Despite the availability of several defense approaches
ranging from RPKI to popular third-party services, none
of them solves the problem adequately in practice. In
fact, they suffer from: i lack of detection
comprehensiveness, allowing sophisticated attackers to
evade detection; ii limited accuracy, especially in the
case of third-party detection; iii delayed verification
and mitigation of incidents, reaching up to days; and
iv lack of privacy and of flexibility in post-hijack
counteractions, on the side of network operators. In
this paper, we propose ARTEMIS, a defense approach a
based on accurate and fast detection operated by the
autonomous system itself, leveraging the pervasiveness
of publicly available BGP monitoring services and their
recent shift towards real-time streaming and thus b
enabling flexible and fast mitigation of hijacking
events. Compared to the previous work, our approach
combines characteristics desirable to network
operators, such as comprehensiveness, accuracy, speed,
privacy, and flexibility. Finally, we show through
real-world experiments that with the ARTEMIS approach,
prefix hijacking can be neutralized within a minute.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sim:2018:OCA,
author = "Gek Hong Sim and Sabrina Klos and Arash Asadi and Anja
Klein and Matthias Hollick",
title = "An Online Context-Aware Machine Learning Algorithm for
{$5$G} {mmWave} Vehicular Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2487--2500",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869244",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Millimeter-Wave mmWave bands have become the de-facto
candidate for 5G vehicle-to-everything V2X since future
vehicular systems demand Gbps links to acquire the
necessary sensory information for semi-autonomous
driving. Nevertheless, the directionality of mmWave
communications and its susceptibility to blockage raise
severe questions on the feasibility of mmWave vehicular
communications. The dynamic nature of 5G vehicular
scenarios and the complexity of directional mmWave
communication calls for higher context-awareness and
adaptability. To this aim, we propose an online
learning algorithm addressing the problem of beam
selection with environment-awareness in mmWave
vehicular systems. In particular, we model this problem
as a contextual multi-armed bandit problem. Next, we
propose a lightweight context-aware online learning
algorithm, namely fast machine learning FML, with
proven performance bound and guaranteed convergence.
FML exploits coarse user location information and
aggregates the received data to learn from and adapt to
its environment. Furthermore, we demonstrate the
feasibility of a real-world implementation of FML by
proposing a standard-compliant protocol based on the
existing architecture of cellular networks and the
forthcoming features of 5G. We also perform an
extensive evaluation using realistic traffic patterns
derived from Google Maps. Our evaluation shows that FML
enables mmWave base stations to achieve near-optimal
performance on average within 33 mins of deployment by
learning from the available context. Moreover, FML
remains within $ \approx 5 \% $ of the optimal
performance by swift adaptation to system changes i.e.,
blockage, traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Krishnasamy:2018:AMW,
author = "Subhashini Krishnasamy and P. T. Akhil and Ari
Arapostathis and Rajesh Sundaresan and Sanjay
Shakkottai",
title = "Augmenting Max-Weight With Explicit Learning for
Wireless Scheduling With Switching Costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2501--2514",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869874",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In small-cell wireless networks where users are
connected to multiple base stations BSs, it is often
advantageous to switch OFF dynamically a subset of BSs
to minimize energy costs. We consider two types of
energy cost: 1 the cost of maintaining a BS in the
active state and 2 the cost of switching a BS from the
active state to inactive state. The problem is to
operate the network at the lowest possible energy cost
sum of activation and switching costs subject to queue
stability. In this setting, the traditional approach
--- a Max-Weight algorithm along with a Lyapunov-based
stability argument --- does not suffice to show queue
stability, essentially due to the temporal co-evolution
between channel scheduling and the BS activation
decisions induced by the switching cost. Instead, we
develop a learning and BS activation algorithm with
slow temporal dynamics, and a Max-Weight-based channel
scheduler that has fast temporal dynamics. We show that
using convergence of time-inhomogeneous Markov chains,
that the co-evolving dynamics of learning, BS
activation and queue lengths lead to near optimal
average energy costs along with queue stability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2018:UUR,
author = "Yi Gao and Yuan Jing and Wei Dong",
title = "{UniROPE}: Universal and Robust Packet Trajectory
Tracing for Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2515--2527",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2871213",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Knowing the trajectory of each packet in a network
enables a large range of network debugging and
management tasks. Existing packet trajectory tracing
approaches for software-defined networking SDN either
require high message/computational overhead or only
focus on one kind of network topology. In this paper,
we propose UniROPE, a robust and lightweight packet
trajectory tracing approach that supports various
network topologies. Using the flow information, UniROPE
dynamically selects one of the two proposed packet
trajectory tracing algorithms to achieve a better
tradeoff between accuracy and efficiency. We implement
UniROPE using P4, a high-level language for programming
SDN switch operations, and evaluate its performance in
networks with different topologies, scales, and link
failure probabilities. Results show that UniROPE
achieves a high successful ratio of packet trajectory
tracing with small message/computational overheads in
various networks. We also use three case studies to
show the effectiveness of the traced packet trajectory
information for network debugging and management.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zheng:2018:SMT,
author = "Jiaxiao Zheng and Pablo Caballero and Gustavo de
Veciana and Seung Jun Baek and Albert Banchs",
title = "Statistical Multiplexing and Traffic Shaping Games for
Network Slicing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2528--2541",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2870184",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Next-generation wireless architectures are expected to
enable slices of shared wireless infrastructure, which
are customized to specific mobile operators/services.
Given infrastructure costs and the stochastic nature of
mobile services' spatial loads, it is highly desirable
to achieve efficient statistical multiplexing among
such slices. We study a simple dynamic resource sharing
policy, which allocates a ``share'' of a pool of
distributed resources to each slice-share constrained
proportionally fair SCPF. We give a characterization of
SCPF's performance gains over static slicing and
general processor sharing. We show that higher gains
are obtained when a slice's spatial load is more
``imbalanced'' than, and/or ``orthogonal'' to, the
aggregate network load, and that the overall gain
across slices is positive. We then address the
associated dimensioning problem. Under SCPF,
traditional network dimensioning translates to a
coupled share dimensioning problem, which characterizes
the existence of a feasible share allocation, given
slices' expected loads and performance requirements. We
provide a solution to robust share dimensioning for
SCPF-based network slicing. Slices may wish to
unilaterally manage their users' performance via
admission control, which maximizes their carried loads
subject to performance requirements. We show that this
can be modeled as a ``traffic shaping'' game with an
achievable Nash equilibrium. Under high loads, the
equilibrium is explicitly characterized, as are the
gains in the carried load under SCPF versus static
slicing. Detailed simulations of a wireless
infrastructure supporting multiple slices with
heterogeneous mobile loads show the fidelity of our
models and the range of validity of our high-load
equilibrium analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2018:DCM,
author = "Yuanjie Li and Chunyi Peng and Haotian Deng and
Zengwen Yuan and Guan-Hua Tu and Jiayao Li and Songwu
Lu and Xi Li",
title = "Device-Customized Multi-Carrier Network Access on
Commodity {Smartphones}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2542--2555",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2869492",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Accessing multiple carrier networks T-Mobile, Sprint,
AT\&T, and so on offers a promising paradigm for
smartphones to boost its mobile network quality.
However, the current practice does not achieve the full
potential of this approach because it has not utilized
fine-grained, cellular-specific domain knowledge. Our
experiments and code analysis discover three
implementation-independent issues: 1 it may not trigger
the anticipated switch when the serving carrier network
is poor; 2 the switch takes a much longer time than
needed; and 3 the device fails to choose the
high-quality network e.g., selecting 3G rather than 4G.
To address them, we propose iCellular, which exploits
low-level cellular information at the device to improve
multi-carrier access. iCellular is proactive and
adaptive in its multi-carrier selection by leveraging
existing end-device mechanisms and standards-complaint
procedures. It performs adaptive monitoring to ensure
responsive selection and minimal service disruption and
enhances carrier selection with online learning and
runtime decision fault prevention. It is readily
deployable on smartphones without
infrastructure/hardware modifications. We implement
iCellular on commodity phones and harness the efforts
of Project Fi to assess multi-carrier access over two
U.S. carriers: T-Mobile and Sprint. Our evaluation
shows that, iCellular boosts the devices' throughput
with up to $ 3.74 \times $ throughput improvement, $
6.9 \times $ suspension reduction, and $ 1.9 \times $
latency decrement over the state of the art, with
moderate CPU, and memory and energy overheads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Joo:2018:WSI,
author = "Changhee Joo and Atilla Eryilmaz",
title = "Wireless Scheduling for Information Freshness and
Synchrony: Drift-Based Design and Heavy-Traffic
Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2556--2568",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2870896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of scheduling in wireless
networks with the aim of maintaining up-to-date and
synchronized also called, aligned information at the
receiver across multiple flows. This is in contrast to
the more conventional approach of scheduling for
optimizing long-term performance metrics such as
throughput, fairness, or average delay. Maintaining the
age of information at a low and roughly equal level is
particularly important for distributed cyber-physical
systems, in which the effectiveness of the control
decisions depends critically on the freshness and
synchrony of information from multiple sources/sensors.
In this paper, we first expose the weakness of several
popular MaxWeight scheduling solutions that utilize
queue-length, delay, and age information as their
weights. Then, we develop a novel age-based scheduler
that combines age with the interarrival times of
incoming packets in its decisions, which yields
significant gains in the information freshness at the
receiver. We characterize the performance of our
strategy through a heavy-traffic analysis that
establishes upper and lower bounds on the freshness of
system information.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ludwig:2018:TPC,
author = "Arne Ludwig and Szymon Dudycz and Matthias Rost and
Stefan Schmid",
title = "Transiently Policy-Compliant Network Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2569--2582",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2871023",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Computer networks have become a critical
infrastructure. It is hence increasingly important to
guarantee a correct, consistent, and secure network
operation at any time, even during route updates.
However, most existing works on consistent network
update protocols focus on connectivity properties only
e.g., loop-freedom while ignoring basic security
policies. This paper studies how to update routes in a
software-defined network in a transiently
policy-compliant manner. In particular, our goal is to
enforce waypoints: at no point in time should it be
possible for packets to bypass security critical
network functions such as a firewall. This problem is
timely, given the advent of network function
virtualization which envisions more flexible middlebox
deployments, not limited to the network edge. This
paper shows that enforcing waypoint traversal in
transient states can be challenging: waypoint
enforcement can conflict with loop-freedom. Even worse,
we rigorously prove that deciding whether a waypoint
enforcing, loop-free network update schedule exists is
NP-hard. These results hold for both kinds of
loop-freedom used in the literature: strong and relaxed
loop-freedom. This paper also presents optimized, exact
mixed integer programs to decide feasibility quickly
and to compute optimal update schedules. We report on
extensive simulation results, and also study scenarios
where entire ``service chains,'' connecting multiple
waypoints, need to be updated consistently.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borokhovich:2018:LOL,
author = "Michael Borokhovich and Yvonne-Anne Pignolet and
Stefan Schmid and Gilles Tredan",
title = "Load-Optimal Local Fast Rerouting for Dense Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2583--2597",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2871089",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Reliable and highly available computer networks must
implement resilient fast rerouting mechanisms: upon a
link or node failure, an alternative route is
determined quickly, without involving the network
control plane. Designing such fast failover mechanisms
capable of dealing with multiple concurrent failures,
however, is challenging, as failover rules need to be
installed proactively, i.e., ahead of time, without
knowledge of the actual failures happening at runtime.
Indeed, only little is known today about the design of
resilient routing algorithms. This paper introduces a
general framework to reason about and design local
failover algorithms that minimize the resulting load
after failover on dense networks, beyond
destination-based routing. We show that due to the
inherent locality of the failover decisions at runtime,
the problem is fundamentally related to the field of
distributed algorithms without coordination. We derive
an intriguing lower bound on the inherent network load
overhead any local fast failover scheme that will
introduce in the worst case, even though globally seen,
much more balanced traffic allocations exist. We then
present different randomized and deterministic failover
algorithms and analyze their overhead load. In
particular, we build upon the theory of combinatorial
designs and develop a novel deterministic failover
mechanism based on symmetric block design theory, which
tolerates a maximal number of link failures while
ensuring low loads.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ding:2018:IDT,
author = "Haichuan Ding and Xuanheng Li and Ying Cai and Beatriz
Lorenzo and Yuguang Fang",
title = "Intelligent Data Transportation in Smart Cities: a
Spectrum-Aware Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2598--2611",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2871667",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Communication technologies supply the blood for smart
city applications. In view of the ever-increasing
wireless traffic generated in smart cities and our
already congested radio access networks RANs, we have
recently designed a data transportation network, the
vehicular cognitive capability harvesting network
V-CCHN, which exploits the harvested spectrum
opportunity and the mobility opportunity offered by the
massive number of vehicles traveling in the city to not
only offload delay-tolerant data from congested RANs
but also support delay-tolerant data transportation for
various smart-city applications. To make data
transportation efficient, in this paper, we develop a
spectrum-aware SA data transportation scheme based on
Markov decision processes. Through extensive
simulations, we demonstrate that, with the developed
data transportation scheme, the V-CCHN is effective in
offering data transportation services despite its
dependence on dynamic resources, such as vehicles and
harvested spectrum resources. The simulation results
also demonstrate the superiority of the SA scheme over
existing schemes. We expect the V-CCHN to well
complement existing telecommunication networks in
handling the exponentially increasing wireless data
traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2018:SDS,
author = "Reuven Cohen and Evgeny Moroshko",
title = "Sampling-on-Demand in {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2612--2622",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2873816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sampling is an expensive network resource, because
switches and routers are able to sample only a small
fraction of the traffic they receive. Modern switches
and routers perform uniform packet sampling, which has
several major drawbacks: 1 the same flow might be
unnecessarily sampled multiple times in different
switches; 2 all the flows traversing a switch whose
sampling module is activated are sampled at the same
rate; and 3 the sampling rate is fixed, even if the
volume of the traffic changes. For the first time, we
propose a sampling-on-demand monitoring framework. The
proposed framework, presented as a component of
software defined network SDN, adds a sampling
management module to the SDN controller. This module
allows the controller to determine the sampling rate of
each flow at each switch, according to the monitoring
goals of the network operator, while taking into
account the monitoring capabilities of the switch. As
part of the proposed framework, the paper defines a new
optimization problem called sampling allocation
problem, which has to be solved by the sampling
management module in order to maximize the total
sampling utility. The paper presents online and offline
algorithms for solving this problem. It also presents
three real network management applications, executed
over Mininet, which are shown to significantly benefit
from the proposed framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Saha:2018:OAL,
author = "Gourav Saha and Alhussein A. Abouzeid and Marja
Matinmikko-Blue",
title = "Online Algorithm for Leasing Wireless Channels in a
Three-Tier Spectrum Sharing Framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2623--2636",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2877184",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The three-tier spectrum sharing framework 3-TSF is a
spectrum sharing model adopted by the Federal
Communications Commission. According to this model,
under-utilized federal spectrum like the Citizens
Broadband Radio Service band is released for shared use
where the highest preference is given to Tier-1
followed by Tier-2 T2 and then Tier-3 T3. In this
paper, we study how a wireless operator, who is
interested in maximizing its profit, can strategically
operate as a T2 and/or a T3 user. T2 is characterized
by paid but ''almost'' guaranteed and interference-free
channel access while T3 access is free but has the
lesser guarantee and also faces channel interference.
So the operator has to optimally decide between paid
but better channel quality and free but uncertain
channel quality. Also, the operator has to make these
decisions without knowing future market variables like
customer demand or channel availability. The main
contribution of this paper is a deterministic online
algorithm for leasing channels that has finite
competitive ratio, low time complexity, and that does
not rely on the knowledge of market statistics. Such
algorithms are desirable in the early stages of the
deployment of 3-TSF because the knowledge of market
statistics may be rather inaccurate. We use tools from
the ski-rental literature to design the online
algorithm. The online optimization problem for leasing
channels is a novel generalization of the ski-rental
problem. We, therefore, make fundamental contributions
to the ski-rental literature, the applications of which
extend beyond this paper. We also conduct simulations
using synthetic traces to compare our online algorithm
with the benchmark and 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{Kadota:2018:SPM,
author = "Igor Kadota and Abhishek Sinha and Elif
Uysal-Biyikoglu and Rahul Singh and Eytan Modiano",
title = "Scheduling Policies for Minimizing Age of Information
in Broadcast Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2637--2650",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2873606",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider a wireless broadcast
network with a base station sending time-sensitive
information to a number of clients through unreliable
channels. The Age of Information AoI, namely the amount
of time that elapsed since the most recently delivered
packet was generated, captures the freshness of the
information. We formulate a discrete-time decision
problem to find a transmission scheduling policy that
minimizes the expected weighted sum AoI of the clients
in the network. We first show that in symmetric
networks, a greedy policy, which transmits the packet
for the client with the highest current age, is
optimal. For general networks, we develop three
low-complexity scheduling policies: a randomized
policy, a Max-Weight policy and a Whittle's Index
policy, and derive performance guarantees as a function
of the network configuration. To the best of our
knowledge, this is the first work to derive performance
guarantees for scheduling policies that attempt to
minimize AoI in wireless networks with unreliable
channels. Numerical results show that both the
Max-Weight and Whittle's Index policies outperform the
other scheduling policies in every configuration
simulated, and achieve near optimal performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Guo:2018:ECO,
author = "Fengxian Guo and Heli Zhang and Hong Ji and Xi Li and
Victor C. M. Leung",
title = "An Efficient Computation Offloading Management Scheme
in the Densely Deployed Small Cell Networks With Mobile
Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2651--2664",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2873002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To tackle the contradiction between the computation
intensive applications and the resource-hungry mobile
user equipments UEs, mobile edge computing MEC has been
provisioned as a promising solution, which enables the
UEs to offload the tasks to the MEC servers.
Considering the characteristics of small cell networks
SCNs, integrating MEC into SCNs is natural. But in
terms of the high interference, multi-access property,
and limited resources of small cell base stations SBSs,
an efficient computation offloading scheme is
essential. However, there still lack comprehensive
studies on this problem in the densely deployed SCNs.
In this paper, we study the energy-efficient
computation offloading management scheme in the MEC
system with SCNs. The aim of this paper is to minimize
the energy consumption of all UEs via jointly
optimizing computation offloading decision making,
spectrum, power, and computation resource allocation.
Specially, the UEs need not only to decide whether to
offload but also to determine where to offload. First,
we present the computation offloading model and
formulate this problem as a mix integer non-linear
programming problem, which is NP-hard. Taking
advantages of genetic algorithm GA and particle swarm
optimization PSO, we design a suboptimal algorithm
named as hierarchical GA and PSO-based computation
algorithm to solve this problem. Finally, the
convergence of this algorithm is studied by simulation,
and the performance of the proposed algorithm is
verified by comparing with the other baseline
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garcia-Saavedra:2018:OOO,
author = "Andres Garcia-Saavedra and Paul Patras and Victor
Valls and Xavier Costa-Perez and Douglas J. Leith",
title = "{ORLA\slash OLAA}: Orthogonal Coexistence of {LAA} and
{WiFi} in Unlicensed Spectrum",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2665--2678",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2876590",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Future mobile networks will exploit unlicensed
spectrum to boost capacity and meet growing user
demands cost-effectively. The 3rd Generation
Partnership Project 3GPP has recently defined a License
Assisted Access LAA scheme to enable global Unlicensed
LTE U-LTE deployment, aiming at 1 ensuring fair
coexistence with incumbent WiFi networks, i.e.,
impacting on their performance no more than another
WiFi device; and 2 achieving superior airtime
efficiency as compared with WiFi. We show the
standardized LAA fails to simultaneously fulfill these
objectives, and design an alternative orthogonal
collision-free listen-before-talk coexistence paradigm
that provides a substantial improvement in performance,
yet imposes no penalty on existing WiFi networks. We
derive two optimal transmission policies, ORLA and
OLAA, that maximize LAA throughput in both asynchronous
and synchronous i.e., with alignment to licensed anchor
frame boundaries modes of operation, respectively. We
present a comprehensive evaluation through which we
demonstrate that, when aggregating packets, IEEE
802.11ac WiFi can be more efficient than LAA, whereas
our proposals attains 100\% higher throughput, without
harming WiFi. We further show that long U-LTE frames
incur up to 92\% throughput losses on WiFi when using
3GPP LAA, whilst ORLA/OLAA sustain $ > 200 $ \% gains
at no cost, even in the presence of non-saturated WiFi
and/or in multi-rate scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chowdhery:2018:ACP,
author = "Aakanksha Chowdhery and Kyle Jamieson",
title = "Aerial Channel Prediction and User Scheduling in
Mobile Drone Hotspots",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2679--2692",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2878287",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we investigate the aerial wireless
channel, where a moving drone is deployed to stream
content to a set of mobile clients on the ground over a
small cell size. Experimental traces collected over
more than twenty flights with multiple clients suggest
that drone mobility in lateral or vertical path leads
to time-selective and frequency-selective wireless
channel for a low-altitude drone. The resulting aerial
wireless channel can be predicted reasonably well when
we model the channel based on the constructive and
destructive interference patterns between the
line-of-sight path and other propagation paths via
nearby reflectors. We propose a novel channel
prediction approach to predict the subcarrier SNRs for
all clients as drone moves and a novel scheduling
approach to select the subset of clients that maximize
the network utility using the predicted SNRs. We have
implemented the proposed approach on a commodity
802.11n chipset and evaluated in the field over twenty
flights, each serving up to 17 live clients.
Experiments demonstrate, for the first time, the
feasibility of tracking and predicting the aerial Wi-Fi
channel, resulting in up to a 56\% increase in overall
throughput as compared to the conventional 802.11n
hotspot, while maintaining fairness across clients.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zou:2018:OSD,
author = "Mao Zou and Richard T. B. Ma and Xin Wang and Yinlong
Xu",
title = "On Optimal Service Differentiation in Congested
Network Markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2693--2706",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2874474",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As Internet applications have become more diverse in
recent years, users having heavy demand for online
video services are more willing to pay higher prices
for better services than light users that mainly use
e-mails and instant messages. This encourages the
Internet service providers ISPs to explore service
differentiation so as to optimize their profits and
allocation of network resources. Much prior work has
focused on the viability of network service
differentiation by comparing with the case of a
single-class service. However, the optimal service
differentiation for an ISP subject to resource
constraints has remained unsolved. In this paper, we
establish an optimal control framework to derive the
analytical solution to an ISP's optimal service
differentiation, i.e., the optimal service qualities
and associated prices. By analyzing the structures of
the solution, we reveal how an ISP should adjust the
service qualities and prices in order to meet varying
capacity constraints and users' characteristics. We
also obtain the conditions under which ISPs have strong
incentives to implement service differentiation and
whether regulators should encourage such practices.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cao:2018:DCD,
author = "Xuanyu Cao and Junshan Zhang and H. Vincent Poor",
title = "Data Center Demand Response With On-Site Renewable
Generation: a Bargaining Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2707--2720",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2873752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The rapid growth of cloud computing and data centers
with skyrocketing energy consumption, together with the
accelerating penetration of renewable energy sources,
is creating both severe challenges and tremendous
opportunities. Data centers offering large flexible
loads in the grid, opens up a unique opportunity to
smooth out the significant fluctuation and uncertainty
of renewable generation and hence enable seamless
integration. To take the market power of data centers
into consideration, this paper proposes a bargaining
solution to the market program for data center demand
response when the load serving entity LSE has power
supply deficiency. Specifically, due to the uncertainty
of load flexibility of data centers incurred by the
intermittent on-site renewable generation and dynamic
service requests, there exists information asymmetry
between the LSE and the data center, which complicates
the design of the bargaining solution. Making use of
the log-concavity of the expected utility functions, a
computationally efficient method to implement the best
response updates in the bargaining procedure is
presented. Furthermore, it is shown analytically that
the bid sequences of the LSE and the data center are
guaranteed to converge and the final price clinched by
the bargaining algorithm is indeed the Nash bargaining
solution, which is proportionally fair. In addition,
the proposed bargaining solution is compared with two
other schemes, namely the Stackelberg game and the
social welfare maximization schemes. Finally, extensive
numerical experiments are conducted to validate the
theoretical guarantees of the bargaining and to examine
the impact of various model parameters. Empirical
comparison indicates the fairness advantage of the
bargaining approach over the other two schemes,
especially when the load of the data center is not very
flexible, highlighting the importance of information
feedback embodied by the bargaining procedure.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{LeBoudec:2018:TTR,
author = "Jean-Yves {Le Boudec}",
title = "A Theory of Traffic Regulators for Deterministic
Networks With Application to Interleaved Regulators",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2721--2733",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2875191",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We introduce Pi-regulation, a new definition of
traffic regulation which extends both the arrival
curves of network calculus and Chang's max-plus
g-regulation, and also includes new types of
regulation, such as packet rate limitations. We provide
a new exact equivalence between min-plus and max-plus
formulations of traffic regulation. We show the
existence and a max-plus representation of per-flow
minimal regulators, which extends the concepts of
packetized greedy shapers and minimal g-regulators. We
show that any minimal regulator, placed after any
arbitrary system that is FIFO for the flow of interest,
does not increase the worst-case delay of the flow. We
extend the theory to interleaved regulation and
introduce the concept of minimal interleaved regulator.
It generalizes the urgency-based shaper that was
recently proposed by Specht and Samii as a simpler
alternative to per-flow regulators in deterministic
networks with aggregate scheduling. With this
regulator, packets of multiple flows are processed in
one FIFO queue and only the packet at the head of the
queue is examined against the regulation constraints of
its flow. We show that any minimal interleaved
regulator, placed after any arbitrary FIFO system does
not increase the worst-case delay of the combination.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hong:2018:KCK,
author = "Cheol-Ho Hong and Kyungwoon Lee and Jaehyun Hwang and
Hyunchan Park and Chuck Yoo",
title = "{Kafe}: Can {OS} Kernels Forward Packets Fast Enough
for Software Routers?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2734--2747",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2879752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is widely believed that software routers based on
commodity operating systems cannot deliver high-speed
packet processing, and a number of alternative
approaches including user-space network stacks have
been proposed. This paper revisits the inefficiency of
kernel-level packet processing inside modern OS-based
software routers and explores whether a redesign of
kernel network stacks can improve the incompetence. We
present a case contrary to the belief through a
redesign: Kafe --- a kernel-based advanced forwarding
engine that can process packets as fast as user-space
network stacks. The Kafe neither adds any new API nor
depends on proprietary hardware features, but the Kafe
outperforms Linux by seven times and RouteBricks by
three times. The current implementation of the Kafe can
forward 64-byte IPv4 packets at 28.2 Gbps using eight
cores running at 2.6 GHz. Our evaluation results show
that the Kafe achieves similar packet forwarding
performance to Intel DPDK while consuming much less CPU
and memory resources.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pi:2018:AAH,
author = "Yibo Pi and Sugih Jamin and Peter Danzig and Jacob
Shaha",
title = "{AP-Atoms}: a High-Accuracy Data-Driven Client
Aggregation for Global Load Balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2748--2761",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2878019",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In Internet mapping, IP address space is divided into
a set of client aggregation units, which are the
finest-grained units for global load balancing.
Choosing the proper level of aggregation is a complex
problem, which determines the number of aggregation
units that a mapping system has to maintain and client
redirection. In this paper, using Internet-wide
measurements provided by a commercial global load
balancing service provider, we show that even for the
best existing client aggregation, almost 17\% of
clients have latency more than 50 ms apart from the
average latency of clients in the same aggregation
unit. To address this, we propose a data-driven client
aggregation, AP-atoms, which can trade off scalability
for accuracy and adapt for changing network conditions.
Since AP-atoms are obtained from the passive
measurements of existing traffic between server
providers and clients, no extra measurement overheads
are incurred. Our experiments show that by using the
same scale of client aggregations, AP-atoms can reduce
the number of widely dispersed clients by almost $ 2
\times $ and the 98th percentile difference in clients'
latencies by almost 100 ms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2018:DCO,
author = "Lichao Yang and Heli Zhang and Xi Li and Hong Ji and
Victor C. M. Leung",
title = "A Distributed Computation Offloading Strategy in
Small-Cell Networks Integrated With Mobile Edge
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2762--2773",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2876941",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile edge computing is conceived as an appealing
technology to enhance cloud computing capability of
mobile devices MDs at the edge of the networks.
Although some researchers use the technology to address
the intensive tasks' high computation needs of MDs in
small-cell networks SCNs, most of them ignore
considering the interests interaction between small
cells and MDs. In this paper, we study a distributed
computation offloading strategy for a multi-device and
multi-server system based on orthogonal
frequency-division multiple access in SCNs. First, to
satisfy the interest requirements of different MDs and
analyze the interactions among multiple small cells, we
formulate a distributed overhead minimization problem,
aiming at jointly optimizing energy consumption and
latency of each MD. Second, to ensure the individuals
of different MDs, we formulate the proposed overhead
minimization problem as a strategy game. Then, we prove
the strategy game is a potential game by the feat of
potential game theory. Moreover, the potential
game-based offloading algorithm is proposed to reach a
Nash equilibrium. In addition, to guarantee the
performance of the designed algorithm, we consider the
lower bound of iteration times to derive the worst case
performance guarantee. Finally, the simulation results
corroborate that the proposed algorithm can effectively
minimize the overhead of each MD compared with
different 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{Yu:2018:CLC,
author = "Xiwen Yu and Hongli Xu and Da Yao and Haibo Wang and
Liusheng Huang",
title = "{CountMax}: a Lightweight and Cooperative Sketch
Measurement for Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2774--2786",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2877700",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In a software-defined network SDN, statistics
information is of vital importance for different
applications, such as traffic engineering, flow
rerouting, and attack detection. Since some resources,
e.g., ternary content addressable memory, SRAM, and
computing capacity, are often limited on SDN switches,
traffic measurements based on flow tables or sampling
become infeasible. In fact, sketches provide a
promising building block for filling this void by
monitoring every packet with fixed-size memory.
Although many efficient sketches have been designed,
our analysis shows that existing sketch-based
measurement solutions may suffer from severe computing
overhead on switches especially under high traffic load
that significantly interferes with switch's basic
functions, such as flow rule setup and modification. In
this paper, we present CountMax, a lightweight and
cooperative sketch for traffic measurement, which can
achieve low-amortized processing overhead and tight
estimation bounds, to track large flows in SDNs. We
also discuss how to apply CountMax to support a variety
of applications. We have implemented the proposed
algorithm on our open switches. Testbed experiments and
extensive simulation results show that CountMax
consumes only 1/3--1/2 computing overhead and reduces
the average estimation error by 20\%--30\%, compared
with the existing solutions under the same memory
size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lamali:2018:ACA,
author = "Mohamed Lamine Lamali and Nasreddine Fergani and
Johanne Cohen",
title = "Algorithmic and Complexity Aspects of Path Computation
in Multi-Layer Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2787--2800",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2878103",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Carrier-grade networks comprise several layers where
different protocols coexist. Nowadays, most of these
networks have different control planes to manage
routing on different layers, leading to a suboptimal
use of the network resources and to additional
operational costs. However, some routers are able to
encapsulate, decapsulate, and convert protocols, and
act as a liaison between these layers. A unified
control plane would be useful to optimize the use of
the network resources and to automate the routing
configurations. Software-defined networking-based
architectures offer an opportunity to design such a
control plane. One of the most important problems to
deal with in this design is the path computation
process. Classical path computation algorithms cannot
resolve the problem, as they do not take into account
encapsulations and conversions of protocols. In this
paper, we propose algorithms to solve this problem and
study several cases. If there is no bandwidth
constraint, we propose a polynomial algorithm that
computes the optimal path. We also give lower and upper
bounds on the optimal path length. On the other hand,
we show that the problem is $ \mathsf {NP} $-hard if
there is a bandwidth constraint or other
quality-of-service parameters, even if there is only
two protocols and in a symmetric graph. We study the
complexity and the scalability of our algorithms and
evaluate their performances on real and random
topologies. The results show that they are faster than
the previous ones proposed in the literature. These
algorithms can also have important applications in
automatic tunneling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fossati:2018:FRA,
author = "Francesca Fossati and Sahar Hoteit and Stefano Moretti
and Stefano Secci",
title = "Fair Resource Allocation in Systems With Complete
Information Sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2801--2814",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2878644",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In networking and computing, resource allocation is
typically addressed using classical resource allocation
protocols as the proportional rule, the max--min fair
allocation, or solutions inspired by cooperative game
theory. In this paper, we argue that, under awareness
about the available resource and other users demands, a
cooperative setting has to be considered in order to
revisit and adapt the concept of fairness. Such a
complete information sharing setting is expected to
happen in 5G environments, where resource sharing among
tenants slices need to be made acceptable by users and
applications, which therefore need to be better
informed about the system status via ad-hoc northbound
interfaces than in legacy environments. We identify in
the individual satisfaction rates the key aspect of the
challenge of defining a new notion of fairness in
systems with complete information sharing,
consequently, a more appropriate resource allocation
algorithm. We generalize the concept of user
satisfaction considering the set of admissible
solutions for bankruptcy games and we adapt to it the
fairness indices. Accordingly, we propose a new
allocation rule we call mood value: for each user, it
equalizes our novel game-theoretic definition of user
satisfaction with respect to a distribution of the
resource. We test the mood value and a new fairness
index through extensive simulations about the cellular
frequency scheduling use-case, showing how they better
support the fairness analysis. We complete the paper
with further analysis on the behavior of the mood value
in the presence of multiple competing providers and
with cheating users.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DOro:2018:LCD,
author = "Salvatore D'Oro and Francesco Restuccia and Tommaso
Melodia and Sergio Palazzo",
title = "Low-Complexity Distributed Radio Access Network
Slicing: Algorithms and Experimental Results",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2815--2828",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2878965",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio access network RAN slicing is an effective
methodology to dynamically allocate networking
resources in 5G networks. One of the main challenges of
RAN slicing is that it is provably an NP-Hard problem.
For this reason, we design near-optimal low-complexity
distributed RAN slicing algorithms. First, we model the
slicing problem as a congestion game, and demonstrate
that such game admits a unique Nash equilibrium NE.
Then, we evaluate the Price of Anarchy PoA of the NE,
i.e., the efficiency of the NE as compared with the
social optimum, and demonstrate that the PoA is
upper-bounded by 3/2. Next, we propose two
fully-distributed algorithms that provably converge to
the unique NE without revealing privacy-sensitive
parameters from the slice tenants. Moreover, we
introduce an adaptive pricing mechanism of the wireless
resources to improve the network owner's profit. We
evaluate the performance of our algorithms through
simulations and an experimental testbed deployed on the
Amazon EC2 cloud, both based on a real-world dataset of
base stations from the OpenCellID project. Results
conclude that our algorithms converge to the NE rapidly
and achieve near-optimal performance, while our pricing
mechanism effectively improves the profit of the
network owner.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Engelmann:2018:EPR,
author = "Anna Engelmann and Wolfgang Bziuk and Admela Jukan and
Muriel Medard",
title = "Exploiting Parallelism With Random Linear Network
Coding in High-Speed {Ethernet} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2829--2842",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2852562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Parallelism has become one of the key architectural
features in 40-/100-/400-Gb Ethernet multi lane
distribution MLD standards. The MLD packetizes and
distributes traffic adaptively over parallel lanes and
maps them to parallel network interfaces for wide area
transmission, typically over optical networks. As such,
the MLD creates not only new network topology
abstractions but also enables modular implementations
of various new features to improve the system
performance. In this paper, we study the performance of
the parallelized Ethernet in combination with erasure
coding and more specifically random linear network
coding RLNC. We present a novel theoretical modeling
framework, including the derivation of upper and lower
bounds of differential delay and the resulting receiver
queue size --- a critical performance measure in the
high-speed Ethernet. The results show benefits of a
combined usage of parallelism and RLNC: with a proper
set of design parameters, the differential delay and
the receiver buffer size can be reduced significantly,
while cross-layer design and path computation greatly
simplified.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2018:DID,
author = "An Wang and Wentao Chang and Songqing Chen and Aziz
Mohaisen",
title = "Delving Into {Internet} {DDoS} Attacks by Botnets:
Characterization and Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2843--2855",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2874896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet distributed denial of service DDoS attacks
are prevalent but hard to defend against, partially due
to the volatility of the attacking methods and patterns
used by attackers. Understanding the latest DDoS
attacks can provide new insights for effective defense.
But most of existing understandings are based on
indirect traffic measures e.g., backscatters or traffic
seen locally. In this paper, we present an in-depth
analysis based on 50 704 different Internet DDoS
attacks directly observed in a seven-month period.
These attacks were launched by 674 botnets from 23
different botnet families with a total of 9026 victim
IPs belonging to 1074 organizations in 186 countries.
Our analysis reveals several interesting findings about
today's Internet DDoS attacks. Some highlights include:
1 geolocation analysis shows that the geospatial
distribution of the attacking sources follows certain
patterns, which enables very accurate source prediction
of future attacks for most active botnet families; 2
from the target perspective, multiple attacks to the
same target also exhibit strong patterns of
inter-attack time interval, allowing accurate start
time prediction of the next anticipated attacks from
certain botnet families; and 3 there is a trend for
different botnets to launch DDoS attacks targeting the
same victim, simultaneously or in turn. These findings
add to the existing literature on the understanding of
today's Internet DDoS attacks and offer new insights
for designing new defense schemes at different
levels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhao:2018:PLP,
author = "Ping Zhao and Hongbo Jiang and John C. S. Lui and Chen
Wang and Fanzi Zeng and Fu Xiao and Zhetao Li",
title = "{P3-LOC}: a Privacy-Preserving Paradigm-Driven
Framework for Indoor Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2856--2869",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2879967",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Indoor localization plays an important role as the
basis for a variety of mobile applications, such as
navigating, tracking, and monitoring in indoor
environments. However, many such systems cause
potential privacy leakage in data transmission between
mobile users and the localization server LS.
Unfortunately, there has been little research done on
privacy issue, and the existing privacy-preserving
solutions are algorithm-driven, each designed for
specific localization algorithms, which hinders their
wide-scale adoption. Furthermore, they mainly focus on
users' location privacy, while the LS's data privacy
cannot be guaranteed. In this paper, we propose a
Privacy-Preserving Paradigm-driven framework for indoor
LOCalization P3-LOC. P3-LOC takes the advantage that
most indoor localization systems share a common
two-stage localization paradigm: information
measurement and location estimation. Based on this,
P3-LOC carefully perturbs and cloaks the transmitted
data in these two stages and employs specially designed
``$k$-anonymity'' and ``differential privacy''
techniques to achieve the provable privacy
preservation. The key advantage is that P3-LOC does not
rely on any prior knowledge of the underlying
localization algorithms, and it guarantees both users'
location privacy and the LS's data privacy. Our
extensive experiments from the measured data have
validated that P3-LOC provides privacy preservation for
general indoor localization techniques. In addition,
P3-LOC is comparable with the state-of-the-art
algorithm-driven techniques in terms of localization
error, computation, and communication overhead.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2018:GNF,
author = "Xudong Wu and Luoyi Fu and Yuhang Yao and Xinzhe Fu
and Xinbing Wang and Guihai Chen",
title = "{GLP}: a Novel Framework for Group-Level Location
Promotion in Geo-Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "6",
pages = "2870--2883",
month = dec,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2879437",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Feb 4 19:39:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Location-aware viral marketing is crucial in modern
commercial applications for attracting customers to
certain points of interests. Prior works are mainly
based on formulating it into a location-aware influence
maximization problem in Geo-social Networks GSNs, where
$K$ initial seed individuals are selected in hope of
maximizing the number of final influenced users. In
this paper, we present the first look into the
group-level location promotion, which can potentially
enhance its performance, with the phenomenon that users
belonging to the same geo-community share similar
moving preferences. We propose GLP, a new and novel
framework of group-level location promotion by virtue
of geo-communities, each of which is treated as a group
in GSNs. Aiming to attract more users to designated
locations, GLP firstly carries out user grouping
through an iterative learning approach based on
information extraction from massive check-ins records.
The advantage of GLP is three-folded: (i) by
aggregating movements of group members, GLP
significantly avoids the sparsity and sporadicity of
individual check-ins, and thus obtains more reliable
mobility models; (ii) by generalizing a new group-level
social graph, GLP can exponentially reduce the
computational complexity of seed nodes selection that
is algorithmically executed by a greedy algorithm;
(iii) in comparison with prior individual-level cases,
GLP is theoretically demonstrated to drastically
increase influence spread under the same given budget.
Extensive experiments on real datasets demonstrate that
the GLP outperforms four baselines, with notably up to
10 times larger influence spread and 100 times faster
seed selection over two individual-level cases,
meanwhile verifying the impact of group numbers in
final influence spread.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dong:2019:UPR,
author = "Wei Dong and Chenhong Cao and Xiaoyu Zhang and Yi
Gao",
title = "Understanding Path Reconstruction Algorithms in
Multihop Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "1--14",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2879607",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Low-power and multihop wireless networking is
envisioned as a promising technology to achieve both
energy efficiency and easy deployment for many Internet
of Things IoT applications. Measuring packet-level path
is crucial for managing large-scale multihop wireless
networks. Packet-level path information encodes the
routing path, a packet that takes through a network.
The availability of packet-level path information can
greatly facilitate many network management tasks. It is
challenging to reconstruct packet-level paths using a
small overhead, especially for large-scale networks.
While there is a long list of existing path
reconstruction algorithms, these algorithms focus on
specific network scenarios, e.g., periodic monitoring
networks or event detection networks. There lacks a
unified model for systematically understanding and
comparing the performance of these algorithms in
different network scenarios. In this paper, we fill
this gap by proposing an abstract model. Using this
model, it is possible to derive a decision space for
selecting the best algorithm for different networks.
Furthermore, this model also guides us to devise better
path reconstruction algorithms cPath$_T$, cPath$_S$,
and cPath$_{ST}$ with respect to path reconstruction
ratio. Extensive experiments demonstrate the prediction
power of our model as well as the advantages of our
proposed algorithms. The results show that our
algorithm cPath$_{ST}$ improves a path reconstruction
ratio from 94.4\%, 34.3\%, and 30.8\% to 98.9\%,
99.9\%, and 60.1\% on average in three network
scenarios, respectively, compared with the best
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{Shafigh:2019:UCD,
author = "Alireza Shams Shafigh and Savo Glisic and Ekram
Hossain and Beatriz Lorenzo and Luiz A. DaSilva",
title = "User-Centric Distributed Spectrum Sharing in Dynamic
Network Architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "15--28",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2880843",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We develop and analyze a new user-centric networking
model for ubiquitous spectrum sharing where every user
can share and use the spectrum under uncertainty of
their traffic models. In this concept, users when
connected to the Internet wired/wireless can
dynamically serve as access points for other users in
their vicinity. For this reason, the concept is
referred to as user-centric distributed spectrum
sharing. Each user in spectrum sharing mode utilizes a
part of its available spectrum for its own traffic and
remaining part to share with users in spectrum
demanding modes. The model is designed as an operator
supervised double-Stackelberg game with network
operators, access points, and users as main players. We
study network reliability and latency of the system
under uncertainty of users' traffic patterns. The
numerical results show that the proposed model,
depending on different settings, can significantly
improve both profit and utility for network operators
and users, respectively. Furthermore, network
reliability is significantly improved depending on the
network parameters for both users and operators.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Borkotoky:2019:FCB,
author = "Siddhartha S. Borkotoky and Michael B. Pursley",
title = "Fountain-Coded Broadcast Distribution in Multiple-Hop
Packet Radio Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "29--41",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2882303",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We devise and evaluate five methods for fountain-coded
broadcast distribution of a file from a source to
multiple destinations in an ad hoc wireless network
that consists of half-duplex packet radios. The methods
differ in their use of intermediate nodes, their use of
forwarding, and their reliance on a network spanning
tree. All five methods employ continued fountain coding
to prevent nodes from receiving duplicate
fountain-coded packets. We derive an analytical
approximation for the throughput of fountain-coded
broadcast file distribution in a four-node network with
time-varying radio links modeled by independent
two-state Markov chains, and we show that our approach
to fountain-coded file distribution gives throughput
that is very close to the approximation. We employ
simulations to examine larger networks in which each
radio link has correlated Rayleigh fading and the
radios use adaptive modulation and channel coding.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2019:ETB,
author = "Jihong Yu and Wei Gong and Jiangchuan Liu and Lin Chen
and Kehao Wang",
title = "On Efficient Tree-Based Tag Search in Large-Scale
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "42--55",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2879979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Tag search, which is to find a particular set of tags
in a radio frequency identification RFID system, is a
key service in such important Internet-of-Things
applications as inventory management. When the system
scale is large with a massive number of tags,
deterministic search can be prohibitively expensive,
and probabilistic search has been advocated, seeking a
balance between reliability and time efficiency. Given
a failure probability $ \frac {1}{\mathcal {O}K} $,
where $K$ is the number of tags, state-of-the-art
solutions have achieved a time cost of $ \mathcal {O}K
\log K$ through multi-round hashing and verification.
Further improvement, however, faces a critical
bottleneck of repetitively verifying each individual
target tag in each round. In this paper, we present an
efficient tree-based tag search TTS that approaches $
\mathcal {O}K$ through batched verification. The key
novelty of TTS is to smartly hash multiple tags into
each internal tree node and adaptively control the node
degrees. It conducts bottom--up search to verify tags
group by group with the number of groups decreasing
rapidly. Furthermore, we design an enhanced tag search
scheme, referred to as TTS+, to overcome the negative
impact of asymmetric tag set sizes on time efficiency
of TTS. TTS+ first rules out partial ineligible tags
with a filtering vector and feeds the shrunk tag sets
into TTS. We derive the optimal hash code length and
node degrees in TTS to accommodate hash collisions and
the optimal filtering vector size to minimize the time
cost of TTS+. The superiority of TTS and TTS+ over the
state-of-the-art solution is demonstrated through both
theoretical analysis and extensive simulations.
Specifically, as reliability demand on scales, the time
efficiency of TTS+ reaches nearly 2 times at most that
of TTS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pegatoquet:2019:WRB,
author = "Alain Pegatoquet and Trong Nhan Le and Michele Magno",
title = "A Wake-Up Radio-Based {MAC} Protocol for Autonomous
Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "56--70",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2880797",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks WSNs with energy harvesting
capabilities have drawn increasing attention in the
last few years, as they enable long-term monitoring
applications. However, the level of power harvested is
usually limited to few mW. To improve the energy
efficiency of WSNs, many power management techniques
have been proposed to adjust the quality of service
according to the harvested energy fluctuations. As
wireless communications consume a major fraction of the
available energy, numerous medium access control MAC
protocols have been proposed to minimize energy
consumption, latency, and data collisions. In this
paper, we present an innovative MAC protocol for
energy-harvesting based WSNs exploiting ultralow-power
wake-up radios. To overcome the limited range typical
of wake-up radios, a multi-hop wake-up scheme based on
a dual radio system is proposed enabling asynchronous
communications between a base station and any node of
the network while maintaining a low latency and a high
energy efficiency. To reduce energy consumption,
wake-up calls and data packets are transmitted using
two distinct data rates. Combined with destination
address decoding, using a higher data rate for data
transmission also minimizes the risk of collisions. Our
approach has been applied to monitoring applications
composed of autonomous sensor nodes powered by indoor
light energy. OMNeT++ simulation results demonstrate
the benefits of our wake-up radio-based approach in
terms of energy, latency, and collisions when compared
with the state-of-the-art duty-cycled MAC protocols.
Experiments performed with real WSN platforms equipped
with a wake-up radio prototype confirm the efficiency
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{Albazrqaoe:2019:PBT,
author = "Wahhab Albazrqaoe and Jun Huang and Guoliang Xing",
title = "A Practical {Bluetooth} Traffic Sniffing System:
Design, Implementation, and Countermeasure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "71--84",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2880970",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the prevalence of personal Bluetooth devices,
potential breach of user privacy has been an increasing
concern. To date, sniffing Bluetooth traffic has been
widely considered an extremely intricate task due to
Bluetooth's indiscoverable mode, vendor-dependent
adaptive hopping behavior, and the interference in the
open 2.4 GHz band. In this paper, we present BlueEar--a
practical Bluetooth traffic sniffer. BlueEar features a
novel dual-radio architecture where two
Bluetooth-compliant radios coordinate with each other
on learning the hopping sequence of indiscoverable
Bluetooth networks, predicting adaptive hopping
behavior, and mitigating the impacts of RF
interference. We built a prototype of BlueEar to sniff
on Bluetooth classic traffic. Experiment results show
that BlueEar can maintain a packet capture rate higher
than 90\% consistently in real-world environments,
where the target Bluetooth network exhibits diverse
hopping behaviors in the presence of dynamic
interference from coexisting 802.11 devices. In
addition, we discuss the privacy implications of the
BlueEar system, and present a practical countermeasure
that effectively reduces the packet capture rate of the
sniffer to 20\%. The proposed countermeasure can be
easily implemented on Bluetooth master devices while
requiring no modification to slave devices such as
keyboards and headsets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Josilo:2019:DAR,
author = "Sladana Josilo and Gyorgy Dan",
title = "Decentralized Algorithm for Randomized Task Allocation
in Fog Computing Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "85--97",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2880874",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fog computing is identified as a key enabler for using
various emerging applications by battery powered and
computationally constrained devices. In this paper, we
consider devices that aim at improving their
performance by choosing to offload their computational
tasks to nearby devices or to an edge cloud. We develop
a game theoretical model of the problem and use a
variational inequality theory to compute an equilibrium
task allocation in static mixed strategies. Based on
the computed equilibrium strategy, we develop a
decentralized algorithm for allocating the
computational tasks among nearby devices and the edge
cloud. We use the extensive simulations to provide
insight into the performance of the proposed algorithm
and compare its performance with the performance of a
myopic best response algorithm that requires global
knowledge of the system state. Despite the fact that
the proposed algorithm relies on average system
parameters only, our results show that it provides a
good system performance close to that of the myopic
best response algorithm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tang:2019:TKD,
author = "Guoming Tang and Huan Wang and Kui Wu and Deke Guo",
title = "Tapping the Knowledge of Dynamic Traffic Demands for
Optimal {CDN} Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "98--111",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2881169",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The content delivery network CDN intensively uses
cache to push the content close to end users. Over both
traditional Internet architecture and emerging
cloud-based framework, cache allocation has been the
core problem that any CDN operator needs to address. As
the first step for cache deployment, CDN operators need
to discover or estimate the distribution of user
requests in different geographic areas. This step
results in a statistical spatial model for the user
requests, which is used as the key input to solve the
optimal cache deployment problem. More often than not,
the temporal information in user requests is omitted to
simplify the CDN design. In this paper, we disclose
that the spatial request model alone may not lead to
truly optimal cache deployment and revisit the problem
by taking the dynamic traffic demands into
consideration. Specifically, we model the time-varying
traffic demands and formulate the distributed cache
deployment optimization problem with an integer linear
program ILP. To solve the problem efficiently, we
transform the ILP problem into a scalable form and
propose a greedy diagram to tackle it. Via experiments
over the North American ISPs points of presence PoPs
network, our new solution outperforms traditional CDN
design method and saves the overall delivery cost by
16\% to 20\%. We also study the impact of various
traffic demand patterns to the CDN design cost, via
experiments with both real-world traffic demand
patterns and extensive synthetic trace data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tadrous:2019:ABS,
author = "John Tadrous and Atilla Eryilmaz and Ashutosh
Sabharwal",
title = "Action-Based Scheduling: Leveraging App Interactivity
for Scheduler Efficiency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "112--125",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2882557",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The dominant portion of smartphone traffic is
generated by apps that involve human interactivity.
Particularly, when human users receive information from
a server, they spend a few seconds of information
processing before taking an action. The user processing
time creates an idle communication period during the
app session. Moreover, the generation of the future
traffic depends on the service of the current
query-response pair. In this paper, we aim at
leveraging the properties of such interactions to reap
quality-of-experience gains. Existing schedulers, both
in practice and theory, are not designed in view of the
aforementioned traffic characteristics. Theoretical
works predominantly focus on scheduling of traffic that
is either generated independently or directly
controlled, but not governed by the specific dynamics
caused by human interactions. Schedulers in practice,
on the other hand, employ round-robin and
processor-sharing methods to serve multiple ongoing
sessions. We show that neither of these approaches is
effective for serving apps that involve human
interactivity. Instead, we show that optimal scheduling
for interactive traffic is non-randomized over packets,
which we call action-based, as it avoids breaking
ongoing service of actions in order to align human
response times with the service of other actions. Since
the design of optimal action-based policy is
computationally prohibitive, we develop low-complexity
suboptimal action-based policies that are optimal for
two ongoing sessions. Our numerical studies based on a
real-data trace reveal that our proposed action-based
policies can reduce total delay by 22\% with respect to
packet-based equal processor sharing.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:MAV,
author = "Jiaqi Liu and Luoyi Fu and Yuhang Yao and Xinzhe Fu
and Xinbing Wang and Guihai Chen",
title = "Modeling, Analysis and Validation of Evolving Networks
With Hybrid Interactions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "126--142",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2881995",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In many real-world networks, entities of different
types usually form an evolving network with hybrid
interactions. However, how to theoretically model such
networks, along with quantitive characterizations,
remains unexplored. Motivated by this, we develop a
novel evolving model, which, as validated by our
empirical results, can well capture some basic
properties such as power-law degree distribution,
densification, shrinking diameter, and community
structure embodied in most real datasets. Particularly,
two types of results are presented in this paper.
First, our proposed model, namely, evolving K-Graph,
consists of $K$ -node sets representing $K$ different
types of entities. The hybrid interactions among
entities, based on whether they belong to the same
type, are classified into inter-type and intra-type
ones that are, respectively, characterized by two joint
graphs evolving over time. Following our newly proposed
mechanism called interactive-evolution, potential
connections can be established among nodes with common
features and further form a positive feedback. The
superiorities of our model are three folded: good
capture of realistic networks, mathematical
tractability, and efficient implementation. Second, by
analytical derivations, along with empirical validation
on real datasets, we disclose two aspects of network
properties: basic ones as power-law degree
distribution, densification, shrinking diameter and
community structure, as well as a distinctive one, that
is, positive correlation observed in real networks,
implying that a hub in one inter-type relationship
network also has many neighbors in another one. An
additional interesting finding is that through further
comparison of models with or without
interactive-evolution, the former one leads to an even
earlier occurrence of network connectivity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2019:PSE,
author = "Qingjun Xiao and Shigang Chen and Jia Liu and Guang
Cheng and Junzhou Luo",
title = "A Protocol for Simultaneously Estimating Moments and
Popular Groups in a Multigroup {RFID} System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "143--158",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2884961",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio frequency identification RFID technology has
rich applications in cyber-physical systems, such as
warehouse management and supply chain control. Often in
practice, tags are attached to objects belonging to
different groups, which may be different product
types/manufacturers in a warehouse or different book
categories in a library. As RFID technology evolves
from single-group to multiple-group systems, there
arise several interesting problems. One of them is to
identify the popular groups, whose numbers of tags are
above a pre-defined threshold. Another is to estimate
arbitrary moments of the group size distribution, such
as sum, variance, and entropy for the sizes of all
groups. In this paper, we consider a new problem which
is to estimate all these statistical metrics
simultaneously in a time-efficient manner without
collecting any tag IDs. We solve this problem by a
protocol named generic moment estimator GME, which
allows the tradeoff between estimation accuracy and
time cost. According to the results of our theoretical
analysis and simulation studies, this GME protocol is
several times or even orders of magnitude more
efficient than a baseline protocol that takes a random
sample of tag groups to estimate each group size.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:EIS,
author = "Jia Liu and Shigang Chen and Qingjun Xiao and Min Chen
and Bin Xiao and Lijun Chen",
title = "Efficient Information Sampling in Multi-Category
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "159--172",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2883508",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In RFID-enabled applications, when a tag is put into
use and associated with a specific object, the
category-related information e.g., the brands of
clothes about this object might be preloaded into the
tag's memory for the purpose of live query. Since such
information reflects category attributes, all tags in
the same category carry identical category information.
To collect this information, we do not need to
repeatedly interrogate each tag; one tag's response in
a category is sufficient. In this paper, we investigate
the problem of category information collection in a
multi-category RFID system, which is referred to as
information sampling. We propose two time-efficiency
protocols. The first is a two-phase sampling protocol
TPS that works in the case of knowing tag IDs. By
quickly zooming into a category and isolating a tag
from this category, TPS is able to sample a category
with small overhead. The second protocol, called
back-and-forth sampling protocol BFS, relaxes a key
assumption in TPS and performs the sampling task
efficiently without knowing any tag IDs or category
IDs. By carrying out a step-forward frame and using the
step-backward scheme, BFS is able to interrogate only
1.45 tags close to the lower bound of one tag on
average for each category. We theoretically analyze the
protocol performance of TPS and BFS and discuss the
optimal parameter settings that minimize the overall
execution time. Extensive simulations show that both
the protocols outperform the benchmark, greatly
improving the sampling performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2019:FDP,
author = "Peng Zhang and Cheng Zhang and Chengchen Hu",
title = "Fast Data Plane Testing for Software-Defined Networks
With {RuleChecker}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "173--186",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2885532",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A key feature of software-defined networking SDN is
the decoupling of control pane and data plane. Although
delivering huge benefits, such a decoupling also brings
a new risk: the data plane states i.e., flow tables may
deviate from the control plane policies. Existing data
plane testing tools such as RuleScope check the
correctness of flow tables by injecting probes.
However, they are limited in four aspects: 1 are slow
in generating probes due to solving SAT problems; 2 may
raise false negatives when there are multiple missing
rules; 3 cannot test cascaded flow tables used by
OpenFlow switches; and 4 either does not support
incremental update or has a slow update speed. To
overcome these limitations, we present RuleChecker, a
fast data plane testing tool for SDN. In contrast to
previous tools that generate each probe by solving an
SAT problem, the RuleChecker takes the flow table as
whole and generates all probes through an iteration of
simple set operations. By leveraging binary decision
diagram to encode sets, we make the RuleChecker
extremely fast: nearly $ 20 \times $ faster than the
RuleScope, and can update probes in less than 2 ms for
90\% of the cases, based on the Stanford backbone rule
set.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:INV,
author = "Wenping Liu and Hongbo Jiang and Guoyin Jiang and
Jiangchuan Liu and Xiaoqiang Ma and Yufu Jia and Fu
Xiao",
title = "Indoor Navigation With Virtual Graph Representation:
Exploiting Peak Intensities of Unmodulated Luminaries",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "187--200",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2884088",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The ubiquitous luminaries provide a new dimension for
indoor navigation, as they are often well-structured
and the visible light is reliable for its
multipath-free nature. However, existing visible
light-based technologies, which are generally
frequency-based, require the modulation on light
sources, modification to the device, or mounting extra
devices. The combination of the cost-extensive floor
map and the localization system with constraints on
customized hardwares for capturing the flashing
frequencies, no doubt, hinders the deployment of indoor
navigation systems at scale in, nowadays, smart cities.
In this paper, we provide a new perspective of indoor
navigation on top of the virtual graph representation.
The main idea of our proposed navigation system, named
PILOT, stems from exploiting the peak intensities of
ubiquitous unmodulated luminaries. In PILOT, the
pedestrian paths with enriched sensory data are
organically integrated to derive a meaningful graph,
where each vertex corresponds to a light source and
pairwise adjacent vertices or light sources form an
edge with a computed length and direction. The graph,
then, serves as a global reference frame for indoor
navigation while avoiding the usage of pre-deployed
floor maps, localization systems, or additional
hardwares. We have implemented a prototype of PILOT on
the Android platform, and extensive experiments in
typical indoor environments demonstrate its
effectiveness and efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2019:UTU,
author = "Xiaofeng Gao and Yuanning Gao and Yichen Zhu and
Guihai Chen",
title = "{U2-Tree}: a Universal Two-Layer Distributed Indexing
Scheme for Cloud Storage System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "201--213",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The indices in cloud storage systems manage the stored
data and support diverse queries efficiently. Secondary
index, the index built on the attributes other than the
primary key, facilitates a variety of queries for
different purposes. An efficient design of secondary
indices is called two-layer indexing scheme. It divides
indices in the system into the global index layer and
the local index layer. However, previous works on
two-layer indexing are mainly on a P2P overlay network.
In this paper, we propose U2-Tree, a universal
two-layer distributed indexing scheme built on data
center networks with tree-like topologies. To construct
the U2-Tree, we first build local index according to
data features and, then, assign potential indexing
range of the global index for each host based on the
distribution rule of local data. After that, we use
several false positives control techniques, including
gap elimination and Bloom filter, to publish meta-data
about local index to global index host. In the final
step, the global index collects published information
and uses tree data structures to organize them. In our
design, we take advantage of the topological properties
of tree-like topologies, introduce and compare detailed
optimization techniques in the construction of
two-layer indexing scheme. Furthermore, we discuss the
index updating, index tuning, and the fault tolerance
of U2-Tree. Finally, we validate the effectiveness and
efficiency of U2-Tree by giving a series of theoretical
analyses and conducting numerical experiments on Amazon
EC2 platform.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2019:WNI,
author = "Yong Cui and Yimin Jiang and Zeqi Lai and Xiaomeng
Chen and Y. Charlie Hu and Kun Tan and Minglong Dai and
Kai Zheng and Yi Li",
title = "Wireless Network Instabilities in the Wild:
Measurement, Applications {NonResilience}, and {OS
Remedy}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "214--230",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2885872",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "While the bandwidth and latency improvement of both
WiFi and cellular data networks in the past decades are
plenty evident, the extent of signal strength
fluctuation and network disruptions unexpected
switching or disconnections experienced by mobile users
in today's network deployment remains less clear. This
paper makes three contributions. First, we conduct the
first extensive measurement of network disruptions and
significant signal strength fluctuations together
denoted as network instabilities experienced by 2000
smartphones in the wild. Our results show that network
disruptions and signal strength fluctuations remains
prevalent as we moved into the 4G era. Second, we study
how well popular mobile apps today handle such network
instabilities. Our results show that even some of the
most popular mobile apps do not implement any
disruption-tolerant mechanisms. Third, we present
Janus, an intelligent interface management framework
that exploits the multiple interfaces on a handset to
transparently handle network disruptions and satisfy
apps' performance requirement. We have implemented a
prototype of Janus and our evaluation using a set of
popular apps shows that Janus can: 1 transparently and
efficiently handle network disruptions; 2 reduce video
stalls by 2.9 times and increase 31\% of the time of
good voice quality; 3 reduce traffic size by 26.4\% and
energy consumption by 16.3\% compared to naive
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2019:ICS,
author = "Xu Zhang and Edward W. Knightly",
title = "{CSIsnoop}: Inferring Channel State Information in
Multi-User {MIMO WLANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "231--244",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2884174",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Channel state information CSI has been proposed to
enhance physical layer security by functioning as a
shared secret between a transmitter and a receiver,
because it decorrelates over half wavelength distances
and cannot be predicted based on locations of the
transmitter and receiver in rich scattering
environments. Consequently, CSI was employed to
generate passwords, to authenticate the source of
packets, and to inject artificial noise to thwart
eavesdroppers. However, in this paper, we present
CSIsnoop, and show that an attacker can infer CSI in a
multi-user MIMO WLAN, even when both channel sounding
sequences from the access point and CSI measurement
feedback from the clients are encrypted during downlink
explicit channel sounding, or when uplink implicit
channel sounding is employed. The insights of CSIsnoop
are that the CSI of clients can be computed based on
transmit beamforming weights at the access point, and
that the transmit beamforming weights can be estimated
from downlink beamforming transmission. In other words,
we reveal the fundamental conflict between using CSI to
optimize PHY design by beamforming and ensuring the
confidentiality of CSI. We implement CSIsnoop on a
software defined radio and conduct experiments in
various indoor environments. Our results show that on
average CSIsnoop can infer CSI of the target client
with an absolute normalized correlation of over 0.99,
thereby urging reconsideration of the use of CSI as a
tool to enhance physical layer security in multi-user
MIMO WLANs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cheng:2019:WNE,
author = "Linsong Cheng and Jiliang Wang",
title = "Walls Have No Ears: a Non-Intrusive {WiFi-Based} User
Identification System for Mobile Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "245--257",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2886411",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the development and popularization of WiFi,
surfing on the Internet with mobile devices has become
an indispensable part of people's daily life. However,
as an infrastructure, WiFi access points APs are easily
connected by some undesired users nearby. In this
paper, we propose NiFi, a non-intrusive WiFi
user-identification system based on WiFi signals that
enable AP to automatically identify legitimate users in
indoor environments, such as home, office, and hotel.
The core idea is that legitimate and undesired users
may have different physical constraints, e.g., moving
area, walking path, and so on, leading to different
signal sequences. NiFi analyzes and exploits the
characteristics of signal sequences generated by mobile
devices. NiFi proposes a practical and effective method
to extract useful features and measures similarity for
signal sequences while not relying on precise user
location information. We implement NiFi on Commercial
Off-The-Shelf APs, and the implementation does not
require any modification to user devices. The
experiment results demonstrate that NiFi is able to
achieve an average identification accuracy at 90.83\%
with true positive rate at 98.89\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bejerano:2019:DDM,
author = "Yigal Bejerano and Chandrashekhar Raman and Chun-Nam
Yu and Varun Gupta and Craig Gutterman and Tomas Young
and Hugo A. Infante and Yousef M. Abdelmalek and Gil
Zussman",
title = "{DyMo}: Dynamic Monitoring of Large-Scale
{LTE}-Multicast Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "258--271",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2889742",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "LTE evolved Multimedia Broadcast/Multicast Service
eMBMS is an attractive solution for video delivery to
very large groups in crowded venues. However, the
deployment and management of eMBMS systems are
challenging, due to the lack of real-time feedback from
the user equipments UEs. Therefore, we present the
Dynamic MonitoringDyMo system for low-overhead feedback
collection. DyMo leverages eMBMS for broadcasting
stochastic group instructions to all UEs. These
instructions indicate the reporting rates as a function
of the observed quality of service QoS. This simple
feedback mechanism collects very limited QoS reports
from the UEs. The reports are used for network
optimization, thereby ensuring high QoS to the UEs. We
present the design aspects of DyMo and evaluate its
performance analytically and via extensive simulations.
Specifically, we show that DyMo infers the optimal
eMBMS settings with extremely low overhead while
meeting strict QoS requirements under different UE
mobility patterns and presence of network component
failures. For instance, DyMo can detect the eMBMS
signal-to-noise ratio experienced by the $ 0.1 t h $
percentile of the UEs with a root mean square error of
0.05\% with only 5 to 10 reports per second regardless
of the number of UEs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2019:TSS,
author = "Jianer Zhou and Zhenyu Li and Qinghua Wu and Peter
Steenkiste and Steve Uhlig and Jun Li and Gaogang Xie",
title = "{TCP} Stalls at the Server Side: Measurement and
Mitigation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "272--287",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2886282",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "TCP is an important factor affecting user-perceived
performance of Internet applications. Diagnosing the
causes behind TCP performance issues in the wild is
essential for better understanding the current
shortcomings in TCP. This paper presents a TCP flow
performance analysis framework that classifies causes
of TCP stalls. The framework forms the basis of a tool
that we use to analyze packet-level traces of three
services cloud storage, software download, and web
search deployed by a popular service provider. We find
that as many as 20\% of the flows are stalled for half
of their lifetime. Network-related causes, especially
timeout retransmissions, dominate the stalls. A
breakdown of the causes for timeout retransmission
stalls reveals that double retransmission and tail
retransmission are among the top contributors. The
importance of these causes depends however on the
specific service. Based on these observations, we
propose smart-retransmission time out S-RTO, a
mechanism that mitigates timeout retransmission stalls
through careful and gentle aggression for
retransmission. S-RTO is evaluated in a controlled
network and also in a production network. The results
consistently show that it is effective at improving TCP
performance, especially for short flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Poularakis:2019:OGS,
author = "Konstantinos Poularakis and George Iosifidis and
Georgios Smaragdakis and Leandros Tassiulas",
title = "Optimizing Gradual {SDN} Upgrades in {ISP} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "288--301",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890248",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Nowadays, there is a fast-paced shift from legacy
telecommunication systems to novel software-defined
network SDN architectures that can support on-the-fly
network reconfiguration, therefore, empowering advanced
traffic engineering mechanisms. Despite this momentum,
migration to SDN cannot be realized at once especially
in high-end networks of Internet service providers
ISPs. It is expected that ISPs will gradually upgrade
their networks to SDN over a period that spans several
years. In this paper, we study the SDN upgrading
problem in an ISP network: which nodes to upgrade and
when we consider a general model that captures
different migration costs and network topologies, and
two plausible ISP objectives: 1 the maximization of the
traffic that traverses at least one SDN node, and 2 the
maximization of the number of dynamically selectable
routing paths enabled by SDN nodes. We leverage the
theory of submodular and supermodular functions to
devise algorithms with provable approximation ratios
for each objective. Using real-world network topologies
and traffic matrices, we evaluate the performance of
our algorithms and show up to 54\% gains over
state-of-the-art methods. Moreover, we describe the
interplay between the two objectives; maximizing one
may cause a factor of 2 loss to the other. We also
study the dual upgrading problem, i.e., minimizing the
upgrading cost for the ISP while ensuring specific
performance goals. Our analysis shows that our proposed
algorithm can achieve up to 2.5 times lower cost to
ensure performance goals over state-of-the-art
methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hurtig:2019:LLS,
author = "Per Hurtig and Karl-Johan Grinnemo and Anna Brunstrom
and Simone Ferlin and Ozgu Alay and Nicolas Kuhn",
title = "Low-Latency Scheduling in {MPTCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "302--315",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2884791",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The demand for mobile communication is continuously
increasing, and mobile devices are now the
communication device of choice for many people. To
guarantee connectivity and performance, mobile devices
are typically equipped with multiple interfaces. To
this end, exploiting multiple available interfaces is
also a crucial aspect of the upcoming 5G standard for
reducing costs, easing network management, and
providing a good user experience. Multi-path protocols,
such as multi-path TCP MPTCP, can be used to provide
performance optimization through load-balancing and
resilience to coverage drops and link failures,
however, they do not automatically guarantee better
performance. For instance, low-latency communication
has been proven hard to achieve when a device has
network interfaces with asymmetric capacity and delay
e.g., LTE and WLAN. For multi-path communication, the
data scheduler is vital to provide low latency, since
it decides over which network interface to send
individual data segments. In this paper, we focus on
the MPTCP scheduler with the goal of providing a good
user experience for latency-sensitive applications when
interface quality is asymmetric. After an initial
assessment of existing scheduling algorithms, we
present two novel scheduling techniques: the block
estimation BLEST scheduler and the shortest
transmission time first STTF scheduler. BLEST and STTF
are compared with existing schedulers in both emulated
and real-world environments and are shown to reduce web
object transmission times with up to 51\% and provide
45\% faster communication for interactive applications,
compared with MPTCP's default scheduler.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Maatouk:2019:EET,
author = "Ali Maatouk and Mohamad Assaad and Anthony
Ephremides",
title = "Energy Efficient and Throughput Optimal {CSMA}
Scheme",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "316--329",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891018",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Carrier sense multiple access CSMA is widely used as a
medium access control MAC in wireless networks due to
its simplicity and distributed nature. This motivated
researchers to find CSMA schemes that achieve
throughput optimality. In 2008, it has been shown that
a simple CSMA-type algorithm is able to achieve
optimality in terms of throughput and has been given
the name ``adaptive'' CSMA. Later, new technologies
emerged where a prolonged battery life is crucial such
as environment and industrial monitoring. This inspired
the foundation of new CSMA-based MAC schemes, where
links are allowed to transition into a sleep mode to
reduce the power consumption. However, the throughput
optimality of these schemes was not established. This
paper, therefore, aims to find a new CSMA scheme that
combines both throughput optimality and energy
efficiency by adapting to the throughput and power
consumption needs of each link. This is done by
controlling operational parameters, such as back-off
and sleeping timers, with the aim of optimizing a
certain objective function. The resulting CSMA scheme
is characterized by being asynchronous, completely
distributed and being able to adapt to different power
consumption profiles required by each link while still
ensuring throughput optimality. The performance gain in
terms of energy efficiency compared with the
conventional adaptive CSMA scheme is demonstrated
through computer simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jin:2019:FPP,
author = "Meng Jin and Yuan He and Xin Meng and Yilun Zheng and
Dingyi Fang and Xiaojiang Chen",
title = "{FlipTracer}: Practical Parallel Decoding for
Backscatter Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "330--343",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890109",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With parallel decoding for backscatter communication,
tags are allowed to transmit concurrently and more
efficiently. Existing parallel decoding mechanisms,
however, assume that signals of the tags are highly
stable and, hence, may not perform optimally in the
naturally dynamic backscatter systems. This paper
introduces FlipTracer, a practical system that achieves
highly reliable parallel decoding even in hostile
channel conditions. FlipTracer is designed with a key
insight; although the collided signal is time-varying
and irregular, transitions between signals' combined
states follow highly stable probabilities, which offers
important clues for identifying the collided signals
and provides us with an opportunity to decode the
collided signals without relying on stable signals.
Motivated by this observation, we propose a graphical
model, called one-flip-graph OFG, to capture the
transition pattern of collided signals, and design a
reliable approach to construct the OFG in a manner
robust to the diversity in backscatter systems. Then,
FlipTracer can resolve the collided signals by tracking
the OFG. We have implemented FlipTracer and evaluated
its performance with extensive experiments across a
wide variety of scenarios. Our experimental results
have shown that FlipTracer achieves a maximum
aggregated throughput that approaches 2 Mb/s, which is
$ 6 \times $ higher than 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{Han:2019:EED,
author = "Zhenhua Han and Haisheng Tan and Rui Wang and Guihai
Chen and Yupeng Li and Francis Chi Moon Lau",
title = "Energy-Efficient Dynamic Virtual Machine Management in
Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "344--360",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891787",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Efficient virtual machine VM management can
dramatically reduce energy consumption in data centers.
Existing VM management algorithms fall into two
categories based on whether the VMs' resource demands
are assumed to be static or dynamic. The former
category fails to maximize the resource utilization as
they cannot adapt to the dynamic nature of VMs'
resource demands. Most approaches in the latter
category are heuristic and lack theoretical performance
guarantees. In this paper, we formulate the dynamic VM
management as a large-scale Markov decision process MDP
problem and derive an optimal solution. Our analysis of
real-world data traces supports our choice of the
modeling approach. However, solving the large-scale MDP
problem suffers from the curse of dimensionality.
Therefore, we further exploit the special structure of
the problem and propose an approximate MDP-based
dynamic VM management method, called MadVM. We prove
the convergence of MadVM and analyze the bound of its
approximation error. Moreover, we show that MadVM can
be implemented in a distributed system with at most two
times of the optimal migration cost. Extensive
simulations based on two real-world workload traces
show that MadVM achieves significant performance gains
over two existing baseline approaches in power
consumption, resource shortage, and the number of VM
migrations. Specifically, the more intensely the
resource demands fluctuate, the more MadVM
outperforms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Luo:2019:PPP,
author = "Chengwen Luo and Xiao Liu and Wanli Xue and Yiran Shen
and Jianqiang Li and Wen Hu and Alex X. Liu",
title = "Predictable Privacy-Preserving Mobile Crowd Sensing: a
Tale of Two Roles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "361--374",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2890860",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The rise of mobile crowd sensing has brought privacy
issues into a sharp view. In this paper, our goal is to
achieve the predictable privacy-preserving mobile crowd
sensing, which we envision to have the capability to
quantify the privacy protections, and simultaneously
allowing application users to predict the utility loss
at the same time. The Salus algorithm is first proposed
to protect the private data against the data
reconstruction attacks. To understand privacy
protection, we quantify the privacy risks in terms of
private data leakage under reconstruction attacks. To
predict the utility, we provide accurate utility
predictions for various crowd sensing applications
using Salus. The risk assessments can be generally
applied to different type of sensors on the mobile
platform, and the utility prediction can also be used
to support various applications that use data
aggregators such as average, histogram, and
classifiers. Finally, we propose and implement the $
P^3 $ application framework. Both measurement results
using online datasets and real-world case studies show
that the $ P^3 $ provides accurate risk assessments and
utility estimations, which makes it a promising
framework to support future privacy-preserving
mobilecrowd sensing applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sun:2019:FHA,
author = "Yahui Sun and Marcus Brazil and Doreen Thomas and
Saman Halgamuge",
title = "The Fast Heuristic Algorithms and Post-Processing
Techniques to Design Large and Low-Cost Communication
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "375--388",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2888864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It is challenging to design large and low-cost
communication networks. In this paper, we formulate
this challenge as the prize-collecting Steiner Tree
Problem PCSTP. The objective is to minimize the costs
of transmission routes and the disconnected monetary or
informational profits. Initially, we note that the
PCSTP is MAX SNP-hard. Then, we propose some
post-processing techniques to improve suboptimal
solutions to PCSTP. Based on these techniques, we
propose two fast heuristic algorithms: the first one is
a quasilinear time heuristic algorithm that is faster
and consumes less memory than other algorithms; and the
second one is an improvement of a state-of-the-art
polynomial time heuristic algorithm that can find
high-quality solutions at a speed that is only inferior
to the first one. We demonstrate the competitiveness of
our heuristic algorithms by comparing them with the
state-of-the-art ones on the largest existing benchmark
instances 169 800 vertices and 338 551 edges. Moreover,
we generate new instances that are even larger 1 000
000 vertices and 10 000 000 edges to further
demonstrate their advantages in large networks. The
state-of-the-art algorithms are too slow to find
high-quality solutions for instances of this size,
whereas our new heuristic algorithms can do this in
around 6 to 45s on a personal computer. Ultimately, we
apply our post-processing techniques to update the
best-known solution for a notoriously difficult
benchmark instance to show that they can improve
near-optimal solutions to PCSTP. In conclusion, we
demonstrate the usefulness of our heuristic algorithms
and post-processing techniques for designing large and
low-cost communication networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:TAT,
author = "Sen Liu and Jiawei Huang and Yutao Zhou and Jianxin
Wang and Tian He",
title = "Task-Aware {TCP} in Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "389--404",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890010",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In modern data centers, many flow-based and task-based
schemes have been proposed to speed up the data
transmission in order to provide fast, reliable
services for millions of users. However, the existing
flow-based schemes treat all flows in isolation,
contributing less to or even hurting user experience
due to the stalled flows. Other prevalent task-based
approaches, such as centralized and decentralized
scheduling, are sophisticated or unable to share task
information. In this work, we first reveal that the
relinquishing bandwidth of leading flows to the stalled
ones effectively reduces the task completion time. We
further present the design and implementation of a
general supporting scheme that shares the
flow-tardiness information through a receiver-driven
coordination. Our scheme can be flexible and widely
integrated with the state-of-the-art TCP protocols
designed for data centers in either single stage or
multiple stage scenario, while making no modification
on switches. Through the testbed experiments and
simulations of typical data center applications, we
show that in single stage scenario, our scheme reduces
the task completion time by 70\% and 50\% compared with
the flow-based protocols e.g., DCTCP, L2DCT and
task-based scheduling e.g., Baraat, respectively.
Moreover, our scheme also outperforms other approaches
by 18\%--25\% in prevalent topologies of the data
center. For multiple stage scenario, our scheme also
has up to 50\% improvement compared to other schemes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bouchoucha:2019:TIU,
author = "Taha Bouchoucha and Chen-Nee Chuah and Zhi Ding",
title = "Topology Inference of Unknown Networks Based on Robust
Virtual Coordinate Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "405--418",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2888600",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Learning and exploring the connectivity of unknown
networks represent an important problem in practical
applications of communication networks and social-media
networks. Modeling large-scale networks as connected
graphs is highly desirable to extract their
connectivity information among nodes to visualize
network topology, disseminate data, and improve routing
efficiency. This paper investigates a simple
measurement model in which a small subset of source
nodes collect hop distance information from networked
nodes in order to generate a virtual coordinate system
VCS for networks of unknown topology. We establish the
VCS to define logical distance among nodes based on
principal component analysis and to determine
connectivity relationship and effective routing
methods. More importantly, we present a robust
analytical algorithm to derive the VCS against
practical issues of missing and corrupted measurements.
We also develop a connectivity inference method which
classifies nodes into layers based on the hop distances
and derives partial information on network
connectivity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lynch:2019:ASO,
author = "David Lynch and Michael Fenton and David Fagan and
Stepan Kucera and Holger Claussen and Michael O'Neill",
title = "Automated Self-Optimization in Heterogeneous Wireless
Communications Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "419--432",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890547",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traditional single-tiered wireless communications
networks cannot scale to satisfy exponentially rising
demand. Operators are increasing capacity by densifying
their existing macro cell deployments with co-channel
small cells. However, cross-tier interference and load
balancing issues present new optimization challenges in
channel sharing heterogeneous networks HetNets.
One-size-fits-all heuristics for allocating resources
are highly suboptimal, but designing ad hoc controllers
requires significant human expertise and manual
fine-tuning. In this paper, a unified, flexible, and
fully automated approach for end-to-end optimization in
multi-layer HetNets is presented. A hill climbing
algorithm is developed for reconfiguring cells in real
time in order to track dynamic traffic patterns.
Schedulers for allocating spectrum to user equipment
are automatically synthesized using grammar-based
genetic programming. The proposed methods for
configuring the HetNet and scheduling in the
time--frequency domain can address ad hoc objective
functions. Thus, the operator can flexibly tune the
tradeoff between peak rates and fairness. Far cell edge
downlink rates are increased by up to 250\% compared
with non-adaptive baselines. Alternatively, peak rates
are increased by up to 340\%. The experiments
illustrate the utility and future potential of natural
computing techniques in software-defined wireless
communications networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Agarwal:2019:VPR,
author = "Satyam Agarwal and Francesco Malandrino and Carla
Fabiana Chiasserini and Swades De",
title = "{VNF} Placement and Resource Allocation for the
Support of Vertical Services in {$5$G} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "433--446",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "One of the main goals of 5G networks is to support the
technological and business needs of various industries
the so-called verticals, which wish to offer to their
customers a wide range of services characterized by
diverse performance requirements. In this context, a
critical challenge lies in mapping in an automated
manner the requirements of verticals into decisions
concerning the network infrastructure, including VNF
placement, resource assignment, and traffic routing. In
this paper, we seek to make such decisions jointly,
accounting for their mutual interaction, efficiently.
To this end, we formulate a queuing-based model and use
it at the network orchestrator to optimally match the
vertical's requirements to the available system
resources. We then propose a fast and efficient
solution strategy, called MaxZ, which allows us to
reduce the solution complexity. Our performance
evaluation, carried out an accounting for multiple
scenarios representing the real-world services, shows
that MaxZ performs substantially better than the
state-of-the-art alternatives and consistently close to
the optimum.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lu:2019:LRB,
author = "Li Lu and Jiadi Yu and Yingying Chen and Hongbo Liu
and Yanmin Zhu and Linghe Kong and Minglu Li",
title = "Lip Reading-Based User Authentication Through Acoustic
Sensing on {Smartphones}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "1",
pages = "447--460",
month = feb,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891733",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To prevent users' privacy from leakage, more and more
mobile devices employ biometric-based authentication
approaches, such as fingerprint, face recognition,
voiceprint authentications, and so on, to enhance the
privacy protection. However, these approaches are
vulnerable to replay attacks. Although the state-of-art
solutions utilize liveness verification to combat the
attacks, existing approaches are sensitive to ambient
environments, such as ambient lights and surrounding
audible noises. Toward this end, we explore liveness
verification of user authentication leveraging users'
mouth movements, which are robust to noisy
environments. In this paper, we propose a lip
reading-based user authentication system, LipPass,
which extracts unique behavioral characteristics of
users' speaking mouths through acoustic sensing on
smartphones for user authentication. We first
investigate Doppler profiles of acoustic signals caused
by users' speaking mouths and find that there are
unique mouth movement patterns for different
individuals. To characterize the mouth movements, we
propose a deep learning-based method to extract
efficient features from Doppler profiles and employ
softmax function, support vector machine, and support
vector domain description to construct multi-class
identifier, binary classifiers, and spoofer detectors
for mouth state identification, user identification,
and spoofer detection, respectively. Afterward, we
develop a balanced binary tree-based authentication
approach to accurately identify each individual
leveraging these binary classifiers and spoofer
detectors with respect to registered users. Through
extensive experiments involving 48 volunteers in four
real environments, LipPass can achieve 90.2\% accuracy
in user identification and 93.1\% accuracy in spoofer
detection.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sule:2019:SCB,
author = "Oladele Theophilus Sule and Roberto Rojas-Cessa and
Ziqian Dong and Chuan-Bi Lin",
title = "A Split-Central-Buffered Load-Balancing {Clos}-Network
Switch With In-Order Forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "467--476",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2883747",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We propose a configuration scheme for a load-balancing
Clos-network LBC packet switch that has split central
modules and buffers in between the split modules. Our
split-central-buffered LBC switch is cell-based. The
switch has four stages, namely input, central-input,
central-output, and output stages. The proposed
configuration scheme uses a pre-determined and periodic
interconnection pattern in the input and split central
modules to load-balance and route traffic. The LBC
switch has low configuration complexity. The operation
of the switch includes a mechanism applied at input and
split-central modules to forward cells in sequence. The
switch achieves 100\% throughput under uniform and
nonuniform admissible traffic with independent and
identical distributions i.i.d.. The switch uses no
speedup nor memory expansion. We demonstrate the
properties of the switch through traffic and timing
analysis.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dehghan:2019:SCR,
author = "Mostafa Dehghan and Weibo Chu and Philippe Nain and
Don Towsley and Zhi-Li Zhang",
title = "Sharing Cache Resources Among Content Providers: a
Utility-Based Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "477--490",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2890512",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we consider the problem of allocating
cache resources among multiple content providers. The
cache can be partitioned into slices and each partition
can be dedicated to a particular content provider or
shared among a number of them. It is assumed that each
partition employs the least recently used policy for
managing content. We propose utility-driven
partitioning, where we associate with each content
provide a utility that is a function of the hit rate
observed by the content provider. We consider two
scenarios: 1 content providers serve disjoint sets of
files and 2 there is some overlap in the content served
by multiple content providers. In the first case, we
prove that cache partitioning outperforms cache sharing
as cache size and a number of contents served by
providers go to infinity. In the second case, it can be
beneficial to have separate partitions for overlapped
content. In the case of two providers, it is usually
always beneficial to allocate a cache partition to
serve all overlapped content and separate partitions to
serve the non-overlapped contents of both providers. We
establish conditions when this is true asymptotically
but also present an example where it is not true
asymptotically. We develop online algorithms that
dynamically adjust partition sizes in order to maximize
the overall utility and prove that they converge to
optimal solutions, and through numerical evaluations we
show they are effective.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2019:DCN,
author = "Chang-Heng Wang and Jaime Llorca and Antonia M. Tulino
and Tara Javidi",
title = "Dynamic Cloud Network Control Under Reconfiguration
Delay and Cost",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "491--504",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2892148",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network virtualization and programmability allow
operators to deploy a wide range of services over a
common physical infrastructure and elastically allocate
cloud and network resources according to changing
requirements. While the elastic reconfiguration of
virtual resources enables dynamically scaling capacity
in order to support service demands with minimal
operational cost, reconfiguration operations make
resources unavailable during a given time period and
may incur additional cost. In this paper, we address
the dynamic cloud network control problem under
non-negligible reconfiguration delay and cost. We show
that while the capacity region remains unchanged
regardless of the reconfiguration delay/cost values, a
reconfiguration-agnostic policy may fail to guarantee
throughput-optimality and minimum cost under nonzero
reconfiguration delay/cost. We then present an adaptive
dynamic cloud network control policy that allows
network nodes to make local flow scheduling and
resource allocation decisions while controlling the
frequency of reconfiguration in order to support any
input rate in the capacity region and achieve
arbitrarily close to minimum cost for any finite
reconfiguration delay/cost values.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rao:2019:UIP,
author = "Vijay S. Rao and R. Venkatesha Prasad and T. V.
Prabhakar and Chayan Sarkar and Madhusudan Koppal and
Ignas Niemegeers",
title = "Understanding and Improving the Performance of
Constructive Interference Using Destructive
Interference in {WSNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "505--517",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2893597",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The constructive interference CI phenomenon has been
exploited by a number of protocols for providing
energy-efficient, low-latency, and reliable data
collection and dissemination services in wireless
sensor networks. These protocols consider CI to provide
highly reliable packet delivery. This has attracted
attention to understand the working of CI; however, the
existing works present inconsistent views. Furthermore,
these works do not study in the real-world settings
where the physical conditions of deployment and
unreliable wireless channels also impact the
performance of CI. Therefore, we study the phenomenon
of CI, considering a receiver's viewpoint and analyze
the parameters that affect CI. We validate our
arguments with results from extensive and rigorous
experimentation in real-world settings. This paper
presents comprehensive insights into the CI phenomenon.
With the understanding, we develop the destructive
interference-based power adaptation DIPA, an
energy-efficient and distributed algorithm, that adapts
transmission power to improve the performance of CI.
Since CI-based protocols cannot have an explicit
acknowledgment packet, we make use of destructive
interference on a designated byte to provide a
feedback. We leverage this feedback to adapt
transmission powers. We compared CI with and without
DIPA in two real-life testbeds. On one testbed, we
achieve around 25\% lower packet losses while using
only half of its transmission power for 64-B packets.
On the other testbed, we achieve 25\% lower packet
losses while consuming only 47\% of its transmission
power for 128-B packets. Existing CI-based protocols
can easily incorporate DIPA into them to achieve lower
packet losses and higher energy efficiencies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xia:2019:EBC,
author = "Xianjin Xia and Shining Li and Yu Zhang and Bingqi Li
and Yuanqing Zheng and Tao Gu",
title = "Enabling Out-of-Band Coordination of {Wi-Fi}
Communications on {Smartphones}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "518--531",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891263",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper identifies two energy saving opportunities
of Wi-Fi interface emerged during smartphone's
screen-off periods. Exploiting the opportunities, we
propose a new power saving strategy, BackPSM, for
screen-off Wi-Fi communications. BackPSM regulates
client to send and receive packets in batches and
coordinates multiple clients to communicate at
different slots i.e., beacon interval. The core problem
in BackPSM is how to coordinate client without
incurring extra traffic overheads. To handle the
problem, we propose a novel paradigm, Out-of-Band
Communication OBC, for client-to-client direct
communications. OBC exploits the Traffic Indication Map
TIM field of Wi-Fi Beacon to create a free side-channel
between clients. It is based upon the observation that
a client may control $ 1 \rightarrow 0 $ appearing on
TIM bit by locally regulating packet receiving
operations. We adopt this $ 1 \rightarrow 0 $ as the
basic signal, and leverage the time length in between
two signals to encode information. We demonstrate that
OBC can be used to convey coordination information with
close to 100\% accuracy. We have implemented and
evaluated BackPSM on a testbed. The results show that
BackPSM can decode the traffic pattern of peers
reliably using OBC, and establish collision-free
schedules fast to achieve out-of-band coordination of
client communications. BackPSM reduces screen-off
energy by up to 60\% and outperforms the
state-of-the-art strategies by 16\%--42\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Koprulu:2019:BOE,
author = "Irem Koprulu and Yoora Kim and Ness B. Shroff",
title = "Battle of Opinions Over Evolving Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "532--545",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2894324",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Social networking environments provide major platforms
for the discussion and formation of opinions in diverse
areas, including, but not limited to, political
discourse, market trends, news, and social movements.
Often, these opinions are of a competing nature, e.g.,
radical vs. peaceful ideologies, correct information
vs. misinformation, and one technology vs. another. We
study the battles of such competing opinions over
evolving social networks. The novelty of our model is
that it captures the exposure and adoption dynamics of
opinions that account for the preferential and random
nature of exposure as well as the persuasion power and
persistence of different opinions. We provide a
complete characterization of the mean opinion dynamics
over time as a function of the initial adoption, as
well as the particular exposure, adoption, and
persistence dynamics. Our analysis, supported by case
studies, reveals the key metrics that govern the spread
of opinions and establishes the means to engineer the
desired impact of an opinion in the presence of other
competing opinions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Song:2019:MCD,
author = "Liang Song and Chunyan Liu and Hejiao Huang and
Hongwei Du and Xiaohua Jia",
title = "Minimum Connected Dominating Set Under Routing Cost
Constraint in Wireless Sensor Networks With Different
Transmission Ranges",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "546--559",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2894749",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks WSNs are used to cover
destination areas for a lot of practical applications.
To enhance the performance of the WSN, the virtual
backbone based on the connected dominating set is an
efficient way with respect to the routing cost between
sensors, lifetime of entire network, and so on. In this
paper, especially for the WSN with different
transmission radii among different sensors, we study
the problem of constructing the minimum $ \rho $ -range
connected dominating set under the constraint $ \alpha
$ -times of the minimum routing cost $ \alpha $ MOC-$
\rho $ CDS, where $ \alpha \ge 5 $ and $ \rho $ is the
ratio of the maximum-to-minimum transmission radius.
Our contributions are three folds. First, we propose a
polynomial time approximation scheme which generates
the $ \alpha $ MOC-$ \rho $ CDS with the size of at
most $ 1 + \epsilon $ times of the optimum solution,
where $ \epsilon $ is the error parameter. Second, we
propose a polynomial time algorithm and prove that it
has two approximation ratios $ 6 \rho + 1^22 \rho + 1^2
$ and $ 10 \lceil {2 \pi } / {\theta } \rceil \lfloor
{\ln 3 \rho } / {\ln 1 / \cos \theta } \rfloor \approx
\lfloor {\ln \rho } / {\ln 2 \cos \pi / 5} \rfloor $,
where $ \theta < \arcsin {1} / {3 \rho } $. Finally, we
propose the distributed version of the constant
approximation ratio algorithm which has both the time
complexity and message complexity $ O n^3 $, where $n$
is the number of sensor nodes. Besides, the simulation
results demonstrate the efficiency of our algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Atya:2019:CMI,
author = "Ahmed Osama Fathy Atya and Zhiyun Qian and Srikanth V.
Krishnamurthy and Thomas {La Porta} and Patrick
McDaniel and Lisa M. Marvel",
title = "Catch Me if You Can: a Closer Look at Malicious
Co-Residency on the Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "560--576",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2891528",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "VM migration is an effective countermeasure against
attempts at malicious co-residency. In this paper, our
overarching objectives are: a to get an in-depth
understanding of the ways and effectiveness with which
an attacker can launch attacks toward achieving
co-residency and b to design migration policies that
are very effective in thwarting malicious co-residency,
but are thrifty in terms of the bandwidth and downtime
costs that are incurred with live migration. Toward
achieving our goals, we first undertake an experimental
study on Amazon EC2 to obtain an in-depth understanding
of the side-channels, through which an attacker can use
to ascertain co-residency with a victim. Here, in this
paper, we identify a new set of stealthy side-channel
attacks which we show to be more effective than the
currently available attacks toward verifying
co-residency. We also build a simple model that can be
used for estimating co-residency times based on very
few measurements on a given cloud platform, to account
for varying attacker capabilities. Based on the study,
we develop a set of guidelines to determine under what
conditions the victim VM migrations should be
triggered, given the performance costs in terms of
bandwidth and downtime, which a user is willing to
bear. Through extensive experiments on our private
in-house cloud, we show that the migrations, using our
guidelines, can limit the fraction of the time that an
attacker VM co-resides with a victim VM to about 1\% of
the time with the bandwidth costs of a few MB and
downtimes of a few seconds per day per VM migrated.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bajpai:2019:LVD,
author = "Vaibhav Bajpai and Jurgen Schonwalder",
title = "A Longitudinal View of Dual-Stacked {Websites} ---
Failures, Latency and Happy Eyeballs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "577--590",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2895165",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "IPv6 measurement studies have focussed on measuring
IPv6 adoption, while studies on measuring IPv6
performance have either become dated or only provide a
snapshot view. We provide a longitudinal view of the
performance of dual-stacked websites. We show that
since 2013 latency towards ALEXA 10K websites with AAAA
entries over the six years have reduced by 29\% over
IPv4 and by 57\% over IPv6. As of Dec 2018, 56\% of
these websites are faster over IPv6 with 95\% of the
rest being at most 1 ms slower. We also identify
glitches in web content delivery that once fixed can
help improve the user experience over IPv6. Using a
publicly available dataset, we show that 40\% of ALEXA
1M websites with AAAA entries were not accessible over
IPv6 in 2009. These complete failures have reduced to
1.9\% as of Jan 2019. However, our data collection on
partial failures helps identify further that 27\% of
these popular websites with AAAA entries still suffer
from partial failure over IPv6. These partial failures
are affected by DNS resolution errors on images,
javascript and CSS content. For 12\% of these websites,
more than half of the content belonging to same-origin
sources fails over IPv6, while analytics and
third-party advertisements contribute to failures from
cross-origin sources. Our results also contribute to
the IETF standardisation process. We witness that using
an happy eyeballs timer value of 250 ms, clients prefer
IPv6 connections to 99\% of ALEXA 10 K websites with
AAAA entries more than 96\% of the time. Although, this
makes clients prefer slower IPv6 connections in 81\% of
the cases. Our results show that a Happy Eyeballs MBA
timer value of 150 ms does not severely affect IPv6
preference towards websites. The entire dataset
presenting results on partial failures, latency and HE
used in this paper is publicly released.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tillman:2019:GCF,
author = "Balint Tillman and Athina Markopoulou and Minas Gjoka
and Carter T. Buttsc",
title = "{2K+} Graph Construction Framework: Targeting Joint
Degree Matrix and Beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "591--606",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2895853",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of generating
synthetic graphs that resemble real-world graphs in
terms of their degree correlations and potentially
additional properties. We present an algorithmic
framework that generates simple undirected graphs with
the exact target joint degree matrix, which we refer to
as 2K graphs, in linear time in the number of edges.
Our framework imposes minimal constraints on the graph
structure, which allows us to target additional graph
properties during construction, namely, node attributes
2K+A, clustering both average clustering, 2.25K, and
degree-dependent clustering, 2.5K, and number of
connected components 2K+CC. We also define, for the
first time, the problem of directed 2K graph
construction, provide necessary and sufficient
conditions for realizability, and develop efficient
construction algorithms. We evaluate our approach by
creating synthetic graphs that target real-world graphs
both undirected such as Facebook and directed such as
Twitter, and we show that it brings significant
benefits, in terms of accuracy and running time,
compared to the state-of-the-art approaches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ramakrishnan:2019:CUA,
author = "S. Ramakrishnan and Venkatesh Ramaiyan",
title = "Completely Uncoupled Algorithms for Network Utility
Maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "607--620",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2892801",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present two completely uncoupled
algorithms for utility maximization. In the first part,
we present an algorithm that can be applied for general
non-concave utilities. We show that this algorithm
induces a perturbed by $ {\epsilon } $ Markov chain,
whose stochastically stable states are the set of
actions that maximize the sum utility. In the second
part, we present an approximate sub-gradient algorithm
for concave utilities, which is considerably faster and
requires lesser memory. We study the performance of the
sub-gradient algorithm for decreasing and fixed step
sizes. We show that, for decreasing step sizes, the
Cesaro averages of the utilities converges to a
neighborhood of the optimal sum utility. For constant
step size, we show that the time average utility
converges to a neighborhood of the optimal sum utility.
Our main contribution is the expansion of the
achievable rate region, which has not been considered
in the previous paper on completely uncoupled
algorithms for utility maximization. This expansion
aids in allocating a fair share of resources to the
nodes, which is important in applications like channel
selection, user association, and power control.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2019:TSE,
author = "Xin Li and Minmei Wang and Huazhe Wang and Ye Yu and
Chen Qian",
title = "Toward Secure and Efficient Communication for the
{Internet of Things}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "621--634",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2893249",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet of Things has been widely applied in everyday
life, ranging from transportation and healthcare to
smart homes. As most IoT devices carry constrained
resources and limited storage capacity, sensing data
need to be transmitted to and stored at resource-rich
platforms, such as a cloud. IoT applications need to
retrieve sensing data from the cloud for analysis and
decision-making purposes. Ensuring the authenticity and
integrity of the sensing data is essential for the
correctness and safety of IoT applications. We
summarize the new challenges of the IoT data
communication with authenticity and integrity and argue
that existing solutions cannot be easily adopted to
resource-constraint IoT devices. We present two
solutions called dynamic tree chaining and geometric
star chaining that provide efficient and secure
communication for the Internet of Things. Extensive
simulations and prototype emulation experiments driven
by real IoT data show that the proposed system is more
efficient than alternative solutions in terms of time
and space.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Naumann:2019:PBD,
author = "Roman Naumann and Stefan Dietzel and Bjorn
Scheuermann",
title = "Push the Barrier: Discrete Event Protocol Emulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "635--648",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2897310",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The protocol evaluation is an integral part of network
protocol design. From the perspective of experimental
design, discrete event simulations constitute a middle
ground between analytical protocol evaluation and
testbeds. They allow precise control of otherwise
external influences while supporting more detailed
protocol models than analytical evaluations. Compared
to testbeds, a major restriction is that existing
protocols require a separate implementation in the
discrete event model. Creating this implementation
model may cause differences between the protocol's
simulator-based model and the native implementation,
invalidating simulation results. We propose a novel
architecture to evaluate unmodified, binary protocol
implementations in the state-of-the-art discrete event
simulators by utilizing the operating system's system
call barrier. Notably, our approach does not affect
discrete simulation properties, such as repeatability,
and it does not require the native protocol
implementation's source code. The evaluation results
using existing network protocols show the feasibility
of our approach in combination with the ns-3 simulator
core. We show that our approach more closely resembles
realistic protocol performance when compared to
simulator-based protocol models. Moreover, our approach
performs better than existing solutions for more
realistic protocol simulations.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2019:TAE,
author = "Xiang Li and J. David Smith and Thang N. Dinh and My
T. Thai",
title = "{TipTop}: Almost Exact Solutions for Influence
Maximization in Billion-Scale Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "649--661",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2898413",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the cost-aware target viral
marketing CTVM problem, a generalization of influence
maximization. CTVM asks for the most cost-effective
users to influence the most relevant users. In contrast
to the vast literature, we attempt to offer exact
solutions. As the problem is NP-hard, thus, exact
solutions are intractable, we propose TipTop, a $ 1 -
\epsilon $ -optimal solution for arbitrary $ \epsilon
\& g t; 0 $ that scales to very large networks, such as
Twitter. At the heart of TipTop lies an innovative
technique that reduces the number of samples as much as
possible. This allows us to exactly solve CTVM on a
much smaller space of generated samples using integer
programming. Furthermore, TipTop lends a tool for
researchers to benchmark their solutions against the
optimal one in large-scale networks, which is currently
not available.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Caballero:2019:NSG,
author = "Pablo Caballero and Albert Banchs and Gustavo {De
Veciana} and Xavier Costa-Perez",
title = "Network Slicing Games: Enabling Customization in
Multi-Tenant Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "662--675",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2895378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network slicing to enable resource sharing among
multiple tenants--network operators and/or services--is
considered as a key functionality for next generation
mobile networks. This paper provides an analysis of a
well-known model for resource sharing, the
share-constrained proportional allocation mechanism, to
realize network slicing. This mechanism enables tenants
to reap the performance benefits of sharing, while
retaining the ability to customize their own users'
allocation. This results in a network slicing game in
which each tenant reacts to the user allocations of the
other tenants so as to maximize its own utility. We
show that, for elastic traffic, the game associated
with such strategic behavior converges to a Nash
equilibrium. At the Nash equilibrium, a tenant always
achieves the same or better performance than that of a
static partitioning of resources, thus providing the
same level of protection as static partitioning. We
further analyze the efficiency and fairness of the
resulting allocations, providing tight bounds for the
price of anarchy and envy-freeness. Our analysis and
extensive simulation results confirm that the mechanism
provides a comprehensive practical solution to realize
network slicing. Our theoretical results also fills a
gap in the analysis of this resource allocation model
under strategic players.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2019:IPP,
author = "Ming-Chun Lee and Andreas F. Molisch and Nishanth
Sastry and Aravindh Raman",
title = "Individual Preference Probability Modeling and
Parameterization for Video Content in Wireless Caching
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "676--690",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2896562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Caching of video files at the wireless edge, i.e., at
the base stations or on user devices, is a key method
for improving wireless video delivery. While global
popularity distributions of video content have been
investigated in the past and used in a variety of
caching algorithms, this paper investigates the
statistical modeling of the individual user
preferences. With individual preferences being
represented by probabilities, we identify their
critical features and parameters and propose a novel
modeling framework by using a genre-based hierarchical
structure as well as a parameterization of the
framework based on an extensive real-world data set.
Besides, the correlation analysis between parameters
and critical statistics of the framework is conducted.
With the framework, an implementation recipe for
generating practical individual preference
probabilities is proposed. By comparing with the
underlying real data, we show that the proposed models
and generation approach can effectively characterize
the individual preferences of users for video
content.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Afek:2019:ZDS,
author = "Yehuda Afek and Anat Bremler-Barr and Shir Landau
Feibish",
title = "Zero-Day Signature Extraction for High-Volume
Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "691--706",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2899124",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We present a basic tool for zero day attack signature
extraction. Given two large sets of messages, $P$ the
messages captured in the network at peacetime i.e.,
mostly legitimate traffic and $A$ the messages captured
during attack time i.e., contains many attack messages,
we present a tool for extracting a set $S$ of strings
that are frequently found in $A$ and not in $P$, thus
allowing the identification of the attack packets. This
is an important tool in protecting sites on the
Internet from worm attacks and distributed denial of
service attacks and may also be useful for other
problems, including command and control identification
and the DNA-sequences analysis. The main contributions
of this paper are the system we developed to extract
the required signatures together with the string-heavy
hitters problem definition and the algorithm for
solving this problem. This algorithm finds popular
strings of variable length in a set of messages, using,
in a tricky way, the classic heavy-hitter algorithm as
a building block. The algorithm runs in linear time
requiring one-pass over the input. Our system makes use
of this algorithm to extract the desired signatures.
Furthermore, we provide an extended algorithm which is
able to identify groups of signatures, often found
together in the same packets, which further improves
the quality of signatures generated by our system.
Using our system, a yet unknown attack can be detected
and stopped within minutes from attack start time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Basile:2019:ASA,
author = "Cataldo Basile and Fulvio Valenza and Antonio Lioy and
Diego R. Lopez and Antonio Pastor Perales",
title = "Adding Support for Automatic Enforcement of Security
Policies in {NFV} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "707--720",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2895278",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces an approach toward the automatic
enforcement of security policies in network functions
virtualization NFV networks and dynamic adaptation to
network changes. The approach relies on a refinement
model that allows the dynamic transformation of
high-level security requirements into configuration
settings for the network security functions NSFs, and
optimization models that allow the optimal selection of
the NSFs to use. These models are built on a
formalization of the NSF capabilities, which serves to
unequivocally describe what NSFs are able to do for
security policy enforcement purposes. The approach
proposed is the first step toward a security policy
aware NFV management, orchestration, and resource
allocation system --- a paradigm shift for the
management of virtualized networks --- and it requires
minor changes to the current NFV architecture. We prove
that our approach is feasible, as it has been
implemented by extending the OpenMANO framework and
validated on several network scenarios. Furthermore, we
prove with performance tests that policy refinement
scales well enough to support current and future
virtualized networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2019:ABF,
author = "Hui Cui and Robert H. Deng and Guilin Wang",
title = "An Attribute-Based Framework for Secure Communications
in Vehicular Ad Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "721--733",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2894625",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we introduce an attribute-based
framework to achieve secure communications in vehicular
ad hoc networks VANETs, which enjoys several
advantageous features. The proposed framework employs
attribute-based signature ABS to achieve message
authentication and integrity and protect vehicle
privacy, which greatly mitigates the overhead caused by
pseudonym/private key change or update in the existing
solutions for VANETs based on symmetric key, asymmetric
key, and identity-based cryptography and group
signature. In addition, we extend a standard ABS scheme
with traceability and revocation mechanisms and
seamlessly integrate them into the proposed framework
to support vehicle traceability and revocation by a
trusted authority, and thus, the resulting scheme for
vehicular communications does not suffer from the
anonymity misuse issue, which has been a challenge for
anonymous credential-based vehicular protocols.
Finally, we implement the proposed ABS scheme using a
rapid prototyping tool called Charm to evaluate its
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chatterjee:2019:SPM,
author = "Bijoy Chand Chatterjee and Fujun He and Eiji Oki and
Andrea Fumagalli and Naoaki Yamanaka",
title = "A Span Power Management Scheme for Rapid Lightpath
Provisioning and Releasing in Multi-Core Fiber
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "734--747",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2895231",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The lightpath provisioning time or releasing time is
adversely affected by the time that optical amplifiers
require to adjust to a newly added or terminated signal
power. This shortcoming is particularly true with
multi-core erbium-doped amplifiers EDFAs, as multi-core
transient-suppressed EDFAs are unavailable at the
current time. This paper proposes a fiber span power
management scheme based on dummy wavelength signals
that are used to shorten the lightpath provisioning and
releasing times in multi-core fiber networks. With the
shorter time of lightpath provisioning and releasing
procedures, the total time that is required to reserve
wavelengths in the system is decreased, which means
that network resources are used more efficiently. As a
result, the blocking performance and average waiting
time in the system are improved. To evaluate the
performance of the proposed scheme, this paper
introduces both analytical model and simulation study.
In the introduced model, the ratio of the number of
activating and activated dummy wavelengths to the
number of dummy wavelengths in each span is considered
in the range between 0 and 1. The analysis reveals that
the performance of the proposed scheme depends on $
\alpha $, which is the ratio of the number of dummy
wavelengths to the number of dummy and lightpath
wavelengths in each span, and there exists a point of $
\alpha $ where the blocking probability becomes
minimum. We further observe that the proposed scheme
outperforms the conventional approaches in terms of
blocking probability and average waiting time, as
traffic loads increase. Finally, we provide the
direction on how our introduced model can be considered
for a network with multi-span routes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xiao:2019:ECA,
author = "Qingjun Xiao and Youlin Zhang and Shigang Chen and Min
Chen and Jia Liu and Guang Cheng and Junzhou Luo",
title = "Estimating Cardinality of Arbitrary Expression of
Multiple Tag Sets in a Distributed {RFID} System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "748--762",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2894729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio-frequency identification RFID technology has
been widely adopted in various industries and people's
daily lives. This paper studies a fundamental function
of spatial-temporal joint cardinality estimation in
distributed RFID systems. It allows a user to make
queries over multiple tag sets that are present at
different locations and times in a distributed tagged
system. It estimates the joint cardinalities of those
tag sets with bounded error. This function has many
potential applications for tracking product flows in
large warehouses and distributed logistics networks.
The prior art is either limited to jointly analyzing
only two tag sets or is designed for a relative
accuracy model, which may cause unbounded time cost.
Addressing these limitations, we propose a novel design
of the joint cardinality estimation function with two
major components. The first component is to record
snapshots of the tag sets in a system at different
locations and periodically, in a time-efficient way.
The second component is to develop accurate estimators
that extract the joint cardinalities of chosen tag sets
based on their snapshots, with a bounded error that can
be set arbitrarily small. We formally analyze the bias
and variance of the estimators, and we develop a method
for setting their optimal system parameters. The
simulation results show that, under predefined accuracy
requirements, our new solution reduces time cost by
multiple folds when compared with 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{Nayak:2019:MMU,
author = "Peshal Nayak and Michele Garetto and Edward W.
Knightly",
title = "Modeling Multi-User {WLANs} Under Closed-Loop
Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "763--776",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2899777",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we present the first cross-layer
analysis of wireless LANs operating under downlink
multi-user multi-in multi-out MU-MIMO, considering the
fundamental role played by the closed-loop TCP traffic.
In particular, we consider a scenario in which the
access point transmits on the downlink via MU-MIMO,
whereas stations must employ single-user transmissions
on the uplink, as is the case in IEEE 802.11ac. With
the help of analytical models built for different
regimes that can occur in the considered system, we
identify and explain crucial performance anomalies that
can result in very low throughput in some scenarios,
completely offsetting the theoretical gains achievable
by MU-MIMO. We discuss solutions to mitigate the risk
of this performance degradation and alternative uplink
strategies allowing WLANs to approach their maximum
theoretical capacity under MU-MIMO.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghasemi:2019:GTB,
author = "Chavoosh Ghasemi and Hamed Yousefi and Kang G. Shin
and Beichuan Zhang",
title = "On the Granularity of Trie-Based Data Structures for
Name Lookups and Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "777--789",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2901487",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Name lookup is an essential function but a performance
bottleneck in both today's and future network
architectures. Trie is an excellent candidate data
structure and has been widely used for looking up and
updating names. However, the granularity of trie --- at
bit, byte character, or component level --- can
dramatically affect the network performance in terms of
memory usage and packet-processing speed, which has not
yet been studied adequately. To fill this gap, we first
show that the choice of trie's granularity for name
lookups and updates i.e., insertions and removals is
not a trivial problem due to the complex performance
tradeoffs involved. We also introduce a new tool,
called NameGen, which uses a Markov-based name learning
model and generates pseudo-real datasets with different
tunable name characteristics. We compare different trie
granularities based on a collection of datasets and
performance metrics, highlight the strengths and
weaknesses of each granularity, and draw a conclusion
on the choice of granularity. Surprisingly, our
experimental evaluation finds that there are only two
key rules to choose the proper trie's granularity for
any kind of dataset: 1 bit-level trie is the choice
when the memory requirement is a real concern and 2
character- and component-level tries are preferred for
faster lookups and updates when dealing with names
composed of short and long components, respectively.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tseng:2019:RSH,
author = "Shih-Hao Tseng and Ao Tang and Gagan L. Choudhury and
Simon Tse",
title = "Routing Stability in Hybrid Software-Defined
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "790--804",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2900199",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Software-defined networks SDNs facilitate more
efficient routing of traffic flows using centralized
network view. On the other hand, traditional
distributed routing still enjoys the advantage of
better scalability, robustness, and swift reaction to
events such as failure. There are therefore significant
potential benefits to adopt a hybrid operation where
both distributed and centralized routing mechanisms
co-exist. This hybrid operation however imposes a new
challenge to network stability since a poor and
inconsistent design can lead to repeated route
switching when the two control mechanisms take turns to
adjust the routes. In this paper, we discuss ways of
solving the stability problem. We first define
stability for hybrid SDNs and then establish a
per-priority stabilizing framework to obtain stable
routing patterns. For each priority class, we discuss
three approaches to reach hybrid SDN stability: global
optimization, greedy, and local search. It is argued
that the proposed local search provides the best
tradeoff among cost performance, computational
complexity, and route disturbance. Furthermore, we
design a system on a centralized controller, which
utilizes those algorithms to stabilize the network. The
design is implemented and extensively tested by
simulations using realistic network information,
including a trace of the Abilene network and data from
a tier-1 Internet service providers backbone network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gao:2019:ODD,
author = "Kai Gao and Qiao Xiang and Xin Wang and Yang Richard
Yang and Jun Bi",
title = "An Objective-Driven On-Demand Network Abstraction for
Adaptive Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "805--818",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2899905",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Revealing an abstract view of the network is essential
for the new paradigm of developing network-aware
adaptive applications that can fully leverage the
available computation and storage resources and achieve
better business values. In this paper, we introduce
ONV, a novel abstraction of flow-based on-demand
network view. The ONV models network views as linear
constraints on network-related variables in
application-layer objective functions, and provides
``equivalent'' network views that allow applications to
achieve the same optimal objectives as if they have the
global information. We prove the lower bound for the
number of links contained in an equivalent network
view, and propose two algorithms to effectively
calculate on-demand equivalent network views. We
evaluate the efficacy and the efficiency of our
algorithms extensively with real-world topologies.
Evaluations demonstrate that the ONV can simplify the
network up to 80\% while maintaining an equivalent view
of the network. Even for a large network with more than
25 000 links and a request containing 3000 flows, the
result can be effectively computed in less than 1 min
on a commodity server.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2019:TTS,
author = "Qiongzheng Lin and Lei Yang and Chunhui Duan and
Zhenlin An",
title = "{Tash}: Toward Selective Reading as Hash Primitives
for {Gen2} {RFIDs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "819--834",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2896348",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Deployment of billions of commercial off-the-shelf
COTS radio frequency identification RFID tags has drawn
much of the attention of the research community because
of the performance gaps of current systems. In
particular, hash-enabled protocol HEP is one of the
most thoroughly studied topics in the past decade. HEPs
are designed for a wide spectrum of notable
applications e.g., missing detection without need to
collect all tags. HEPs assume that each tag contains a
hash function, such that a tag can select a random but
predictable time slot to reply with a one-bit presence
signal that shows its existence. However, the hash
function has never been implemented in COTS tags in
reality, which makes HEPs a ten-year untouchable
mirage. This paper designs and implements a group of
analog on-tag hash primitives called Tash for COTS
Gen2-compatible RFID systems, which moves prior HEPs
forward from theory to practice. In particular, we
design three types of hash primitives, namely, tash
function, tash table function, and tash operator. All
of these hash primitives are implemented through the
selective reading, which is a fundamental and mandatory
functionality specified in Gen2 protocol, without any
hardware modification and fabrication --- a feature
allowing zero-cost fast deployment on billions of Gen2
tags. We further apply our hash primitives in one
typical HEP application i.e., missing detection to show
the feasibility and effectiveness of Tash. Results from
our prototype, which is composed of one ImpinJ reader
and 3000 Alien tags, demonstrate that the new design
lowers 70\% of the communication overhead in the air.
The tash operator can additionally introduce an
overhead drop of 29.7\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Al-Abbasi:2019:MTC,
author = "Abubakr O. Al-Abbasi and Vaneet Aggarwal and Moo-Ryong
Ra",
title = "Multi-Tier Caching Analysis in {CDN}-Based
Over-the-Top Video Streaming Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "835--847",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2900434",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet video traffic has been rapidly increasing and
is further expected to increase with the emerging 5G
applications, such as higher definition videos, the
IoT, and augmented/virtual reality applications. As end
users consume video in massive amounts and in an
increasing number of ways, the content distribution
network CDN should be efficiently managed to improve
the system efficiency. The streaming service can
include multiple caching tiers, at the distributed
servers and the edge routers, and efficient content
management at these locations affects the quality of
experience QoE of the end users. In this paper, we
propose a model for video streaming systems, typically
composed of a centralized origin server, several CDN
sites, and edge-caches located closer to the end user.
We comprehensively consider different systems design
factors, including the limited caching space at the CDN
sites, allocation of CDN for a video request, choice of
different ports or paths from the CDN and the central
storage, bandwidth allocation, the edge-cache capacity,
and the caching policy. We focus on minimizing a
performance metric, stall duration tail probability
SDTP, and present a novel and efficient algorithm
accounting for the multiple design flexibilities. The
theoretical bounds with respect to the SDTP metric are
also analyzed and presented. The implementation of a
virtualized cloud system managed by Openstack
demonstrates that the proposed algorithms can
significantly improve the SDTP metric compared with the
baseline strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2019:PPT,
author = "Qian Wang and Jing Huang and Yanjiao Chen and Xin Tian
and Qian Zhang",
title = "Privacy-Preserving and Truthful Double Auction for
Heterogeneous Spectrum",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "848--861",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2903879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Over the past decades, there have been extensive
research endeavors in spectrum auction design. However,
most solutions only focus on the allocation efficiency
while ignoring the privacy leakage inherent in the
process of spectrum auction. So far, the very few
existing works on secure spectrum auctions either
provide inadequate privacy protection or incur
performance loss in terms of spectrum reusability. In
this paper, for the first time, we propose PS-TAHES, a
privacy-preserving and truthful double auction
mechanism for heterogeneous spectrum. PS-TAHES is
constructed based on our carefully designed security
primitives, which can support various arithmetics over
encrypted data, including multiplication, bid
comparison, and sorting matrix, and they are well
applicable in other contexts. We theoretically analyze
the security and efficiency of PS-TAHES, which is
proved to ensure a full and strong privacy protection
for bidders while preserving the allocation efficiency
of the original auction mechanism. Experimental
results, consistent with the theoretical analysis,
further validate the practical use of PS-TAHES in
real-world applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Phalak:2019:ZRP,
author = "Kunal Phalak and D. Manjunath and Jayakrishnan Nair",
title = "Zero Rating: The Power in the Middle",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "862--874",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2903156",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many flavors of differential data pricing are being
practiced in different telecom markets. One popular
version is zero-rating, where customers do not pay for
consuming a certain basket of ``zero-rated'' content.
These zero-rated services are in turn sponsored by
payments to the Internet service provider ISP by the
corresponding content providers CPs. In this paper, we
provide an analytical treatment of a zero-rating
platform, highlighting the effect of zero-rating on the
structure of the CP market and also on the surplus of
ISPs, CPs, and users. A leader--follower game is
assumed with the ISP setting the prices for users for
non-sponsored data and CPs for sponsored data, CPs
making a binary decision on sponsorship and users
consuming content based on the resulting data charges.
User consumption is determined by a utility
maximization, the sponsorship decision is determined by
a Nash equilibrium between the CPs, and the ISP sets
prices to maximize its profit. Several scenarios
mimicking real-life practices are analyzed. Our results
indicate that zero-rating grants the ISP significant
power to determine the mix of content consumption and
the profitability of the CPs. Furthermore, the ISP can
also take away a significant portion of the surplus in
the system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Doncel:2019:PDP,
author = "Josu Doncel and Samuli Aalto and Urtzi Ayesta",
title = "Performance Degradation in Parallel-Server Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "875--888",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2902531",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a parallel-server system with homogeneous
servers where incoming tasks, arriving at rate $
\lambda $, are dispatched by $n$ dispatchers, each of
them balancing a fraction $ 1 / n$ of the load to $ K /
n$ servers. Servers are first-come-first-served FCFS
queues and dispatchers implement size interval task
assignment policy with equal load SITA-E, a size-based
policy such that the servers are equally loaded. We
compare the performance of a system with $ n \& g t; 1$
dispatchers and a single dispatcher. We show that the
performance of a system with $n$ dispatchers, $K$
servers, and arrival rate $ \lambda $ coincides with
that of a system with one dispatcher, $ K / n$ servers,
and arrival rate $ \lambda / n$. We define the
degradation factor as the ratio between the performance
of a system with $K$ servers and arrival rate $ \lambda
$ and the performance of a system with $ K / n$ servers
and arrival rate $ \lambda / n$. We establish a partial
monotonicity on $n$ for the degradation factor and,
therefore, the degradation factor is lower bounded by
one. We then investigate the upper bound of the
degradation factor for particular distributions. We
consider two continuous service time distributions:
uniform and bounded Pareto and a discrete distribution
with two values, which is the distribution that
maximizes the variance for a given mean. We show that
the performance degradation is small for uniformly
distributed job sizes but that for Bounded Pareto and
two points distributions it can be unbounded. We have
investigated the degradation using the distribution
obtained from real traces.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hu:2019:TPP,
author = "Shuihai Hu and Yibo Zhu and Peng Cheng and Chuanxiong
Guo and Kun Tan and Jitendra Padhye and Kai Chen",
title = "{Tagger}: Practical {PFC} Deadlock Prevention in Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "2",
pages = "889--902",
month = apr,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2902875",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 20 18:15:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Remote direct memory access over converged Ethernet
deployments is vulnerable to deadlocks induced by
priority flow control. Prior solutions for deadlock
prevention either require significant changes to
routing protocols or require excessive buffers in the
switches. In this paper, we propose Tagger, a scheme
for deadlock prevention. It does not require any
changes to the routing protocol and needs only modest
buffers. Tagger is based on the insight that given a
set of expected lossless routes, a simple tagging
scheme can be developed to ensure that no deadlock will
occur under any failure conditions. Packets that do not
travel on these lossless routes may be dropped under
extreme conditions. We design such a scheme, prove that
it prevents deadlock, and implement it efficiently on
commodity hardware.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Neely:2019:CAU,
author = "Michael J. Neely",
title = "Convergence and Adaptation for Utility Optimal
Opportunistic Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "904--917",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914695",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers the fundamental convergence time
for opportunistic scheduling over time-varying
channels. The channel state probabilities are unknown
and algorithms must perform some type of estimation and
learning while they make decisions to optimize network
utility. Existing schemes can achieve a utility within
$ \epsilon $ of optimality, for any desired $ \epsilon
> 0 $, with convergence and adaptation times of $ O1 /
\epsilon^2 $. This paper shows that if the utility
function is concave and smooth, then $ O \log 1 /
\epsilon / \epsilon $ convergence time is possible via
an existing stochastic variation on the Frank-Wolfe
algorithm, called the RUN algorithm. Furthermore, a
converse result is proven to show it is impossible for
any algorithm to have convergence time better than $ O1
/ \epsilon $, provided the algorithm has no a-priori
knowledge of channel state probabilities. Hence, RUN is
within a logarithmic factor of convergence time
optimality. However, RUN has a vanishing stepsize and
hence has an infinite adaptation time. Using stochastic
Frank-Wolfe with a fixed stepsize yields improved $ O1
/ \epsilon^2 $ adaptation time, but convergence time
increases to $ O1 / \epsilon^2 $, similar to existing
drift-plus-penalty based algorithms. This raises
important open questions regarding optimal
adaptation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chisci:2019:UMW,
author = "Giovanni Chisci and Hesham Elsawy and Andrea Conti and
Mohamed-Slim Alouini and Moe Z. Win",
title = "Uncoordinated Massive Wireless Networks:
Spatiotemporal Models and Multiaccess Strategies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "918--931",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2892709",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The massive wireless networks MWNs enable surging
applications for the Internet of Things and cyber
physical systems. In these applications, nodes
typically exhibit stringent power constraints, limited
computing capabilities, and sporadic traffic patterns.
This paper develops a spatiotemporal model to
characterize and design uncoordinated multiple access
UMA strategies for MWNs. By combining stochastic
geometry and queueing theory, the paper quantifies the
scalability of UMA via the maximum spatiotemporal
traffic density that can be accommodated in the
network, while satisfying the target operational
constraints e.g., stability for a given percentile of
the nodes. The developed framework is then used to
design UMA strategies that stabilize the node data
buffers and achieve desirable latency, buffer size, and
data rate.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chi:2019:CCT,
author = "Zicheng Chi and Yan Li and Hongyu Sun and Yao and Ting
Zhu",
title = "Concurrent Cross-Technology Communication Among
Heterogeneous {IoT} Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "932--947",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2908754",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The exponentially increasing number of Internet of
Things IoT devices and the data generated by these
devices introduces the spectrum crisis at the already
crowded ISM 2.4-GHz band. To address this issue and
enable more flexible and concurrent communications
among IoT devices, we propose $ B^2 W^2 $, a novel
communication framework that enables $N$ -way
concurrent communication among Wi-Fi and Bluetooth low
energy BLE devices. Specifically, we demonstrate that
it is possible to enable the BLE to Wi-Fi
cross-technology communication while supporting the
concurrent BLE to BLE and Wi-Fi to Wi-Fi
communications. We conducted extensive experiments
under different real-world settings, and results show
that its throughput is more than 85$ \times $ times
higher than that of the most recently reported
cross-technology communication system, which only
supports one-way communication i.e., broadcasting at
any specific time.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:EPB,
author = "Jia Liu and Bin Xiao and Xuan Liu and Kai Bu and Lijun
Chen and Changhai Nie",
title = "Efficient Polling-Based Information Collection in
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "948--961",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2906802",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "RFID tags have been widely deployed to report valuable
information about tagged objects or surrounding
environment. To collect such information, the key is to
avoid the tag-to-tag collision in the open wireless
channel. Polling, as a widely used anti-collision
protocol, provides a request-response way to
interrogate tags. The basic polling however needs to
broadcast the tedious tag ID 96 bits to query a tag,
which is time-consuming. For example, collecting only
1-bit information e.g., battery status but with 96-bit
overhead is a great limitation. This paper studies how
to design efficient polling protocols to collect tag
information quickly. The basic idea is to minimize the
length of the polling vector as well as to avoid
useless communication. We first propose an efficient
Hash polling protocol HPP that uses hash indices rather
than tag IDs as the polling vector to query each tag.
The length of the polling vector is dropped from 96
bits to no more than 16 bits the number of tags is less
than 100,000. We then propose a tree-based polling
protocol TPP that avoids redundant transmission in HPP.
By constructing a binary polling tree, TPP transmits
only different postfix of the neighbor polling vectors;
the same prefix is reserved without any retransmission.
The result is that the length of the polling vector
reduces to only 3.4 bits. Finally, we propose an
incremental polling protocol IPP that updates the
polling vector based on the difference in value between
the current polling vector and the previous one. By
sorting the indices and dynamically updating them, IPP
drops the polling vector to 1.6 bits long, 60 times
less than 96-bit IDs. Extensive simulation results show
that our best protocol IPP outperforms the
state-of-the-art information collection protocol.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kiani:2019:HCP,
author = "Abbas Kiani and Nirwan Ansari and Abdallah Khreishah",
title = "Hierarchical Capacity Provisioning for Fog Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "962--971",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2906638",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The concept of fog computing is centered around
providing computation resources at the edge of the
network, thereby reducing the latency and improving the
quality of service. However, it is still desirable to
investigate how and where at the edge of the network
the computation capacity should be provisioned. To this
end, we propose a hierarchical capacity provisioning
scheme. In particular, we consider a two-tier network
architecture consisting of shallow and deep cloudlets
and explore the benefits of hierarchical capacity
provisioning based on queuing analysis. Moreover, we
explore two different network scenarios in which the
network delay between the two tiers is negligible and
the case that the deep cloudlet is located somewhere
deeper in the network and thus the delay is
significant. More importantly, we model the first
network delay scenario with bufferless shallow
cloudlets and the second scenario with finite-size
buffer shallow cloudlets, and formulate an optimization
problem for each model. We also use stochastic ordering
to solve the optimization problem formulated for the
first model and an upper bound-based technique is
proposed for the second model. The performance of the
proposed scheme is evaluated via simulations in which
we show the accuracy of the proposed upper bound
technique and the queue length estimation approach for
both randomly generated input and real trace data.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gu:2019:TBS,
author = "Jiaxi Gu and Jiliang Wang and Zhiwen Yu and Kele
Shen",
title = "Traffic-Based Side-Channel Attack in Video Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "972--985",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2906568",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Video streaming takes up an increasing proportion of
network traffic nowadays. Dynamic adaptive streaming
over HTTP DASH becomes the de facto standard of video
streaming and it is adopted by Youtube, Netflix, and so
on. Despite of the popularity, network traffic during
video streaming shows an identifiable pattern which
brings threat to user privacy. In this paper, we
propose a video identification method using network
traffic while streaming. Though there is bitrate
adaptation in DASH streaming, we observe that the video
bitrate trend remains relatively stable because of the
widely used variable bit-rate VBR encoding.
Accordingly, we design a robust video feature
extraction method for eavesdropped video streaming
traffic. Meanwhile, we design a VBR-based video
fingerprinting method for candidate video set which can
be built using downloaded video files. Finally, we
propose an efficient partial matching method for
computing similarities between video fingerprints and
streaming traces to derive video identities. We
evaluate our attack method in different scenarios for
various video content, segment lengths, and quality
levels. The experimental results show that the
identification accuracy can reach up to 90\% using only
three-minute continuous network traffic
eavesdropping.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2019:HPM,
author = "Meng Zhang and Lin Gao and Jianwei Huang and Michael
L. Honig",
title = "Hybrid Pricing for Mobile Collaborative {Internet}
Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "986--999",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911123",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile collaborative Internet access MCA enables
mobile users to share their Internet through flexible
tethering arrangements. This can potentially make
better use of network resources. However, from a mobile
network operator's MNO's viewpoint, it can either
reduce revenue or increase congestion, and thus has
been blocked by some MNOs in practice. We propose a
hybrid pricing framework for MNOs who charge users
separately for access and tethering. This scheme serves
to coordinate the tethering decisions of mobile users
with MNO network management objectives. We analyze the
MNOs' equilibrium pricing strategies in both
cooperative and competitive scenarios. In the
cooperative scenario, at the equilibrium, each user's
cost is independent of any chosen tethering links. We
then characterize the optimal hybrid pricing strategies
of MNOs in this scenario. For the competitive scenario,
we formulate the MNOs' competitive interactions as a
pricing game, and we show that MNO competition leads to
equalized prices for users if an equilibrium exists but
does not guarantee its existence. Both insights
motivate a quantity competition game, which is shown to
guarantee equilibrium. Simulation results show that in
scenarios of interest the proposed hybrid pricing
schemes can double both MNOs' profit and users' payoff
and such improvements increase with the degree of
network heterogeneity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{DiBartolomeo:2019:ERE,
author = "Marco {Di Bartolomeo} and Valentino {Di Donato} and
Maurizio Pizzonia and Claudio Squarcella and Massimo
Rimondini",
title = "Extracting Routing Events From Traceroutes: a Matter
of Empathy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1000--1012",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911330",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the increasing diffusion of Internet probing
technologies, a large amount of regularly collected
traceroutes are available for Internet service
providers ISPs at low cost. We show how it is possible,
given solely an arbitrary set of traceroutes, to spot
routing paths that change similarly over time and
aggregate them into inferred routing events. With
respect to previous works, our approach does not
require any knowledge of the network, does not need
complex integration of several data sources, and
exploits the asynchronicity of measurements to
accurately position events in time. The formal model at
the basis of our methodology revolves around the notion
of empathy, a relation that binds similarly behaving
traceroutes. The correctness and completeness of our
approach are based on structural properties that are
easily expressed in terms of empathic measurements. We
perform experiments with data from public measurement
infrastructures like RIPE Atlas, showing the
effectiveness of our algorithm in distilling
significant events from a large amount of traceroute
data. We also validate the accuracy of the inferred
events against ground-truth knowledge of routing
changes originating from induced and spontaneous
routing events. Given these promising results, we
believe that our methodology can be an effective aid
for troubleshooting at the ISPs level. The source code
of our algorithm is publicly available at
https://github.com/empadig.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Dehghan:2019:UOA,
author = "Mostafa Dehghan and Laurent Massoulie and Don Towsley
and Daniel Sadoc Menasche and Y. C. Tay",
title = "A Utility Optimization Approach to Network Cache
Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1013--1027",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2913677",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In any caching system, the admission and eviction
policies determine which contents are added and removed
from a cache when a miss occurs. Usually, these
policies are devised so as to mitigate staleness and
increase the hit probability. Nonetheless, the utility
of having a high hit probability can vary across
contents. This occurs, for instance, when service level
agreements must be met, or if certain contents are more
difficult to obtain than others. In this paper, we
propose utility-driven caching, where we associate with
each content a utility, which is a function of the
corresponding content hit probability. We formulate
optimization problems where the objectives are to
maximize the sum of utilities over all contents. These
problems differ according to the stringency of the
cache capacity constraint. Our framework enables us to
reverse engineer classical replacement policies such as
LRU and FIFO, by computing the utility functions that
they maximize. We also develop online algorithms that
can be used by service providers to implement various
caching policies based on arbitrary utility
functions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qiu:2019:ROS,
author = "Tie Qiu and Jie Liu and Weisheng Si and Dapeng Oliver
Wu",
title = "Robustness Optimization Scheme With Multi-Population
Co-Evolution for Scale-Free Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1028--1042",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2907243",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks WSNs have been the popular
targets for cyberattacks these days. One type of
network topology for WSNs, the scale-free topology, can
effectively withstand random attacks in which the nodes
in the topology are randomly selected as targets.
However, it is fragile to malicious attacks in which
the nodes with high node degrees are selected as
targets. Thus, how to improve the robustness of the
scale-free topology against malicious attacks becomes a
critical issue. To tackle this problem, this paper
proposes a Robustness Optimization scheme with
multi-population Co-evolution for scale-free wireless
sensor networKS ROCKS to improve the robustness of the
scale-free topology. We build initial scale-free
topologies according to the characteristics of WSNs in
the real-world environment. Then, we apply our ROCKS
with novel crossover operator and mutation operator to
optimize the robustness of the scale-free topologies
constructed for WSNs. For a scale-free WSNs topology,
our proposed algorithm keeps the initial degree of each
node unchanged such that the optimized topology remains
scale-free. Based on a well-known metric for the
robustness against malicious attacks, our experiment
results show that ROCKS roughly doubles the robustness
of initial scale-free WSNs, and outperforms two
existing algorithms by about 16\% when the network size
is large.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cayci:2019:OLD,
author = "Semih Cayci and Atilla Eryilmaz",
title = "Optimal Learning for Dynamic Coding in
Deadline-Constrained Multi-Channel Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1043--1054",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2913666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the problem of serving randomly arriving and
delay-sensitive traffic over a multi-channel
communication system with time-varying channel states
and unknown statistics. This problem deviates from the
classical exploration-exploitation setting in that the
design and analysis must accommodate the dynamics of
packet availability and urgency as well as the cost of
each channel use at the time of decision. To that end,
we have developed and investigated an index-based
policy upper confidence bound UCB-deadline, which
performs dynamic channel allocation decisions that
incorporate these traffic requirements and costs. Under
symmetric channel conditions, we have proved that the
UCB-deadline policy can achieve bounded regret in the
likely case where the cost of using a channel is not
too high to prevent all transmissions, and logarithmic
regret otherwise. In this case, we show that
UCB-deadline is order-optimal. We also perform
numerical investigations to validate the theoretical
fundings, and also compare the performance of the
UCB-deadline to another learning algorithm that we
propose based on Thompson sampling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kong:2019:MRS,
author = "Linghe Kong and Yifeng Cao and Liang He and Guihai
Chen and Min-You Wu and Tian He",
title = "Multi-Rate Selection in {ZigBee}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1055--1068",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2913014",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "ZigBee is a widely used wireless technology in
low-power and short-range scenarios such as the
Internet of Things, sensor networks, and industrial
wireless networks. However, the traditional ZigBee
supports only one data rate, 250 Kbps, which thoroughly
limits ZigBee's efficiency in dynamic wireless
channels. In this paper, we propose Mrs. Z, a novel
physical layer design to enable multi-rate selection in
ZigBee with lightweight modification on the legacy
ZigBee modules. The key idea is to change the single
spectrum spreading length to multiple ones.
Correspondingly, to support the rate adaptation to the
channel variations, we propose a bit-error-based rate
selection scheme, which predicts BER by leveraging the
physical properties of ZigBee to calculate the
confidence for each symbol in transmission. Then, the
receiver selects the rate based on the negative impact
on throughput incurred by bit errors and gives feedback
to the transceiver. We implement Mrs. Z on USRPs and
evaluate its performance in different scenarios.
Experiment results demonstrate that Mrs. Z achieves
about 1.15, 1.2, and 1.8 $ \times $ average throughput
compared to the classic smart pilot, softrate, and the
traditional ZigBee.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jiang:2019:BBC,
author = "Wenchao Jiang and Zhimeng Yin and Ruofeng Liu and
Zhijun Li and Song Min Kim and Tian He",
title = "Boosting the Bitrate of Cross-Technology Communication
on Commodity {IoT} Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1069--1083",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2913980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The cross-technology communication CTC is a promising
technique proposed recently to bridge heterogeneous
wireless technologies in the ISM bands. Existing
solutions use only the coarse-grained packet-level
information for CTC modulation, suffering from a low
throughput e.g., 10 b/s. Our approach, called BlueBee,
explores the dense PHY-layer information for CTC by
emulating legitimate ZigBee frames with the Bluetooth
radio. Uniquely, BlueBee achieves dual-standard
compliance and transparency for its only modifying the
payload of Bluetooth frames, requiring neither hardware
nor firmware changes at either the Bluetooth sender or
the ZigBee receiver. Our implementation on both USRP
and commodity devices shows that BlueBee can achieve
standard ZigBee bit rate of 250 kb/s at more than 99\%
accuracy, which is over $ 10000 \times $ faster than
the state-of-the-art packet-level CTC technologies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Honda:2019:NWD,
author = "Hirotada Honda and Hiroshi Saito",
title = "Nation-Wide Disaster Avoidance Control Against Heavy
Rain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1084--1097",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911234",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "This paper proposes an algorithm for disaster
avoidance control against heavy rainfall. According to
weather information, the algorithm reconfigures a
logical network slice, including the migration of
virtual machines VMs, to avoid disasters. It was
applied to a nationwide network of 105 nodes and 140
edges, including cases with more than 10 000 slices.
Through numerical simulations using actual data of
rainfall that caused significant damage in Japan, we
found that the probability of service disruption under
the proposed control with suitable parameter settings
is 10\%--30\% of that without control, on average. Our
proposed control experimental system is implemented by
using the software-defined network technology. It can
migrate VMs and estimates VM migration time to
determine how many VMs should be migrated. By using the
experimental system, we found that the control interval
has an optimal value, which depends on the management
system processing capacity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2019:UPR,
author = "Zongzong Lin and Wenlian Lu and Shouhuai Xu",
title = "Unified Preventive and Reactive Cyber Defense Dynamics
Is Still Globally Convergent",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1098--1111",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2912847",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A class of the preventive and reactive cyber defense
dynamics has recently been proven to be globally
convergent, meaning that the dynamics always converges
to a unique equilibrium whose location only depends on
the values of the model parameters but not the initial
state of the dynamics. In this paper, we unify the
aforementioned class of preventive and reactive cyber
defense dynamics models and the closely related class
of $N$ -intertwined epidemic models into a single
framework. We prove that the unified dynamics is still
globally convergent under some mild conditions, which
are naturally satisfied by the two specific classes of
dynamics models mentioned above and are inevitable when
analyzing a more general framework. We also
characterize the convergence speed of the unified
dynamics. As a corollary, we obtain that the $N$
-intertwined epidemic model and its extension are
globally convergent, together with a full
characterization on their convergence speed, which is
only partially addressed 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{Pai:2019:DCC,
author = "Kung-Jui Pai and Jou-Ming Chang",
title = "{Dual-CISTs}: Configuring a Protection Routing on Some
{Cayley} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1112--1123",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2910019",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A set of $ k \geqslant 2 $ spanning trees in the
underlying graph of a network topology is called
completely independent spanning trees, CISTs for short,
if they are pairwise edge-disjoint and
inner-node-disjoint. Particularly, if $ k = 2 $, the
two CISTs are called a dual-CIST. However, it has been
proved that determining if there exists a dual-CIST in
a graph is an NP-hard problem. Kwong et al. [IEEE/ACM
Transactions Networking 195 1543--1556, 2011] defined
that a routing is protected, if there is an alternate
with loop-free forwarding, when a single link or node
failure occurs. Shortly afterward, Tapolcai [Optim.
Lett. 74 723--730, 2013] showed that a network
possessing a dual-CIST suffices to establish a
protection routing. It is well-known that Cayley graphs
have a large number of desirable properties of
interconnection networks. Although many results of
constructing dual-CISTs on interconnection networks
have been proposed in the literature, so far, the work
has not been dealt with on Cayley graphs due to that
their expansions are in exponential scalability. In
this paper, we try to make a breakthrough of this work
on some famous subclasses of Cayley graphs, including
alternating group networks, bubble-sort network, and
star networks. We first propose tree searching
algorithms for helping the construction of dual-CISTs
on low-dimensional networks. Then, by inductive
construction, we show that dual-CISTs on
high-dimensional networks can also be constructed
agreeably. As a result, we can configure protection
routings by using the constructed dual-CISTs. In
addition, we complement some analysis with a simulation
study of the proposed construction to evaluate the
corresponding performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2019:ERD,
author = "Zonghui Li and Hai Wan and Zaiyu Pang and Qiubo Chen
and Yangdong Deng and Xibin Zhao and Yue Gao and Xiaoyu
Song and Ming Gu",
title = "An Enhanced Reconfiguration for Deterministic
Transmission in Time-Triggered Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1124--1137",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The emerging momentum of digital transformation of
industry, i.e. Industry 4.0, poses strong demands for
integrating industrial control networks, and Ethernet
to enable the real-time Internet of Things RT-IoT.
Time-triggered TT networks provide a cost-efficient
integrated solution while RT-IoT arouses the
reconfiguration challenges: the network has to be
flexible enough to adapt to changes and yet provides
deterministic transmission persistently during network
reconfiguration. Software defined network benefits the
flexible industrial control by configuring the rules
handling frames. However, previous reconfiguration
mechanisms are mostly oriented to the context of data
centers and wide area networks and thus do not consider
the deterministic transmission in TT networks. This
paper focuses on the reconfiguration i.e., updates for
the deterministic transmission. To minimize the
overhead during updates, namely the minimum number of
loss frames and the minimum duration time of updates,
we first establish an update theory based on the
dependence relationship derived by the conflicts during
updates. In addition then the reconfiguration problem
is modeled with the dependence graph built by the
relationship. On such a basis, we present a
reconfiguration mechanism and its implementation to
solve the problem. Finally, we evaluate the proposed
reconfiguration mechanism in two real industrial
network topologies. The experimental results
demonstrate that compared with previous methods, our
mechanism significantly reduces the number of loss
frames and achieves zero loss in almost all cases.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Elgabli:2019:GPA,
author = "Anis Elgabli and Muhamad Felemban and Vaneet
Aggarwal",
title = "{GroupCast}: Preference-Aware Cooperative Video
Streaming With Scalable Video Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1138--1150",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a preference-aware
cooperative video streaming system for videos encoded
using scalable video coding SVC. In the proposed
system, the collaborating users are interested in
watching a video together on a shared screen. However,
the willingness of each user to cooperate is subject to
her own constraints such as user data plans. Using SVC,
videos are segmented into chunks and each chunk is
encoded using layers, where each layer can be fetched
through any of the collaborating users. We formulate
the problem of finding the optimal quality decisions
and fetching policy of the SVC layers of video chunks
subject to the available bandwidth, chunk deadlines,
and cooperation willingness of the different users as
an optimization problem. The objective is to optimize a
QoE metric that maintains a trade-off between
maximizing the playback rate of every chunk and
ensuring fairness among all chunks to achieve the
minimum skip stall duration without violating any of
the imposed constraints. We propose an offline
algorithm to solve the non-convex optimization problem
when the bandwidth prediction is non-causally known.
This algorithm has a run-time complexity that is
polynomial in the video length and the number of
collaborating users. Furthermore, we propose an online
version of the algorithm for practical scenarios, where
erroneous bandwidth prediction for a short window is
used. Real implementation with android devices using
SVC encoded video and a public dataset of bandwidth
traces reveals the robustness and performance of the
proposed algorithm and shows that the algorithm
significantly outperforms round robin-based mechanisms
in terms of avoiding skips/stalls and fetching video
chunks at their highest quality possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2019:MBF,
author = "Duong Tung Nguyen and Long Bao Le and Vijay K.
Bhargava",
title = "A Market-Based Framework for Multi-Resource Allocation
in Fog Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1151--1164",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2912077",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fog computing is transforming the network edge into an
intelligent platform by bringing storage, computing,
control, and networking functions closer to end users,
things, and sensors. How to allocate multiple resource
types e.g., CPU, memory, bandwidth of capacity-limited
heterogeneous fog nodes to competing services with
diverse requirements and preferences in a fair and
efficient manner is a challenging task. To this end, we
propose a novel market-based resource allocation
framework in which the services act as buyers and fog
resources act as divisible goods in the market. The
proposed framework aims to compute a market equilibrium
ME solution at which every service obtains its favorite
resource bundle under the budget constraint, while the
system achieves high resource utilization. This paper
extends the general equilibrium literature by
considering a practical case of satiated utility
functions. In addition, we introduce the notions of
non-wastefulness and frugality for equilibrium
selection and rigorously demonstrate that all the
non-wasteful and frugal ME are the optimal solutions to
a convex program. Furthermore, the proposed equilibrium
is shown to possess salient fairness properties,
including envy-freeness, sharing-incentive, and
proportionality. Another major contribution of this
paper is to develop a privacy-preserving distributed
algorithm, which is of independent interest, for
computing an ME while allowing market participants to
obfuscate their private information. Finally, extensive
performance evaluation is conducted to verify our
theoretical analyses.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chiariotti:2019:ADL,
author = "Federico Chiariotti and Stepan Kucera and Andrea
Zanella and Holger Claussen",
title = "Analysis and Design of a Latency Control Protocol for
Multi-Path Data Delivery With Pre-Defined {QoS}
Guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1165--1178",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911122",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As the capacity and reliability of mobile networks
increases, so does the demand for more responsive
end-to-end services: applications such as augmented
reality, live video conferencing, and smart or
autonomous vehicles require reliable,
throughput-intensive end-to-end communications with
strict delay constraints. Only consistently reliable
delivery of data flows well within human interactivity
deadlines will enable a truly immersive user
experience. To enable data delivery within pre-defined
deadlines, controlled on demand by an application or
its user, we propose and demonstrate a novel
transport-layer protocol for explicit latency control
called latency-controlled end-to-end aggregation
protocol LEAP. The LEAP splits a data flow with quality
of service QoS constraints into multiple subflows that
are delivered over multiple parallel links e.g., Wi-Fi
and LTE in a standard smartphone, WiGig, and 5G in the
near future. The subflow data rates are set based on a
novel proactive forecasting of the achievable channel
capacity, subject to application-specific QoS
constraints. Cross-path encoding and redundancy
adaptation are then used to deliberately balance the
trade-off between maximum throughput, required delay,
and minimum reliability as function of
application/user-specific input parameters. When
compared to leading state-of-the-art transport
protocols in live network experiments, LEAP exhibits a
superior capacity to reliably provide a high and stable
throughput with bounded latency, both in wired and
wireless scenarios. The LEAP is also the first protocol
to allow applications to explicitly set their
priorities, giving them the freedom to set the
operating point in the trade-off between throughput,
latency, and reliability.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:FRS,
author = "Xiulong Liu and Jiannong Cao and Yanni Yang and Wenyu
Qu and Xibin Zhao and Keqiu Li and Didi Yao",
title = "Fast {RFID} Sensory Data Collection: Trade-off Between
Computation and Communication Costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1179--1191",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914412",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the important sensory data
collection problem in the sensor-augmented RFID
systems, which is to quickly and accurately collect
sensory data from a predefined set of target tags with
the coexistence of unexpected tags. The existing RFID
data collection schemes suffer from either low
time-efficiency due to tag-collisions or serious data
corruption issue due to interference of unexpected
tags. To overcome these limitations, we propose the
hierarchical-hashing data collection HDC protocol,
which can not only significantly improve the
utilization of RFID wireless communication channel by
establishing bijective mapping between $k$ target tags
and the first $k$ slots in time frame, but also
effectively filter out the serious interference of
unexpected tags. Although HDC has attractive
advantages, the theoretical analysis reveals that the
computation cost involved in it is as huge as $
\mathcal {O} k2^k$, where $k$ is normally large in
practice. By making some modifications to the basic HDC
protocol, we propose the multi-framed
hierarchical-hashing data collection MHDC protocol to
effectively reduce the involved computation complexity.
Unlike HDC that only issues a single time frame, MHDC
uses multiple time frames to collaboratively collect
sensory data from the $k$ target tags. It can be
understood as that a big computation task is
disintegrated into multiple small pieces and then
shared by multiple time frames. As a result, the
computation cost involved in MHDC is reduced to $
\mathcal {O} k2^n$, where $ n \ll k$ is the expected
number of target tags that each time frame handles.
Theoretical analysis is given to jointly consider the
communication cost and computation cost thereby
maximizing the overall time-efficiency of MHDC.
Extensive simulation results reveal that the proposed
MHDC protocol can correctly collect all sensory data
and is always about more than $ 2 \times $ faster than
the state-of-the-art RFID sensory data collection
protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nguyen:2019:RFV,
author = "Thi-Minh Nguyen and Andre Girard and Catherine
Rosenberg and Serge Fdida",
title = "Routing via Functions in Virtual Networks: The Curse
of Choices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1192--1205",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2912717",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "An important evolution of the users' needs is
represented by the on-demand access to the network,
storage, and compute resources in order to dynamically
match the level of resource consumption with their
service requirements. The response of the network
providers is to transition to an architecture based on
softwarization and cloudification of the network
functions. This is the rationale for the deployment of
network functions virtualization NFV where virtual
network functions VNFs may be chained together to
create network services. Efficient online routing of
demand across nodes handling the functions involved in
a given service chain is the novel problem that we
address in this paper. We provide an original
formulation of this problem that includes link and CPU
capacity constraints and is based on the construction
of an expanded network. We derive the exact
mathematical formulation and propose several heuristic
algorithms taking into account the main system's
parameters. We conclude by deriving some interesting
insights both about the algorithms and the network
performance by comparing the heuristics with the exact
solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nam:2019:ODR,
author = "Jaehyun Nam and Hyeonseong Jo and Yeonkeun Kim and
Phillip Porras and Vinod Yegneswaran and Seungwon
Shin",
title = "Operator-Defined Reconfigurable Network {OS} for
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1206--1219",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914225",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Barista is a novel architecture that seeks to enable
flexible and customizable instantiations of network
operating systems NOSs for software-defined networks
SDNs. As the NOS is the strategic control center of an
SDN, implementing logic for management of network
switches as well as higher-level applications, its
design is critical to the welfare of the network. In
this paper, we focus on three aspects of composable
controller design: component synthesis, dynamic event
control, and predictive NOS assessment. First, the
modular design of the Barista enables flexible
composition of functionalities prevalent in
contemporary SDN controllers. Second, its event
handling mechanism enables dynamic customization of
control flows in a NOS. Third, its predictive NOS
assessment helps to discover the optimal composition
for the requirements specified by operators. These
capabilities allow Barista operators to optimally
select functionalities and dynamically handle events
for their operating requirements while maximizing the
resource utilization of the given system. Our results
demonstrate that Barista can synthesize NOSs with many
functionalities found in commodity controllers with
competitive performance profiles.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xue:2019:SEA,
author = "Kaiping Xue and Peixuan He and Xiang Zhang and Qiudong
Xia and David S. L. Wei and Hao Yue and Feng Wu",
title = "A Secure, Efficient, and Accountable Edge-Based Access
Control Framework for Information Centric Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1220--1233",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914189",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information centric networking ICN has been regarded
as an ideal architecture for the next-generation
network to handle users' increasing demand for content
delivery with in-network cache. While making better use
of network resources and providing better service
delivery, an effective access control mechanism is
needed due to the widely disseminated contents.
However, in the existing solutions, making
cache-enabled routers or content providers authenticate
users' requests causes high computation overhead and
unnecessary delay. Also, the straightforward
utilization of advanced encryption algorithms makes the
system vulnerable to DoS attacks. Besides, privacy
protection and service accountability are rarely taken
into account in this scenario. In this paper, we
propose SEAF, a secure, efficient, and accountable
edge-based access control framework for ICN, in which
authentication is performed at the network edge to
block unauthorized requests at the very beginning. We
adopt group signature to achieve anonymous
authentication and use hash chain technique to reduce
greatly the overhead when users make continuous
requests for the same file. At the same time, we
provide an efficient revocation method to make our
framework more robust. Furthermore, the content
providers can affirm the service amount received from
the network and extract feedback information from the
signatures and hash chains. By formal security analysis
and the comparison with related works, we show that
SEAF achieves the expected security goals and possesses
more useful features. The experimental results also
demonstrate that our design is efficient for routers
and content providers and bring in only slight delay
for users' content retrieval.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2019:VDS,
author = "Junjie Xie and Deke Guo and Chen Qian and Lei Liu and
Bangbang Ren and Honghui Chen",
title = "Validation of Distributed {SDN} Control Plane Under
Uncertain Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1234--1247",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914122",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The design of distributed control plane is an
essential part of SDN. While there is an urgent need
for verifying the control plane, little, however, is
known about how to validate that the control plane
offers assurable performance, especially across various
failures. Such validation is hard due to two
fundamental challenges. First, the number of potential
failure scenarios could be exponential or even
non-enumerable. Second, it is still an open problem to
model the performance change when the control plane
employs different failure recovery strategies. In this
paper, we first characterize the validation of the
distributed control plane as a robust optimization
problem and further propose a robust validation
framework to verify whether a control plane provides
assurable performance across various failure scenarios
and multiple failure recovery strategies. Then, we
prove that identifying an optimal recovery strategy is
NP-hard after developing an optimization model of
failure recovery. Accordingly, we design two efficient
failure recovery strategies, which can well approximate
the optimal strategy and further exhibit good
performance against potential failures. Furthermore, we
design the capacity augmentation scheme when the
control plane fails to accommodate the worst failure
scenario even with the optimal failure recovery
strategy. We have conducted extensive evaluations based
on an SDN test bed and large-scale simulations over
real network topologies. The evaluation results show
the efficiency and effectiveness of the proposed
validation framework.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bedewy:2019:AIM,
author = "Ahmed M. Bedewy and Yin Sun and Ness B. Shroff",
title = "The Age of Information in Multihop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1248--1257",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2915521",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information updates in multihop networks such as
Internet of Things IoT and intelligent transportation
systems have received significant recent attention. In
this paper, we minimize the age of a single information
flow in interference-free multihop networks. When
preemption is allowed and the packet transmission times
are exponentially distributed, we prove that a
preemptive last-generated, first-served LGFS policy
results in smaller age processes across all nodes in
the network than any other causal policy in a
stochastic ordering sense. In addition, for the class
of new-better-than-used NBU distributions, we show that
the non-preemptive LGFS policy is within a constant age
gap from the optimum average age. In contrast, our
numerical result shows that the preemptive LGFS policy
can be very far from the optimum for some NBU
transmission time distributions. Finally, when
preemption is prohibited and the packet transmission
times are arbitrarily distributed, the non-preemptive
LGFS policy is shown to minimize the age processes
across all nodes in the network among all
work-conserving policies again in a stochastic ordering
sense. Interestingly, these results hold under quite
general conditions, including 1 arbitrary packet
generation and arrival times, and 2 for minimizing both
the age processes in stochastic ordering and any
non-decreasing functional of the age processes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Deng:2019:ORS,
author = "Han Deng and Tao Zhao and I-Hong Hou",
title = "Online Routing and Scheduling With Capacity Redundancy
for Timely Delivery Guarantees in Multihop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1258--1271",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2917393",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "It has been shown that it is impossible to achieve
stringent timely delivery guarantees in a large network
without having complete information of all future
packet arrivals. In order to maintain desirable
performance in the presence of uncertainty of future, a
viable approach is to add redundancy by increasing link
capacities. This paper studies the amount of capacity
needed to provide stringent timely delivery guarantees.
We propose a low-complexity online algorithm and prove
that it only requires a small amount of redundancy to
guarantee the timely delivery of most packets.
Furthermore, we show that in large networks with very
high timely delivery requirements, the redundancy
needed by our policy is at most twice as large as the
theoretical lower bound. For practical implementation,
we propose a distributed protocol based on this
centralized policy. Without adding redundancy, we
further propose a low-complexity order-optimal online
policy for the network. The simulation results show
that our policies achieve much better performance than
the other state-of-the-art policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2019:DSM,
author = "Shiqiang Wang and Rahul Urgaonkar and Murtaza Zafer
and Ting He and Kevin Chan and Kin K. Leung",
title = "Dynamic Service Migration in Mobile Edge Computing
Based on {Markov} Decision Process",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1272--1288",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2916577",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In mobile edge computing, local edge servers can host
cloud-based services, which reduces network overhead
and latency but requires service migrations as users
move to new locations. It is challenging to make
migration decisions optimally because of the
uncertainty in such a dynamic cloud environment. In
this paper, we formulate the service migration problem
as a Markov decision process MDP. Our formulation
captures general cost models and provides a
mathematical framework to design optimal service
migration policies. In order to overcome the complexity
associated with computing the optimal policy, we
approximate the underlying state space by the distance
between the user and service locations. We show that
the resulting MDP is exact for the uniform 1-D user
mobility, while it provides a close approximation for
uniform 2-D mobility with a constant additive error. We
also propose a new algorithm and a numerical technique
for computing the optimal solution, which is
significantly faster than traditional methods based on
the standard value or policy iteration. We illustrate
the application of our solution in practical scenarios
where many theoretical assumptions are relaxed. Our
evaluations based on real-world mobility traces of San
Francisco taxis show the superior performance of the
proposed solution compared to baseline solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Santagati:2019:CSD,
author = "G. Enrico Santagati and Tommaso Melodia",
title = "Corrections to {``A Software-Defined Ultrasonic
Networking Framework for Wearable Devices''}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1289--1289",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2910937",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
note = "See \cite{Santagati:2017:SDU}.",
abstract = "In Section VI of the above paper [1], incorrectly
numbered reference citations were introduced during the
editing of the paper. The citations should be as
follows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chisci:2019:ISI,
author = "Giovanni Chisci and Andrea Conti and Lorenzo Mucchi
and Moe Z. Win",
title = "Intrinsic Secrecy in Inhomogeneous Stochastic
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1291--1304",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2911126",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network secrecy is vital for a variety of wireless
applications and can be accomplished by exploiting
network interference. Recently, interference
engineering strategies IESs have been developed to
harness network interference, depending on the wireless
environment node distribution, transmission policy, and
channel conditions. Typically, the node spatial
distribution has been modeled according to a
homogeneous Poisson point process for mathematical
tractability. However, such a model can be inadequate
for inhomogeneous e.g., sensor and vehicular networks.
This paper develops a framework for the design and
analysis of inhomogeneous wireless networks with
intrinsic secrecy. Based on the characterization of the
network interference and received
signal-to-interference ratio for different receiver
selection strategies. Local and global secrecy metrics
are introduced for characterizing the level of
intrinsic secrecy in inhomogeneous wireless networks
from a link and a network perspective. The benefits of
IESs are quantified by simulations in various
scenarios, thus corroborating the analysis. Results
show that IESs can elevate the network secrecy
significantly.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Nandigam:2019:SWL,
author = "Anvitha Nandigam and Suraj Jog and D. Manjunath and
Jayakrishnan Nair and Balakrishna J. Prabhu",
title = "Sharing Within Limits: Partial Resource Pooling in
Loss Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1305--1318",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2918164",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fragmentation of expensive resources, e.g., the
spectrum for wireless services, between providers can
introduce inefficiencies in resource utilization and
worsen overall system performance. In such cases,
resource pooling between independent service providers
can be used to improve performance. However, for
providers to agree to pool their resources, the
arrangement has to be mutually beneficial. The
traditional notion of resource pooling, which implies
complete sharing, need not have this property. For
example, under full pooling, one of the providers may
be worse off and hence has no incentive to participate.
In this paper, we propose partial resource sharing
models as a generalization of full pooling, which can
be configured to be beneficial to all participants. We
formally define and analyze two partial sharing models
between two service providers, each of which is an
Erlang-$B$ loss system with the blocking probabilities
as the performance measure. We show that there always
exist partial sharing configurations that are
beneficial to both providers, irrespective of the load
and the number of circuits of each of the providers. A
key result is that the Pareto frontier has at least one
of the providers sharing all its resources with the
other. Furthermore, full pooling may not lie inside
this Pareto set. The choice of the sharing
configurations within the Pareto set is formalized
based on the bargaining theory. Finally, large system
approximations of the blocking probabilities in the
quality-efficiency-driven regime are presented.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2019:NNS,
author = "Tianheng Wang and Andrea Conti and Moe Z. Win",
title = "Network Navigation With Scheduling: Distributed
Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1319--1329",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2924152",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network navigation is a promising paradigm for
enabling location awareness in dynamic wireless
networks. A wireless navigation network consists of
agents mobile with unknown locations and anchors
possibly mobile with known locations. Agents can
estimate their locations based on inter-and intra- node
measurements as well as prior knowledge. With limited
wireless resources, the key to achieve high navigation
accuracy is to maximize the benefits of agents' channel
usage. Therefore, it is critical to design scheduling
algorithms that adaptively determine with whom and when
an agent should perform inter-node measurements to
achieve both high navigation accuracy and efficient
channel usage. This paper develops a framework for the
design of distributed scheduling algorithms in
asynchronous wireless navigation networks, under which
the algorithm parameters are optimized based on the
evolution of agents' localization errors. Results show
that the proposed algorithms lead to high-accuracy,
efficient, and flexible network navigation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2019:CAS,
author = "Chien-Sheng Yang and Ramtin Pedarsani and A. Salman
Avestimehr",
title = "Communication-Aware Scheduling of Serial Tasks for
Dispersed Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1330--1343",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2919553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There is a growing interest in the development of
in-network dispersed computing paradigms that leverage
the computing capabilities of heterogeneous resources
dispersed across the network for processing a massive
amount of data collected at the edge of the network. We
consider the problem of task scheduling for such
networks, in a dynamic setting in which arriving
computation jobs are modeled as chains, with nodes
representing tasks, and edges representing precedence
constraints among tasks. In our proposed model,
motivated by significant communication costs in
dispersed computing environments, the communication
times are taken into account. More specifically, we
consider a network where servers can serve all task
types, and sending the outputs of processed tasks from
one server to another server results in some
communication delay. We first characterize the capacity
region of the network, then propose a novel virtual
queueing network encoding the state of the network.
Finally, we propose a Max-Weight type scheduling
policy, and considering the stochastic network in the
fluid limit, we use a Lyapunov argument to show that
the policy is throughput-optimal. Beyond the model of
chains, we extend the scheduling problem to the model
of the directed acyclic graph DAG which imposes a new
challenge, namely logic dependency difficulty,
requiring the data of processed parents tasks to be
sent to the same server for processing the child task.
We propose a virtual queueing network for DAG
scheduling over broadcast networks, where servers
always broadcast the data of processed tasks to other
servers, and prove that Max-Weight policy is
throughput-optimal.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Trimponias:2019:NCT,
author = "George Trimponias and Yan Xiao and Xiaorui Wu and Hong
Xu and Yanhui Geng",
title = "Node-Constrained Traffic Engineering: Theory and
Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1344--1358",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2921589",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Traffic engineering TE is a fundamental task in
networking. Conventionally, traffic can take any path
connecting the source and destination. Emerging
technologies such as segment routing, however, use
logical paths that are composed of shortest paths going
through a predetermined set of middlepoints in order to
reduce the flow table overhead of TE implementation.
Inspired by this, in this paper, we introduce the
problem of node-constrained TE, where the traffic must
go through a set of middlepoints, and study its
theoretical fundamentals. We show that the general
node-constrained TE that allows the traffic to take any
path going through one or more middlepoints is NP-hard
for directed graphs but strongly polynomial for
undirected graphs, unveiling a profound dichotomy
between the two cases. We also investigate a variant of
node-constrained TE that uses only shortest paths
between middlepoints, and prove that the problem can
now be solved in weakly polynomial time for a fixed
number of middlepoints, which explains why existing
work focuses on this variant. Yet, if we constrain the
end-to-end paths to be acyclic, the problem can become
NP-hard. An important application of our work concerns
flow centrality, for which we are able to derive
complexity results. Furthermore, we investigate the
middlepoint selection problem in general
node-constrained TE. We introduce and study group flow
centrality as a solution concept, and show that it is
monotone but not submodular. Our work provides a
thorough theoretical treatment of node-constrained TE
and sheds light on the development of the emerging
node-constrained TE in practice.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kadota:2019:SAO,
author = "Igor Kadota and Abhishek Sinha and Eytan Modiano",
title = "Scheduling Algorithms for Optimizing Age of
Information in Wireless Networks With Throughput
Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1359--1372",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2918736",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Age of Information AoI is a performance metric that
captures the freshness of the information from the
perspective of the destination. The AoI measures the
time that elapsed since the generation of the packet
that was most recently delivered to the destination. In
this paper, we consider a single-hop wireless network
with a number of nodes transmitting time-sensitive
information to a base station and address the problem
of minimizing the expected weighted sum AoI of the
network while simultaneously satisfying
timely-throughput constraints from the nodes. We
develop four low-complexity transmission scheduling
policies that attempt to minimize AoI subject to
minimum throughput requirements and evaluate their
performance against the optimal policy. In particular,
we develop a randomized policy, a Max-Weight policy, a
Drift-Plus-Penalty policy, and a Whittle's Index
policy, and show that they are guaranteed to be within
a factor of two, four, two, and eight, respectively,
away from the minimum AoI possible. The simulation
results show that Max-Weight and Drift-Plus-Penalty
outperform the other policies, both in terms of AoI and
throughput, in every network configuration simulated,
and achieve near-optimal performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:AOS,
author = "Shengchao Liu and Jianping Weng and Jessie Hui Wang
and Changqing An and Yipeng Zhou and Jilong Wang",
title = "An Adaptive Online Scheme for Scheduling and Resource
Enforcement in Storm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1373--1386",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2918341",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "As more and more applications need to analyze
unbounded data streams in a real-time manner, data
stream processing platforms, such as Storm, have drawn
the attention of many researchers, especially the
scheduling problem. However, there are still many
challenges unnoticed or unsolved. In this paper, we
propose and implement an adaptive online scheme to
solve three important challenges of scheduling. First,
how to make a scaling decision in a real-time manner to
handle the fluctuant load without congestion? Second,
how to minimize the number of affected workers during
rescheduling while satisfying the resource demand of
each instance? We also point out that the stateful
instances should not be placed on the same worker with
stateless instances. Third, currently, the application
performance cannot be guaranteed because of resource
contention even if the computation platform implements
an optimal scheduling algorithm. In this paper, we
realize resource isolation using Cgroup, and then the
performance interference caused by resource contention
is mitigated. We implement our scheduling scheme and
plug it into Storm, and our experiments demonstrate in
some respects our scheme achieves better performance
than the state-of-the-art solutions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kimura:2019:ICM,
author = "Bruno Y. L. Kimura and Demetrius C. S. F. Lima and
Leandro A. Villas and Antonio A. F. Loureiro",
title = "Interpath Contention in {MultiPath TCP} Disjoint
Paths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1387--1400",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2923955",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Interpath contention is a phenomenon experienced in a
MultiPath TCP MPTCP connection when its subflows
dispute resources of shared bottlenecks in end-to-end
paths. Although solutions have been proposed to improve
MPTCP performance in different applications, the impact
of interpath contention on the multipath performance is
little understood. In this paper, we evaluated such
phenomenon experimentally in disjoint paths--an
ordinary multipath scenario where subflows dispute
bottlenecks of paths physically disjointed in a
connection. Under several path conditions determined
from emulations of capacity, loss, and delay of
bottlenecks, we analyzed the influence of MPTCP
mechanisms such as packet scheduling, congestion
control, and subflow management. Differently from other
studies, we observed that the very first influence was
caused by the current subflow manager, full-mesh, with
dichotomous impact on the multipath performance when
establishing several subflows per disjoint path.
Experimental results showed that contention among
subflows can lead to positive goodput improvement or
negative goodput degradation impacts according to the
bottleneck conditions. In certain conditions, simply
establishing subflows in single-mesh, with at most one
subflow per disjoint path, could avoid interpath
contention while improving goodput significantly, by
doubling the performance of full-mesh under different
conservative congestion controls.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shrivastav:2019:GST,
author = "Vishal Shrivastav and Ki Suh Lee and Han Wang and
Hakim Weatherspoon",
title = "Globally Synchronized Time via Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1401--1416",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2918782",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Synchronized time is critical to distributed systems
and network applications in a datacenter network.
Unfortunately, many clock synchronization protocols in
datacenter networks such as NTP and PTP are
fundamentally limited by the characteristics of
packet-switched networks. In particular, network
jitter, packet buffering and scheduling in switches,
and network stack overheads add non-deterministic
variances to the round trip time, which must be
accurately measured to synchronize clocks precisely. We
present the Datacenter Time Protocol DTP, a clock
synchronization protocol that does not use packets at
all, but is able to achieve nanosecond precision. In
essence, the DTP uses the physical layer of network
devices to implement a decentralized clock
synchronization protocol. By doing so, the DTP
eliminates most non-deterministic elements in clock
synchronization protocols and has virtually zero
protocol overhead since it does not add load at layer-2
or higher at all. It does require replacing network
devices, which can be done incrementally and with very
small amount of hardware resource consumption. We
demonstrate that the precision provided by DTP in
hardware is bounded by 4TD where D is the longest
distance between any two nodes in a network in terms of
number of hops and T is the period of the fastest
clock. The precision can be further improved by
combining DTP with frequency synchronization. By
contrast, the precision of the state-of-the-art
protocol PTP is not bounded: The precision is hundreds
of nanoseconds in an idle network and can decrease to
hundreds of microseconds in a heavily congested
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Daly:2019:TFS,
author = "James Daly and Valerio Bruschi and Leonardo
Linguaglossa and Salvatore Pontarelli and Dario Rossi
and Jerome Tollet and Eric Torng and Andrew
Yourtchenko",
title = "{TupleMerge}: Fast Software Packet Processing for
Online Packet Classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1417--1431",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2920718",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Packet classification is an important part of many
networking devices, such as routers and firewalls.
Software-defined networking SDN heavily relies on
online packet classification which must efficiently
process two different streams: incoming packets to
classify and rules to update. This rules out many
offline packet classification algorithms that do not
support fast updates. We propose a novel online
classification algorithm, TupleMerge TM, derived from
tuple space search TSS, the packet classifier used by
Open vSwitch OVS. TM improves upon TSS by combining
hash tables which contain rules with similar
characteristics. This greatly reduces classification
time preserving similar performance in updates. We
validate the effectiveness of TM using both simulation
and deployment in a full-fledged software router,
specifically within the vector packet processor VPP. In
our simulation results, which focus solely on the
efficiency of the classification algorithm, we
demonstrate that TM outperforms all other state of the
art methods, including TSS, PartitionSort PS, and
SAX-PAC. For example, TM is 34\% faster at classifying
packets and 30\% faster at updating rules than PS. We
then experimentally evaluate TM deployed within the VPP
framework comparing TM against linear search and TSS,
and also against TSS within the OVS framework. This
validation of deployed implementations is important as
SDN frameworks have several optimizations such as
caches that may minimize the influence of a
classification algorithm. Our experimental results
clearly validate the effectiveness of TM. VPP TM
classifies packets nearly two orders of magnitude
faster than VPP TSS and at least one order of magnitude
faster than OVS TSS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{BenBasat:2019:RAP,
author = "Ran {Ben Basat} and Xiaoqi Chen and Gil Einziger and
Roy Friedman and Yaron Kassner",
title = "Randomized Admission Policy for Efficient Top-$k$,
Frequency, and Volume Estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1432--1445",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2918929",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network management protocols often require timely and
meaningful insight about per flow network traffic. This
paper introduces Randomized Admission Policy RAP --a
novel algorithm for the frequency, top-k, and byte
volume estimation problems, which are fundamental in
network monitoring. We demonstrate space reductions
compared to the alternatives, for the frequency
estimation problem, by a factor of up to 32 on real
packet traces and up to 128 on heavy-tailed workloads.
For top-$k$ identification, RAP exhibits memory savings
by a factor of between 4 and 64 depending on the
workloads' skewness. These empirical results are backed
by formal analysis, indicating the asymptotic space
improvement of our probabilistic admission approach. In
Addition, we present d-way RAP, a hardware friendly
variant of RAP that empirically maintains its space and
accuracy benefits.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shabara:2019:BDU,
author = "Yahia Shabara and C. Emre Koksal and Eylem Ekici",
title = "Beam Discovery Using Linear Block Codes for Millimeter
Wave Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1446--1459",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2923395",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The surge in mobile broadband data demands is expected
to surpass the available spectrum capacity below 6 GHz.
This expectation has prompted the exploration of
millimeter wave mm-wave frequency bands as a candidate
technology for next generation wireless networks.
However, numerous challenges to deploying mm-wave
communication systems, including channel estimation,
need to be met before practical deployments are
possible. This paper addresses the mm-wave channel
estimation problem and treats it as a beam discovery
problem in which locating beams with strong path
reflectors is analogous to locating errors in linear
block codes. We show that a significantly small number
of measurements compared to the original dimensions of
the channel matrix is sufficient to reliably estimate
the channel. We also show that this can be achieved
using a simple and energy-efficient transceiver
architecture.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhong:2019:PST,
author = "Zhizhen Zhong and Nan Hua and Massimo Tornatore and
Jialong Li and Yanhe Li and Xiaoping Zheng and
Biswanath Mukherjee",
title = "Provisioning Short-Term Traffic Fluctuations in
Elastic Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1460--1473",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2925631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Transient traffic spikes are becoming a crucial
challenge for network operators from both
user-experience and network-maintenance perspectives.
Different from long-term traffic growth, the bursty
nature of short-term traffic fluctuations makes it
difficult to be provisioned effectively. Luckily,
next-generation elastic optical networks EONs provide
an economical way to deal with such short-term traffic
fluctuations. In this paper, we go beyond conventional
network reconfiguration approaches by proposing the
novel lightpath-splitting scheme in EONs. In lightpath
splitting, we introduce the concept of SplitPoints to
describe how lightpath splitting is performed.
Lightpaths traversing multiple nodes in the optical
layer can be split into shorter ones by SplitPoints to
serve more traffic demands by raising signal modulation
levels of lightpaths accordingly. We formulate the
problem into a mathematical optimization model and
linearize it into an integer linear program ILP. We
solve the optimization model on a small network
instance and design scalable heuristic algorithms based
on greedy and simulated annealing approaches. Numerical
results show the tradeoff between throughput gain and
negative impacts like traffic interruptions.
Especially, by selecting SplitPoints wisely, operators
can achieve almost twice as much throughput as
conventional schemes without lightpath splitting.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Klinkowski:2019:EOF,
author = "Miroslaw Klinkowski and Krzysztof Walkowiak",
title = "An Efficient Optimization Framework for Solving {RSSA}
Problems in Spectrally and Spatially Flexible Optical
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1474--1486",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2922761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We focus on the routing, spatial mode, and spectrum
allocation RSSA problem--a basic optimization problem
in spectrally and spatially flexible optical networks
SS-FON. RSSA is a very challenging problem since it
introduces a new dimension, related to the selection of
spatial resources, to the already complex $ \mathcal
{NP} $ -hard routing and spectrum allocation RSA
problem. To allow solving large RSSA problem instances,
in particular, in optical backbone networks with tens
of nodes and hundreds of demands as well as with
optical fibers supporting a numerous number of spatial
modes, specialized optimization algorithms are
required. In this paper, we propose and study several
dedicated optimization procedures and some enhancements
in algorithm processing, including parallel processing,
which aim at both speeding up and increasing the
effectiveness of the RSSA process and at estimating the
quality of generated solutions. We combine the proposed
procedures into an efficient optimization framework
which, as presented numerical results show, is capable
of providing high-quality solutions to large instances
of the RSSA optimization problem in reasonable
computation times. As a case study scenario, we
consider an SS-FON with spectral super-channels SChs
transmitted over bundles of single-mode fibers SMFB
without spatial mode conversion. Nonetheless, the
proposed optimization framework is generic and can be
straightforwardly adapted to other SS-FON scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chuai:2019:AFR,
author = "Jie Chuai and Victor O. K. Li",
title = "An Analytical Framework for Resource Allocation
Between Data and Delayed Network State Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1487--1500",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2922028",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The data transmission performance of a network
protocol is closely related to the amount of available
information about the network state. In general, more
network state information results in better data
transmission performance. However, acquiring such state
information expends network bandwidth resource. Thus, a
trade-off exists between the amount of network state
information collected, and the improved protocol
performance due to this information. A framework has
been developed in the previous efforts to study the
optimal trade-off between the amount of collected
information and network performance. However, the
effect of information delay is not considered in the
previous analysis. In this paper, we extend the
framework to study the relationship between the amount
of collected state information and the achievable
network performance under the assumption that
information is subject to delay. Based on the
relationship we could then obtain the optimal resource
allocation between the data transmission and network
state information acquisition in a time-varying
network. We have considered both memoryless and
memory-exploited scenarios in our framework. Structures
of the Pareto optimal information collection and
decision-making strategies are discussed. Examples of
multiuser scheduling and multi-hop routing are used to
demonstrate the framework's application to practical
network protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2019:LAO,
author = "Hao Yu and Michael J. Neely",
title = "Learning-Aided Optimization for Energy-Harvesting
Devices With Outdated State Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1501--1514",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926403",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper considers utility optimal power control for
energy-harvesting wireless devices with a finite
capacity battery. The distribution information of the
underlying wireless environment and harvestable energy
is unknown, and only outdated system state information
is known at the device controller. This scenario shares
similarity with Lyapunov opportunistic optimization and
online learning but is different from both. By a novel
combination of Zinkevich's online gradient learning
technique and the drift-plus-penalty technique from
Lyapunov opportunistic optimization, this paper
proposes a learning-aided algorithm that achieves
utility within $ O \epsilon $ of the optimal, for any
desired $ \epsilon \& g t; 0 $, by using a battery with
an $ O1 / \epsilon $ capacity. The proposed algorithm
has low complexity and makes power investment decisions
based on system history, without requiring knowledge of
the system state or its probability distribution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2019:SAE,
author = "Xiaonan Zhang and Pei Huang and Linke Guo and Yuguang
Fang",
title = "Social-Aware Energy-Efficient Data Offloading With
Strong Stability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1515--1528",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2924875",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The exploding popularity of mobile devices enables
people to enjoy the benefits brought by various
interesting mobile apps. The ever-increasing data
traffic has exacerbated energy consumption on both
cellular service providers and mobile users. It has
become an urgent need to reducing the energy
consumption in the cellular network while satisfying
users' increasing traffic demands. Mobile data
offloading is an effective energy-saving paradigm to
tackle the above-mentioned problem. However, the
current approaches cannot fully address the issue in
terms of user demands and offloaded traffic. With the
observation that duplicated data transmission often
happens in the crowd with similar social interests, we
deploy device-to-device D2D data offloading to achieve
the energy efficiency at the user side while adapting
their increasing traffic demands. Specifically, we
investigate the stochastic optimization of the
long-term time-averaged expected energy consumption
while guaranteeing the strong stability of the network
by utilizing the social-aware and energy-efficient D2D
mobile offloading. By jointly considering interference
among D2D users, social-aware caching, link scheduling,
and routing, an offline finite-queue-aware energy
minimization problem is formulated, which is a
time-coupling stochastic mixed-integer non-linear
programming MINLP problem. We propose an online
finite-queue-aware energy algorithm by employing the
Lyapunov drift-plus-penalty theory. Extensive analysis
and simulations are conducted to validate the proposed
scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Stimpfling:2019:SSH,
author = "Thibaut Stimpfling and Normand Belanger and J. M.
Pierre Langlois and Yvon Savaria",
title = "{SHIP}: a Scalable High-Performance {IPv6} Lookup
Algorithm That Exploits Prefix Characteristics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1529--1542",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Due to the emergence of new network applications,
current IP lookup engines must support high bandwidth,
low lookup latency, and the ongoing growth of IPv6
networks. However, the existing solutions are not
designed to address jointly these three requirements.
This paper introduces SHIP, an IPv6 lookup algorithm
that exploits prefix characteristics to build a data
structure designed to meet future application
requirements. Based on the prefix length distribution
and prefix density, prefixes are first clustered into
groups sharing similar characteristics and then encoded
in hybrid trie-trees. The resulting memory-efficient
and scalable data structure can be stored in
low-latency memories and allows the traversal process
to be parallelized and pipelined in order to support
high packet bandwidth in hardware. In addition, SHIP
supports incremental updates. Evaluated on real and
synthetic IPv6 prefix tables, SHIP has a logarithmic
scaling factor in terms of the number of memory
accesses and a linear memory consumption scaling.
Compared with other well-known approaches, SHIP reduces
the required amount of memory per prefix by 87\%. When
implemented on a state-of-the-art field-programmable
gate array FPGA, the proposed architecture can support
processing 588 million packets per second.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sciancalepore:2019:RNR,
author = "Vincenzo Sciancalepore and Xavier Costa-Perez and
Albert Banchs",
title = "{RL-NSB}: Reinforcement Learning-Based {$5$G} Network
Slice Broker",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1543--1557",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2924471",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network slicing is considered one of the main pillars
of the upcoming 5G networks. Indeed, the ability to
slice a mobile network and tailor each slice to the
needs of the corresponding tenant is envisioned as a
key enabler for the design of future networks. However,
this novel paradigm opens up to new challenges, such as
isolation between network slices, the allocation of
resources across them, and the admission of resource
requests by network slice tenants. In this paper, we
address this problem by designing the following
building blocks for supporting network slicing: i
traffic and user mobility analysis, ii a learning and
forecasting scheme per slice, iii optimal admission
control decisions based on spatial and traffic
information, and iv a reinforcement process to drive
the system towards optimal states. In our framework,
namely RL-NSB, infrastructure providers perform
admission control considering the service level
agreements SLA of the different tenants as well as
their traffic usage and user distribution, and enhance
the overall process by the means of learning and the
reinforcement techniques that consider heterogeneous
mobility and traffic models among diverse slices. Our
results show that by relying on appropriately tuned
forecasting schemes, our approach provides very
substantial potential gains in terms of system
utilization while meeting the tenants' SLAs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xu:2019:RPA,
author = "Yuedong Xu and Zhujun Xiao and Tianyu Ni and Jessie
Hui Wang and Xin Wang and Eitan Altman",
title = "On The Robustness of Price-Anticipating {Kelly}
Mechanism",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1558--1571",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926304",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The price-anticipating Kelly mechanism PAKM is one of
the most extensively used strategies to allocate
divisible resources for strategic users in
communication networks and computing systems. The users
are deemed as selfish and also benign, each of which
maximizes his individual utility of the allocated
resources minus his payment to the network operator.
However, in many applications a user can use his
payment to reduce the utilities of his opponents, thus
playing a misbehaving role. It remains mysterious to
what extent the misbehaving user can damage or
influence the performance of benign users and the
network operator. In this work, we formulate a
non-cooperative game consisting of a finite amount of
benign users and one misbehaving user. The
maliciousness of this misbehaving user is captured by
his willingness to pay to trade for unit degradation in
the utilities of benign users. The network operator
allocates resources to all the users via the
price-anticipating Kelly mechanism. We present six
important performance metrics with regard to the total
utility and the total net utility of benign users, and
the revenue of network operator under three different
scenarios: with and without the misbehaving user, and
the maximum. We quantify the robustness of PAKM against
the misbehaving actions by deriving the upper and lower
bounds of these metrics. With new approaches, all the
theoretical bounds are applicable to an arbitrary
population of benign users. Our study reveals two
important insights: 1 the performance bounds are very
sensitive to the misbehaving user's willingness to pay
at certain ranges and 2 the network operator acquires
more revenues in the presence of the misbehaving user
which might disincentivize his countermeasures against
the misbehaving actions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bakshi:2019:EEM,
author = "Arjun Bakshi and Lu Chen and Kannan Srinivasan and C.
Emre Koksal and Atilla Eryilmaz",
title = "{EMIT}: an Efficient {MAC} Paradigm for the {Internet
of Things}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1572--1583",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2928002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The future Internet of Things IoT networks are
expected to be composed of a large population of
low-cost devices communicating dynamically with access
points or neighboring devices to communicate small
bundles of delay-sensitive data. To support the
high-intensity and short-lived demands of these
emerging networks, we propose an efficient MAC paradigm
for IoT EMIT. Our paradigm bypasses the high overhead
and coordination costs of existing MAC solutions by
employing an interference-averaging strategy that
allows users to share their resources simultaneously.
In contrast to the predominant interference-suppressing
approaches, EMIT exploits the dense and dynamic nature
of IoT networks to reduce the spatio-temporal
variability of interference to achieve low-delay and
high-reliability in service. This paper introduces
foundational ideas of EMIT by characterizing the global
interference statistics in terms of single-device
operation and develops power-rate allocation strategies
to guarantee low-delay high-reliability performance. A
significant portion of our work is aimed at validating
these theoretical principles in experimental test beds
and simulations, where we compare the performance of
EMIT with a CSMA-based MAC protocol. Our comparisons
confirm the beneficial characteristics of EMIT and
reveal significant gains over CSMA strategies in the
case of IoT traffic.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chang:2019:AGF,
author = "Cheng-Shang Chang and Duan-Shin Lee and Chun Wang",
title = "Asynchronous Grant-Free Uplink Transmissions in
Multichannel Wireless Networks With Heterogeneous {QoS}
Guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1584--1597",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2922404",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we study the problem of providing
heterogeneous quality-of-service QoS guarantees for
asynchronous grant-free uplink transmissions in
multichannel wireless networks. The multiple access
channel model is the classical collision channel, where
partially overlapped packets during the transmissions
are assumed to be completely lost. For such a network
model, we propose two asynchronous multichannel
transmission schedules AMTS: 1 the EPC-based AMTS and 2
the DS-based AMTS. The EPC-based AMTS is constructed by
time-spreading one-dimensional extended prime code EPC,
and the DS-based AMTS is constructed by using
difference sets DS and finite projective planes. We
show for both scheduling algorithms that the maximum
delay between two successive successful transmissions
of an active device can be upper bounded by a constant
when the channel load does not exceed a designed
threshold parameter. Moreover, different devices are
allowed to have different throughput rate guarantees.
By conducting extensive simulations, we also show that
the overall throughputs of both scheduling algorithms
are almost identical to that of the random access
protocol, when the number of active devices exceeds the
designed threshold parameter.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fu:2019:SAM,
author = "Yongquan Fu and Dongsheng Li and Pere Barlet-Ros and
Chun Huang and Zhen Huang and Siqi Shen and Huayou Su",
title = "A Skewness-Aware Matrix Factorization Approach for
Mesh-Structured Cloud Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1598--1611",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2923815",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Online cloud services need to fulfill clients'
requests scalably and fast. State-of-the-art cloud
services are increasingly deployed as a distributed
service mesh. Service to service communication is
frequent in the mesh. Unfortunately, problematic events
may occur between any pair of nodes in the mesh,
therefore, it is vital to maximize the network
visibility. A state-of-the-art approach is to model
pairwise RTTs based on a latent factor model
represented as a low-rank matrix factorization. A
latent factor corresponds to a rank-1 component in the
factorization model, and is shared by all node pairs.
However, different node pairs usually experience a
skewed set of hidden factors, which should be fully
considered in the model. In this paper, we propose a
skewness-aware matrix factorization method named SMF.
We decompose the matrix factorization into basic units
of rank-one latent factors, and progressively combine
rank-one factors for different node pairs. We present a
unifying framework to automatically and adaptively
select the rank-one factors for each node pair, which
not only preserves the low rankness of the matrix
model, but also adapts to skewed network latency
distributions. Over real-world RTT data sets, SMF
significantly improves the relative error by a factor
of 0.2 $ \times $ to 10 $ \times $, converges fast and
stably, and compactly captures fine-grained local and
global network latency structures.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cui:2019:TWC,
author = "Yong Cui and Ningwei Dai and Zeqi Lai and Minming Li
and Zhenhua Li and Yuming Hu and Kui Ren and Yuchi
Chen",
title = "{TailCutter}: Wisely Cutting Tail Latency in Cloud
{CDNs} Under Cost Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1612--1628",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926142",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cloud computing platforms enable applications to offer
low-latency services to users by deploying data storage
in multiple geo-distributed data centers. In this
paper, through benchmark measurements on Amazon AWS and
Microsoft Azure together with an analysis of a
large-scale dataset collected from a major cloud CDN
provider, we identify the high tail latency problem in
cloud CDNs, which can substantially undermine the
efficacy of cloud CDNs. One crucial idea to reduce the
tail latency is to send requests in parallel to
multiple clouds in cloud CDNs. However, since
application providers often have a budget for using
cloud services, deciding how many chunks to download
from each cloud and when to download chunks in a
cost-efficient manner still remain as open problems in
our concerned scenario. To address the problem, we
present TailCutter, a workload scheduling framework
that aims at optimizing the tail latency while meeting
cost constraints given by application providers.
Specifically, we formulate the tail latency
minimization TLM problem in cloud CDNs and design the
receding horizon control based maximum tail
minimization algorithm RHC-based MTMA to efficiently
solve the TLM problem in practice. We implement
TailCutter across multiple data centers of Amazon AWS
and Microsoft Azure. Extensive evaluations using a
large-scale real-world data trace collected from a
major ISP illustrate that TailCutter can reduce up to
58.9\% of the 100th-percentile user-perceived latency,
as compared with alternative solutions under the cost
constraint.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Boubrima:2019:DWS,
author = "Ahmed Boubrima and Walid Bechkit and Herve Rivano",
title = "On the Deployment of Wireless Sensor Networks for Air
Quality Mapping: Optimization Models and Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1629--1642",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2923737",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor networks WSNs are widely used in
environmental applications where the aim is to sense
physical phenomena, such as temperature and air
pollution. A careful deployment of sensors is necessary
in order to get a better knowledge of these physical
phenomena while ensuring the minimum deployment cost.
In this paper, we focus on using WSN for air pollution
mapping and tackle the optimization problem of sensor
deployment. Unlike most of the existing deployment
approaches that are either generic or assume that
sensors have a given detection range, we define an
appropriate coverage formulation based on an
interpolation formula that is adapted to the
characteristics of air pollution sensing. We derive,
from this formulation, two deployment models for air
pollution mapping using the integer linear programming
while ensuring the connectivity of the network and
taking into account the sensing error of nodes. We
analyze the theoretical complexity of our models and
propose the heuristic algorithms based on the linear
programming relaxation and binary search. We perform
extensive simulations on a dataset of the Lyon city,
France, in order to assess the computational complexity
of our proposal and evaluate the impact of the
deployment requirements on the obtained results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhang:2019:HAI,
author = "Ziyao Zhang and Liang Ma and Kin K. Leung and Franck
Le and Sastry Kompella and Leandros Tassiulas",
title = "How Advantageous Is It? {An} Analytical Study of
Controller-Assisted Path Construction in Distributed
{SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1643--1656",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2924616",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed software-defined networks SDN, consisting
of multiple inter-connected network domains, each
managed by one SDN controller, is an emerging
networking architecture that offers balanced
centralized control and distributed operations. Under
such a networking paradigm, most existing works focus
on designing sophisticated controller-synchronization
strategies to improve joint controller-decision-making
for inter-domain routing. However, there is still a
lack of fundamental understanding of how the
performance of distributed SDN is related to network
attributes, thus it is impossible to justify the
necessity of complicated strategies. In this regard, we
analyze and quantify the performance enhancement of
distributed SDN architectures, which is influenced by
intra-/inter-domain synchronization levels and network
structural properties. Based on a generic network
model, we establish analytical methods for performance
estimation under four canonical inter-domain
synchronization scenarios. Specifically, we first
derive an asymptotic expression to quantify how
dominating structural and synchronization-related
parameters affect the performance metric. We then
provide performance analytics for an important family
of networks, where all links are of equal preference
for path constructions. Finally, we establish
fine-grained performance metric expressions for
networks with dynamically adjusted link preferences.
Our theoretical results reveal how network performance
is related to synchronization levels and
intra-/inter-domain connections, the accuracy of which
is confirmed by simulations based on both real and
synthetic networks. To the best of our knowledge, this
is the first work quantifying the performance of
distributed SDN in terms of network structural
properties and synchronization levels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mukhopadhyay:2019:ARM,
author = "Arpan Mukhopadhyay and Nidhi Hegde and Marc Lelarge",
title = "Asymptotics of Replication and Matching in Large
Caching Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1657--1668",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926235",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider a generic model of distributed caching
systems, where the cache servers are constrained by two
main resources: memory size and bandwidth. Content
distribution networks CDNs providing video contents and
peer-to-peer video-on-demand services are a few
examples of such systems. The throughput of these
systems crucially depends on how these resources are
managed, i.e., how contents are replicated across
servers and how requests of specific contents are
matched to servers storing the contents. In this paper,
we formulate the problem of computing the replication
policy and the matching policy, which jointly maximizes
the throughput of the caching system. It is shown that
computing the optimal replication policy for a given
finite system is an NP-hard problem. A greedy
replication scheme is then proposed and is shown to
achieve a constant factor approximation guarantee when
combined with the optimal matching policy. We note that
the optimal matching policy has the problem of
interruption in service of the ongoing requests due to
re-assignment or repacking of the existing requests. To
avoid this problem, we propose a simple randomized
online matching scheme and analyze its performance in
conjunction with the proposed replication scheme. We
consider a limiting regime, where the number of servers
is large and the arrival rates of the contents are
scaled proportionally, and show that the proposed
policies achieve asymptotic optimality. Extensive
simulation results are presented to evaluate the
performance of different policies and study the
behavior of the caching system under different service
time distributions of the requests.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shi:2019:DGR,
author = "Junyang Shi and Mo Sha and Zhicheng Yang",
title = "Distributed Graph Routing and Scheduling for
Industrial Wireless Sensor-Actuator Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1669--1682",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2925816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless sensor-actuator networks WSANs technology is
appealing for use in the industrial Internet of Things
IoT applications because it does not require wired
infrastructure. Battery-powered wireless modules easily
and inexpensively retrofit existing sensors and
actuators in the industrial facilities without running
cabling for communication and power. The IEEE
802.15.4-based WSANs operate at low-power and can be
manufactured inexpensively, which makes them ideal
where battery lifetime and costs are important. Almost,
a decade of real-world deployments of WirelessHART
standard has demonstrated the feasibility of using its
core techniques including reliable graph routing and
time slotted channel hopping TSCH to achieve reliable
low-power wireless communication in the industrial
facilities. Today, we are facing the fourth Industrial
Revolution as proclaimed by political statements
related to the Industry 4.0 Initiative of the German
Government. There exists an emerging demand for
deploying a large number of field devices in an
industrial facility and connecting them through the
WSAN. However, a major limitation of current WSAN
standards is their limited scalability due to their
centralized routing and scheduling that enhance the
predictability and visibility of network operations at
the cost of scalability. This paper decentralizes the
network management in WirelessHART and presents the
first Distributed Graph routing and autonomous
Scheduling DiGS solution that allows the field devices
to compute their own graph routes and transmission
schedules. The experimental results from two physical
testbeds and a simulation study shows our approaches
can significantly improve the network reliability,
latency, and energy efficiency under dynamics.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liakopoulos:2019:ROF,
author = "Nikolaos Liakopoulos and Georgios S. Paschos and
Thrasyvoulos Spyropoulos",
title = "Robust Optimization Framework for Proactive User
Association in {UDNs}: a Data-Driven Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1683--1695",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2930231",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the user association problem in the context
of dense networks, where standard adaptive algorithms
become ineffective. This paper proposes a novel
data-driven technique leveraging the theory of robust
optimization. The main idea is to predict future
traffic fluctuations, and use the predictions to design
association maps before the actual arrival of traffic.
Although, the actual playout of the map is random due
to prediction error, the maps are robustly designed to
handle uncertainty, preventing constraint violations,
and maximizing the expectation of a convex utility
function, which is used to accurately balance base
station loads. We propose a generalized iterative
algorithm, referred to as GRMA, which is shown to
converge to the optimal robust map. The optimal maps
have the intriguing property that they jointly optimize
the predicted load and the variance of the prediction
error. We validate our robust maps in Milano-area
traces, with dense coverage and find that we can reduce
violations from 25\% inflicted by a baseline adaptive
algorithm down to almost zero.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liaskos:2019:NLM,
author = "Christos Liaskos and Ageliki Tsioliaridou and Shuai
Nie and Andreas Pitsillides and Sotiris Ioannidis and
Ian F. Akyildiz",
title = "On the Network-Layer Modeling and Configuration of
Programmable Wireless Environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1696--1713",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2925658",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Programmable wireless environments enable the
software-defined propagation of waves within them,
yielding exceptional performance. Several
building-block technologies have been implemented and
evaluated at the physical layer in the past. The
present work contributes a network-layer solution to
configure such environments for multiple users and
objectives, and for any underlying physical-layer
technology. Supported objectives include any
combination of Quality of Service and power transfer
optimization, eavesdropping, and Doppler effect
mitigation, in multi-cast or uni-cast settings. In
addition, a graph-based model of programmable
environments is proposed, which incorporates core
physical observations and efficiently separates
physical and networking concerns. The evaluation takes
place in a specially developed simulation tool, and in
a variety of environments, validating the model and
reaching insights into the user capacity of
programmable environments.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2019:PBF,
author = "Yu Zhou and Jun Bi and Cheng Zhang and Bingyang Liu
and Zhaogeng Li and Yangyang Wang and Mingli Yu",
title = "{P4DB}: On-the-Fly Debugging for Programmable Data
Planes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1714--1727",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2927110",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "While extending network programmability to a more
considerable extent, P4 raises the difficulty of
detecting and locating bugs, e.g., P4 program bugs and
missed table rules, in runtime. These runtime bugs,
without prompt disposal, can ruin the functionality and
performance of networks. Unfortunately, the absence of
efficient debugging tools makes runtime bug
troubleshooting intricate for operators. This paper is
devoted to on-the-fly debugging of runtime bugs for
programmable data planes. We propose P4DB, a general
debugging platform that empowers operators to debug P4
programs in three levels of visibility with rich
primitives. By P4DB, operators can use the watch
primitive to quickly narrow the debugging scope from
the network level or the device level to the table
level, then use the break and next primitives to
decompose match-action tables and finely locate bugs.
We implement a prototype of P4DB and evaluate the
prototype on two widely-used P4 targets. On the
software target, P4DB merely introduces a small
throughput penalty 1.3\% to 13.8\% and a little delay
increase 0.6\% to 11.9\%. Notably, P4DB almost
introduces no performance overhead on Tofino, the
hardware P4 target.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Satpathi:2019:LLE,
author = "Siddhartha Satpathi and Supratim Deb and R. Srikant
and He Yan",
title = "Learning Latent Events From Network Message Logs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1728--1741",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2930040",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of separating error messages
generated in large distributed data center networks
into error events. In such networks, each error event
leads to a stream of messages generated by hardware and
software components affected by the event. These
messages are stored in a giant message log. We consider
the unsupervised learning problem of identifying the
signatures of events that generated these messages;
here, the signature of an error event refers to the
mixture of messages generated by the event. One of the
main contributions of the paper is a novel mapping of
our problem which transforms it into a problem of topic
discovery in documents. Events in our problem
correspond to topics and messages in our problem
correspond to words in the topic discovery problem.
However, there is no direct analog of documents.
Therefore, we use a non-parametric change-point
detection algorithm, which has linear computational
complexity in the number of messages, to divide the
message log into smaller subsets called episodes, which
serve as the equivalents of documents. After this
mapping has been done, we use a well-known algorithm
for topic discovery, called LDA, to solve our problem.
We theoretically analyze the change-point detection
algorithm, and show that it is consistent and has low
sample complexity. We also demonstrate the scalability
of our algorithm on a real data set consisting of 97
million messages collected over a period of 15 days,
from a distributed data center network which supports
the operations of a large wireless service provider.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2019:OMB,
author = "Fujun He and Takehiro Sato and Eiji Oki",
title = "Optimization Model for Backup Resource Allocation in
Middleboxes With Importance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1742--1755",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2930809",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network function virtualization paradigm enables us to
implement network functions provided in middleboxes as
softwares that run on commodity servers. This paper
proposes a backup resource allocation model for
middleboxes with considering both failure probabilities
of network functions and backup servers. A backup
server can protect several functions; a function can
have multiple backup servers. We take the importance of
functions into account by defining a weighted
unavailability for each function. We aim to find an
assignment of backup servers to functions, where the
worst weighted unavailability is minimized. We
formulate the proposed backup resource allocation model
as a mixed integer linear programming problem. We prove
that the backup resource allocation problem for
middlebox with importance is NP-complete. We develop
three heuristic algorithms with polynomial time
complexity to solve the problem. We analyze the
approximation performances of different heuristic
algorithms with providing several lower and upper
bounds. We present the competitive evaluation in terms
of deviation and computation time among the results
obtained by running the heuristic algorithms and by
solving the mixed integer linear programming problem.
The results show the pros and cons of different
approaches. With our analyses, a network operator can
choose an appropriate approach according to the
requirements in specific application scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Malandrino:2019:OEM,
author = "Francesco Malandrino and Carla Fabiana Chiasserini and
Claudio Casetti and Giada Landi and Marco Capitani",
title = "An Optimization-Enhanced {MANO} for Energy-Efficient
{$5$G} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "4",
pages = "1756--1769",
month = aug,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2931038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "5G network nodes, fronthaul and backhaul alike, will
have both forwarding and computational capabilities.
This makes energy-efficient network management more
challenging, as decisions, such as activating or
deactivating a node, impact on both the ability of the
network to route traffic and the amount of processing
it can perform. To this end, we formulate an
optimization problem accounting for the main features
of 5G nodes and the traffic they serve, allowing joint
decisions about: 1 the nodes to activate; 2 the network
functions they run; and 3 the traffic routing. Our
optimization module is integrated within the management
and orchestration framework of 5G, thus enabling swift
and high-quality decisions. We test our scheme with
both a real-world testbed based on OpenStack and
OpenDaylight, and a large-scale emulated network whose
topology and traffic come from a real-world mobile
operator, finding it to consistently outperform
state-of-the art alternatives and closely match the
optimum.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Tan:2019:JOC,
author = "Haisheng Tan and Shaofeng H.-C. Jiang and Yupeng Li
and Xiang-Yang Li and Chenzi Zhang and Zhenhua Han and
Francis Chi Moon Lau",
title = "Joint Online Coflow Routing and Scheduling in Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1771--1786",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2930721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "A coflow is a collection of related parallel flows
that occur typically between two stages of a
multi-stage computing task in a network, such as
shuffle flows in MapReduce. The coflow abstraction
allows applications to convey their semantics to the
network so that application-level requirements can be
better satisfied. In this paper, we study the routing
and scheduling of multiple coflows to minimize the
total weighted coflow completion time CCT. We first
propose a rounding-based randomized approximation
algorithm, called OneCoflow, for single coflow routing
and scheduling. The multiple coflow problem is more
challenging as coexisting coflows will compete for the
same network resources, such as link bandwidth. To
minimize the total weighted CCT, we derive an online
multiple coflow routing and scheduling algorithm,
called OMCoflow. We then derive a competitive ratio
bound of our problem and prove that the competitive
ratio of OMCoflow is nearly tight. To the best of our
knowledge, this is the first online algorithm with
theoretical performance guarantees which considers
routing and scheduling simultaneously for
multi-coflows. Compared with existing methods, OMCoflow
runs more efficiently and avoids frequently rerouting
the flows. Extensive simulations on a Facebook data
trace show that OMCoflow outperforms the
state-of-the-art heuristic schemes significantly e.g.,
reducing the total weighted CCT by up to 41.8\% and the
execution time by up to 99.2\% against RAPIER.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ghali:2019:CWT,
author = "Cesar Ghali and Gene Tsudik and Ersin Uzun",
title = "In Content We Trust: Network-Layer Trust in
Content-Centric Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1787--1800",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2926320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Content-Centric Networking CCN, an instance of
information-centric networking, is a candidate
next-generation Internet architecture that emphasizes
on content distribution by making it directly
addressable and routable. By opportunistically caching
content within the network, CCN appears to be
well-suited for a large-scale content distribution and
for meeting the needs of increasingly mobile and
bandwidth-hungry applications that dominate today's
Internet. To provide content authentication, CCN
dictates that each content object must be digitally
signed by its respective producer. All entities
consumers and routers must, in principle, verify the
content signature before processing it. However, in
practice, this poses two challenges for routers: 1
overhead due to signature verification, key retrieval,
and potential certificate chain traversal; and 2 lack
of trust context, i.e., determining which public keys
are trusted to verify the content signature. This
renders signature verification impractical in routers,
opening the door for the so-called content poisoning
attacks. We study the root causes of the content
poisoning attacks and reach the conclusion that
meaningful mitigation of content poisoning is
contingent upon a network-layer trust management
architecture. We propose two approaches: deterministic
and probabilistic, that allow routers to detect fake
aka ``poisoned'' content objects. The usages of each
approach depend on the location and role of routers in
the network, as well as their computational
capabilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2019:PLT,
author = "Huikang Li and Yi Gao and Wei Dong and Chun Chen",
title = "Preferential Link Tomography in Dynamic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1801--1814",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2931047",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Inferring fine-grained link metrics by using
aggregated path measurements, known as network
tomography, is essential for various network
operations, such as network monitoring, load balancing,
and failure diagnosis. Given a set of interesting links
and the changing topologies of a dynamic network, we
study the problem of calculating the metrics of these
interesting links by end-to-end cycle-free path
measurements among selected monitors, i.e.,
preferential link tomography. We propose MAPLink, an
algorithm that assigns a number of nodes as monitors to
solve this tomography problem. As the first algorithm
to solve the preferential link tomography problem in
dynamic networks, MAPLink guarantees that the assigned
monitors can calculate the metrics of all interesting
links in each possible topology of a dynamic network.
We formally prove the above property of MAPLink based
on graph theory. We implement MAPLink and evaluate its
performance using two real-world dynamic networks,
including a vehicular network and a sensor network,
both with constantly changing topologies due to node
mobility or wireless dynamics. Results show that
MAPLink achieves significant better performance
compared with four baseline solutions in both of these
two dynamic networks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Zhou:2019:TOA,
author = "Pan Zhou and Jie Xu and Wei Wang and Yuchong Hu and
Dapeng Oliver Wu and Shouling Ji",
title = "Toward Optimal Adaptive Online Shortest Path Routing
With Acceleration Under Jamming Attack",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1815--1829",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2930464",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the online shortest path routing SPR of a
network with stochastically time varying link states
under potential adversarial attacks. Due to the denial
of service DoS attacks, the distributions of link
states could be stochastic benign or adversarial at
different temporal and spatial locations. Without any a
priori, designing an adaptive and optimal DoS-proof SPR
protocol to thwart all possible adversarial attacks is
a very challenging issue. In this paper, we present the
first such integral solution based on the multi-armed
bandit MAB theory, where jamming is the adversarial
strategy. By introducing a novel control parameter into
the exploration phase for each link, a martingale
inequality is applied in our formulated combinatorial
adversarial MAB framework. The proposed algorithm could
automatically detect the specific jammed and un-jammed
links within a unified framework. As a result, the
adaptive online SPR strategies with near-optimal
learning performance in all possible regimes are
obtained. Moreover, we propose the accelerated
algorithms by multi-path route probing and cooperative
learning among multiple sources, and study their
implementation issues. Comparing to existing works, our
algorithm has the respective 30.3\% and 87.1\%
improvements of network delay for oblivious jamming and
adaptive jamming given a typical learning period and a
81.5\% improvement of learning duration under a
specified network delay on average, while it enjoys
almost the same performance without jamming. Lastly,
the accelerated algorithms can achieve a maximal of
150.2\% improvement in network delay and a 431.3\%
improvement in learning duration.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khabbazian:2019:GEA,
author = "Majid Khabbazian and Keyvan Gharouni Saffar",
title = "The Gain of Energy Accumulation in Multi-Hop Wireless
Network Broadcast",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1830--1844",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2928798",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Broadcast is a fundamental network operation, widely
used in wireless networks to disseminate messages. The
energy-efficiency of broadcast is important
particularly when devices in the network are energy
constrained. To improve the efficiency of broadcast,
different approaches have been taken in the literature.
One of these approaches is broadcast with energy
accumulation. Through simulations, it has been shown in
the literature that broadcast with energy accumulation
can result in energy saving. The amount of this saving,
however, has only been analyzed for linear multi-hop
wireless networks. In this paper, we extend this
analysis to two-dimensional 2D multi-hop networks. The
analysis of saving in 2D networks is much more
challenging than that in linear networks. It is
because, unlike in linear networks, in 2D networks,
finding minimum-energy broadcasts with or without
energy accumulation are both NP-hard problems.
Nevertheless, using a novel approach, we prove that
this saving is constant when the path loss exponent $
\alpha $ is strictly greater than two. Also, we prove
that the saving is $ \theta \log n $ when $ \alpha = 2
$, where $n$ denotes the number of 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{Yang:2019:HAA,
author = "Tong Yang and Haowei Zhang and Jinyang Li and Junzhi
Gong and Steve Uhlig and Shigang Chen and Xiaoming Li",
title = "{HeavyKeeper}: an Accurate Algorithm for Finding
Top-$k$ Elephant Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1845--1858",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2933868",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Finding top-$k$ elephant flows is a critical task in
network traffic measurement, with many applications in
congestion control, anomaly detection and traffic
engineering. As the line rates keep increasing in
today's networks, designing accurate and fast
algorithms for online identification of elephant flows
becomes more and more challenging. The prior algorithms
are seriously limited in achieving accuracy under the
constraints of heavy traffic and small on-chip memory
in use. We observe that the basic strategies adopted by
these algorithms either require significant space
overhead to measure the sizes of all flows or incur
significant inaccuracy when deciding which flows to
keep track of. In this paper, we adopt a new strategy,
called count-with-exponential-decay, to achieve
space-accuracy balance by actively removing small flows
through decaying, while minimizing the impact on large
flows, so as to achieve high precision in finding
top-$k$ elephant flows. Moreover, the proposed
algorithm called HeavyKeeper incurs small, constant
processing overhead per packet and thus supports high
line rates. Experimental results show that HeavyKeeper
algorithm achieves 99.99\% precision with a small
memory size, and reduces the error by around 3 orders
of magnitude on average compared to 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{Zheng:2019:SFR,
author = "Jiaqi Zheng and Hong Xu and Xiaojun Zhu and Guihai
Chen and Yanhui Geng",
title = "Sentinel: Failure Recovery in Centralized Traffic
Engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1859--1872",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2931473",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network failures are common in wide area networks
WANs. Failure recovery in a software-defined WAN takes
minutes or longer, as the controller needs to calculate
a new traffic engineering solution and update the
forwarding rules across all switches. This severely
degrades application performance. Existing reactive and
proactive approaches inevitably lead to transient
congestion or bandwidth underutilization and impair the
efficiency of running the expensive WANs. We present
Sentinel, a novel failure recovery system for traffic
engineering in software-defined WANs. Sentinel
pre-computes and installs backup tunnels to accelerate
failure recovery. When a link fails, switches locally
redirect traffic to backup tunnels and recover
immediately in the data plane, thus substantially
reducing the transient congestion compared to reactive
rescaling. On the other hand, Sentinel completely
avoids the bandwidth headroom required by existing
proactive approaches. Extensive experiments on Mininet
and numerical simulations show that similar to
state-of-the-art FFC, Sentinel reduces congestion by
45\% compared with rescaling, and its algorithm runs
much faster than FFC. Sentinel only introduces a small
number of additional forwarding rules and can be
readily implemented on today's Openflow switches.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:ERQ,
author = "Xiulong Liu and Xin Xie and Shangguang Wang and Jia
Liu and Didi Yao and Jiannong Cao and Keqiu Li",
title = "Efficient Range Queries for Large-Scale
Sensor-Augmented {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1873--1886",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2936977",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the practically important problem
of range query for sensor-augmented RFID systems, which
is to classify the target tags according to the ranges
specified by the user. The existing RFID protocols that
seem to address this problem suffer from either low
time-efficiency or the information corruption issue. To
overcome their limitations, we first propose a basic
classification protocol called Range Query RQ, in which
each tag pseudo-randomly chooses a slot from the time
frame and uses the ON-OFF Keying modulation to reply
its range identifier. Then, RQ employs a collaborative
decoding method to extract the tag range information
from singleton and even collision slots. The numerical
results reveal that the number of queried ranges
significantly affects the performance of RQ. To
optimize the number of queried ranges, we further
propose the Partition\&Mergence PM approach that
consists of two steps, i.e., top-down partitioning and
bottom-up merging. Sufficient theoretical analyses are
proposed to optimize the involved parameters, thereby
minimizing the time cost of RQ+PM or minimizing its
energy cost. We can trade off between time cost and
energy cost by adjusting the related parameters. The
prominent advantages of the RQ+PM protocol over
previous protocols are two-fold: i it is able to make
use of the collision slots, which are treated as
useless in previous protocols. Thus, frame utilization
can be significantly improved; ii it is immune to the
interference from unexpected tags, and does not suffer
information corruption issue. We use USRP and WISP tags
to conduct a set of experiments, which demonstrate the
feasibility of RQ+PM. Extensive simulation results
reveal that RQ+PM can ensure 100\% query accuracy, and
reduce the time cost as much as 40\% when comparing
with the state-of-the-art protocols.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{He:2019:JAS,
author = "Qing He and Gyorgy Dan and Viktoria Fodor",
title = "Joint Assignment and Scheduling for Minimizing Age of
Correlated Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1887--1900",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2936759",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Age of information has been recently proposed to
quantify the freshness of information, e.g., in
cyber-physical systems, where it is of critical
importance. Motivated by wireless camera networks where
multi-view image processing is required, in this paper
we propose to extend the concept of age of information
to capture packets carrying correlated data. We
consider a system consisting of wireless camera nodes
with overlapping fields of view and a set of processing
nodes, and address the problem of the joint
optimization of processing node assignment and camera
transmission scheduling, so as to minimize the maximum
peak age of information from all sources. We formulate
the multi-view age minimization MVAM problem, and prove
its NP-hardness under the two widely used interference
models as well as with given candidate transmitting
groups. We provide fundamental results including
tractable cases and optimality conditions of the MVAM
problem for two baseline scenarios. To solve MVAM
efficiently, we develop an optimization algorithm based
on a decomposition approach. Numerical results show
that by employing our approach the maximum peak age is
significantly reduced in comparison to a traditional
centralized solution with minimum-time scheduling.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Popescu:2019:IDS,
author = "Dalia Popescu and Philippe Jacquet and Bernard Mans
and Robert Dumitru and Andra Pastrav and Emanuel
Puschita",
title = "Information Dissemination Speed in Delay Tolerant
Urban Vehicular Networks in a Hyperfractal Setting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1901--1914",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2936636",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the fundamental communication
properties of urban vehicle networks by exploiting the
self-similarity and hierarchical organization of modern
cities. We use an innovative model called
``hyperfractal'' that captures the self-similarities of
both the traffic and vehicle locations but avoids the
extremes of regularity and randomness. We use
analytical tools to derive theoretical upper and lower
bounds for the information propagation speed in an
urban delay tolerant network i.e., a network that is
disconnected at all time, and thus uses a
store-carry-and-forward routing model. We prove that
the average broadcast time behaves as $ n^{1 - \delta }
$ times a slowly varying function, where $ \delta $
depends on the precise fractal dimension. Furthermore,
we show that the broadcast speedup is due in part to an
interesting self-similar phenomenon, that we denote as
information teleportation. This phenomenon arises as a
consequence of the topology of the vehicle traffic, and
triggers an acceleration of the broadcast time. We show
that our model fits real cities where open traffic data
sets are available. We present simulations confirming
the validity of the bounds in multiple realistic
settings, including scenarios with variable speed,
using both QualNet and a discrete-event simulator in
Matlab.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mendis:2019:DBR,
author = "H. V. Kalpanie Mendis and Indika A. M. Balapuwaduge
and Frank Y. Li",
title = "Dependability-Based Reliability Analysis in {URC}
Networks: Availability in the Space Domain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1915--1930",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2934826",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Ultra-reliable low latency communication URLLC, which
refers to achieving almost 100\% reliability at a
certain satisfactory level of services and stringent
latency, is one of the key requirements for 5G
networks. However, most prior studies on reliable
communication did not address space domain analysis.
Neither were they pursued from a dependability
perspective. This paper addresses the ultra-reliable
communication URC aspect of URLLC and aims at
advocating the concept of URC from a dependability
perspective in the space domain. We perform in-depth
analysis on URC considering both the spatial
characteristics of cell deployment and user
distributions, as well as service requirements. We
first introduce the concepts of cell availability and
system availability in the space domain, then perform
connectivity-based availability analysis by considering
a Voronoi tessellation where base stations BSs are
deployed according to a certain distribution. Moreover,
we investigate the relationship between
signal-to-interference-plus-noise ratio SINR, user
requirement, and achievable cell or system availability
by employing both Poisson point process PPP and
determinantal point process DPP BS distributions. For
SINR-based availability analysis, coverage contours are
identified. Considering further the user distribution
in a region of interest, expressions for system
availability are derived from users' perspective.
Furthermore, we propose an algorithm which could be
used for availability improvement based on the
calculated availability level. Numerical results
obtained considering diverse network scenarios and cell
deployments with multiple cells and multiple topologies
illustrate the achievable availability under various
circumstances.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yu:2019:PQA,
author = "Ruozhou Yu and Guoliang Xue and Xiang Zhang",
title = "Provisioning {QoS}-Aware and Robust Applications in
{Internet of Things}: a Network Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1931--1944",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2936015",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Internet-of-Things IoT has inspired numerous new
applications ever since its invention. Nevertheless,
its development and utilization have always been
restricted by the limited resources in various
application scenarios. In this paper, we study the
problem of resource provisioning for real-time IoT
applications, i.e., applications that process
concurrent data streams from data sources in the
network. We investigate joint application placement and
data routing to support IoT applications that have both
quality-of-service and robustness requirements. We
formulate four versions of the provisioning problem,
spanning across two important classes of real-time
applications parallelizable and non-parallelizable, and
two provisioning scenarios single application and
multiple applications. All versions are proved to be
NP-hard. We propose fully polynomial-time approximation
schemes for three of the four versions, and a
randomized algorithm for the forth. Through simulation
experiments, we analyze the impact of parallelizability
and robustness on the provisioning performance, and
show that our proposed algorithms can greatly improve
the quality-of-service of the IoT applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2019:FSF,
author = "Xiang-Yang Li and Huiqi Liu and Lan Zhang and Zhenan
Wu and Yaochen Xie and Ge Chen and Chunxiao Wan and
Zhongwei Liang",
title = "Finding the Stars in the Fireworks: Deep Understanding
of Motion Sensor Fingerprint",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1945--1958",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2933269",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the proliferation of mobile devices and various
sensors e.g., GPS, magnetometer, accelerometers,
gyroscopes equipped, richer services, e.g. location
based services, are provided to users. A series of
methods have been proposed to protect the users'
privacy, especially the trajectory privacy. Hardware
fingerprinting has been demonstrated to be a surprising
and effective source for identifying/authenticating
devices. In this work, we show that a few data samples
collected from the motion sensors are enough to
uniquely identify the source mobile device, i.e., the
raw motion sensor data serves as a fingerprint of the
mobile device. Specifically, we first analytically
understand the fingerprinting capacity using features
extracted from hardware data. To capture the essential
device feature automatically, we design a multi-LSTM
neural network to fingerprint mobile device sensor in
real-life uses, instead of using handcrafted features
by existing work. Using data collected over 6 months,
for arbitrary user movements, our fingerprinting model
achieves 93\% F-score given one second data, while the
state-of-the-art work achieves 79\% F-score. Given ten
seconds randomly sampled data, our model can achieve
98.8\% accuracy. We also propose a novel generative
model to modify the original sensor data and yield
anonymized data with little fingerprint information
while retain good data utility.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2019:TMC,
author = "Xiaowen Gong and Ness B. Shroff",
title = "Truthful Mobile Crowdsensing for Strategic Users With
Private Data Quality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1959--1972",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2934026",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile crowdsensing has found a variety of
applications e.g., spectrum sensing, environmental
monitoring by leveraging the ``wisdom'' of a
potentially large crowd of mobile users. An important
metric of a crowdsensing task is data accuracy, which
relies on the data quality of the participating users'
data e.g., users' received SNRs for measuring a
transmitter's transmit signal strength. However, the
quality of a user can be its private information which,
e.g., may depend on the user's location that it can
manipulate to its own advantage, which can mislead the
crowdsensing requester about the knowledge of the
data's accuracy. This issue is exacerbated by the fact
that the user can also manipulate its effort made in
the crowdsensing task, which is a hidden action that
could result in the requester having incorrect
knowledge of the data's accuracy. In this paper, we
devise truthful crowdsensing mechanisms for Quality and
Effort Elicitation QEE, which incentivize strategic
users to truthfully reveal their private quality and
truthfully make efforts as desired by the requester.
The QEE mechanisms achieve the truthful design by
overcoming the intricate dependency of a user's data on
its private quality and hidden effort. Under the QEE
mechanisms, we show that the crowdsensing requester's
optimal RO effort assignment assigns effort only to the
best user that has the smallest ``virtual valuation'',
which depends on the user's quality and the quality's
distribution. We also show that, as the number of users
increases, the performance gap between the RO effort
assignment and the socially optimal effort assignment
decreases, and converges to 0 asymptotically. We
further discuss some extensions of the QEE mechanisms.
Simulation results demonstrate the truthfulness of the
QEE mechanisms and the system efficiency of the RO
effort assignment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2019:CES,
author = "Zhenjie Yang and Yong Cui and Xin Wang and Yadong Liu
and Minming Li and Shihan Xiao and Chuming Li",
title = "Cost-Efficient Scheduling of Bulk Transfers in
Inter-Datacenter {WANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1973--1986",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2934896",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With the quick growth of traffic between data centers,
inefficient transfer scheduling in inter-datacenter
networks can lead to a huge waste of bandwidth thus
significant bandwidth cost. Previous work have explored
different ways, such as software-defined WANs and
dynamic pricing mechanisms, to overcome the
inefficiency of inter-datacenter networks. However,
there is a big challenge in addressing the fundamental
conflicts between the deadline-aware transfer
scheduling and minimizing the bandwidth cost. Unlike
existing efforts that schedule inter-datacenter
transfers under fixed link capacities, wherein some
deadlines are violated and the service quality is
degraded, we aim to finish all the transfers on time
with as little bandwidth as possible to minimize the
bandwidth cost. We take into account the variation of
bandwidth price and the deadline requirements of
services, and formulate the problem of cost-efficient
scheduling of bulk transfers with deadline guarantee,
which is shown to be NP-hard. Benefitting from the
relax-and-round method, we propose a
progressively-descending algorithm PDA to schedule bulk
transfers and meet the above goals with a guaranteed
approximation ratio. We apply our algorithm in a bulk
transfer scheduler, Butler, and build a small-scale
testbed to evaluate its efficiency. Both large-scale
simulation and testbed experiment results validate the
ability of our scheme on cutting down the bandwidth
cost. Compared with existing approaches, it reduces up
to 60\% bandwidth cost and increases the network
utilization by up to 140\%.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Garrido:2019:JSC,
author = "Pablo Garrido and Douglas J. Leith and Ramon Aguero",
title = "Joint Scheduling and Coding for Low In-Order Delivery
Delay Over Lossy Paths With Delayed Feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "1987--2000",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2934522",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the transmission of packets across a lossy
end-to-end network path so as to achieve low in-order
delivery delay. This can be formulated as a decision
problem, namely deciding whether the next packet to
send should be an information packet or a coded packet.
Importantly, this decision is made based on delayed
feedback from the receiver. While an exact solution to
this decision problem is challenging, we exploit ideas
from queueing theory to derive scheduling policies
based on prediction of a receiver queue length that,
while suboptimal, can be efficiently implemented and
offer substantially better performance than state of
the art approaches. We obtain a number of useful
analytic bounds that help characterise design
trade-offs and our analysis highlights that the use of
prediction plays a key role in achieving good
performance in the presence of significant feedback
delay. Our approach readily generalises to networks of
paths and we illustrate this by application to
multipath transport scheduler design.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Roy:2019:ULP,
author = "Arjun Roy and Rajdeep Das and Hongyi Zeng and Jasmeet
Bagga and Alex C. Snoeren",
title = "Understanding the Limits of Passive Realtime
Datacenter Fault Detection and Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2001--2014",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2938228",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Datacenters are characterized by large scale,
stringent reliability requirements, and significant
application diversity. However, the realities of
employing hardware with non-zero failure rates mean
that datacenters are subject to significant numbers of
failures that can impact performance. Moreover,
failures are not always obvious; network components can
fail partially, dropping or delaying only subsets of
packets. Thus, traditional fault detection techniques
involving end-host or router-based statistics can fall
short in their ability to identify these errors. We
describe how to expedite the process of detecting and
localizing partial datacenter faults using an end-host
method generalizable to most datacenter applications.
In particular, we correlate end-host transport-layer
flow metrics with per-flow network paths and apply
statistical analysis techniques to identify outliers
and localize faulty links and/or switches. We evaluate
our approach in a production Facebook front-end
datacenter, focusing on its effectiveness across a
range of traffic patterns.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Jia:2019:MET,
author = "Xuya Jia and Dan Li and Jing Zhu and Yong Jiang",
title = "{Metro}: an Efficient Traffic Fast Rerouting Scheme
With Low Overhead",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2015--2027",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2935382",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Failure is common instead of exception in large-scale
networks. To provide high service quality to
upper-layer applications, it is desired that a
converged backup path can be rapidly launched when
failure occurs. In this paper, we design an IP based
Fast ReRouting FRR scheme called Metro, which can solve
the traffic rerouting convergence problem after
arbitrary single link/node failure with low stretch for
the backup path. When failure occurs in the network,
Metro first indicates all the network areas that would
be affected by the failure, and then finds out a few
bridge links to drain the traffic in the affected
network area to the network area that is not affected
by the failure. In this way, Metro does not configure
tunnels, encapsulate or modify data packets, and hence
it is easy to be deployed in current networks.
Extensive simulations show that Metro can solve
arbitrary single link/node failure with backup paths
shorter than the state-of-the-art solutions, and about
98\% of the backup path stretch in Metro are the same
as the optimal tunnel scheme.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Pappas:2019:NTB,
author = "Christos Pappas and Taeho Lee and Raphael M. Reischuk
and Pawel Szalachowski and Adrian Perrig",
title = "Network Transparency for Better {Internet} Security",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2028--2042",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2937132",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The lack of transparency for Internet communication
prevents effective mitigation of today's security
threats: i Source addresses cannot be trusted and
enable untraceable reflection attacks. ii Malicious
communication is opaque to all network entities, except
for the receiver; and although ISPs are control points
that can stop such attacks, effective detection and
mitigation requires information that is available only
at the end hosts. We propose TRIS, an architecture that
bootstraps transparency for Internet communication.
TRIS enables the definition of misbehavior according to
the unique requirements of hosts, and then it
constructs verifiable evidence of misbehavior. First,
hosts express desired traffic properties for incoming
traffic; a deviation from these properties signifies
misbehavior. Second, ISPs construct verifiable evidence
of misbehavior for the traffic they forward. If
misbehavior is detected, it can then be proven to the
ISPs of the communicating hosts. We implement our
architecture on commodity hardware and demonstrate that
verifiable proof of misbehavior introduces little
overhead with respect to bandwidth and packet
processing in the network: our prototype achieves
line-rate performance for common packet sizes,
saturating a 10 Gbps link with a single CPU core. In
addition, we tackle incremental deployment issues and
describe interoperability with today's Internet
architecture.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yang:2019:CCD,
author = "Kang Yang and Tianzhang Xing and Yang Liu and
Zhenjiang Li and Xiaoqing Gong and Xiaojiang Chen and
Dingyi Fang",
title = "{cDeepArch}: a Compact Deep Neural Network
Architecture for Mobile Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2043--2055",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2936939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile sensing is a promising sensing paradigm in the
era of Internet of Things IoT that utilizes mobile
device sensors to collect sensory data about sensing
targets and further applies learning techniques to
recognize the sensed targets to correct classes or
categories. Due to the recent great success of deep
learning, an emerging trend is to adopt deep learning
in this recognition process, while we find an
overlooked yet crucial issue to be solved in this paper
--- The size of deep learning models should be
sufficiently large for reliably classifying various
types of recognition targets, while the achieved
processing delay may fail to satisfy the stringent
latency requirement from applications. If we blindly
shrink the deep learning model for acceleration, the
performance cannot be guaranteed. To cope with this
challenge, this paper presents a compact deep neural
network architecture, namely cDeepArch. The key idea of
the cDeepArch design is to decompose the entire
recognition task into two lightweight sub-problems:
context recognition and the context-oriented target
recognitions. This decomposition essentially utilizes
the adequate storage to trade for the CPU and memory
resource consumptions during execution. In addition, we
further formulate the execution latency for decomposed
deep learning models and propose a set of enhancement
techniques, so that system performance and resource
consumption can be quantitatively balanced. We
implement a cDeepArch prototype system and conduct
extensive experiments. The result shows that cDeepArch
achieves excellent recognition performance and the
execution latency is also lightweight.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Motamedi:2019:MIT,
author = "Reza Motamedi and Bahador Yeganeh and Balakrishnan
Chandrasekaran and Reza Rejaie and Bruce M. Maggs and
Walter Willinger",
title = "On Mapping the Interconnections in Today's
{Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2056--2070",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940369",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Internet interconnections are the means by which
networks exchange traffic between one another. These
interconnections are typically established in
facilities that have known geographic locations, and
are owned and operated by so-called colocation and
interconnection services providers e.g., Equinix,
CoreSite, and EdgeConneX. These previously
under-studied colocation facilities and the critical
role they play in solving the notoriously difficult
problem of obtaining a comprehensive view of the
structure and evolution of the interconnections in
today's Internet are the focus of this paper. We
present $ \tt {mi}^2 $, a new approach for mapping
Internet interconnections inside a given colocation
facility.1 We infer the existence of interconnections
from localized traceroutes and use the Belief
Propagation algorithm on a specially defined Markov
Random Field graphical model to geolocate them to a
target colocation facility. We evaluate $ \tt {mi}^2 $
by applying it initially to a small set of US-based
colocation facilities. In the process, we compare our
results against those obtained by two recently
developed related techniques and discuss observed
discrepancies that derive from how the different
techniques determine the ownership of border routers.
As part of our validation approach, we also identify
drastic changes in today's Internet interconnection
ecosystem e.g., new infrastructures in the form of
``cloud exchanges'' that offer new types of
interconnections called ``virtual private
interconnections'', and discuss their wide-ranging
implications for obtaining an accurate and
comprehensive map of the Internet's interconnection
fabric. An open-source prototype of $ \tt {mi}^2 $ is
available at our project website located at
https://onrg.gitlab.io/projects/mii.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Rost:2019:VNE,
author = "Matthias Rost and Stefan Schmid",
title = "Virtual Network Embedding Approximations: Leveraging
Randomized Rounding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2071--2084",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2939950",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The Virtual Network Embedding Problem VNEP captures
the essence of many resource allocation problems. In
the VNEP, customers request resources in the form of
Virtual Networks. An embedding of a virtual network on
a shared physical infrastructure is the joint mapping
of virtual nodes to physical servers together with the
mapping of virtual edges onto paths in the physical
network connecting the respective servers. This work
initiates the study of approximation algorithms for the
VNEP for general request graphs. Concretely, we study
the offline setting with admission control: given
multiple requests, the task is to embed the most
profitable subset while not exceeding resource
capacities. Our approximation is based on the
randomized rounding of Linear Programming LP solutions.
Interestingly, we uncover that the standard LP
formulation for the VNEP exhibits an inherent
structural deficit when considering general virtual
network topologies: its solutions cannot be decomposed
into valid embeddings. In turn, focusing on the class
of cactus request graphs, we devise a novel LP
formulation, whose solutions can be decomposed. Proving
performance guarantees of our rounding scheme, we
obtain the first approximation algorithm for the VNEP
in the resource augmentation model. We propose
different types of rounding heuristics and evaluate
their performance in an extensive computational study.
Our results indicate that good solutions can be
achieved even without resource augmentations.
Specifically, heuristical rounding achieves 77.2\% of
the baseline's profit on average while respecting
capacities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hayhoe:2019:CEN,
author = "Mikhail Hayhoe and Fady Alajaji and Bahman
Gharesifard",
title = "Curing Epidemics on Networks Using a {Polya} Contagion
Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2085--2097",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940888",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We study the curing of epidemics of a network
contagion, which is modelled using a variation of the
classical Polya urn process that takes into account
spatial infection among neighbouring nodes. We
introduce several quantities for measuring the overall
infection in the network and use them to formulate an
optimal control problem for minimizing the average
infection rate using limited curing resources. We prove
the feasibility of this problem under high curing
budgets by deriving conservative lower bounds on the
amount of curing per node that turn our measures of
network infection into supermartingales. We also
provide a provably convergent gradient descent
algorithm to find the allocation of curing under
limited budgets. Motivated by the fact that this
strategy is computationally expensive, we design a suit
of heuristic methods that are locally implementable and
nearly as effective. Extensive simulations run on
large-scale networks demonstrate the effectiveness of
our proposed strategies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cohen:2019:CEV,
author = "Reuven Cohen and Yuval Nezri",
title = "Cardinality Estimation in a Virtualized Network Device
Using Online Machine Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2098--2110",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940705",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Cardinality estimation algorithms receive a stream of
elements, with possible repetitions, and return the
number of distinct elements in the stream. Such
algorithms seek to minimize the required memory and CPU
resource consumption at the price of inaccuracy in
their output. In computer networks, cardinality
estimation algorithms are mainly used for counting the
number of distinct flows, and they are divided into two
categories: sketching algorithms and sampling
algorithms. Sketching algorithms require the processing
of all packets, and they are therefore usually
implemented by dedicated hardware. Sampling algorithms
do not require processing of all packets, but they are
known for their inaccuracy. In this work we identify
one of the major drawbacks of sampling-based
cardinality estimation algorithms: their inability to
adapt to changes in flow size distribution. To address
this problem, we propose a new sampling-based adaptive
cardinality estimation framework, which uses online
machine learning. We evaluate our framework using real
traffic traces, and show significantly better accuracy
compared to the best known sampling-based algorithms,
for the same fraction of processed packets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Darzanos:2019:CFE,
author = "George Darzanos and Iordanis Koutsopoulos and George
D. Stamoulis",
title = "Cloud Federations: Economics, Games and Benefits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2111--2124",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2943810",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sharing economy is a game-changing business paradigm
that is currently permeating several industrial
sectors. This paper aims to build a fundamental theory
of the sharing economy of the computational capacity
resource of Cloud Service Providers CSPs. CSPs aim to
cost-efficient serve geographically dispersed customers
that often request computational resource-demanding
services. The formation of CSP federations arises as an
effective means to manage these diverse and
time-varying service requests. In this paper, we
introduce innovative federation models and policies for
profitable federations that also achieve adequate QoS
for their customers. Taking in account the flexible
cloud computing service model, we abstract the
virtualized infrastructure of each CSP to an M/M/1
queueing system, we formulate the CSP revenue and cost
functions, and we study the task forwarding-based TF
and the capacity sharing-based CS federation
approaches. Under TF, each CSP may forward part of its
workload to other federated CSPs, while under CS each
CSP may share parts of its computational infrastructure
with others. For both approaches, we propose two
operation modes with different degree of CSPs'
cooperation: $i$ the joint business mode, where the
CSPs fully cooperate: they jointly decide on the
federation policies that maximize the total federation
profit which is shared fairly among them; $ i i$ the
reward-driven mode, where self-interested CSPs
participate in a game: they adjust their responses to
federation policies aiming to maximize their individual
profits. The results reveal that our policies lead to
effective federations, which are beneficial both for
CSPs and for customers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Baldesi:2019:SGF,
author = "Luca Baldesi and Athina Markopoulou and Carter T.
Buttsc",
title = "Spectral Graph Forge: a Framework for Generating
Synthetic Graphs With a Target Modularity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2125--2136",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940377",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Community structure is an important property that
captures inhomogeneities common in large networks, and
modularity is one of the most widely used metrics for
such community structure. In this paper, we introduce a
principled methodology, the Spectral Graph Forge, for
generating random graphs that preserves community
structure from a real network of interest, in terms of
modularity. Our approach leverages the fact that the
spectral structure of matrix representations of a graph
encodes global information about community structure.
The Spectral Graph Forge uses a low-rank approximation
of the modularity matrix to generate synthetic graphs
that match a target modularity within user-selectable
degree of accuracy, while allowing other aspects of
structure to vary. We show that the Spectral Graph
Forge outperforms state-of-the-art techniques in terms
of accuracy in targeting the modularity and randomness
of the realizations, while also preserving other local
structural properties and node attributes. We discuss
extensions of the Spectral Graph Forge to target other
properties beyond modularity, and its applications to
anonymization.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{VanHoudt:2019:RWS,
author = "Benny {Van Houdt}",
title = "Randomized Work Stealing Versus Sharing in Large-Scale
Systems With Non-Exponential Job Sizes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2137--2149",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2939040",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Work sharing and work stealing are two scheduling
paradigms to redistribute work when performing
distributed computations. In work sharing, processors
attempt to migrate pending jobs to other processors in
the hope of reducing response times. In work stealing,
on the other hand, underutilized processors attempt to
steal jobs from other processors. Both paradigms
generate a certain communication overhead and the
question addressed in this paper is which of the two
reduces the response time the most given that they use
the same amount of communication overhead. Prior work
presented explicit bounds, for large scale systems, on
when randomized work sharing outperforms randomized
work stealing in case of Poisson arrivals and
exponential job sizes and indicated that work sharing
is best when the load is below $ \phi - 1 \approx
0.6180 $, with $ \phi $ being the golden ratio. In this
paper we revisit this problem and study the impact of
the job size distribution using a mean field model. We
present an efficient method to determine the boundary
between the regions where sharing or stealing is best
for a given job size distribution, as well as bounds
that apply to any phase-type job size distribution. The
main insight is that work stealing benefits
significantly from having more variable job sizes and
work sharing may become inferior to work stealing for
loads as small as $ 1 / 2 + \epsilon $ for any $
\epsilon \& g t; 0 $.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lin:2019:ICI,
author = "Kate Ching-Ju Lin and Kai-Cheng Hsu and Hung-Yu Wei",
title = "Inter-Client Interference Cancellation for Full-Duplex
Networks With Half-Duplex Clients",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2150--2163",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940048",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Recent studies have experimentally shown the gains of
full-duplex radios. However, due to its relatively
higher cost and complexity, we can envision a more
practical step in the network evolution is to have a
full-duplex access point AP but keep the clients
half-duplex. Unfortunately, the full-duplex gains can
hardly be extracted in practice as the uplink
transmission from a half-duplex client introduces
inter-client interference to another downlink client.
To address this issue, we present the design and
implementation of IC2 Inter-Client Interference
Cancellation, the first physical layer solution that
exploits the AP's full-duplex capability to actively
cancel the interference at the downlink client. Such
active cancellation not only improves the achievable
capacity, but also better tolerates imperfect user
pairing, simplifying the MAC design as a result. We
build a prototype of IC2 on USRP-N200 and evaluate its
performance via both testbed experiments and
large-scale trace-driven simulations. The results show
that, without IC2, about 60\% of client pairs produce
no gain from full-duplex transmissions, while, with IC2
the median gain of the achievable rate over
conventional half-duplex networks can be $ 1.65 \times
$ and $ 1.47 \times $ for 1- and 2-antenna scenarios,
respectively, even when clients are simply paired
randomly.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shen:2019:OMD,
author = "Kaiming Shen and Wei Yu and Licheng Zhao and Daniel P.
Palomar",
title = "Optimization of {MIMO} Device-to-Device Networks via
Matrix Fractional Programming: a
Minorization--Maximization Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "5",
pages = "2164--2177",
month = oct,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2943561",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Dec 11 07:15:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Interference management is a fundamental issue in
device-to-device D2D communications whenever the
transmitter-and-receiver pairs are located in close
proximity and frequencies are fully reused, so active
links may severely interfere with each other. This
paper devises an optimization strategy named FPLinQ to
coordinate the link scheduling decisions among the
interfering links, along with power control and
beamforming. The key enabler is a novel optimization
method called matrix fractional programming FP that
generalizes previous scalar and vector forms of FP in
allowing multiple data streams per link. From a
theoretical perspective, this paper provides a deeper
understanding of FP by showing a connection to the
minorization-maximization MM algorithm. From an
application perspective, this paper shows that as
compared to the existing methods for coordinating
scheduling in the D2D network, such as FlashLinQ,
ITLinQ, and ITLinQ+, the proposed FPLinQ approach is
more general in allowing multiple antennas at both the
transmitters and the receivers, and further in allowing
arbitrary and multiple possible associations between
the devices via matching. Numerical results show that
FPLinQ significantly outperforms the previous
state-of-the-art in a typical D2D communication
environment.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2019:CAR,
author = "Alex X. Liu and Eric Norige",
title = "A De-Compositional Approach to Regular Expression
Matching for Network Security",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2179--2191",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2941920",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2941920",
abstract = "Regular Expression (RegEx) matching is the industry
standard for Deep Packet Inspection (DPI) because
RegExes are significantly more expressive than strings.
To achieve high matching speed, we need to convert the
RegExes to Deterministic Finite State Automata (DFA).
However, DFA has the state explosion problem, that is,
the number of DFA states and transitions can be
exponential with the number of RegExes. Much work has
addressed the DFA state explosion problem; however,
none has met all the requirements of fast and automated
construction, small memory image, and high matching
speed. In this paper, we propose a decompositional
approach, with fast and automated construction, small
memory image, and high matching speed, to DFA state
explosion. The first key idea is to decompose a complex
RegEx that cause exponential state increases into a set
of simpler RegExes that do not cause exponential state
increases, where any character string that matches the
complex RegEx also matches all the RegExes in the set
of simpler RegExes; that is, the set of strings that
match the complex RegEx is a subset of strings that
match the set of simpler RegExes. The second key idea
is to use a stateful post-processing engine to filter
the matches that are actually the matches of the
complex RegEx. Given an input string for matching,
instead of using the large DFA constructed from the
original complex RegEx to perform the matching, we
first use the small DFA constructed from the set of
simpler RegExes to perform the matching, and then, if
the small DFA reports a match, we use the
post-processing engine to determine whether it is a
true match to the original complex RegEx. Because the
pre-processing is simple, automaton construction can be
automated and fast, and because most on-line processing
is done by a DFA, its matching speed is close to that
of a DFA alone. Our experimental results show that our
decompositional approach achieves orders of magnitude
faster DFA construction (in terms of seconds instead of
minutes), 30 times smaller memory image, and 43\%
faster matching speeds, than state-of-the-art software
based RegEx matching algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Avner:2019:MUC,
author = "Orly Avner and Shie Mannor",
title = "Multi-User Communication Networks: a Coordinated
Multi-Armed Bandit Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2192--2207",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2935043",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2935043",
abstract = "Communication networks shared by many users are a
widespread challenge nowadays. In this paper we address
several aspects of this challenge simultaneously:
learning unknown stochastic network characteristics,
sharing resources with other users while \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2019:DDP,
author = "Haiming Jin and Baoxiang He and Lu Su and Klara
Nahrstedt and Xinbing Wang",
title = "Data-Driven Pricing for Sensing Effort Elicitation in
Mobile Crowd Sensing Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2208--2221",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2938453",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2938453",
abstract = "The recent proliferation of human-carried mobile
devices has given rise to mobile crowd sensing (MCS)
systems that outsource sensory data collection to the
public crowd. In order to identify truthful values from
(crowd) workers' noisy or even \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2019:ARM,
author = "Kun Xie and Xiangge Wang and Xin Wang and Yuxiang Chen
and Gaogang Xie and Yudian Ouyang and Jigang Wen and
Jiannong Cao and Dafang Zhang",
title = "Accurate Recovery of Missing Network Measurement Data
With Localized Tensor Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2222--2235",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2940147",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2940147",
abstract = "The inference of the network traffic data from partial
measurements data becomes increasingly critical for
various network engineering tasks. By exploiting the
multi-dimensional data structure, tensor completion is
a promising technique for more accurate \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2019:AMU,
author = "Tong Yang and Jie Jiang and Peng Liu and Qun Huang and
Junzhi Gong and Yang Zhou and Rui Miao and Xiaoming Li
and Steve Uhlig",
title = "Adaptive Measurements Using One Elastic Sketch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2236--2251",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2943939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2943939",
abstract = "When network is undergoing problems such as
congestion, scan attack, DDoS attack, {$<$ italic$>$
etc$<$}/{italic$>$}, measurements are much more
important than usual. In this case, traffic
characteristics including available bandwidth, packet
rate, and flow size \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Reviriego:2019:TCB,
author = "Pedro Reviriego and Ori Rottenstreich",
title = "The Tandem Counting {Bloom} Filter --- It Takes Two
Counters to Tango",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2252--2265",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2944954",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2944954",
abstract = "Set representation is a crucial functionality in
various areas such as networking and databases. In many
applications, memory and time constraints allow only an
approximate representation where errors can appear for
some queried elements. The Variable-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Aktas:2019:SMS,
author = "Mehmet Fatih Akta{\c{s}} and Emina Soljanin",
title = "Straggler Mitigation at Scale",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2266--2279",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2946464",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2946464",
abstract = "Runtime performance variability has been a major
issue, hindering predictable and scalable performance
in modern distributed systems. Executing requests or
jobs redundantly over multiple servers have been shown
to be effective for mitigating variability, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yun:2019:ABD,
author = "Daqing Yun and Chase Q. Wu and Nageswara S. V. Rao and
Rajkumar Kettimuthu",
title = "Advising Big Data Transfer Over Dedicated Connections
Based on Profiling Optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2280--2293",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2943884",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2943884",
abstract = "Big data transfer in next-generation scientific
applications is now commonly carried out over dedicated
channels in high-performance networks (HPNs), where
transport protocols play a critical role in maximizing
application-level throughput. Optimizing the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2019:EDT,
author = "Haiqin Wu and Liangmin Wang and Guoliang Xue and Jian
Tang and Dejun Yang",
title = "Enabling Data Trustworthiness and User Privacy in
Mobile Crowdsensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2294--2307",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2944984",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2944984",
abstract = "Ubiquitous mobile devices with rich sensors and
advanced communication capabilities have given rise to
mobile crowdsensing systems. The diverse reliabilities
of mobile users and the openness of sensing paradigms
raise concerns for data trustworthiness, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2019:MRE,
author = "Guo Chen and Yuanwei Lu and Bojie Li and Kun Tan and
Yongqiang Xiong and Peng Cheng and Jiansong Zhang and
Thomas Moscibroda",
title = "{MP-RDMA}: Enabling {RDMA} With Multi-Path Transport
in Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2308--2323",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2948917",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2948917",
abstract = "RDMA is becoming prevalent because of its low latency,
high throughput and low CPU overhead. However, in
current datacenters, RDMA remains a single path
transport which is prone to failures and falls short to
utilize the rich parallel network paths. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2019:DAG,
author = "Chen Chen and Lei Liu and Tie Qiu and Dapeng Oliver Wu
and Zhiyuan Ren",
title = "Delay-Aware Grid-Based Geographic Routing in Urban
{VANETs}: a Backbone Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2324--2337",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2944595",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2944595",
abstract = "Due to the random delay, local maximum and data
congestion in vehicular networks, the design of a
routing is really a challenging task especially in the
urban environment. In this paper, a distributed routing
protocol DGGR is proposed, which \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hu:2019:CCB,
author = "Jinbin Hu and Jiawei Huang and Wenjun Lv and Yutao
Zhou and Jianxin Wang and Tian He",
title = "{CAPS}: Coding-Based Adaptive Packet Spraying to
Reduce Flow Completion Time in Data Center",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2338--2353",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2945863",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2945863",
abstract = "Modern data-center applications generate a diverse mix
of short and long flows with different performance
requirements and weaknesses. The short flows are
typically delay-sensitive but to suffer the
head-of-line blocking and out-of-order problems. Recent
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2019:HRL,
author = "Qian Chen and Xiao Juan Zhang and Wei Lih Lim and Yuen
Sam Kwok and Sumei Sun",
title = "High Reliability, Low Latency and Cost Effective
Network Planning for Industrial Wireless Mesh
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2354--2362",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2947077",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2947077",
abstract = "In this paper, we study high reliability, low latency
and cost effective network planning for industrial
wireless mesh networks. Based on the requirements of
routing reliability, minimum end-to-end delay and
reduced deployment cost in wireless mesh \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Malandrino:2019:RSD,
author = "Francesco Malandrino and Carla Fabiana Chiasserini and
Gil Einziger and Gabriel Scalosub",
title = "Reducing Service Deployment Cost Through {VNF}
Sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2363--2376",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2945127",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2945127",
abstract = "Thanks to its computational and forwarding
capabilities, the mobile network infrastructure can
support several third-party
(&\#x201C;vertical&\#x201D;) services, each composed of
a graph of virtual (network) functions (VNFs).
Importantly, one or more VNFs \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cociglio:2019:MPM,
author = "Mauro Cociglio and Giuseppe Fioccola and Guido
Marchetto and Amedeo Sapio and Riccardo Sisto",
title = "Multipoint Passive Monitoring in Packet Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2377--2390",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2950157",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2950157",
abstract = "Traffic monitoring is essential to manage large
networks and validate Service Level Agreements. Passive
monitoring is particularly valuable to promptly
identify transient fault episodes and react in a timely
manner. This article proposes a novel, non-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2019:SPP,
author = "Ping Zhao and Hongbo Jiang and Jie Li and Fanzi Zeng
and Xiao Zhu and Kun Xie and Guanglin Zhang",
title = "Synthesizing Privacy Preserving Traces: Enhancing
Plausibility With Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2391--2404",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2947452",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2947452",
abstract = "Due to the popularity of mobile computing and mobile
sensing, users' traces can now be readily collected to
enhance applications' performance. However, users'
location privacy may be disclosed to the untrusted data
aggregator that \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jayasumana:2019:NTM,
author = "Anura P. Jayasumana and Randy Paffenroth and Gunjan
Mahindre and Sridhar Ramasamy and Kelum Gajamannage",
title = "Network Topology Mapping From Partial Virtual
Coordinates and Graph Geodesics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2405--2417",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2953921",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2953921",
abstract = "For many important network types, physical coordinate
systems and physical distances are either difficult to
discern or inapplicable. Accordingly, coordinate
systems and characterizations based on hop-distance
measurements, such as Topology Preserving \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2019:CG,
author = "Yang Liu and Bo Li and Brian D. O. Anderson and
Guodong Shi",
title = "Clique Gossiping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2418--2431",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2952082",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2952082",
abstract = "This paper proposes and investigates a framework for
clique gossip protocols. As complete subnetworks, the
existence of cliques is ubiquitous in various social,
computer, and engineering networks. By clique
gossiping, nodes interact with each other along
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nazemi:2019:DOF,
author = "Sepideh Nazemi and Kin K. Leung and Ananthram Swami",
title = "Distributed Optimization Framework for In-Network Data
Processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2432--2443",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2953581",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2953581",
abstract = "In-Network Processing (INP) is an effective way to
aggregate and process data from different sources and
forward the aggregated data to other nodes for further
processing until it reaches the end user. There is a
trade-off between energy consumption for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2019:TAV,
author = "Elaine Y.-N. Sun and Hsiao-Chun Wu and Scott C.-H.
Huang",
title = "Theoretical Analysis of Various Software-Defined
Multiplexing Codes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2444--2457",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2949823",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2949823",
abstract = "How to combine multiple data-streams for transmission
in aggregate is a very interesting problem, especially
for the emerging software-defined networks nowadays.
The conventional packet-based protocols cannot provide
the flexibility for combining data-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2019:DFD,
author = "Han Zhang and Haijun Geng and Yahui Li and Xia Yin and
Xingang Shi and Zhiliang Wang and Qianhong Wu and
Jianwei Liu",
title = "{DA\&FD}-Deadline-Aware and Flow Duration-Based Rate
Control for Mixed Flows in {DCNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2458--2471",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2951925",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2951925",
abstract = "Data center has become an important facility for
hosting various applications. For data center networks,
deadline missing rate and average flow completion time
are two main metrics for the performance of
applications. In this paper, we find deadline-aware
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2019:OOL,
author = "Zhenhua Han and Haisheng Tan and Xiang-Yang Li and
Shaofeng H.-C. Jiang and Yupeng Li and Francis C. M.
Lau",
title = "{OnDisc}: Online Latency-Sensitive Job Dispatching and
Scheduling in Heterogeneous Edge-Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "6",
pages = "2472--2485",
month = dec,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2953806",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:10 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2953806",
abstract = "In edge-cloud computing, a set of servers (called edge
servers) are deployed near the mobile devices to allow
these devices to offload their jobs to and subsequently
obtain their results from the edge servers with low
latency. One fundamental problem in \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dai:2020:FPI,
author = "Haipeng Dai and Meng Li and Alex X. Liu and Jiaqi
Zheng and Guihai Chen",
title = "Finding Persistent Items in Distributed Datasets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "1--14",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2946417",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2946417",
abstract = "This paper concerns the problem of finding persistent
items in distributed datasets, which has many
applications such as port scanning and intrusion
detection. To the best of our knowledge, there is no
existing solution for finding persistent items in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Talak:2020:OIF,
author = "Rajat Talak and Sertac Karaman and Eytan Modiano",
title = "Optimizing Information Freshness in Wireless Networks
Under General Interference Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "15--28",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2946481",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2946481",
abstract = "Age of information (AoI) is a recently proposed metric
for measuring information freshness. AoI measures the
time that elapsed since the last received update was
generated. We consider the problem of minimizing
average and peak AoI in a wireless networks, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Santagati:2020:DPE,
author = "G. Enrico Santagati and Neil Dave and Tommaso
Melodia",
title = "Design and Performance Evaluation of an Implantable
Ultrasonic Networking Platform for the {Internet of
Medical Things}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "29--42",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2949805",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2949805",
abstract = "Wireless networks of electronically controlled
implantable medical sensors and actuators will be the
basis of many innovative and potentially revolutionary
therapies. The biggest obstacle in realizing this
vision of networked implants is posed by the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qiao:2020:RLI,
author = "Yan Qiao and Jun Jiao and Xinhong Cui and Yuan Rao",
title = "Robust Loss Inference in the Presence of Noisy
Measurements and Hidden Fault Diagnosis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "43--56",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2948818",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2948818",
abstract = "This paper addresses the problem of inferring link
loss rates based on network performance tomography in
noisy network systems. Since network tomography
emerged, all existing tomography-based methods are
limited to the fulfillment of a basic condition:
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2020:MAE,
author = "Jia Zhao and Jiangchuan Liu and Haiyang Wang and Chi
Xu and Wei Gong and Changqiao Xu",
title = "Measurement, Analysis, and Enhancement of Multipath
{TCP} Energy Efficiency for Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "57--70",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2950908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2950908",
abstract = "Multipath TCP (MPTCP) has recently been suggested as a
promising transport protocol to boost the utilization
of underlaying datacenter networks, yet it also
increases the host CPU power consumption. It remains
unclear whether datacenters can indeed \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2020:PTA,
author = "Guocheng Liao and Xu Chen and Jianwei Huang",
title = "Prospect Theoretic Analysis of Privacy-Preserving
Mechanism",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "71--83",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2951713",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2951713",
abstract = "We study a problem of privacy-preserving mechanism
design. A data collector wants to obtain data from
individuals to perform some computations. To relieve
the privacy threat to the contributors, the data
collector adopts a privacy-preserving mechanism by
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kim:2020:DCD,
author = "Seokhyun Kim and Kimin Lee and Yeonkeun Kim and Jinwoo
Shin and Seungwon Shin and Song Chong",
title = "Dynamic Control for On-Demand Interference-Managed
{WLAN} Infrastructures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "84--97",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2953597",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2953597",
abstract = "In order to handle a high traffic demand, dense
wireless local area networks (WLANs) have been deployed
rapidly in the past years. However, dense WLANs cause
two critical issues: wastage of energy and severe
interference. To address these issues, the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shan:2020:OMM,
author = "Danfeng Shan and Fengyuan Ren and Peng Cheng and Ran
Shu and Chuanxiong Guo",
title = "Observing and Mitigating Micro-Burst Traffic in Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "98--111",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2953793",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2953793",
abstract = "Micro-burst traffic is not uncommon in data centers.
It can cause packet dropping, which may result in
serious performance degradation (e.g., Incast problem).
However, current approaches to mitigate micro-burst is
usually ad-hoc and not based on a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Saino:2020:LIC,
author = "Lorenzo Saino and Ioannis Psaras and Emilio Leonardi
and George Pavlou",
title = "Load Imbalance and Caching Performance of Sharded
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "112--125",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2957075",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2957075",
abstract = "Sharding is a method for allocating data items to
nodes of a distributed caching or storage system based
on the result of a hash function computed on the item's
identifier. It is ubiquitously used in key-value
stores, CDNs and many other \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:FAD,
author = "Xiulong Liu and Sheng Chen and Jia Liu and Wenyu Qu
and Fengjun Xiao and Alex X. Liu and Jiannong Cao and
Jiangchuan Liu",
title = "Fast and Accurate Detection of Unknown Tags for {RFID}
Systems --- Hash Collisions are Desirable",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "126--139",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2957239",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2957239",
abstract = "Unknown RFID tags appear when tagged items are not
scanned before being moved into a warehouse, which can
even cause serious security issues. This paper studies
the practically important problem of unknown tag
detection. Existing solutions either require \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Naveen:2020:COD,
author = "K. P. Naveen and Anurag Kumar",
title = "Coverage in One-Dimensional Wireless Networks With
Infrastructure Nodes and Relay Extensions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "140--153",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2957752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2957752",
abstract = "We consider a wireless network comprising two types of
nodes, namely, {$<$ italic$>$ sinks$<$}/{italic$>$} and
{$<$ italic$>$ relays$<$}/{italic$>$}. The sink nodes
are connected to a wireline infrastructure, while the
relay nodes are used to extend the region covered by
providing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:PAJ,
author = "Shuyi Chen and Xiqing Liu and Tianyu Zhao and
Hsiao-Hwa Chen and Weixiao Meng",
title = "Performance Analysis of Joint Transmission Schemes in
Ultra-Dense Networks --- A Unified Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "154--167",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2957319",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2957319",
abstract = "Ultra-dense network (UDN) is one of the enabling
technologies in the fifth generation (5G) wireless
communications, and the application of joint
transmission (JT) is extremely important to deal with
severe inter-cell interferences in UDNs. However, most
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mehic:2020:NAQ,
author = "Miralem Mehic and Peppino Fazio and Stefan Rass and
Oliver Maurhart and Momtchil Peev and Andreas Poppe and
Jan Rozhon and Marcin Niemiec and Miroslav Voznak",
title = "A Novel Approach to Quality-of-Service Provisioning in
Trusted Relay Quantum Key Distribution Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "168--181",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2956079",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2956079",
abstract = "In recent years, noticeable progress has been made in
the development of quantum equipment, reflected through
the number of successful demonstrations of Quantum Key
Distribution (QKD) technology. Although they showcase
the great achievements of QKD, many \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ganesan:2020:PGD,
author = "Ashwin Ganesan",
title = "Performance Guarantees of Distributed Algorithms for
{QoS} in Wireless Ad Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "182--195",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2959797",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2959797",
abstract = "Consider a wireless network where each communication
link has a minimum bandwidth quality-of-service
requirement. Certain pairs of wireless links interfere
with each other due to being in the same vicinity, and
this interference is modeled by a conflict \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lu:2020:NDV,
author = "Zongqing Lu and Kevin Chan and Rahul Urgaonkar and
Shiliang Pu and Thomas {La Porta}",
title = "{NetVision}: On-Demand Video Processing in Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "196--209",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2954909",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2954909",
abstract = "The vast adoption of mobile devices with cameras has
greatly contributed to the proliferation of the
creation and distribution of videos. For a variety of
purposes, valuable information may be extracted from
these videos. While the computational \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pham:2020:CAE,
author = "Minh Pham and Doan B. Hoang and Zenon Chaczko",
title = "Congestion-Aware and Energy-Aware Virtual Network
Embedding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "210--223",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2958367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2958367",
abstract = "Network virtualization is an inherent component of
future internet architectures. Network resources are
virtualized from the underlying substrate and
elastically provisioned and offered to customers
on-demand. Optimal allocation of network resources in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kou:2020:BEA,
author = "Caixia Kou and Dedong Hu and Jianhua Yuan and Wenbao
Ai",
title = "Bisection and Exact Algorithms Based on the
{Lagrangian} Dual for a Single-Constrained Shortest
Path Problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "224--233",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2955451",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2955451",
abstract = "We propose two new algorithms called BiLAD and
ExactBiLAD for the well-known Single-Constrained
Shortest Path (SCSP) problem. It is a fundamental
problem in quality-of-service (QoS) routing, where one
seeks a source-destination path with the least cost
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:JOO,
author = "Xiong Wang and Qi Deng and Jing Ren and Mehdi Malboubi
and Sheng Wang and Shizhong Xu and Chen-Nee Chuah",
title = "The Joint Optimization of Online Traffic Matrix
Measurement and Traffic Engineering For
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "234--247",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2957008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2957008",
abstract = "Software-Defined Networking (SDN) provides
programmable, flexible and fine-grained traffic control
capability, which paves the way for realizing dynamic
and high-performance traffic measurement and traffic
engineering. In the SDN paradigm, the traffic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Thomas:2020:LLF,
author = "Yannis Thomas and Merkourios Karaliopoulos and George
Xylomenos and George C. Polyzos",
title = "Low Latency Friendliness for Multipath {TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "248--261",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2961759",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2961759",
abstract = "Efficient congestion control is critical to the
operation of MPTCP, the Multipath extension of TCP.
Congestion control in such an environment primarily
aims at enhancing the cumulative TCP throughput over
the available paths, while preserving TCP-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bhattacharjee:2020:EEM,
author = "Sangeeta Bhattacharjee and Tamaghna Acharya and Uma
Bhattacharya",
title = "Energy-Efficient Multicasting in Hybrid Cognitive
Small Cell Networks: a Cross-Layer Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "262--274",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2962309",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2962309",
abstract = "We study the performance of a cognitive small cell
network, catering multicast services to multiple groups
of secondary users, using a pre-assigned set of
orthogonal channels of primary users present in the
corresponding macrocell. We consider the hybrid
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Csikor:2020:TSH,
author = "Levente Csikor and M{\'a}rk Szalay and G{\'a}bor
R{\'e}tv{\'a}ri and Gergely Pongr{\'a}cz and Dimitrios
P. Pezaros and L{\'a}szl{\'o} Toka",
title = "Transition to {SDN} is {HARMLESS}: Hybrid Architecture
for Migrating Legacy {Ethernet} Switches to {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "275--288",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2958762",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2958762",
abstract = "Software-Defined Networking (SDN) offers a new way to
operate, manage, and deploy communication networks and
to overcome many long-standing problems of legacy
networking. However, widespread SDN adoption has not
occurred yet due to the lack of a viable \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pasic:2020:MCS,
author = "Alija Pa{\v{s}}i{\'c} and P{\'e}ter Babarczi and
J{\'a}nos Tapolcai and Erika R. B{\'e}rczi-Kov{\'a}cs
and Zolt{\'a}n Kir{\'a}ly and Lajos R{\'o}nyai",
title = "Minimum Cost Survivable Routing Algorithms for
Generalized Diversity Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "289--300",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2963574",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2963574",
abstract = "Generalized diversity coding is a promising proactive
recovery scheme against single edge failures for
unicast connections in transport networks. At the
source node, the user data is split into two parts, and
their bitwise XOR is computed as a third \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2020:ZHC,
author = "Xiuzhen Guo and Yuan He and Xiaolong Zheng and
Liangcheng Yu and Omprakash Gnawali",
title = "{ZigFi}: Harnessing Channel State Information for
Cross-Technology Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "301--311",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2962707",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2962707",
abstract = "Cross-technology communication (CTC) is a technique
that enables direct communication among different
wireless technologies. Recent works in this area have
made substantial progress, but CTC from ZigBee to WiFi
remains an open problem. In this paper, we \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2020:SCS,
author = "Ze Yang and Kwan L. Yeung",
title = "{SDN} Candidate Selection in Hybrid {IP\slash SDN}
Networks for Single Link Failure Protection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "312--321",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2959588",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2959588",
abstract = "We focus on the problem of selecting a smallest subset
of IP routers for upgrading to SDN switches to protect
all single link failures in a given network, or the
{$<$ italic$>$SDN} candidate selection
{problem$<$}/{italic$>$}. In solving the problem, we
also aim at \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xue:2020:DDS,
author = "Jiachen Xue and Muhammad Usama Chaudhry and Balajee
Vamanan and T. N. Vijaykumar and Mithuna Thottethodi",
title = "{Dart}: Divide and Specialize for Fast Response to
Congestion in {RDMA}-Based Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "322--335",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2961671",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2961671",
abstract = "Though Remote Direct Memory Access (RDMA) promises to
reduce datacenter network latencies significantly
compared to TCP (e.g., $ 10 \times $), end-to-end
congestion control in the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tang:2020:CSS,
author = "Bin Tang and Xiaoliang Wang and Cam-Tu Nguyen and
Baoliu Ye and Sanglu Lu",
title = "Construction of Subexponential-Size Optical Priority
Queues With Switches and Fiber Delay Lines",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "336--346",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2960402",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2960402",
abstract = "All-optical switching has been considered as a natural
choice to keep pace with growing fiber link capacity.
One key research issue of all-optical switching is the
design of optical buffers for packet contention
resolution. One of the most general \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Albanna:2020:CML,
author = "Amr Albanna and Homayoun Yousefi'Zadeh",
title = "Congestion Minimization of {LTE} Networks: a Deep
Learning Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "347--359",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2960266",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2960266",
abstract = "Reducing the number of users serviced by congested
cellular towers given an offered load and a minimum
level of acceptable user quality is a major challenge
in the operation of LTE networks. In this paper, we
utilize a supervised Deep Learning (DL) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2020:ASN,
author = "Luoyi Fu and Jiapeng Zhang and Shuaiqi Wang and Xinyu
Wu and Xinbing Wang and Guihai Chen",
title = "De-Anonymizing Social Networks With Overlapping
Community Structure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "360--375",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2962731",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2962731",
abstract = "The advent of social networks poses severe threats on
user privacy as adversaries can de-anonymize users'
identities by mapping them to correlated cross-domain
networks. Without ground-truth mapping, prior
literature proposes various cost functions \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:TFC,
author = "Teng Liu and Alhussein A. Abouzeid and A. Agung
Julius",
title = "Traffic Flow Control in Vehicular Multi-Hop Networks
With Data Caching and Infrastructure Support",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "376--386",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2963930",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2963930",
abstract = "This work studies the user equilibrium (UE) state and
the system optimal (SO) state in vehicular
communication networks that support both V2V and V2I
communication. Each user in this network is assumed to
make route choice that optimizes a utility \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fukunaga:2020:AAF,
author = "Takuro Fukunaga",
title = "Adaptive Algorithm for Finding Connected Dominating
Sets in Uncertain Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "1",
pages = "387--398",
month = feb,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2963361",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:12 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2963361",
abstract = "The problem of finding a minimum-weight connected
dominating set (CDS) of a given undirected graph has
been studied actively, motivated by operations of
wireless ad hoc networks. In this paper, we formulate a
new stochastic variant of the problem. In this
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2020:ECA,
author = "Qingjun Xiao and Shigang Chen and You Zhou and Junzhou
Luo",
title = "Estimating Cardinality for Arbitrarily Large Data
Stream With Improved Memory Efficiency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "433--446",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2970860",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2970860",
abstract = "Cardinality estimation is the task of determining the
number of distinct elements (or the cardinality) in a
data stream, under a stringent constraint that the
input data stream can be scanned by just one single
pass. This is a fundamental problem with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dong:2020:UPT,
author = "Wei Dong and Yi Gao and Chenhong Cao and Xiaoyu Zhang
and Wenbin Wu",
title = "Universal Path Tracing for Large-Scale Sensor
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "447--460",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2965587",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2965587",
abstract = "Most sensor networks employ dynamic routing protocols
so that the routing topology can be dynamically
optimized with environmental changes. The routing
behaviors can be quite complex with increasing network
scale and environmental dynamics. Knowledge on
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Beysens:2020:CFN,
author = "Jona Beysens and Qing Wang and Ander Galisteo and
Domenico Giustiniano and Sofie Pollin",
title = "A Cell-Free Networking System With Visible Light",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "461--476",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2966322",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2966322",
abstract = "LED luminaries are now deployed densely in indoor
areas to provide uniform illumination. Visible Light
Communication (VLC) can also benefit from this dense
LED infrastructure. In this paper, we propose DenseVLC,
a cell-free massive MIMO networking system \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Anand:2020:JSU,
author = "Arjun Anand and Gustavo de Veciana and Sanjay
Shakkottai",
title = "Joint Scheduling of {URLLC} and {eMBB} Traffic in
{$5$G} Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "477--490",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2968373",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2968373",
abstract = "Emerging 5G systems will need to efficiently support
both enhanced mobile broadband traffic (eMBB) and
ultra-low-latency communications (URLLC) traffic. In
these systems, time is divided into slots which are
further sub-divided into minislots. From a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cohen:2020:EDC,
author = "Alejandro Cohen and Asaf Cohen and Omer Gurewitz",
title = "Efficient Data Collection Over Multiple Access
Wireless Sensors Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "491--504",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2964764",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2964764",
abstract = "Data collection in Wireless Sensor Networks (WSN)
draws significant attention, due to emerging interest
in technologies ranging from Internet of Things (IoT)
networks to simple &\#x201C;Presence&\#x201D;
applications, which identify the status of the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:FFE,
author = "Tingwei Liu and John C. S. Lui",
title = "{FAVE}: a Fast and Efficient Network Flow
{AVailability} Estimation Method With Bounded Relative
Error",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "505--518",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2965161",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2965161",
abstract = "Capacity planning and sales projection are essential
tasks for network operators. This work aims to help
network providers to carry out network capacity
planning and sales projection by answering: Given
topology and capacity, whether the network can serve
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2020:PPU,
author = "Mingjun Xiao and Guoju Gao and Jie Wu and Sheng Zhang
and Liusheng Huang",
title = "Privacy-Preserving User Recruitment Protocol for
Mobile Crowdsensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "519--532",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2962362",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2962362",
abstract = "Mobile crowdsensing is a new paradigm in which a
requester can recruit a group of mobile users via a
platform and coordinate them to perform some sensing
tasks by using their smartphones. In mobile
crowdsensing, each user might perform multiple tasks
with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Clark:2020:OPU,
author = "Matthew Clark and Konstantinos Psounis",
title = "Optimizing Primary User Privacy in Spectrum Sharing
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "533--546",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2967776",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2967776",
abstract = "Spectrum regulators are pursuing centralized, dynamic
sharing systems that will enable spectrum access for
new wireless technologies. These sharing systems will
leverage cognitive radio concepts to automatically
identify suitable spectrum for users. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:HFR,
author = "Ge Wang and Haofan Cai and Chen Qian and Jinsong Han
and Shouqian Shi and Xin Li and Han Ding and Wei Xi and
Jizhong Zhao",
title = "{Hu-Fu}: Replay-Resilient {RFID} Authentication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "547--560",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2964290",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2964290",
abstract = "We provide the first solution to an important
question, &\#x201C;how a physical-layer authentication
method can defend against signal replay
attacks&\#x201D;. It was believed that if an attacker
can replay the exact same reply signal of a legitimate
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Trevisan:2020:FYE,
author = "Martino Trevisan and Danilo Giordano and Idilio Drago
and Maurizio Matteo Munaf{\`o} and Marco Mellia",
title = "Five Years at the Edge: Watching {Internet} From the
{ISP} Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "561--574",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2967588",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2967588",
abstract = "The Internet and the way people use it are constantly
changing. Knowing traffic is crucial for operating the
network, understanding users' needs, and ultimately
improving applications. Here, we provide an in-depth
longitudinal view of Internet \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hui:2020:CCD,
author = "Yilong Hui and Zhou Su and Tom H. Luan",
title = "Collaborative Content Delivery in Software-Defined
Heterogeneous Vehicular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "575--587",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2968746",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2968746",
abstract = "The software defined heterogeneous vehicular networks
(SD-HetVNETs), which consist of cellular base stations
(CBSs) and roadside units (RSUs), have emerged as a
promising solution to address the fundamental problems
imposed by the surge increase of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bartolini:2020:FBF,
author = "Novella Bartolini and Ting He and Viviana Arrigoni and
Annalisa Massini and Federico Trombetti and Hana
Khamfroush",
title = "On Fundamental Bounds on Failure Identifiability by
{Boolean} Network Tomography",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "588--601",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2969523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2969523",
abstract = "Boolean network tomography is a powerful tool to infer
the state (working/failed) of individual nodes from
path-level measurements obtained by edge-nodes. We
consider the problem of optimizing the capability of
identifying network failures through the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:ELP,
author = "Wei Wang and Shiyue He and Qian Zhang and Tao Jiang",
title = "Enabling Low-Power {OFDM} for {IoT} by Exploiting
Asymmetric Clock Rates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "602--611",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2966112",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2966112",
abstract = "The conventional high-speed Wi-Fi has recently become
a contender for low-power Internet-of-Things (IoT)
communications. OFDM continues its adoption in the new
IoT Wi-Fi standard due to its spectrum efficiency that
can support the demand of massive IoT \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:RPL,
author = "Yongrui Chen and Shuai Wang and Zhijun Li and Tian
He",
title = "Reliable Physical-Layer Cross-Technology Communication
With Emulation Error Correction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "612--624",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2963985",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2963985",
abstract = "Physical-Layer Cross-Technology Communication
(PHY-CTC), which achieves direct communication among
heterogeneous technologies, brings great opportunities
to help diverse IoT devices achieve harmonious
coexistence through explicit coordination. The core
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Paschos:2020:OCO,
author = "Georgios S. Paschos and Apostolos Destounis and George
Iosifidis",
title = "Online Convex Optimization for Caching Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "625--638",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2968424",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2968424",
abstract = "We study the problem of wireless edge caching when
file popularity is unknown and possibly non-stationary.
A bank of $j$ caches receives file requests and a
utility is accrued for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kulkarni:2020:NDB,
author = "Sameer G. Kulkarni and Wei Zhang and Jinho Hwang and
Shriram Rajagopalan and K. K. Ramakrishnan and Timothy
Wood and Mayutan Arumaithurai and Xiaoming Fu",
title = "{NFVnice}: Dynamic Backpressure and Scheduling for
{NFV} Service Chains",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "639--652",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2969971",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2969971",
abstract = "Managing Network Function (NF) service chains requires
careful system resource management. We propose {$<$
italic$>$NFVnice$<$}/{italic$>$}, a user space NF
scheduling and service chain management framework to
provide fair, efficient and dynamic resource scheduling
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wei:2020:SBB,
author = "Wenjia Wei and Kaiping Xue and Jiangping Han and David
S. L. Wei and Peilin Hong",
title = "Shared Bottleneck-Based Congestion Control and Packet
Scheduling for Multipath {TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "653--666",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2970032",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2970032",
abstract = "In order to be TCP-friendly, the original Multipath
TCP (MPTCP) congestion control algorithm is always
restricted to gain no better throughput than a
traditional single-path TCP on the best path. However,
it is unable to maximize the throughput over all
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Josilo:2020:COS,
author = "Sla{\dbar}ana Jo{\v{s}}ilo and Gy{\"o}rgy D{\'a}n",
title = "Computation Offloading Scheduling for Periodic Tasks
in Mobile Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "667--680",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2968209",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2968209",
abstract = "Motivated by various delay sensitive applications, we
address the problem of coordinating the offloading
decisions of wireless devices that periodically
generate computationally intensive tasks. We consider
autonomous devices that aim at minimizing their
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2020:PIA,
author = "Yahui Sun and Daniel Rehfeldt and Marcus Brazil and
Doreen Thomas and Saman Halgamuge",
title = "A Physarum-Inspired Algorithm for Minimum-Cost Relay
Node Placement in Wireless Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "681--694",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2971770",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2971770",
abstract = "Relay node placement, which aims to connect
pre-deployed sensor nodes to base stations, is
essential in minimizing the costs of wireless sensor
networks. In this paper, we formulate the new
Node-Weighted Partial Terminal Steiner Tree Problem
(NWPTSTP) for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kulkarni:2020:RAE,
author = "Sameer G. Kulkarni and Guyue Liu and K. K.
Ramakrishnan and Mayutan Arumaithurai and Timothy Wood
and Xiaoming Fu",
title = "{REINFORCE}: Achieving Efficient Failure Resiliency
for Network Function Virtualization-Based Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "695--708",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2969961",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2969961",
abstract = "Ensuring high availability (HA) for software-based
networks is a critical design feature that will help
the adoption of software-based network functions (NFs)
in production networks. It is important for NFs to
avoid outages and maintain mission-critical \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Badita:2020:OSS,
author = "Ajay Badita and Parimal Parag and Vaneet Aggarwal",
title = "Optimal Server Selection for Straggler Mitigation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "709--721",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2973224",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2973224",
abstract = "The performance of large-scale distributed compute
systems is adversely impacted by stragglers when the
execution time of a job is uncertain. To manage
stragglers, we consider a multi-fork approach for job
scheduling, where additional parallel servers are
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Champati:2020:TAM,
author = "Jaya Prakash Champati and Hussein Al-Zubaidy and James
Gross",
title = "Transient Analysis for Multihop Wireless Networks
Under Static Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "722--735",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2975616",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2975616",
abstract = "In this article, we investigate the transient behavior
of a sequence of packets/bits traversing a multi-hop
wireless network under static routing. Our work is
motivated by novel applications from the domain of
process automation, Machine-Type \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2020:IAP,
author = "Michael Lin and Novella Bartolini and Michael
Giallorenzo and Thomas F. {La Porta}",
title = "On Interference Aware Power Adjustment and Scheduling
in Femtocell Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "736--749",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2973833",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2973833",
abstract = "Densely-deployed femtocell networks are used to
enhance wireless coverage in public spaces such as
office buildings, subways, and academic buildings.
These networks can increase user throughput, but edge
users can suffer from co-channel interference and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2020:CSD,
author = "Sen Lin and Junshan Zhang and Lei Ying",
title = "Crowdsensing for Spectrum Discovery: a Waze-Inspired
Design via Smartphone Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "750--763",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2976927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2976927",
abstract = "We study Waze-inspired spectrum discovery, where the
cloud collects the spectrum sensing results from many
smartphones and predicts location-specific spectrum
availability based on information fusion. Observe that
with limited sensing capability, each \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:HSH,
author = "Tingjun Chen and Jelena Diakonikolas and Javad Ghaderi
and Gil Zussman",
title = "Hybrid Scheduling in Heterogeneous Half- and
Full-Duplex Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "764--777",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2973371",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2973371",
abstract = "Full-duplex (FD) wireless is an attractive
communication paradigm with high potential for
improving network capacity and reducing delay in
wireless networks. Despite significant progress on the
physical layer development, the challenges associated
with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sami:2020:VOD,
author = "Hani Sami and Azzam Mourad and Wassim El-Hajj",
title = "{Vehicular-OBUs-As-On-Demand-Fogs}: Resource and
Context Aware Deployment of Containerized
Micro-Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "778--790",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2973800",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2973800",
abstract = "Observing the headway in vehicular industry, new
applications are developed demanding more resources.
For instance, real-time vehicular applications require
fast processing of the vast amount of generated data by
vehicles in order to maintain service \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rost:2020:HIV,
author = "Matthias Rost and Stefan Schmid",
title = "On the Hardness and Inapproximability of Virtual
Network Embeddings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "791--803",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2975646",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2975646",
abstract = "Many resource allocation problems in the cloud can be
described as a basic Virtual Network Embedding Problem
(VNEP): the problem of finding a mapping of a {\em
request graph\/} (describing a workload) onto a {\em
substrate graph\/} \ldots{}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhong:2020:JOR,
author = "Xijian Zhong and Yan Guo and Ning Li and Yancheng
Chen",
title = "Joint Optimization of Relay Deployment, Channel
Allocation, and Relay Assignment for {UAVs}-Aided
{D$2$D} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "804--817",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2970744",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2970744",
abstract = "Unmanned aerial vehicles (UAVs) can be deployed in the
air to provide high probabilities of line of sight
(LoS) transmission, thus UAVs bring much gain for
wireless communication systems. In this paper, we study
a UAVs-aided self-organized device-to-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Maatouk:2020:AIC,
author = "Ali Maatouk and Mohamad Assaad and Anthony
Ephremides",
title = "On the Age of Information in a {CSMA} Environment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "818--831",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2971350",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2971350",
abstract = "In this paper, we investigate a network where $N$
links contend for the channel using the well-known
carrier sense multiple access scheme. By leveraging the
notion of stochastic \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:SGE,
author = "Haibo Wang and Jessie Hui Wang and Jilong Wang and
Weizhen Dang and Jing'an Xue and Fenghua Li and Jinzhe
Shan",
title = "Squeezing the Gap: an Empirical Study on {DHCP}
Performance in a Large-Scale Wireless Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "2",
pages = "832--845",
month = apr,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2971551",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Aug 15 14:18:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2971551",
abstract = "Dynamic Host Configuration Protocol (DHCP) is widely
used to dynamically assign IP addresses to users.
However, due to little knowledge on the behavior and
performance of DHCP, it is challenging to configure
lease time and divide IP addresses for address
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2020:AFRa,
author = "Kun Xie and Yuxiang Chen and Xin Wang and Gaogang Xie
and Jiannong Cao and Jigang Wen",
title = "Accurate and Fast Recovery of Network Monitoring Data:
a {GPU} Accelerated Matrix Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "958--971",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2976129",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2976129",
abstract = "Gaining a full knowledge of end-to-end network
performance is important for some advanced network
management and services. Although it becomes
increasingly critical, end-to-end network monitoring
usually needs active probing of the path and the
overhead \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:MAC,
author = "Jie Wang and Wenye Wang and Cliff Wang",
title = "Modeling and Analysis of Conflicting Information
Propagation in a Finite Time Horizon",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "972--985",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2976972",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2976972",
abstract = "Emerging mobile applications enable people to connect
with one another more easily than ever, which causes
networked systems, e.g., online social networks (OSN)
and Internet-of-Things (IoT), to grow rapidly in size,
and become more complex in structure. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tangari:2020:AAA,
author = "Gioacchino Tangari and Marinos Charalambides and
Daphne Tuncer and George Pavlou",
title = "Accuracy-Aware Adaptive Traffic Monitoring for
Software Dataplanes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "986--1001",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2976952",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2976952",
abstract = "Network operators have recently been developing
multi-Gbps traffic monitoring tools on commodity
hardware, as part of the packet-processing pipelines
realizing software dataplanes. These solutions allow
the execution of sophisticated per-packet monitoring
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:DBI,
author = "Yongce Chen and Yan Huang and Yi Shi and Y. Thomas Hou
and Wenjing Lou and Sastry Kompella",
title = "On {DoF}-Based Interference Cancellation Under General
Channel Rank Conditions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1002--1016",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2974989",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2974989",
abstract = "Degree-of-freedom (DoF) based models have become
prevalent in studying MIMO-based wireless networks.
However, most existing DoF-based models assume the
channel matrix is of full-rank. Such a simplifying
assumption has gradually become problematic, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mohan:2020:RSO,
author = "Avinash Mohan and Aditya Gopalan and Anurag Kumar",
title = "Reduced-State, Optimal Scheduling for Decentralized
Medium Access Control of a Class of Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1017--1032",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2976923",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2976923",
abstract = "Motivated by medium access control for
resource-challenged wireless Internet of Things (IoT)
networks, we consider the problem of queue scheduling
with reduced queue state information. In particular, we
consider a time-slotted scheduling model with N
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:TMD,
author = "Meng Li and Haipeng Dai and Xiaoyu Wang and Rui Xia
and Alex X. Liu and Guihai Chen",
title = "Thresholded Monitoring in Distributed Data Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1033--1046",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979654",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979654",
abstract = "In this paper, we consider the problem of thresholded
monitoring in distributed data streams, that is, given
multiple distributed data streams observed by multiple
monitors during a certain period, finding the items
whose global frequencies over all data \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Poularakis:2020:SPR,
author = "Konstantinos Poularakis and Jaime Llorca and Antonia
M. Tulino and Ian Taylor and Leandros Tassiulas",
title = "Service Placement and Request Routing in {MEC}
Networks With Storage, Computation, and Communication
Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1047--1060",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2980175",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2980175",
abstract = "The proliferation of innovative mobile services such
as augmented reality, networked gaming, and autonomous
driving has spurred a growing need for low-latency
access to computing resources that cannot be met solely
by existing centralized cloud systems. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2020:OAV,
author = "Ziyue Luo and Chuan Wu",
title = "An Online Algorithm for {VNF} Service Chain Scaling in
Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1061--1073",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979263",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979263",
abstract = "Built on top of virtualization technologies, network
function virtualization (NFV) provides flexible and
scalable software implementation of various network
functions. Virtual network functions (VNFs), which are
network functions implemented as virtual \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Brenes:2020:PPP,
author = "Juan Brenes and Alberto Garc{\'\i}a-Mart{\'\i}nez and
Marcelo Bagnulo and Andra Lutu and Cristel Pelsser",
title = "Power Prefixes Prioritization for Smarter {BGP}
Reconvergence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1074--1087",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979665",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979665",
abstract = "BGP reconvergence events involving a large number of
prefixes may result in the loss of large amounts of
traffic. Based on the observation that a very small
number of prefixes carries the vast majority of
traffic, we propose Power Prefixes Prioritization
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Demianiuk:2020:NAO,
author = "Vitalii Demianiuk and Sergey Nikolenko and Pavel
Chuprikov and Kirill Kogan",
title = "New Alternatives to Optimize Policy Classifiers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1088--1101",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979400",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979400",
abstract = "Growing expressiveness of services increases the size
of a manageable state at the network data plane. A
service policy is an ordered set of classification
patterns (classes) with actions; the same class can
appear in multiple policies. Previous studies
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cheng:2020:HHS,
author = "Bo Cheng and Shoulu Hou and Ming Wang and Shuai Zhao
and Junliang Chen",
title = "{HSOP}: a Hybrid Service Orchestration Platform for
{Internet}-Telephony Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1102--1115",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2981477",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2981477",
abstract = "Nowadays Telecom service providers are seeking new
paradigms of service creation and execution platform to
reduce new services' time to market and increase
profitability. However, the existing static services
orchestration approaches cannot meet the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cao:2020:EFT,
author = "Xiaofeng Cao and Guoming Tang and Deke Guo and Yan Li
and Weiming Zhang",
title = "Edge Federation: Towards an Integrated Service
Provisioning Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1116--1129",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979361",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979361",
abstract = "Edge computing is a promising computing paradigm by
pushing the cloud service to the network edge. To this
end, edge infrastructure providers (EIPs) need to bring
computation and storage resources to the network edge
and allow edge service providers (ESPs). \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mahdian:2020:KCN,
author = "Milad Mahdian and Armin Moharrer and Stratis Ioannidis
and Edmund Yeh",
title = "{Kelly} Cache Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1130--1143",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2982863",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2982863",
abstract = "We study networks of M/M/1 queues in which nodes act
as caches that store objects. Exogenous requests for
objects are routed towards nodes that store them; as a
result, object traffic in the network is determined not
only by demand but, crucially, by \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2020:PLA,
author = "Ning Xie and Shengli Zhang and Alex X. Liu",
title = "Physical-Layer Authentication in Non-Orthogonal
Multiple Access Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1144--1157",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979058",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979058",
abstract = "This paper concerns the problem of authenticating the
transmitter device in non-orthogonal multiple access
(NOMA) systems. This problem is important because of
high vulnerabilities in wireless communications and an
additional security vulnerability when \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fernandes:2020:USR,
author = "Ramon Fernandes and C{\'e}sar Marcon and Rodrigo
Cataldo and Johanna Sep{\'u}lveda",
title = "Using Smart Routing for Secure and Dependable
{NoC}-Based {MPSoCs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1158--1171",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979372",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979372",
abstract = "The Internet-of-Things (IoT) boosted the building of
computational systems that share computation,
communication and storage resources for uncountable
types of applications. MultiProcessor System-on-Chip
(MPSoC) is a fundamental component of such systems
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Basat:2020:DHH,
author = "Ran Ben Basat and Xiaoqi Chen and Gil Einziger and Ori
Rottenstreich",
title = "Designing Heavy-Hitter Detection Algorithms for
Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1172--1185",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2982739",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2982739",
abstract = "Programmable network switches promise flexibility and
high throughput, enabling applications such as load
balancing and traffic engineering. Network measurement
is a fundamental building block for such applications,
including tasks such as the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vargaftik:2020:LLB,
author = "Shay Vargaftik and Isaac Keslassy and Ariel Orda",
title = "{LSQ}: Load Balancing in Large-Scale Heterogeneous
Systems With Multiple Dispatchers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1186--1198",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2980061",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2980061",
abstract = "Nowadays, the efficiency and even the feasibility of
traditional load-balancing policies are challenged by
the rapid growth of cloud infrastructure and the
increasing levels of server heterogeneity. In such
heterogeneous systems with many loadbalancers,
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yekkehkhany:2020:BGP,
author = "Ali Yekkehkhany and Rakesh Nagi",
title = "Blind {GB-PANDAS}: a Blind Throughput-Optimal Load
Balancing Algorithm for Affinity Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1199--1212",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2978195",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2978195",
abstract = "Dynamic affinity load balancing of multi-type tasks on
multi-skilled servers, when the service rate of each
task type on each of the servers is known and can
possibly be different from each other, is an open
problem for over three decades. The goal is to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Asheralieva:2020:CCT,
author = "Alia Asheralieva and Dusit Niyato",
title = "Combining Contract Theory and {Lyapunov} Optimization
for Content Sharing With Edge Caching and
Device-to-Device Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1213--1226",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2978117",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2978117",
abstract = "The paper proposes a novel framework based on the
contract theory and Lyapunov optimization for content
sharing in a wireless content delivery network (CDN)
with edge caching and device-to-device (D2D)
communications. The network is partitioned into a set
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:ECR,
author = "Yongmin Zhang and Xiaolong Lan and Ju Ren and Lin
Cai",
title = "Efficient Computing Resource Sharing for Mobile
Edge-Cloud Computing Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1227--1240",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979807",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/super.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979807",
abstract = "Both the edge and the cloud can provide computing
services for mobile devices to enhance their
performance. The edge can reduce the conveying delay by
providing local computing services while the cloud can
support enormous computing requirements. Their
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:TTM,
author = "Qingyu Liu and Lei Deng and Haibo Zeng and Minghua
Chen",
title = "A Tale of Two Metrics in Network Delay Optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1241--1254",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2983867",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2983867",
abstract = "We consider a single-unicast networking scenario where
a sender streams a flow at a fixed rate to a receiver
across a multi-hop network, possibly using multiple
paths. Transmission over a link incurs a
traffic-dependent link delay. We optimize network
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:DTP,
author = "Fangxin Wang and Cong Zhang and Feng Wang and
Jiangchuan Liu and Yifei Zhu and Haitian Pang and
Lifeng Sun",
title = "{DeepCast}: Towards Personalized {QoE} for
Edge-Assisted Crowdcast With Deep Reinforcement
Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1255--1268",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979966",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979966",
abstract = "Today's anywhere and anytime broadband connection and
audio/video capture have boosted the deployment of
crowdsourced livecast services (or crowdcast). Bridging
a massive amount of geo-distributed broadcasters and
their fellow viewers, such \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ding:2020:CMM,
author = "Kai Ding and Homayoun Yousefi'zadeh and Faryar
Jabbari",
title = "Connectivity Maintenance in Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1269--1282",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979522",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979522",
abstract = "This work studies connectivity maintenance of mobile
networks. A mobile network of interest consists of two
types of nodes, pre-deployed (client) and intermediate
nodes. Upon initial deployment of client nodes in a
field, multiple stationary intermediate \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Carra:2020:EPC,
author = "Damiano Carra and Giovanni Neglia and Pietro
Michiardi",
title = "Elastic Provisioning of Cloud Caches: a Cost-Aware
{TTL} Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1283--1296",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2980105",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2980105",
abstract = "We consider elastic resource provisioning in the
cloud, focusing on in-memory key-value stores used as
caches. Our goal is to dynamically scale resources to
the traffic pattern minimizing the overall cost, which
includes not only the storage cost, but \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:MTD,
author = "Youlin Zhang and Shigang Chen and You Zhou and Yuguang
Fang",
title = "Missing-Tag Detection With Unknown Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1297--1310",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2984706",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2984706",
abstract = "Radio Frequency Identification (RFID) technology has
been proliferating in recent years, especially with its
wide usage in retail, warehouse and supply chain
management. One of its most popular applications is to
automatically detect missing products \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fossati:2020:MRA,
author = "Francesca Fossati and Stefano Moretti and Patrice
Perny and Stefano Secci",
title = "Multi-Resource Allocation for Network Slicing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1311--1324",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2979667",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979667",
abstract = "Among the novelties introduced by 5G networks, the
formalization of the `network slice' as a resource
allocation unit is an important one. In legacy
networks, resources such as link bandwidth, spectrum,
computing capacity are allocated independently of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2020:EEJ,
author = "Jing Fu and Bill Moran",
title = "Energy-Efficient Job-Assignment Policy With
Asymptotically Guaranteed Performance Deviation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1325--1338",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2983460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2983460",
abstract = "We study a job-assignment problem in a large-scale
server farm system with geographically deployed servers
as abstracted computer components (e.g., storage,
network links, and processors) that are potentially
diverse. We aim to maximize the energy \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:QAF,
author = "Xiaocan Li and Kun Xie and Xin Wang and Gaogang Xie
and Dongliang Xie and Zhenyu Li and Jigang Wen and
Zulong Diao and Tian Wang",
title = "Quick and Accurate False Data Detection in Mobile
Crowd Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1339--1352",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2982685",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2982685",
abstract = "The attacks, faults, and severe communication/system
conditions in Mobile Crowd Sensing (MCS) make false
data detection a critical problem. Observing the
intrinsic low dimensionality of general monitoring data
and the sparsity of false data, false data \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Korosi:2020:MRH,
author = "Attila K{\H{o}}r{\"o}si and Andr{\'a}s Guly{\'a}s and
Zalan Heszberger and J{\'o}zsef B{\'\i}r{\'o} and
G{\'a}bor R{\'e}tv{\'a}ri",
title = "On the Memory Requirement of Hop-by-Hop Routing: Tight
Bounds and Optimal Address Spaces",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1353--1363",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2984761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2984761",
abstract = "Routing in large-scale computer networks today is
built on hop-by-hop routing: packet headers specify the
destination address and routers use internal forwarding
tables to map addresses to next-hop ports. In this
paper we take a new look at the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:UEA,
author = "Yang Li and Jianwei Zheng and Zhenhua Li and Yunhao
Liu and Feng Qian and Sen Bai and Yao Liu and Xianlong
Xin",
title = "Understanding the Ecosystem and Addressing the
Fundamental Concerns of Commercial {MVNO}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "3",
pages = "1364--1377",
month = jun,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2981514",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:26 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2981514",
abstract = "Recent years have witnessed the rapid growth of mobile
virtual network operators (MVNOs), which operate on top
of existing cellular infrastructures of base carriers,
while offering cheaper or more flexible data plans
compared to those of the base \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lotfi:2020:NNP,
author = "Mohammad Hassan Lotfi and Saswati Sarkar and George
Kesidis",
title = "Is Non-Neutrality Profitable for the Stakeholders of
the {Internet} Market?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1435--1448",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2981259",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2981259",
abstract = "We consider a system in which there exists two ISPs,
one &\#x201C;big&\#x201D; Content Provider (CP), and a
continuum of End-Users (EUs). One of the ISPs is
neutral and the other is non-neutral. We consider that
the CP can differentiate between ISPs by \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sarker:2020:CMN,
author = "Ankur Sarker and Chenxi Qiu and Haiying Shen",
title = "Connectivity Maintenance for Next-Generation
Decentralized Vehicle Platoon Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1449--1462",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2986252",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2986252",
abstract = "Always keeping a certain distance between vehicles in
a platoon system is important for collision avoidance.
Centralized platoon systems let the leader vehicle
determine and notify the velocities of all the vehicles
in the platoon. Unfortunately, such a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2020:EPS,
author = "He Huang and Yu-E Sun and Chaoyi Ma and Shigang Chen
and You Zhou and Wenjian Yang and Shaojie Tang and
Hongli Xu and Yan Qiao",
title = "An Efficient {$K$}-Persistent Spread Estimator for
Traffic Measurement in High-Speed Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1463--1476",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2982003",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2982003",
abstract = "Traffic measurement in high-speed networks has many
important functions in improving network performance,
assisting resource allocation, and detecting anomalies.
In this paper, we study a generalized problem called
k-persistent spread estimation, which \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2020:LGN,
author = "Yilei Lin and Ting He and Shiqiang Wang and Kevin Chan
and Stephen Pasteris",
title = "Looking Glass of {NFV}: Inferring the Structure and
State of {NFV} Network From External Observations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1477--1490",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2985908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2985908",
abstract = "The rapid development of network function
virtualization (NFV) enables a communication network to
provide in-network services using virtual network
functions (VNFs) deployed on general IT hardware. While
existing studies on NFV focused on how to provision
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guan:2020:DJP,
author = "Zhangyu Guan and Nan Cen and Tommaso Melodia and Scott
M. Pudlewski",
title = "Distributed Joint Power, Association and Flight
Control for Massive-{MIMO} Self-Organizing Flying
Drones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1491--1505",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2985972",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2985972",
abstract = "This article studies distributed algorithms to control
self-organizing flying drones with massive MIMO
networking capabilities --- a network scenario referred
to as mDroneNet. We attempt to answer the following
fundamental question: what is the optimal way
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bhattarai:2020:DEZ,
author = "Sudeep Bhattarai and Jung-Min Park and William Lehr",
title = "Dynamic Exclusion Zones for Protecting Primary Users
in Database-Driven Spectrum Sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1506--1519",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2986410",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2986410",
abstract = "In spectrum sharing, a spatial separation region is
defined around a primary user (PU) where co-channel
and/or adjacent channel secondary users (SUs) are not
allowed to operate. This region is often called an
Exclusion Zone (EZ), and it protects the PU \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Banirazi:2020:HDP,
author = "Reza Banirazi and Edmond Jonckheere and Bhaskar
Krishnamachari",
title = "Heat-Diffusion: {Pareto} Optimal Dynamic Routing for
Time-Varying Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1520--1533",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2991745",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2991745",
abstract = "A dynamic routing policy, referred to as
Heat-Diffusion (HD), is developed for multihop uniclass
wireless networks subject to random traffic,
time-varying topology and inter-channel interference.
The policy uses only current condition of queue
occupancies \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2020:RMW,
author = "Anfu Zhou and Shaoqing Xu and Song Wang and Jingqi
Huang and Shaoyuan Yang and Teng Wei and Xinyu Zhang
and Huadong Ma",
title = "Robotic Millimeter-Wave Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1534--1549",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2990498",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2990498",
abstract = "The emerging millimeter-wave (mmWave) networking
technology promises to unleash a new wave of multi-Gbps
wireless applications. However, due to high
directionality of the mmWave radios, maintaining stable
link connection remains an open problem. Users'
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kabacinski:2020:WSN,
author = "Wojciech Kabaci{\'n}ski and Mustafa Abdulsahib",
title = "Wide-Sense Nonblocking Converting-Space-Converting
Switching Node Architecture Under {XsVarSWITCH} Control
Algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1550--1561",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2989639",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2989639",
abstract = "In this study, we consider wide-sense nonblocking
operation of a converting-space-converting switching
fabric. We propose a routing strategy based on the
functional decomposition of second-stage switches,
called the XsVarSWITCH routing strategy. This
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:OSC,
author = "Zengfu Wang and Qing Wang and Bill Moran and Moshe
Zukerman",
title = "Optimal Submarine Cable Path Planning and
Trunk-and-Branch Tree Network Topology Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1562--1572",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2988047",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2988047",
abstract = "We study the path planning of submarine cable systems
with trunk-and-branch tree topology on the surface of
the earth. Existing work on path planning represents
the earth's surface by triangulated manifolds and takes
account of laying cost of the cable \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tian:2020:TEP,
author = "Ying Tian and Zhiliang Wang and Xia Yin and Xingang
Shi and Yingya Guo and Haijun Geng and Jiahai Yang",
title = "Traffic Engineering in Partially Deployed Segment
Routing Over {IPv6} Network With Deep Reinforcement
Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1573--1586",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2987866",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2987866",
abstract = "Segment Routing (SR) is a source routing paradigm
which is widely used in Traffic Engineering (TE). By
using SR, a node steers a packet through an ordered
list of instructions called segments. By some
extensions of interior gateway protocol, SR can be
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shao:2020:PWF,
author = "Chenglong Shao and Hoorin Park and Heejun Roh and
Wonjun Lee and Hyoil Kim",
title = "{PolarScout}: {Wi-Fi} Interference-Resilient {ZigBee}
Communication via {Shell}-Shaping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1587--1600",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2989387",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2989387",
abstract = "The prosperity of IEEE 802.11-based Wi-Fi networks
aggravates cross-technology interference to IEEE
802.15.4-enabled ZigBee networks widely deployed to
enable various Internet-of-Things applications. To make
ZigBee communication reliable and robust even
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2020:AFRb,
author = "Kun Xie and Yuxiang Chen and Xin Wang and Gaogang Xie
and Jiannong Cao and Jigang Wen and Guangming Yang and
Jiaqi Sun",
title = "Accurate and Fast Recovery of Network Monitoring Data
With {GPU}-Accelerated Tensor Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1601--1614",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2987845",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2987845",
abstract = "Monitoring the performance of a large network would
involve a high measurement cost. To reduce the
overhead, sparse network monitoring techniques may be
applied to select paths or time intervals to take the
measurements, while the remaining monitoring \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sivaraman:2020:OPI,
author = "Vignesh Sivaraman and Dibyajyoti Guha and Biplab
Sikdar",
title = "Optimal Pending Interest Table Size for {ICN} With
Mobile Producers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1615--1628",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2988713",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2988713",
abstract = "Many next generation Internet architectures exist in
the literature for addressing various issues like
increasing traffic, mobility and efficient content
dissemination. One such emerging fundamental design is
Information Centric Networking (ICN). The \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:RWF,
author = "Zhe Wang and Yifeng Cao and Linghe Kong and Guihai
Chen and Jiadi Yu and Shaojie Tang and Yingying Chen",
title = "Reference Waveforms Forward Concurrent Transmissions
in {ZigBee} Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1629--1642",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2992271",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2992271",
abstract = "The number of Internet of Things is growing
exponentially, among which the ZigBee devices are being
widely deployed, incurring severe collision problem in
ZigBee networks. Instead of collision avoidance or
packet retransmissions which introduce extra time/.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:DAG,
author = "Yixin Li and Bin Cao and Mugen Peng and Long Zhang and
Lei Zhang and Daquan Feng and Jihong Yu",
title = "Direct Acyclic Graph-Based Ledger for {Internet} of
Things: Performance and Security Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1643--1656",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2991994",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2991994",
abstract = "Direct Acyclic Graph (DAG)-based ledger and the
corresponding consensus algorithm has been identified
as a promising technology for Internet of Things (IoT).
Compared with Proof-of-Work (PoW) and Proof-of-Stake
(PoS) that have been widely used in \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Konstantinidis:2020:RDS,
author = "Konstantinos Konstantinidis and Aditya Ramamoorthy",
title = "Resolvable Designs for Speeding Up Distributed
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1657--1670",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2992989",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2992989",
abstract = "Distributed computing frameworks such as MapReduce are
often used to process large computational jobs. They
operate by partitioning each job into smaller tasks
executed on different servers. The servers also need to
exchange intermediate values to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2020:SAP,
author = "Guocheng Liao and Xu Chen and Jianwei Huang",
title = "Social-Aware Privacy-Preserving Mechanism for
Correlated Data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1671--1683",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2994213",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2994213",
abstract = "We study a privacy-preserving data collection problem
by considering individuals' data correlation and social
relationship. A data collector gathers data from some
data reporters to perform certain analysis with a
privacy-preserving mechanism. Due to the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:PER,
author = "Sheng Zhang and Yu Liang and Jidong Ge and Mingjun
Xiao and Jie Wu",
title = "Provably Efficient Resource Allocation for Edge
Service Entities Using {Hermes}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1684--1697",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2989307",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2989307",
abstract = "Virtualization techniques help edge environments
separate the role of the traditional edge providers
into two: edge infrastructure providers (EIPs), who
manage the physical edge infrastructure, and edge
service providers (ESPs), who aggregate resources
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Spiteri:2020:BNO,
author = "Kevin Spiteri and Rahul Urgaonkar and Ramesh K.
Sitaraman",
title = "{BOLA}: Near-Optimal Bitrate Adaptation for Online
Videos",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1698--1711",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2996964",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2996964",
abstract = "Modern video players employ complex algorithms to
adapt the bitrate of the video that is shown to the
user. Bitrate adaptation requires a tradeoff between
reducing the probability that the video freezes
(rebuffers) and enhancing the quality of the video.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cao:2020:PHO,
author = "Yue Cao and Ahmed Osama Fathy Atya and Shailendra
Singh and Zhiyun Qian and Srikanth V. Krishnamurthy and
Thomas F. {La Porta} and Prashant Krishnamurthy and
Lisa Marvel",
title = "Packet Header Obfuscation Using {MIMO}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1712--1725",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2998398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2998398",
abstract = "Eavesdroppers can exploit exposed packet headers
towards attacks that profile clients and their data
flows. In this paper, we propose FOG, a framework for
effective full and partial header blinding using MIMO,
to thwart eavesdroppers. FOG effectively \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dang:2020:PCN,
author = "Huynh Tu Dang and Pietro Bressana and Han Wang and Ki
Suh Lee and Noa Zilberman and Hakim Weatherspoon and
Marco Canini and Fernando Pedone and Robert Soul{\'e}",
title = "{P4xos}: Consensus as a Network Service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1726--1738",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2992106",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2992106",
abstract = "In this paper, we explore how a programmable
forwarding plane offered by a new breed of network
switches might naturally accelerate consensus
protocols, specifically focusing on Paxos. The
performance of consensus protocols has long been a
concern. By \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vaze:2020:MSS,
author = "Rahul Vaze and Jayakrishnan Nair",
title = "Multiple Server {SRPT} With Speed Scaling Is
Competitive",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1739--1751",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2993142",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2993142",
abstract = "Can the popular shortest remaining processing time
(SRPT) algorithm achieve a constant competitive ratio
on multiple servers when server speeds are adjustable
(speed scaling) with respect to the flow time plus
energy consumption metric? This question has \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:SHP,
author = "Songtao Wang and Dan Li and Yang Cheng and Jinkun Geng
and Yanshu Wang and Shuai Wang and Shutao Xia and
Jianping Wu",
title = "A Scalable, High-Performance, and Fault-Tolerant
Network Architecture for Distributed Machine Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1752--1764",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2999377",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2999377",
abstract = "In large-scale distributed machine learning (DML), the
network performance between machines significantly
impacts the speed of iterative training. In this paper
we propose BML, a scalable, high-performance and
fault-tolerant DML network architecture on \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Talak:2020:IAI,
author = "Rajat Talak and Sertac Karaman and Eytan Modiano",
title = "Improving Age of Information in Wireless Networks With
Perfect Channel State Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1765--1778",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2996237",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2996237",
abstract = "Age of information (AoI), defined as the time that
elapsed since the last received update was generated,
is a newly proposed metric to measure the timeliness of
information updates in a network. We consider AoI
minimization problem for a network with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Arisdakessian:2020:FIM,
author = "Sarhad Arisdakessian and Omar Abdel Wahab and Azzam
Mourad and Hadi Otrok and Nadjia Kara",
title = "{FoGMatch}: an Intelligent Multi-Criteria {IoT-Fog}
Scheduling Approach Using Game Theory",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1779--1789",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2994015",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2994015",
abstract = "Cloud computing has long been the main backbone that
Internet of Things (IoT) devices rely on to accommodate
their storage and analytical needs. However, the fact
that cloud systems are often located quite far from the
IoT devices and the emergence of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hu:2020:SAS,
author = "Yidan Hu and Rui Zhang",
title = "A Spatiotemporal Approach for Secure Crowdsourced
Radio Environment Map Construction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1790--1803",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2992939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2992939",
abstract = "Database-driven Dynamic Spectrum Sharing (DSS) is the
de-facto technical paradigm adopted by Federal
Communications Commission for increasing spectrum
efficiency, which allows licensed spectrum to be
opportunistically used by secondary users. In
database-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{An:2020:ABF,
author = "Zhenlin An and Qiongzheng Lin and Lei Yang and Wei Lou
and Lei Xie",
title = "Acquiring {Bloom} Filters Across Commercial {RFIDs} in
Physical Layer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1804--1817",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2992851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2992851",
abstract = "Embedding Radio-Frequency IDentification (RFID) into
everyday objects to construct ubiquitous networks has
been a long-standing goal. However, a major problem
that hinders the attainment of this goal is the current
inefficient reading of RFID tags. To \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sangdeh:2020:PSS,
author = "Pedram Kheirkhah Sangdeh and Hossein Pirayesh and
Adnan Quadri and Huacheng Zeng",
title = "A Practical Spectrum Sharing Scheme for Cognitive
Radio Networks: Design and Experiments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1818--1831",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2994134",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2994134",
abstract = "Spectrum shortage is a fundamental problem in wireless
networks, and this problem becomes increasingly acute
with the rapid proliferation of wireless devices. To
address this issue, spectrum sharing in the context of
cognitive radio networks (CRNs) has \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fan:2020:SSM,
author = "Yuqi Fan and Wenlong Liu and Dan Guo and Weili Wu and
Dingzhu Du",
title = "Shuffle Scheduling for {MapReduce} Jobs Based on
Periodic Network Status",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "4",
pages = "1832--1844",
month = aug,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.2993945",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2993945",
abstract = "MapReduce jobs need to shuffle a large amount of data
over the network between mapper and reducer nodes. The
shuffle time accounts for a big part of the total
running time of the MapReduce jobs. Therefore,
optimizing the makespan of shuffle phase can \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Renani:2020:HHD,
author = "Alireza Ameli Renani and Jun Huang and Guoliang Xing
and Abdol-Hossein Esfahanian and Weiguo Wu",
title = "Harnessing Hardware Defects for Improving Wireless
Link Performance",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1913--1924",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3003338",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3003338",
abstract = "The design trade-offs of transceiver hardware are
crucial to the performance of wireless systems. In this
paper, we present an in-depth study to characterize the
surprisingly notable systemic impacts of low-pass
filter (LPF) design, which is a small yet \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2020:RVR,
author = "Ruomu Hou and Irvan Jahja and Loi Luu and Prateek
Saxena and Haifeng Yu",
title = "Randomized View Reconciliation in Permissionless
Distributed Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1925--1938",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3004834",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3004834",
abstract = "In a sybil attack, an adversary creates many fake
identities/nodes and have them join the system.
Computational puzzles have long been investigated as a
possible sybil defense: nodes that fail to solve the
puzzle in time will no longer be accepted by \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Narasimha:2020:MFG,
author = "Dheeraj Narasimha and Srinivas Shakkottai and Lei
Ying",
title = "A Mean Field Game Analysis of Distributed {MAC} in
Ultra-Dense Multichannel Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1939--1952",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3002912",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3002912",
abstract = "This report analyzes the performance of distributed
Medium Access Control (MAC) protocols in ultra-dense
multichannel wireless networks, where N frequency bands
(or channels) are shared by M = mN devices, and devices
make decisions to probe and then \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hawari:2020:HAP,
author = "Mohammed Hawari and Juan-Antonio Cordero-Fuertes and
Thomas Clausen",
title = "High-Accuracy Packet Pacing on Commodity Servers for
Constant-Rate Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1953--1967",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3001672",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3001672",
abstract = "This paper addresses the problem of high-quality
packet pacing for constant-rate packet consumption
systems, with strict buffering limitations. A
mostly-software pacing architecture is developed, which
has minimal hardware requirements, satisfied by
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2020:CDA,
author = "Nai-Wen Chang and Sun-Yuan Hsieh",
title = "Conditional Diagnosability of Alternating Group
Networks Under the {PMC} Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1968--1980",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3002093",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3002093",
abstract = "Fault diagnosis of processors has played an essential
role when evaluating the reliability of multiprocessor
systems. In many novel multiprocessor systems, their
diagnosability has been extensively explored.
Conditional diagnosability is a useful measure
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Miyandoab:2020:MIC,
author = "Fardin Derogarian Miyandoab and Jo{\~a}o Canas
Ferreira and V{\'\i}tor M. Grade Tavares and Jos{\'e}
Machado da Silva and Fernando J. Velez",
title = "A Multifunctional Integrated Circuit Router for Body
Area Network Wearable Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1981--1994",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3004550",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3004550",
abstract = "A multifunctional router IC to be included in the
nodes of a wearable body sensor network is described
and evaluated. The router targets different application
scenarios, especially those including tens of sensors,
embedded into textile materials and with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:QDE,
author = "Ye Li and Hong Xie and John C. S. Lui and Kenneth L.
Calvert",
title = "Quantifying Deployability and Evolvability of Future
{Internet} Architectures via Economic Models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "1995--2008",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3006207",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3006207",
abstract = "Emerging new applications demand the current Internet
to provide new functionalities. Although many future
Internet architectures and protocols have been proposed
to fulfill such needs, ISPs have been reluctant to
deploy many of these architectures. We \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2020:AOL,
author = "Hao Li and Zhengda Bian and Peng Zhang and Zhun Sun
and Chengchen Hu and Qiang Fu and Tian Pan and Jia Lv",
title = "Application-Oblivious {L7} Parsing Using Recurrent
Neural Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2009--2022",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3000430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3000430",
abstract = "Extracting fields from layer 7 protocols such as HTTP,
known as L7 parsing, is the key to many critical
network applications. However, existing L7 parsing
techniques center around protocol specifications,
thereby incurring large human efforts in \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:PSS,
author = "Jia Liu and Shigang Chen and Min Chen and Qingjun Xiao
and Lijun Chen",
title = "Pose Sensing With a Single {RFID} Tag",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2023--2036",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3007830",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3007830",
abstract = "Determining an object's spatial pose (including
orientation and position) plays a fundamental role in a
variety of applications, such as automatic assembly,
indoor navigation, and robot driving. In this paper, we
design a fine-grained pose sensing system \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2020:RRB,
author = "Haojun Huang and Wang Miao and Geyong Min and
Chengqiang Huang and Xu Zhang and Chen Wang",
title = "Resilient Range-Based $d$-Dimensional Localization for
Mobile Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2037--2050",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3002946",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3002946",
abstract = "Knowledge of node locations is essential to Wireless
Sensor Networks (WSNs) in a wide range of potential
applications and their function-dependent network
protocols. A number of localization approaches have
already been proposed to fulfill this \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chkirbene:2020:LNS,
author = "Zina Chkirbene and Rachid Hadjidj and Sebti Foufou and
Ridha Hamila",
title = "{LaScaDa}: a Novel Scalable Topology for Data Center
Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2051--2064",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3008512",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3008512",
abstract = "The growth of cloud-based services is mainly supported
by the core networking infrastructures of large-scale
data centers, while the scalability of these services
is influenced by the performance and dependability
characteristics of data centers. Hence, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Alaoui:2020:MMA,
author = "Sara {El Alaoui} and Byrav Ramamurthy",
title = "{MARS}: a Multi-Attribute Routing and Scheduling
Algorithm for {DTN} Interplanetary Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2065--2076",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3008630",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3008630",
abstract = "The Interplanetary Network (IPN) or the Interplanetary
Internet is a network composed of interconnected space
objects, which are in turn connected to mission control
stations on the surface of Earth. The IPN is our only
portal to the deep space, and yet \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Karakoc:2020:MLD,
author = "Nurullah Karako{\c{c}} and Anna Scaglione and Angelia
Nedi{\'c} and Martin Reisslein",
title = "Multi-Layer Decomposition of Network Utility
Maximization Problems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2077--2091",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3003925",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3003925",
abstract = "We describe a distributed framework for resource
sharing problems that arise in communications,
micro-economics, and various networking applications.
In particular, we consider a hierarchical multi-layer
decomposition for network utility maximization (ML-.
\ldots{})",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhai:2020:JRS,
author = "Yutong Zhai and Hongli Xu and Haibo Wang and Zeyu Meng
and He Huang",
title = "Joint Routing and Sketch Configuration in
Software-Defined Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2092--2105",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3002783",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3002783",
abstract = "Traffic measurement is very important for various
applications, such as traffic engineering and attack
detection, in software-defined networks. Due to limited
resources (e.g., computing, memory) on SDN switches,
sketches have been widely used for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sexton:2020:PSO,
author = "Conor Sexton and Nicola Marchetti and Luiz A.
DaSilva",
title = "On Provisioning Slices and Overbooking Resources in
Service Tailored Networks of the Future",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2106--2119",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3004443",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3004443",
abstract = "There is a trade-off in network slicing between the
twin goals of providing tailored performance and
increasing resource utilisation through increased
opportunities for sharing. To balance this trade-off,
we propose a system consisting of assured \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:HTR,
author = "Si Chen and Wei Gong and Jia Zhao and Jiangchuan Liu",
title = "High-Throughput and Robust Rate Adaptation for
Backscatter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2120--2131",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3002876",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3002876",
abstract = "Recently backscatter networks have received booming
interest because, they offer a battery-free
communication paradigm using propagation radio waves as
opposed to active radios in traditional sensor networks
while providing comparable sensing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2020:NUM,
author = "Qingyu Liu and Haibo Zeng and Minghua Chen",
title = "Network Utility Maximization Under Maximum Delay
Constraints and Throughput Requirements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2132--2145",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3007842",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3007842",
abstract = "We consider a multi-path routing problem of maximizing
the aggregate user utility over a multi-hop network,
subject to link capacity constraints, maximum
end-to-end delay constraints, and user throughput
requirements. A user's utility is a concave \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ghasemi:2020:ACC,
author = "Hooshang Ghasemi and Aditya Ramamoorthy",
title = "Asynchronous Coded Caching With Uncoded Prefetching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2146--2159",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3003907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3003907",
abstract = "Coded caching is a technique that promises huge
reductions in network traffic in content-delivery
networks. However, the original formulation and several
subsequent contributions in the area, assume that the
file requests from the users are synchronized,
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Su:2020:PAR,
author = "Jian Su and Alex X. Liu and Zhengguo Sheng and Yongrui
Chen",
title = "A Partitioning Approach to {RFID} Identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2160--2173",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3004852",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3004852",
abstract = "Radio-frequency identification (RFID) is a major
enabler of Internet of Things (IoT), and has been
widely applied in tag-intensive environments. Tag
collision arbitration is considered as a crucial issue
of such RFID system. To enhance the reading \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:EAT,
author = "Youlin Zhang and Shigang Chen and You Zhou and Olufemi
O. Odegbile and Yuguang Fang",
title = "Efficient Anonymous Temporal-Spatial Joint Estimation
at Category Level Over Multiple Tag Sets With
Unreliable Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2174--2187",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3011347",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3011347",
abstract = "Radio-frequency identification (RFID) technologies
have been widely used in inventory control, object
tracking and supply chain management. One of the
fundamental system functions is called cardinality
estimation, which is to estimate the number of tags
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yuan:2020:OAA,
author = "Dingwen Yuan and Hsuan-Yin Lin and J{\"o}rg Widmer and
Matthias Hollick",
title = "Optimal and Approximation Algorithms for Joint Routing
and Scheduling in Millimeter-Wave Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2188--2202",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3006312",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3006312",
abstract = "Millimeter-wave (mmWave) communication is a promising
technology to cope with the exponential increase in 5G
data traffic. Such networks typically require a very
dense deployment of base stations. A subset of those,
so-called macro base stations, feature \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Devoti:2020:PMW,
author = "Francesco Devoti and Ilario Filippini",
title = "Planning mm-Wave Access Networks Under Obstacle
Blockages: a Reliability-Aware Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2203--2214",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3006926",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3006926",
abstract = "Millimeter-wave (mm-wave) technologies are the main
driver to deliver the multiple-Gbps promise in
next-generation wireless access networks. However, the
GHz-bandwidth potential must coexist with a harsh
propagation environment. While strong attenuations
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Maatouk:2020:AII,
author = "Ali Maatouk and Saad Kriouile and Mohamad Assaad and
Anthony Ephremides",
title = "The Age of Incorrect Information: a New Performance
Metric for Status Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2215--2228",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3005549",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3005549",
abstract = "In this paper, we introduce a new performance metric
in the framework of status updates that we will refer
to as the Age of Incorrect Information (AoII). This new
metric deals with the shortcomings of both the Age of
Information (AoI) and the conventional \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hayes:2020:OIG,
author = "David A. Hayes and Michael Welzl and Simone Ferlin and
David Ros and Safiqul Islam",
title = "Online Identification of Groups of Flows Sharing a
Network Bottleneck",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2229--2242",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3007346",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3007346",
abstract = "Most Internet hosts today support multiple access
technologies and network interfaces. Multipath
transport protocols, like MPTCP, are being deployed
(e.g., in smartphones), allowing transparent
simultaneous use of multiple links. Besides providing
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2020:ORA,
author = "Huanle Xu and Yang Liu and Wing Cheong Lau and
Tiantong Zeng and Jun Guo and Alex X. Liu",
title = "Online Resource Allocation With Machine Variability: a
Bandit Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2243--2256",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3006906",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3006906",
abstract = "Approximation jobs that allow partial execution of
their many tasks to achieve valuable results have
played an important role in today's large-scale data
analytics. This fact can be utilized to maximize the
system utility of a big data computing cluster
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wei:2020:DOS,
author = "Ziling Wei and Jinshu Su and Baokang Zhao and Xicheng
Lu",
title = "Distributed Opportunistic Scheduling in Cooperative
Networks With {RF} Energy Harvesting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2257--2270",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3011839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3011839",
abstract = "In this paper, the problem of distributed
opportunistic channel access in wireless cooperative
networks is investigated. To cope with the energy
limitation problem of relay nodes, radio-frequency (RF)
energy harvesting is considered, and thus, no external
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Choi:2020:ISF,
author = "Jaeyoung Choi and Sangwoo Moon and Jiin Woo and
Kyunghwan Son and Jinwoo Shin and Yung Yi",
title = "Information Source Finding in Networks: Querying With
Budgets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2271--2284",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3009946",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3009946",
abstract = "In this paper, we study a problem of detecting the
source of diffused information by querying individuals,
given a sample snapshot of the information diffusion
graph, where two queries are asked: (i) whether the
respondent is the source or not, and (ii) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Key:2020:PCC,
author = "Peter Key and Richard Steinberg",
title = "Pricing, Competition and Content for {Internet}
Service Providers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2285--2298",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3010550",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3010550",
abstract = "We examine competition between two Internet Service
Providers (ISPs), where the first ISP provides basic
Internet service, while the second ISP provides
Internet service plus content, i.e., enhanced service,
where the first ISP can partner with a Content
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2020:PBA,
author = "Cheng Chen and Randall A. Berry and Michael L. Honig
and Vijay G. Subramanian",
title = "Pricing, Bandwidth Allocation, and Service Competition
in Heterogeneous Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2299--2308",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3008141",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3008141",
abstract = "Small-cells deployed in licensed spectrum can expand
wireless service to low mobility users, which
potentially reduces the demand for macro-cellular
networks with wide-area coverage. Introducing such
heterogeneity also makes network resource allocation
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2020:MLA,
author = "Ning Xie and Le Ou-Yang and Alex X. Liu",
title = "A Machine Learning Approach to Blind Multi-Path
Classification for Massive {MIMO} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "5",
pages = "2309--2322",
month = oct,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3008287",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:30 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3008287",
abstract = "This paper concerns the problem of the multi-path
classification in a multi-user multi-input multi-output
(MIMO) system. We propose a machine learning approach
to achieve a blind multi-path classification in the
uplink (UL) scheme of a multi-user massive \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luu:2020:CAR,
author = "Quang-Trung Luu and Sylvaine Kerboeuf and Alexandre
Mouradian and Michel Kieffer",
title = "A Coverage-Aware Resource Provisioning Method for
Network Slicing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2393--2406",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3019098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3019098",
abstract = "With network slicing in 5G networks, Mobile Network
Operators can create various slices for Service
Providers (SPs) to accommodate customized services.
Usually, the various Service Function Chains (SFCs)
belonging to a slice are deployed on a best-effort
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Coniglio:2020:ETE,
author = "Stefano Coniglio and Luca Giovanni Gianoli and Edoardo
Amaldi and Antonio Capone",
title = "Elastic Traffic Engineering Subject to a Fair
Bandwidth Allocation via Bilevel Programming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2407--2420",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3007572",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3007572",
abstract = "The ability of TCP&\#x2019;s congestion control scheme
to adapt the rate of traffic flows and fairly use all
the available resources is one of the
Internet&\#x2019;s pillars. So far, however, the
elasticity of traffic has been disregarded in traffic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tapolcai:2020:FER,
author = "J{\'a}nos Tapolcai and Lajos R{\'o}nyai and Bal{\'a}zs
Vass and L{\'a}szl{\'o} Gyim{\'o}thi",
title = "Fast Enumeration of Regional Link Failures Caused by
Disasters With Limited Size",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2421--2434",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3009297",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3009297",
abstract = "At backbone network planning, an important task is to
identify the failures to get prepared for. Technically,
a list of link sets, called Shared Risk Link Groups
(SRLG), is defined. The observed reliability of network
services strongly depends on how \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Munir:2020:NSC,
author = "Ali Munir and Ting He and Ramya Raghavendra and Franck
Le and Alex X. Liu",
title = "Network Scheduling and Compute Resource Aware Task
Placement in Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2435--2448",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3013548",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3013548",
abstract = "To improve the performance of data-intensive
applications, existing datacenter schedulers optimize
either the placement of tasks or the scheduling of
network flows. The task scheduler strives to place
tasks close to their input data (i.e., maximize data
\ldots{})",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2020:WCT,
author = "Xiuzhen Guo and Yuan He and Xiaolong Zheng",
title = "{WiZig}: Cross-Technology Energy Communication Over a
Noisy Channel",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2449--2460",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3013921",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3013921",
abstract = "The proliferation of IoT applications brings the
demand of ubiquitous connections among heterogeneous
wireless devices. Cross-Technology Communication (CTC)
is a significant technique to directly exchange data
among heterogeneous devices that follow \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Quan:2020:CCO,
author = "Guocong Quan and Jian Tan and Atilla Eryilmaz",
title = "Counterintuitive Characteristics of Optimal
Distributed {LRU} Caching Over Unreliable Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2461--2474",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3015474",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3015474",
abstract = "Least-recently-used (LRU) caching and its variants
have conventionally been used as a fundamental and
critical method to ensure fast and efficient data
access in computer and communication systems. Emerging
data-intensive applications over unreliable \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:PTF,
author = "Jingxuan Zhang and Kai Gao and Y. Richard Yang and Jun
Bi",
title = "{Prophet}: Toward Fast, Error-Tolerant Model-Based
Throughput Prediction for Reactive Flows in {DC}
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2475--2488",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3016838",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3016838",
abstract = "As modern network applications ({$<$ italic$>$
e.g.$<$}/{italic$>$}, large data analytics) become more
distributed and can conduct application-layer traffic
adaptation, they demand better network visibility to
better orchestrate their data flows. As a result, the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jiang:2020:BIC,
author = "Yuxuan Jiang and Mohammad Shahrad and David Wentzlaff
and Danny H. K. Tsang and Carlee Joe-Wong",
title = "Burstable Instances for Clouds: Performance Modeling,
Equilibrium Analysis, and Revenue Maximization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2489--2502",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3015523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3015523",
abstract = "Leading cloud providers recently introduced a new
instance type named {$<$ italic$>$
burstable$<$}/{italic$>$} instances to better match the
time-varying workloads of tenants and further reduce
their costs. In the research community, however, little
has been done to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2020:SRL,
author = "Hao Zhou and Xiaofeng Gao and Jiaqi Zheng and Guihai
Chen",
title = "Scheduling Relaxed Loop-Free Updates Within Tight
Lower Bounds in {SDNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2503--2516",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3017771",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3017771",
abstract = "We consider a fundamental update problem of avoiding
forwarding loops based on the node-ordering protocol in
Software Defined Networks (SDNs). Due to the
distributed data plane, forwarding loops may occur
during the updates and influence the network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Stahlbuhk:2020:TMU,
author = "Thomas Stahlbuhk and Brooke Shrader and Eytan
Modiano",
title = "Throughput Maximization in Uncooperative Spectrum
Sharing Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2517--2530",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3012273",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3012273",
abstract = "Throughput-optimal transmission scheduling in wireless
networks has been a well considered problem in the
literature, and the method for achieving optimality,
MaxWeight scheduling, has been known for several
decades. This algorithm achieves optimality by
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:SPA,
author = "Zhanzhan Zhang and Yin Sun and Ashutosh Sabharwal and
Zhiyong Chen and Bin Xia",
title = "Scheduling and Power Allocation Dampens the Negative
Effect of Channel Misreporting in Massive {MIMO}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2531--2544",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3014630",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3014630",
abstract = "We study the sensitivity of multi-user scheduling
performance to channel magnitude misreporting in
systems with massive antennas. We consider the
round-robin scheduler combined with max-min and
waterfilling power controls, respectively. We show that
user \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2020:ELD,
author = "Zhiwei Zhao and Geyong Min and Wei Dong and Xue Liu
and Weifeng Gao and Tao Gu and Minghang Yang",
title = "Exploiting Link Diversity for Performance-Aware and
Repeatable Simulation in Low-Power Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2545--2558",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3016056",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3016056",
abstract = "Network simulation is a fundamental service for
performance testing and protocol design in wireless
networks. Due to the wireless dynamics, it is highly
challenging to provide repeatable and reliable
simulation results that are comparable to the empirical
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mohammadkhan:2020:CIA,
author = "Ali Mohammadkhan and K. K. Ramakrishnan and Vivek A.
Jain",
title = "{CleanG} --- Improving the Architecture and Protocols
for Future Cellular Networks With {NFV}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2559--2572",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3015946",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3015946",
abstract = "With the rapid increase in the number of users and
changing pattern of network usage, cellular networks
will continue to be challenged meeting bandwidth and
latency requirements. A significant contributor to
latency and overhead is cellular network&\#x2019;.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2020:FPD,
author = "Xianjin Xia and Yuanqing Zheng and Tao Gu",
title = "{FTrack}: Parallel Decoding for {LoRa} Transmissions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2573--2586",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3018020",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3018020",
abstract = "LoRa has emerged as a promising Low-Power Wide Area
Network (LP-WAN) technology to connect a huge number of
Internet-of-Things (IoT) devices. The dense deployment
and an increasing number of IoT devices lead to intense
collisions due to uncoordinated \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shahbaz:2020:ESR,
author = "Muhammad Shahbaz and Lalith Suresh and Jennifer
Rexford and Nick Feamster and Ori Rottenstreich and
Mukesh Hira",
title = "{Elmo}: Source Routed Multicast for Public Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2587--2600",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3020869",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3020869",
abstract = "We present Elmo, a system that addresses the multicast
scalability problem in multi-tenant datacenters. Modern
cloud applications frequently exhibit one-to-many
communication patterns and, at the same time, require
sub-millisecond latencies and high \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shifrin:2020:OPC,
author = "Mark Shifrin and Daniel S. Menasch{\'e} and Asaf Cohen
and Dennis Goeckel and Omer Gurewitz",
title = "Optimal {PHY} Configuration in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2601--2614",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3015881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3015881",
abstract = "In this work, we study the optimal configuration of
the physical layer in wireless networks by means of
Semi-Markov Decision Process (SMDP) modeling. In
particular, assume the physical layer is characterized
by a set of potential operating points, with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2020:CHS,
author = "Jinyong Chang and Yanyan Ji and Bilin Shao and Maozhi
Xu and Rui Xue",
title = "Certificateless Homomorphic Signature Scheme for
Network Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2615--2628",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3013902",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3013902",
abstract = "Homomorphic signature is an extremely important public
key authentication technique for network coding to
defend against pollution attacks. As a public key
cryptographic primitive, it also encounters the same
problem of how to confirm the relationship \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{E:2020:HTH,
author = "Jinlong E. and Yong Cui and Zhenhua Li and Mingkang
Ruan and Ennan Zhai",
title = "{HyCloud}: Tweaking Hybrid Cloud Storage Services for
Cost-Efficient Filesystem Hosting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2629--2642",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3019571",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3019571",
abstract = "Today&\#x2019;s cloud storage infrastructures
typically provide two distinct types of services for
hosting files: {$<$ italic$>$ object}
{storage$<$}/{italic$>$} like Amazon S3 and {$<$
italic$>$ filesystem} {storage$<$}/{italic$>$} like
Amazon EFS. In practice, a cloud storage user
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gao:2020:CMS,
author = "Lingnan Gao and George N. Rouskas",
title = "Congestion Minimization for Service Chain Routing
Problems With Path Length Considerations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2643--2656",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3017792",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3017792",
abstract = "Network function virtualization (NFV), with its
perceived potential to accelerate service deployment
and to introduce flexibility in service provisioning,
has drawn a growing interest from industry and academia
alike over the past few years. One of the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2020:PHV,
author = "Sicheng Zhao and Xing Wu and Zuqing Zhu",
title = "On Parallel and Hitless {vSDN} Reconfiguration",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2657--2670",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3014655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3014655",
abstract = "The symbiosis of network virtualization and
software-defined networking (SDN) enables an
infrastructure provider (InP) to build various virtual
software defined networks (vSDNs) over a shared
substrate network (SNT). To handle a dynamic network
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Malik:2020:ZRC,
author = "Fehmina Malik and Manjesh K. Hanawal and Yezekael
Hayel",
title = "Zero-Rating of Content and Its Effect on the Quality
of Service in the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2671--2684",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3022676",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3022676",
abstract = "The ongoing net neutrality debate has generated a lot
of heated discussions on whether or not monetary
interactions should be regulated between content and
access providers. Among the several topics discussed,
&\#x2018;differential pricing&\#x2019; has \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ding:2020:MPP,
author = "Kemi Ding and Junshan Zhang",
title = "Multi-Party Privacy Conflict Management in Online
Social Networks: a Network Game Perspective",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2685--2698",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3016315",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3016315",
abstract = "In this work, we consider the multi-party privacy
conflict (MPC) in an online social network (OSN). As
many data items uploaded to the OSN are
&\#x201C;co-owned&\#x201D; by multiple users with
different privacy concerns, some personal information
of OSN \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ye:2020:ABN,
author = "Tong Ye and Jingjie Ding and Tony T. Lee and Guido
Maier",
title = "{AWG}-Based Nonblocking Shuffle--Exchange Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2699--2712",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3017500",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3017500",
abstract = "Optical shuffle-exchange networks (SENs) have wide
application in different kinds of interconnection
networks. This article proposes an approach to
construct modular optical SENs, using a set of arrayed
waveguide gratings (AWGs) and tunable wavelength
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2020:SSD,
author = "Huazhe Wang and Xin Li and Yang Wang and Yu Zhao and
Ye Yu and Hongkun Yang and Chen Qian",
title = "{SICS}: Secure and Dynamic Middlebox Outsourcing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2713--2726",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3023386",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3023386",
abstract = "There is an increasing trend that enterprises
outsource their middlebox processing to a cloud for
lower cost and easier management. However, outsourcing
middleboxes brings threats to the enterprise&\#x2019;s
private information, including the traffic and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2020:SMF,
author = "Juhyeng Han and Seongmin Kim and Daeyang Cho and
Byungkwon Choi and Jaehyeong Ha and Dongsu Han",
title = "A Secure Middlebox Framework for Enabling Visibility
Over Multiple Encryption Protocols",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2727--2740",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3016785",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3016785",
abstract = "Network middleboxes provide the first line of defense
for enterprise networks. Many of them typically inspect
packet payload to filter malicious attack patterns.
However, the widespread use of end-to-end cryptographic
protocols designed to promote \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2020:TSG,
author = "Hui Xia and Rui Zhang and Xiangguo Cheng and Tie Qiu
and Dapeng Oliver Wu",
title = "Two-Stage Game Design of Payoff Decision-Making Scheme
for Crowdsourcing Dilemmas",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2741--2754",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3018448",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3018448",
abstract = "Crowdsourcing uses collective intelligence to finish
complicated tasks and is widely applied in many fields.
However, the crowdsourcing dilemmas between the task
requester and the task completer restrict the
efficiency of system severely, e.g., the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yan:2020:SFP,
author = "Boyuan Yan and Yongli Zhao and Xiaosong Yu and Yajie
Li and Sabidur Rahman and Yongqi He and Xiangjun Xin
and Jie Zhang",
title = "Service Function Path Provisioning With Topology
Aggregation in Multi-Domain Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2755--2767",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3019708",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3019708",
abstract = "Traffic flows are often processed by a chain of
Service Functions (SFs) (known as Service Function
Chaining (SFC)) to satisfy service requirements. The
deployed path for a SFC is called Service Function Path
(SFP). SFs can be virtualized and migrated to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2020:TTR,
author = "Yiming Zhang and Haonan Wang and Menghan Jia and
Jinyan Wang and Dongsheng Li and Guangtao Xue and
Kian-Lee Tan",
title = "{TopoX}: Topology Refactorization for Minimizing
Network Communication in Graph Computations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2768--2782",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3020813",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3020813",
abstract = "Efficient graph partitioning is vital for
high-performance graph-parallel systems. Traditional
graph partitioning methods attempt to both minimize
communication cost and guarantee load balancing in
computation. However, the skewed degree distribution of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2020:PSC,
author = "Xi Huang and Simeng Bian and Ziyu Shao and Hong Xu",
title = "Predictive Switch-Controller Association and Control
Devolution for {SDN} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2783--2796",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3021787",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3021787",
abstract = "For software-defined networking (SDN) systems, to
enhance the scalability and reliability of control
plane, existing solutions adopt either multi-controller
design with static switch-controller association, or
static control devolution by delegating \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Deng:2020:NLE,
author = "Lei Deng and Haifeng Zheng and Xiao-Yang Liu and
Xinxin Feng and Zhizhang David Chen",
title = "Network Latency Estimation With Leverage Sampling for
Personal Devices: an Adaptive Tensor Completion
Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "28",
number = "6",
pages = "2797--2808",
month = dec,
year = "2020",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3022757",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Feb 23 08:45:31 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3022757",
abstract = "In recent years, end-to-end network latency estimation
has attracted much attention because of its
significance for network performance evaluation. Given
the widespread use of personal devices, latency
estimation from partially observed samples becomes
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Giotsas:2021:PWA,
author = "Vasileios Giotsas and George Nomikos and Vasileios
Kotronis and Pavlos Sermpezis and Petros Gigis and
Lefteris Manassakis and Christoph Dietzel and Stavros
Konstantaras and Xenofontas Dimitropoulos",
title = "{O} Peer, Where Art Thou? {Uncovering} Remote Peering
Interconnections at {IXPs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "1--16",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3025945",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3025945",
abstract = "Internet eXchange Points (IXPs) are Internet hubs that
mainly provide the switching infrastructure to
interconnect networks and exchange traffic. While the
initial goal of IXPs was to bring together networks
residing in the same city or country, and thus
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2021:AAP,
author = "Zehua Guo and Yang Xu and Ya-Feng Liu and Sen Liu and
H. Jonathan Chao and Zhi-Li Zhang and Yuanqing Xia",
title = "{AggreFlow}: Achieving Power Efficiency, Load
Balancing, and Quality of Service in Data Center
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "17--33",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3026015",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3026015",
abstract = "Power-efficient Data Center Networks (DCNs) have been
proposed to save power of DCNs using OpenFlow. In these
DCNs, the OpenFlow controller adaptively turns on/off
links and OpenFlow switches to form a minimum-power
subnet that satisfies the traffic \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2021:SPC,
author = "Lin Wang and Lei Jiao and Ting He and Jun Li and Henri
Bal",
title = "Service Placement for Collaborative Edge
Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "34--47",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3025985",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3025985",
abstract = "Edge computing is emerging as a promising computing
paradigm for supporting next-generation applications
that rely on low-latency network connections in the
Internet-of-Things (IoT) era. Many edge applications,
such as multi-player augmented reality (AR) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dai:2021:RCW,
author = "Haipeng Dai and Yunhuai Liu and Nan Yu and Chaofeng Wu
and Guihai Chen and Tian He and Alex X. Liu",
title = "Radiation Constrained Wireless Charger Placement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "48--64",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3028704",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3028704",
abstract = "Wireless Power Transfer has become a commercially
viable technology to charge devices because of the
convenience of no power wiring and the reliability of
continuous power supply. This paper concerns the
fundamental issue of wireless charger placement
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2021:PBW,
author = "Meng Jin and Yuan He and Xin Meng and Dingyi Fang and
Xiaojiang Chen",
title = "Parallel Backscatter in the Wild: When Burstiness and
Randomness Play With You",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "65--77",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027735",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027735",
abstract = "Parallel backscatter is a promising technique for high
throughput, low power communications. The existing
approaches of parallel backscatter are based on a
common assumption, i.e. the states of the collided
signals are distinguishable from each other in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:VGA,
author = "Xiaoli Zhang and Qi Li and Zeyu Zhang and Jianping Wu
and Jiahai Yang",
title = "{vSFC}: Generic and Agile Verification of Service
Function Chains in the Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "78--91",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3028846",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3028846",
abstract = "With the advent of network function virtualization
(NFV), outsourcing network functions (NFs) to the cloud
is becoming increasingly popular for enterprises since
it brings significant benefits for NF deployment and
maintenance, such as improved \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2021:CVP,
author = "Minmei Wang and Chen Qian and Xin Li and Shouqian Shi
and Shigang Chen",
title = "Collaborative Validation of Public-Key Certificates
for {IoT} by Distributed Caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "92--105",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3029135",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3029135",
abstract = "Public-key certificate validation is an important
building block for various security protocols for IoT
devices, such as secure channel establishment,
handshaking, and verifying sensing data authenticity
from cloud storage. However, certification \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Naghsh:2021:CFS,
author = "Zahra Naghsh and Shahrokh Valaee",
title = "Conflict-Free Scheduling in Cellular {V2X}
Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "106--119",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3030850",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3030850",
abstract = "Cellular V2X, the &\#x201C;Vehicle to
Everything&\#x201D; standard, defines a framework for
information exchange among vehicles and other network
entities. In one of the main modes, LTE V2X relies on a
central scheduler to minimize the consumed resources in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ao:2021:JWD,
author = "Weng Chon Ao and Po-Han Huang and Konstantinos
Psounis",
title = "Joint Workload Distribution and Capacity Augmentation
in Hybrid Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "120--133",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027607",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027607",
abstract = "In hybrid datacenter networks, wired connections are
augmented with wireless links to facilitate data
transfers between racks. The usage of mmWave/FSO
wireless links enables dynamic bandwidth/capacity
allocation with extremely small reconfiguration delay.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zou:2021:FAA,
author = "Shaojun Zou and Jiawei Huang and Jianxin Wang and Tian
He",
title = "Flow-Aware Adaptive Pacing to Mitigate {TCP} Incast in
Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "134--147",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027749",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027749",
abstract = "In data center networks, many network-intensive
applications leverage large fan-in and many-to-one
communication to achieve high performance. However, the
special traffic patterns, such as micro-burst and high
concurrency, easily cause TCP Incast problem \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:OPP,
author = "Yunpeng Li and Costas A. Courcoubetis and Lingjie Duan
and Richard Weber",
title = "Optimal Pricing for Peer-to-Peer Sharing With Network
Externalities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "148--161",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3029398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3029398",
abstract = "In this paper, we analyse how a peer-to-peer sharing
platform should price its service to maximize profit,
when user participation increases the value of the
service to others by causing positive externalities.
Modelling the service as an excludable \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2021:FGT,
author = "Chuanwen Luo and Meghana N. Satpute and Deying Li and
Yongcai Wang and Wenping Chen and Weili Wu",
title = "Fine-Grained Trajectory Optimization of Multiple
{UAVs} for Efficient Data Gathering from {WSNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "162--175",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027555",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027555",
abstract = "The increasing availability of autonomous small-size
Unmanned Aerial Vehicles (UAVs) has provided a
promising way for data gathering from Wireless Sensor
Networks (WSNs) with the advantages of high mobility,
flexibility, and good speed. However, few works
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2021:AAG,
author = "Wenzheng Xu and Weifa Liang and Zichuan Xu and Jian
Peng and Dezhong Peng and Tang Liu and Xiaohua Jia and
Sajal K. Das",
title = "Approximation Algorithms for the Generalized Team
Orienteering Problem and its Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "176--189",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027434",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027434",
abstract = "In this article we study a generalized team
orienteering problem (GTOP), which is to find service
paths for multiple homogeneous vehicles in a network
such that the profit sum of serving the nodes in the
paths is maximized, subject to the cost budget of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:MTN,
author = "Zuyuan Zhang and Fangming Shao and Nan Zhang and
Yifeng Niu",
title = "Maximizing $k$-Terminal Network Reliability in Some
Sparse Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "190--202",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3030819",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3030819",
abstract = "k-terminal network reliability is the probability that
k terminal vertices are connected given that edges in
the network fail independently while vertices do not
fail. It depends on the distribution of these terminal
vertices as well as network topology. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2021:DSA,
author = "Huanhuan Huang and Tong Ye and Tony T. Lee and
Weiqiang Sun",
title = "Delay and Stability Analysis of Connection-Based
Slotted-Aloha",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "203--219",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3029774",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3029774",
abstract = "In recent years, connection-based slotted-Aloha
(CS-Aloha) has been proposed to improve the performance
of random access networks. In this protocol, each node
attempts to send a request to the access point (AP)
before packet transmission. Once this \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Psychasand:2021:HTP,
author = "Konstantinos Psychasand and Javad Ghaderi",
title = "High-Throughput Bin Packing: Scheduling Jobs With
Random Resource Demands in Clusters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "220--233",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3034022",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3034022",
abstract = "We consider a natural scheduling problem which arises
in many distributed computing frameworks. Jobs with
diverse resource demands (e.g. memory requirements)
arrive over time and must be served by a cluster of
servers. To improve throughput and delay, the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kumar:2021:PFC,
author = "B. R. Vinay Kumar and Navin Kashyap",
title = "Probabilistic Forwarding of Coded Packets on
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "234--247",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3031467",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3031467",
abstract = "We consider a scenario of broadcasting information
over a network of nodes connected by noiseless
communication links. A source node in the network has
some data packets to broadcast. It encodes these data
packets into $n$ coded packets in such a way that
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2021:ISD,
author = "Jianchun Liu and Hongli Xu and Gongming Zhao and Chen
Qian and Xingpeng Fan and Xuwei Yang and He Huang",
title = "Incremental Server Deployment for Software-Defined
{NFV}-Enabled Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "248--261",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3030298",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3030298",
abstract = "Network Function Virtualization (NFV) is a new
paradigm to enable service innovation through
virtualizing traditional network functions. To
construct a new NFV-enabled network, there are two
critical requirements: minimizing server deployment
cost and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Schuller:2021:FRO,
author = "Timmy Sch{\"u}ller and Nils Aschenbruck and Markus
Chimani and Martin Horneffer",
title = "Failure Resiliency With Only a Few Tunnels ---
Enabling Segment Routing for Traffic Engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "262--274",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3030543",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3030543",
abstract = "Traffic engineering is an important concept that
allows Internet Service Providers (ISPs) to utilize
their existing routing hardware more efficiently. One
technology that can be used is Segment Routing (SR). In
this paper, we address the use of SR to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Demianiuk:2021:RDM,
author = "Vitalii Demianiuk and Sergey Gorinsky and Sergey I.
Nikolenko and Kirill Kogan",
title = "Robust Distributed Monitoring of Traffic Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "275--288",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3034890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3034890",
abstract = "Unrelenting traffic growth, device heterogeneity, and
load unevenness create scalability challenges for
traffic monitoring. In this paper, we propose Robust
Distributed Computation (RoDiC), a new approach that
addresses these challenges by shifting a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qiao:2021:BQD,
author = "Chunyu Qiao and Jiliang Wang and Yunhao Liu",
title = "Beyond {QoE}: Diversity Adaptation in Video Streaming
at the Edge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "289--302",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3032416",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3032416",
abstract = "Adaptive bitrate (ABR) algorithms are critical
techniques for high quality-of-experience (QoE)
Internet video delivery. Early ABR algorithms
conducting the overall QoE function of fixed parameters
are limited by the fact that the QoE of end-users are
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Castiglione:2021:CIC,
author = "Luca Maria Castiglione and Paolo Falcone and Alberto
Petrillo and Simon Pietro Romano and Stefania Santini",
title = "Cooperative Intersection Crossing Over {5G}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "303--317",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3032652",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3032652",
abstract = "Autonomous driving is a safety critical application of
sensing and decision-making technologies. Communication
technologies extend the awareness capabilities of
vehicles, beyond what is achievable with the on-board
systems only. Nonetheless, issues \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ejaz:2021:HAI,
author = "Ahsen Ejaz and Vassilis Papaefstathiou and Ioannis
Sourdis",
title = "{HighwayNoC}: Approaching Ideal {NoC} Performance With
Dual Data Rate Routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "318--331",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3034581",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3034581",
abstract = "This paper describes HighwayNoC, a Network-on-chip
(NoC) that approaches ideal network performance using a
Dual Data Rate (DDR) datapath. Based on the observation
that routers datapath is faster than control, a DDR NoC
allows flits to be routed at DDR \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:NWF,
author = "Peng Zhang and Fangzheng Zhang and Shimin Xu and Zuoru
Yang and Hao Li and Qi Li and Huanzhao Wang and Chao
Shen and Chengchen Hu",
title = "Network-Wide Forwarding Anomaly Detection and
Localization in Software Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "332--345",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3033588",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3033588",
abstract = "A crucial requirement for Software Defined Network
(SDN) is that data plane forwarding behaviors should
always agree with control plane policies. Such
requirement cannot be met when there are forwarding
anomalies, where packets deviate from the paths
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kassir:2021:AMP,
author = "Saadallah Kassir and Pablo Caballero Garces and
Gustavo de Veciana and Nannan Wang and Xi Wang and
Paparao Palacharla",
title = "An Analytical Model and Performance Evaluation of
Multihomed Multilane {VANETs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "346--359",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3032324",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3032324",
abstract = "Motivated by the potentially high downlink traffic
demands of commuters in future autonomous vehicles, we
study a network architecture where vehicles use
Vehicle-to-Vehicle (V2V) links to form relay network
clusters, which in turn use Vehicle-to-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2021:ACB,
author = "Zhiyuan Xu and Dejun Yang and Jian Tang and Yinan Tang
and Tongtong Yuan and Yanzhi Wang and Guoliang Xue",
title = "An Actor--Critic-Based Transfer Learning Framework for
Experience-Driven Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "360--371",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3037231",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3037231",
abstract = "Experience-driven networking has emerged as a new and
highly effective approach for resource allocation in
complex communication networks. Deep Reinforcement
Learning (DRL) has been shown to be a useful technique
for enabling experience-driven networking. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tong:2021:CFL,
author = "Xinyu Tong and Yang Wan and Qianru Li and Xiaohua Tian
and Xinbing Wang",
title = "{CSI} Fingerprinting Localization With Low Human
Efforts",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "372--385",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3035210",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3035210",
abstract = "Fingerprinting indoor localization systems exploit
wireless signal propagation features to estimate the
location of wireless devices, where the major challenge
in practice is the all-consuming training process: it
requires site survey to establish the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2021:MFD,
author = "Jianxiong Guo and Tiantian Chen and Weili Wu",
title = "A Multi-Feature Diffusion Model: Rumor Blocking in
Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "386--397",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3032893",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3032893",
abstract = "Online social networks provide a convenient platform
for the spread of rumors, which could lead to serious
aftermaths such as economic losses and public panic.
The classical rumor blocking problem aims to launch a
set of nodes as a positive cascade to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dinh:2021:FLW,
author = "Canh T. Dinh and Nguyen H. Tran and Minh N. H. Nguyen
and Choong Seon Hong and Wei Bao and Albert Y. Zomaya
and Vincent Gramoli",
title = "Federated Learning Over Wireless Networks: Convergence
Analysis and Resource Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "398--409",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3035770",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3035770",
abstract = "There is an increasing interest in a fast-growing
machine learning technique called Federated Learning
(FL), in which the model training is distributed over
mobile user equipment (UEs), exploiting UEs' local
computation and training data. Despite its \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cao:2021:CXF,
author = "Zhichao Cao and Jiliang Wang and Daibo Liu and Qiang
Ma and Xin Miao and Xufei Mao",
title = "{Chase++}: {Fountain}-Enabled Fast Flooding in
Asynchronous Duty Cycle Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "1",
pages = "410--422",
month = feb,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3034251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:15 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3034251",
abstract = "Due to limited energy supply on many Internet of
Things (IoT) devices, asynchronous duty cycle radio
management is widely adopted to save energy. Flooding
is a critical way to disseminate messages through the
whole network. Capture effect enabled \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bai:2021:OMC,
author = "Wei Bai and Shuihai Hu and Kai Chen and Kun Tan and
Yongqiang Xiong",
title = "One More Config is Enough: Saving {(DC)TCP} for
High-Speed Extremely Shallow-Buffered Datacenters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "489--502",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3032999",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3032999",
abstract = "The link speed in production datacenters is growing
fast, from 1 Gbps to 40 Gbps or even 100 Gbps. However,
the buffer size of commodity switches increases slowly,
e.g., from 4 MB at 1 Gbps to 16 MB at 100 Gbps, thus
significantly outpaced by the link \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Laki:2021:CSF,
author = "S{\'a}ndor Laki and Szilveszter N{\'a}das and
Gerg{\H{o}} Gombos and Ferenc Fejes and P{\'e}ter
Hudoba and Zolt{\'a}n Tur{\'a}nyi and Zolt{\'a}n Kiss
and Csaba Keszei",
title = "Core-Stateless Forwarding With {QoS} Revisited:
Decoupling Delay and Bandwidth Requirements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "503--516",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3041235",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3041235",
abstract = "Network QoS, fairness and resource sharing control are
not completely solved problems. Available solutions
lack scalability due to maintaining flow state, require
re-tuning if traffic changes, focus on a limited set of
networking scenarios or require \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mendelson:2021:ASC,
author = "Gal Mendelson and Shay Vargaftik and Katherine
Barabash and Dean H. Lorenz and Isaac Keslassy and
Ariel Orda",
title = "{AnchorHash}: a Scalable Consistent Hash",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "517--528",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3039547",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3039547",
abstract = "Consistent hashing is a central building block in many
networking applications, such as maintaining connection
affinity of TCP flows. However, current consistent
hashing solutions do not ensure full consistency under
arbitrary changes or scale poorly in terms of memory
footprint, update time and key lookup complexity. We
present AnchorHash, a scalable and fully-consistent
hashing algorithm. AnchorHash achieves high key lookup
rate, low memory footprint and low update time. We
formally establish its strong theoretical guarantees,
and present an advanced implementation with a memory
footprint of only a few bytes per resource. Moreover,
evaluations indicate that AnchorHash scales on a single
core to 100 million resources while still achieving a
key lookup rate of more than 15 million keys per
second.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abolhassani:2021:DGA,
author = "Bahman Abolhassani and John Tadrous and Atilla
Eryilmaz",
title = "Delay Gain Analysis of Wireless Multicasting for
Content Distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "529--542",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3039634",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3039634",
abstract = "In this work, we provide a comprehensive analysis of
stability properties and delay gains that wireless
multicasting capabilities, as opposed to more
traditional unicast transmissions, can provide for
content distribution in mobile networks. In
particular,. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cheng:2021:LNI,
author = "Fan Cheng and Congtao Wang and Xingyi Zhang and Yun
Yang",
title = "A Local-Neighborhood Information Based Overlapping
Community Detection Algorithm for Large-Scale Complex
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "543--556",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3038756",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3038756",
abstract = "As the size of available networks is continuously
increasing (even with millions of nodes), large-scale
complex networks are receiving significant attention.
While existing overlapping-community detection
algorithms are quite effective in analyzing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:QEI,
author = "Wenjie Li and Sharief M. A. Oteafy and Marwan Fayed
and Hossam S. Hassanein",
title = "Quality of Experience in {ICN}: Keep Your Low- Bitrate
Close and High-Bitrate Closer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "557--570",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3044995",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3044995",
abstract = "Recent studies into streaming media delivery suggest
that performance gains from ubiquitous caching in
Information-Centric Networks (ICN) may be negated by
Dynamic Adaptive Streaming (DAS), the de facto method
for retrieving multimedia content. Bitrate \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiang:2021:ODL,
author = "Qiao Xiang and Haitao Yu and James Aspnes and Franck
Le and Chin Guok and Linghe Kong and Y. Richard Yang",
title = "Optimizing in the Dark: Learning Optimal Network
Resource Reservation Through a Simple Request
Interface",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "571--584",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3045595",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3045595",
abstract = "Network resource reservation systems are being
developed and deployed, driven by the demand and
substantial benefits of providing performance
predictability for modern distributed applications.
However, existing systems suffer limitations: They
either are \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2021:PPS,
author = "Xin Wang and Yinlong Xu and Richard T. B. Ma",
title = "Paid Peering, Settlement-Free Peering, or Both?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "585--594",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3045220",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3045220",
abstract = "With the rapid growth of congestion-sensitive and
data-intensive applications, traditional
settlement-free peering agreements with best-effort
delivery often do not meet the QoS requirements of
content providers (CPs). Meanwhile, Internet access
providers \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2021:CCD,
author = "Liekang Zeng and Xu Chen and Zhi Zhou and Lei Yang and
Junshan Zhang",
title = "{CoEdge}: Cooperative {DNN} Inference With Adaptive
Workload Partitioning Over Heterogeneous Edge Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "595--608",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3042320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3042320",
abstract = "Recent advances in artificial intelligence have driven
increasing intelligent applications at the network
edge, such as smart home, smart factory, and smart
city. To deploy computationally intensive Deep Neural
Networks (DNNs) on resource-constrained edge \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cohen:2021:ASN,
author = "Itamar Cohen and Gil Einziger and Roy Friedman and
Gabriel Scalosub",
title = "Access Strategies for Network Caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "609--622",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3043280",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3043280",
abstract = "Having multiple data stores that can potentially serve
content is common in modern networked applications.
Data stores often publish approximate summaries of
their content to enable effective utilization. Since
these summaries are not entirely accurate, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:CPR,
author = "Menghao Zhang and Guanyu Li and Lei Xu and Jiasong Bai
and Mingwei Xu and Guofei Gu and Jianping Wu",
title = "Control Plane Reflection Attacks and Defenses in
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "623--636",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3040773",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3040773",
abstract = "Software-Defined Networking (SDN) continues to be
deployed spanning from enterprise data centers to cloud
computing with the proliferation of various SDN-enabled
hardware switches and dynamic control plane
applications. However, state-of-the-art SDN-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chiesa:2021:FRP,
author = "Marco Chiesa and Roshan Sedar and Gianni Antichi and
Michael Borokhovich and Andrzej Kamisi{\'n}ski and
Georgios Nikolaidis and Stefan Schmid",
title = "Fast {ReRoute} on Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "637--650",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3045293",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3045293",
abstract = "Highly dependable communication networks usually rely
on some kind of Fast Re-Route (FRR) mechanism which
allows to quickly re-route traffic upon failures,
entirely in the data plane. This paper studies the
design of FRR mechanisms for emerging \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Casale:2021:PAM,
author = "Giuliano Casale and Nicolas Gast",
title = "Performance Analysis Methods for List-Based Caches
With Non-Uniform Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "651--664",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3042869",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3042869",
abstract = "List-based caches can offer lower miss rates than
single-list caches, but their analysis is challenging
due to state space explosion. In this setting, we
propose novel methods to analyze performance for a
general class of list-based caches with tree \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2021:ESN,
author = "Jing Hou and Li Sun and Tao Shu and Yong Xiao and
Marwan Krunz",
title = "Economics of Strategic Network Infrastructure Sharing:
a Backup Reservation Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "665--680",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3044875",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3044875",
abstract = "In transitioning to 5G, the high infrastructure cost,
the need for fast rollout of new services, and the
frequent technology/system upgrades triggered wireless
operators to consider adopting the cost-effective
network infrastructure sharing (NIS), even \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2021:EEE,
author = "Libin Liu and Hong Xu",
title = "{Elasecutor}: Elastic Executor Scheduling in Data
Analytics Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "681--694",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3050927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3050927",
abstract = "Modern data analytics systems use long-running
executors to run an application&\#x2019;s entire DAG.
Executors exhibit salient time-varying resource
requirements. Yet, existing schedulers simply reserve
resources for executors statically, and use the peak
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{He:2021:PBA,
author = "Lin He and Gang Ren and Ying Liu and Jiahai Yang",
title = "{PAVI}: Bootstrapping Accountability and Privacy to
{IPv6} {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "695--708",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3047667",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3047667",
abstract = "Accountability and privacy are considered valuable but
conflicting properties in the Internet, which at
present does not provide native support for either.
Past efforts to balance accountability and privacy in
the Internet have unsatisfactory \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2021:SCG,
author = "Qian Ma and Edmund Yeh and Jianwei Huang",
title = "Selfish Caching Games on Directed Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "709--722",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3047940",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3047940",
abstract = "Caching networks can reduce the routing costs of
accessing contents by caching contents closer to users.
However, cache nodes may belong to different entities
and behave selfishly to maximize their own benefits,
which often lead to performance degradation \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Meng:2021:PDH,
author = "Zili Meng and Yaning Guo and Yixin Shen and Jing Chen
and Chao Zhou and Minhu Wang and Jia Zhang and Mingwei
Xu and Chen Sun and Hongxin Hu",
title = "Practically Deploying Heavyweight Adaptive Bitrate
Algorithms With Teacher-Student Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "723--736",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3048666",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3048666",
abstract = "Major commercial client-side video players employ
adaptive bitrate (ABR) algorithms to improve the user
quality of experience (QoE). With the evolvement of ABR
algorithms, increasingly complex methods such as neural
networks have been adopted to pursue \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Joshi:2021:SRA,
author = "Gauri Joshi and Dhruva Kaushal",
title = "Synergy via Redundancy: Adaptive Replication
Strategies and Fundamental Limits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "737--749",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3047513",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3047513",
abstract = "The maximum possible throughput (or the rate of job
completion) of a multi-server system is typically the
sum of the service rates of individual servers. Recent
work shows that launching multiple replicas of a job
and canceling them as soon as one copy \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bae:2021:LSN,
author = "Jeongmin Bae and Joohyun Lee and Song Chong",
title = "Learning to Schedule Network Resources Throughput and
Delay Optimally Using {Q$^+$}-Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "750--763",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3051663",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3051663",
abstract = "As network architecture becomes complex and the user
requirement gets diverse, the role of efficient network
resource management becomes more important. However,
existing throughput-optimal scheduling algorithms such
as the max-weight algorithm suffer \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:MSE,
author = "Shaoran Li and Yan Huang and Chengzhang Li and Brian
A. Jalaian and Y. Thomas Hou and Wenjing Lou and
Stephen Russell",
title = "Maximize Spectrum Efficiency in Underlay Coexistence
With Channel Uncertainty",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "764--778",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3047760",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3047760",
abstract = "We consider an underlay coexistence scenario where
secondary users (SUs) must keep their interference to
the primary users (PUs) under control. However, the
channel gains from the PUs to the SUs are uncertain due
to a lack of cooperation between the PUs \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Farhadi:2021:SPR,
author = "Vajiheh Farhadi and Fidan Mehmeti and Ting He and
Thomas F. {La Porta} and Hana Khamfroush and Shiqiang
Wang and Kevin S. Chan and Konstantinos Poularakis",
title = "Service Placement and Request Scheduling for
Data-Intensive Applications in Edge Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "779--792",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3048613",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3048613",
abstract = "Mobile edge computing provides the opportunity for
wireless users to exploit the power of cloud computing
without a large communication delay. To serve
data-intensive applications (e.g., video analytics,
machine learning tasks) from the edge, we need, in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2021:DCS,
author = "Yong Huang and Wei Wang and Tao Jiang and Qian Zhang",
title = "Detecting Colluding {Sybil} Attackers in Robotic
Networks Using Backscatters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "793--804",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3048126",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3048126",
abstract = "Due to the openness of wireless medium, robotic
networks that consist of many miniaturized robots are
susceptible to Sybil attackers, who can fabricate
myriads of fictitious robots. Such detrimental attacks
can overturn the fundamental trust assumption in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shabtai:2021:RAS,
author = "Galia Shabtai and Danny Raz and Yuval Shavitt",
title = "Risk Aware Stochastic Placement of Cloud Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "805--820",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3052962",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3052962",
abstract = "Allocating the right amount of resources to each
service in any of the datacenters in a cloud
environment is a very difficult task. This task becomes
much harder due to the dynamic nature of the workload
and the fact that while long term statistics about
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chi:2021:SBD,
author = "Zicheng Chi and Yan Li and Hongyu Sun and Zhichuan
Huang and Ting Zhu",
title = "Simultaneous Bi-Directional Communications and Data
Forwarding Using a Single {ZigBee} Data Stream",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "821--833",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3054339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3054339",
abstract = "With the exponentially increasing number of Internet
of Things (IoT) devices and the huge volume of data
generated by these devices, there is a pressing need to
investigate a more efficient communication method in
both frequency and time domains at the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fan:2021:RWB,
author = "Fujie Fan and Hangyu Meng and Bing Hu and Kwan L.
Yeung and Zhifeng Zhao",
title = "Roulette Wheel Balancing Algorithm With Dynamic
Flowlet Switching for Multipath Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "834--847",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3051995",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3051995",
abstract = "Load balance is an important issue in datacenter
networks. The flowlet-based algorithms can balance the
traffic with fine granularity and does not suffer the
packet mis-sequencing problem. But their performances
are rather limited or require extra \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jahanian:2021:NSA,
author = "Mohammad Jahanian and K. K. Ramakrishnan",
title = "Name Space Analysis: Verification of Named Data
Network Data Planes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "848--861",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3050769",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3050769",
abstract = "Named Data Networking (NDN) has many forwarding
behaviors, strategies, and protocols to enable the
benefits of Information-Centric Networking. This
additional functionality introduces complexity,
motivating the need for a tool to help reason about and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:PRP,
author = "Che-Hao Yu and Lin Huang and Cheng-Shang Chang and
Duan-Shin Lee",
title = "{Poisson} Receivers: a Probabilistic Framework for
Analyzing Coded Random Access",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "862--875",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3050485",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3050485",
abstract = "In this article, we develop a probabilistic framework
for analyzing coded random access. Our framework is
based on a new abstract receiver (decoder), called a
Poisson receiver, that is characterized by a success
probability function of a tagged packet \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2021:COC,
author = "Ming Shi and Xiaojun Lin and Sonia Fahmy",
title = "Competitive Online Convex Optimization With Switching
Costs and Ramp Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "876--889",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3053910",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3053910",
abstract = "We investigate competitive online algorithms for
online convex optimization (OCO) problems with linear
in-stage costs, switching costs and ramp constraints.
While OCO problems have been extensively studied in the
literature, there are limited results on \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2021:TMO,
author = "Xiaofeng Shi and Haofan Cai and Minmei Wang and Ge
Wang and Baiwen Huang and Junjie Xie and Chen Qian",
title = "{TagAttention}: Mobile Object Tracing With Zero
Appearance Knowledge by Vision-{RFID} Fusion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "2",
pages = "890--903",
month = apr,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3052805",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jun 15 09:48:17 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3052805",
abstract = "We propose to study mobile object tracing, which
allows a mobile system to report the shape, location,
and trajectory of the mobile objects appearing in a
video camera and identifies each of them with its
cyber-identity (ID), even if the appearances of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ruby:2021:SEE,
author = "Rukhsana Ruby and Shuxin Zhong and Basem M. ElHalawany
and Hanjiang Luo and Kaishun Wu",
title = "{SDN-Enabled} Energy-Aware Routing in Underwater
Multi-Modal Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "965--978",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056772",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056772",
abstract = "Despite extensive research efforts, underwater sensor
networks (UWSNs) still suffer from serious performance
issues due to their inefficient and uncoordinated
channel access and resource management. For example,
due to the lack of holistic knowledge on \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Farkiani:2021:PDD,
author = "Behrooz Farkiani and Bahador Bakhshi and S. Ali
MirHassani and Tim Wauters and Bruno Volckaert and
Filip {De Turck}",
title = "Prioritized Deployment of Dynamic Service Function
Chains",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "979--993",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3055074",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3055074",
abstract = "Service Function Chaining and Network Function
Virtualization are enabling technologies that provide
dynamic network services with diverse QoS requirements.
Regarding the limited infrastructure resources, service
providers need to prioritize service \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:EIA,
author = "Dongxiao Yu and Yifei Zou and Yong Zhang and Hao Sheng
and Weifeng Lv and Xiuzhen Cheng",
title = "An Exact Implementation of the Abstract {MAC} Layer
via Carrier Sensing in Dynamic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "994--1007",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3057890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3057890",
abstract = "In this paper, we present the first algorithm to
precisely implement the abstract MAC (absMAC) layer
under the physical SINR model in dynamic networks. The
absMac layer, first presented by (Kuhn {$<$ italic$>$
et} {al$<$}/{italic$>$}., 2009), provides reliable
local \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lou:2021:BHA,
author = "Jiadong Lou and Xu Yuan and Sastry Kompella and
Nian-Feng Tzeng",
title = "Boosting or Hindering: {AoI} and Throughput
Interrelation in Routing-Aware Multi-Hop Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1008--1021",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3059694",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3059694",
abstract = "While considerable work has addressed the optimal AoI
under different circumstances in single-hop networks,
the exploration of AoI in multi-hop wireless networks
is rarely attempted. More importantly, the inherent
relationships between AoI and throughput \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2021:ECD,
author = "Chien-Sheng Yang and Ramtin Pedarsani and A. Salman
Avestimehr",
title = "Edge Computing in the Dark: Leveraging
Contextual-Combinatorial Bandit and Coded Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1022--1031",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058685",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058685",
abstract = "With recent advancements in edge computing
capabilities, there has been a significant increase in
utilizing the edge cloud for event-driven and
time-sensitive computations. However, large-scale edge
computing networks can suffer substantially from
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ali:2021:DSS,
author = "Kamran Ali and Alex X. Liu and Ioannis Pefkianakis and
Kyu-Han Kim",
title = "Distributed Spectrum Sharing for Enterprise Powerline
Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1032--1045",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056512",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056512",
abstract = "As powerline communication (PLC) technology does not
require dedicated cabling and network setup, it can be
used to easily connect multitude of IoT devices
deployed in enterprise environments for sensing and
control related applications. IEEE has \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:PPD,
author = "Mengyuan Zhang and Lei Yang and Shibo He and Ming Li
and Junshan Zhang",
title = "Privacy-Preserving Data Aggregation for Mobile
Crowdsensing With Externality: an Auction Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1046--1059",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056490",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056490",
abstract = "We develop an auction framework for privacy-preserving
data aggregation in mobile crowdsensing, where the
platform plays the role as an auctioneer to recruit
workers for sensing tasks. The workers are allowed to
report noisy versions of their data for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Saha:2021:ODS,
author = "Gourav Saha and Alhussein A. Abouzeid and Zaheer Khan
and Marja Matinmikko-Blue",
title = "On the Optimal Duration of Spectrum Leases in
Exclusive License Markets With Stochastic Demand",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1060--1073",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3060088",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3060088",
abstract = "This paper addresses the following question which is
of interest in designing efficient exclusive-use
spectrum licenses sold through spectrum auctions. Given
a system model in which customer demand, revenue, and
bids of wireless operators are \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abdelmoniem:2021:RFR,
author = "Ahmed M. Abdelmoniem and Brahim Bensaou",
title = "{T-RACKs}: a Faster Recovery Mechanism for {TCP} in
Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1074--1087",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3059913",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3059913",
abstract = "Cloud interactive data-driven applications generate
swarms of small TCP flows that compete for the small
switch buffer space in data-center. Such applications
require a small flow completion time (FCT) to be
effective. Unfortunately, TCP is myopic with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2021:OMV,
author = "Tianming Zhao and Weisheng Si and Wei Li and Albert Y.
Zomaya",
title = "Optimizing the Maximum Vertex Coverage Attacks Under
Knapsack Constraint",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1088--1104",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056450",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056450",
abstract = "Only when we understand how hackers think, can we
defend against their attacks. Towards this end, this
paper studies the cyber-attacks that aim to remove
nodes or links from network topologies. We particularly
focus on one type of such attacks called \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ricardo:2021:CPD,
author = "Guilherme Iecker Ricardo and Alina Tuholukova and
Giovanni Neglia and Thrasyvoulos Spyropoulos",
title = "Caching Policies for Delay Minimization in Small Cell
Networks With Coordinated Multi-Point Joint
Transmissions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1105--1115",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3062269",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3062269",
abstract = "In 5G and beyond network architectures, operators and
content providers base their content distribution
strategies on Heterogeneous Networks, where macro and
small cells are combined to offer better Quality of
Service to wireless users. On top of such \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rozic:2021:OPC,
author = "{\'C}iril Ro{\v{z}}i{\'c} and Galen Sasaki",
title = "Optical Protection Cost of Loop Free Alternates on
Completely Connected {IP} Networks Over Optical Rings",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1116--1127",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3061515",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3061515",
abstract = "We consider protection switching in an IP over optical
network. There is IP Fast Reroute Loop-free Alternates
(IP FRR LFA) at the IP layer, and protection switching
at the optical layer. Our network model assumes a
completely connected IP network over an \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2021:PBC,
author = "Meng Jin and Yuan He and Chengkun Jiang and Yunhao
Liu",
title = "Parallel Backscatter: Channel Estimation and Beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1128--1140",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058977",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058977",
abstract = "As backscatter-based IoT applications get
proliferated, how to exploit backscattered signals for
efficient sensing becomes a significant issue.
Backscatter-based sensing requires accurate estimation
of a backscatter channel (phase and amplitude), which
is \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Demianiuk:2021:APC,
author = "Vitalii Demianiuk and Kirill Kogan and Sergey
Nikolenko",
title = "Approximate Packet Classifiers With Controlled
Accuracy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1141--1154",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056948",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056948",
abstract = "Performing exact computations can require significant
resources. {$<$ italic$>$Approximate}
{computing$<$}/{italic$>$} allows to alleviate resource
constraints, sacrificing the accuracy of results. In
this work, we consider a generalization of the
classical {$<$ italic$>$}. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Boche:2021:ASC,
author = "Holger Boche and Rafael F. Schaefer and H. Vincent
Poor",
title = "On the Algorithmic Solvability of Channel Dependent
Classification Problems in Communication Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1155--1168",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3059920",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3059920",
abstract = "For communication systems there is a recent trend
towards shifting functionalities from the physical
layer to higher layers by enabling software-focused
solutions. Having obtained a (physical layer-based)
description of the communication channel, such
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2021:ICC,
author = "Dan Xia and Xiaolong Zheng and Liang Liu and Chaoyu
Wang and Huadong Ma",
title = "{{\em $c$--Chirp\/}}: Towards Symmetric
Cross-Technology Communication Over Asymmetric
Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1169--1182",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3061083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3061083",
abstract = "Cross-Technology Communication (CTC) is an emerging
technique that enables direct interconnection among
incompatible wireless technologies. However, CTC
channels are inherently asymmetric because of either
the one-way nature of emulation or the asymmetric
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2021:MPR,
author = "Jiawei Huang and Wenjun Lyu and Weihe Li and Jianxin
Wang and Tian He",
title = "Mitigating Packet Reordering for Random Packet
Spraying in Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1183--1196",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3056601",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3056601",
abstract = "Modern data center networks are usually constructed in
multi-rooted tree topologies, which require the highly
efficient multi-path load balancing to achieve high
link utilization. Recent packet-level load balancer
obtains high throughput by spraying \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2021:CIA,
author = "Yang Yang and Yanjiao Chen and Fei Chen",
title = "A Compressive Integrity Auditing Protocol for Secure
Cloud Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1197--1209",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058130",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058130",
abstract = "With the widespread application of cloud storage,
ensuring the integrity of user outsourced data catches
more and more attention. To remotely check the
integrity of cloud storage, plenty of protocols have
been proposed, implemented by checking the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Naveen:2021:DAM,
author = "K. P. Naveen and Rajesh Sundaresan",
title = "Double-Auction Mechanisms for Resource Trading
Markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1210--1223",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058251",
abstract = "We consider a double-auction mechanism, which was
recently proposed in the context of rate allocation in
mobile data-offloading markets; our mechanism is also
applicable to the problem of bandwidth allocation in
network slicing markets. Network operators \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Singh:2021:ACD,
author = "Rahul Singh and P. R. Kumar",
title = "Adaptive {CSMA} for Decentralized Scheduling of
Multi-Hop Networks With End-to-End Deadline
Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1224--1237",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3063626",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3063626",
abstract = "Consider a multihop wireless network serving multiple
flows in which wireless interference constraints
between links are described by a link-interference
graph. The timely-throughput of a flow is defined as
the throughput of packets of that flow that \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sallam:2021:JPA,
author = "Gamal Sallam and Bo Ji",
title = "Joint Placement and Allocation of {VNF} Nodes With
Budget and Capacity Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1238--1251",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058378",
abstract = "With the advent of Network Function Virtualization
(NFV), network services that traditionally run on
proprietary dedicated hardware can now be realized
using Virtual Network Functions (VNFs) that are hosted
on general-purpose commodity hardware. This new
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{An:2021:IUR,
author = "Zhenlin An and Lei Yang and Qiongzheng Lin",
title = "Identifying {UHF RFIDs} in Range of Readers With
{WiFi}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1252--1265",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3057392",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3057392",
abstract = "Recent advances in Cross-Technology Communication
(CTC) have improved efficient cooperation among
heterogeneous wireless devices. To date, however, even
the most effective CTC systems require these devices to
operate in the same ISM band (e.g., 2.4GHz) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Alasmar:2021:ITV,
author = "Mohammed Alasmar and Richard Clegg and Nickolay
Zakhleniuk and George Parisis",
title = "{Internet} Traffic Volumes are Not {Gaussian} --- They
are Log-Normal: an 18-Year Longitudinal Study With
Implications for Modelling and Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1266--1279",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3059542",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3059542",
abstract = "Getting good statistical models of traffic on network
links is a well-known, often-studied problem. A lot of
attention has been given to correlation patterns and
flow duration. The distribution of the amount of
traffic per unit time is an equally \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tan:2021:RBC,
author = "Haisheng Tan and Chi Zhang and Chao Xu and Yupeng Li
and Zhenhua Han and Xiang-Yang Li",
title = "Regularization-Based Coflow Scheduling in Optical
Circuit Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1280--1293",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058164",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058164",
abstract = "To improve the application-level data efficiency, the
scheduling of coflows, defined as a collection of
parallel flows sharing the same objective, is
prevailing in recent data centers. Meanwhile, optical
circuit switches (OCS) are gradually applied to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chiu:2021:SDA,
author = "Cho-Chun Chiu and Ting He",
title = "Stealthy {DGoS} Attack: {DeGrading} of Service Under
the Watch of Network Tomography",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1294--1307",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058230",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058230",
abstract = "Network tomography is a powerful tool to monitor the
internal state of a closed network that cannot be
measured directly, with broad applications in the
Internet, overlay networks, and all-optical networks.
However, existing network tomography solutions
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2021:HFH,
author = "Deke Guo and Junjie Xie and Xiaofeng Shi and Haofan
Cai and Chen Qian and Honghui Chen",
title = "{HDS}: a Fast Hybrid Data Location Service for
Hierarchical Mobile Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1308--1320",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3058401",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058401",
abstract = "The hierarchical mobile edge computing satisfies the
stringent latency requirements of data access and
processing for emerging edge applications. The data
location service is a basic function to provide data
storage and retrieval to enable these \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2021:CIU,
author = "Feihong Yang and Yuan Shen",
title = "Critical Intensity for Unbounded Sequential
Localizability",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1321--1334",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3059743",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3059743",
abstract = "Locations of mobile agents are often requisite
information for wireless applications such as sensor
networks and Internet of Things (IoT). As the network
size increases, verifying the localizability of all
nodes in a network quickly becomes intractable.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xin:2021:CCD,
author = "Liangxiao Xin and David Starobinski",
title = "Countering Cascading Denial of Service Attacks on
{Wi-Fi} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1335--1348",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3062363",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3062363",
abstract = "Recent work demonstrates that IEEE 802.11 networks are
vulnerable to cascading DoS attacks, wherein a single
node can remotely and suddenly congest an entire
network. In this paper, we propose, analyze, simulate,
and experimentally verify a counter-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Limbasiya:2021:MSE,
author = "Trupil Limbasiya and Debasis Das and Sajal K. Das",
title = "{MComIoV}: Secure and Energy-Efficient Message
Communication Protocols for {Internet} of Vehicles",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1349--1361",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3062766",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3062766",
abstract = "The Internet of Vehicles (IoV) offers an emerging
paradigm that deals with interconnected vehicles
interacting with the infrastructure, roadside units
(RSUs), sensors, and mobile devices with a goal to
sense, compute, store, and transmit vital information
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mohanti:2021:WMW,
author = "Subhramoy Mohanti and Elif Bozkaya and M. Yousof
Naderi and Berk Canberk and Gokhan Secinti and Kaushik
R. Chowdhury",
title = "{WiFED} Mobile: {WiFi} Friendly Energy Delivery With
Mobile Distributed Beamforming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "3",
pages = "1362--1375",
month = jun,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3061082",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:12 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3061082",
abstract = "Wireless RF energy transfer for indoor sensors is an
emerging paradigm ensuring continuous operation without
battery limitations. However, high power radiation
within ISM band interferes with packet reception for
existing WiFi devices. The paper proposes \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2021:LCM,
author = "Jinwei Liu and Haiying Shen and Hongmei Chi and Husnu
S. Narman and Yongyi Yang and Long Cheng and Wingyan
Chung",
title = "A Low-Cost Multi-Failure Resilient Replication Scheme
for High-Data Availability in Cloud Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1436--1451",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2020.3027814",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3027814",
abstract = "Data availability is one of the most important
performance factors in cloud storage systems. To
enhance data availability, replication is a common
approach to handle the machine failures. However,
previously proposed replication schemes cannot
effectively \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gu:2021:AOO,
author = "Yan Gu and Bo Liu and Xiaojun Shen",
title = "Asymptotically Optimal Online Scheduling With
Arbitrary Hard Deadlines in Multi-Hop Communication
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1452--1466",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3065703",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3065703",
abstract = "This paper firstly proposes a greedy online packet
scheduling algorithm for the problem raised by Mao,
Koksal and Shroff that allows arbitrary hard deadlines
in multi-hop networks aiming at maximizing the total
revenue. With the same assumption of {$<$ inline}-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Behrouzi-Far:2021:ERF,
author = "Amir Behrouzi-Far and Emina Soljanin",
title = "Efficient Replication for Fast and Predictable
Performance in Distributed Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1467--1476",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3062215",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3062215",
abstract = "Master-worker distributed computing systems use task
replication to mitigate the effect of slow workers on
job compute time. The master node groups tasks into
batches and assigns each batch to one or more workers.
We first assume that the batches do not \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ye:2021:CBM,
author = "Jiancheng Ye and Ka-Cheong Leung and Steven H. Low",
title = "Combating Bufferbloat in Multi-Bottleneck Networks:
Theory and Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1477--1493",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3066505",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3066505",
abstract = "Bufferbloat is a phenomenon in computer networks where
large router buffers are frequently filled up,
resulting in high queueing delay and delay variation.
More and more delay-sensitive applications on the
Internet have made this phenomenon a pressing
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gopal:2021:CAT,
author = "Sneihil Gopal and Sanjit K. Kaul and Rakesh Chaturvedi
and Sumit Roy",
title = "Coexistence of Age and Throughput Optimizing Networks:
a Spectrum Sharing Game",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1494--1508",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3067900",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3067900",
abstract = "We investigate the coexistence of an age optimizing
network (AON) and a throughput optimizing network (TON)
that share a common spectrum band. We consider two
modes of long run coexistence: (a) networks {$<$
italic$>$ compete$<$}/{italic$>$} with each other for
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:EPF,
author = "Guanyu Li and Menghao Zhang and Shicheng Wang and
Chang Liu and Mingwei Xu and Ang Chen and Hongxin Hu
and Guofei Gu and Qi Li and Jianping Wu",
title = "Enabling Performant, Flexible and Cost-Efficient
{DDoS} Defense With Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1509--1526",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3062621",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3062621",
abstract = "Distributed Denial-of-Service (DDoS) attacks have
become a critical threat to the Internet. Due to the
increasing number of vulnerable Internet of Things
(IoT) devices, attackers can easily compromise a large
set of nodes and launch high-volume DDoS \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2021:AFL,
author = "Guanhao Wu and Xiaofeng Gao and Jiaqi Zheng and Guihai
Chen",
title = "Achieving Fast Loop-Free Updates With Ingress Port in
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1527--1539",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3068177",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3068177",
abstract = "Due to the distributed and asynchronous nature in data
plane, the packets can be forwarded into a loop during
routing updates. Software-Defined Networks (SDNs)
enable a controller to schedule the update operations
of routing rules in a loop-free manner. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Neves:2021:DPE,
author = "Miguel Neves and Bradley Huffaker and Kirill Levchenko
and Marinho Barcellos",
title = "Dynamic Property Enforcement in Programmable Data
Planes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1540--1552",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3068339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3068339",
abstract = "Network programmers can currently deploy an arbitrary
set of protocols in forwarding devices through data
plane programming languages such as P4. However, as any
other type of software, P4 programs are subject to bugs
and misconfigurations. Network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2021:OJS,
author = "Huanle Xu and Yang Liu and Wing Cheong Lau",
title = "Optimal Job Scheduling With Resource Packing for
Heterogeneous Servers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1553--1566",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3068201",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3068201",
abstract = "Jobs in modern computing clusters have highly diverse
processing duration and heterogeneous resource
requirements. In this paper, we consider the problem of
job scheduling for a computing cluster comprised of
multiple servers with heterogeneous \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{He:2021:WPL,
author = "Yuan He and Xiuzhen Guo and Jia Zhang and Haotian
Jiang",
title = "{WIDE}: Physical-Level {CTC} via Digital Emulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1567--1579",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3071782",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3071782",
abstract = "Cross-Technology Communication (CTC) is an emerging
technique that enables direct communication across
different wireless technologies. Recent works achieve
physical-level CTC by emulating the standard
time-domain waveform of the receiver. This method
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:MAB,
author = "Ziyao Zhang and Liang Ma and Kin K. Leung and Franck
Le",
title = "More Is Not Always Better: an Analytical Study of
Controller Synchronizations in Distributed {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1580--1590",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3066580",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3066580",
abstract = "Distributed software-defined networks (SDN),
consisting of multiple inter-connected network domains,
each managed by one SDN controller, is an emerging
networking architecture that offers balanced
centralized control and distributed operations. In such
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2021:WFD,
author = "Tingjun Chen and Mahmood Baraani Dastjerdi and Harish
Krishnaswamy and Gil Zussman",
title = "Wideband Full-Duplex Phased Array With Joint Transmit
and Receive Beamforming: Optimization and Rate Gains",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1591--1604",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3069125",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3069125",
abstract = "Full-duplex (FD) wireless and phased arrays are both
promising techniques that can significantly improve
data rates in future wireless networks. However,
integrating FD with transmit (Tx) and receive (Rx)
phased arrays is extremely challenging, due to the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2021:EPL,
author = "Zhe Chen and Xu Zhang and Sulei Wang and Yuedong Xu
and Jie Xiong and Xin Wang",
title = "Enabling Practical Large-Scale {MIMO} in {WLANs} With
Hybrid Beamforming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1605--1619",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3073160",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3073160",
abstract = "In theory, the capacity of a wireless network grows
linearly with the number of users and antennas equipped
at the communication devices, and hence large-scale
MU-MIMO can scale up the network throughput. However,
three main challenges are impeding the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2021:TGC,
author = "Cheng-Shang Chang and Jang-Ping Sheu and Yi-Jheng
Lin",
title = "On the Theoretical Gap of Channel Hopping Sequences
With Maximum Rendezvous Diversity in the Multichannel
Rendezvous Problem",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1620--1633",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3067643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3067643",
abstract = "In the literature, there are several well-known
periodic channel hopping (CH) sequences that can
achieve maximum rendezvous diversity in a cognitive
radio network (CRN). \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chatterjee:2021:PBI,
author = "Bijoy Chand Chatterjee and Abdul Wadud and Imran Ahmed
and Eiji Oki",
title = "Priority-Based Inter-Core and Inter-Mode
Crosstalk-Avoided Resource Allocation for
Spectrally-Spatially Elastic Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1634--1647",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3068212",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3068212",
abstract = "Spectrally-spatially elastic optical networks
(SS-EONs) have been considered nowadays to overcome the
physical barrier and enhance the transport capacity,
where enhancing spectrum utilization while satisfying
inter-core and inter-mode crosstalks is always
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vass:2021:EMS,
author = "Bal{\'a}zs Vass and J{\'a}nos Tapolcai and Erika R.
B{\'e}rczi-Kov{\'a}cs",
title = "Enumerating Maximal Shared Risk Link Groups of
Circular Disk Failures Hitting $k$ Nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1648--1661",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3070100",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3070100",
abstract = "Many recent studies shed light on the vulnerability of
networks against large-scale natural disasters. The
corresponding network failures, called regional
failures, are manifested at failing multiple network
elements that are physically close to each \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zou:2021:DBR,
author = "Yifei Zou and Dongxiao Yu and Jiguo Yu and Yong Zhang
and Falko Dressler and Xiuzhen Cheng",
title = "Distributed {Byzantine}-Resilient Multiple-Message
Dissemination in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1662--1675",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3069324",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3069324",
abstract = "The byzantine model is widely used to depict a variety
of node faults in networks. Previous studies on
byzantine-resilient protocols in wireless networks
assume reliable communications and do not consider the
jamming behavior of byzantine nodes. Such \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:RSX,
author = "Yuhui Zhang and Dejun Yang",
title = "{RobustPay$^+$}: Robust Payment Routing With
Approximation Guarantee in Blockchain-Based Payment
Channel Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1676--1686",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3069725",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3069725",
abstract = "The past decade has witnessed an explosive growth in
cryptocurrencies, but the blockchain-based
cryptocurrencies have also raised many concerns, among
which a crucial one is the scalability issue. Suffering
from the large overhead of global consensus and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:PBM,
author = "Ning Li and Zhaoxin Zhang and Alex X. Liu and Xin Yuan
and Yexia Cheng",
title = "Pairwise-Based Multi-Attribute Decision Making
Approach for Wireless Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1687--1702",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3074002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3074002",
abstract = "In wireless network applications, such as routing
decision, network selection, etc., the Multi-Attribute
Decision Making (MADM) is widely used. The MADM
approach can address the multi-objective decision
making issues effectively. However, when the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tsanikidis:2021:PRS,
author = "Christos Tsanikidis and Javad Ghaderi",
title = "On the Power of Randomization for Scheduling Real-Time
Traffic in Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1703--1716",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3072279",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3072279",
abstract = "In this paper, we consider the problem of scheduling
real-time traffic in wireless networks under a
conflict-graph interference model and single-hop
traffic. The objective is to guarantee that at least a
certain fraction of packets of each link are \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2021:RPB,
author = "Si Chen and Maolin Zhang and Jia Zhao and Wei Gong and
Jiangchuan Liu",
title = "Reliable and Practical {Bluetooth} Backscatter With
Commodity Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1717--1729",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3068865",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3068865",
abstract = "Recently backscatter communication with commodity
radios has received significant attention since
specialized hardware is no longer needed. The
state-of-the-art BLE backscatter system, FreeRider,
realizes ultra-low-power BLE backscatter communication
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vardoyan:2021:TSA,
author = "Gayane Vardoyan and C. V. Hollot and Don Towsley",
title = "Towards Stability Analysis of Data Transport
Mechanisms: a Fluid Model and Its Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1730--1744",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3075837",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075837",
abstract = "The Transmission Control Protocol (TCP) utilizes a
congestion avoidance and control mechanism as a
preventive measure against congestive collapse and as
an adaptive measure in the presence of changing network
conditions. The set of available congestion \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2021:RPD,
author = "Qian Ma and Jianwei Huang and Tamer Ba{\c{s}}ar and Ji
Liu and Xudong Chen",
title = "Reputation and Pricing Dynamics in Online Markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1745--1759",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3071506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3071506",
abstract = "We study the economic interactions among sellers and
buyers in online markets. In such markets, buyers have
limited information about the product quality, but can
observe the sellers&\#x2019; reputations which depend
on their past transaction histories and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:OCD,
author = "Jianan Zhang and Abhishek Sinha and Jaime Llorca and
Antonia M. Tulino and Eytan Modiano",
title = "Optimal Control of Distributed Computing Networks With
Mixed-Cast Traffic Flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1760--1773",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3070699",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3070699",
abstract = "Distributed computing networks, tasked with both
packet transmission and processing, require the joint
optimization of communication and computation
resources. We develop a dynamic control policy that
determines both routes and processing locations for
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kesavareddigari:2021:CIC,
author = "Himaja Kesavareddigari and Atilla Eryilmaz",
title = "Counter-Intuitive Characteristics of Rational
Decision-Making Using Biased Inputs in Information
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1774--1785",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3075430",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075430",
abstract = "We consider an information network comprised of nodes
that are: rational-information-consumers (RICs) and/or
biased-information-providers (BIPs). Making the
reasonable abstraction that any external event is
reported as an answer to a logical statement, we
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kirner:2021:QAI,
author = "Raimund Kirner and Peter Puschner",
title = "A Quantitative Analysis of Interfaces to
Time-Triggered Communication Buses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1786--1797",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3073460",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3073460",
abstract = "Nodes connected to a time-triggered (TT) network can
access the network interface in two different ways,
synchronously or asynchronously, which greatly impacts
communication timing and message lifespans (i.e., the
time from writing a message to its send \ldots{})",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:GIB,
author = "Qiang Li and Zhihao Wang and Dawei Tan and Jinke Song
and Haining Wang and Limin Sun and Jiqiang Liu",
title = "{GeoCAM}: an {IP}-Based Geolocation Service Through
Fine-Grained and Stable Webcam Landmarks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1798--1812",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3073926",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3073926",
abstract = "IP-based geolocation is essential for various
location-aware Internet applications, such as online
advertisement, content delivery, and online fraud
prevention. Achieving accurate geolocation enormously
relies on the number of high-quality (i.e., the fine-.
\ldots{})",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tang:2021:HDY,
author = "Ming Tang and Jianwei Huang",
title = "How Do You Earn Money on Live Streaming {Platforms?
--- A} Study of Donation-Based Markets",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1813--1826",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3071488",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3071488",
abstract = "Donation-based markets have been implemented by many
online platforms, such as live streaming platforms. In
these markets, producers provide services without
mandatory charges, and customers enjoy the services and
voluntarily donate money to the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2021:PLA,
author = "Ning Xie and Haijun Tan and Lei Huang and Alex X.
Liu",
title = "Physical-Layer Authentication in Wirelessly Powered
Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1827--1840",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3071670",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3071670",
abstract = "This paper addresses the problem of authenticating the
transmitter device in wirelessly powered communications
networks (WPCNs). We proposed a physical-layer
authentication scheme for a WPCN. In comparison with
upper-layer authentication schemes, the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tan:2021:AOO,
author = "Haisheng Tan and Shaofeng H.-C. Jiang and Zhenhua Han
and Mingxia Li",
title = "Asymptotically Optimal Online Caching on Multiple
Caches With Relaying and Bypassing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "4",
pages = "1841--1852",
month = aug,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3077115",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3077115",
abstract = "Motivated by practical scenarios in areas such as
Mobile Edge Computing (MEC) and Content Delivery
Networks (CDNs), we study online file caching on {$<$
italic$>$ multiple$<$}/{italic$>$} caches, where a file
request might be relayed to other caches or bypassed
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Duong:2021:EMB,
author = "Huy Duong and Brigitte Jaumard and David Coudert and
Romualdas Armolavicius",
title = "Efficient Make-Before-Break Layer 2 Reoptimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1910--1921",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078581",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078581",
abstract = "Optical multilayer optimization periodically
reorganizes layer 0-1-2 network elements to handle both
existing and dynamic traffic requirements in the most
efficient manner. This delays the need for adding new
resources in order to cope with the evolution
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2021:DLG,
author = "Dianqi Han and Ang Li and Lili Zhang and Yan Zhang and
Jiawei Li and Tao Li and Ting Zhu and Yanchao Zhang",
title = "Deep Learning-Guided Jamming for Cross-Technology
Wireless Networks: Attack and Defense",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1922--1932",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3082839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3082839",
abstract = "Wireless networks of different technologies may
interfere with each other when they are deployed at
proximity. Such cross-technology interference (CTI) has
become prevalent with the surge of IoT devices. In this
paper, we exploit CTI in coexisting WiFi-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tariq:2021:ATC,
author = "Isfar Tariq and Rajat Sen and Thomas Novlan and Salam
Akoum and Milap Majmundar and Gustavo de Veciana and
Sanjay Shakkottai",
title = "Auto-Tuning for Cellular Scheduling Through
Bandit-Learning and Low-Dimensional Clustering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1933--1947",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3077455",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3077455",
abstract = "We propose an online algorithm for clustering
channel-states and learning the associated achievable
multiuser rates. Our motivation stems from the
complexity of multiuser scheduling. For instance,
MU-MIMO scheduling involves the selection of a user
subset \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Saha:2021:OSP,
author = "Gourav Saha and Alhussein A. Abouzeid",
title = "Optimal Spectrum Partitioning and Licensing in Tiered
Access Under Stochastic Market Models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1948--1961",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3077643",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3077643",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ornee:2021:SRE,
author = "Tasmeen Zaman Ornee and Yin Sun",
title = "Sampling and Remote Estimation for the
{Ornstein--Uhlenbeck} Process Through Queues: Age of
Information and Beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1962--1975",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078137",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078137",
abstract = "Recently, a connection between the age of information
and remote estimation error was found in a sampling
problem of Wiener processes: If the sampler has no
knowledge of the signal being sampled, the optimal
sampling strategy is to minimize the age of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pan:2021:NCN,
author = "Tian Pan and Xingchen Lin and Enge Song and Cheng Xu
and Jiao Zhang and Hao Li and Jianhui Lv and Tao Huang
and Bin Liu and Beichuan Zhang",
title = "{NB-Cache}: Non-Blocking In-Network Caching for
High-Performance Content Routers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1976--1989",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3083599",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3083599",
abstract = "Information-Centric Networking (ICN) provides scalable
and efficient content distribution at the Internet
scale due to in-network caching and native multicast.
To support these features, a content router needs high
performance at its data plane, which \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2021:MAE,
author = "Wei Sun and Lisong Xu and Sebastian Elbaum and Di
Zhao",
title = "Model-Agnostic and Efficient Exploration of Numerical
Congestion Control State Space of Real-World {TCP}
Implementations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "1990--2004",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078161",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078161",
abstract = "The significant impact of TCP congestion control on
the Internet highlights the importance of testing
congestion control algorithm implementations (CCAIs) in
various network environments. Many CCAI testing
problems can be solved by exploring the numerical
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:HHP,
author = "Dai Zhang and Yu Zhou and Zhaowei Xi and Yangyang Wang
and Mingwei Xu and Jianping Wu",
title = "{HyperTester}: High-Performance Network Testing Driven
by Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2005--2018",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3077652",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3077652",
abstract = "Modern network devices and systems are raising higher
requirements on network testers that are regularly used
to evaluate performance and assess correctness. These
requirements include high scale, high accuracy,
flexibility and low cost, which existing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2021:NAO,
author = "Su Wang and Yichen Ruan and Yuwei Tu and Satyavrat
Wagle and Christopher G. Brinton and Carlee Joe-Wong",
title = "Network-Aware Optimization of Distributed Learning for
Fog Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2019--2032",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3075432",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075432",
abstract = "Fog computing promises to enable machine learning
tasks to scale to large amounts of data by distributing
processing across connected devices. Two key challenges
to achieving this goal are (i) heterogeneity in
devices&\#x2019; compute resources and (ii) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2021:TOP,
author = "I-Chieh Lin and Yu-Hsuan Yeh and Kate Ching-Ju Lin",
title = "Toward Optimal Partial Parallelization for Service
Function Chaining",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2033--2044",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3075709",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075709",
abstract = "The emergence of Network Function Virtualization (NFV)
and Service Function Chaining (SFC) together enable
flexible and agile network management and traffic
engineering. Due to the sequential execution nature of
SFC, the latency would grow linearly with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2021:FDS,
author = "Zai Shi and Atilla Eryilmaz",
title = "A Flexible Distributed Stochastic Optimization
Framework for Concurrent Tasks in Processing Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2045--2058",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078054",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078054",
abstract = "Distributed stochastic optimization has important
applications in the practical implementation of machine
learning and signal processing setup by providing means
to allow interconnected network of processors to work
towards the optimization of a global \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2021:IMM,
author = "Xuwei Yang and Hongli Xu and Shigang Chen and He
Huang",
title = "Indirect Multi-Mapping for Burstiness Management in
Software Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2059--2072",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078132",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078132",
abstract = "Large software defined networks use a cluster of
distributed controllers to process flow requests from a
massive number of switches. To cope with traffic
dynamics, this paper studies a new problem of how to
improve the residual capacity available at the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2021:SEN,
author = "He Huang and Yu-E Sun and Chaoyi Ma and Shigang Chen
and Yang Du and Haibo Wang and Qingjun Xiao",
title = "Spread Estimation With Non-Duplicate Sampling in
High-Speed Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2073--2086",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078725",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078725",
abstract = "Per-flow spread measurement in high-speed networks has
many practical applications. It is a more difficult
problem than the traditional per-flow size measurement.
Most prior work is based on sketches, focusing on
reducing their space requirements in order \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Thimmaraju:2021:PNP,
author = "Kashyap Thimmaraju and Liron Schiff and Stefan
Schmid",
title = "Preacher: Network Policy Checker for Adversarial
Environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2087--2100",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3078143",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3078143",
abstract = "Private networks are typically assumed to be trusted
as security mechanisms are usually deployed on hosts
and the data plane is managed in-house. The increasing
number of attacks on network devices, and recent
reports on backdoors, forces us to revisit \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Barrachina-Munoz:2021:WFC,
author = "Sergio Barrachina-Mu{\~n}oz and Boris Bellalta and
Edward W. Knightly",
title = "{Wi-Fi} Channel Bonding: an All-Channel System and
Experimental Study From Urban Hotspots to a Sold-Out
Stadium",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2101--2114",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3077770",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3077770",
abstract = "In this paper, we present WACA, the first system to
simultaneously measure all 24 Wi-Fi channels that allow
channel bonding at 5 GHz with microsecond scale
granularity. With WACA, we perform a first-of-its-kind
measurement study in areas including urban \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:OAI,
author = "Qixia Zhang and Fangming Liu and Chaobing Zeng",
title = "Online Adaptive Interference-Aware {VNF} Deployment
and Migration for {5G} Network Slice",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2115--2128",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3080197",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3080197",
abstract = "Based on network function virtualization (NFV) and
software defined network (SDN), {$<$ italic$>$ network}
{slicing$<$}/{italic$>$} is proposed as a new paradigm
for building service-customized 5G network. In each
network slice, service-required virtual network
functions \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bedewy:2021:LPS,
author = "Ahmed M. Bedewy and Yin Sun and Rahul Singh and Ness
B. Shroff",
title = "Low-Power Status Updates via Sleep-Wake Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2129--2141",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3081102",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3081102",
abstract = "We consider the problem of optimizing the freshness of
status updates that are sent from a large number of
low-power sources to a common access point. The source
nodes utilize carrier sensing to reduce collisions and
adopt an asynchronized sleep-wake \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:DBD,
author = "Dongxiao Yu and Yifei Zou and Jiguo Yu and Yu Wu and
Weifeng Lv and Xiuzhen Cheng and Falko Dressler and
Francis C. M. Lau",
title = "Distributed Broadcasting in Dynamic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2142--2155",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3087818",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3087818",
abstract = "In this paper, we investigate distributed broadcasting
in dynamic networks, where the topology changes
continually over time. We propose a network model that
captures the dynamicity caused by both churn and
mobility of nodes. In contrast to existing work
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2021:DOU,
author = "Wenbin Liu and Yongjian Yang and En Wang and Hengzhi
Wang and Zihe Wang and Jie Wu",
title = "Dynamic Online User Recruitment With (Non-) Submodular
Utility in Mobile {CrowdSensing}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2156--2169",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3083955",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3083955",
abstract = "Mobile CrowdSensing (MCS) has recently become a
powerful paradigm that recruits users to cooperatively
perform various tasks. In many realistic settings,
users participate in real time and we have to recruit
them in an online manner. The existing works \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhu:2021:LAO,
author = "Hongzi Zhu and Yuxiao Zhang and Zifan Liu and Xiao
Wang and Shan Chang and Yingying Chen",
title = "Localizing Acoustic Objects on a Single Phone",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2170--2183",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3080820",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3080820",
abstract = "Finding a small object (e.g., earbuds, keys or a
wallet) in an indoor environment (e.g., in a house or
an office) can be frustrating. In this paper, we
propose an innovative system, called {$<$
italic$>$HyperEar$<$}/{italic$>$}, to localize such an
object using only a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ye:2021:DBN,
author = "Yuhang Ye and Brian Lee and Ronan Flynn and Jin Xu and
Guiming Fang and Yuansong Qiao",
title = "Delay-Based Network Utility Maximization Modelling for
Congestion Control in Named Data Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2184--2197",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3090174",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3090174",
abstract = "Content replication and name-based routing lead to a
natural multi-source and multipath transmission
paradigm in NDN. Due to the unique connectionless
characteristic of NDN, current end-to-end multipath
congestion control schemes (e.g. MPTCP) cannot be
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Giovanidis:2021:ROS,
author = "Anastasios Giovanidis and Bruno Baynat and
Cl{\'e}mence Magnien and Antoine Vendeville",
title = "Ranking Online Social Users by Their Influence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2198--2214",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3085201",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3085201",
abstract = "We introduce an original mathematical model to analyze
the diffusion of posts within a generic online social
platform. The main novelty is that each user is not
simply considered as a node on the social graph, but is
further equipped with his/her own Wall \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Poupko:2021:BSR,
author = "Ouri Poupko and Gal Shahaf and Ehud Shapiro and Nimrod
Talmon",
title = "Building a {Sybil}-Resilient Digital Community
Utilizing Trust-Graph Connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2215--2227",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3084303",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3084303",
abstract = "Preventing fake or duplicate digital identities (aka
{$<$ italic$>$ sybils$<$}/{italic$>$}) from joining a
digital community may be crucial to its survival,
especially if it utilizes a consensus protocol among
its members or employs democratic governance, where
sybils \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jiang:2021:UAG,
author = "Hongbo Jiang and Mengyuan Wang and Ping Zhao and Zhu
Xiao and Schahram Dustdar",
title = "A Utility-Aware General Framework With Quantifiable
Privacy Preservation for Destination Prediction in
{LBSs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2228--2241",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3084251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3084251",
abstract = "Destination prediction plays an important role as the
basis for a variety of location-based services (LBSs).
However, it poses many threats to users&\#x2019;
location privacy. Most related work ignores privacy
preservation in destination prediction. Few \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wei:2021:CEF,
author = "Jianghong Wei and Xiaofeng Chen and Jianfeng Ma and
Xuexian Hu and Kui Ren",
title = "Communication-Efficient and Fine-Grained
Forward-Secure Asynchronous Messaging",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2242--2253",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3084692",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3084692",
abstract = "In recent years, motivated by the revelation of
long-term and widespread surveillance of personal
communications, extensive efforts have been putting
into {$<$ italic$>$ store}-and-{forward$<$}/{italic$>$}
asynchronous messaging systems (e.g., email and SMS)
for \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:FHP,
author = "Tianqi Yu and Xianbin Wang and Jianling Hu",
title = "A Fast Hierarchical Physical Topology Update Scheme
for Edge-Cloud Collaborative {IoT} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2254--2266",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3085031",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3085031",
abstract = "The awareness of physical network topology in a
large-scale Internet of Things (IoT) system is critical
to enable location-based service provisioning and
performance optimization. However, due to the dynamics
and complexity of IoT networks, it is usually
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2021:SBJ,
author = "Zhenhua Han and Haisheng Tan and Shaofeng H.-C. Jiang
and Wanli Cao and Xiaoming Fu and Lan Zhang and Francis
C. M. Lau",
title = "{SPIN}: {BSP} Job Scheduling With Placement-Sensitive
Execution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2267--2280",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3087221",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3087221",
abstract = "The Bulk Synchronous Parallel (BSP) paradigm is
gaining tremendous importance recently due to the
popularity of computations as distributed machine
learning and graph computation. In a typical BSP job,
multiple workers concurrently conduct iterative
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chiariotti:2021:HPR,
author = "Federico Chiariotti and Andrea Zanella and Stepan
Kucera and Kariem Fahmi and Holger Claussen",
title = "The {HOP} Protocol: Reliable Latency-Bounded
End-to-End Multipath Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2281--2295",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3084450",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3084450",
abstract = "Next-generation wireless networks are expected to
enable new applications with strict latency
constraints. However, existing transport layer
protocols are unable to meet the stringent Quality of
Service (QoS) requirements on throughput and maximum
latency:. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2021:STD,
author = "Luoyi Fu and Jiasheng Xu and Shan Qu and Zhiying Xu
and Xinbing Wang and Guihai Chen",
title = "Seeking the Truth in a Decentralized Manner",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2296--2312",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3085000",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3085000",
abstract = "In networks where massive sources make observations of
same entities, we intend to seek the {$<$ italic$>$
truth$<$}/{italic$>$} &\#x2013; the most trustworthy
value of each entity from conflicting information
claimed by multiple sources. Various methods are
proposed \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yao:2021:VQP,
author = "Xin Yao and Rui Zhang and Dingquan Huang and Yanchao
Zhang",
title = "Verifiable Query Processing Over Outsourced Social
Graph",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "5",
pages = "2313--2326",
month = oct,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3085574",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:15 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3085574",
abstract = "Social data outsourcing is an emerging paradigm for
effective and efficient access to the social data. In
such a system, a third-party Social Data Provider (SDP)
purchases social network datasets from Online Social
Network (OSN) operators and then resells \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ben-Basat:2021:RON,
author = "Ran Ben-Basat and Gil Einziger and Shir Landau Feibish
and Jalil Moraney and Bilal Tayh and Danny Raz",
title = "Routing-Oblivious Network-Wide Measurements",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2386--2398",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3061737",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3061737",
abstract = "The recent introduction of SDN allows deploying new
centralized network algorithms that dramatically
improve network operations. In such algorithms, the
centralized controller obtains a network-wide view by
merging measurement data from Network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Valls:2021:BDR,
author = "V{\'\i}ctor Valls and George Iosifidis and Leandros
Tassiulas",
title = "{Birkhoff}'s Decomposition Revisited: Sparse
Scheduling for High-Speed Circuit Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2399--2412",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3088327",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3088327",
abstract = "Data centers are increasingly using high-speed circuit
switches to cope with the growing demand and reduce
operational costs. One of the fundamental tasks of
circuit switches is to compute a sparse collection of
switching configurations to support a \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Badita:2021:SFC,
author = "Ajay Badita and Parimal Parag and Vaneet Aggarwal",
title = "Single-Forking of Coded Subtasks for Straggler
Mitigation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2413--2424",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3075377",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075377",
abstract = "Given the unpredictable nature of the nodes in
distributed computing systems, some of the tasks can be
significantly delayed. Such delayed tasks are called
stragglers. Straggler mitigation can be achieved by
redundant computation. In maximum distance \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bastopcu:2021:AIU,
author = "Melih Bastopcu and Sennur Ulukus",
title = "Age of Information for Updates With Distortion:
Constant and Age-Dependent Distortion Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2425--2438",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3091493",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3091493",
abstract = "We consider an information update system where an
information receiver requests updates from an
information provider in order to minimize its age of
information. The updates are generated at the
information provider (transmitter) as a result of
completing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jahanian:2021:GBN,
author = "Mohammad Jahanian and Jiachen Chen and K. K.
Ramakrishnan",
title = "Graph-Based Namespaces and Load Sharing for Efficient
Information Dissemination",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2439--2452",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3094839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3094839",
abstract = "Graph-based namespaces are being increasingly used to
represent the organization of complex and ever-growing
information eco-systems and individual user roles.
Timely and accurate information dissemination requires
an architecture with appropriate naming \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mai:2021:OCI,
author = "Van Sy Mai and Richard J. La and Abdella Battou",
title = "Optimal Cybersecurity Investments in Large Networks
Using {SIS} Model: Algorithm Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2453--2466",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3091856",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3091856",
abstract = "We study the problem of minimizing the (time) average
security costs in large networks/systems comprising
many interdependent subsystems, where the state
evolution is captured by a
susceptible-infected-susceptible (SIS) model. The
security costs reflect \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ahmadi:2021:PSQ,
author = "Mahdieh Ahmadi and Morteza Golkarifard and Ali
Movaghar and Hamed Yousefi",
title = "Processor Sharing Queues With Impatient Customers and
State-Dependent Rates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2467--2477",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3091189",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3091189",
abstract = "We study queues with impatient customers and Processor
Sharing (PS) discipline as well as other variants of PS
discipline, namely, Discriminatory Processor Sharing
(DPS) and Generalized Processor Sharing (GPS)
disciplines, where customers have deadlines \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2021:MCD,
author = "Chi Lin and Ziwei Yang and Haipeng Dai and Liangxian
Cui and Lei Wang and Guowei Wu",
title = "Minimizing Charging Delay for Directional Charging",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2478--2493",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3095280",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3095280",
abstract = "As a more energy-efficient WPT technology, directional
WPT is applied to supply energy for wireless
rechargeable sensor networks (WRSNs). Conventional
methods that ignore anisotropic energy receiving
property of rechargeable sensors cause a waste of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yan:2021:TDT,
author = "Zun Yan and Peng Cheng and Zhuo Chen and Branka
Vucetic and Yonghui Li",
title = "Two-Dimensional Task Offloading for Mobile Networks:
an Imitation Learning Framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2494--2507",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3093452",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3093452",
abstract = "Mobile computing network is envisioned as a powerful
framework to support the growing computation-intensive
applications in the era of the Internet of Things
(IoT). In this paper, we exploit the potential of a
multi-layer network via a two-dimensional \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:ELS,
author = "Kan Yu and Jiguo Yu and Xiuzhen Cheng and Dongxiao Yu
and Anming Dong",
title = "Efficient Link Scheduling Solutions for the {Internet
of Things} Under {Rayleigh} Fading",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2508--2521",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3093306",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3093306",
abstract = "Link scheduling is an appealing solution for ensuring
the reliability and latency requirements of Internet of
Things (IoT). Most existing results on the link
scheduling problem were based on the graph or SINR
(Signal-to-Interference-plus-Noise-Ratio) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lorenzo:2021:ARC,
author = "Beatriz Lorenzo and Francisco Javier
Gonz{\'a}lez-Casta{\~n}o and Linke Guo and Felipe
Gil-Casti{\~n}eira and Yuguang Fang",
title = "Autonomous Robustness Control for Fog Reinforcement in
Dynamic Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2522--2535",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3091332",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3091332",
abstract = "The sixth-generation (6G) of wireless communications
systems will significantly rely on fog/edge network
architectures for service provisioning. To realize this
vision, AI-based fog/edge enabled reinforcement
solutions are needed to serve highly stringent
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Neglia:2021:SAK,
author = "Giovanni Neglia and Emilio Leonardi and Guilherme
Iecker Ricardo and Thrasyvoulos Spyropoulos",
title = "A {Swiss Army} Knife for Online Caching in Small Cell
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2536--2547",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3100757",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3100757",
abstract = "We consider a dense cellular network, in which a
limited-size cache is available at every base station
(BS). Coordinating content allocation across the
different caches can lead to significant performance
gains, but is a difficult problem even when full
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Reddyvari:2021:MSS,
author = "Vamseedhar Reddyvari and Sarat Chandra Bobbili and
Parimal Parag and Srinivas Shakkottai",
title = "Mode-Suppression: a Simple, Stable and Scalable
Chunk-Sharing Algorithm for {P2P} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2548--2559",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3092008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3092008",
abstract = "The ability of a P2P network to scale its throughput
up in proportion to the arrival rate of peers has
recently been shown to be crucially dependent on the
chunk sharing policy employed. Some policies can result
in low frequencies of a particular chunk, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Barbette:2021:CSC,
author = "Tom Barbette and Cyril Soldani and Laurent Mathy",
title = "Combined Stateful Classification and Session Splicing
for High-Speed {NFV} Service Chaining",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2560--2573",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3099240",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3099240",
abstract = "{$<$ italic$>$Network} {functions$<$}/{italic$>$} such
as firewalls, NAT, DPI, content-aware optimizers, and
load-balancers are increasingly realized as software to
reduce costs and enable outsourcing. To meet
performance requirements these {$<$ italic$>$
virtual$<$}/{italic$>$} \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Promponas:2021:GNS,
author = "Panagiotis Promponas and Christos Pelekis and Eirini
Eleni Tsiropoulou and Symeon Papavassiliou",
title = "Games in Normal and Satisfaction Form for Efficient
Transmission Power Allocation Under Dual {5G} Wireless
Multiple Access Paradigm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2574--2587",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3095351",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3095351",
abstract = "In this paper, to exploit the challenges and potential
offered by the simultaneous use of non-orthogonal
multiple access (NOMA) and orthogonal frequency
division multiple access (OFDMA) transmission options
in future 5G wireless systems, we aim at the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Raman:2021:CSB,
author = "Ravi Kiran Raman and Lav R. Varshney",
title = "Coding for Scalable Blockchains via Dynamic
Distributed Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2588--2601",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3098613",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3098613",
abstract = "Blockchains store transaction data in the form of a
distributed ledger where each node in the network
stores a current copy of the sequence of transactions
as a hash chain. This requirement of storing the entire
ledger incurs a high storage cost that \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Meng:2021:IAD,
author = "Xuying Meng and Yequan Wang and Suhang Wang and Di Yao
and Yujun Zhang",
title = "Interactive Anomaly Detection in Dynamic Communication
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2602--2615",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3097137",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3097137",
abstract = "Network flows are the basic components of the
Internet. Considering the serious consequences of
abnormal flows, it is crucial to provide timely anomaly
detection in dynamic communication networks. To obtain
accurate anomaly detection results in dynamic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2021:FLE,
author = "Deliang Yang and Xuan Huang and Jun Huang and Xiangmao
Chang and Guoliang Xing and Yang Yang",
title = "A First Look at Energy Consumption of {NB-IoT} in the
Wild: Tools and Large-Scale Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2616--2631",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3096656",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3096656",
abstract = "Recent years have seen a widespread deployment of
NB-IoT networks for massive machine-to-machine
communication in the emerging 5G era. Unfortunately,
the key aspects of NB-IoT networks, such as radio
access performance and power consumption have not been
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2021:LDL,
author = "Xianjin Xia and Yuanqing Zheng and Tao Gu",
title = "{LiteNap}: Downclocking {LoRa} Reception",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2632--2645",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3096990",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3096990",
abstract = "This paper presents LiteNap which improves the energy
efficiency of LoRa by enabling LoRa nodes to operate in
a downclocked &\#x2018;light sleep&' mode for packet
reception. A fundamental limit that prevents radio
downclocking is the Nyquist sampling \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Das:2021:MLM,
author = "Shrayan Das and Kirtan Gopal Panda and Debarati Sen
and Wasim Arif",
title = "Maximizing Last-Minute Backup in Endangered
Time-Varying Inter-Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2646--2663",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3098766",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3098766",
abstract = "Natural disasters are time-varying in nature. They
adversely affect backbone datacenter (DC) networks,
thereby resulting in huge loss of data within a short
span of time. Maximizing last-minute data backup in an
endangered DC network hit by a progressive \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fan:2021:RTU,
author = "Xingpeng Fan and Hongli Xu and He Huang and Xuwei
Yang",
title = "Real-Time Update of Joint {SFC} and Routing in
Software Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2664--2677",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3095935",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3095935",
abstract = "To meet the ever-increasing demands for high-quality
network services, a software defined network (SDN) can
support various virtual network functions (VNFs) using
virtualization technology. Due to network dynamics, an
SDN needs to be updated frequently to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:RAM,
author = "Tong Li and Kai Zheng and Ke Xu and Rahul Arvind
Jadhav and Tao Xiong and Keith Winstein and Kun Tan",
title = "Revisiting Acknowledgment Mechanism for Transport
Control: Modeling, Analysis, and Implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2678--2692",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3101011",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3101011",
abstract = "The shared nature of the wireless medium induces
contention between data transport and backward
signaling, such as acknowledgment. The current way of
TCP acknowledgment induces control overhead which is
counter-productive for TCP performance especially in
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wan:2021:CEP,
author = "Ying Wan and Haoyu Song and Yang Xu and Yilun Wang and
Tian Pan and Chuwen Zhang and Yi Wang and Bin Liu",
title = "{T-Cache}: Efficient Policy-Based Forwarding Using
Small {TCAM}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2693--2708",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3098320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3098320",
abstract = "Ternary Content Addressable Memory (TCAM) is widely
used by modern routers and switches to support
policy-based forwarding due to its incomparable lookup
speed and flexible matching patterns. However, the
limited TCAM capacity does not scale with the ever-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sivaraman:2021:DMA,
author = "Vignesh Sivaraman and Biplab Sikdar",
title = "A Defense Mechanism Against Timing Attacks on User
Privacy in {ICN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2709--2722",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3097536",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3097536",
abstract = "While in-network caching is an essential feature of
Information Centric Networks (ICN) for improved content
dissemination and reducing the bandwidth consumption at
the core of the network, it is prone to many privacy
threats. For example, an adversary can \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Alasmar:2021:SSR,
author = "Mohammed Alasmar and George Parisis and Jon
Crowcroft",
title = "{SCDP}: Systematic Rateless Coding for Efficient Data
Transport in Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2723--2736",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3098386",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3098386",
abstract = "In this paper we propose SCDP, a general-purpose data
transport protocol for data centres that, in contrast
to all other protocols proposed to date, supports
efficient one-to-many and many-to-one communication,
which is extremely common in modern data \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tian:2021:EIT,
author = "Jiazheng Tian and Kun Xie and Xin Wang and Gaogang Xie
and Kenli Li and Jigang Wen and Dafang Zhang and
Jiannong Cao",
title = "Efficiently Inferring Top-$k$ Largest Monitoring Data
Entries Based on Discrete Tensor Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2737--2750",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3103527",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3103527",
abstract = "Network-wide monitoring is important for many network
functions. Due to the need of sampling to reduce high
measurement cost, system failure, and unavoidable data
transmission loss, network monitoring systems suffer
from the incompleteness of network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2021:CNC,
author = "Yuanyuan Li and Stratis Ioannidis",
title = "Cache Networks of Counting Queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2751--2764",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3102518",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3102518",
abstract = "We consider a cache network in which intermediate
nodes equipped with caches can serve content requests.
We model this network as a universally stable queuing
system, in which packets carrying identical responses
are consolidated before being forwarded \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2021:FOP,
author = "Xinyi Zhang and Gaogang Xie and Xin Wang and Penghao
Zhang and Yanbiao Li and Kav{\'e} Salamatian",
title = "Fast Online Packet Classification With Convolutional
Neural Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2765--2778",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3100114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3100114",
abstract = "Packet classification is a critical component in
network appliances. Software Defined Networking and
cloud computing update the rulesets frequently for
flexible policy configuration. Tuple Space Search
(TSS), implemented in Open vSwitch (OVS), achieves
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2021:CAN,
author = "Tao Hou and Tao Wang and Zhuo Lu and Yao Liu",
title = "Combating Adversarial Network Topology Inference by
Proactive Topology Obfuscation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2779--2792",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3101692",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3101692",
abstract = "The topology of a network is fundamental for building
network infrastructure functionalities. In many
scenarios, enterprise networks may have no desire to
disclose their topology information. In this paper, we
aim at preventing attacks that use \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2021:FTS,
author = "Mingli Yu and Tian Xie and Ting He and Patrick
McDaniel and Quinn K. Burke",
title = "Flow Table Security in {SDN}: Adversarial
Reconnaissance and Intelligent Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "29",
number = "6",
pages = "2793--2806",
month = dec,
year = "2021",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3099717",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:27 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3099717",
abstract = "The performance-driven design of SDN architectures
leaves many security vulnerabilities, a notable one
being the communication bottleneck between the
controller and the switches. Functioning as a cache
between the controller and the switches, the flow
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2022:SNB,
author = "Kuan-Yin Chen and Sen Liu and Yang Xu and Ishant Kumar
Siddhrau and Siyu Zhou and Zehua Guo and H. Jonathan
Chao",
title = "{SDNShield}: {NFV}-Based Defense Framework Against
{DDoS} Attacks on {SDN} Control Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "1--17",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105187",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105187",
abstract = "Software-defined networking (SDN) is increasingly
popular in today's information technology industry, but
existing SDN control plane is insufficiently scalable
to support on-demand, high-frequency flow requests.
Weaknesses along SDN control paths \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bura:2022:LCC,
author = "Archana Bura and Desik Rengarajan and Dileep Kalathil
and Srinivas Shakkottai and Jean-Francois Chamberland",
title = "Learning to Cache and Caching to Learn: Regret
Analysis of Caching Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "18--31",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105880",
abstract = "Crucial performance metrics of a caching algorithm
include its ability to quickly and accurately learn a
popularity distribution of requests. However, a
majority of work on analytical performance analysis
focuses on hit probability after an asymptotically
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bhattacharyya:2022:QLA,
author = "Rajarshi Bhattacharyya and Archana Bura and Desik
Rengarajan and Mason Rumuly and Bainan Xia and Srinivas
Shakkottai and Dileep Kalathil and Ricky K. P. Mok and
Amogh Dhamdhere",
title = "{QFlow}: a Learning Approach to High {QoE} Video
Streaming at the Wireless Edge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "32--46",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3106675",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3106675",
abstract = "The predominant use of wireless access networks is for
media streaming applications. However, current access
networks treat all packets identically, and lack the
agility to determine which clients are most in need of
service at a given time. Software \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ding:2022:CRL,
author = "Yi Ding and Ling Liu and Yu Yang and Yunhuai Liu and
Desheng Zhang and Tian He",
title = "From Conception to Retirement: a Lifetime Story of a
3-Year-Old Wireless Beacon System in the Wild",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "47--61",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3107043",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3107043",
abstract = "We report a 3-year city-wide study of an operational
indoor sensing system based on Bluetooth Low Energy
(BLE) called {$<$ monospace$>$
aBeacon$<$}/{monospace$>$} (short for {$<$ underline$>$
a$<$}/{underline$>$ libaba} {$<$
underline$>$Beacon$<$}/{underline$>$}). {$<$
monospace$>$ aBeacon$<$}/{monospace$>$} \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Akram:2022:CAD,
author = "Vahid Khalilpour Akram and Orhan Dagdeviren and Bulent
Tavli",
title = "A Coverage-Aware Distributed $k$-Connectivity
Maintenance Algorithm for Arbitrarily Large $k$ in
Mobile Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "62--75",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3104356",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3104356",
abstract = "Mobile sensor networks (MSNs) have emerged from the
interaction between mobile robotics and wireless sensor
networks. MSNs can be deployed in harsh environments,
where failures in some nodes can partition MSNs into
disconnected network segments or reduce \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Park:2022:LSB,
author = "Jeman Park and Rhongho Jang and Manar Mohaisen and
David Mohaisen",
title = "A Large-Scale Behavioral Analysis of the {Open DNS}
Resolvers on the {Internet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "76--89",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105599",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105599",
abstract = "Open DNS resolvers are resolvers that perform
recursive resolution on behalf of any user. They can be
exploited by adversaries because they are open to the
public and require no authorization to use. Therefore,
it is important to understand the state of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:SCS,
author = "Xilai Liu and Yan Xu and Peng Liu and Tong Yang and
Jiaqi Xu and Lun Wang and Gaogang Xie and Xiaoming Li
and Steve Uhlig",
title = "{SEAD} Counter: Self-Adaptive Counters With Different
Counting Ranges",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "90--106",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3107418",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3107418",
abstract = "The Sketch is a compact data structure useful for
network measurements. However, to cope with the high
speeds of the current data plane, it needs to be held
in the small on-chip memory (SRAM). Therefore, the
product of the counter size and the number of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bhattacharya:2022:SSE,
author = "Arani Bhattacharya and Caitao Zhan and Abhishek Maji
and Himanshu Gupta and Samir R. Das and Petar M.
Djuri{\'c}",
title = "Selection of Sensors for Efficient Transmitter
Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "107--119",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3104000",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3104000",
abstract = "We address the problem of localizing an (unauthorized)
transmitter using a distributed set of sensors. Our
focus is on developing techniques that perform the
transmitter localization in an efficient manner,
wherein the efficiency is defined in terms of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ren:2022:ODS,
author = "Bangbang Ren and Deke Guo and Yali Yuan and Guoming
Tang and Weijun Wang and Xiaoming Fu",
title = "Optimal Deployment of {SRv6} to Enable Network
Interconnection Service",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "120--133",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105959",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105959",
abstract = "Many organizations nowadays have multiple sites at
different geographic locations. Typically, transmitting
massive data among these sites relies on the
interconnection service offered by ISPs. Segment
Routing over IPv6 (SRv6) is a new simple and flexible
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:MCR,
author = "Yu Zhang and Tao Gu and Xi Zhang",
title = "{MDLdroid}: a {ChainSGD}-Reduce Approach to Mobile
Deep Learning for Personal Mobile Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "134--147",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3103846",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3103846",
abstract = "Personal mobile sensing is fast permeating our daily
lives to enable activity monitoring, healthcare and
rehabilitation. Combined with deep learning, these
applications have achieved significant success in
recent years. Different from conventional cloud-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Reisizadeh:2022:CFR,
author = "Amirhossein Reisizadeh and Saurav Prakash and Ramtin
Pedarsani and Amir Salman Avestimehr",
title = "{CodedReduce}: a Fast and Robust Framework for
Gradient Aggregation in Distributed Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "148--161",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3109097",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3109097",
abstract = "We focus on the commonly used synchronous Gradient
Descent paradigm for large-scale distributed learning,
for which there has been a growing interest to develop
efficient and robust gradient aggregation strategies
that overcome two key system bottlenecks: \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cabuk:2022:MTN,
author = "Umut Can {\c{C}}abuk and Mustafa Tosun and Orhan
Dagdeviren",
title = "{MAX-Tree}: a Novel Topology Formation for Maximal
Area Coverage in Wireless Ad-Hoc Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "162--175",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3110675",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3110675",
abstract = "For many wireless ad-hoc network (WANET) applications,
including wireless sensor, robotic, and flying ad-hoc
networks, area coverage is a major challenge. This
challenge, which may include the number of required
nodes, cumulative energy consumption, or \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2022:QAI,
author = "Zhiguo Shi and Guang Yang and Xiaowen Gong and Shibo
He and Jiming Chen",
title = "Quality-Aware Incentive Mechanisms Under Social
Influences in Data Crowdsourcing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "176--189",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105427",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105427",
abstract = "Incentive mechanism design and quality control are two
key challenges in data crowdsourcing, because of the
need for recruitment of crowd users and their limited
capabilities. Without considering users' social
influences, existing mechanisms often \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:USD,
author = "Xin Liu and Lei Ying",
title = "Universal Scaling of Distributed Queues Under Load
Balancing in the Super-{Halfin--Whitt} Regime",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "190--201",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105480",
abstract = "This paper considers the steady-state performance of
load balancing algorithms in a many-server system with
distributed queues. The system has \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Saad:2022:EPA,
author = "Muhammad Saad and Victor Cook and Lan Nguyen and My T.
Thai and David Mohaisen",
title = "Exploring Partitioning Attacks on the Bitcoin
Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "202--214",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3105604",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3105604",
abstract = "Bitcoin is the leading example of a blockchain
application that facilitates peer-to-peer transactions
without the need for a trusted third party. This paper
considers possible attacks related to the decentralized
network architecture of Bitcoin. We \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:MLV,
author = "Xiaoxi Zhang and Jianyu Wang and Li-Feng Lee and Tom
Yang and Akansha Kalra and Gauri Joshi and Carlee
Joe-Wong",
title = "Machine Learning on Volatile Instances: Convergence,
Runtime, and Cost Tradeoffs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "215--228",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3112082",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3112082",
abstract = "Due to the massive size of the neural network models
and training datasets used in machine learning today,
it is imperative to distribute stochastic gradient
descent (SGD) by splitting up tasks such as gradient
evaluation across multiple worker nodes. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tsai:2022:UAM,
author = "Cho-Hsin Tsai and Chih-Chun Wang",
title = "Unifying {AoI} Minimization and Remote Estimation ---
Optimal Sensor\slash Controller Coordination With
Random Two-Way Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "229--242",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3111495",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3111495",
abstract = "The ubiquitous usage of communication networks in
modern sensing and control applications has kindled new
interests on the timing coordination between sensors
and controllers, i.e., how to use the &\#x201C;waiting
time&\#x201D; to improve the system \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:PWT,
author = "Xu Li and Feilong Tang and Yanmin Zhu and Luoyi Fu and
Jiadi Yu and Long Chen and Jiacheng Liu",
title = "Processing-While-Transmitting: Cost-Minimized
Transmission in {SDN}-Based {STINs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "243--256",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3107413",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3107413",
abstract = "Existing Space-Terrestrial Integrated Network (STIN)
applications collect all data from multiple satellites
and terrestrial nodes to the specific analyze center on
the earth for processing, which wastes lots of network
resources. To save these resources, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:VAT,
author = "Chong Li and Sisu Xi and Chenyang Lu and Roch
Gu{\'e}rin and Christopher D. Gill",
title = "Virtualization-Aware Traffic Control for Soft
Real-Time Network Traffic on {Xen}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "257--270",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3114055",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3114055",
abstract = "As the role of virtualization technology becomes more
prevalent, the range of applications deployed in
virtualized systems is steadily growing. This
increasingly includes applications with soft real-time
requirements that benefit from low and predictable
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hu:2022:NTO,
author = "Yuchong Hu and Xiaoyang Zhang and Patrick P. C. Lee
and Pan Zhou",
title = "{NCScale}: Toward Optimal Storage Scaling via Network
Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "271--284",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3106394",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3106394",
abstract = "To adapt to the increasing storage demands and varying
storage redundancy requirements, practical distributed
storage systems need to support {$<$ italic$>$ storage}
{scaling$<$}/{italic$>$} by relocating currently stored
data to different storage nodes. However, the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:ACS,
author = "Sheng Zhang and Can Wang and Yibo Jin and Jie Wu and
Zhuzhong Qian and Mingjun Xiao and Sanglu Lu",
title = "Adaptive Configuration Selection and Bandwidth
Allocation for Edge-Based Video Analytics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "285--298",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3106937",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3106937",
abstract = "Major cities worldwide have millions of cameras
deployed for surveillance, business intelligence,
traffic control, crime prevention, etc. Real-time
analytics on video data demands intensive computation
resources and high energy consumption. Traditional
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2022:SSI,
author = "Chaoyi Ma and Shigang Chen and Youlin Zhang and
Qingjun Xiao and Olufemi O. Odegbile",
title = "Super Spreader Identification Using Geometric-Min
Filter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "299--312",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3108033",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3108033",
abstract = "Super spreader identification has a lot of
applications in network management and security
monitoring. It is a more difficult problem than heavy
hitter identification because flow spread is harder to
measure than flow size due to the requirement of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2022:CEI,
author = "Junjie Xie and Chen Qian and Deke Guo and Minmei Wang
and Ge Wang and Honghui Chen",
title = "{COIN}: an Efficient Indexing Mechanism for
Unstructured Data Sharing Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "313--326",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3110782",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3110782",
abstract = "Edge computing promises a dramatic reduction in the
network latency and the traffic volume, where many edge
servers are placed at the edge of the Internet.
Furthermore, those edge servers cache data to provide
services for edge users. The data sharing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pang:2022:TPP,
author = "Xiaoyi Pang and Zhibo Wang and Defang Liu and John C.
S. Lui and Qian Wang and Ju Ren",
title = "Towards Personalized Privacy-Preserving Truth
Discovery Over Crowdsourced Data Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "327--340",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3110052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3110052",
abstract = "Truth discovery is an effective paradigm which could
reveal the truth from crowdsouced data with conflicts,
enabling data-driven decision-making systems to make
quick and smart decisions. The increasing privacy
concern promotes users to perturb or encrypt \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hellemans:2022:ILB,
author = "Tim Hellemans and Benny {Van Houdt}",
title = "Improved Load Balancing in Large Scale Systems Using
Attained Service Time Reporting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "341--353",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3110186",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3110186",
abstract = "Our interest lies in load balancing jobs in large
scale systems consisting of multiple dispatchers and
FCFS servers. In the absence of any information on job
sizes, a popular load balancing method is the
SQ(\ldots{}) \ldots{}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Barbette:2022:CHS,
author = "Tom Barbette and Erfan Wu and Dejan Kosti{\'c} and
Gerald Q. Maguire and Panagiotis Papadimitratos and
Marco Chiesa",
title = "{Cheetah}: a High-Speed Programmable Load-Balancer
Framework With Guaranteed Per-Connection-Consistency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "354--367",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3113370",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3113370",
abstract = "Large service providers use load balancers to dispatch
millions of incoming connections per second towards
thousands of servers. There are two basic yet critical
requirements for a load balancer: {$<$ italic$>$
uniform} load {distribution$<$}/{italic$>$} of the
incoming \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2022:ARE,
author = "Ning Chen and Tie Qiu and Zilong Lu and Dapeng Oliver
Wu",
title = "An Adaptive Robustness Evolution Algorithm With
Self-Competition and its {$3$D} Deployment for
{Internet of Things}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "368--381",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3113916",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3113916",
abstract = "Internet of Things (IoT) includes numerous sensing
nodes that constitute a large scale-free network.
Optimizing the network topology to increase resistance
against malicious attacks is a complex problem,
especially on 3-dimension (3D) topological \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cohen:2022:LSA,
author = "Reuven Cohen and Matty Kadosh and Alan Lo and Qasem
Sayah",
title = "{LB} Scalability: Achieving the Right Balance Between
Being Stateful and Stateless",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "382--393",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3112517",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3112517",
abstract = "A high performance Layer-4 load balancer (LB) is one
of the most important components of a cloud service
infrastructure. Such an LB uses network and transport
layer information for deciding how to distribute client
requests across a group of servers. A \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2022:IHI,
author = "Xiaobo Ma and Jian Qu and Jianfeng Li and John C. S.
Lui and Zhenhua Li and Wenmao Liu and Xiaohong Guan",
title = "Inferring Hidden {IoT} Devices and User Interactions
via Spatial-Temporal Traffic Fingerprinting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "394--408",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3112480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3112480",
abstract = "With the popularization of Internet of Things (IoT)
devices in smart home and industry fields, a huge
number of IoT devices are connected to the Internet.
However, what devices are connected to a network may
not be known by the Internet Service Provider
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Feng:2022:PTH,
author = "Xuewei Feng and Qi Li and Kun Sun and Chuanpu Fu and
Ke Xu",
title = "Off-Path {TCP} Hijacking Attacks via the Side Channel
of Downgraded {IPID}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "1",
pages = "409--422",
month = feb,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3115517",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 15 05:49:29 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3115517",
abstract = "In this paper, we uncover a new off-path TCP hijacking
attack that can be used to terminate victim TCP
connections or inject forged data into victim TCP
connections by manipulating the new mixed IPID
assignment method, which is widely used in Linux kernel
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Neglia:2022:SCT,
author = "Giovanni Neglia and Michele Garetto and Emilio
Leonardi",
title = "Similarity Caching: Theory and Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "475--486",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3126368",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3126368",
abstract = "This paper focuses on similarity caching systems, in
which a user request for an object \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Song:2022:MSW,
author = "Jianhan Song and Gustavo de Veciana and Sanjay
Shakkottai",
title = "Meta-Scheduling for the Wireless Downlink Through
Learning With Bandit Feedback",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "487--500",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3117783",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3117783",
abstract = "In this paper, we study learning-assisted multi-user
scheduling for the wireless downlink. There have been
many scheduling algorithms developed that optimize for
a plethora of performance metrics; however a systematic
approach across diverse performance \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Feng:2022:BIR,
author = "Cuiying Feng and Jianwei An and Kui Wu and Jianping
Wang",
title = "Bound Inference and Reinforcement Learning-Based Path
Construction in Bandwidth Tomography",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "501--514",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3118006",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3118006",
abstract = "Inferring the bandwidth of internal links from the
bandwidth of end-to-end paths, so-termed bandwidth
tomography, is a long-standing open problem in the
network tomography literature. The difficulty is due to
the fact that no existing mathematical tool is
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qu:2022:ELC,
author = "Dapeng Qu and Guoxin Lv and Shijun Qu and Haiying Shen
and Yue Yang and Zhaoyang Heng",
title = "An Effective and Lightweight Countermeasure Scheme to
Multiple Network Attacks in {NDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "515--528",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3121001",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3121001",
abstract = "In Named Data Networking, cache pollution, cache
poisoning and interest flooding are three popular types
of attacks that can drastically degrade the network
performance. However, previous methods for mitigating
these attacks are not sufficiently effective \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:SNL,
author = "Zhuo Li and Jindian Liu and Liu Yan and Beichuan Zhang
and Peng Luo and Kaihua Liu",
title = "Smart Name Lookup for {NDN} Forwarding Plane via
Neural Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "529--541",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3119769",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3119769",
abstract = "Name lookup is a key technology for the forwarding
plane of content router in Named Data Networking (NDN).
To realize the efficient name lookup, what counts is
deploying a high-performance index in content routers.
So far, the proposed indexes have shown \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hu:2022:ABB,
author = "Shuihai Hu and Gaoxiong Zeng and Wei Bai and Zilong
Wang and Baochen Qiao and Kai Chen and Kun Tan and Yi
Wang",
title = "{Aeolus}: a Building Block for Proactive Transport in
Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "542--556",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3119986",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3119986",
abstract = "As datacenter network bandwidth keeps growing,
proactive transport becomes attractive, where bandwidth
is {$<$ italic$>$ proactively$<$}/{italic$>$} allocated
as &\#x201C;credits&\#x201D; to senders who then can
send &\#x201C;scheduled packets&\#x201D; at a right
rate to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2022:TCS,
author = "Yu Sun and Chi Lin and Haipeng Dai and Pengfei Wang
and Lei Wang and Guowei Wu and Qiang Zhang",
title = "Trading off Charging and Sensing for Stochastic Events
Monitoring in {WRSNs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "557--571",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3122130",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3122130",
abstract = "As an epoch-making technology, wireless power transfer
incredibly achieves energy transmission wirelessly,
enabling reliable energy supplement for Wireless
Rechargeable Sensor Networks (WRSNs). Existing methods
mainly concentrate on performance \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:IST,
author = "Shuai Wang and Jinkun Geng and Dan Li",
title = "Impact of Synchronization Topology on {DML}
Performance: Both Logical Topology and Physical
Topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "572--585",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3117042",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3117042",
abstract = "To tackle the increasingly larger training data and
models, researchers and engineers resort to multiple
servers in a data center for distributed machine
learning (DML). On one hand, DML enables us to leverage
the computation power of multiple servers, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:PFG,
author = "Yuanpeng Li and Xiang Yu and Yilong Yang and Yang Zhou
and Tong Yang and Zhuo Ma and Shigang Chen",
title = "{Pyramid Family}: Generic Frameworks for Accurate and
Fast Flow Size Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "586--600",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3120085",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3120085",
abstract = "Sketches, as a kind of probabilistic data structures,
have been considered as the most promising solution for
network measurement in recent years. Most sketches do
not work well for skewed network traffic. To address
this problem, we propose a family of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2022:GNU,
author = "Yan Huang and Shaoran Li and Y. Thomas Hou and Wenjing
Lou",
title = "{GPF+\_}: a Novel Ultrafast {GPU}-Based Proportional
Fair Scheduler for {5G NReee}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "601--615",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3118005",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3118005",
abstract = "5G NR is designed to operate over a broad range of
frequency bands and support new applications with
ultra-low latency requirements. To support its
extremely diverse operating conditions, multiple OFDM
numerologies have been defined in the 5G standards.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lanante:2022:PAI,
author = "Leonardo Lanante and Sumit Roy",
title = "Performance Analysis of the {IEEE 802.11ax
OBSS\_PD}-Based Spatial Reuse",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "616--628",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3117816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3117816",
abstract = "Network densification has led to a renewed emphasis on
means to improve {$<$ italic$>$ aggregate} network
{throughput$<$}/{italic$>$} for next-gen (High
Efficiency) WLANs. The introduction of BSS color
feature in support of enhanced spatial reuse sets IEEE
802.11ax apart \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2022:ESR,
author = "Penghao Sun and Zehua Guo and Junfei Li and Yang Xu
and Julong Lan and Yuxiang Hu",
title = "Enabling Scalable Routing in Software-Defined Networks
With Deep Reinforcement Learning on Critical Nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "629--640",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3126933",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3126933",
abstract = "Traditional routing schemes usually use fixed models
for routing policies and thus are not good at handling
complicated and dynamic traffic, leading to performance
degradation (e.g., poor quality of service). Emerging
Deep Reinforcement Learning (DRL) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2022:EAL,
author = "Xiuzhen Guo and Longfei Shangguan and Yuan He and Jia
Zhang and Haotian Jiang and Awais Ahmad Siddiqi and
Yunhao Liu",
title = "Efficient Ambient {LoRa} Backscatter With On-Off
Keying Modulation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "641--654",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3121787",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3121787",
abstract = "Backscatter communication holds potential for
ubiquitous and low-cost connectivity among low-power
IoT devices. To avoid interference between the carrier
signal and the backscatter signal, recent works propose
a frequency-shifting technique to separate \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Martin-Perez:2022:KGN,
author = "Jorge Mart{\'\i}n-P{\'e}rez and Francesco Malandrino
and Carla Fabiana Chiasserini and Milan Groshev and
Carlos J. Bernardos",
title = "{KPI} Guarantees in Network Slicing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "655--668",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3120318",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3120318",
abstract = "Thanks to network slicing, mobile networks can now
support multiple and diverse services, each requiring
different key performance indicators (KPIs). In this
new scenario, it is critical to allocate network and
computing resources efficiently and in such \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abolhassani:2022:SVD,
author = "Bahman Abolhassani and John Tadrous and Atilla
Eryilmaz",
title = "Single vs Distributed Edge Caching for Dynamic
Content",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "669--682",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3121098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3121098",
abstract = "Existing content caching mechanisms are predominantly
geared towards easy-access to content that is static
once created. However, numerous applications, such as
news and dynamic sources with time-varying states,
generate &\#x2018;dynamic&\#x2019; content \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rene:2022:CCF,
author = "Sergi Rene and Onur Ascigil and Ioannis Psaras and
George Pavlou",
title = "A Congestion Control Framework Based on In-Network
Resource Pooling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "683--697",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3128384",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3128384",
abstract = "Congestion control has traditionally relied on
monitoring packet-level performance (e.g., latency,
loss) through feedback signals propagating end-to-end
together with various queue management practices (e.g.,
carefully \ldots{})",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:MLS,
author = "Yuchen Liu and Yubing Jian and Raghupathy Sivakumar
and Douglas M. Blough",
title = "Maximizing Line-of-Sight Coverage for {mmWave}
Wireless {LANs} With Multiple Access Points",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "698--716",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3122378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3122378",
abstract = "In this paper, we investigate the optimal
line-of-sight (LoS) coverage problem for multiple
access point (multi-AP) mmWave wireless LANs in indoor
scenarios. Due to the weak diffraction ability of
mmWave signals at 60 GHz, maintaining LoS
communications \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cao:2022:AGC,
author = "Hankun Cao and Qifa Yan and Xiaohu Tang and Guojun
Han",
title = "Adaptive Gradient Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "717--734",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3122873",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3122873",
abstract = "This paper focuses on mitigating the impact of
stragglers in distributed learning system. Unlike the
existing results designated for a fixed number of
stragglers, we develop a new scheme called {$<$
italic$>$Adaptive} Gradient Coding
(AGC){$<$}/{italic$>$} with flexible \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lai:2022:UOT,
author = "Pan Lai and Rui Fan and Xiao Zhang and Wei Zhang and
Fang Liu and Joey Tianyi Zhou",
title = "Utility Optimal Thread Assignment and Resource
Allocation in Multi-Server Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "735--748",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3123817",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3123817",
abstract = "Achieving high performance in many multi-server
systems (e.g., web hosting center, cloud) requires
finding a good assignment of worker threads to servers
and also effectively allocating each server&\#x2019;s
resources to its assigned threads. The \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:ISC,
author = "Bingyu Li and Jingqiang Lin and Fengjun Li and
Qiongxiao Wang and Wei Wang and Qi Li and Guangshen
Cheng and Jiwu Jing and Congli Wang",
title = "The Invisible Side of Certificate Transparency:
Exploring the Reliability of Monitors in the Wild",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "749--765",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3123507",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3123507",
abstract = "To detect fraudulent TLS server certificates and
improve the accountability of certification authorities
(CAs), certificate transparency (CT) is proposed to
record certificates in publicly-visible logs, from
which the monitors fetch all certificates and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{vanDuijn:2022:ATA,
author = "Ingo van Duijn and Peter Gj{\o}l Jensen and Jesper
Stenbjerg Jensen and Troels Beck Kr{\o}gh and Jonas
Sand Madsen and Stefan Schmid and Jir{\'\i} Srba and
Marc Tom Thorgersen",
title = "Automata-Theoretic Approach to Verification of {MPLS}
Networks Under Link Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "766--781",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3126572",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3126572",
abstract = "Future communication networks are expected to be
highly automated, disburdening human operators of their
most complex tasks. While the first powerful and
automated network analysis tools are emerging, existing
tools provide only limited and inefficient \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Moorthy:2022:ERL,
author = "Sabarish Krishna Moorthy and Maxwell Mcmanus and
Zhangyu Guan",
title = "{ESN} Reinforcement Learning for Spectrum and Flight
Control in {THz-Enabled} Drone Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "782--795",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3128836",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3128836",
abstract = "Terahertz (THz)-band communications have been
envisioned as a key technology to support
ultra-high-data-rate applications in 5G-beyond (or 6G)
wireless networks. Compared to the microwave and mmWave
bands, the main challenges with the THz band are in its
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Polachan:2022:TMT,
author = "Kurian Polachan and Joydeep Pal and Chandramani Singh
and T. V. Prabhakar and Fernando A. Kuipers",
title = "{TCPSbed}: a Modular Testbed for Tactile
{Internet}-Based Cyber-Physical Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "796--811",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3124767",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3124767",
abstract = "Tactile Internet based Cyber-Physical Systems (TCPS)
are highly sensitive to component and communication
latencies and packet drops. Building a high performing
TCPS, thus, necessitates experimenting with different
hardware, algorithms, access technologies,. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2022:MDC,
author = "Wenzheng Xu and Tao Xiao and Junqi Zhang and Weifa
Liang and Zichuan Xu and Xuxun Liu and Xiaohua Jia and
Sajal K. Das",
title = "Minimizing the Deployment Cost of {UAVs} for
Delay-Sensitive Data Collection in {IoT} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "812--825",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3123606",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3123606",
abstract = "In this paper, we study the deployment of Unmanned
Aerial Vehicles (UAVs) to collect data from IoT
devices, by finding a data collection tour for each
UAV. To ensure the &\#x2018;freshness&\#x2019; of the
collected data, the total time spent in the tour of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:PSR,
author = "Qiaolun Zhang and Omran Ayoub and Jun Wu and Francesco
Musumeci and Gaolei Li and Massimo Tornatore",
title = "Progressive Slice Recovery With Guaranteed Slice
Connectivity After Massive Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "826--839",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3130576",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3130576",
abstract = "In presence of multiple failures affecting their
network infrastructure, operators are faced with the
Progressive Network Recovery (PNR) problem, i.e.,
deciding the best sequence of repairs during recovery.
With incoming deployments of 5G networks, PNR
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:ARN,
author = "Tzu-Hsuan Liu and Che-Hao Yu and Yi-Jheng Lin and
Chia-Ming Chang and Cheng-Shang Chang and Duan-Shin
Lee",
title = "{ALOHA} Receivers: a Network Calculus Approach for
Analyzing Coded Multiple Access With {SIC}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "840--854",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3123685",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3123685",
abstract = "Motivated by the need to hide the complexity of the
physical layer from performance analysis in a layer 2
protocol, a class of abstract receivers, called Poisson
receivers, was recently proposed by Yu {$<$ italic$>$
et} {al.$<$}/{italic$>$} (2021) as a probabilistic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2022:GST,
author = "Renyong Wu and Jieming Ma and Zhixiang Tang and Xiehua
Li and Kim-Kwang Raymond Choo",
title = "A Generic Secure Transmission Scheme Based on Random
Linear Network Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "855--866",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3124890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3124890",
abstract = "Unlike general routing strategies, network coding (NC)
can combine encoding functions with multi-path
propagation over a network. This allows network
capacity to be achieved to support complex security
solutions. Moreover, NC has intrinsic security
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rong:2022:SMC,
author = "Chenghao Rong and Jessie Hui Wang and Juncai Liu and
Jilong Wang and Fenghua Li and Xiaolei Huang",
title = "Scheduling Massive Camera Streams to Optimize
Large-Scale Live Video Analytics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "867--880",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3125359",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3125359",
abstract = "In smart cities, more and more government departments
will make use of live analytics of videos from
surveillance cameras in their tasks, such as vehicle
traffic monitoring and criminal detection. Obviously,
it is costly for each individual department to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2022:TMU,
author = "Wenzheng Xu and Yueying Sun and Rui Zou and Weifa
Liang and Qiufen Xia and Feng Shan and Tian Wang and
Xiaohua Jia and Zheng Li",
title = "Throughput Maximization of {UAV} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "881--895",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3125982",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3125982",
abstract = "In this paper we study the deployment of multiple
unmanned aerial vehicles (UAVs) to form a temporal UAV
network for the provisioning of emergent communications
to affected people in a disaster zone, where each UAV
is equipped with a lightweight base \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2022:IDI,
author = "Yanjiao Chen and Meng Xue and Jian Zhang and Runmin Ou
and Qian Zhang and Peng Kuang",
title = "{{\em DetectDUI\/}}: an In-Car Detection System for
Drink Driving and {BACs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "2",
pages = "896--910",
month = apr,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3125950",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Apr 20 07:36:16 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3125950",
abstract = "As one of the biggest contributors to road accidents
and fatalities, drink driving is worthy of significant
research attention. However, most existing systems on
detecting or preventing drink driving either require
special hardware or require much effort \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kettaneh:2022:ARN,
author = "Ibrahim Kettaneh and Ahmed Alquraan and Hatem Takruri
and Ali Jos{\'e} Mashtizadeh and Samer Al-Kiswany",
title = "Accelerating Reads With In-Network Consistency-Aware
Load Balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "954--968",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3126203",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3126203",
abstract = "We present FLAIR, a novel approach for accelerating
read operations in leader-based consensus protocols.
FLAIR leverages the capabilities of the new generation
of programmable switches to serve reads from follower
replicas without compromising \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2022:MCR,
author = "Zehua Guo and Songshi Dou and Sen Liu and Wendi Feng
and Wenchao Jiang and Yang Xu and Zhi-Li Zhang",
title = "Maintaining Control Resiliency and Flow
Programmability in Software-Defined {WANs} During
Controller Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "969--984",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3128771",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3128771",
abstract = "Providing resilient network control is a critical
concern for deploying Software-Defined Networking (SDN)
into Wide-Area Networks (WANs). For performance
reasons, a Software-Defined WAN is divided into
multiple domains controlled by multiple controllers
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sadeh:2022:OWL,
author = "Yaniv Sadeh and Ori Rottenstreich and Haim Kaplan",
title = "Optimal Weighted Load Balancing in {TCAMs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "985--998",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3140124",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3140124",
abstract = "Traffic splitting is a required functionality in
networks, for example for load balancing over multiple
paths or among different servers. The capacities of the
servers determine the partition by which traffic should
be split. A recent approach implements \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Niu:2022:NMN,
author = "Zhixiong Niu and Qiang Su and Peng Cheng and Yongqiang
Xiong and Dongsu Han and Keith Winstein and Chun Jason
Xue and Hong Xu",
title = "{NetKernel}: Making Network Stack Part of the
Virtualized Infrastructure",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "999--1013",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3129806",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3129806",
abstract = "This paper presents a system called NetKernel that
decouples the network stack from the guest virtual
machine and offers it as an independent module.
NetKernel represents a new paradigm where network stack
can be managed as part of the virtualized \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Woldeyohannes:2022:CEA,
author = "Yordanos Tibebu Woldeyohannes and Besmir Tola and
Yuming Jiang and K. K. Ramakrishnan",
title = "{CoShare}: an Efficient Approach for Redundancy
Allocation in {NFV}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1014--1028",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3132279",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3132279",
abstract = "An appealing feature of Network Function
Virtualization (NFV) is that in an NFV-based network, a
network function (NF) instance may be placed at any
node. On the one hand this offers great flexibility in
allocation of redundant instances, but on the other
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2022:POL,
author = "Zhengkai Shi and Yipeng Zhou and Di Wu and Chen Wang",
title = "{PPVC}: Online Learning Toward Optimized Video Content
Caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1029--1044",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3132038",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3132038",
abstract = "Today&\#x2019;s Internet traffic has been dominated by
video contents. To efficiently serve online videos for
millions of users, it is essential to cache frequently
requested videos on various devices such as edge
servers, personal computers, etc. Existing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mohammadpour:2022:PRT,
author = "Ehsan Mohammadpour and Jean-Yves {Le Boudec}",
title = "On Packet Reordering in Time-Sensitive Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1045--1057",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3129590",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3129590",
abstract = "Time-sensitive networks (IEEE TSN or IETF DetNet) may
tolerate some packet reordering. Re-sequencing buffers
are then used to provide in-order delivery, the
parameters of which (timeout, buffer size) may affect
worst-case delay and delay jitter. There is \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kamran:2022:DJC,
author = "Khashayar Kamran and Edmund Yeh and Qian Ma",
title = "{DECO}: Joint Computation Scheduling, Caching, and
Communication in Data-Intensive Computing Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1058--1072",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3136157",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3136157",
abstract = "Driven by technologies such as IoT-enabled health
care, machine learning applications at the edge, and
industrial automation, mobile edge and fog computing
paradigms have reinforced a general trend toward
decentralized computing, where any network node
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rashelbach:2022:CAP,
author = "Alon Rashelbach and Ori Rottenstreich and Mark
Silberstein",
title = "A Computational Approach to Packet Classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1073--1087",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3131879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3131879",
abstract = "Multi-field packet classification is a crucial
component in modern software-defined data center
networks. To achieve high throughput and low latency,
state-of-the-art algorithms strive to fit the rule
lookup data structures into on-die caches; however,
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:CCL,
author = "Hao Li and Peng Zhang and Guangda Sun and Wanyue Cao
and Chengchen Hu and Danfeng Shan and Tian Pan and
Qiang Fu",
title = "Compiling Cross-Language Network Programs Into Hybrid
Data Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1088--1103",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3132303",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3132303",
abstract = "Network programming languages (NPLs) empower operators
to program network data planes (NDPs) with
unprecedented efficiency. Currently, various NPLs and
NDPs coexist and no one can prevail over others in the
short future. Such diversity is raising many \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tong:2022:CPC,
author = "Shuai Tong and Jiliang Wang and Yunhao Liu",
title = "Combating Packet Collisions Using Non-Stationary
Signal Scaling in {LPWANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1104--1117",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3131704",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3131704",
abstract = "LoRa, a representative Low-Power Wide Area Network
(LPWAN) technology, has been shown as a promising
platform to connect Internet of Things. Practical LoRa
deployments, however, suffer from collisions,
especially in dense networks and wide coverage areas
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:TER,
author = "Jia Liu and Xi Yu and Xuan Liu and Xingyu Chen and
Haisong Liu and Yanyan Wang and Lijun Chen",
title = "Time-Efficient Range Detection in Commodity {RFID}
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1118--1131",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3138083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3138083",
abstract = "RFID is becoming ubiquitously available in our daily
life. After RFID tags are deployed to make attached
objects identifiable, a natural next step is to
communicate with the tags and collect their information
for the purpose of tracking tagged objects or
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:OCL,
author = "Kaiyang Liu and Jun Peng and Jingrong Wang and
Jianping Pan",
title = "Optimal Caching for Low Latency in Distributed Coded
Storage Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1132--1145",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3133215",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3133215",
abstract = "Erasure codes have been widely considered as a
promising solution to enhance data reliability at low
storage costs. However, in modern geo-distributed
storage systems, erasure codes may incur high data
access latency as they require data retrieval from
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:RSM,
author = "Jingzhou Wang and Gongming Zhao and Hongli Xu and
Yutong Zhai and Qianyu Zhang and He Huang and Yongqiang
Yang",
title = "A Robust Service Mapping Scheme for Multi-Tenant
Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1146--1161",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3133293",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3133293",
abstract = "In a multi-tenant cloud, cloud vendors provide
services (e.g., elastic load-balancing, virtual private
networks) on service nodes for tenants. Thus, the
mapping of tenants&\#x2019; traffic and service nodes
is an important issue in multi-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiong:2022:NTS,
author = "Sijie Xiong and Anand D. Sarwate and Narayan B.
Mandayam",
title = "Network Traffic Shaping for Enhancing Privacy in {IoT}
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1162--1177",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3140174",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3140174",
abstract = "Motivated by traffic analysis attacks based on the
packet sizes and timing information in the Internet of
Things (IoT) networks, we establish a rigorous
event-level differential privacy (DP) model on infinite
packet streams. We propose a traffic shaper \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fang:2022:TAR,
author = "Chongrong Fang and Haoyu Liu and Mao Miao and Jie Ye
and Lei Wang and Wansheng Zhang and Daxiang Kang and
Biao Lyu and Shunmin Zhu and Peng Cheng and Jiming
Chen",
title = "Towards Automatic Root Cause Diagnosis of Persistent
Packet Loss in Cloud Overlay Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1178--1192",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3137557",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3137557",
abstract = "Persistent packet loss in the cloud-scale overlay
network severely compromises tenant experiences. Cloud
providers are keen to diagnose such problems
efficiently. However, existing work is either designed
for the physical network or insufficient to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2022:DTS,
author = "Hehuan Shi and Lin Chen",
title = "Downlink Transmission Scheduling With Data Sharing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1193--1202",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3138940",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3138940",
abstract = "We formulate and analyze a fundamental downlink
transmission scheduling problem in a wireless
communication system, composed of a base station and a
set of users, each requesting a packet to be served
within a time window. Some packets are requested by
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:MAT,
author = "Qingyu Liu and Haibo Zeng and Minghua Chen",
title = "Minimizing {AoI} With Throughput Requirements in
Multi-Path Network Communication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1203--1216",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3135494",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3135494",
abstract = "We consider a single-unicast networking scenario where
a sender periodically sends a batch of data to a
receiver over a multi-hop network, possibly using
multiple paths. We study problems of minimizing
peak/average Age-of-Information (AoI). \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Perez-Bueno:2022:LPP,
author = "Fernando P{\'e}rez-Bueno and Luz Garc{\'\i}a and
Gabriel Maci{\'a}-Fern{\'a}ndez and Rafael Molina",
title = "Leveraging a Probabilistic {PCA} Model to Understand
the Multivariate Statistical Network Monitoring
Framework for Network Security Anomaly Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1217--1229",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3138536",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3138536",
abstract = "Network anomaly detection is a very relevant research
area nowadays, especially due to its multiple
applications in the field of network security. The
boost of new models based on variational autoencoders
and generative adversarial networks has motivated
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tu:2022:RAR,
author = "Huaqing Tu and Gongming Zhao and Hongli Xu and
Yangming Zhao and Yutong Zhai",
title = "A Robustness-Aware Real-Time {SFC} Routing Update
Scheme in Multi-Tenant Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1230--1244",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3137418",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3137418",
abstract = "In multi-tenant clouds, requests need to traverse a
set of network functions (NFs) in a specific order,
referred to as a service function chain (SFC), for
security and business logic issues. Due to workload
dynamics, the central controller of a multi-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2022:SBC,
author = "Hehuan Shi and Lin Chen",
title = "From Spectrum Bonding to Contiguous-Resource Batching
Task Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1245--1254",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3138991",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3138991",
abstract = "We formulate and analyze a generic task scheduling
problem: a set of tasks need to be executed on a pool
of continuous resource such as spectrum and memory,
each requiring a certain amount of time and contiguous
resource; some tasks can be executed \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2022:DTL,
author = "Qiong Wu and Kaiwen He and Xu Chen and Shuai Yu and
Junshan Zhang",
title = "Deep Transfer Learning Across Cities for Mobile
Traffic Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1255--1267",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3136707",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3136707",
abstract = "Precise citywide mobile traffic prediction is of great
significance for intelligent network planning and
proactive service provisioning. Current traffic
prediction approaches mainly focus on training a
well-performed model for the cities with a large
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hussein:2022:HNM,
author = "Abdalla Hussein and Catherine Rosenberg and Patrick
Mitran",
title = "Hybrid {NOMA} in Multi-Cell Networks: From a
Centralized Analysis to Practical Schemes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1268--1282",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3135599",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3135599",
abstract = "We investigate the performance of a hybrid
non-orthogonal multiple access (NOMA) multi-cell
downlink system (called hybrid as different users can
have different successive interference cancellation
(SIC) capabilities) by first formulating and solving a
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qi:2022:ETC,
author = "Yiwen Qi and Wenke Yu and Xudong Zhao and Xindi Xu",
title = "Event-Triggered Control for Network-Based Switched
Systems With Switching Signals Subject to Dual-Terminal
{DoS} Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1283--1293",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3135963",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3135963",
abstract = "This paper investigates event-triggered control for
saturated switched systems with switching signals
subject to dual-terminal denial-of-service (DoS)
attacks. The original switching signals are sampled and
transmitted to sub-system and sub-controller \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:AAA,
author = "Chaoyun Zhang and Xavier Costa-P{\'e}rez and Paul
Patras",
title = "Adversarial Attacks Against Deep Learning-Based
Network Intrusion Detection Systems and Defense
Mechanisms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1294--1311",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3137084",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3137084",
abstract = "Neural networks (NNs) are increasingly popular in
developing NIDS, yet can prove vulnerable to
adversarial examples. Through these, attackers that may
be oblivious to the precise mechanics of the targeted
NIDS add subtle perturbations to malicious traffic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2022:PAO,
author = "Guocheng Liao and Xu Chen and Jianwei Huang",
title = "Privacy-Aware Online Social Networking With Targeted
Advertisement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1312--1327",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3137513",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3137513",
abstract = "In an online social network, users exhibit personal
information to enjoy social interaction. The social
network provider (SNP) exploits users&\#x2019;
information for revenue generation through targeted
advertisement, in which the SNP presents \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2022:QNS,
author = "Hongyi Zhou and Kefan Lv and Longbo Huang and
Xiongfeng Ma",
title = "Quantum Network: Security Assessment and Key
Management",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1328--1339",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3136943",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3136943",
abstract = "As an extension of quantum key distribution, secure
communication among multiple users is a basic task in a
quantum network. When the quantum network structure
becomes complicated with a large number of users, it is
important to investigate network issues,. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2022:PAP,
author = "Yanyan Han and Hongyi Wu",
title = "Privacy-Aware Participant Recruitment in Opportunistic
Device to Device Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1340--1351",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3141069",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3141069",
abstract = "In most of the existing mobile applications for data
collection and data analytics, either the privacy issue
is frequently neglected or the privacy options are not
configurable by the participants. This paper proposes
configurable privacy level by \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{An:2022:PBB,
author = "Jian An and Zhenxing Wang and Xin He and Xiaolin Gui
and Jindong Cheng and Ruowei Gui",
title = "{PPQC}: a Blockchain-Based Privacy-Preserving Quality
Control Mechanism in Crowdsensing Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1352--1367",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3141582",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3141582",
abstract = "With the rapid development of embedded smart devices,
a new data collection paradigm, mobile crowd-sensing
(MCS), has been proposed. MCS allows individuals from
the crowd to act as sensors and contribute their
observation data. However, existing MCS \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:ADS,
author = "Zhiyuan Wang and Jiancheng Ye and Dong Lin and Yipei
Chen and John C. S. Lui",
title = "Approximate and Deployable Shortest Remaining
Processing Time Scheduler",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "3",
pages = "1368--1381",
month = jun,
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3142148",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:06 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3142148",
abstract = "The scheduling policy installed on switches of
datacenters plays a significant role on congestion
control. Shortest-Remaining-Processing-Time (SRPT)
achieves the near-optimal average message completion
time (MCT) in various scenarios, but is difficult to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{BenBasat:2022:MMS,
author = "Ran {Ben Basat} and Gil Einziger and Isaac Keslassy
and Ariel Orda and Shay Vargaftik and Erez Waisbard",
title = "{Memento}: Making Sliding Windows Efficient for Heavy
Hitters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1440--1453",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3132385",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3132385",
abstract = "Cloud operators require timely identification of Heavy
Hitters (HH) and Hierarchical Heavy Hitters (HHH) for
applications such as load balancing, traffic
engineering, and attack mitigation. However, existing
techniques are slow in detecting new heavy \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kim:2022:MOB,
author = "Junghoon Kim and Taejoon Kim and Morteza Hashemi and
David J. Love and Christopher G. Brinton",
title = "Minimum Overhead Beamforming and Resource Allocation
in {D2D} Edge Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1454--1468",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3133022",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3133022",
abstract = "Device-to-device (D2D) communications is expected to
be a critical enabler of distributed computing in edge
networks at scale. A key challenge in providing this
capability is the requirement for judicious management
of the heterogeneous communication and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2022:EMB,
author = "Jie Zhao and Xin Wang",
title = "On the Efficiency of Multi-Beam Medium Access for
Millimeter-Wave Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1469--1480",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3137562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3137562",
abstract = "The need of highly directional communications at
mmWave band introduces high overhead for beam training
and alignment, which also makes the medium access
control (MAC) a grand challenge. However, the need of
supporting highly directional multiple beams \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2022:SAR,
author = "Xuedou Xiao and Wei Wang and Tao Jiang",
title = "Sensor-Assisted Rate Adaptation for {UAV} {MU-MIMO}
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1481--1493",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3136911",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3136911",
abstract = "Propelled by multi-user MIMO (MU-MIMO) technology,
unmanned aerial vehicles (UAVs) as mobile hotspots have
recently emerged as an attractive wireless
communication paradigm. Rate adaptation (RA) becomes
indispensable to enhance UAV communication \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jajoo:2022:CSB,
author = "Akshay Jajoo and Y. Charlie Hu and Xiaojun Lin",
title = "A Case for Sampling-Based Learning Techniques in
Coflow Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1494--1508",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2021.3138923",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3138923",
abstract = "Coflow scheduling improves data-intensive application
performance by improving their networking performance.
State-of-the-art online coflow schedulers in essence
approximate the classic Shortest-Job-First (SJF)
scheduling by learning the coflow \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vaze:2022:SSP,
author = "Rahul Vaze and Jayakrishnan Nair",
title = "Speed Scaling on Parallel Servers With {MapReduce}
Type Precedence Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1509--1524",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3142091",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3142091",
abstract = "A multiple server setting is considered, where each
server has tunable speed, and increasing the speed
incurs an energy cost. Jobs arrive to a single queue,
and each job has two types of sub-tasks, map and
reduce, and a {\bf precedence} constraint \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:TOP,
author = "Yuntao Wang and Weiwei Chen and Tom H. Luan and Zhou
Su and Qichao Xu and Ruidong Li and Nan Chen",
title = "Task Offloading for Post-Disaster Rescue in Unmanned
Aerial Vehicles Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1525--1539",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3140796",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3140796",
abstract = "Natural disasters often cause huge and unpredictable
losses to human lives and properties. In such an
emergency post-disaster rescue situation, unmanned
aerial vehicles (UAVs) are effective tools to enter the
damaged areas to perform immediate disaster \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Neely:2022:CRC,
author = "Michael J. Neely",
title = "A Converse Result on Convergence Time for
Opportunistic Wireless Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1540--1553",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3146126",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3146126",
abstract = "This paper proves an impossibility result for
stochastic network utility maximization for multi-user
wireless systems, including multiple access and
broadcast systems. Every time slot an access point
observes the current channel states for each user and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Iqbal:2022:CAL,
author = "Hassan Iqbal and Anand Singh and Muhammad Shahzad",
title = "Characterizing the Availability and Latency in {AWS}
Network From the Perspective of Tenants",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1554--1568",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3148701",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3148701",
abstract = "Scalability and performance requirements are driving
tenants to increasingly move their applications to
public clouds. Unfortunately, cloud providers do not
provide a view of their networking infrastructure to
the tenants, rather only provide some generic
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hosseinalipour:2022:MSH,
author = "Seyyedali Hosseinalipour and Sheikh Shams Azam and
Christopher G. Brinton and Nicol{\`o} Michelusi and
Vaneet Aggarwal and David J. Love and Huaiyu Dai",
title = "Multi-Stage Hybrid Federated Learning Over Large-Scale
{D2D}-Enabled Fog Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1569--1584",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3143495",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3143495",
abstract = "Federated learning has generated significant interest,
with nearly all works focused on a
&\#x201C;star&\#x201D; topology where nodes/devices are
each connected to a central server. We migrate away
from this architecture and extend it through the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nadig:2022:SSM,
author = "Deepak Nadig and Byrav Ramamurthy and Brian
Bockelman",
title = "{SNAG}: {SDN}-Managed Network Architecture for
{GridFTP} Transfers Using Application-Awareness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1585--1598",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3150000",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3150000",
abstract = "Increasingly, academic campus networks support
large-scale data transfer workflows for data-intensive
science. These data transfers rely on high-performance,
scalable, and reliable protocols for moving large
amounts of data over a high-bandwidth, high-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:CSC,
author = "Zhuozhao Li and Haiying Shen",
title = "Co-Scheduler: a Coflow-Aware Data-Parallel Job
Scheduler in Hybrid Electrical\slash Optical Datacenter
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1599--1612",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3143232",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3143232",
abstract = "To support higher demand for datacenter networks,
networking researchers have proposed hybrid
electrical/optical datacenter networks (Hybrid-DCN)
that leverages optical circuit switching (OCS) along
with traditional electrical packet switching (EPS).
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Du:2022:SBR,
author = "Jun Du and Chunxiao Jiang and Abderrahim Benslimane
and Song Guo and Yong Ren",
title = "{SDN}-Based Resource Allocation in Edge and Cloud
Computing Systems: an Evolutionary {Stackelberg}
Differential Game Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1613--1628",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3152150",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3152150",
abstract = "Recently, the boosting growth of computation-heavy
applications raises great challenges for the Fifth
Generation (5G) and future wireless networks. As
responding, the hybrid edge and cloud computing (ECC)
system has been expected as a promising solution
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Song:2022:EEP,
author = "Guanglei Song and Jiahai Yang and Zhiliang Wang and
Lin He and Jinlei Lin and Long Pan and Chenxin Duan and
Xiaowen Quan",
title = "{DET}: Enabling Efficient Probing of {IPv6} Active
Addresses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1629--1643",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3145040",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3145040",
abstract = "Fast IPv4 scanning significantly improves network
measurement and security research. Nevertheless, it is
infeasible to perform brute-force scanning of the IPv6
address space. Alternatively, one can find active IPv6
addresses through scanning the candidate \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:SIM,
author = "Zhuozhao Li and Tanmoy Sen and Haiying Shen and Mooi
Choo Chuah",
title = "A Study on the Impact of Memory {DoS} Attacks on Cloud
Applications and Exploring Real-Time Detection
Schemes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1644--1658",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3144895",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3144895",
abstract = "Even though memory denial-of-service attacks can cause
severe performance degradations on co-located virtual
machines, a previous detection scheme against such
attacks cannot accurately detect the attacks and also
generates high detection \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hilton:2022:BIS,
author = "Alden Hilton and Joel Hirschmann and Casey Deccio",
title = "Beware of {IPs} in Sheep's Clothing: Measurement and
Disclosure of {IP} Spoofing Vulnerabilities",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1659--1673",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3149011",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3149011",
abstract = "Networks not employing destination-side source address
validation (DSAV) expose themselves to a class of
pernicious attacks which could be prevented by
filtering inbound traffic purporting to originate from
within the network. In this work, we survey the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:FAC,
author = "Haibo Wang and Chaoyi Ma and Shigang Chen and Yuanda
Wang",
title = "Fast and Accurate Cardinality Estimation by
Self-Morphing Bitmaps",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1674--1688",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3147204",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3147204",
abstract = "Estimating the cardinality of a data stream is a
fundamental problem underlying numerous applications
such as traffic monitoring in a network or a datacenter
and query optimization of Internet-scale P2P data
networks. Existing solutions suffer from high
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:TFA,
author = "Xiao-Yan Li and Wanling Lin and Jou-Ming Chang and
Xiaohua Jia",
title = "Transmission Failure Analysis of Multi-Protection
Routing in Data Center Networks With Heterogeneous
Edge-Core Servers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1689--1702",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3147320",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3147320",
abstract = "The recently proposed RCube network is a cube-based
server-centric data center network (DCN), including two
types of heterogeneous servers, called core servers and
edge servers. Remarkably, it takes the latter as backup
servers to deal with server \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cai:2022:PEV,
author = "Yunxiang Cai and Hongzi Zhu and Shan Chang and Xiao
Wang and Jiangang Shen and Minyi Guo",
title = "{PeerProbe}: Estimating Vehicular Neighbor
Distribution With Adaptive Compressive Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1703--1716",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3149008",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3149008",
abstract = "Acquiring the geographical distribution of neighbors
can support more adaptive media access control (MAC)
protocols and other safety applications in Vehicular ad
hoc network (VANETs). However, it is very challenging
for each vehicle to estimate its own \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:VRA,
author = "Chang Liu and Jean Tourrilhes and Chen-Nee Chuah and
Puneet Sharma",
title = "{Voyager}: {Revisiting} Available Bandwidth Estimation
With a New Class of Methods --- Decreasing- Chirp-Train
Methods",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1717--1732",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3152175",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3152175",
abstract = "The available bandwidth (ABW) of a network path is a
crucial metric for various applications, such as
traffic engineering, congestion control, multimedia
streaming, and path selection in software-defined
wide-area networks (SDWAN). In recent years, a new
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2022:WTF,
author = "Edwin Yang and Song Fang and Ian Markwood and Yao Liu
and Shangqing Zhao and Zhuo Lu and Haojin Zhu",
title = "Wireless Training-Free Keystroke Inference Attack and
Defense",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1733--1748",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3147721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3147721",
abstract = "Existing research work has identified a new class of
attacks that can eavesdrop on the keystrokes in a
non-invasive way without infecting the target computer
to install malware. The common idea is that pressing a
key of a keyboard can cause a unique and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gopalam:2022:DLS,
author = "Swaroop Gopalam and Stephen V. Hanly and Philip
Whiting",
title = "Distributed and Local Scheduling Algorithms for
{mmWave} Integrated Access and Backhaul",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1749--1764",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3154367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3154367",
abstract = "We consider the stability region of a mmWave
integrated access and backhaul (IAB) network with
stochastic arrivals and time-varying link rates. In the
scheduling of links, we consider a limit on the number
of RF chains, and the half-duplex constraint \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2022:DTB,
author = "Junsong Fu and Na Wang and Leyao Nie and Baojiang Cui
and Bharat K. Bhargava",
title = "Defending Trace-Back Attack in {$3$D} Wireless
{Internet of Things}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1765--1779",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3149293",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3149293",
abstract = "With the development of 5G, it is unsurprising that
most of the smart devices in the Internet of Things
(IoT) will be wirelessly connected with each other in
the near future. This kind of lightweight, scalable and
green network architecture will be well-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mohammadpour:2022:ADT,
author = "Ehsan Mohammadpour and Jean-Yves {Le Boudec}",
title = "Analysis of Dampers in Time-Sensitive Networks With
Non-Ideal Clocks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1780--1794",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3152178",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3152178",
abstract = "Dampers are devices that reduce delay jitter in the
context of time-sensitive networks, by delaying packets
for the amount written in packet headers. Jitter
reduction is required by some real-time applications;
beyond this, dampers have the potential to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nasralla:2022:BRO,
author = "Zaid H. Nasralla and Taisir E. H. Elgorashi and Ali
Hammadi and Mohamed O. I. Musa and Jaafar M. H.
Elmirghani",
title = "Blackout Resilient Optical Core Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1795--1806",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3156529",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3156529",
abstract = "A disaster may not necessarily demolish the
telecommunications infrastructure, but instead it might
affect the national grid and cause blackouts,
consequently disrupting the network operation unless
there is an alternative power source(s). In disaster-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:PAA,
author = "Yuting Wang and Xiaolong Zheng and Liang Liu and
Huadong Ma",
title = "{PolarTracker}: Attitude-Aware Channel Access for
Floating Low Power Wide Area Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1807--1821",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3154937",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3154937",
abstract = "Low Power Wide Area Networks (LPWAN) such as Long
Range (LoRa) show great potential in emerging aquatic
IoT applications. However, our deployment experience
shows that the floating LPWAN suffers significant
performance degradation, compared to the static
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sterz:2022:MSS,
author = "Artur Sterz and Patrick Felka and Bernd Simon and
Sabrina Klos and Anja Klein and Oliver Hinz and Bernd
Freisleben",
title = "Multi-Stakeholder Service Placement via Iterative
Bargaining With Incomplete Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1822--1837",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3157040",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3157040",
abstract = "Mobile edge computing based on cloudlets is an
emerging paradigm to improve service quality by
bringing computation and storage facilities closer to
end users and reducing operating cost for
infrastructure providers (IPs) and service providers
(SPs). To \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Avin:2022:DAN,
author = "Chen Avin and Kaushik Mondal and Stefan Schmid",
title = "Demand-Aware Network Design With Minimal Congestion
and Route Lengths",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1838--1848",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3153586",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3153586",
abstract = "Emerging communication technologies allow to
reconfigure the physical network topology at runtime,
enabling demand-aware networks (DANs): networks whose
topology is optimized toward the workload they serve.
However, today, only little is \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xue:2022:SSC,
author = "Kaiping Xue and Peixuan He and Jiayu Yang and Qiudong
Xia and David S. L. Wei",
title = "{SCD2}: Secure Content Delivery and Deduplication With
Multiple Content Providers in Information Centric
Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1849--1864",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3155110",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3155110",
abstract = "As one of the promising next generation network
architectures, information centric networking (ICN) is
highly anticipated to improve the bandwidth usage of
the Internet and reduce duplicate traffic. Since
contents in ICN are disseminated in the whole
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Josilo:2022:JWE,
author = "Sladana Jo{\v{s}}ilo and Gy{\"o}rgy D{\'a}n",
title = "Joint Wireless and Edge Computing Resource Management
With Dynamic Network Slice Selection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "4",
pages = "1865--1878",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3156178",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:08 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3156178",
abstract = "Network slicing is a promising approach for enabling
low latency computation offloading in edge computing
systems. In this paper, we consider an edge computing
system under network slicing in which the wireless
devices generate latency sensitive \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Matousek:2022:CNB,
author = "Ji{\v{r}}{\'\i} Matou{\v{s}}ek and Adam
Lu{\v{c}}ansk{\'y} and David Jane{\v{c}}ek and Jozef
Sabo and Jan Ko{\v{r}}enek and Gianni Antichi",
title = "{ClassBench-ng}: Benchmarking Packet Classification
Algorithms in the {OpenFlow} Era",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1912--1925",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3155708",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3155708",
abstract = "Packet classification, i.e., the process of
categorizing packets into flows, is a first-class
citizen in any networking device. Every time a new
packet has to be processed, one or more header fields
need to be compared against a set of pre-installed
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jahanian:2022:CCI,
author = "Mohammad Jahanian and K. K. Ramakrishnan",
title = "{CoNICE}: Consensus in Intermittently-Connected
Environments by Exploiting Naming With Application to
Emergency Response",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1926--1939",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3156101",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3156101",
abstract = "In many scenarios, information must be disseminated
over intermittently-connected environments when the
network infrastructure becomes unavailable, e.g.,
during disasters where first responders need to send
updates about critical tasks. If such updates
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Biswas:2022:BAU,
author = "Nilanjan Biswas and Goutam Das and Priyadip Ray",
title = "Buffer-Aware User Selection and Resource Allocation
for an Opportunistic Cognitive Radio Network: a
Cross-Layer Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1940--1954",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3159819",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3159819",
abstract = "In this paper, we focus on a cross-layer resource
allocation problem for an opportunistic cognitive radio
network, where secondary users (SUs) share a primary
network's licensed spectrum only when the primary
network is sensed to be idle. We \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2022:FRL,
author = "Kun Xie and Jiazheng Tian and Xin Wang and Gaogang Xie
and Jiannong Cao and Hongbo Jiang and Jigang Wen",
title = "Fast Retrieval of Large Entries With Incomplete
Measurement Data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1955--1969",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3160233",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3160233",
abstract = "In network-wide monitoring, finding the large
monitoring data entries is a fundamental network
management function. However, the retrieval of large
entries is extremely difficult and challenging as a
result of incompleteness of network measurement data.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Das:2022:SOD,
author = "Sushovan Das and Afsaneh Rahbar and Xinyu Crystal Wu
and Zhuang Wang and Weitao Wang and Ang Chen and T. S.
Eugene Ng",
title = "{Shufflecast}: an Optical, Data-Rate Agnostic, and
Low-Power Multicast Architecture for Next-Generation
Compute Clusters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1970--1985",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3158899",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3158899",
abstract = "An optical circuit-switched network core has the
potential to overcome the inherent challenges of a
conventional electrical packet-switched core of today's
compute clusters. As optical circuit switches (OCS)
directly handle the photon beams without \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tran:2022:SDM,
author = "Hai-Anh Tran and Duc Tran and Abdelhamid Mellouk",
title = "State-Dependent Multi-Constraint Topology
Configuration for Software-Defined Service Overlay
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "1986--2001",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3155475",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3155475",
abstract = "Service Overlay Network (SON) is an efficient solution
for ensuring the end-to-end Quality of Service (QoS) in
different real-world applications, including
Video-on-Demand, Voice over IP, and other value-added
Internet-based services. Although SON offers \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Karakoc:2022:FEN,
author = "Nurullah Karako{\c{c}} and Anna Scaglione and Martin
Reisslein and Ruiyuan Wu",
title = "Federated Edge Network Utility Maximization for a
Multi-Server System: Algorithm and Convergence",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2002--2017",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3156530",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3156530",
abstract = "We propose a novel Federated Edge Network Utility
Maximization (FEdg-NUM) architecture for solving a
large-scale distributed network utility maximization
(NUM) problem. In FEdg-NUM, clients with private
utilities communicate to a peer-to-peer network of
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Vyavahare:2022:SDE,
author = "Pooja Vyavahare and Jayakrishnan Nair and D.
Manjunath",
title = "Sponsored Data: On the Effect of {ISP} Competition on
Pricing Dynamics and Content Provider Market
Structures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2018--2031",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3162856",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3162856",
abstract = "We analyze the effect of sponsored data when Internet
service providers (ISPs) compete for subscribers and
content providers (CPs) compete for a share of the
bandwidth usage by customers. Our model is of a full
information, leader-follower game. ISPs lead \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:ZAH,
author = "Zhenghao Zhang and Raghav Rathi and Steven Perez and
Jumana Bukhari and Yaoguang Zhong",
title = "{ZCNET}: Achieving High Capacity in Low Power Wide
Area Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2032--2045",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3158482",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3158482",
abstract = "In this paper, a novel LPWAN technology, ZCNET, is
proposed, which achieves significantly higher network
capacity than existing solutions, such as LoRa, Sigfox,
and RPMA. The capacity boost of ZCNET is mainly due to
two reasons. First, a ZCNET node \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:SAI,
author = "Chengzhang Li and Qingyu Liu and Shaoran Li and Yongce
Chen and Y. Thomas Hou and Wenjing Lou and Sastry
Kompella",
title = "Scheduling With Age of Information Guarantee",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2046--2059",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3156866",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3156866",
abstract = "Age of Information (AoI) is an application layer
performance metric that quantifies the freshness of
information. This paper investigates scheduling
problems at network edge when there is an AoI
requirement for each source node, which we call Maximum
AoI \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:UDP,
author = "Meng Li and Liehuang Zhu and Zijian Zhang and Chhagan
Lal and Mauro Conti and Mamoun Alazab",
title = "User-Defined Privacy-Preserving Traffic Monitoring
Against $n$-by-1 Jamming Attack",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2060--2073",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3157654",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3157654",
abstract = "Traffic monitoring services collect traffic reports
and respond to users' traffic queries. However, the
reports and queries may reveal the user's identity and
location. Although different anonymization techniques
have been applied to protect \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2022:CCC,
author = "Gaoxiong Zeng and Wei Bai and Ge Chen and Kai Chen and
Dongsu Han and Yibo Zhu and Lei Cui",
title = "Congestion Control for Cross-Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2074--2089",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3161580",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3161580",
abstract = "Geographically distributed applications hosted on
cloud are becoming prevalent. They run on
cross-datacenter network that consists of multiple data
center networks (DCNs) connected by a wide area network
(WAN). Such a cross-DC network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:LQD,
author = "Chun Li and Yunyun Yang and Hui Liang and Boying Wu",
title = "Learning Quantum Drift-Diffusion Phenomenon by
Physics-Constraint Machine Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2090--2101",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3158987",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3158987",
abstract = "Recently, deep learning (DL) is widely used to detect
physical phenomena and has obtained encouraging
results. Several works have shown that it can learn
quantum phenomenon. Subsequently, quantum machine
learning (QML) has been paid more attention by
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Smith:2022:TIM,
author = "Kevin D. Smith and Saber Jafarpour and Ananthram Swami
and Francesco Bullo",
title = "Topology Inference With Multivariate Cumulants: The
{M{\"o}bius} Inference Algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2102--2116",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3164336",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3164336",
abstract = "Many tasks regarding the monitoring, management, and
design of communication networks rely on knowledge of
the routing topology. However, the standard approach to
topology mapping --- namely, active probing with
traceroutes --- relies on cooperation \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2022:LRD,
author = "Guangyang Zeng and Biqiang Mu and Jieqiang Wei and
Wing Shing Wong and Junfeng Wu",
title = "Localizability With Range-Difference Measurements:
Numerical Computation and Error Bound Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2117--2130",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3162930",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3162930",
abstract = "This paper studies the localization problem using
noisy range-difference measurements, or equivalently
time difference of arrival (TDOA) measurements. There
is a reference sensor, and for each other sensor, the
TDOA measurement is obtained with respect to \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:IMS,
author = "Yunshu Liu and Zhixuan Fang and Man Hon Cheung and Wei
Cai and Jianwei Huang",
title = "An Incentive Mechanism for Sustainable Blockchain
Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2131--2144",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3166459",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3166459",
abstract = "Miners in a blockchain system are suffering from
ever-increasing storage costs, which in general have
not been properly compensated by the users' transaction
fees. This reduces the incentives for the miners'
participation and may jeopardize \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2022:MAP,
author = "Hui Yang and Qiuyan Yao and Bowen Bao and Ao Yu and
Jie Zhang and Athanasios V. Vasilakos",
title = "Multi-Associated Parameters Aggregation-Based Routing
and Resources Allocation in Multi-Core Elastic Optical
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2145--2157",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3164869",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3164869",
abstract = "Space division multiplexing (SDM), as a potential
means of enhancing the capacity of optical transmission
systems, has attracted widespread attention. However,
the adoption of SDM technology has also additionally
increased resource dimensions, introduced \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2022:DSC,
author = "Renjie Xie and Jiahao Cao and Qi Li and Kun Sun and
Guofei Gu and Mingwei Xu and Yuan Yang",
title = "Disrupting the {SDN} Control Channel via Shared Links:
Attacks and Countermeasures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2158--2172",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3169136",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3169136",
abstract = "Software-Defined Networking (SDN). SDN enables network
innovations with a centralized controller controlling
the whole network through the control channel. Because
the control channel delivers all network control
traffic, its security and reliability are \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dai:2022:TFR,
author = "Lin Dai",
title = "A Theoretical Framework for Random Access: Stability
Regions and Transmission Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2173--2200",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3164458",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3164458",
abstract = "As one of the two fundamental types of multiple
access, random access has been widely adopted in
various communication networks, and expected to play an
increasingly central role owing to the rising
popularity of Machine-to-Machine (M2M) communications.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:AFL,
author = "Xuezheng Liu and Zhicong Zhong and Yipeng Zhou and Di
Wu and Xu Chen and Min Chen and Quan Z. Sheng",
title = "Accelerating Federated Learning via Parallel Servers:
a Theoretically Guaranteed Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2201--2215",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3168939",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3168939",
abstract = "With the growth of participating clients, the
centralized parameter server (PS) will seriously limit
the scale and efficiency of Federated Learning (FL). A
straightforward approach to scale up the FL system is
to construct a Parallel FL (PFL) system with \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tabatabaee:2022:DRR,
author = "Seyed Mohammadhossein Tabatabaee and Jean-Yves {Le
Boudec}",
title = "Deficit Round-Robin: a Second Network Calculus
Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2216--2230",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3164772",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3164772",
abstract = "Deficit Round-Robin (DRR) is a widespread scheduling
algorithm that provides fair queueing with
variable-length packets. Bounds on worst-case delays
for DRR were found by Boyer et al., who used a rigorous
network calculus approach and characterized the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2022:HCB,
author = "Feng Li and Jichao Zhao and Dongxiao Yu and Xiuzhen
Cheng and Weifeng Lv",
title = "Harnessing Context for Budget-Limited Crowdsensing
With Massive Uncertain Workers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2231--2245",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3169180",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3169180",
abstract = "Crowdsensing is an emerging paradigm of ubiquitous
sensing, through which a crowd of workers are recruited
to perform sensing tasks collaboratively. Although it
has stimulated many applications, an open fundamental
problem is how to select among a massive \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2022:SMS,
author = "Hongli Xu and Peng Xi and Gongming Zhao and Jianchun
Liu and Chen Qian and Liusheng Huang",
title = "{SAFE-ME}: Scalable and Flexible Policy Enforcement in
Middlebox Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2246--2261",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3167169",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3167169",
abstract = "The past decades have seen a proliferation of
middlebox deployment in various scenarios, including
backbone networks and cloud networks. Since flows have
to traverse specific service function chains (SFCs) for
security and performance enhancement, it \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2022:CPO,
author = "Lin Chen and Shan Lin and Hua Huang and Weihua Yang",
title = "Charging Path Optimization in Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2262--2273",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3167781",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3167781",
abstract = "We study a class of generic charging path optimization
problems arising from emerging networking applications,
where mobile chargers are dispatched to deliver energy
to mobile agents (e.g., robots, drones, vehicles),
which have specified tasks and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:DBG,
author = "Lei Zhang and Yong Cui and Mowei Wang and Kewei Zhu
and Yibo Zhu and Yong Jiang",
title = "{DeepCC}: Bridging the Gap Between Congestion Control
and Applications via Multiobjective Optimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2274--2288",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3167713",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3167713",
abstract = "The increasingly complicated and diverse applications
have distinct network performance demands, e.g., some
desire high throughput while others require low
latency. Traditional congestion controls (CC) have no
perception of these demands. Consequently, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liwang:2022:OEC,
author = "Minghui Liwang and Xianbin Wang",
title = "Overbooking-Empowered Computing Resource Provisioning
in Cloud-Aided Mobile Edge Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2289--2303",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3167396",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3167396",
abstract = "Conventional computing resource trading over mobile
networks generally faces many challenges, e.g.,
excessive decision-making latency, undesired trading
failures, and underutilization of dynamic resources,
owing to the constraint of wireless networks. To
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2022:LLF,
author = "Lei Shi and Yuhua Cheng and Jinliang Shao and Qingchen
Liu and Wei Xing Zheng",
title = "Locating Link Failures in {WSNs} via Cluster Consensus
and Graph Decomposition",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2304--2314",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3171272",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3171272",
abstract = "With the popularization of network equipment and the
rapid development of information technology, the scale
and complexity of wireless sensor networks (WSNs)
continue to expand. How to effectively locate link
failures has become a challenging problem in \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abolhassani:2022:FCD,
author = "Bahman Abolhassani and John Tadrous and Atilla
Eryilmaz and Edmund Yeh",
title = "Fresh Caching of Dynamic Content Over the Wireless
Edge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2315--2327",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3170245",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3170245",
abstract = "We introduce a framework and provably-efficient
schemes for &\#x2018;fresh' caching at the (front-end)
local cache of content that is subject to
&\#x2018;dynamic' updates at the (back-end) database.
We start by formulating the hard-cache-. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{An:2022:TAW,
author = "Zhenlin An and Qiongzheng Lin and Lei Yang and Lei
Xie",
title = "{Tagcaster}: Activating Wireless Voice of Electronic
Toll Collection Systems With Zero Start-Up Cost",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2328--2342",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3169914",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3169914",
abstract = "This work enhances the machine-to-human communication
between electronic toll collection (ETC) systems and
drivers by providing an AM broadcast service to
deployed ETC systems. This study is the first to show
that ultra-high radio frequency identification
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2022:TTV,
author = "Hyunseok Chang and Matteo Varvello and Fang Hao and
Sarit Mukherjee",
title = "A Tale of Three Videoconferencing Applications:
{Zoom}, {Webex}, and {Meet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "5",
pages = "2343--2358",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3171467",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3171467",
abstract = "Since the outbreak of the COVID-19 pandemic,
videoconferencing has become the default mode of
communication in our daily lives at homes, workplaces
and schools, and it is likely to remain an important
part of our lives in the post-pandemic world. Despite
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2022:EOL,
author = "Zhenhua Han and Haisheng Tan and Rui Wang and Yuncong
Hong and Francis C. M. Lau",
title = "Efficient Online Learning Based Cross-Tier Uplink
Scheduling in {HetNets}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2389--2402",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3173432",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3173432",
abstract = "Heterogeneous cellular networks (HetNets), where
low-power low-complexity base stations (Pico-BSs) are
deployed inside the coverage of macro base stations
(Macro-BSs), can significantly improve the spectrum
efficiency by Pico- and Macro base station \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bankhamer:2022:LFR,
author = "Gregor Bankhamer and Robert Els{\"a}sser and Stefan
Schmid",
title = "Local Fast Rerouting With Low Congestion: a Randomized
Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2403--2418",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174731",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174731",
abstract = "Most modern communication networks include fast
rerouting mechanisms, implemented entirely in the data
plane, to quickly recover connectivity after link
failures. By relying on local failure information only,
these data plane mechanisms provide very fast
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Avin:2022:PTO,
author = "Chen Avin and Kaushik Mondal and Stefan Schmid",
title = "Push-Down Trees: Optimal Self-Adjusting Complete
Trees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2419--2432",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174118",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174118",
abstract = "This paper studies a fundamental algorithmic problem
related to the design of demand-aware networks:
networks whose topologies adjust toward the traffic
patterns they serve, in an online manner. The goal is
to strike a tradeoff between the benefits of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2022:ARC,
author = "Tian Xie and Namitha Nambiar and Ting He and Patrick
McDaniel",
title = "Attack Resilience of Cache Replacement Policies: a
Study Based on {TTL} Approximation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2433--2447",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3171720",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3171720",
abstract = "Caches are pervasively used in communication networks
to speed up content access by reusing previous
communications, where various replacement policies are
used to manage the cached contents. The replacement
policy of a cache plays a key role in its \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Blocher:2022:HRS,
author = "Marcel Bl{\"o}cher and Lin Wang and Patrick Eugster
and Max Schmidt",
title = "Holistic Resource Scheduling for Data Center
In-Network Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2448--2463",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174783",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174783",
abstract = "The recent trend towards more programmable switching
hardware in data centers opens up new possibilities for
distributed applications to leverage in-network
computing (INC). Literature so far has largely focused
on individual application scenarios of INC, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jepsen:2022:FRP,
author = "Theo Jepsen and Ali Fattaholmanan and Masoud Moshref
and Nate Foster and Antonio Carzaniga and Robert
Soul{\'e}",
title = "Forwarding and Routing With Packet Subscriptions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2464--2479",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3172066",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3172066",
abstract = "In this paper, we explore how programmable data planes
can naturally provide a higher-level of service to user
applications via a new abstraction called packet
subscriptions. Packet subscriptions generalize
forwarding rules, and can be used to express \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:SCN,
author = "Tianjiao Wang and Zengfu Wang and Bill Moran and Moshe
Zukerman",
title = "Submarine Cable Network Design for Regional
Connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2480--2492",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3171832",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3171832",
abstract = "This paper optimizes path planning for a
trunk-and-branch topology network in an irregular
2-dimensional manifold embedded in 3-dimensional
Euclidean space with application to submarine cable
network planning. We go beyond our earlier focus on the
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shao:2022:ABC,
author = "Xiaozhe Shao and Zibin Chen and Daniel Holcomb and
Lixin Gao",
title = "Accelerating {BGP} Configuration Verification Through
Reducing Cycles in {SMT} Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2493--2504",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3176267",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3176267",
abstract = "Network verification has been proposed to help network
operators eliminate the outage or security issues
caused by misconfigurations. Recent studies have
proposed SMT-based approaches to verify network
properties with respect to network configurations.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cai:2022:URD,
author = "Yang Cai and Jaime Llorca and Antonia M. Tulino and
Andreas F. Molisch",
title = "Ultra-Reliable Distributed Cloud Network Control With
End-to-End Latency Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2505--2520",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3179349",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3179349",
abstract = "We are entering a rapidly unfolding future driven by
the delivery of real-time computation services, such as
industrial automation and augmented reality,
collectively referred to as augmented information (AgI)
services, over highly distributed cloud/edge \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chackochan:2022:AAU,
author = "Reena Chackochan and Albert Sunny and Senthilkumar
Dhanasekaran",
title = "Approximate Aggregate Utility Maximization Using
Greedy Maximal Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2521--2530",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3179451",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3179451",
abstract = "In this paper, we study the problem of aggregate
utility maximization in multihop wireless networks.
Following standard approaches, we consider the dual of
a convex optimization problem that can be decomposed
into two sub-problems. One of the sub-problem
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Boroujeny:2022:DST,
author = "Massieh Kordi Boroujeny and Brian L. Mark",
title = "Design of a Stochastic Traffic Regulator for
End-to-End Network Delay Guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2531--2543",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3181858",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3181858",
abstract = "Providing end-to-end network delay guarantees in
packet-switched networks such as the Internet is highly
desirable for mission-critical and delay-sensitive data
transmission, yet it remains a challenging open
problem. Since deterministic bounds are based
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Veitch:2022:ILB,
author = "Darryl Veitch and Sathiya Kumaran Mani and Yi Cao and
Paul Barford",
title = "{iHorology}: Lowering the Barrier to Microsecond-Level
{Internet} Time",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2544--2558",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174189",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174189",
abstract = "High accuracy, synchronized clocks are essential to a
growing number of Internet applications. Standard
protocols and their associated server infrastructure
typically enable client clocks to synchronize to the
order of tens of milliseconds. We address one
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2022:TAB,
author = "Sijiang Huang and Mowei Wang and Yong Cui",
title = "Traffic-Aware Buffer Management in Shared Memory
Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2559--2573",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3173930",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3173930",
abstract = "Switch buffer serves an important role in the modern
internet. To achieve efficiency, today's switches often
use on-chip shared memory. Shared memory switches rely
on buffer management policies to allocate buffer among
ports. To avoid waste of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tan:2022:AVT,
author = "Qingfeng Tan and Xuebin Wang and Wei Shi and Jian Tang
and Zhihong Tian",
title = "An Anonymity Vulnerability in {Tor}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2574--2587",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174003",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174003",
abstract = "Privacy is currently one of the most concerned issues
in Cyberspace. Tor is the most widely used system in
the world for anonymously accessing Internet. However,
Tor is known to be vulnerable to end-to-end traffic
correlation attacks when an adversary is \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2022:DPM,
author = "Xuehe Wang and Lingjie Duan",
title = "Dynamic Pricing and Mean Field Analysis for
Controlling Age of Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2588--2600",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3174114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3174114",
abstract = "Today many mobile users in various zones are invited
to sense and send back real-time useful information to
keep the freshness of the content updates in such
zones. However, due to the sampling cost in sensing and
transmission, a user may not have the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2022:NOL,
author = "Zichuan Xu and Haozhe Ren and Weifa Liang and Qiufen
Xia and Wanlei Zhou and Pan Zhou and Wenzheng Xu and
Guowei Wu and Mingchu Li",
title = "Near Optimal Learning-Driven Mechanisms for Stable
{NFV} Markets in Multitier Cloud Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2601--2615",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3179295",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3179295",
abstract = "More and more 5G and AI applications demand flexible
and low-cost processing of their traffic through
diverse virtualized network functions (VNFs) to meet
their security and privacy requirements. As such, the
Network Function Virtualization (NFV) market \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2022:EES,
author = "Xianhao Chen and Guangyu Zhu and Haichuan Ding and Lan
Zhang and Haixia Zhang and Yuguang Fang",
title = "End-to-End Service Auction: a General Double Auction
Mechanism for Edge Computing Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2616--2629",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3179239",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3179239",
abstract = "Ubiquitous powerful personal computing facilities,
such as desktop computers and parked autonomous cars,
can function as micro edge computing servers by
leveraging their spare resources. However, to harvest
their resources for service provisioning, two
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dasala:2022:SMW,
author = "Keerthi Priya Dasala and Josep M. Jornet and Edward W.
Knightly",
title = "Scaling {mmWave} {WLANs} With Single {RF} Chain
Multiuser Beamforming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2630--2643",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3182976",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3182976",
abstract = "Multi-user transmission in 60 GHz Wi-Fi can achieve
data rates up to 100 Gbps by multiplexing multiple user
data streams. However, a fundamental limit in the
approach is that each RF chain is limited to supporting
one stream or one user. In this paper, we \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qiu:2022:BWS,
author = "Tie Qiu and Lidi Zhang and Ning Chen and Songwei Zhang
and Wenyuan Liu and Dapeng Oliver Wu",
title = "Born This Way: a Self-Organizing Evolution Scheme With
Motif for {Internet of Things} Robustness",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2644--2657",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3178408",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3178408",
abstract = "The span of Internet of Things (IoT) is expanding
owing to numerous applications being linked to massive
devices. Subsequently, node failures frequently occur
because of malicious attacks, battery exhaustion, or
other malfunctions. A reliable and robust \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yao:2022:HTL,
author = "Zhiyuan Yao and Yoann Desmouceaux and Juan-Antonio
Cordero-Fuertes and Mark Townsley and Thomas Clausen",
title = "{HLB}: Toward Load-Aware Load Balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2658--2673",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3177163",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3177163",
abstract = "The purpose of network load balancers is to optimize
quality of service to the users of a set of
servers&\#x2013; basically, to improve response times
and to reducing computing resources&\#x2013; by
properly distributing workloads. This paper proposes a
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cohen:2022:FNA,
author = "Itamar Cohen and Gil Einziger and Gabriel Scalosub",
title = "False Negative Awareness in Indicator-Based Caching
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2674--2687",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3177282",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3177282",
abstract = "Distributed caching systems such as content
distribution networks often advertise their content via
lightweight approximate indicators (e.g., Bloom
filters) to efficiently inform clients where each datum
is likely cached. While false-positive indications
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2022:TBN,
author = "Dianxiong Liu and Zhiyong Du and Xiaodu Liu and Heyu
Luan and Yitao Xu and Yifan Xu",
title = "Task-Based Network Reconfiguration in Distributed
{UAV} Swarms: a Bilateral Matching Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2688--2700",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3181036",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3181036",
abstract = "In this paper, we study the problem of network
reconfiguration when unmanned aerial vehicle (UAV)
swarms suffer damage. Multiple UAVs are divided into
several groups to perform various tasks. Each master
UAV is connected to the ground control station and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Thomas:2022:WCD,
author = "Ludovic Thomas and Ahlem Mifdaoui and Jean-Yves {Le
Boudec}",
title = "Worst-Case Delay Bounds in Time-Sensitive Networks
With Packet Replication and Elimination",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2701--2715",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3180763",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3180763",
abstract = "Packet replication and elimination functions are used
by time-sensitive networks (as in the context of IEEE
TSN and IETF DetNet) to increase the reliability of the
network. Packets are replicated onto redundant paths by
a replication function. Later the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2022:JMS,
author = "Zhiwei Zhao and Wenliang Mao and Geyong Min and
Weifeng Gao",
title = "Joint Multichannel-Spatial Diversity for Efficient
Opportunistic Routing in Low-Power Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2716--2729",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3181581",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3181581",
abstract = "Low-power wireless networks (LPWNs) are of paramount
importance for the pervasive deployment of
Internet-of-Things (IoT). To deal with the lossy nature
of LPWNs, opportunistic routing (OR) and multichannel
communications (MC) have received significant
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2022:CAP,
author = "Miao Zhang and Yifei Zhu and Jiangchuan Liu and Feng
Wang and Fangxin Wang",
title = "{CharmSeeker}: Automated Pipeline Configuration for
Serverless Video Processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2730--2743",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3183231",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3183231",
abstract = "Video processing plays an essential role in a wide
range of cloud-based applications. It typically
involves multiple pipelined stages, which well fits the
latest fine-grained serverless computing paradigm if
properly configured to match the cost and delay
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2022:MSN,
author = "Luoyi Fu and Jiapeng Zhang and Shan Qu and Huquan Kang
and Xinbing Wang and Guihai Chen",
title = "Measuring Social Network {De}-Anonymizability by Means
of Morphism Property",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2744--2759",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3180158",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3180158",
abstract = "Anonymization techniques have tranquilized current
social network users in terms of privacy leakage,
however, it does not radically prevent adversaries from
de-anonymizing users, as they may map the users to an
un-anonymized network. Till now, researchers \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xin:2022:FBU,
author = "Yao Xin and Wenjun Li and Guoming Tang and Tong Yang
and Xiaohe Hu and Yi Wang",
title = "{FPGA}-Based Updatable Packet Classification Using
{TSS}-Combined Bit-Selecting Tree",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2760--2775",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3181295",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3181295",
abstract = "OpenFlow switches are being deployed in SDN to enable
a wide spectrum of non-traditional applications. As a
promising alternative to brutal force TCAMs, FPGA-based
packet classification is being actively investigated.
However, none of the existing FPGA \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shakya:2022:DCH,
author = "Nishant Shakya and Fan Li and Jinyuan Chen",
title = "On Distributed Computing With Heterogeneous
Communication Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2776--2787",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3181234",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3181234",
abstract = "We consider a distributed computing framework where
the distributed nodes have different communication
capabilities, motivated by the heterogeneous networks
in data centers and mobile edge computing systems.
Following the structure of MapReduce, this \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2022:LNN,
author = "Xinzhe Fu and Eytan Modiano",
title = "{Learning-NUM}: Network Utility Maximization With
Unknown Utility Functions and Queueing Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2788--2803",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3182890",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3182890",
abstract = "Network Utility Maximization (NUM) studies the
problems of allocating traffic rates to network users
in order to maximize the users' total utility subject
to network resource constraints. In this paper, we
propose a new NUM framework, Learning-NUM, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shen:2022:COS,
author = "Zhirong Shen and Guanglin Zhang",
title = "Competitive Online Stay-or-Switch Algorithms With
Minimum Commitment and Switching Cost",
journal = j-IEEE-TRANS-NETWORKING,
volume = "30",
number = "6",
pages = "2804--2817",
year = "2022",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3183142",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:13 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3183142",
abstract = "In this paper, we consider an online decision problem,
where a decision maker has an option to buy a discount
plan for his/her regular expenses. The discount plan
costs an immediate upfront charge plus a commitment
charge per time slot. Upon expiration, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2023:BBN,
author = "Huikang Li and Yi Gao and Wei Dong and Chun Chen",
title = "Bound-Based Network Tomography for Inferring
Interesting Path Metrics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "1--14",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3180631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3180631",
abstract = "In the &\#x201C;network-as-a-service&\#x201D;
paradigm, network operators have a strong need to know
the performance of critical paths running services to
the users. Network tomography is an attractive
methodology for inferring internal network \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ruzomberkaand:2023:IMH,
author = "Eric Ruzomberkaand and David J. Love",
title = "Interference Moral Hazard in Large Multihop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "15--29",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3186234",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3186234",
abstract = "Cooperation between network nodes is critical for
supporting services in ad hoc networks. Cooperation,
however, is an idealized assumption that may not always
be present. This assumption can fail because of moral
hazard, a scenario in part caused by \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sabnis:2023:GGD,
author = "Anirudh Sabnis and Tareq Si Salem and Giovanni Neglia
and Michele Garetto and Emilio Leonardi and Ramesh K.
Sitaraman",
title = "{GRADES}: Gradient Descent for Similarity Caching",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "30--41",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3187044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3187044",
abstract = "A similarity cache can reply to a query for an object
with similar objects stored locally. In some
applications of similarity caches, queries and objects
are naturally represented as points in a continuous
space. This is for example the case of 360&\#x00B0;.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:LFC,
author = "Xi Chen and Qiao Xiang and Linghe Kong and Huisan Xu
and Xue Liu",
title = "Learning From {FM} Communications: Toward Accurate,
Efficient, All-Terrain Vehicle Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "42--57",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3187885",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3187885",
abstract = "Vehicle localization service is a fundamental
component of intelligent transportation systems. The
widely used satellite navigation systems perform poorly
in urban areas because the lines of sight to satellites
are blocked by complex terrain \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:MLF,
author = "Haoyu Wang and Zetian Liu and Haiying Shen",
title = "Machine Learning Feature Based Job Scheduling for
Distributed Machine Learning Clusters",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "58--73",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3190797",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3190797",
abstract = "With the rapid proliferation of Machine Learning (ML)
and Deep learning (DL) applications running on modern
platforms, it is crucial to satisfy application
performance requirements such as meeting deadline and
ensuring accuracy. To this end, researchers \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2023:EDM,
author = "Xujin Zhou and Irem Koprulu and Atilla Eryilmaz and
Michael J. Neely",
title = "Efficient Distributed {MAC} for Dynamic Demands:
Congestion and Age Based Designs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "74--87",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3191607",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3191607",
abstract = "Future generation wireless technologies are expected
to serve an increasingly dense and dynamic population
of users that generate short bundles of information to
be transferred over the shared spectrum. This calls for
new distributed and low-overhead \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mason:2023:UDR,
author = "Federico Mason and Gianfranco Nencioni and Andrea
Zanella",
title = "Using Distributed Reinforcement Learning for Resource
Orchestration in a Network Slicing Scenario",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "88--102",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3187310",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3187310",
abstract = "The Network Slicing (NS) paradigm enables the
partition of physical and virtual resources among
multiple logical networks, possibly managed by
different tenants. In such a scenario, network
resources need to be dynamically allocated according to
the slice \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:RER,
author = "Jiao Zhang and Xiaolong Zhong and Zirui Wan and Yu
Tian and Tian Pan and Tao Huang",
title = "{RCC}: Enabling Receiver-Driven {RDMA} Congestion
Control With Congestion Divide-and-Conquer in
Datacenter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "103--117",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3185105",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3185105",
abstract = "The development of datacenter applications leads to
the need for end-to-end communication with microsecond
latency. As a result, RDMA is becoming prevalent in
datacenter networks to mitigate the latency caused by
the slow processing speed of the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhu:2023:CPP,
author = "Shaopeng Zhu and Xiaolong Zheng and Liang Liu and
Huadong Ma",
title = "{CSMA\slash PJ}: a Protective Jamming Based {MAC}
Protocol to Harmonize the Long and Short Links",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "118--132",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193027",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193027",
abstract = "WiFi-based Long Distance (WiLD) networks are promising
to cover the rural and remote regions. But the
explosive short-range WiFi deployments result in the
long-short coexistence. Due to CSMA is ignorance of
propagation delay, its carrier sensing is too
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Oikonomou:2023:PFP,
author = "Konstantinos Oikonomou and George Koufoudakis and
Sonia A{\"\i}ssa and Ioannis Stavrakakis",
title = "Probabilistic Flooding Performance Analysis Exploiting
Graph Spectra Properties",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "133--146",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3192310",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3192310",
abstract = "Probabilistic flooding is an efficient information
dissemination policy capable of spreading information
to the network nodes by sending information messages
according to a fixed forwarding probability in a
per-hop manner starting from an initiator node.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:DTO,
author = "Juncheng Wang and Min Dong and Ben Liang and Gary
Boudreau and Hatem Abou-Zeid",
title = "Delay-Tolerant {OCO} With Long-Term Constraints:
Algorithm and Its Application to Network Resource
Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "147--163",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3188285",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3188285",
abstract = "We consider online convex optimization (OCO) with
multi-slot feedback delay. An agent selects a sequence
of online decisions to minimize the accumulation of
time-varying convex loss functions, subject to
short-term and long-term constraints that may be
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yun:2023:ETT,
author = "Xiaochun Yun and Yipeng Wang and Yongzheng Zhang and
Chen Zhao and Zijian Zhao",
title = "Encrypted {TLS} Traffic Classification on Cloud
Platforms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "164--177",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3191312",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3191312",
abstract = "Nowadays, encryption technology has been widely used
to protect user privacy. With the explosive growth of
mobile Internet, encrypted TLS traffic rises sharply
and occupies a great share of current Internet traffic.
In reality, the classification of \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2023:MCD,
author = "Shouxi Luo and Pingzhi Fan and Huanlai Xing and
Hongfang Yu",
title = "Meeting Coflow Deadlines in Data Center Networks With
Policy-Based Selective Completion",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "178--191",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3187821",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3187821",
abstract = "Recently, the abstraction of coflow is introduced to
capture the collective data transmission patterns among
modern distributed data-parallel applications. During
processing, coflows generally act as barriers;
accordingly, time-sensitive \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:MBR,
author = "Zhehui Zhang and Yuanjie Li and Qianru Li and Jinghao
Zhao and Ghufran Baig and Lili Qiu and Songwu Lu",
title = "Movement-Based Reliable Mobility Management for Beyond
{5G} Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "192--207",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3190788",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3190788",
abstract = "Extreme mobility becomes a norm rather than an
exception with emergent high-speed rails, drones,
industrial IoT, and many more. However, 4G/5G mobility
management is not always reliable in extreme mobility,
with non-negligible failures and policy \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zong:2023:CEC,
author = "Tongyu Zong and Chen Li and Yuanyuan Lei and Guangyu
Li and Houwei Cao and Yong Liu",
title = "Cocktail Edge Caching: Ride Dynamic Trends of Content
Popularity With Ensemble Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "208--219",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193680",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193680",
abstract = "Edge caching will play a critical role in facilitating
the emerging content-rich applications. However, it
faces many new challenges, in particular, the highly
dynamic content popularity and the heterogeneous
caching configurations. In this paper, we \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:MRA,
author = "Cao Chen and Fen Zhou and Massimo Tornatore and Shilin
Xiao",
title = "Maximizing Revenue With Adaptive Modulation and
Multiple {FECs} in Flexible Optical Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "220--233",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3194982",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3194982",
abstract = "Flexible optical networks (FONs) are being adopted to
accommodate the increasingly heterogeneous traffic in
today's Internet. However, in presence of high traffic
load, not all offered traffic can be satisfied at all
time. As carried traffic load \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2023:SRC,
author = "Chia-Ming Chang and Yi-Jheng Lin and Cheng-Shang Chang
and Duan-Shin Lee",
title = "On the Stability Regions of Coded {Poisson} Receivers
With Multiple Classes of Users and Receivers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "234--247",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3188757",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3188757",
abstract = "Motivated by the need to provide differentiated
quality-of-service (QoS) in grant-free uplink
transmissions in 5G networks and beyond, we extend the
probabilistic analysis of coded Poisson receivers (CPR)
to the setting with multiple classes of users and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2023:SMD,
author = "Gongming Zhao and Luyao Luo and Hongli Xu and Chun-Jen
Chung and Liguang Xie",
title = "Southbound Message Delivery With Virtual Network
Topology Awareness in Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "248--263",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3190730",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3190730",
abstract = "Southbound message delivery from the control plane to
the data plane is one of the essential issues in
multi-tenant clouds. A natural method of southbound
message delivery is that the control plane directly
communicates with compute nodes in the data \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Malandrino:2023:NSH,
author = "Francesco Malandrino and Carla Fabiana Chiasserini and
Nuria Molner and Antonio de la Oliva",
title = "Network Support for High-Performance Distributed
Machine Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "264--278",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3189077",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3189077",
abstract = "The traditional approach to distributed machine
learning is to adapt learning algorithms to the
network, e.g., reducing updates to curb overhead.
Networks based on intelligent edge, instead, make it
possible to follow the opposite approach, i.e., to
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2023:OET,
author = "Chao Xu and Jessie Hui Wang and Jilong Wang and Tao Yu
and Yipeng Zhou and Yuedong Xu and Di Wu and Changqing
An",
title = "Offloading Elastic Transfers to Opportunistic
Vehicular Networks Based on Imperfect Trajectory
Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "279--293",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3189047",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3189047",
abstract = "Due to the high cost of cellular networks, vehicle
users would like to offload elastic traffic through
vehicular networks as much as possible. This demand
prompts researchers to consider how to make the
vehicular network system achieve better performance
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sobrinho:2023:NOR,
author = "Jo{\~a}o Lu{\'\i}s Sobrinho and Miguel Alves
Ferreira",
title = "From Non-Optimal Routing Protocols to Routing on
Multiple Optimality Criteria",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "294--307",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3191808",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3191808",
abstract = "At a suitable level of abstraction, all that standard
routing protocols do is iterate extension and election
operations on path attributes. An extension operation
composes the attribute of a path from those of a link
and another path, while an election \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qin:2023:EDT,
author = "Xudong Qin and Bin Li and Lei Ying",
title = "Efficient Distributed Threshold-Based Offloading for
Large-Scale Mobile Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "308--321",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193073",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193073",
abstract = "Mobile cloud computing enables compute-limited mobile
devices to perform real-time intensive computations
such as speech recognition or object detection by
leveraging powerful cloud servers. An important problem
in large-scale mobile cloud computing is \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Majidi:2023:MBU,
author = "Akbar Majidi and Xiaofeng Gao and Shunjia Zhu and
Nazila Jahanbakhsh and Jiaqi Zheng and Guihai Chen",
title = "{MiFi}: Bounded Update to Optimize Network Performance
in Software-Defined Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "322--335",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3192167",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3192167",
abstract = "A controller needs to solve the multi-commodity flow
problem and globally update the network under tight
time constraints to maintain optimal network
configurations. This centralized optimization in data
centers involves many variables and constraints,
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:GMC,
author = "Ge Wang and Xiaofeng Shi and Haofan Cai and Chen Qian
and Han Ding and Wei Xi and Kun Zhao and Jizhong Zhao
and Jinsong Han",
title = "A Generalized Method to Combat Multipaths for {RFID}
Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "336--351",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3190862",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3190862",
abstract = "There have been increasing interests in exploring the
sensing capabilities of RFID to enable numerous IoT
applications, including object localization, trajectory
tracking, and human behavior sensing. However, most
existing methods rely on the signal \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:OAS,
author = "Chi Zhang and Haisheng Tan and Haoqiang Huang and
Zhenhua Han and Shaofeng H.-C. Jiang and Guopeng Li and
Xiang-Yang Li",
title = "Online Approximation Scheme for Scheduling
Heterogeneous Utility Jobs in Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "352--365",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193381",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193381",
abstract = "Edge computing systems typically handle a wide variety
of applications that exhibit diverse degrees of
sensitivity to job latency. Therefore, a multitude of
utility functions of the job response time need to be
considered by the underlying job dispatching \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2023:PTL,
author = "Qiang Wu and Xiangping Bryce Zhai and Xi Liu and
Chun-Ming Wu and Fangliang Lou and Hongke Zhang",
title = "Performance Tuning via Lean Measurements for
Acceleration of Network Functions Virtualization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "366--379",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193686",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193686",
abstract = "Network Functions Virtualization (NFV) replaces the
specialized hardware with the software-based forwarding
to promise the flexibility, scalability and automation
benefits. With an increasing range of applications, NFV
must ultimately forward packets at \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hao:2023:DOS,
author = "Yijun Hao and Fang Li and Cong Zhao and Shusen Yang",
title = "Delay-Oriented Scheduling in {5G} Downlink Wireless
Networks Based on Reinforcement Learning With Partial
Observations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "380--394",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3194953",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3194953",
abstract = "5G wireless networks are expected to satisfy different
delay requirements of various traffics by network
resource scheduling. Existing scheduling methods
perform poorly in practice due to their unrealistic
assumption on the access to the full channel \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xi:2023:RFA,
author = "Shaoke Xi and Kai Bu and Wensen Mao and Xiaoyu Zhang
and Kui Ren and Xinxin Ren",
title = "{RuleOut} Forwarding Anomalies for {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "395--407",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3194970",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3194970",
abstract = "Reliable Software-Defined Networking (SDN) should
mitigate forwarding anomalies due to cross-plane rule
inconsistencies. Most existing countermeasures either
inject probe packets to infer forwarding correctness or
collect packet traces to detect \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pan:2023:OSD,
author = "Jiayu Pan and Ahmed M. Bedewy and Yin Sun and Ness B.
Shroff",
title = "Optimal Sampling for Data Freshness: Unreliable
Transmissions With Random Two-Way Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "408--420",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3194417",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3194417",
abstract = "In this paper, we aim to design an optimal sampler for
a system in which fresh samples of a signal (source)
are sent through an unreliable channel to a remote
estimator, and acknowledgments are sent back over a
feedback channel. Both the forward and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tang:2023:HUB,
author = "Shaofei Tang and Sicheng Zhao and Xiaoqin Pan and
Zuqing Zhu",
title = "How to Use In-Band Network Telemetry Wisely:
Network-Wise Orchestration of {Sel-INT}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "1",
pages = "421--435",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3194086",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed May 17 13:15:15 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3194086",
abstract = "As a promising network monitoring technique, in-band
network telemetry (INT) helps to visualize networks in
a fine-grained and real-time manner. Meanwhile, to
address the overheads of INT, people have proposed a
few selective INT (Sel-INT) approaches that \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chang:2023:DDR,
author = "Hao-Hsuan Chang and Hao Chen and Jianzhong Zhang and
Lingjia Liu",
title = "Decentralized Deep Reinforcement Learning Meets
Mobility Load Balancing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "473--484",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3176528",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3176528",
abstract = "Mobility load balancing (MLB) aims to solve the
problem of uneven resource utilization in cellular
networks. Since network dynamics are usually
complicated and non-stationary, conventional
model-based MLB methods fail to cover all scenarios of
cellular \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{He:2023:SPP,
author = "Yunhua He and Yueting Wu and Cui Zhang and Jialong
Shen and Ke Xiao and Keshav Sood and Limin Sun",
title = "A Sparse Protocol Parsing Method for {IIoT} Based on
{BPSO}-vote-{HMM} Hybrid Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "485--496",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3184751",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3184751",
abstract = "With the development of the Industrial Internet of
Things, industrial control systems have become more
open and intelligent. However, large numbers of unknown
protocols exist in IIoT, threatening the security of
IIoT devices and systems. Protocol reverse \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2023:SMD,
author = "Tuo Shi and Zhipeng Cai and Jianzhong Li and Hong Gao
and Jiancheng Chen and Ming Yang",
title = "Services Management and Distributed Multihop Requests
Routing in Mobile Edge Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "497--510",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3196267",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3196267",
abstract = "Multi-access Edge Computing (MEC) is an emerging
computing architecture to release the resource burden
of the centralized cloud and reduce the mobile
application latency. Services management and MEC
requests routing is a major problem in MEC systems.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lei:2023:MCB,
author = "Kai Lei and Guanjie Lin and Meimei Zhang and Keke Li
and Qi Li and Xiaojun Jing and Peng Wang",
title = "Measuring the Consistency Between Data and Control
Plane in {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "511--525",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3193698",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193698",
abstract = "Software Defined Networking (SDN) simplifies network
control and management by decoupling the control plane
from the data plane. However, the actual packet
behaviors, conforming to the rules in the data plane
flow tables, may violate the original policies
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Du:2023:RAR,
author = "Xinle Du and Ke Xu and Lei Xu and Kai Zheng and Meng
Shen and Bo Wu and Tong Li",
title = "{R-AQM}: Reverse {ACK} Active Queue Management in
Multitenant Data Centers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "526--541",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3197973",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3197973",
abstract = "TCP incast has become a practical problem for
high-bandwidth, low-latency transmissions, resulting in
throughput degradation of up to 90&\#x0025; and delays
of hundreds of milliseconds, severely impacting
application performance. However, in virtualized
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2023:FIM,
author = "Yi Zhao and Meina Qiao and Haiyang Wang and Rui Zhang
and Dan Wang and Ke Xu",
title = "Friendship Inference in Mobile Social Networks:
Exploiting Multi-Source Information With Two-Stage Deep
Learning Framework",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "542--557",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3198105",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3198105",
abstract = "With the tremendous growth of mobile social networks
(MSNs), people are highly relying on it to connect with
friends and further expand their social circles.
However, the conventional friendship inference
techniques have issues handling such a large yet
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:RER,
author = "Haibo Wang and Chaoyi Ma and Olufemi O. Odegbile and
Shigang Chen and Jih-Kwon Peir",
title = "Randomized Error Removal for Online Spread Estimation
in High-Speed Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "558--573",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3197968",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3197968",
abstract = "Flow spread measurement provides fundamental
statistics that can help network operators better
understand flow characteristics and traffic patterns
with applications in traffic engineering, cybersecurity
and quality of service. Past decades have witnessed
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ding:2023:NDO,
author = "Yi Ding and Yu Yang and Wenchao Jiang and Yunhuai Liu
and Tian He and Desheng Zhang",
title = "Nationwide Deployment and Operation of a Virtual
Arrival Detection System in the Wild",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "574--589",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3196806",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3196806",
abstract = "We report a 30-month nationwide deployment and
operation study of an indoor arrival detection system
based on Bluetooth Low Energy called {$<$
monospace$>$VALID$<$}/{monospace$>$} in 364 Chinese
cities. {$<$ monospace$>$VALID$<$}/{monospace$>$} is
pilot-studied, deployed, and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:TWA,
author = "Lili Chen and Kai Chen and Jie Xiong and Ke Li and
Sunghoon Ivan Lee and Fuwei Wang and Zhanyong Tang and
Zheng Wang and Dingyi Fang and Xiaojiang Chen",
title = "Toward Wide-Area Contactless Wireless Sensing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "590--605",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3196744",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3196744",
abstract = "Contactless wireless sensing without attaching a
device to the target has achieved promising progress in
recent years. However, one severe limitation is the
small sensing range. This paper presents Widesee to
realize wide-area sensing with only one \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Michel:2023:FEQ,
author = "Fran{\c{c}}ois Michel and Alejandro Cohen and Derya
Malak and Quentin {De Coninck} and Muriel M{\'e}dard
and Olivier Bonaventure",
title = "{FlEC}: Enhancing {QUIC} With Application-Tailored
Reliability Mechanisms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "606--619",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3195611",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3195611",
abstract = "Packet losses are common events in today&\#x2019;s
networks. They usually result in longer delivery times
for application data since retransmissions are the de
facto technique to recover from such losses.
Retransmissions is a good strategy for many \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tian:2023:DSM,
author = "Xiang Tian and Baoxian Zhang and Cheng Li",
title = "Distributed Stable Multisource Global Broadcast for
{SINR}-Based Wireless Multihop Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "620--633",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3198331",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3198331",
abstract = "Multi-source global broadcast is a fundamental problem
in multi-hop wireless networks. The Static Multi-source
Global Broadcast problem (SMGB), which considers static
packet injection at all source nodes, has been
extensively studied in recent years. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bao:2023:DLB,
author = "Yixin Bao and Yanghua Peng and Chuan Wu",
title = "Deep Learning-Based Job Placement in Distributed
Machine Learning Clusters With Heterogeneous
Workloads",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "634--647",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3202529",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3202529",
abstract = "Nowadays, most leading IT companies host a variety of
distributed machine learning (ML) workloads in ML
clusters to support AI-driven services, such as speech
recognition, machine translation, and image processing.
While multiple jobs are executed \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:OCD,
author = "En Wang and Mijia Zhang and Wenbin Liu and Haoyi Xiong
and Bo Yang and Yongjian Yang and Jie Wu",
title = "Outlier-Concerned Data Completion Exploiting Intra-
and Inter-Data Correlations in Sparse {CrowdSensing}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "648--663",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3201545",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3201545",
abstract = "Mobile CrowdSensing (MCS) is a popular data collection
paradigm which usually faces the problem of sparse
sensed data because of the limited sensing cost. In
order to address the situation of sparse data, sparse
MCS recruits users to sense important areas \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ruan:2023:GQA,
author = "Na Ruan and Hanyi Sun and Zenan Lou and Jie Li",
title = "A General Quantitative Analysis Framework for Attacks
in Blockchain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "664--679",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3201493",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3201493",
abstract = "Decentralized cryptocurrency systems have become
primary targets for attackers due to substantial profit
gain and economic rewards. A number of attack models
have been proposed during last few years. However, the
evaluation and comparison of those attack \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ozan:2023:POS,
author = "Waseem Ozan and Izzat Darwazeh and Kyle Jamieson",
title = "Partial {OFDM} Symbol Recovery to Improve Interfering
Wireless Networks Operation in Collision Environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "680--694",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3202857",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3202857",
abstract = "The uplink data rate region for interfering
transmissions in wireless networks has been
characterised and proven, yet its underlying model
assumes a complete temporal overlap. Practical
unplanned networks, however, adopt packetized
transmissions and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tutuncuoglu:2023:OLR,
author = "Feridun T{\"u}t{\"u}nc{\"u}o{\u{g}}lu and
Sla{\dbar}ana Jo{\v{s}}ilo and Gy{\"o}rgy D{\'a}n",
title = "Online Learning for Rate-Adaptive Task Offloading
Under Latency Constraints in Serverless Edge
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "695--709",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3197669",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3197669",
abstract = "We consider the interplay between latency constrained
applications and function-level resource management in
a serverless edge computing environment. We develop a
game theoretic model of the interaction between rate
adaptive applications and a load \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qi:2023:RDR,
author = "Jianpeng Qi and Rui Wang",
title = "{R2}: a Distributed Remote Function Execution
Mechanism With Built-In Metadata",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "710--723",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3198467",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3198467",
abstract = "Named data networking (NDN) constructs a network by
names, providing a flexible and decentralized way to
manage resources within the edge computing continuum.
This paper aims to solve the question, &\#x201C;Given a
function with its parameters and metadata,. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tang:2023:HPI,
author = "Lu Tang and Yao Xiao and Qun Huang and Patrick P. C.
Lee",
title = "A High-Performance Invertible Sketch for Network-Wide
Superspreader Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "724--737",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3198738",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3198738",
abstract = "Superspreaders (i.e., hosts with numerous distinct
connections) remain severe threats to production
networks. How to accurately detect superspreaders in
real-time at scale remains a non-trivial yet
challenging issue. We present SpreadSketch, an
invertible \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2023:CEA,
author = "Jiawei Huang and Wenlu Zhang and Yijun Li and Lin Li
and Zhaoyi Li and Jin Ye and Jianxin Wang",
title = "{ChainSketch}: an Efficient and Accurate Sketch for
Heavy Flow Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "738--753",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3199506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3199506",
abstract = "Identifying heavy flows is essential for network
management. However, it is challenging to detect heavy
flow quickly and accurately under the highly dynamic
traffic and rapid growth of network capacity. Existing
heavy flow detection schemes can make a \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ahmad:2023:NFC,
author = "Mukhtiar Ahmad and Syed Muhammad Nawazish Ali and
Muhammad Taimoor Tariq and Syed Usman Jafri and Adnan
Abbas and Syeda Mashal Abbas Zaidi and Muhammad Basit
Iqbal Awan and Zartash Afzal Uzmi and Zafar Ayyub
Qazi",
title = "{Neutrino}: a Fast and Consistent Edge-Based Cellular
Control Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "754--769",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3202496",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3202496",
abstract = "5G and next-generation cellular networks aim to
support tactile internet to enable immersive and
real-time applications by providing ultra-low latency
and extremely high reliability. This imposes new
requirements on the design of cellular core networks. A
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Arrigoni:2023:BAN,
author = "Viviana Arrigoni and Novella Bartolini and Annalisa
Massini and Federico Trombetti",
title = "A {Bayesian} Approach to Network Monitoring for
Progressive Failure Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "770--783",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3200249",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3200249",
abstract = "Boolean Network Tomography (BNT) aims at identifying
failures of internal network components by means of
end-to-end monitoring paths. However, when the number
of failures is not known a priori, failure
identification may require a huge number of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tripathi:2023:IFM,
author = "Vishrant Tripathi and Rajat Talak and Eytan Modiano",
title = "Information Freshness in Multihop Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "784--799",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3201751",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3201751",
abstract = "We consider the problem of minimizing age of
information in multihop wireless networks and propose
three classes of policies to solve the problem ---
stationary randomized, age difference, and age debt.
For the unicast setting with fixed routes between each
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lu:2023:IOI,
author = "Yu-Han Lu and Sandy Hsin-Yu Hsiao and Chi-Yu Li and
Yi-Chen Hsieh and Po-Yi Chou and Yao-Yu Li and Tian Xie
and Guan-Hua Tu",
title = "Insecurity of Operational {IMS} Call Systems:
Vulnerabilities, Attacks, and Countermeasures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "800--815",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3205183",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3205183",
abstract = "IMS (IP Multimedia Subsystem) is an essential 4G/5G
component to offer multimedia services. It is used
worldwide to support two call services: VoLTE (Voice
over LTE) and VoWiFi (Voice over WiFi). In this study,
it is shown that the signaling and voice \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:SHP,
author = "Jielun Zhang and Fuhao Li and Feng Ye",
title = "Sustaining the High Performance of {AI}-Based Network
Traffic Classification Models",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "816--827",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3203227",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3203227",
abstract = "Network traffic classification plays an essential role
in network measurement and management. Emerging
Artificial Intelligence (AI) algorithms have become a
viable solution to encrypted network traffic
classification. Nonetheless, the classification
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dong:2023:SSG,
author = "Tianjian Dong and Qi Qi and Jingyu Wang and Zirui
Zhuang and Haifeng Sun and Jianxin Liao and Zhu Han",
title = "Standing on the Shoulders of Giants: Cross-Slice
Federated Meta Learning for Resource Orchestration to
Cold-Start Slice",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "828--845",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3200853",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3200853",
abstract = "Network slicing is a key technology in 6G
communication systems to support numerous vertical
applications for all scenes while providing resources
on demand. Due to more time-varying and dynamic traffic
flows, it is difficult for traditional methods to
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:BSC,
author = "Shicheng Wang and Menghao Zhang and Guanyu Li and
Chang Liu and Zhiliang Wang and Ying Liu and Mingwei
Xu",
title = "Bolt: Scalable and Cost-Efficient Multistring Pattern
Matching With Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "846--861",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3202523",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3202523",
abstract = "Multi-string pattern matching is a crucial building
block for many network security applications and thus
of great importance. Since every byte of a packet has
to be inspected by a large set of patterns, it often
becomes a bottleneck of these applications \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xue:2023:SEQ,
author = "Guangtao Xue and Yijie Li and Hao Pan and Lanqing Yang
and Yi-Chao Chen and Xiaoyu Ji and Jiadi Yu",
title = "{ScreenID}: Enhancing {QRCode} Security by Utilizing
Screen Dimming Feature",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "862--876",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3203044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3203044",
abstract = "Quick response (QR) codes have been widely used in
mobile applications, especially mobile payments, such
as Alipay, WeChat, PayPal, etc due to their convenience
and the pervasive built-in cameras on smartphones.
Recently, however, attacks against QR codes \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2023:RRA,
author = "Jiawei Li and Chuyu Wang and Ang Li and Dianqi Han and
Yan Zhang and Jinhang Zuo and Rui Zhang and Lei Xie and
Yanchao Zhang",
title = "Rhythmic {RFID} Authentication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "877--890",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3204204",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3204204",
abstract = "Passive RFID technology is widely used in user
authentication and access control. We propose
RF-Rhythm, a secure and usable two-factor RFID
authentication system with strong resilience to
lost/stolen/cloned RFID cards. In RF-Rhythm, each
legitimate user \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gao:2023:HOC,
author = "Yang Gao and Hongli Zhang and Xiangzhan Yu",
title = "Higher-Order Community Detection: On Information
Degeneration and Its Elimination",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "891--903",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3201668",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3201668",
abstract = "Community detection aims to identify the cohesive
vertex sets in a network. It is widely used in many
domains, e.g., World Wide Web, online social networks,
and communication networks. Many clustering models are
proposed in the literature. However, most \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kong:2023:CAD,
author = "Dezhang Kong and Yi Shen and Xiang Chen and Qiumei
Cheng and Hongyan Liu and Dong Zhang and Xuan Liu and
Shuangxi Chen and Chunming Wu",
title = "Combination Attacks and Defenses on {SDN} Topology
Discovery",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "2",
pages = "904--919",
month = apr,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3203561",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:35 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3203561",
abstract = "The topology discovery service in Software-Defined
Networking (SDN) provides the controller with a global
view of the substrate network topology, allowing for
central management of the entire network.
Unfortunately, emerging topology attacks can poison
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2023:RWR,
author = "Wei Yang and Chi Lin and Haipeng Dai and Pengfei Wang
and Jiankang Ren and Lei Wang and Guowei Wu and Qiang
Zhang",
title = "Robust Wireless Rechargeable Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "949--964",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3199389",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3199389",
abstract = "Wireless rechargeable sensor networks have become a
hot research issue as it can overcome the limited
energy bottleneck of wireless sensor networks owing to
the recent breakthrough of wireless power transfer
technology. Though network lifetime is \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:DSD,
author = "Xiong Wang and Jiancheng Ye and John C. S. Lui",
title = "Decentralized Scheduling and Dynamic Pricing for Edge
Computing: a Mean Field Game Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "965--978",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3204698",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3204698",
abstract = "Edge computing provides a platform facilitating edge
servers to contribute to computation offloading while
economizing their resources. Traditional offloading
solutions are mostly centralized, which are unscalable
for large-scale edge computing networks \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Faltelli:2023:MAP,
author = "Marco Faltelli and Giacomo Belocchi and Francesco
Quaglia and Salvatore Pontarelli and Giuseppe Bianchi",
title = "{Metronome}: Adaptive and Precise Intermittent Packet
Retrieval in {DPDK}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "979--993",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3208799",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3208799",
abstract = "The increasing performance requirements of modern
applications place a significant burden on
software-based packet processing. Most of
today&\#x2019;s software input/output accelerations
achieve high performance at the expense of reserving
CPU resources \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:SFN,
author = "Haoxian Chen and Chenyuan Wu and Andrew Zhao and
Mukund Raghothaman and Mayur Naik and Boon Thau Loo",
title = "Synthesizing Formal Network Specifications From
Input--Output Examples",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "994--1009",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3208551",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3208551",
abstract = "We propose NetSpec, a tool that synthesizes network
specifications in a declarative logic programming
language from input-output examples. NetSpec aims to
accelerate the adoption of formal verification in
networking practice, by reducing the effort and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Du:2023:SAS,
author = "Yang Du and He Huang and Yu-E Sun and Shigang Chen and
Guoju Gao and Xiaocan Wu",
title = "Self-Adaptive Sampling Based Per-Flow Traffic
Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1010--1025",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3212066",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3212066",
abstract = "Per-flow traffic measurement in the high-speed network
plays an important role in many practical applications.
Due to the limited on-chip memory and the mismatch
between off-chip memory speed and line rate,
sampling-based methods select and forward a part
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2023:MCA,
author = "Feng Lin and Ming Gao and Lingfeng Zhang and Yimin Li
and Weiye Xu and Jinsong Han and Xian Xu and Wenyao Xu
and Kui Ren",
title = "Mobile Communication Among {COTS IoT} Devices via a
Resonant Gyroscope With Ultrasound",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1026--1041",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3205151",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3205151",
abstract = "Incompatible protocols and electromagnetic
interference obstruct the realization of an
everything-connected Internet of Things (IoT)
communication network. Our system, Deaf-Aid, utilizes a
stealthy speaker-to-gyroscope channel to build robust
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2023:IMP,
author = "Kan Yu and Jiguo Yu and Chuanwen Luo",
title = "The Impact of Mobility on Physical Layer Security of
{5G} {IoT} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1042--1055",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3208212",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3208212",
abstract = "Internet of Things (IoT) is rapidly spreading and
reaching a multitude of different domains, since the
fifth generation (5G) wireless technologies are the key
enablers of many IoT applications. It is hence apparent
that the broadcast nature of IoT devices \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Teh:2023:EQS,
author = "Min Yee Teh and Shizhen Zhao and Peirui Cao and Keren
Bergman",
title = "Enabling Quasi-Static Reconfigurable Networks With
Robust Topology Engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1056--1070",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3210534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3210534",
abstract = "Many optical circuit switched data center networks
(DCN) have been proposed in the last decade to attain
higher capacity and topology reconfigurability, though
commercial adoption of these architectures have been
minimal. One major challenge these \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:TPA,
author = "Yipeng Wang and Huijie He and Yingxu Lai and Alex X.
Liu",
title = "A Two-Phase Approach to Fast and Accurate
Classification of Encrypted Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1071--1086",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3209979",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3209979",
abstract = "Encryption technology has been widely used in
today&\#x2019;s network communications. The early
classification of encrypted flows is of great value to
the control, allocation and management of resources in
TCP/IP networks. In this paper, we propose TaTic,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Elsayed:2023:TLC,
author = "Karim Elsayed and Amr Rizk",
title = "Time-to-Live Caching With Network Delays: Exact
Analysis and Computable Approximations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1087--1100",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3207914",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3207914",
abstract = "We consider Time-to-Live (TTL) caches that tag every
object in cache with a specific (and possibly
renewable) expiration time. State-of-the-art models for
TTL caches assume zero object fetch delay, i.e., the
time required to fetch a requested object that
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lu:2023:LAK,
author = "Xiaofeng Lu and Fan Yang and Luwen Zou and Pietro Lio
and Pan Hui",
title = "An {LTE} Authentication and Key Agreement Protocol
Based on the {ECC} Self-Certified Public Key",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1101--1116",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3207360",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3207360",
abstract = "After analyzing the long-term evolution (LTE)
authentication and key agreement process (EPS-AKA), its
existing security vulnerabilities are pointed out.
Based on elliptic curve cryptography (ECC)
self-certified public keys, this paper proposes an ECC
self-. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2023:RMF,
author = "Jianwei Liu and Kaiyan Cui and Xiang Zou and Jinsong
Han and Feng Lin and Kui Ren",
title = "Reliable Multi-Factor User Authentication With One
Single Finger Swipe",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1117--1131",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3208002",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3208002",
abstract = "Multi-factor user authentication becomes increasingly
popular due to its superior security comparing with
single-factor user authentication. However, existing
multi-factor user authentication methods usually
require multiple interactions between users and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yuan:2023:MBC,
author = "Longzhi Yuan and Qiwei Wang and Jia Zhao and Wei
Gong",
title = "Multiprotocol Backscatter With Commodity Radios for
Personal {IoT} Sensors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1132--1144",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3213913",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3213913",
abstract = "We present multiscatter, a novel battery-free
backscatter design that can simultaneously work with
multiple excitation signals for personal IoT sensors.
Specifically, we show for the first time that the
backscatter tag can identify various excitation
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2023:AAL,
author = "Jingling Liu and Jiawei Huang and Weihe Li and Jianxin
Wang and Tian He",
title = "Asymmetry-Aware Load Balancing With Adaptive Switching
Granularity in Data Center",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1145--1158",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3208201",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3208201",
abstract = "Datacenter networks provide large bisection bandwidth
by load balancing traffic over rich parallel paths in
multi-rooted tree topologies. Nevertheless, production
datacenters operate under various path diversities
caused by traffic dynamics, hardware \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2023:CCC,
author = "Ningning Hou and Xianjin Xia and Yuanqing Zheng",
title = "{CloakLoRa}: a Covert Channel Over {LoRa PHY}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1159--1172",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3209255",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3209255",
abstract = "This paper describes our design and implementation of
a covert channel over LoRa physical layer (PHY). LoRa
adopts a unique modulation scheme (chirp spread
spectrum (CSS)) to enable long range communication at
low-power consumption. CSS uses the initial \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Salem:2023:ASC,
author = "Tareq Si Salem and Giovanni Neglia and Damiano Carra",
title = "Ascent Similarity Caching With Approximate Indexes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1173--1186",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3217012",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3217012",
abstract = "Similarity search is a key operation in multimedia
retrieval systems and recommender systems, and it will
play an important role also for future machine learning
and augmented reality applications. When these systems
need to serve large objects with tight \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Doshi:2023:CBV,
author = "Vishwaraj Doshi and Shailaja Mallick and Do Young
Eun",
title = "Convergence of Bi-Virus Epidemic Models With
Non-Linear Rates on Networks --- a Monotone Dynamical
Systems Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1187--1201",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3213015",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3213015",
abstract = "We study convergence properties of competing epidemic
models of the Susceptible-Infected-Susceptible
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hur:2023:PCF,
author = "Junnyung Hur and Hyeon Gy Shon and Young Jae Kim and
Myungkeun Yoon",
title = "Packet Chunking for File Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1202--1215",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3215549",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3215549",
abstract = "Network-based intrusion detection and data leakage
prevention systems inspect packets to detect if
critical files such as malware or confidential
documents are transferred. However, this kind of
detection requires heavy computing resources in
reassembling \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2023:AAH,
author = "Wenzheng Xu and Hongbin Xie and Chenxi Wang and Weifa
Liang and Xiaohua Jia and Zichuan Xu and Pan Zhou and
Weigang Wu and Xiang Chen",
title = "An Approximation Algorithm for the h-Hop Independently
Submodular Maximization Problem and Its Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1216--1229",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3210825",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3210825",
abstract = "This study is motivated by the maximum connected
coverage problem (MCCP), which is to deploy a connected
UAV network with given \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rashelbach:2023:SLA,
author = "Alon Rashelbach and Ori Rottenstreich and Mark
Silberstein",
title = "Scaling by Learning: Accelerating {Open vSwitch} Data
Path With Neural Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1230--1243",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3215143",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3215143",
abstract = "Open vSwitch (OVS) is a widely used open-source
virtual switch implementation. In this work, we seek to
scale up OVS to support hundreds of thousands of
OpenFlow rules by accelerating the core component of
its data-path --- the packet classification \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Meskar:2023:FMR,
author = "Erfan Meskar and Ben Liang",
title = "Fair Multi-Resource Allocation in Heterogeneous
Servers With an External Resource Type",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1244--1262",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3213426",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3213426",
abstract = "This paper considers the problem of fair allocation of
multiple types of resources in heterogeneous servers,
along with a resource type external to those servers.
Our work is motivated by the need for fair
multi-resource allocation in mobile edge \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kalor:2023:TMD,
author = "Anders E. Kal{\o}r and Petar Popovski",
title = "Timely Monitoring of Dynamic Sources With Observations
From Multiple Wireless Sensors",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1263--1276",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3212794",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3212794",
abstract = "Age of Information (AoI) has recently received much
attention due to its relevance for IoT sensing and
monitoring. In this paper, we consider the problem of
minimizing the AoI in a system in which a set of
sources are observed by multiple sensors in a
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Serbetci:2023:MTC,
author = "Berksan Serbetci and Eleftherios Lampiris and
Thrasyvoulos Spyropoulos and Giuseppe Caire and Petros
Elia",
title = "Multi-Transmitter Coded Caching Networks With
Transmitter-Side Knowledge of File Popularity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1277--1292",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3219161",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3219161",
abstract = "This work presents a new way of exploiting non-uniform
file popularity in coded caching networks. Focusing on
a fully-connected fully-interfering wireless setting
with multiple cache-enabled transmitters and receivers,
we show how non-uniform file \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Salani:2023:DSP,
author = "Matteo Salani and Cristina Rottondi and Leopoldo
Cer{\'e} and Massimo Tornatore",
title = "Dual-Stage Planning for Elastic Optical Networks
Integrating Machine-Learning-Assisted {QoT}
Estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1293--1307",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3213970",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3213970",
abstract = "Following the emergence of Elastic Optical Networks
(EONs), Machine Learning (ML) has been intensively
investigated as a promising methodology to address
complex network management tasks, including, e.g.,
Quality of Transmission (QoT) estimation, fault
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gao:2023:DDA,
author = "Shuqin Gao and Costas A. Courcoubetis and Lingjie
Duan",
title = "Distributed Double Auction Mechanisms for Large-Scale
Device-to-Device Resource Trading",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1308--1323",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3218552",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3218552",
abstract = "While some mobile users in wireless networks may
experience temporal scarcity of wireless network
resources such as data plan, computation capacity and
energy storage, some others may leave them
underutilized. If the appropriate market existed, users
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Bressana:2023:PFH,
author = "Pietro Bressana and Noa Zilberman and Robert
Soul{\'e}",
title = "{PTA}: Finding Hard-to-Find Data Plane Bugs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1324--1337",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3214062",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3214062",
abstract = "Bugs in network hardware can cause tremendous
problems. However, programmable network devices have
the potential to provide greater visibility into the
internal behavior of devices, allowing us to more
quickly find and identify problems. In this paper, we
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Felemban:2023:VVQ,
author = "Noor Felemban and Fidan Mehmeti and Thomas F. {La
Porta}",
title = "{VidQ}: Video Query Using Optimized Audio-Visual
Processing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1338--1352",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3215601",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3215601",
abstract = "As mobile devices become more prevalent in everyday
life and the amount of recorded and stored videos
increases, efficient techniques for searching video
content become more important. When a user sends a
query searching for a specific action in a large
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ping:2023:UNL,
author = "Haodi Ping and Yongcai Wang and Deying Li and Wenping
Chen",
title = "Understanding Node Localizability in Barycentric
Linear Localization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1353--1368",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3216204",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3216204",
abstract = "The barycentric linear localization (BLL) methods
provide a lightweight, distributed way to calculate
locations for resource-limited IoT devices. A crucial
requirement for BLL is that the nodes participating in
the iterative location propagation are \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2023:NMD,
author = "Peng Lin and Kejiang Ye and Yishen Hu and Yanying Lin
and Cheng-Zhong Xu",
title = "A Novel Multimodal Deep Learning Framework for
Encrypted Traffic Classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1369--1384",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3215507",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3215507",
abstract = "Traffic classification is essential for cybersecurity
maintenance and network management, and has been widely
used in QoS (Quality of Service) guarantees, intrusion
detection, and other tasks. Recently, with the
emergence of SSL/TLS encryption protocols \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2023:PRN,
author = "Wenhao Li and Xiao-Yu Zhang and Huaifeng Bao and
Haichao Shi and Qiang Wang",
title = "{ProGraph}: Robust Network Traffic Identification With
Graph Propagation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "3",
pages = "1385--1399",
month = jun,
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3216603",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:38 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3216603",
abstract = "Network traffic identification is critical for
effective network management. Existing methods mostly
focus on invariant network environments with stable
attribute distributions. Unfortunately, however, they
can hardly be adaptive to the variation of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ye:2023:FFD,
author = "Minghao Ye and Junjie Zhang and Zehua Guo and H.
Jonathan Chao",
title = "{FlexDATE}: Flexible and Disturbance-Aware Traffic
Engineering With Reinforcement Learning in
Software-Defined Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1433--1448",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3217083",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3217083",
abstract = "Traffic Engineering (TE) is an important network
operation that routes/reroutes flows based on network
topology and traffic demands to optimize network
performance. Recently, new emerging applications pose
challenges to TE with dynamic network conditions,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:ERB,
author = "Yongmin Zhang and Wei Wang and Ju Ren and Jinge Huang
and Shibo He and Yaoxue Zhang",
title = "Efficient Revenue-Based {MEC} Server Deployment and
Management in Mobile Edge-Cloud Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1449--1462",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3217280",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3217280",
abstract = "With the explosive growth of mobile applications, the
development of mobile edge computing (MEC) has been
greatly promoted since it can ably improve the quality
of service for mobile applications by providing low
latency and high-quality computation \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2023:SBO,
author = "Xu Lin and Deke Guo and Yulong Shen and Guoming Tang
and Bangbang Ren and Ming Xu",
title = "{SFT-Box}: an Online Approach for Minimizing the
Embedding Cost of Multiple Hybrid {SFCs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1463--1477",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3221868",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3221868",
abstract = "In Network Function Virtualization (NFV), a series of
Virtual Network Functions (VNFs) organized in a
specific order (called Service Function Chain, SFC)
could offer an end-to-end network service for a network
flow. Recently, with the new results of the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2023:MPS,
author = "Songtao Fu and Qi Li and Min Zhu and Xiaoliang Wang
and Su Yao and Yangfei Guo and Xinle Du and Ke Xu",
title = "{MASK}: Practical Source and Path Verification Based
on {Multi-AS-Key}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1478--1493",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3222610",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3222610",
abstract = "The source and path verification in Path-Aware
Networking considers the two critical issues: (1) end
hosts could verify that the network follows their
forwarding decisions, and (2) both on-path routers and
destination host could authenticate the source of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2023:PAO,
author = "Junchao Ma and Lingjia Liu and Bodong Shang and
Shashank Jere and Pingzhi Fan",
title = "Performance Analysis and Optimization for Layer-Based
Scalable Video Caching in {6G} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1494--1506",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3222931",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3222931",
abstract = "Scalable video caching is a promising technique to
alleviate backbone traffic in sixth generation (6G)
networks, and to serve users with video quality that
adapts to varying channel conditions. In this paper, we
develop a layer-based scalable video \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Su:2023:IRT,
author = "Jian Su and Zhengguo Sheng and Chenxi Huang and Gang
Li and Alex X. Liu and Zhangjie Fu",
title = "Identifying {RFID} Tags in Collisions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1507--1520",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3219016",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3219016",
abstract = "How to obtain the information from massive tags is a
key focus of RFID applications. The occurrence of
collisions leads to problems such as reduced
identification efficiency in RFID networks. To tackle
such challenges, most tag collision arbitration
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Goren:2023:DDP,
author = "Guy Goren and Shay Vargaftik and Yoram Moses",
title = "Distributed Dispatching in the Parallel Server Model",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1521--1534",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3220931",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3220931",
abstract = "With the rapid increase in the size and volume of
cloud services and data centers, architectures with
multiple job dispatchers are quickly becoming the norm.
Load balancing is a key element of such systems.
Nevertheless, current solutions to load \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2023:SSI,
author = "Qi Shi and Dong Hao",
title = "Social Sourcing: Incorporating Social Networks Into
Crowdsourcing Contest Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1535--1549",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3223367",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3223367",
abstract = "In a crowdsourcing contest, a principal holding a task
posts it to a crowd. People in the crowd then compete
with each other to win the rewards. Although in real
life, a crowd is usually networked and people influence
each other via social ties, existing \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:SDI,
author = "Na Wang and Junsong Fu and Shancheng Zhang and Zheng
Zhang and Jiawen Qiao and Jianwei Liu and Bharat K.
Bhargava",
title = "Secure and Distributed {IoT} Data Storage in Clouds
Based on Secret Sharing and Collaborative Blockchain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1550--1565",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3218933",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3218933",
abstract = "With the rapid development of 5G/6G, most Internet of
Things (IoT) devices will embrace wireless connection
in the near future. A public concern is how to securely
organize, store and retrieve data generated from IoT
devices. Many cloud-based IoT data \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2023:MLB,
author = "Jianer Zhou and Xinyi Qiu and Zhenyu Li and Qing Li
and Gareth Tyson and Jingpu Duan and Yi Wang and Heng
Pan and Qinghua Wu",
title = "A Machine Learning-Based Framework for Dynamic
Selection of Congestion Control Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1566--1581",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3220225",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3220225",
abstract = "Most congestion control algorithms (CCAs) are designed
for specific network environments. As such, there is no
known algorithm that achieves uniformly good
performance in all scenarios for all flows. Rather than
devising a one-size-fits-all algorithm \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pokhrel:2023:FED,
author = "Shiva Raj Pokhrel and Jinho Choi and Anwar Walid",
title = "Fair and Efficient Distributed Edge Learning With
Hybrid Multipath {TCP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1582--1594",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3219924",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3219924",
abstract = "The bottleneck of distributed edge learning (DEL) over
wireless has shifted from computing to communication,
primarily the aggregation-averaging (Agg-Avg) process
of DEL. The existing transmission control protocol
(TCP)-based data networking schemes for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2023:SSV,
author = "Juhyeng Han and Insu Yun and Seongmin Kim and Taesoo
Kim and Sooel Son and Dongsu Han",
title = "Scalable and Secure Virtualization of {HSM} With
{ScaleTrust}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1595--1610",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3220427",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3220427",
abstract = "Hardware security modules (HSMs) have been utilized as
a trustworthy foundation for cloud services.
Unfortunately, existing systems using HSMs fail to meet
multi-tenant scalability arising from the emerging
trends such as microservices, which utilize \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cheng:2023:RSS,
author = "Xia Cheng and Junyang Shi and Mo Sha and Linke Guo",
title = "Revealing Smart Selective Jamming Attacks in
{WirelessHART} Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1611--1625",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3224358",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3224358",
abstract = "As a leading industrial wireless standard,
WirelessHART has been widely implemented to build
wireless sensor-actuator networks (WSANs) in industrial
facilities, such as oil refineries, chemical plants,
and factories. For instance, 54,835 WSANs that
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hellemans:2023:PLB,
author = "Tim Hellemans and Grzegorz Kielanski and Benny {Van
Houdt}",
title = "Performance of Load Balancers With Bounded Maximum
Queue Length in Case of Non-Exponential Job Sizes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1626--1641",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3221283",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3221283",
abstract = "In large-scale distributed systems, balancing the load
in an efficient way is crucial in order to achieve low
latency. Recently, some load balancing policies have
been suggested which are able to achieve a bounded
maximum queue length in the large-scale \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lindner:2023:ABE,
author = "Steffen Lindner and Gabriel Paradzik and Michael
Menth",
title = "Alternative Best Effort ({ABE}) for Service
Differentiation: Trading Loss Versus Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1642--1656",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3221553",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3221553",
abstract = "The idea of an Alternative Best Effort (ABE) per-hop
behaviour (PHB) emerged about 20 years ago. It provides
a low-delay traffic class in the Internet at the
expense of more packet loss than Best Effort (BE).
Therefore, ABE is better suited than BE for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2023:MEE,
author = "Chi Lin and Shibo Hao and Wei Yang and Pengfei Wang
and Lei Wang and Guowei Wu and Qiang Zhang",
title = "Maximizing Energy Efficiency of Period-Area Coverage
With a {UAV} for Wireless Rechargeable Sensor
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1657--1673",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3220927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3220927",
abstract = "Wireless Rechargeable Sensor Networks (WRSNs) with
perpetual network lifetime have been used in many
Internet of Things (IoT) applications, like oceanic
monitoring and precision agriculture. Rechargeable
sensors, together with an Unmanned Aerial Vehicle
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Narasimha:2023:ADD,
author = "Dheeraj Narasimha and Srinivas Shakkottai and Lei
Ying",
title = "Age-Dependent Distributed {MAC} for Ultra-Dense
Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1674--1687",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3228173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3228173",
abstract = "We consider an ultra-dense wireless network with {$<$
inline}-{formula$>$} {$<$ tex}-math
notation=``LaTeX''{$>$}$N$ {$<$}/tex-{math$ > $$ <$ } /
inline - {f o r m u l a$ >$ } channels and {$ <$ i n l
i n e} - {f o r m u l a$ >$ } {$ <$ t e x} - math
notation = ``LaTeX''{$ >$ }$M = N$ {$ <$ } / tex - {m a
t h$ > $$<$}/inline-{formula$>$} devices. Messages with
fresh \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tsanikidis:2023:RSR,
author = "Christos Tsanikidis and Javad Ghaderi",
title = "Randomized Scheduling of Real-Time Traffic in Wireless
Networks Over Fading Channels",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1688--1701",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3223315",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3223315",
abstract = "Despite the rich literature on scheduling algorithms
for wireless networks, algorithms that can provide
deadline guarantees on packet delivery for general
traffic and interference models are very limited. In
this paper, we study the problem of scheduling
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Malandrino:2023:EDD,
author = "Francesco Malandrino and Carla Fabiana Chiasserini and
Giuseppe di Giacomo",
title = "Efficient Distributed {DNNs} in the Mobile-Edge-Cloud
Continuum",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1702--1716",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3222640",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3222640",
abstract = "In the mobile-edge-cloud continuum, a plethora of
heterogeneous data sources and computation-capable
nodes are available. Such nodes can cooperate to
perform a distributed learning task, aided by a
learning controller (often located at the network
edge). \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:ECP,
author = "Xiang Chen and Hongyan Liu and Dong Zhang and Qun
Huang and Haifeng Zhou and Chunming Wu and Qiang Yang",
title = "Eliminating Control Plane Overload via Measurement
Task Placement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1717--1731",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3223420",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3223420",
abstract = "Recent efforts in network measurement place
measurement tasks on programmable switches to measure
high-speed traffic. These tasks extract flow data,
i.e., events, from packets and send events to the
control plane. However, the tasks may generate massive
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gao:2023:BBH,
author = "Kaihui Gao and Chen Sun and Shuai Wang and Dan Li and
Yu Zhou and Hongqiang Harry Liu and Lingjun Zhu and
Ming Zhang and Xiang Deng and Cheng Zhou and Lu Lu",
title = "Buffer-Based High-Coverage and Low-Overhead Request
Event Monitoring in the Cloud",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1732--1747",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3224610",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3224610",
abstract = "Request latency directly affects the performance of
modern cloud applications. Due to various causes in
hosts and networks, requests can suffer from request
latency anomalies (RLAs), which may violate the
Service-Level Agreement. However, existing \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gao:2023:DVF,
author = "Kaihui Gao and Shuai Wang and Kun Qian and Dan Li and
Rui Miao and Bo Li and Yu Zhou and Ennan Zhai and Chen
Sun and Jiaqi Gao and Dai Zhang and Binzhang Fu and
Frank Kelly and Dennis Cai and Hongqiang Harry Liu and
Yan Li and Hongwei Yang and Tao Sun",
title = "Dependable Virtualized Fabric on Programmable Data
Plane",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1748--1764",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3224617",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3224617",
abstract = "In modern multi-tenant data centers, each tenant
desires reassuring dependability from the virtualized
network fabric &\#x2013; bandwidth guarantee with work
conservation, bounded tail latency and resilient
reachability. However, the slow convergence of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2023:ETS,
author = "Zheng Yang and Xu Wang and Jiahang Wu and Yi Zhao and
Qiang Ma and Xin Miao and Li Zhang and Zimu Zhou",
title = "{EdgeDuet}: Tiling Small Object Detection for Edge
Assisted Autonomous Mobile Vision",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1765--1778",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3223412",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3223412",
abstract = "Accurate, real-time object detection on
resource-constrained devices enables autonomous mobile
vision applications such as traffic surveillance,
situational awareness, and safety inspection, where it
is crucial to detect both small and large objects in
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tsai:2023:DOO,
author = "Cho-Hsin Tsai and Chih-Chun Wang",
title = "Distribution-Oblivious Online Algorithms for
Age-of-Information Penalty Minimization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1779--1794",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3230009",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3230009",
abstract = "The ever-increasing needs of supporting real-time
applications have spurred new studies on minimizing
Age-of-Information (AoI), a novel metric characterizing
the data freshness of the system. This work studies the
single-queue information update system \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2023:KAI,
author = "Meng Jin and Xinbing Wang and Chenghu Zhou",
title = "Key Agreement on {IoT} Devices With Echo Profiling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1795--1808",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3230642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3230642",
abstract = "Secure Device-to-Device (D2D) communication is
important for the Internet-of-Things (IoT) devices. Key
agreement between devices is the important first step
in building a secure D2D channel. Due to the lack of
third-party certification, key agreement for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2023:TMO,
author = "Bai Liu and Qingkai Liang and Eytan Modiano",
title = "Tracking {MaxWeight}: Optimal Control for Partially
Observable and Controllable Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1809--1821",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3225752",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3225752",
abstract = "Modern networks are complex and may include components
that cannot be fully controlled or observed. Such
network models can be characterized by overlay-underlay
structures, where the network controller can only
observe and operate on overlay nodes, and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shukla:2023:RVP,
author = "Apoorv Shukla and Kevin Hudemann and Zsolt V{\'a}gi
and Lily H{\"u}gerich and Georgios Smaragdakis and
Artur Hecker and Stefan Schmid and Anja Feldmann",
title = "Runtime Verification for Programmable Switches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1822--1837",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3234931",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3234931",
abstract = "We introduce a runtime verification framework for
programmable switches that complements static analysis.
To evaluate our approach, we design and develop {$<$
monospace$>$P6$<$}/{monospace$>$}, a runtime
verification system that automatically detects,
localizes, and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ha:2023:COE,
author = "Youngmok Ha and Eunji Pak and Jongkil Park and Taeho
Kim and Ji Won Yoon",
title = "Clock Offset Estimation for Systems With Asymmetric
Packet Delays",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1838--1853",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3229407",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3229407",
abstract = "This paper proposes a new clock offset estimation that
mitigates unwanted link asymmetry for precise clock
synchronization. The main contribution is to address
the primary and traditional design issue of the IEEE
1588 standard precision time protocol (PTP). \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2023:CCA,
author = "Qilong Shi and Yuchen Xu and Jiuhua Qi and Wenjun Li
and Tong Yang and Yang Xu and Yi Wang",
title = "Cuckoo Counter: Adaptive Structure of Counters for
Accurate Frequency and Top-$k$ Estimation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1854--1869",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3232098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3232098",
abstract = "Frequency estimation and top-k flows identification
are fundamental problems in network traffic
measurement. Sketch, as a basic probabilistic data
structure, has been extensively investigated and used
in different management applications. However, few of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2023:HED,
author = "Bingnan Hou and Zhiping Cai and Kui Wu and Tao Yang
and Tongqing Zhou",
title = "{6Scan}: a High-Efficiency Dynamic {Internet}-Wide
{IPv6} Scanner With Regional Encoding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "4",
pages = "1870--1885",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3233953",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3233953",
abstract = "Efficient Internet-wide scanning plays a vital role in
network measurement and cybersecurity analysis. While
Internet-wide IPv4 scanning is a solved problem,
Internet-wide scanning for IPv6 is still a mission yet
to be accomplished due to its vast address \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2023:UAS,
author = "Qingjun Xiao and Xuyuan Cai and Yifei Qin and Zhiying
Tang and Shigang Chen and Yu Liu",
title = "Universal and Accurate Sketch for Estimating Heavy
Hitters and Moments in Data Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1919--1934",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3216025",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3216025",
abstract = "In computer networks, traffic measurement is a module
in a network probe to measure flow-level statistics
from an IP packet stream, which are the basis for
network performance monitoring and malicious activity
detection. This module extracts the flow IDs \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Anderson:2023:LLO,
author = "Daron Anderson and George Iosifidis and Douglas J.
Leith",
title = "Lazy {Lagrangians} for Optimistic Learning With Budget
Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1935--1949",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3222404",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3222404",
abstract = "We consider the general problem of online convex
optimization with time-varying budget constraints in
the presence of predictions for the next cost and
constraint functions, that arises in a plethora of
network resource management problems. A novel saddle-.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yan:2023:CAP,
author = "Shangyao Yan and Zhimeng Yin and Guang Tan",
title = "{CurveLight}: an Accurate and Practical Light
Positioning System",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1950--1964",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3224817",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3224817",
abstract = "This paper presents CurveLight, an accurate and
practical light positioning system. In CurveLight, the
signal transmitter includes an infrared LED, covered by
a hemispherical and rotatable shade, and the receiver
detects the light signals with a \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2023:TFP,
author = "Zehua Guo and Songshi Dou and Wenfei Wu and Yuanqing
Xia",
title = "Toward Flexible and Predictable Path Programmability
Recovery Under Multiple Controller Failures in
Software-Defined {WANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1965--1980",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3227423",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3227423",
abstract = "Software-Defined Networking (SDN) promises good
network performance in Wide Area Networks (WANs) with
the logically centralized control using physically
distributed controllers. In Software-Defined WANs
(SD-WANs), maintaining path programmability, which
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:EFL,
author = "Tinghao Zhang and Kwok-Yan Lam and Jun Zhao and Feng
Li and Huimei Han and Norziana Jamil",
title = "Enhancing Federated Learning With Spectrum Allocation
Optimization and Device Selection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1981--1996",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3231986",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3231986",
abstract = "Machine learning (ML) is a widely accepted means for
supporting customized services for mobile devices and
applications. Federated Learning (FL), which is a
promising approach to implement machine learning while
addressing data privacy concerns, typically \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2023:ORP,
author = "Xinzhe Fu and Eytan Modiano",
title = "Optimal Routing to Parallel Servers With Unknown
Utilities --- Multi--Armed Bandit With Queues",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "1997--2012",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3227136",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3227136",
abstract = "We consider the optimal routing problem in a
discrete-time system with a job dispatcher connected to
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jiang:2023:AOB,
author = "Suhan Jiang and Jie Wu",
title = "Approaching an Optimal Bitcoin Mining Overlay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2013--2026",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3235307",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3235307",
abstract = "Bitcoin builds upon an unstructured peer-to-peer
overlay network to disseminate transactions and blocks.
Broadcast in such a network is slow and brings
inconsistencies, i. e., peers have different views of
the system state. Due to the delayed block \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhong:2023:THP,
author = "Jincheng Zhong and Ziling Wei and Shuang Zhao and
Shuhui Chen",
title = "{TupleTree}: a High-Performance Packet Classification
Algorithm Supporting Fast Rule-Set Updates",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2027--2041",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3227206",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3227206",
abstract = "Packet classification plays a crucial role in various
network functions such as access control and routing.
In recent years, the rapid development of SDN and NFV
poses new challenges for packet classification to
support fast rule-set updates as \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2023:SSA,
author = "Rui Xia and Haipeng Dai and Jiaqi Zheng and Rong Gu
and Xiaoyu Wang and Weijun Wang and Guihai Chen",
title = "{SAFE}: Service Availability via Failure Elimination
Through {VNF} Scaling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2042--2057",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3233488",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3233488",
abstract = "Virtualized network functions (VNFs) enable software
applications to replace traditional middleboxes, which
are more flexible and scalable in the network service
provision. This paper focuses on ensuring Service
Availability via Failure Elimination (SAFE) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qiu:2023:OBS,
author = "Tianyou Qiu and Yiping Li and Xisheng Feng",
title = "Optimal Broadcast Scheduling Algorithm for a
Multi-{AUV} Acoustic Communication Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2058--2069",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3232956",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3232956",
abstract = "In systems of multiple autonomous underwater vehicles
(AUVs), to achieve cooperative operation and cluster
intelligence, information is often disseminated via
broadcasting. However, due to the long propagation
delay and slow transmission rate of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2023:APS,
author = "Qian Chen and Jiliang Wang",
title = "{AlignTrack}: Push the {SNR} Limit of {LoRa} Collision
Decoding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2070--2085",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3235041",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3235041",
abstract = "LoRa has been shown as a promising Low-Power Wide Area
Network (LPWAN) technology to connect millions of
devices for the Internet of Things by providing
long-distance low-power communication when the SNR is
very low. Real LoRa networks, however, suffer
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sahay:2023:PLI,
author = "Rajeev Sahay and Serena Nicoll and Minjun Zhang and
Tsung-Yen Yang and Carlee Joe-Wong and Kerrie A.
Douglas and Christopher G. Brinton",
title = "Predicting Learning Interactions in Social Learning
Networks: a Deep Learning Enabled Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2086--2100",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3237978",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3237978",
abstract = "We consider the problem of predicting link formation
in Social Learning Networks (SLN), a type of social
network that forms when people learn from one another
through structured interactions. While link prediction
has been studied for general types of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2023:DAT,
author = "Kun Xie and Yudian Ouyang and Xin Wang and Gaogang Xie
and Kenli Li and Wei Liang and Jiannong Cao and Jigang
Wen",
title = "Deep Adversarial Tensor Completion for Accurate
Network Traffic Measurement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2101--2116",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3233908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3233908",
abstract = "Network trouble shooting, failure location, and
anomaly detection rely heavily on network traffic
measurement data. Due to the lack of measurement
infrastructure, the high measurement cost, and the
unavoidable transmission loss, network monitoring
systems \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kong:2023:TMU,
author = "Hao Kong and Li Lu and Jiadi Yu and Yingying Chen and
Xiangyu Xu and Feng Lyu",
title = "Toward Multi-User Authentication Using {WiFi}
Signals",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2117--2132",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3237686",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3237686",
abstract = "User authentication nowadays has become an important
support for not only security guarantees but also
emerging novel applications. Although WiFi signal-based
user authentication has achieved initial success, it
works in single-user scenarios while multi-. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dasala:2023:SMU,
author = "Keerthi Priya Dasala and Josep Miquel Jornet and
Edward W. Knightly",
title = "Scaling Multi-User {mmWave WLANs}: The Case for
Concurrent Uplink Transmissions on a Single {RF}
Chain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2133--2146",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3239438",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3239438",
abstract = "Today&\#x2019;s mmWave WLANs can realize simultaneous
multi-user multi-stream transmission solely on the
downlink. In this paper, we present Uplink Multi-user
Beamforming on single RF chain AP (UMBRA), a novel
framework for supporting multi-stream multi-.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiong:2023:RLD,
author = "Guojun Xiong and Shufan Wang and Gang Yan and Jian
Li",
title = "Reinforcement Learning for Dynamic Dimensioning of
Cloud Caches: a Restless Bandit Approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2147--2161",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3235480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3235480",
abstract = "We study the dynamic cache dimensioning problem, where
the objective is to decide how much storage to place in
the cache to minimize the total costs with respect to
the storage and content delivery latency. We formulate
this problem as a Markov decision \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:RMW,
author = "Jia Zhang and Shaorui Ren and Enhuan Dong and Zili
Meng and Yuan Yang and Mingwei Xu and Sijie Yang and
Miao Zhang and Yang Yue",
title = "Reducing Mobile {Web} Latency Through Adaptively
Selecting Transport Protocol",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2162--2177",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3235907",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3235907",
abstract = "To improve the performance of mobile web services, a
new transport protocol, QUIC, has been recently
proposed as a substitute for TCP. However, with pros
and cons of QUIC, it is challenging to decide whether
and when to use QUIC in large-scale real-world
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abolhassani:2023:OLS,
author = "Bahman Abolhassani and John Tadrous and Atilla
Eryilmaz",
title = "Optimal Load-Splitting and Distributed-Caching for
Dynamic Content Over the Wireless Edge",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2178--2190",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3244039",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3244039",
abstract = "In this work, we consider the problem of
&\#x2018;fresh&\#x2019; caching at distributed
(front-end) local caches of content that is subject to
&\#x2018;dynamic&\#x2019; updates at the (back-end)
database. We first provide new models and analyses of
the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Baiocchi:2023:FCO,
author = "Andrea Baiocchi and Ion Turcanu",
title = "On Flow Control and Optimized Back-Off in
Non-Saturated {CSMA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2191--2206",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3239410",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3239410",
abstract = "Medium Access Control (MAC) main functions encompass
contention for channel access, packet scheduling, error
control, and data integrity. Channel contention is a
collective function involving all stations in the
network, while data integrity pertains to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2023:AUD,
author = "Yijing Zeng and Roberto Calvo-Palomino and Domenico
Giustiniano and Gerome Bovet and Suman Banerjee",
title = "Adaptive Uplink Data Compression in Spectrum
Crowdsensing Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2207--2221",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3239378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3239378",
abstract = "Understanding spectrum activity is challenging when
attempted at scale. The wireless community has recently
risen to this challenge in designing spectrum
monitoring systems that utilize many low-cost spectrum
sensors to gather large volumes of sampled \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zou:2023:BBB,
author = "Renpeng Zou and Xixiang Lyu and Jing Ma and Bowen
Zhang and Danfang Wu",
title = "{BCMIX}: a Blockchain-Based Dynamic
Self-Reconfigurable {Mixnet}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2222--2235",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3244962",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3244962",
abstract = "The increasing awareness of privacy preservation has
led to a strong focus on mix networks (mixnets)
protecting anonymity. As an efficient mixnet, cMix
greatly reduces the latency, but brings privacy leakage
risks due to the use of presetting mix nodes \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2023:EDN,
author = "Yuanyuan Li and Yuezhou Liu and Lili Su and Edmund Yeh
and Stratis Ioannidis",
title = "Experimental Design Networks: a Paradigm for Serving
Heterogeneous Learners Under Networking Constraints",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2236--2250",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3243534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3243534",
abstract = "Significant advances in edge computing capabilities
enable learning to occur at geographically diverse
locations. In general, the training data needed in
those learning tasks are not only heterogeneous but
also not fully generated locally. In this paper,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yasodharan:2023:ROB,
author = "Sarath Yasodharan and Anurag Kumar",
title = "Revenue Optimal Bandwidth Allocation in a Class of
Multihop Networks: Algorithms and Asymptotic
Optimality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2251--2266",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3249480",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3249480",
abstract = "We study Bandwidth Reservation (BR) policies for the
Bandwidth on Demand (BoD) problem in a class of
multihop networks. We motivate an Erlang fixed-point BR
heuristic for the general BoD problem by first
establishing the optimality of BR on a class of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fang:2023:GGR,
author = "Jin Fang and Gongming Zhao and Hongli Xu and Changbo
Wu and Zhuolong Yu",
title = "{GRID}: Gradient Routing With In-Network Aggregation
for Distributed Training",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2267--2280",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3244794",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3244794",
abstract = "As the scale of distributed training increases, it
brings huge communication overhead in clusters. Some
works try to reduce the communication cost through
gradient compression or communication scheduling.
However, these methods either downgrade the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Akhtar:2023:FSR,
author = "Md Shahbaz Akhtar and Krishnakumar G. and Vishnu B.
and Abhishek Sinha",
title = "Fast and Secure Routing Algorithms for Quantum Key
Distribution Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2281--2296",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3246114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3246114",
abstract = "We investigate the problem of fast and secure packet
routing in multi-hop Quantum Key Distribution (QKD)
networks. We consider a practical trusted-node setup
where a QKD protocol randomly generates symmetric
private key pairs over each QKD-enabled link in
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xing:2023:OLA,
author = "Yitao Xing and Kaiping Xue and Yuan Zhang and
Jiangping Han and Jian Li and David S. L. WeiMember",
title = "An Online Learning Assisted Packet Scheduler for
{MPTCP} in Mobile Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2297--2312",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3246168",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3246168",
abstract = "Multipath TCP is designed to utilize multiple network
paths to achieve improved throughput and robustness
against network failure. These features are supposed to
make MPTCP preferable to single-path TCP in mobile
networks. However, it fails to achieve the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2023:SBN,
author = "Yibo Jin and Lei Jiao and Mingtao Ji and Zhuzhong Qian
and Sheng Zhang and Ning Chen and Sanglu Lu",
title = "Scheduling In-Band Network Telemetry With
Convergence-Preserving Federated Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2313--2328",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3253302",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3253302",
abstract = "Conducting federated learning across distributed sites
with In-Band Network Telemetry (INT) based data
collection faces critical challenges, including control
decisions of different frequencies, convergence of the
models being trained, and resource \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2023:SFF,
author = "Pengtao Fu and Lailong Luo and Deke Guo and Shangsen
Li and Yun Zhou",
title = "A Shifting Filter Framework for Dynamic Set Queries",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2329--2344",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3247628",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3247628",
abstract = "Set query is a fundamental problem in computer
systems. Plenty of applications rely on the query
results of membership, association, and multiplicity. A
traditional method that addresses such a fundamental
problem is derived from Bloom filter. However,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jia:2023:ECM,
author = "Riheng Jia and Jinhao Wu and Xiong Wang and Jianfeng
Lu and Feilong Lin and Zhonglong Zheng and Minglu Li",
title = "Energy Cost Minimization in Wireless Rechargeable
Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2345--2360",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3248088",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3248088",
abstract = "Mobile chargers (MCs) are usually dispatched to
deliver energy to sensors in wireless rechargeable
sensor networks (WRSNs) due to its flexibility and easy
maintenance. This paper concerns the fundamental issue
of charging path DEsign with the Minimized \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:RCD,
author = "Yiran Zhang and Qingkai Meng and Yifan Liu and
Fengyuan Ren",
title = "Revisiting Congestion Detection in Lossless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "5",
pages = "2361--2375",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3250484",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:44 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3250484",
abstract = "Congestion detection is the cornerstone of end-to-end
congestion control. Through in-depth observations and
understandings, we reveal that existing congestion
detection mechanisms in mainstream lossless networks
(i.e., Converged Enhanced Ethernet and \ldots{})",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2023:AHA,
author = "Han Zhang and Xia Yin and Xingang Shi and Jilong Wang
and Zhiliang Wang and Yingya Guo and Tian Lan and Yahui
Li and Yongqing Zhu and Ke Ruan and Haijun Geng",
title = "Achieving High Availability in Inter-{DC WAN} Traffic
Engineering",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2406--2421",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3216592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3216592",
abstract = "Inter-DataCenter Wide Area Network (Inter-DC WAN) that
connects geographically distributed data centers is
becoming one of the most critical network
infrastructures. Due to limited bandwidth and
inevitable link failures, it is highly challenging to
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:SID,
author = "Yuntao Wang and Zhou Su and Qichao Xu and Ruidong Li
and Tom H. Luan and Pinghui Wang",
title = "A Secure and Intelligent Data Sharing Scheme for
{UAV}-Assisted Disaster Rescue",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2422--2438",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3226458",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3226458",
abstract = "Unmanned aerial vehicles (UAVs) have the potential to
establish flexible and reliable emergency networks in
disaster sites when terrestrial communication
infrastructures go down. Nevertheless, potential
security threats may occur on UAVs during data
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2023:CPA,
author = "Hong Xie and John C. S. Lui",
title = "Cooperation Preference Aware {Shapley} Value:
Modeling, Algorithms and Applications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2439--2453",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3228933",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3228933",
abstract = "The Shapley value is a cornerstone in cooperative game
theory and has been widely applied in networking, data
science, etc. The classical Shapley value assumes that
each player has an equal preference to cooperate with
each other. Since the cooperation \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{An:2023:OEE,
author = "Congkai An and Anfu Zhou and Jialiang Pei and Xi Liu
and Dongzhu Xu and Liang Liu and Huadong Ma",
title = "{Octopus}: Exploiting the Edge Intelligence for
Accessible {5G} Mobile Performance Enhancement",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2454--2469",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3224369",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3224369",
abstract = "While 5G has rolled out since 2019 and exhibited
versatile advantages, its performance under
high/extreme mobility scenes (e.g., driving, high-speed
railway or HSR) remains mysterious. In this work, we
carry out a large-scale field-trial campaign, taking
\&. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sanchez:2023:AAC,
author = "Sara Garcia Sanchez and Guillem Reus-Muns and Carlos
Bocanegra and Yanyu Li and Ufuk Muncuk and Yousof
Naderi and Yanzhi Wang and Stratis Ioannidis and
Kaushik Roy Chowdhury",
title = "{AirNN}: Over-the-Air Computation for Neural Networks
via Reconfigurable Intelligent Surfaces",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2470--2482",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3225883",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3225883",
abstract = "Over-the-air analog computation allows offloading
computation to the wireless environment through
carefully constructed transmitted signals. In this
paper, we design and implement the first-of-its-kind
convolution that uses over-the-air computation and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Danilchenko:2023:CUQ,
author = "Kiril Danilchenko and Zeev Nutov and Michael Segal",
title = "Covering Users With {QoS} by a Connected Swarm of
Drones: Graph Theoretical Approach and Experiments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2483--2498",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3231184",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3231184",
abstract = "In this work, we study the connected version of the
covering problem motivated by the coverage of ad-hoc
drones&\#x2019; swarm. We focus on the situation where
the number of drones is given, and this number is not
necessarily enough to cover all users. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yun:2023:SFL,
author = "Won Joon Yun and Yunseok Kwak and Hankyul Baek and
Soyi Jung and Mingyue Ji and Mehdi Bennis and Jihong
Park and Joongheon Kim",
title = "{SlimFL}: Federated Learning With Superposition Coding
Over Slimmable Neural Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2499--2514",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2022.3231864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3231864",
abstract = "Federated learning (FL) is a key enabler for efficient
communication and computing, leveraging
devices&\#x2019; distributed computing capabilities.
However, applying FL in practice is challenging due to
the local devices&\#x2019; heterogeneous energy,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2023:PPU,
author = "Guocheng Liao and Xu Chen and Jianwei Huang",
title = "Privacy Protection Under Incomplete Social and Data
Correlation Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2515--2528",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3254549",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3254549",
abstract = "Data reporters have privacy concerns when they are
requested to contribute personal data to a data
collector. Such privacy concerns are strengthened by
data correlation and social relationship, as the data
correlation could inevitably cause privacy issues
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lv:2023:MPF,
author = "Qian Lv and Zuqing Zhu",
title = "On the Multilayer Planning of Filterless Optical
Networks With {OTN} Encryption",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2529--2544",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3256409",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3256409",
abstract = "With enhanced cost-effectiveness, filterless optical
networks (FONs) have been considered as a promising
candidate for future optical infrastructure. However,
as the transmission in FON relies on the
&\#x201C;select-and-broadcast&\#x201D; scenario, it is
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:SDD,
author = "Wei Wang and Xin Liu and Yao Yao and Zicheng Chi and
Stuart Ray and Ting Zhu and Yanchao Zhang",
title = "Simultaneous Data Dissemination Among {WiFi} and
{ZigBee} Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2545--2558",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3243070",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3243070",
abstract = "Recent advances in Cross-Technology Communication
(CTC) have opened a new door for cooperation among
heterogeneous IoT devices to support ubiquitous
applications, such as smart homes and smart offices.
However, existing work mainly focuses on physical
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lai:2023:SCC,
author = "Zeqi Lai and Hewu Li and Qi Zhang and Qian Wu and
Jianping Wu",
title = "{StarFront}: Cooperatively Constructing Pervasive and
Low-Latency {CDNs} Upon Emerging {LEO} Satellites and
Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2559--2574",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3260166",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3260166",
abstract = "Internet content providers (ICPs) typically exploit
content distribution networks (CDNs) to provide
wide-area data access with high availability and low
latency. However, our analysis on a large-scale trace
collected from seven major CDN operators has \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dou:2023:EIC,
author = "Songshi Dou and Li Qi and Chao Yao and Zehua Guo",
title = "Exploring the Impact of Critical Programmability on
Controller Placement for Software-Defined Wide Area
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2575--2588",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3252639",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3252639",
abstract = "Control latency is a critical concern for deploying
Software-Defined Networking (SDN) into Wide Area
Networks (WANs). A Software-Defined WAN (SD-WAN) can be
divided into multiple domains controlled by multiple
controllers with a logically centralized \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nosyk:2023:CRP,
author = "Yevheniya Nosyk and Maciej Korczy{\'n}ski and Qasim
Lone and Marcin Skwarek and Baptiste Jonglez and
Andrzej Duda",
title = "The {Closed Resolver Project}: Measuring the
Deployment of Inbound Source Address Validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2589--2603",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3257413",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3257413",
abstract = "Ingress filtering, commonly referred to as Source
Address Validation (SAV), is a practice aimed at
discarding packets with spoofed source IP addresses at
the network periphery. Outbound SAV, i.e., dropping
traffic with spoofed source IP addresses as it
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2023:OPC,
author = "Yongquan Fu and Lun An and Siqi Shen and Kai Chen and
Pere Barlet-Ros",
title = "A One-Pass Clustering Based Sketch Method for Network
Monitoring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2604--2613",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3251981",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3251981",
abstract = "Network monitoring solutions need to cope with
increasing network traffic volumes, as a result,
sketch-based monitoring methods have been extensively
studied to trade accuracy for memory scalability and
storage reduction. However, sketches are sensitive
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abdelmoniem:2023:ETH,
author = "Ahmed M. Abdelmoniem and Brahim Bensaou",
title = "Enhancing {TCP} via Hysteresis Switching: Theoretical
Analysis and Empirical Evaluation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2614--2623",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3262564",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3262564",
abstract = "In this paper we study the relationship between the
TCP packet loss cycle and the performance of
time-sensitive traffic in data centers. Using real
traffic measurements and analysis, we find that such
loss cycles are not long enough to enable most
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lin:2023:FSR,
author = "Fusheng Lin and Hongyu Wang and Guo Chen and Guihua
Zhou and Tingting Xu and Dehui Wei and Li Chen and
Yuanwei Lu and Andrew Qu and Hua Shao and Hongbo
Jiang",
title = "Fast, Scalable and Robust Centralized Routing for Data
Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2624--2639",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3259541",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3259541",
abstract = "This paper presents a fast and robust centralized data
center network (DCN) routing solution, called Primus.
For fast routing calculation, Primus uses centralized
controllers to collect/disseminate the
network&\#x2019;s link-states (LS), and offload the
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2023:OPM,
author = "Xuezheng Liu and Zirui Yan and Yipeng Zhou and Di Wu
and Xu Chen and Jessie Hui Wang",
title = "Optimizing Parameter Mixing Under Constrained
Communications in Parallel Federated Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2640--2652",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3257236",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3257236",
abstract = "In vanilla Federated Learning (FL) systems, a
centralized parameter server (PS) is responsible for
collecting, aggregating and distributing model
parameters with decentralized clients. However, the
communication link of a single PS can be easily
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Miao:2023:CHP,
author = "Ruijie Miao and Yinda Zhang and Zihao Zheng and Ruixin
Wang and Ruwen Zhang and Tong Yang and Zaoxing Liu and
Junchen Jiang",
title = "{CocoSketch}: High-Performance Sketch-Based
Measurement Over Arbitrary Partial Key Query",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2653--2668",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3257226",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3257226",
abstract = "Sketch-based measurement has emerged as a promising
solutions due to its high accuracy and resource
efficiency. Prior sketches focus on measuring single
flow keys and cannot support measurement on multiple
keys. This work takes a significant step towards
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chitavisutthivong:2023:OOR,
author = "Kanatip Chitavisutthivong and Sucha Supittayapornpong
and Pooria Namyar and Mingyang Zhang and Minlan Yu and
Ramesh Govindan",
title = "Optimal Oblivious Routing With Concave Objectives for
Structured Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2669--2681",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3264632",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3264632",
abstract = "Oblivious routing distributes traffic from sources to
destinations following predefined routes with rules
independent of traffic demands. While finding optimal
oblivious routing with a concave objective is
intractable for general topologies, we show that
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ganguly:2023:MES,
author = "Bhargav Ganguly and Seyyedali Hosseinalipour and Kwang
Taik Kim and Christopher G. Brinton and Vaneet Aggarwal
and David J. Love and Mung Chiang",
title = "Multi-Edge Server-Assisted Dynamic Federated Learning
With an Optimized Floating Aggregation Point",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2682--2697",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3262482",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3262482",
abstract = "We propose cooperative edge-assisted dynamic federated
learning ({$<$ monospace$>$CE}-{FL$<$}/{monospace$>$}).
{$<$ monospace$>$CE}-{FL$<$}/{monospace$>$} introduces
a distributed machine learning (ML) architecture, where
data collection is carried out at the end devices,
while the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zheng:2023:CNS,
author = "Jiaxiao Zheng and Albert Banchs and Gustavo de
Veciana",
title = "Constrained Network Slicing Games: Achieving Service
Guarantees and Network Efficiency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2698--2713",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3262810",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3262810",
abstract = "Network slicing is a key capability for next
generation mobile networks. It enables infrastructure
providers to cost effectively customize logical
networks over a shared infrastructure. A critical
component of network slicing is resource allocation,
which \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shao:2023:CCL,
author = "Qi Shao and Man Hon Cheung and Jianwei Huang",
title = "Crowdfunding With Cognitive Limitations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2714--2729",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3274114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3274114",
abstract = "To achieve the desirable funding target in a
crowdfunding campaign, the project creator needs to
accurately anticipate the pledging behaviors of
contributors with practical cognitive limitations. In
this paper, we present a study on how the
contributors\&\#. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2023:OLF,
author = "Chen Wang and Qin Hu and Dongxiao Yu and Xiuzhen
Cheng",
title = "Online Learning for Failure-Aware Edge Backup of
Service Function Chains With the Minimum Latency",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2730--2744",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3265127",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3265127",
abstract = "Virtual network functions (VNFs) have been widely
deployed in mobile edge computing (MEC) to flexibly and
efficiently serve end users running resource-intensive
applications, which can be further serialized to form
service function chains (SFCs), \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shen:2023:EDO,
author = "Dian Shen and Junzhou Luo and Fang Dong and Xiaolin
Guo and Ciyuan Chen and Kai Wang and John C. S. Lui",
title = "Enabling Distributed and Optimal {RDMA} Resource
Sharing in Large-Scale Data Center Networks: Modeling,
Analysis, and Implementation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2745--2760",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3263562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3263562",
abstract = "Remote Direct Memory Access (RDMA) suffers from
unfairness issues and performance degradation when
multiple applications share RDMA network resources.
Hence, an efficient resource scheduling mechanism is
urged to optimally allocates RDMA resources among
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hoang:2023:DRL,
author = "Linh T. Hoang and Chuyen T. Nguyen and Anh T. Pham",
title = "Deep Reinforcement Learning-Based Online Resource
Management for {UAV}-Assisted Edge Computing With Dual
Connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2761--2776",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3263538",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3263538",
abstract = "Mobile Edge Computing (MEC) is a key technology
towards delay-sensitive and computation-intensive
applications in future cellular networks. In this
paper, we consider a multi-user, multi-server system
where the cellular base station is assisted by a UAV,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2023:DTP,
author = "Yangming Zhao and Chunming Qiao",
title = "Distributed Transport Protocols for Quantum Data
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2777--2792",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3262547",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3262547",
abstract = "Quantum computing holds great promise and this work
proposes to use new quantum data networks (QDNs) to
connect multiple small quantum computers to form a
cluster. Such a QDN differs from existing quantum key
distribution (QKD) networks in that the former
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2023:LCM,
author = "Ruixuan Li and Xiaofeng Jia and Zhenyong Zhang and Jun
Shao and Rongxing Lu and Jingqiang Lin and Xiaoqi Jia
and Guiyi Wei",
title = "A Longitudinal and Comprehensive Measurement of {DNS}
Strict Privacy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2793--2808",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3262651",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3262651",
abstract = "The DNS privacy protection mechanisms, DNS over TLS
(DoT) and DNS over HTTPS (DoH), only work correctly if
both the server and client support the Strict Privacy
profile and no vulnerability exists in the implemented
TLS/HTTPS. A natural question then \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2023:BAT,
author = "Dong Yang and Zongrong Cheng and Weiting Zhang and
Hongke Zhang and Xuemin Shen",
title = "Burst-Aware Time-Triggered Flow Scheduling With
Enhanced Multi-{CQF} in Time-Sensitive Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2809--2824",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3264583",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3264583",
abstract = "Deterministic transmission guarantee in time-sensitive
networks (TSN) relies on queue models (such as CQF,
TAS, ATS) and resource scheduling algorithms. Thanks to
its ease of use, the CQF queue model has been widely
adopted. However, the existing resource \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2023:AFG,
author = "Lailong Luo and Pengtao Fu and Shangsen Li and Deke
Guo and Qianzhen Zhang and Huaimin Wang",
title = "{Ark Filter}: a General and Space-Efficient Sketch for
Network Flow Analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2825--2839",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3263839",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3263839",
abstract = "Sketches are widely deployed to represent network
flows to support complex flow analysis. Typical
sketches usually employ hash functions to map elements
into a hash table or bit array. Such sketches still
suffer from potential weaknesses upon throughput,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2023:AMM,
author = "Xiuqi Huang and Yuanning Gao and Xinyi Zhou and
Xiaofeng Gao and Guihai Chen",
title = "An Adaptive Metadata Management Scheme Based on Deep
Reinforcement Learning for Large-Scale Distributed File
Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "31",
number = "6",
pages = "2840--2853",
year = "2023",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3266400",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:46 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3266400",
abstract = "A major challenge confronting today&\#x2019;s
distributed metadata management schemes is how to meet
the dynamic requirements of various applications
through effectively mapping and migrating metadata
nodes to different metadata servers (MDS&\#x2019;s).
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Kim:2024:EDG,
author = "Junseon Kim and Youngbin Im and Kyunghan Lee",
title = "Enabling Delay-Guaranteed Congestion Control With
One-Bit Feedback in Cellular Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "3--16",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3268721",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3268721",
abstract = "Unexpected large packet delays are often observed in
cellular networks due to huge network queuing caused by
excessive traffic coming into the network. To deal with
the large queue problem, many congestion control
algorithms try to find out how much \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Khochare:2024:IAC,
author = "Aakash Khochare and Francesco Betti Sorbelli and
Yogesh Simmhan and Sajal K. Das",
title = "Improved Algorithms for Co-Scheduling of Edge
Analytics and Routes for {UAV} Fleet Missions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "17--33",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3277810",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3277810",
abstract = "Unmanned Aerial Vehicles (UAVs) or drones are
increasingly used for urban applications like traffic
monitoring and construction surveys. Autonomous
navigation allows drones to visit waypoints and
accomplish activities as part of their mission. A
common \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shan:2024:EFT,
author = "Danfeng Shan and Linbing Jiang and Peng Zhang and
Wanchun Jiang and Hao Li and Yazhe Tang and Fengyuan
Ren",
title = "Enforcing Fairness in the Traffic Policer Among
Heterogeneous Congestion Control Algorithms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "34--49",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3276410",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3276410",
abstract = "Traffic policing is widely used by ISPs to limit their
customers&\#x2019; traffic rates. It has long been
believed that a well-tuned traffic policer offers a
satisfactory performance for TCP. However, we find this
belief breaks with the emergence of new \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yuan:2024:JOQ,
author = "Yali Yuan and Weijun Wang and Yuhan Wang and Sripriya
Srikant Adhatarao and Bangbang Ren and Kai Zheng and
Xiaoming Fu",
title = "Joint Optimization of {QoE} and Fairness for Adaptive
Video Streaming in Heterogeneous Mobile Environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "50--64",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3277729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3277729",
abstract = "The rapid growth of mobile video traffic and user
demand poses a more stringent requirement for efficient
bandwidth allocation in mobile networks where multiple
users may share a bottleneck link. This provides
content providers an opportunity to jointly \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{He:2024:BBS,
author = "Qiang He and Zheng Feng and Hui Fang and Xingwei Wang
and Liang Zhao and Yudong Yao and Keping Yu",
title = "A Blockchain-Based Scheme for Secure Data Offloading
in Healthcare With Deep Reinforcement Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "65--80",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3274631",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3274631",
abstract = "With the widespread popularity of the Internet of
Things and various intelligent medical devices, the
amount of medical data is rising sharply, and thus
medical data processing has become increasingly
challenging. Mobile edge computing technology allows
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Carvalho:2024:SDD,
author = "Fabr{\'\i}cio B. Carvalho and Ronaldo A. Ferreira and
{\'I}talo Cunha and Marcos A. M. Vieira and Murali K.
Ramanathan",
title = "State Disaggregation for Dynamic Scaling of Network
Functions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "81--95",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3282562",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3282562",
abstract = "Network Function Virtualization promises better
utilization of computational resources by dynamically
scaling resources on demand. However, most network
functions (NFs) are stateful and require state updates
on a per-packet basis. During a scaling \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:TCA,
author = "Yizong Wang and Dong Zhao and Chenghao Huang and Fuyu
Yang and Teng Gao and Anfu Zhou and Huanhuan Zhang and
Huadong Ma and Yang Du and Aiyun Chen",
title = "{TrafAda}: Cost-Aware Traffic Adaptation for
Maximizing Bitrates in Live Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "96--109",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3285812",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3285812",
abstract = "The business growth of live streaming causes expensive
bandwidth costs from the Content Delivery Network
service. It necessitates traffic adaptation, i.e.,
adapting video bitrates for cost-efficient bandwidth
utilization, especially under the 95 \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2024:JRU,
author = "Gongming Zhao and Jingzhou Wang and Hongli Xu and
Yangming Zhao and Xuwei Yang and He Huang",
title = "Joint Request Updating and Elastic Resource
Provisioning With {QoS} Guarantee in Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "110--126",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3276881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3276881",
abstract = "In a commercial cloud, service providers (e.g., video
streaming service provider) rent resources from cloud
vendors (e.g., Google Cloud Platform) and provide
services to cloud users, making a profit from the price
gap. Cloud users acquire services by \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jiang:2024:ICB,
author = "Wanchun Jiang and Haoyang Li and Jia Wu and Zheyuan
Liu and Jiawei Huang and Danfeng Shan and Jianxin
Wang",
title = "Improvement of {Copa}: Behaviors and Friendliness of
Delay-Based Congestion Control Algorithm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "127--142",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3278677",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3278677",
abstract = "Delay-based congestion control has drawn a lot of
attention in both academics and industry recently.
Specifically, the Copa algorithm proposed in NSDI can
achieve consistent high performance under various
network environments and has already been deployed
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2024:TIP,
author = "Zehua Guo and Songshi Dou and Wenchao Jiang and
Yuanqing Xia",
title = "Toward Improved Path Programmability Recovery for
Software-Defined {WANs} Under Multiple Controller
Failures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "143--158",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286456",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286456",
abstract = "Enabling path programmability is an essential feature
of Software-Defined Networking (SDN). During controller
failures in Software-Defined Wide Area Networks
(SD-WANs), a resilient design should maintain path
programmability for offline flows, which were
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:PPL,
author = "Xiaoli Zhang and Wei Geng and Yiqiao Song and Hongbing
Cheng and Ke Xu and Qi Li",
title = "Privacy-Preserving and Lightweight Verification of
Deep Packet Inspection in Clouds",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "159--174",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3282100",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3282100",
abstract = "In the trend of network middleboxes as a service,
enterprise customers adopt in-the-cloud deep packet
inspection (DPI) services to protect networks. As
network misconfigurations and hardware failures
notoriously exist, recent efforts envision to ensure
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Deng:2024:DCU,
author = "Yong Deng and Min Dong",
title = "Decentralized Caching Under Nonuniform File Popularity
and Size: Memory-Rate Tradeoff Characterization",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "175--190",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3284347",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3284347",
abstract = "This paper aims to characterize the memory-rate
tradeoff for decentralized caching under nonuniform
file popularity and size. We consider a recently
proposed decentralized modified coded caching scheme
(D-MCCS) and formulate the cache placement \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:TSL,
author = "Xiang Chen and Hongyan Liu and Qun Huang and Dong
Zhang and Haifeng Zhou and Chunming Wu and Xuan Liu",
title = "Toward Scalable and Low-Cost Traffic Testing for
Evaluating {DDoS} Defense Solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "191--206",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3281449",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3281449",
abstract = "To date, security researchers evaluate their solutions
of mitigating distributed denial-of-service (DDoS)
attacks via kernel-based or kernel-bypassing testing
tools. However, kernel-based tools exhibit poor
scalability in attack traffic generation while
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jin:2024:CCA,
author = "Meng Jin and Yuan He and Yunhao Liu and Xinbing Wang",
title = "Covert Communication With Acoustic Noise",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "207--221",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286692",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286692",
abstract = "Along with the proliferation of IoT devices, people
have a lot of concerns on the privacy issues brought by
them. Existing solutions, employing encryption or
trying to hide the communication in PHY layer, often
suffer from the limited capability of IoT \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hosseinalipour:2024:PSL,
author = "Seyyedali Hosseinalipour and Su Wang and Nicol{\`o}
Michelusi and Vaneet Aggarwal and Christopher G.
Brinton and David J. Love and Mung Chiang",
title = "Parallel Successive Learning for Dynamic Distributed
Model Training Over Heterogeneous Wireless Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "222--237",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286987",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286987",
abstract = "Federated learning (FedL) has emerged as a popular
technique for distributing model training over a set of
wireless devices, via iterative local updates (at
devices) and global aggregations (at the server). In
this paper, we develop parallel successive \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yu:2024:RAP,
author = "Kan Yu and Jiguo Yu and Zhiyong Feng and Honglong
Chen",
title = "A Reassessment on Applying Protocol Interference Model
Under {Rayleigh} Fading: From Perspective of Link
Scheduling",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "238--252",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3284433",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3284433",
abstract = "Link scheduling plays a pivotal role in accommodating
stringent reliability and latency requirements. In this
paper, we focus on the availability and effectiveness
of applying protocol interference model (PIM) under
Rayleigh fading model to solve the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hayashi:2024:UAC,
author = "Masahito Hayashi and Takeshi Koshiba",
title = "Universal Adaptive Construction of Verifiable Secret
Sharing and Its Application to Verifiable Secure
Distributed Data Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "253--267",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3283577",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3283577",
abstract = "Secret sharing is a useful method for secure
distributed data storage. Such a distributed data
storage can avoid the information leakage under an
attack to a limited number of distributed servers.
While such distributed servers send their shares to an
end \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2024:SEE,
author = "Gongming Zhao and Jingzhou Wang and Yangming Zhao and
Hongli Xu and Liusheng Huang and Chunming Qiao",
title = "Segmented Entanglement Establishment With All-Optical
Switching in Quantum Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "268--282",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3281901",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3281901",
abstract = "There are two conventional methods to establish an
entanglement connection in a Quantum Data Networks
(QDN). One is to create single-hop entanglement links
first and then connect them with quantum swapping, and
the other is forwarding one of the entangled \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Lenzen:2024:RRM,
author = "Christoph Lenzen and Moti Medina and Mehrdad Saberi
and Stefan Schmid",
title = "Robust Routing Made Easy: Reinforcing Networks Against
Non-Benign Faults",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "283--297",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3283184",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3283184",
abstract = "With the increasing scale of communication networks,
the likelihood of failures grows as well. Since these
networks form a critical backbone of our digital
society, it is important that they rely on robust
routing algorithms which ensure connectivity \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Murakami:2024:EEP,
author = "Masaki Murakami and Takashi Kurimoto and Satoru
Okamoto and Naoaki Yamanaka",
title = "Experimental Evaluation on Priority-Aware Guaranteed
Resource Allocation for Resource Pool Based
Reconfigurable Hardware",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "298--307",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3288021",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3288021",
abstract = "This paper proposes a priority-aware guaranteed
hardware resource allocation in virtual packet optical
nodes (VPONs) and describes experimental evidence of
service provisioning with the proposed method on
testbed. A network based on the VPON brings \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Carrascosa-Zamacois:2024:WFM,
author = "Marc Carrascosa-Zamacois and Giovanni Geraci and
Edward Knightly and Boris Bellalta",
title = "{Wi-Fi} Multi-Link Operation: an Experimental Study of
Latency and Throughput",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "308--322",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3283154",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3283154",
abstract = "In this article, we investigate the real-world
capability of the multi-link operation (MLO) framework
--- one of the key MAC-layer features included in the
IEEE 802.11be amendment --- by using a large dataset
containing 5 GHz spectrum occupancy \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:AAC,
author = "Weiguang Zhang and Jiarong Liang and Xinyu Liang",
title = "Approximation Algorithms for Computing Virtual
Backbones Considering Routing Costs in Wireless
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "323--337",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3284051",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3284051",
abstract = "The strategy of constructing a virtual backbone (VB)
to perform routing tasks is considered a mature method
for addressing the broadcast storm problem in wireless
sensor networks (WSNs). A WSN can be regarded as a unit
disk graph (UDG), and its VBs can be \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:HGM,
author = "Xin Liu and Zicheng Chi and Wei Wang and Yao Yao and
Pei Hao and Ting Zhu",
title = "High-Granularity Modulation for {OFDM} Backscatter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "338--351",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286880",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286880",
abstract = "Orthogonal frequency-division multiplexing (OFDM) has
been widely used in WiFi, LTE, and adopted in 5G.
Recently, researchers have proposed multiple OFDM-based
WiFi backscatter systems that use the same underlying
design principle (i.e., codeword \ldots{})",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2024:ERD,
author = "Yiming Zeng and Jiarui Zhang and Ji Liu and Zhenhua
Liu and Yuanyuan Yang",
title = "Entanglement Routing Design Over Quantum Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "352--367",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3282560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3282560",
abstract = "Quantum networks have emerged as a future platform for
quantum information exchange and applications, with
promising capabilities far beyond traditional
communication networks. Remote quantum entanglement is
an essential component of a quantum network. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:QDD,
author = "Lutong Chen and Kaiping Xue and Jian Li and Ruidong Li
and Nenghai Yu and Qibin Sun and Jun Lu",
title = "{Q-DDCA}: Decentralized Dynamic Congestion Avoid
Routing in Large-Scale Quantum Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "368--381",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3285093",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3285093",
abstract = "The quantum network that allows users to communicate
in a quantum way will be available in the foreseeable
future. The network capable of distributing Bell state
entangled pairs faces many challenges due to
entanglement decoherence and limited network \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xie:2024:ENC,
author = "Guorui Xie and Qing Li and Guanglin Duan and Jiaye Lin
and Yutao Dong and Yong Jiang and Dan Zhao and Yuan
Yang",
title = "Empowering In-Network Classification in Programmable
Switches by Binary Decision Tree and Knowledge
Distillation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "382--395",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3287091",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3287091",
abstract = "Given the high packet processing efficiency of
programmable switches (e.g., P4 switches of Tbps),
several works are proposed to offload the decision tree
(DT) to P4 switches for in-network classification.
Although the DT is suitable for the match-action
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cai:2024:RCF,
author = "Mingxin Cai and Yutong Liu and Linghe Kong and Guihai
Chen and Liang Liu and Meikang Qiu and Shahid Mumtaz",
title = "Resource Critical Flow Monitoring in Software-Defined
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "396--410",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286691",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286691",
abstract = "Flow monitoring is widely applied in software-defined
networks (SDNs) for monitoring network performance.
Especially, detecting heavy hitters can prevent the
Distributed Denial of Service (DDoS) attack. However,
many existing approaches fall into one of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gu:2024:PFN,
author = "Liyuan Gu and Ye Tian and Wei Chen and Zhongxiang Wei
and Cenman Wang and Xinming Zhang",
title = "Per-Flow Network Measurement With Distributed Sketch",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "411--426",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286879",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286879",
abstract = "Sketch-based method has emerged as a promising
direction for per-flow measurement in data center
networks. Usually in such a measurement system, a
sketch data structure is placed as a whole at one
switch for counting all passing packets, but when
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhu:2024:EOW,
author = "Fengyuan Zhu and Renjie Zhao and Bingbing Wang and
Xinbing Wang and Xinping Guan and Chenghu Zhou and
Xiaohua Tian",
title = "Enabling {OFDMA} in {Wi-Fi} Backscatter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "427--444",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3290370",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3290370",
abstract = "This paper for the first time demonstrates how to
enable OFDMA in Wi-Fi backscatter for capacity and
concurrency enhancement. With our design, the
excitation signal is reflected, modulated and shifted
to lie in the frequency band of the OFDM subcarrier by
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:VCY,
author = "Ning Chen and Sheng Zhang and Zhi Ma and Yu Chen and
Yibo Jin and Jie Wu and Zhuzhong Qian and Yu Liang and
Sanglu Lu",
title = "{ViChaser}: Chase Your Viewpoint for Live Video
Streaming With Block-Oriented Super-Resolution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "445--459",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286108",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Apr 12 07:06:49 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286108",
abstract = "The usage of live streaming services has led to a
substantial increase in live video traffic. However,
the perceived quality of experience of users is
frequently limited by variations in the upstream
bandwidth of streamers. To address this issue, several
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wei:2024:EEA,
author = "Qinhan Wei and Yongcai Wang and Deying Li",
title = "{EMI}: an Efficient Algorithm for Identifying Maximal
Rigid Clusters in {$3$D} Generic Graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "460--474",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3287822",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3287822",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abdisarabshali:2024:DTM,
author = "Payam Abdisarabshali and Minghui Liwang and Amir
Rajabzadeh and Mahmood Ahmadi and Seyyedali
Hosseinalipour",
title = "Decomposition Theory Meets Reliability Analysis:
Processing of Computation-Intensive Dependent Tasks
Over Vehicular Clouds With Dynamic Resources",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "475--490",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3286709",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3286709",
abstract = "Vehicular cloud (VC) is a promising technology for
processing computation-intensive applications (CI-Apps)
on smart vehicles. Implementing VCs over the network
edge faces two key challenges: (C1) On-board computing
resources of a single vehicle are often \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:MFG,
author = "Xiong Wang and Jiancheng Ye and John C. S. Lui",
title = "Mean Field Graph Based {D$2$D} Collaboration and
Offloading Pricing in Mobile Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "491--505",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3288558",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3288558",
abstract = "Mobile edge computing (MEC) facilitates computation
offloading to edge server and task processing via
device-to-device (D2D) collaboration. Existing works
mainly focus on centralized network-assisted offloading
solutions, which are unscalable to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2024:PTC,
author = "Zhengyu Liao and Shiyou Qian and Zhonglong Zheng and
Jiange Zhang and Jian Cao and Guangtao Xue and Minglu
Li",
title = "{PT-Tree}: a Cascading Prefix Tuple Tree for Packet
Classification in Dynamic Scenarios",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "506--519",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3289029",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3289029",
abstract = "For software-defined networking (SDN), multi-field
packet classification plays a key role in the
processing of flows, mainly involving fast packet
classification and dynamic rule updates. Due to the
increasing complexity and size of rulesets, it is
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zheng:2024:LCC,
author = "Jiaqi Zheng and Zhuoxuan Du and Zhenqing Zha and
Zixuan Yang and Xiaofeng Gao and Guihai Chen",
title = "Learning to Configure Converters in Hybrid Switching
Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "520--534",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3294803",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3294803",
abstract = "Data centers heavily rely on scale-out architectures
like fat-tree, BCube and VL2 to accommodate a large
number of commodity servers. Since the traditional
electrical network is demand-oblivious and cannot
perfectly respond to the bursty traffic generated
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tian:2024:MEC,
author = "Xiaohua Tian and Fengyuan Zhu and Hao Li and Mingwei
Ouyang and Luwei Feng and Xinyu Tong and Xinbing Wang",
title = "{MobiScatter}: Enhancing Capacity in Drone-Assisted
High-Concurrency Backscatter Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "535--549",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3290168",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3290168",
abstract = "This paper presents MobiScatter, which enhances
capacity of CSS based backscatter networks for
accommodating drone-carried access points (APs). CSS
based backscatter design has favorable features
including long range and high concurrency. However, the
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2024:SGN,
author = "Liekang Zeng and Xu Chen and Peng Huang and Ke Luo and
Xiaoxi Zhang and Zhi Zhou",
title = "Serving Graph Neural Networks With Distributed Fog
Servers for Smart {IoT} Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "550--565",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3293052",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3293052",
abstract = "Graph Neural Networks (GNNs) have gained growing
interest in miscellaneous applications owing to their
outstanding ability in extracting latent representation
on graph structures. To render GNN-based service for
IoT-driven smart applications, traditional \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:ETA,
author = "Hao Wang and Chi Harold Liu and Haoming Yang and
Guoren Wang and Kin K. Leung",
title = "Ensuring Threshold {AoI} for {UAV-Assisted} Mobile
Crowdsensing by Multi-Agent Deep Reinforcement Learning
With Transformer",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "566--581",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3289172",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3289172",
abstract = "Unmanned aerial vehicle (UAV) crowdsensing (UCS) is an
emerging data collection paradigm to provide reliable
and high quality urban sensing services, with
age-of-information (AoI) requirement to measure data
freshness in real-time applications. In this \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qi:2024:TDB,
author = "Jianpeng Qi and Xiao Su and Rui Wang",
title = "Toward Distributively Build Time-Sensitive-Service
Coverage in Compute First Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "582--597",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3289830",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3289830",
abstract = "Despite placing services and computing resources at
the edge of the network for ultra-low latency, we still
face the challenge of centralized scheduling costs,
including delays from additional request forwarding and
resource selection. To address this \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guidolin--Pina:2024:CGB,
author = "Damien Guidolin-Pina and Marc Boyer and Jean-Yves {Le
Boudec}",
title = "Configuration of Guard Band and Offsets in Cyclic
Queuing and Forwarding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "598--612",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3293050",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3293050",
abstract = "Cyclic Queuing and Forwarding (CQF) is a mechanism
defined by IEEE TSN for providing low jitter in a
deterministic network. CQF uses a common time cycle and
two buffers per node output port: during one cycle
incoming packets are stored in one buffer while
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:IBS,
author = "Xiaohan Zhang and Jinwen Wang and Yueqiang Cheng and
Qi Li and Kun Sun and Yao Zheng and Ning Zhang and
Xinghua Li",
title = "Interface-Based Side Channel in {TEE}-Assisted
Networked Services",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "613--626",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3294019",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3294019",
abstract = "With the accelerating adaption of Cloud and Edge
computing, cloud-based networked deployment emerges to
enable providers to deliver services in a
cost-effective and elastic manner. However, security
concern remains one of the major obstacles to its wider
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:LTH,
author = "Junxue Zhang and Chaoliang Zeng and Hong Zhang and
Shuihai Hu and Kai Chen",
title = "{LiteFlow}: Toward High-Performance Adaptive Neural
Networks for Kernel Datapath",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "627--642",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3293152",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3293152",
abstract = "Adaptive neural networks (NN) have been used to
optimize OS kernel datapath functions because they can
achieve superior performance under changing
environments. However, how to deploy these NNs remains
a challenge. One approach is to deploy these adaptive
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ganguly:2024:OFL,
author = "Bhargav Ganguly and Vaneet Aggarwal",
title = "Online Federated Learning via Non-Stationary Detection
and Adaptation Amidst Concept Drift",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "643--653",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3294366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3294366",
abstract = "Federated Learning (FL) is an emerging domain in the
broader context of artificial intelligence research.
Methodologies pertaining to FL assume distributed model
training, consisting of a collection of clients and a
server, with the main goal of achieving \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ayepah-Mensah:2024:BEF,
author = "Daniel Ayepah-Mensah and Guolin Sun and Gordon Owusu
Boateng and Stephen Anokye and Guisong Liu",
title = "Blockchain-Enabled Federated Learning-Based Resource
Allocation and Trading for Network Slicing in {5G}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "654--669",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3297390",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3297390",
abstract = "Radio Access Network (RAN) slicing enables resource
sharing among multiple tenants and is an essential
feature for next-generation mobile networks. Usually, a
centralized controller aggregates available resource
pools from multiple tenants to increase \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wu:2024:ERS,
author = "Si Wu and Zhirong Shen and Patrick P. C. Lee and
Zhiwei Bai and Yinlong Xu",
title = "Elastic {Reed--Solomon} Codes for Efficient Redundancy
Transitioning in Distributed Key--Value Stores",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "670--685",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3303865",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3303865",
abstract = "Modern distributed key-value (KV) stores increasingly
adopt erasure coding to reliably store data. To adapt
to the changing demands on access performance and
reliability requirements, distributed KV stores perform
redundancy transitioning by tuning the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Voronov:2024:FAD,
author = "Tomer Voronov and Danny Raz and Ori Rottenstreich",
title = "A Framework for Anomaly Detection in Blockchain
Networks With Sketches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "686--698",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3298253",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3298253",
abstract = "A blockchain is a distributed ledger composed of
immutable blocks of data that often refer to money
transfers. As blockchain networks gain popularity,
there is a rising concern for security against
malicious and hacking users. Detection anomalies and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:RPB,
author = "Zihao Wang and Hang Wang and Zhuowen Li and Xinghua Li
and Yinbin Miao and Yanbing Ren and Yunwei Wang and Zhe
Ren and Robert H. Deng",
title = "Robust Permissioned Blockchain Consensus for Unstable
Communication in {FANET}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "699--712",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3295378",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3295378",
abstract = "The utilization of blockchain technology as a
distributed information sharing system has gained
widespread adoption across various domains. However,
its application to Flying Ad-Hoc Network (FANET),
characterized by severe packet loss, poses significant
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zeng:2024:AAA,
author = "Liekang Zeng and Haowei Chen and Daipeng Feng and
Xiaoxi Zhang and Xu Chen",
title = "{A$3$D}: Adaptive, Accurate, and Autonomous Navigation
for Edge-Assisted Drones",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "713--728",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3297876",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3297876",
abstract = "Accurate navigation is of paramount importance to
ensure flight safety and efficiency for autonomous
drones. Recent research starts to use Deep Neural
Networks (DNN) to enhance drone navigation given their
remarkable predictive capability for visual \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2024:PSS,
author = "Bin Luo and Xinghua Li and Yinbin Miao and Man Zhang
and Ximeng Liu and Yanbing Ren and Xizhao Luo and
Robert H. Deng",
title = "{PAM$^3$S}: Progressive Two-Stage Auction-Based
Multi-Platform Multi-User Mutual Selection Scheme in
{MCS}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "729--744",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3297258",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3297258",
abstract = "Mobile crowdsensing (MCS) has been applied in various
fields to realize data sharing, where multiple
platforms and multiple Mobile Users (MUs) have appeared
recently. However, aiming at mutual selection, the
existing works ignore making MUs&\#x2019; \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Dai:2024:MLT,
author = "Miao Dai and Gang Sun and Hongfang Yu and Dusit
Niyato",
title = "Maximize the Long-Term Average Revenue of Network
Slice Provider via Admission Control Among
Heterogeneous Slices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "745--760",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3297883",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3297883",
abstract = "Network slicing endows 5G/B5G with differentiated and
customized capabilities to cope with the proliferation
of diversified services, whereas limited physical
network resources may not be able to support all
service requests. Slice admission control is \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Teymoori:2024:LNH,
author = "Peyman Teymoori and Michael Welzl and David A. Hayes",
title = "{LGCC}: a Novel High-Throughput and Low Delay Paradigm
Shift in Multi-Hop Congestion Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "761--776",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3301291",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3301291",
abstract = "Technological advancements have provided wireless
links with very high data rate capacity for 5G/6G
mobile networks and WiFi 6, which will be widely
deployed by 2025. However, the capacity can have
substantial fluctuations, violating the assumption at
the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yan:2024:PIR,
author = "Fulong Yan and Xiong Deng and Changshun Yuan and
Boyuan Yan and Chongjin Xie",
title = "On the Performance Investigation of a Recursive Fast
Optical Switch-Based High Performance Computing Network
Architecture",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "777--790",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3302650",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3302650",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:ABW,
author = "Jianchun Liu and Qingmin Zeng and Hongli Xu and Yang
Xu and Zhiyuan Wang and He Huang",
title = "Adaptive Block-Wise Regularization and Knowledge
Distillation for Enhancing Federated Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "791--805",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3301972",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3301972",
abstract = "Federated Learning (FL) is a distributed model
training framework that allows multiple clients to
collaborate on training a global model without
disclosing their local data in edge computing (EC)
environments. However, FL usually faces statistical
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:PAM,
author = "Quan Chen and Song Guo and Zhipeng Cai and Jing Li and
Tuo Shi and Hong Gao",
title = "Peak {AoI} Minimization at Wireless-Powered Network
Edge: From the Perspective of Both Charging and
Transmitting",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "806--821",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3303266",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3303266",
abstract = "Age of Information, which emerged as a new metric to
quantify the freshness of information, has attracted
increasing interests recently. To optimize the system
AoI, most existing works try to compute an efficient
schedule from the point of data \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:PTE,
author = "Yuntian Zhang and Ning Han and Tengteng Zhu and Junjie
Zhang and Minghao Ye and Songshi Dou and Zehua Guo",
title = "{Prophet}: Traffic Engineering-Centric Traffic Matrix
Prediction",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "822--832",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3293098",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3293098",
abstract = "Traffic Matrix (TM), which records traffic volumes
among network nodes, is important for network operation
and management. Due to cost and operation issues, TMs
cannot be directly measured and collected in real time.
Therefore, many studies work on \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nguyen:2024:PPS,
author = "Truc Nguyen and My T. Thai",
title = "Preserving Privacy and Security in Federated
Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "833--843",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3302016",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3302016",
abstract = "Federated learning is known to be vulnerable to both
security and privacy issues. Existing research has
focused either on preventing poisoning attacks from
users or on concealing the local model updates from the
server, but not both. However, integrating \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Saad:2024:RNC,
author = "Muhammad Saad and Afsah Anwar and Srivatsan Ravi and
David Mohaisen",
title = "Revisiting {Nakamoto} Consensus in Asynchronous
Networks: a Comprehensive Analysis of Bitcoin Safety
and Chain Quality",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "844--858",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3302955",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3302955",
abstract = "The Bitcoin blockchain safety relies on strong network
synchrony. Therefore, violating the blockchain safety
requires strong adversaries that control a mining pool
with &\#x2248;51&\#x0025; hash rate. In this paper, we
show that the network synchrony does \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Salem:2024:TID,
author = "Tareq Si Salem and Gabriele Castellano and Giovanni
Neglia and Fabio Pianese and Andrea Araldo",
title = "Toward Inference Delivery Networks: Distributing
Machine Learning With Optimality Guarantees",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "859--873",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3305922",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3305922",
abstract = "An increasing number of applications rely on complex
inference tasks that are based on machine learning
(ML). Currently, there are two options to run such
tasks: either they are served directly by the end
device (e.g., smartphones, IoT equipment, smart
\ldots{})",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:NMF,
author = "Guijuan Wang and Jiguo Yu and Yifei Zou and Jianxi Fan
and Wei Cheng",
title = "A New Measure of Fault-Tolerance for Network
Reliability: Double-Structure Connectivity",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "874--889",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3305611",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3305611",
abstract = "Most data center services are finished by the
cooperation among the connected servers. However, the
malicious attackers always try to divide the network
into disconnected components to start some attacks,
such as the address resolution protocol (ARP)
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xu:2024:RMD,
author = "Wenzheng Xu and Chengxi Wang and Hongbin Xie and Weifa
Liang and Haipeng Dai and Zichuan Xu and Ziming Wang
and Bing Guo and Sajal K. Das",
title = "Reward Maximization for Disaster Zone Monitoring With
Heterogeneous {UAVs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "890--903",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3300174",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3300174",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2024:AFL,
author = "Yunming Liao and Yang Xu and Hongli Xu and Zhiwei Yao
and Lun Wang and Chunming Qiao",
title = "Accelerating Federated Learning With Data and Model
Parallelism in Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "1",
pages = "904--918",
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3299851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:12:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3299851",
abstract = "Recently, edge AI has been launched to mine and
discover valuable knowledge at network edge. Federated
Learning, as an emerging technique for edge AI, has
been widely deployed to collaboratively train models on
many end devices in data-parallel fashion. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ayan:2024:OFH,
author = "Onur Ayan and Sandra Hirche and Anthony Ephremides and
Wolfgang Kellerer",
title = "Optimal Finite Horizon Scheduling of Wireless
Networked Control Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "927--942",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3300949",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3300949",
abstract = "Control over networks is envisioned to be one of the
driving applications of future mobile networks.
Networked control systems contain sensors and
controllers exchanging time-sensitive information to
fulfill a particular control goal. In this work, we
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pan:2024:BMA,
author = "Qianqian Pan and Jun Wu and Jianhua Li and Wu Yang and
Mohsen Guizani",
title = "Blockchain and Multi-Agent Learning Empowered
Incentive {IRS} Resource Scheduling for Intelligent
Reconfigurable Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "943--958",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3309729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3309729",
abstract = "As a promising technology, intelligent reflecting
surface (IRS) enables future communications and
networks to realize programmable data transmissions.
Due to the untrustworthiness of the communication
environment and the selfishness of wireless devices,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Reviriego:2024:CEA,
author = "Pedro Reviriego and Jim Apple and Alvaro Alonso and
Otmar Ertl and Niv Dayan",
title = "Cardinality Estimation Adaptive Cuckoo Filters
{(CE-ACF)}: Approximate Membership Check and Distinct
Query Count for High-Speed Network Monitoring",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "959--970",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3302306",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3302306",
abstract = "In network monitoring applications, it is often
beneficial to employ a fast approximate set-membership
filter to check if a given packet belongs to a
monitored flow. Recent adaptive filter designs, such as
the Adaptive Cuckoo Filter, are especially \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2024:PNS,
author = "Hao Li and Yihan Dang and Guangda Sun and Changhao Wu
and Peng Zhang and Danfeng Shan and Tian Pan and
Chengchen Hu",
title = "Programming Network Stack for Physical Middleboxes and
Virtualized Network Functions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "971--986",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3307641",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3307641",
abstract = "Middleboxes are becoming indispensable in modern
networks. However, programming the network stack of
middleboxes to support emerging transport protocols and
flexible stack hierarchy is still a daunting task. To
this end, we propose Rubik, a language that \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2024:PSF,
author = "Weihe Li and Paul Patras",
title = "P-Sketch: a Fast and Accurate Sketch for Persistent
Item Lookup",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "987--1002",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3306897",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3306897",
abstract = "In large data streams consisting of sequences of data
items, those appearing over a long period of time are
regarded as persistent. Compared with frequent items,
persistent items do not necessarily hold large amounts
of data and thus may hamper the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:FLG,
author = "Chenyi Liu and Vaneet Aggarwal and Tian Lan and Nan
Geng and Yuan Yang and Mingwei Xu and Qing Li",
title = "{FERN}: Leveraging Graph Attention Networks for
Failure Evaluation and Robust Network Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1003--1018",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3311678",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3311678",
abstract = "Robust network design, which aims to guarantee network
availability under various failure scenarios while
optimizing performance/cost objectives, has received
significant attention. Existing approaches often rely
on model-based mixed-integer optimization \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qu:2024:SSI,
author = "Jian Qu and Xiaobo Ma and Wenmao Liu and Hongqing Sang
and Jianfeng Li and Lei Xue and Xiapu Luo and Zhenhua
Li and Li Feng and Xiaohong Guan",
title = "On Smartly Scanning of the {Internet} of Things",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1019--1034",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3312162",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3312162",
abstract = "Cyber search engines, such as Shodan and Censys, have
gained popularity due to their strong capability of
indexing the Internet of Things (IoT). They actively
scan and fingerprint IoT devices for unearthing
IP-device mapping. Because of the large address
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Diamanti:2024:DMR,
author = "Maria Diamanti and Christos Pelekis and Eirini Eleni
Tsiropoulou and Symeon Papavassiliou",
title = "Delay Minimization for Rate-Splitting Multiple
Access-Based Multi-Server {MEC} Offloading",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1035--1047",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3311131",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3311131",
abstract = "Rate-Splitting Multiple Access (RSMA) has been
recently recognized as a more general multiple access
technique that overcomes the limiting factors of its
predecessors related to the signal decoding complexity
and interference management tradeoff. In this
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Esmat:2024:SLM,
author = "Haitham H. Esmat and Beatriz Lorenzo",
title = "Self-Learning Multi-Mode Slicing Mechanism for Dynamic
Network Architectures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1048--1063",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3305975",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3305975",
abstract = "Dynamic network architectures that utilize
communication, computing, and storage resources at the
wireless edge are key to delivering emerging services
in next-generation networks (e.g., AR/VR, 3D video,
intelligent cars, etc). Network slicing can be
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:TDP,
author = "Bai Liu and Quang Minh Nguyen and Qingkai Liang and
Eytan Modiano",
title = "Tracking Drift-Plus-Penalty: Utility Maximization for
Partially Observable and Controllable Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1064--1079",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3307684",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3307684",
abstract = "Stochastic network models with all components being
observable and controllable have been the focus of
classic network optimization theory for decades.
However, in modern network systems, it is common that
the network controller can only observe and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Das:2024:AAI,
author = "Soumadeep Das and Aryan Mohammadi Pasikhani and
Prosanta Gope and John A. Clark and Chintan Patel and
Biplab Sikdar",
title = "{AIDPS}: Adaptive Intrusion Detection and Prevention
System for Underwater Acoustic Sensor Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1080--1095",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3313156",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3313156",
abstract = "Underwater Acoustic Sensor Networks (UW-ASNs) are
predominantly used for underwater environments and find
applications in many areas. However, a lack of security
considerations, the unstable and challenging nature of
the underwater environment, and the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Etezadi:2024:PFO,
author = "Ehsan Etezadi and Carlos Natalino and Christine
Tremblay and Lena Wosinska and Marija Furdek",
title = "Programmable Filterless Optical Networks:
Architecture, Design, and Resource Allocation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1096--1109",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3319746",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3319746",
abstract = "Filterless optical networks (FONs) are a
cost-effective optical networking technology that
replaces reconfigurable optical add-drop multiplexers,
used in conventional, wavelength-switched optical
networks (WSONs), by passive optical splitters and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:UFB,
author = "Mei Wang and Jing Chen and Kun He and Ruozhou Yu and
Ruiying Du and Zhihao Qian",
title = "{UFinAKA}: Fingerprint-Based Authentication and Key
Agreement With Updatable Blind Credentials",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1110--1123",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3311130",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3311130",
abstract = "Authentication and key agreement are two basic
functionalities to guarantee secure network
communications, which are naturally integrated as an
Authentication and Key Agreement (AKA) protocol. AKAs
usually either need a dedicated device to store a
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2024:AAB,
author = "Xiaoxue Yang and Hao Wang and Bing Hu and Chunming
Wu",
title = "{ABOI}: {AWGR-Based} Optical Interconnects for
Single-Wavelength and Multi-Wavelength",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1124--1139",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3314096",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3314096",
abstract = "Optical interconnect can achieve a substantial
increase in the number of nodes and switching
capability for data centers, by virtue of their low
power consumption and high bandwidth. In this paper, we
propose a single-wavelength switch architecture based
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ni:2024:AOP,
author = "Peikun Ni and Jianming Zhu and Guoqing Wang",
title = "Activity-Oriented Production Promotion Utility
Maximization in Metaverse Social Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1140--1154",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3309624",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3309624",
abstract = "The continuous development of network media technology
has driven the unceasing change in the online social
environment, from PC social to mobile social, which are
currently experiencing a new change: Metaverse social.
The iteration of the social \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Jiao:2024:EDE,
author = "Wenli Jiao and Ju Wang and Yelu He and Xiangdong Xi
and Fuwei Wang and Dingyi Fang and Xiaojiang Chen",
title = "Eliminating Design Effort: a Reconfigurable Sensing
Framework for Chipless, Backscatter Tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1155--1170",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3320263",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3320263",
abstract = "Backscatter tag based sensing has received a lot of
attention recently due to the battery-free, low-cost,
and widespread use of backscatter tags, e.g., RFIDs.
Despite that, they suffer from an extensive, costly,
and time-consuming redesign effort when \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2024:PPP,
author = "Yu Li and Jiaheng Zhang and Junjie Chen and Yicong
Chen and Ning Xie and Hongbin Li",
title = "Privacy-Preserving Physical-Layer Authentication Under
Cooperative Attacks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1171--1186",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3311470",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3311470",
abstract = "In this paper, we are concerned about the problem of
guaranteeing both privacy and security in a
Location-Based Service (LBS) system, where a
challenging scenario involving cooperative attack is
considered. Since prior Physical-Layer Authentication
(PLA) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Guo:2024:HNB,
author = "Jiani Guo and Shanshan Song and Jun Liu and Hao Chen
and Jun-Hong Cui and Guangjie Han",
title = "A Hybrid {NOMA-Based} {MAC} Protocol for Underwater
Acoustic Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1187--1200",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3311682",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3311682",
abstract = "Performing a high-capacity Medium Access Control (MAC)
protocol suffers from low bandwidth and long
propagation delay in Underwater Acoustic Networks
(UANs). Non-Orthogonal Multiple Access (NOMA) is a
promising technology to assist MAC protocols in
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Faisal:2024:JJT,
author = "Tooba Faisal and Damiano Di Francesco Maesa and
Nishanth Sastry and Simone Mangiante",
title = "{JITRA}: Just-In-Time Resource Allocation Through the
Distributed Ledgers for {5G} and Beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1201--1211",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3318239",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3318239",
abstract = "For the viability of future
&\#x201C;mission-critical&\#x201D; applications such as
remote surgery and connected cars, the customers must
trust the network connection and operators must adhere
to the Service Level Agreement (SLA). The key to
enabling trust \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:JOO,
author = "Juncheng Wang and Ben Liang and Min Dong and Gary
Boudreau and Hatem Abou-Zeid",
title = "Joint Online Optimization of Model Training and Analog
Aggregation for Wireless Edge Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1212--1228",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3318474",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3318474",
abstract = "We consider federated learning in a wireless edge
network, where multiple power-limited mobile devices
collaboratively train a global model, using their local
data with the assistance of an edge server. Exploiting
over-the-air computation, the edge server \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:DOC,
author = "Sihan Wang and Tian Xie and Min-Yue Chen and Guan-Hua
Tu and Chi-Yu Li and Xinyu Lei and Po-Yi Chou and
Fucheng Hsieh and Yiwen Hu and Li Xiao and Chunyi
Peng",
title = "Dissecting Operational Cellular {IoT} Service
Security: Attacks and Defenses",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1229--1244",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3313557",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3313557",
abstract = "More than 150 cellular networks worldwide have rolled
out LTE-M (LTE-Machine Type Communication) and/or
NB-IoT (Narrow Band Internet of Things) technologies to
support massive IoT services such as smart metering and
environmental monitoring. Such cellular \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2024:TFN,
author = "Qian Li",
title = "{TCP FlexiS}: a New Approach to Incipient Congestion
Detection and Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1245--1260",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3319441",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3319441",
abstract = "Best effort congestion controls strive to achieve an
equitable distribution of network resources among
competing flows. However, fair resource allocation
becomes undesirable when a bandwidth/delay sensitive
application shares a bottleneck with a greedy
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:ESH,
author = "Liping Zhang and Wenshuo Han and Shukai Chen and
Kim-Kwang Raymond Choo",
title = "An Efficient and Secure Health Data Propagation Scheme
Using Steganography-Based Approach for Electronic
Health Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1261--1272",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3313160",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3313160",
abstract = "Electronic health (e-health) networks enable users to
enjoy convenient, flexible, and low-cost medical
services at home, so they attract great attention and
spread into the market quickly. In e-health networks,
large amounts of various health data \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:DPC,
author = "Xuehe Wang and Shensheng Zheng and Lingjie Duan",
title = "Dynamic Pricing for Client Recruitment in Federated
Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1273--1286",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3312208",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3312208",
abstract = "Though federated learning (FL) well preserves
clients&\#x2019; data privacy, many clients are still
reluctant to join FL given the communication cost and
energy consumption in their mobile devices. It is
important to design pricing compensations to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:PSS,
author = "Yongqiang Liu and Xike Xie",
title = "A Probabilistic Sketch for Summarizing Cold Items of
Data Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1287--1302",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3316426",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3316426",
abstract = "Conventional sketches on counting stream item
frequencies use hash functions for mapping data items
to a concise structure, e.g., a two-dimensional array,
at the expense of overcounting due to hashing
collisions. Despite the popularity, it is still
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:NOP,
author = "Xiujun Wang and Zhi Liu and Alex X. Liu and Xiao Zheng
and Hao Zhou and Ammar Hawbani and Zhe Dang",
title = "A Near-Optimal Protocol for Continuous Tag Recognition
in Mobile {RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1303--1318",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3317875",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3317875",
abstract = "Mobile radio frequency identification (RFID) systems
typically experience the continual movement of many
tags rapidly going in and out of the interrogating
range of readers. Readers that are deployed to maintain
a current, real-time list of tags, which \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Pacifico:2024:EHS,
author = "Racyus D. G. Pac{\'\i}fico and Lucas F. S. Duarte and
Luiz F. M. Vieira and Barath Raghavan and Jos{\'e} A.
M. Nacif and Marcos A. M. Vieira",
title = "{eBPFlow}: a Hardware\slash Software Platform to
Seamlessly Offload Network Functions Leveraging
{eBPF}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1319--1332",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3318251",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3318251",
abstract = "NFV and SDN enable flexibility and programmability at
the data plane. In addition, offloading packet
processing to a hardware saves processing resources to
compute other workloads. However, fulfilling
requirements such as high throughput and low latency
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yun:2024:RED,
author = "Jihyeon Yun and Atilla Eryilmaz and Jun Moon and
Changhee Joo",
title = "Remote Estimation for Dynamic {IoT} Sources Under
Sublinear Communication Costs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1333--1345",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3314506",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3314506",
abstract = "We investigate a remote estimation system with
communication cost for multiple Internet-of-Things
sensors, in which the state of each sensor changes
according to a Wiener process. Under sublinear
communication cost structure, in which the
per-transmission \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Qiu:2024:SAR,
author = "Tie Qiu and Xinwei Yang and Ning Chen and Songwei
Zhang and Geyong Min and Dapeng Oliver Wu",
title = "A Self-Adaptive Robustness Optimization Method With
Evolutionary Multi-Agent for {IoT} Topology",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1346--1361",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3319499",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3319499",
abstract = "Topology robustness is critical to the connectivity
and lifetime of large-scale Internet-of-Things (IoT)
applications. To improve robustness while reducing the
execution cost, the existing robustness optimization
methods utilize neural learning schemes, \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:BBW,
author = "Lun Wang and Yang Xu and Hongli Xu and Zhida Jiang and
Min Chen and Wuyang Zhang and Chen Qian",
title = "{BOSE}: Block-Wise Federated Learning in Heterogeneous
Edge Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "2",
pages = "1362--1377",
month = apr,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3316421",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 19 06:09:42 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3316421",
abstract = "At the network edge, federated learning (FL) has
gained attention as a promising approach for training
deep learning (DL) models collaboratively across a
large number of devices while preserving user privacy.
However, FL still faces specific challenges \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2024:DNT,
author = "Haifeng Sun and Qun Huang and Patrick P. C. Lee and
Wei Bai and Feng Zhu and Yungang Bao",
title = "Distributed Network Telemetry With Resource Efficiency
and Full Accuracy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1857--1872",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3327345",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3327345",
abstract = "Network telemetry is essential for administrators to
monitor massive data traffic in a network-wide manner.
Existing telemetry solutions often face the dilemma
between resource efficiency (i.e., low CPU, memory, and
bandwidth overhead) and full accuracy \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhou:2024:FPA,
author = "Guangmeng Zhou and Qi Li and Yang Liu and Yi Zhao and
Qi Tan and Su Yao and Ke Xu",
title = "{FedPAGE}: Pruning Adaptively Toward Global Efficiency
of Heterogeneous Federated Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1873--1887",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3328632",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3328632",
abstract = "When workers are heterogeneous in computing and
transmission capabilities, the global efficiency of
federated learning suffers from the straggler issue,
i.e., the slowest worker drags down the overall
training process. We propose a novel and efficient
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tian:2024:EDB,
author = "Han Tian and Xudong Liao and Chaoliang Zeng and Decang
Sun and Junxue Zhang and Kai Chen",
title = "Efficient {DRL}-Based Congestion Control With
Ultra-Low Overhead",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1888--1903",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3330737",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3330737",
abstract = "Previous congestion control (CC) algorithms based on
deep reinforcement learning (DRL) directly adjust flow
sending rate to respond to dynamic bandwidth change,
resulting in high inference overhead. Such overhead may
consume considerable CPU resources and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Ma:2024:WFE,
author = "Xiaobo Ma and Jian Qu and Mawei Shi and Bingyu An and
Jianfeng Li and Xiapu Luo and Junjie Zhang and Zhenhua
Li and Xiaohong Guan",
title = "Website Fingerprinting on Encrypted Proxies: a
Flow-Context-Aware Approach and Countermeasures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1904--1919",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3337270",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3337270",
abstract = "Website fingerprinting (WFP) could infer which
websites a user is accessing via an encrypted proxy by
passively inspecting the traffic characteristics of
accessing different websites between the user and the
proxy. Designing WFP attacks is crucial for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tang:2024:SWP,
author = "Haoyue Tang and Yin Sun and Leandros Tassiulas",
title = "Sampling of the {Wiener} Process for Remote Estimation
Over a Channel With Unknown Delay Statistics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1920--1935",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3331266",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3331266",
abstract = "In this paper, we study an online sampling problem of
the Wiener process. The goal is to minimize the mean
squared error (MSE) of the remote estimator under a
sampling frequency constraint when the transmission
delay distribution is unknown. The sampling \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zheng:2024:ECT,
author = "Xiaolong Zheng and Dan Xia and Fu Yu and Liang Liu and
Huadong Ma",
title = "Enabling Cross-Technology Communication From {WiFi} to
{LoRa} With {IEEE 802.11ax}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1936--1950",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3333355",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3333355",
abstract = "Recent work proposes Cross-Technology Communication
(CTC) from IEEE 802.11b to LoRa but has a low
efficiency due to the extremely asymmetric data rates.
In this paper, we propose WiRa that emulates LoRa
waveform with IEEE 802.11ax. By taking advantage of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Nelson:2024:RBE,
author = "Wilson Ayyanthole Nelson and Sreenivasa Reddy Yeduri
and Ajit Jha and Abhinav Kumar and Linga Reddy
Cenkeramaddi",
title = "{RL}-Based Energy-Efficient Data Transmission Over
Hybrid {BLE\slash LTE\slash Wi-Fi\slash LoRa}
{UAV}-Assisted Wireless Network",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1951--1966",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3332296",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3332296",
abstract = "The lifetime of a UAV-assisted wireless network is
determined by the amount of energy consumed by the UAVs
during flight, data collection, and transmission to the
ground station. Routing protocols are commonly used for
data transmission in a communication \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Tabatabaee:2024:WCD,
author = "Seyed Mohammadhossein Tabatabaee and Anne Bouillard
and Jean-Yves {Le Boudec}",
title = "Worst-Case Delay Analysis of Time-Sensitive Networks
With Deficit Round-Robin",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1967--1982",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3332247",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3332247",
abstract = "In feed-forward time-sensitive networks with Deficit
Round-Robin (DRR), worst-case delay bounds were
obtained by combining Total Flow Analysis (TFA) with
the strict service curve characterization of DRR by
Tabatabaee et al. The latter is the best-known
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2024:AWN,
author = "Junyang Shi and Aitian Ma and Xia Cheng and Mo Sha and
Peng Xi",
title = "Adapting Wireless Network Configuration From
Simulation to Reality via Deep Learning-Based Domain
Adaptation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1983--1998",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3335346",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3335346",
abstract = "Today, wireless mesh networks (WMNs) are deployed
globally to support various applications, such as
industrial automation, military operations, and smart
energy. Significant efforts have been made in the
literature to facilitate their deployments and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Prasad:2024:QAS,
author = "Reshma Prasad and Albert Sunny",
title = "{QoS}-Aware Scheduling in {5G} Wireless Base
Stations",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "1999--2011",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3342867",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3342867",
abstract = "5G and beyond networks are expected to support flows
with varied Quality-of-Service (QoS) requirements under
unpredictable traffic conditions. Consequently,
designing policies ensuring optimal system utilization
in such networks is challenging. Given this,.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhao:2024:NSS,
author = "Ruijie Zhao and Mingwei Zhan and Xianwen Deng and
Fangqi Li and Yanhao Wang and Yijun Wang and Guan Gui
and Zhi Xue",
title = "A Novel Self-Supervised Framework Based on Masked
Autoencoder for Traffic Classification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2012--2025",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3335253",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3335253",
abstract = "Traffic classification is a critical task in network
security and management. Recent research has
demonstrated the effectiveness of the deep
learning-based traffic classification method. However,
the following limitations remain: (1) the traffic
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2024:FFN,
author = "Jingyu Xiao and Xudong Zuo and Qing Li and Dan Zhao
and Hanyu Zhao and Yong Jiang and Jiyong Sun and Bin
Chen and Yong Liang and Jie Li",
title = "{FlexNF}: Flexible Network Function Orchestration for
Scalable On-Path Service Chain Serving",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2026--2041",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3334237",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3334237",
abstract = "Programmable Data Plane (PDP) has been leveraged to
offload Network Functions (NFs). Due to its high
processing capability, the PDP improves the performance
of NFs by more than one order of magnitude. However,
the coarse-grained NF orchestration on the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yang:2024:UWB,
author = "Yifan Yang and Wei Gong",
title = "Universal {WiFi} Backscatter With Ambient Space-Time
Streams",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2042--2052",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3336922",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3336922",
abstract = "Since backscatter communication has the advantage of
low power, it is promising to be widely used in IoT
applications. For a space-time stream backscatter, we
envision it can efficiently leverage ready-to-use
multiform space-time streams in the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Alam:2024:PET,
author = "Md. Ibrahim Ibne Alam and Elliot Anshelevich and
Koushik Kar and Murat Yuksel",
title = "Pricing for Efficient Traffic Exchange at {IXPs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2053--2068",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3336352",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3336352",
abstract = "We analyze traffic exchange between Internet Service
Providers (ISPs) at an Internet Exchange Point (IXP) as
a non-cooperative game with ISPs as self-interested
agents. Each ISP has the choice of exchanging traffic
either using the shared IXP facilities, \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Meng:2024:SAL,
author = "Qingkai Meng and Yiran Zhang and Shan Zhang and
Zhiyuan Wang and Tong Zhang and Hongbin Luo and
Fengyuan Ren",
title = "Switch-Assistant Loss Recovery for {RDMA} Transport
Control",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2069--2084",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3336661",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3336661",
abstract = "RoCEv2 (RDMA over Converged Ethernet version 2) is the
canonical method for deploying RDMA in Ethernet-based
datacenters. Traditionally, RoCEv2 runs over the
lossless network which is in turn achieved by enabling
Priority Flow Control (PFC) within the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Yao:2024:CRR,
author = "Xiaopeng Yao and Yunpeng Zhao and Ningtuo Gao and
Hongwei Du and Hejiao Huang",
title = "Causal Related Rumors Controlling in Social Networks
of Multiple Information",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2085--2098",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3337774",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3337774",
abstract = "There is a huge amount of information generated in
online social networks, which is filled with a lot of
rumors. The spread of a rumor often leads to the
generation of a causal related rumor, and when users
believe the first kind of rumor, the probability
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:IAS,
author = "Yan Wang and Quansheng Guan and Fei Ji and Weiqi
Chen",
title = "Impact and Analysis of Space-Time Coupling on Slotted
{MAC} in {UANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2099--2111",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3336459",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3336459",
abstract = "The propagation delay is non-negligible in underwater
acoustic networks (UANs) since the propagation speed is
five orders of magnitude smaller than the speed of
light. In this case, space and time factors are
strongly coupled to determine the collisions \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Luo:2024:SSE,
author = "Zhicheng Luo and Qianyi Huang and Xu Chen and Rui Wang
and Fan Wu and Guihai Chen and Qian Zhang",
title = "Spectrum Sensing Everywhere: Wide-Band Spectrum
Sensing With Low-Cost {UWB} Nodes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2112--2127",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3342977",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3342977",
abstract = "Spectrum sensing plays a crucial role in spectrum
monitoring and management. However, due to the
expensive cost of high-speed ADCs, wideband spectrum
sensing is a long-standing challenge. In this paper, we
present how to transform Ultra-wideband (UWB)
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Li:2024:MNT,
author = "Shuyue Li and Jing Li and Chaocan Xiang and Wenzheng
Xu and Jian Peng and Ziming Wang and Weifa Liang and
Xinwei Yao and Xiaohua Jia and Sajal K. Das",
title = "Maximizing Network Throughput in Heterogeneous {UAV}
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2128--2142",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3347557",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3347557",
abstract = "In this paper we study the deployment of an Unmanned
Aerial Vehicle (UAV) network that consists of multiple
UAVs to provide emergent communication service for
people who are trapped in a disaster area, where each
UAV is equipped with a base station that \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xiao:2024:MAR,
author = "Tingting Xiao and Chen Chen and Mianxiong Dong and
Kaoru Ota and Lei Liu and Schahram Dustdar",
title = "Multi-Agent Reinforcement Learning-Based Trading
Decision-Making in Platooning-Assisted Vehicular
Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2143--2158",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3342020",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3342020",
abstract = "Utilizing the stable underlying and cloud-native
functions of vehicle platoons allows for flexible
resource provisioning in environments with limited
infrastructure, particularly for dynamic and
compute-intensive applications. To maximize this
potential, \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hu:2024:DRL,
author = "Zhifeng Hu and Chong Han and Xudong Wang",
title = "Deep Reinforcement Learning Based Cross-Layer Design
in Terahertz Mesh Backhaul Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2159--2173",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3342837",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3342837",
abstract = "Supporting ultra-high data rates and flexible
reconfigurability, Terahertz (THz) mesh networks are
attractive for next-generation wireless backhaul
systems that empower the integrated access and backhaul
(IAB). In THz mesh backhaul networks, the efficient
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:XAH,
author = "Qianyu Zhang and Gongming Zhao and Hongli Xu and Peng
Yang",
title = "{XAgg}: Accelerating Heterogeneous Distributed
Training Through {XDP}-Based Gradient Aggregation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2174--2188",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3339524",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3339524",
abstract = "With the growth of model/dataset/system size for
distributed model training in datacenters, the widely
used Parameter Server (PS) architecture suffers from
communication bottleneck of gradient transmission.
Recent works attempt to utilize programmable \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:PTO,
author = "Baojun Chen and Jiawen Zhu and Shuai Zhang and
Weiqiang Sun and Weisheng Hu",
title = "Performances of Traffic Offloading in Data Center
Networks With Steerable Free-Space Optical
Communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2189--2204",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3340713",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3340713",
abstract = "Steerable free-space optics (FSO) communications are
flexible in link reconfiguration (LR), and easy to
deploy, especially when the available physical space is
limited. Thus it is considered as a good complement to
the wired network in data centers. In \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shi:2024:CER,
author = "Shouqian Shi and Xiaoxue Zhang and Chen Qian",
title = "Concurrent Entanglement Routing for Quantum Networks:
Model and Designs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2205--2220",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3343748",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3343748",
abstract = "Quantum entanglement enables important computing
applications such as quantum key distribution. Based on
quantum entanglement, quantum networks are built to
provide long-distance secret sharing between two remote
communication parties. Establishing a \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Sun:2024:SOD,
author = "Peng Sun and Guocheng Liao and Xu Chen and Jianwei
Huang",
title = "A Socially Optimal Data Marketplace With
Differentially Private Federated Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2221--2236",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3351864",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3351864",
abstract = "Federated learning (FL) enables multiple data owners
to collaboratively train machine learning (ML) models
for different model requesters while keeping data
localized. Thus, FL can mitigate privacy leakage in
conventional data marketplaces for ML \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mir:2024:LLP,
author = "Muhammad Sarmad Mir and Borja Genoves Guzman and Ambuj
Varshney and Domenico Giustiniano",
title = "{LiFi} for Low-Power and Long-Range {RF} Backscatter",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2237--2252",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3344316",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3344316",
abstract = "Light bulbs have been recently explored to design
Light Fidelity (LiFi) communication to battery-free
tags, thus complementing Radiofrequency (RF)
backscatter in the uplink. In this paper, we show that
LiFi and RF backscatter are complementary and have
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:TAH,
author = "Tao Zhang and Ran Huang and Jiawei Huang and Shaojun
Zou and Chang Ruan and Kai Chen and Jianxin Wang and
Geyong Min",
title = "Taming the Aggressiveness of Heterogeneous {TCP}
Traffic in Data Center Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2253--2268",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3347048",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3347048",
abstract = "To achieve low latency and high link utilization,
ECN-based transport protocols (i.e., DCTCP) are widely
deployed in data center networks (DCN). In multi-tenant
environment, however, the newly introduced ECN-enabled
TCP greatly impairs the performance of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Miano:2024:MRT,
author = "Sebastiano Miano and Alireza Sanaee and Fulvio Risso
and G{\'a}bor R{\'e}tv{\'a}ri and Gianni Antichi",
title = "{Morpheus}: a Run Time Compiler and Optimizer for
Software Data Planes",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2269--2284",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2023.3346286",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3346286",
abstract = "State-of-the-art approaches to design, develop and
optimize software packet-processing programs are based
on static compilation: the compiler&\#x2019;s input
is a description of the forwarding plane semantics and
the output is a binary that can accommodate \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Hou:2024:OSA,
author = "Ningning Hou and Xianjin Xia and Yifeng Wang and
Yuanqing Zheng",
title = "One Shot for All: Quick and Accurate Data Aggregation
for {LPWANs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "3",
pages = "2285--2298",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3353792",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3353792",
abstract = "This paper presents our design and implementation of a
fast and accurate data aggregation strategy for LoRa
networks named One-shot. To facilitate data
aggregation, One-shot assigns distinctive chirps for
different LoRa nodes to encode individual data.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:SCH,
author = "Xin Wang and Hong Shen and Hui Tian",
title = "Scheduling Coflows in Hybrid Optical-Circuit and
Electrical-Packet Switches With Performance Guarantee",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2299--2314",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3354245",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3354245",
abstract = "Scheduling of coflows, each a collection of parallel
flows sharing the same objective, is an important task
of data transmission that arises in the networks
supporting data-intensive applications such as data
center networks (DCNs). The hybrid switch \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:MAI,
author = "Yutao Chen and Anthony Ephremides",
title = "Minimizing Age of Incorrect Information Over a Channel
With Random Delay",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2752--2764",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3389964",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3389964",
abstract = "We consider a transmitter-receiver pair in a
slotted-time system. The transmitter observes a dynamic
source and sends updates to a remote receiver through
an error-free communication channel that suffers a
random delay. We consider two cases. In the first
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Abolhassani:2024:OPP,
author = "Bahman Abolhassani and John Tadrous and Atilla
Eryilmaz and Serdar Y{\"u}ksel",
title = "Optimal Push and Pull-Based Edge Caching for Dynamic
Content",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2765--2777",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3352029",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3352029",
abstract = "We introduce a framework and optimal
&\#x2018;fresh&\#x2019; caching for a content
distribution network (CDN) comprising a front-end local
cache and a back-end database. The data content is
dynamically updated at a back-end database and
end-users are \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chiang:2024:OMT,
author = "Sheng-Hao Chiang and Chih-Hang Wang and De-Nian Yang
and Wanjiun Liao and Wen-Tsuen Chen",
title = "Online Multicast Traffic Engineering for Multi-View
Videos With View Synthesis in {SDN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2778--2793",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3366166",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3366166",
abstract = "Multi-view videos (MVV) have emerged to provide users
with immersively interactive experiences with 3D
multimedia content. Compared with traditional 2D
videos, MVV offers multiple view angles to avoid
generating occluded regions from a single viewpoint
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Gong:2024:OOD,
author = "Chen Gong and Zhenzhe Zheng and Yunfeng Shao and
Bingshuai Li and Fan Wu and Guihai Chen",
title = "{ODE}: an Online Data Selection Framework for
Federated Learning With Limited Storage",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2794--2809",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3365534",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3365534",
abstract = "Machine learning (ML) models have been deployed in
mobile networks to deal with massive data from
different layers to enable automated network
management. To overcome high communication cost and
severe privacy concerns of centralized ML, federated
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Misa:2024:DNT,
author = "Chris Misa and Ramakrishnan Durairajan and Reza Rejaie
and Walter Willinger",
title = "{DynATOS+}: a Network Telemetry System for Dynamic
Traffic and Query Workloads",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2810--2825",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3367432",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3367432",
abstract = "Network telemetry systems provide critical visibility
into the state of network traffic. By leveraging modern
programmable switch hardware, significant progress has
been made to scale these systems to production network
traffic workloads. Less attention \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Quan:2024:OEC,
author = "Guocong Quan and Atilla Eryilmaz and Ness B. Shroff",
title = "Optimal Edge Caching for Individualized Demand
Dynamics",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2826--2841",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3369611",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3369611",
abstract = "The ever-growing end user data demands, and the
reductions in memory costs are fueling edge-caching
deployments. Caching at the edge is substantially
different from that at the core and needs to consider
the nature of individualized data demands. For
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:HLO,
author = "Xiang Chen and Hongyan Liu and Qingjiang Xiao and Qun
Huang and Dong Zhang and Haifeng Zhou and Boyang Zhou
and Chunming Wu and Xuan Liu and Qiang Yang",
title = "{Hermes}: Low-Overhead Inter-Switch Coordination in
Network-Wide Data Plane Program Deployment",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2842--2857",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3361324",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3361324",
abstract = "Network administrators usually realize network
functions in data plane programs. They employ the
network-wide program deployment that decomposes input
programs into match-action tables (MATs) while
deploying each MAT on a specific switch. Since MATs may
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Rottenstreich:2024:EDT,
author = "Ori Rottenstreich and Jose Yallouz",
title = "Edge-Disjoint Tree Allocation for Multi-Tenant Cloud
Security in Datacenter Topologies",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2858--2874",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3364173",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3364173",
abstract = "Resource sharing with its implied mutual interference
has been considered a major concern for running
applications of multiple tenants in shared cloud
datacenters. Besides its security benefits, the
isolation of traffic might ensure a quality of service
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Boche:2024:NNT,
author = "Holger Boche and Rafael F. Schaefer and H. Vincent
Poor and Frank H. P. Fitzek",
title = "On the Need of Neuromorphic Twins to Detect
Denial-of-Service Attacks on Communication Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2875--2887",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3369018",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3369018",
abstract = "As we become more and more dependent on communication
technologies, resilience against any attacks on
communication networks is important to guarantee the
digital sovereignty of our society. New developments of
communication networks approach the problem \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Xia:2024:PNA,
author = "Junxu Xia and Lailong Luo and Bowen Sun and Geyao
Cheng and Deke Guo",
title = "Parallelized In-Network Aggregation for Failure Repair
in Erasure-Coded Storage Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2888--2903",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3367995",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3367995",
abstract = "To repair a failed block in the erasure-coded storage
system, multiple related blocks have to be retrieved
from other storage nodes across the network. Such a
process can lead to significant incast-type repair
traffics and delays. The existing efforts \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhang:2024:TRR,
author = "Jiuwu Zhang and Xiulong Liu and Sheng Chen and Xinyu
Tong and Zeyu Deng and Tao Gu and Keqiu Li",
title = "Toward Robust {RFID} Localization via Mobile Robot",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2904--2919",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3373770",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3373770",
abstract = "A wide range of scenarios, such as warehousing, and
smart manufacturing, have used RFID mobile robots for
the localization of tagged objects. The
state-of-the-art RFID-robot based localization works
are based on the premise of stable speed. However, in
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liao:2024:GRU,
author = "Zimo Liao and Zhicheng Luo and Qianyi Huang and
Linfeng Zhang and Fan Wu and Qian Zhang and Guihai
Chen",
title = "Gesture Recognition Using Visible Light on Mobile
Devices",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2920--2935",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3369996",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3369996",
abstract = "In-air gesture control extends a touch screen and
enables contactless interaction, thus has become a
popular research direction in the past few years. Prior
work has implemented this functionality based on
cameras, acoustic signals, and Wi-Fi via existing
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2024:PPV,
author = "Haojun Huang and Jialin Tian and Geyong Min and Hao
Yin and Cheng Zeng and Yangming Zhao and Dapeng Oliver
Wu",
title = "Parallel Placement of Virtualized Network Functions
via Federated Deep Reinforcement Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2936--2949",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3366950",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3366950",
abstract = "Network Function Virtualization (NFV) introduces a new
network architecture that offers different network
services flexibly and dynamically in the form of
Service Function Chains (SFCs), which refer to a set of
Virtualization Network Functions (VNFs) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mazzola:2024:ARP,
author = "Fabricio Mazzola and Augusto Setti and Pedro Marcos
and Marinho Barcellos",
title = "Analyzing Remote Peering Deployment and Its
Implications for Internet Routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2950--2959",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3375898",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3375898",
abstract = "Internet eXchange Points (IXPs) have significantly
transformed the structure and economics of the Internet
by allowing many nearby networks to connect directly,
avoiding the need for service providers. These large
IXPs are so beneficial that they are not \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Anselmi:2024:ALB,
author = "Jonatha Anselmi",
title = "Asynchronous Load Balancing and Auto-Scaling:
Mean-Field Limit and Optimal Design",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2960--2971",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3368130",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3368130",
abstract = "We develop a Markovian framework for load balancing
that combines classical algorithms such as
Power-of-<inline-formula> <tex-math
notation=``LaTeX''>$d$
</tex-math></inline-formula> with
auto-scaling mechanisms that allow the net service
capacity to scale \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Fu:2024:FIG,
author = "Chuanpu Fu and Qi Li and Ke Xu",
title = "Flow Interaction Graph Analysis: Unknown Encrypted
Malicious Traffic Detection",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2972--2987",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3370851",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3370851",
abstract = "Nowadays traffic on the Internet has been widely
encrypted to protect its confidentiality and privacy.
However, traffic encryption is always abused by
attackers to conceal their malicious behaviors. Since
encrypted malicious traffic is similar to benign
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Shao:2024:SPI,
author = "Qi Shao and Man Hon Cheung and Jianwei Huang",
title = "Strategic Pricing and Information Disclosure in
Crowdfunding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "2988--3001",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3374748",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3374748",
abstract = "In a crowdfunding campaign, the project creator
determines various campaign decisions, such as the
pricing and information revelation strategy, to
maximize the funding. Each contributor has a high or
low valuation for the project. In this paper, we
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Zhu:2024:PTL,
author = "Shunmin Zhu and Jianyuan Lu and Biao Lyu and Tian Pan
and Shize Zhang and Xiaoqing Sun and Chenhao Jia and
Xin Cheng and Daxiang Kang and Yilong Lv and Fukun Yang
and Xiaobo Xue and Xihui Yang and Zhiliang Wang and
Jiahai Yang",
title = "Proactive Telemetry in Large-Scale Multi-Tenant Cloud
Overlay Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3002--3017",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3381786",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3381786",
abstract = "At present, public clouds have served millions of
tenants. To provide reliable services, cloud vendors
need to perceive health status of the cloud network by
building a telemetry system to detect possible network
failures. While telemetry systems for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cheng:2024:AOC,
author = "Minquan Cheng and Youlong Wu and Xianxian Li and
Dianhua Wu",
title = "Asymptotically Optimal Coded Distributed Computing via
Combinatorial Designs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3018--3033",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3372698",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3372698",
abstract = "Coded distributed computing (CDC) introduced by Li et
al. can greatly reduce the communication load for
MapReduce computing systems. In the cascaded CDC with
<inline-formula> <tex-math
notation=``LaTeX''>$K$
</tex-math></inline-formula> workers,
<inline-. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Huang:2024:WLD,
author = "Jiatai Huang and Leana Golubchik and Longbo Huang",
title = "When Lyapunov Drift Based Queue Scheduling Meets
Adversarial Bandit Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3034--3044",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3374755",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3374755",
abstract = "In this paper, we study scheduling of a queueing
system with zero knowledge of instantaneous network
conditions. We consider a one-hop single-server
queueing system consisting of K queues, each with
time-varying and non-stationary arrival and service
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Mi:2024:ANE,
author = "Liang Mi and Tingting Yuan and Weijun Wang and Haipeng
Dai and Lin Sun and Jiaqi Zheng and Guihai Chen and
Xiaoming Fu",
title = "Accelerated Neural Enhancement for Video Analytics
With Video Quality Adaptation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3045--3060",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3375108",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3375108",
abstract = "The quality of the video stream is the key to neural
network-based video analytics. However, low-quality
video is inevitably collected by existing surveillance
systems because of poor-quality cameras or
over-compressed/pruned video streaming protocols,
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:MTE,
author = "Fei Wang and Ethan Hugh and Baochun Li",
title = "More Than Enough is Too Much: Adaptive Defenses
Against Gradient Leakage in Production Federated
Learning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3061--3075",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3377655",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3377655",
abstract = "With increasing concerns on privacy leakage from
gradients, various attack mechanisms emerged to recover
private data from gradients, which challenged the
primary advantage of privacy protection in federated
learning. However, we cast doubt upon the real
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Chen:2024:TIC,
author = "Min-Yue Chen and Yiwen Hu and Guan-Hua Tu and Chi-Yu
Li and Sihan Wang and Jingwen Shi and Tian Xie and
Ren-Chieh Hsu and Li Xiao and Chunyi Peng and Zhaowei
Tan and Songwu Lu",
title = "Taming the Insecurity of Cellular Emergency Services
(9-1-1): From Vulnerabilities to Secure Designs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3076--3091",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3379292",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3379292",
abstract = "Cellular networks, vital for delivering emergency
services, enable mobile users to dial emergency calls
(e.g., 9-1-1 in the U.S.), which are forwarded to
public safety answer points (PSAPs). Regulatory
requirements allow anonymous user equipment \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Salehi:2024:MEI,
author = "Batool Salehi and Utku Demir and Debashri Roy and
Suyash Pradhan and Jennifer Dy and Stratis Ioannidis
and Kaushik Chowdhury",
title = "Multiverse at the Edge: Interacting Real World and
Digital Twins for Wireless Beamforming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3092--3110",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3377114",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3377114",
abstract = "Creating a digital world that closely mimics the real
world with its many complex interactions and outcomes
is possible today through advanced emulation software
and ubiquitous computing power. Such a software-based
emulation of an entity that exists in \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:FOS,
author = "Yang Liu and Xi Wang and Xiaoqi Wang and Zhen Wang",
title = "Fast Outbreak Sense and Effective Source Inference via
Minimum Observer Set",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3111--3125",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3382546",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3382546",
abstract = "This paper addresses the Fast outbreak Sensing and
Effective diffusion source Inferring (FSEI) problem,
which assumes that the state of nodes in a particularly
chosen observer set can be monitored if necessary and
aims to optimize the observer set such \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:TPI,
author = "Xiaoliang Wang and Ke Xu and Yangfei Guo and Haiyang
Wang and Songtao Fu and Qi Li and Bin Wu and Jianping
Wu",
title = "Toward Practical Inter-Domain Source Address
Validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3126--3141",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3377116",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3377116",
abstract = "The Internet Protocol (IP) is the most fundamental
building block of the Internet. However, it provides no
explicit notion of packet-level authenticity. Such a
weakness allows malicious actors to spoof IP packet
headers and launch a wide variety of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Han:2024:DNS,
author = "Rongxin Han and Jingyu Wang and Qi Qi and Dezhi Chen
and Zirui Zhuang and Haifeng Sun and Xiaoyuan Fu and
Jianxin Liao and Song Guo",
title = "Dynamic Network Slice for Bursty Edge Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3142--3157",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3376794",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3376794",
abstract = "Edge network slicing promises better utilization of
network resources by dynamically allocating resources
on demand. However, addressing the imbalance between
slice resources and user demands becomes challenging
when complex user behaviors lead to bursty \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Cordeschi:2024:OBD,
author = "Nicola Cordeschi and Floriano {De Rango} and Andrea
Baiocchi",
title = "Optimal Back-Off Distribution for Maximum Weighted
Throughput in {CSMA}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3158--3172",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3387322",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3387322",
abstract = "We consider a generalized version of Carrier-Sense
Multiple Access (CSMA), where the contention window
size is a constant and the back-off probability
distribution can be varied. We address the optimization
of a weighted throughput metric, identifying the
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Wang:2024:OAS,
author = "Chih-Chun Wang",
title = "Optimal {AoI} for Systems With Queueing Delay in Both
Forward and Backward Directions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3173--3188",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3379895",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3379895",
abstract = "Age-Of-Information (AoI) is a metric that focuses
directly on the application-layer objectives, and a
canonical AoI minimization problem is the
update-through-queues models. Existing results in this
direction fall into two categories: The open-loop
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
@Article{Liu:2024:SRE,
author = "Jiani Liu and Ju Ren and Yongmin Zhang and Sheng Yue
and Yaoxue Zhang",
title = "{SESAME}: a Resource Expansion and Sharing Scheme for
Multiple Edge Services Providers",
journal = j-IEEE-TRANS-NETWORKING,
volume = "32",
number = "4",
pages = "3189--3204",
month = jun,
year = "2024",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2024.3377908",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Sep 21 06:19:41 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3377908",
abstract = "As a potential computing solution for fast-growing
mobile and IoT applications, edge computing has been
developed rapidly. However, due to the relatively
limited resources of each edge node, it is difficult
for edge nodes to provide quality-guaranteed \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "IEEE/ACM Trans. Netw.",
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "https://dl.acm.org/loi/ton",
}
