text:
Charlotte mayoral election, 2017
From Wikipedia, the free encyclopedia
Jump to: navigation, search
Charlotte mayoral election, 2017
← 2015 November 7, 2017 2019 →
Nominee
Vi Lyles Kenny Smith
Party
Democratic Republican
Popular vote
71,876 49,555
Percentage
59.13% 40.77%
Mayor before election
Jennifer Roberts
Democratic
Elected Mayor
Vi Lyles
Democratic
The 2017 Charlotte mayoral election took place on Tuesday, November 7, 2017. Party primary elections were held on Tuesday, September 12, 2017. Second-round primaries would have been held on Tuesday, October 10, 2017, if they had been necessary, but both primary winners received more than the minimum 40 percent of the vote needed to avoid a runoff.[1] The incumbent, Democrat Jennifer Roberts, was eligible to run for a second two-year term. She ran but lost the Democratic nomination in the primary. Two members of the City Council, Democrat Vi Lyles and Republican Kenny Smith, won the primaries and advanced to face each other in the general election.[2] Vi Lyles defeated Kenny Smith in the general election, and became the 59th mayor of Charlotte, North Carolina.
Contents
[hide]
1 Background
2 Democratic primary
2.1 Candidates
2.1.1 Declared
2.1.2 Declined
2.2 Endorsements
2.3 Polling
2.4 Results
3 Republican primary
3.1 Candidates
3.1.1 Declared
3.2 Endorsements
3.3 Results
4 General election
4.1 Polling
4.2 Results
5 References
Background[edit]
Jennifer Roberts, a former Mecklenburg County commissioner, was elected to her first term in 2015 when she defeated Republican Edwin Peacock III, a former Charlotte City Councilman.
Democratic primary[edit]
Candidates[edit]
Declared[edit]
Jennifer Roberts, incumbent[3]
Joel Ford, North Carolina State Senator[3]
Vi Lyles, Charlotte City Councilwoman[4]
Constance Partee-Johnson[5]
Lucille Puckett [6]
Declined[edit]
David Howard, former Charlotte City Councilman[3]
Endorsements[edit]
[show]Jennifer Roberts
Human Rights Campaign[7]
MeckPAC[8]
Equality NC[9]
New South Progressives[10]
Sierra Club[11]
Southern Piedmont Central Labor Council[12]
Unite Here Local 23 North Carolina Chapter[13]
[show]Joel Ford
Charlotte Fire Fighters Association[14]
Real Estate and Building Industry Coalition[15]
[show]Vi Lyles
Black Political Caucus[16]
Democracy for America[17]
Charlotte Post[18]
Charlotte Observer[19]

Polling[edit]
Poll source
Date(s)
administered
Sample
size
Margin of
error
Jennifer Roberts (D)
Joel Ford (D)
Vi Lyles (D)
Constance Partee-Johnson (D)
Other
Undecided
Lake Research Partners[20] June 1–4, 2017 400 ± 4.9% 35% 15% 21% – – 28%
Results[edit]
Candidates
Democratic Primary Election - Sept. 12[21]
Candidate
Party
Votes
Percent
Vi Lyles Democratic 15,773 46.15%
Jennifer Roberts Democratic 12,375 36.21%
Joel Ford Democratic 5,452 15.95%
Constance Partee (Connie) Johnson Democratic 310 0.91%
Lucille Puckett Democratic 267 0.78%
Republican primary[edit]
Candidates[edit]
Declared[edit]
Kimberley Paige Barnette,[22] former magistrate[23]
Barnette garnered controversy in September 2017 when her Facebook page briefly described herself as "Republican $ Smart, White, Traditional." The controversy garnered national attention. [24]
Gary M. Dunn, candidate for Democratic nomination in 2013[22]
Kenny Smith, Charlotte City Councilman[25]
Endorsements[edit]
[show]Kenny Smith
Fraternal Order of Police [26]
Charlotte Observer [27]
Results[edit]
Candidates
Republican Primary Election - Sept. 12[21]
Candidate
Party
Votes
Percent
Kenny Smith Republican 7,912 88.63%
Gary M. Dunn Republican 553 6.19%
Kimberley Paige Barnette Republican 462 5.18%
General election[edit]
Polling[edit]
Poll source
Date(s)
administered
Sample
size
Margin of
error
Vi
Lyles (D)
Kenny
Smith (R)
Undecided
SurveyUSA October 18–21, 2017 517 ± 4.4% 41% 40% 19%
Results[edit]
Candidates
General Election - Nov. 7[28]
Candidate
Party
Votes
Percent
Vi Lyles Democratic 71,876 59.13%
Kenny Smith Republican 49,555 40.77%
References[edit]
Jump up ^ "Multi Year Election Schedule". Mecklenburg County Government. Retrieved June 19, 2017.
Jump up ^ Charlotte Observer: Vi Lyles stuns Roberts, faces Kenny Smith for Charlotte mayor
^ Jump up to: a b c Spanberg, Erik (November 30, 2016). "Thought election season was over in Charlotte? Mayor's race getting an early start". Charlotte Business Journal. Retrieved February 4, 2017.
Jump up ^ Boyd, Paul (February 3, 2017). "Councilman Smith leads way with most money in mayoral race". WSOC-TV. Retrieved February 4, 2017.
Jump up ^ Harrison, Steve (June 20, 2017). "In mayoral debate, Jennifer Roberts and Vi Lyles play nice". The Charlotte Observer. Retrieved June 20, 2017.
Jump up ^ http://apps.meckboe.org/CandidatePrint.aspx
Jump up ^ Harrison, Steve (August 23, 2017). "LGBT groups make their picks for Charlotte mayor, council". The Charlotte Observer. Retrieved September 10, 2017.
Jump up ^ http://www.meckpac.org/endorsements/2017-charlotte-mayoral-city-council-endorsements/
Jump up ^ http://equalitync.org/latest/news/turnoutCLT/
Jump up ^ http://us14.campaign-archive1.com/?u=d11fd3f059107c746d4deb4a3&id=718e797b42
Jump up ^ http://www.sierraclub.org/sites/www.sierraclub.org/files/sce/central-piedmont-group/2017%20Charlotte%20Mayor%20Endorsement.pdf
Jump up ^ https://splabor.org/news/september-primary-endorsements-announced
Jump up ^ https://www.jenniferrobertsformayor.com/endorsements
Jump up ^ https://joelfordformayor.com/2017/08/29/charlotte-firefighters-endorse-joel-ford-for-mayor/
Jump up ^ https://rebiccharlotte.com/2017/08/08/rebic-announces-endorsements-for-charlotte-city-council-primary/
Jump up ^ Morrill, Jim (May 22, 2017). "Black Political Caucus has endorsed a mayoral candidate. How will it shape the primary?". The Charlotte Observer. Retrieved September 10, 2017.
Jump up ^ http://www.democracyforamerica.com/our_candidates#NC
Jump up ^ Charlotte Post Editorial Board (August 31, 2017). "The Post endorses Vi Lyles in Democratic mayoral primary Experience and leadership earns support". The Charlotte Post. Retrieved September 10, 2017.
Jump up ^ Charlotte Observer Editorial Board (August 23, 2017). "Who we like in the Charlotte mayor's race, and why". The Charlotte Observer. Retrieved September 10, 2017.
Jump up ^ White, Herbert (June 20, 2017). "Poll: Mayor Roberts leads Lyles and Ford in Democratic campaign". The Charlotte Post. Retrieved June 20, 2017.
^ Jump up to: a b NC State Board of Elections Sept. 12 Primary Results
^ Jump up to: a b NC State Board of Elections: Candidate filings
Jump up ^ LinkedIn
Jump up ^ Savransky, Rebecca (2017-09-06). "Candidate for Charlotte mayor puts 'white' among qualifications". TheHill. Retrieved 2017-09-07.
Jump up ^ Harrison, Steve (March 9, 2017). "Kenny Smith formally announces mayoral bid with swipes at Mayor Roberts". Charlotte Observer. Retrieved March 24, 2017.
Jump up ^ http://www.charlotteobserver.com/news/politics-government/election/article175865761.html/
Jump up ^ http://www.charlotteobserver.com/opinion/editorials/article172619896.html
Jump up ^ http://er.ncsbe.gov/?election_dt=11/07/2017&county_id=60&office=ALL&contest=0
[show]
v
t
e
(2016 ←) 2017 United States elections (→ 2018)
U.S. Senate
Alabama
U.S. House
California's 34th
Georgia's 6th
Kansas's 4th
Montana's at-large
South Carolina's 5th
Utah's 3rd
Governors
New Jersey
Virginia
Mayors
Albuquerque, NM
Atlanta, GA
Atlantic City, NJ
Boston, MA
Buffalo, NY
Charlotte, NC
Cincinnati, OH
Cleveland, OH
Detroit, MI
El Paso, TX
Frederick, MD
Hoboken, NJ
Jackson, MS
Jersey City, NJ
Los Angeles, CA
Miami, FL
Minneapolis, MN
New Orleans, LA
New York, NY
North Miami, FL
Omaha, NE
Pittsburgh, PA
Raleigh, NC
Rochester, NY
St. Louis, MO
St. Paul, MN
St. Petersburg, FL
San Antonio, TX
Seattle, WA
City
Houston, TX
Minneapolis, MN
State
New Jersey
Virginia
Territories
Puerto Rican status referendum
Retrieved from "https://en.wikipedia.org/w/index.php?title=Charlotte_mayoral_election,_2017&oldid=813627367"
Categories:
Mayoral elections in Charlotte, North Carolina
North Carolina elections, 2017
United States mayoral elections, 2017
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Add links
This page was last edited on 4 December 2017, at 12:01.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

key: html

type: local

value: div

attrs: id class

values: mw-page-base noprint

values: mw-head-base noprint

value: a

attrs: id class lang

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

value: caption

attrs: class style

values:
summary
font-size: 125%;

attrs: href title

value: td

attrs: style class

values: text-align:left; vertical-align:middle; padding:0 0.5em 0 0;width:15%;

value: b

values: text-align:center; vertical-align:middle; padding:0 1px;width:70%;

attrs: href class title

values:
/wiki/Charlotte_mayoral_election,_2019
mw-redirect
Charlotte mayoral election, 2019

values: text-align:right; vertical-align:middle; padding:0 0 0 0.5em;width:15%;

value: tr

value: tbody

value: table

attrs: colspan style

values: text-align:center;border-bottom: 6px solid #3333FF

values: text-align:center;border-bottom: 6px solid #E81B23

values: width:50%; text-align:left; text-size: 80%

values: width:50%; text-align:right; text-size: 80%

values:
infobox vevent
width:22em;line-height: 1.5em;

values:
/wiki/Primary_elections
mw-redirect
Primary elections

values:
/wiki/North_Carolina_State_Senate
mw-redirect
North Carolina State Senate

values:
/wiki/Equality_NC
mw-redirect
Equality NC

values: border:solid 1px silver; padding:8px; background-color: transparent;

values: width:100%; margin:auto; clear:both; font-size:88%; padding:1px; background:#fdfdfd; text-align:left; border:0; margin-top:0.2em;

values:
/wiki/Charlotte_Post
mw-redirect
Charlotte Post

values:
/wiki/Charlotte_Observer
mw-redirect
Charlotte Observer

values: Template talk:United States elections, 2017

values: List of special elections to the United States Senate

values: United States Senate special election in Alabama, 2017

values: List of special elections to the United States House of Representatives

values: California's 34th congressional district special election, 2017

values: Georgia's 6th congressional district special election, 2017

values: Kansas's 4th congressional district special election, 2017

values: Montana's at-large congressional district special election, 2017

values: South Carolina's 5th congressional district special election, 2017

values: Utah's 3rd congressional district special election, 2017

values: United States gubernatorial elections, 2017

values: St. Petersburg, Florida mayoral election, 2017

values:
/wiki/Houston_elections,_2017
mw-redirect
Houston elections, 2017

values: nowraplinks hlist collapsible autocollapse navbox-inner

values: Category:Mayoral elections in Charlotte, North Carolina

values: Category:United States mayoral elections, 2017

values:
catlinks mw-normal-catlinks
catlinks mw-normal-catlinks
interface

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Charlotte_mayoral_election,_2017
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values:
uls-settings-trigger
Language settings
0
button
true

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Charlotte_mayoral_election_2017 rootpage-Charlotte_mayoral_election_2017 skin-vector action-view


text:
Network topology
From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the topology of transport networks, see Transport topology.
Network science
Theory
Graph
Complex network
Contagion
Small-world
Scale-free
Community structure
Percolation
Evolution
Controllability
Graph drawing
Social capital
Link analysis
Optimization
Reciprocity
Closure
Homophily
Transitivity
Preferential attachment
Balance theory
Network effect
Social influence
Network types
Informational (computing)
Telecommunication
Transport
Social
Scientific collaboration
Biological
Artificial neural
Interdependent
Semantic
Spatial
Dependency
Flow
Graphs
Features
Clique
Component
Cut
Cycle
Data structure
Edge
Loop
Neighborhood
Path
Vertex
Adjacency list / matrix
Incidence list / matrix
Types
Bipartite
Complete
Directed
Hyper
Multi
Random
Weighted
Metrics
Algorithms
Centrality
Degree
Betweenness
Closeness
PageRank
Motif
Clustering
Degree distribution
Assortativity
Distance
Modularity
Efficiency
Models
Topology
Random graph
Erdős–Rényi
Barabási–Albert
Watts–Strogatz
Exponential random (ERGM)
Hyperbolic (HGN)
Hierarchical
Stochastic block model
Lancichinetti–Fortunato–Radicchi benchmark
Dynamics
Boolean network
agent based
Epidemic/SIR
Lists
Categories
Topics
Software
Network scientists
Category:Network theory
Category:Graph theory
v
t
e
Network topology is the arrangement of the various elements (links, nodes, etc.) of a communication network.[1][2]
Network topology is the topological[3] structure of a network and may be depicted physically or logically. Physical topology is the placement of the various components of a network, including device location and cable installation, while logical topology illustrates how data flows within a network. Distances between nodes, physical interconnections, transmission rates, or signal types may differ between two networks, yet their topologies may be identical.
An example is a local area network (LAN). Any given node in the LAN has one or more physical links to other devices in the network; graphically mapping these links results in a geometric shape that can be used to describe the physical topology of the network. Conversely, mapping the data flow between the components determines the logical topology of the network.
Contents
[hide]
1 Topologies
2 Links
2.1 Wired technologies
2.2 Wireless technologies
2.3 Exotic technologies
3 Nodes
3.1 Network interfaces
3.2 Repeaters and hubs
3.3 Bridges
3.4 Switches
3.5 Routers
3.6 Modems
3.7 Firewalls
4 Classification
4.1 Point-to-point
4.2 Bus
4.2.1 Linear bus
4.2.2 Distributed bus
4.3 Star
4.3.1 Extended star
4.3.2 Distributed Star
4.4 Ring
4.5 Mesh
4.5.1 Fully connected network
4.5.2 Partially connected network
4.6 Hybrid
4.7 Daisy chain
5 Centralization
6 Decentralization
7 See also
8 References
9 External links
Topologies[edit]
Diagram of different network topologies.
Two basic categories of network topologies exist, physical topologies and logical topologies.[4]
The cabling layout used to link devices is the physical topology of the network. This refers to the layout of cabling, the locations of nodes, and the links between the nodes and the cabling.[1] The physical topology of a network is determined by the capabilities of the network access devices and media, the level of control or fault tolerance desired, and the cost associated with cabling or telecommunications circuits.
In contrast, logical topology is the way that the signals act on the network media, or the way that the data passes through the network from one device to the next without regard to the physical interconnection of the devices. A network's logical topology is not necessarily the same as its physical topology. For example, the original twisted pair Ethernet using repeater hubs was a logical bus topology carried on a physical star topology. Token ring is a logical ring topology, but is wired as a physical star from the media access unit. Logical topologies are often closely associated with media access control methods and protocols. Some networks are able to dynamically change their logical topology through configuration changes to their routers and switches.
Links[edit]
Further information: data transmission
The transmission media (often referred to in the literature as the physical media) used to link devices to form a computer network include electrical cable (Ethernet, HomePNA, power line communication, G.hn), optical fiber (fiber-optic communication), and radio waves (wireless networking). In the OSI model, these are defined at layers 1 and 2 — the physical layer and the data link layer.
A widely adopted family of transmission media used in local area network (LAN) technology is collectively known as Ethernet. The media and protocol standards that enable communication between networked devices over Ethernet are defined by IEEE 802.3. Ethernet transmits data over both copper and fiber cables. Wireless LAN standards (e.g. those defined by IEEE 802.11) use radio waves, or others use infrared signals as a transmission medium. Power line communication uses a building's power cabling to transmit data.
Wired technologies[edit]
Fiber optic cables are used to transmit light from one computer/network node to another
The orders of the following wired technologies are, roughly, from slowest to fastest transmission speed.
Coaxial cable is widely used for cable television systems, office buildings, and other work-sites for local area networks. The cables consist of copper or aluminum wire surrounded by an insulating layer (typically a flexible material with a high dielectric constant), which itself is surrounded by a conductive layer. The insulation helps minimize interference and distortion. Transmission speed ranges from 200 million bits per second to more than 500 million bits per second.
ITU-T G.hn technology uses existing home wiring (coaxial cable, phone lines and power lines) to create a high-speed (up to 1 Gigabit/s) local area network
Twisted pair wire is the most widely used medium for all telecommunication. Twisted-pair cabling consist of copper wires that are twisted into pairs. Ordinary telephone wires consist of two insulated copper wires twisted into pairs. Computer network cabling (wired Ethernet as defined by IEEE 802.3) consists of 4 pairs of copper cabling that can be utilized for both voice and data transmission. The use of two wires twisted together helps to reduce crosstalk and electromagnetic induction. The transmission speed ranges from 2 million bits per second to 10 billion bits per second. Twisted pair cabling comes in two forms: unshielded twisted pair (UTP) and shielded twisted-pair (STP). Each form comes in several category ratings, designed for use in various scenarios.
2007 map showing submarine optical fiber telecommunication cables around the world.
An optical fiber is a glass fiber. It carries pulses of light that represent data. Some advantages of optical fibers over metal wires are very low transmission loss and immunity from electrical interference. Optical fibers can simultaneously carry multiple wavelengths of light, which greatly increases the rate that data can be sent, and helps enable data rates of up to trillions of bits per second. Optic fibers can be used for long runs of cable carrying very high data rates, and are used for undersea cables to interconnect continents.
Price is a main factor distinguishing wired- and wireless-technology options in a business. Wireless options command a price premium that can make purchasing wired computers, printers and other devices a financial benefit. Before making the decision to purchase hard-wired technology products, a review of the restrictions and limitations of the selections is necessary. Business and employee needs may override any cost considerations.[5]
Wireless technologies[edit]
Computers are very often connected to networks using wireless links
Main article: Wireless network
Terrestrial microwave – Terrestrial microwave communication uses Earth-based transmitters and receivers resembling satellite dishes. Terrestrial microwaves are in the low gigahertz range, which limits all communications to line-of-sight. Relay stations are spaced approximately 48 km (30 mi) apart.
Communications satellites – Satellites communicate via microwave radio waves, which are not deflected by the Earth's atmosphere. The satellites are stationed in space, typically in geosynchronous orbit 35,400 km (22,000 mi) above the equator. These Earth-orbiting systems are capable of receiving and relaying voice, data, and TV signals.
Cellular and PCS systems use several radio communications technologies. The systems divide the region covered into multiple geographic areas. Each area has a low-power transmitter or radio relay antenna device to relay calls from one area to the next area.
Radio and spread spectrum technologies – Wireless local area networks use a high-frequency radio technology similar to digital cellular and a low-frequency radio technology. Wireless LANs use spread spectrum technology to enable communication between multiple devices in a limited area. IEEE 802.11 defines a common flavor of open-standards wireless radio-wave technology known as Wifi.
Free-space optical communication uses visible or invisible light for communications. In most cases, line-of-sight propagation is used, which limits the physical positioning of communicating devices.
Exotic technologies[edit]
There have been various attempts at transporting data over exotic media:
IP over Avian Carriers was a humorous April fool's Request for Comments, issued as RFC 1149. It was implemented in real life in 2001.[6]
Extending the Internet to interplanetary dimensions via radio waves, the Interplanetary Internet.[7]
Both cases have a large round-trip delay time, which gives slow two-way communication, but doesn't prevent sending large amounts of information.
Nodes[edit]
Main article: Node (networking)
Apart from any physical transmission media there may be, networks comprise additional basic system building blocks, such as network interface controllers (NICs), repeaters, hubs, bridges, switches, routers, modems, and firewalls. Any particular piece of equipment will frequently contain multiple building blocks and perform multiple functions.
Network interfaces[edit]
An ATM network interface in the form of an accessory card. A lot of network interfaces are built-in.
A network interface controller (NIC) is computer hardware that provides a computer with the ability to access the transmission media, and has the ability to process low-level network information. For example, the NIC may have a connector for accepting a cable, or an aerial for wireless transmission and reception, and the associated circuitry.
The NIC responds to traffic addressed to a network address for either the NIC or the computer as a whole.
In Ethernet networks, each network interface controller has a unique Media Access Control (MAC) address—usually stored in the controller's permanent memory. To avoid address conflicts between network devices, the Institute of Electrical and Electronics Engineers (IEEE) maintains and administers MAC address uniqueness. The size of an Ethernet MAC address is six octets. The three most significant octets are reserved to identify NIC manufacturers. These manufacturers, using only their assigned prefixes, uniquely assign the three least-significant octets of every Ethernet interface they produce.
Repeaters and hubs[edit]
A repeater is an electronic device that receives a network signal, cleans it of unnecessary noise and regenerates it. The signal is retransmitted at a higher power level, or to the other side of an obstruction, so that the signal can cover longer distances without degradation. In most twisted pair Ethernet configurations, repeaters are required for cable that runs longer than 100 meters. With fiber optics, repeaters can be tens or even hundreds of kilometers apart.
A repeater with multiple ports is known as an Ethernet hub. Repeaters work on the physical layer of the OSI model. Repeaters require a small amount of time to regenerate the signal. This can cause a propagation delay that affects network performance and may affect proper function. As a result, many network architectures limit the number of repeaters that can be used in a row, e.g., the Ethernet 5-4-3 rule.
Hubs and repeaters in LANs have been mostly obsoleted by modern switches.
Bridges[edit]
A network bridge connects and filters traffic between two network segments at the data link layer (layer 2) of the OSI model to form a single network. This breaks the network's collision domain but maintains a unified broadcast domain. Network segmentation breaks down a large, congested network into an aggregation of smaller, more efficient networks.
Bridges come in three basic types:
Local bridges: Directly connect LANs
Remote bridges: Can be used to create a wide area network (WAN) link between LANs. Remote bridges, where the connecting link is slower than the end networks, largely have been replaced with routers.
Wireless bridges: Can be used to join LANs or connect remote devices to LANs.
Switches[edit]
A network switch is a device that forwards and filters OSI layer 2 datagrams (frames) between ports based on the destination MAC address in each frame.[8] A switch is distinct from a hub in that it only forwards the frames to the physical ports involved in the communication rather than all ports connected. It can be thought of as a multi-port bridge.[9] It learns to associate physical ports to MAC addresses by examining the source addresses of received frames. If an unknown destination is targeted, the switch broadcasts to all ports but the source. Switches normally have numerous ports, facilitating a star topology for devices, and cascading additional switches.
Multi-layer switches are capable of routing based on layer 3 addressing or additional logical levels. The term switch is often used loosely to include devices such as routers and bridges, as well as devices that may distribute traffic based on load or based on application content (e.g., a Web URL identifier).
Routers[edit]
A typical home or small office router showing the ADSL telephone line and Ethernet network cable connections
A router is an internetworking device that forwards packets between networks by processing the routing information included in the packet or datagram (Internet protocol information from layer 3). The routing information is often processed in conjunction with the routing table (or forwarding table). A router uses its routing table to determine where to forward packets. A destination in a routing table can include a "null" interface, also known as the "black hole" interface because data can go into it, however, no further processing is done for said data, i.e. the packets are dropped.
Modems[edit]
Modems (MOdulator-DEModulator) are used to connect network nodes via wire not originally designed for digital network traffic, or for wireless. To do this one or more carrier signals are modulated by the digital signal to produce an analog signal that can be tailored to give the required properties for transmission. Modems are commonly used for telephone lines, using a Digital Subscriber Line technology.
Firewalls[edit]
A firewall is a network device for controlling network security and access rules. Firewalls are typically configured to reject access requests from unrecognized sources while allowing actions from recognized ones. The vital role firewalls play in network security grows in parallel with the constant increase in cyber attacks.
Classification[edit]
The study of network topology recognizes eight basic topologies: point-to-point, bus, star, ring or circular, mesh, tree, hybrid, or daisy chain.[10]
Point-to-point[edit]
Main article: Point-to-point (telecommunications)
The simplest topology with a dedicated link between two endpoints. Easiest to understand, of the variations of point-to-point topology, is a point-to-point communications channel that appears, to the user, to be permanently associated with the two endpoints. A child's tin can telephone is one example of a physical dedicated channel.
Using circuit-switching or packet-switching technologies, a point-to-point circuit can be set up dynamically and dropped when no longer needed. Switched point-to-point topologies are the basic model of conventional telephony.
The value of a permanent point-to-point network is unimpeded communications between the two endpoints. The value of an on-demand point-to-point connection is proportional to the number of potential pairs of subscribers and has been expressed as Metcalfe's Law.
Bus[edit]
Bus network topology
Main article: Bus network
In local area networks where bus topology is used, each node is connected to a single cable, by the help of interface connectors. This central cable is the backbone of the network and is known as the bus (thus the name). A signal from the source travels in both directions to all machines connected on the bus cable until it finds the intended recipient. If the machine address does not match the intended address for the data, the machine ignores the data. Alternatively, if the data matches the machine address, the data is accepted. Because the bus topology consists of only one wire, it is rather inexpensive to implement when compared to other topologies. However, the low cost of implementing the technology is offset by the high cost of managing the network. Additionally, because only one cable is utilized, it can be the single point of failure. In this topology data being transferred may be accessed by any workstation.
Linear bus[edit]
The type of network topology in which all of the nodes of the network that are connected to a common transmission medium which has exactly two endpoints (this is the 'bus', which is also commonly referred to as the backbone, or trunk) – all data that is transmitted in between nodes in the network is transmitted over this common transmission medium and is able to be received by all nodes in the network simultaneously.[1]
Note: When the electrical signal reaches the end of the bus, the signal is reflected back down the line, causing unwanted interference. As a solution, the two endpoints of the bus are normally terminated with a device called a terminator that prevents this reflection.
Distributed bus[edit]
The type of network topology in which all of the nodes of the network are connected to a common transmission medium which has more than two endpoints that are created by adding branches to the main section of the transmission medium – the physical distributed bus topology functions in exactly the same fashion as the physical linear bus topology (i.e., all nodes share a common transmission medium).
Star[edit]
Main article: Star network
Star network topology
In local area networks with a star topology, each network host is connected to a central hub with a point-to-point connection. So it can be said that every computer is indirectly connected to every other node with the help of the hub. In Star topology, every node (computer workstation or any other peripheral) is connected to a central node called hub, router or switch. The switch is the server and the peripherals are the clients. The network does not necessarily have to resemble a star to be classified as a star network, but all of the nodes on the network must be connected to one central device. All traffic that traverses the network passes through the central hub. The hub acts as a signal repeater. The star topology is considered the easiest topology to design and implement. An advantage of the star topology is the simplicity of adding additional nodes. The primary disadvantage of the star topology is that the hub represents a single point of failure. Since all peripheral communication must flow through the central hub, the aggregate central bandwidth forms a network bottleneck for large clusters.
Extended star[edit]
A type of network topology in which a network that is based upon the physical star topology has one or more repeaters between the central node and the peripheral or 'spoke' nodes, the repeaters being used to extend the maximum transmission distance of the point-to-point links between the central node and the peripheral nodes beyond that which is supported by the transmitter power of the central node or beyond that which is supported by the standard upon which the physical layer of the physical star network is based.
If the repeaters in a network that is based upon the physical extended star topology are replaced with hubs or switches, then a hybrid network topology is created that is referred to as a physical hierarchical star topology, although some texts make no distinction between the two topologies.
Distributed Star[edit]
A type of network topology that is composed of individual networks that are based upon the physical star topology connected in a linear fashion – i.e., 'daisy-chained' – with no central or top level connection point (e.g., two or more 'stacked' hubs, along with their associated star connected nodes or 'spokes').
Ring[edit]
Main article: Ring network
Ring network topology
A ring topology is a bus topology in a closed loop. Data travels around the ring in one direction. When one node sends data to another, the data passes through each intermediate node on the ring until it reaches its destination. The intermediate nodes repeat (re transmit) the data to keep the signal strong.[4] Every node is a peer; there is no hierarchical relationship of clients and servers. If one node is unable to re transmit data, it severs communication between the nodes before and after it in the bus.
Advantages:
When the load on the network increases, its performance is better than bus topology.
There is no need of network server to control the connectivity between workstations.
Disadvantages:
Aggregate network bandwidth is bottlenecked by the weakest link between two nodes.
Mesh[edit]
Main article: Mesh networking
The value of fully meshed networks is proportional to the exponent of the number of subscribers, assuming that communicating groups of any two endpoints, up to and including all the endpoints, is approximated by Reed's Law.
Fully connected network[edit]
Fully connected mesh topology
In a fully connected network, all nodes are interconnected. (In graph theory this is called a complete graph.) The simplest fully connected network is a two-node network. A fully connected network doesn't need to use packet switching or broadcasting. However, since the number of connections grows quadratically with the number of nodes: This kind of topology does not trip and affect other nodes in the network
c = n ( n − 1 ) 2 . {\displaystyle c={\frac {n(n-1)}{2}}.\,}
This makes it impractical for large networks.
Partially connected network[edit]
Partially connected mesh topology
In a partially connected network, certain nodes are connected to exactly one other node; but some nodes are connected to two or more other nodes with a point-to-point link. This makes it possible to make use of some of the redundancy of mesh topology that is physically fully connected, without the expense and complexity required for a connection between every node in the network.
Hybrid[edit]
Hybrid networks combine two or more topologies in such a way that the resulting network does not exhibit one of the standard topologies (e.g., bus, star, ring, etc.). For example, a tree network (or star-bus network) is a hybrid topology in which star networks are interconnected via bus networks.[11][12] However, a tree network connected to another tree network is still topologically a tree network, not a distinct network type. A hybrid topology is always produced when two different basic network topologies are connected.
A star-ring network consists of two or more ring networks connected using a multistation access unit (MAU) as a centralized hub.
Snowflake topology is a star network of star networks.[citation needed]
Two other hybrid network types are hybrid mesh and hierarchical star.[11]
Daisy chain[edit]
Except for star-based networks, the easiest way to add more computers into a network is by daisy-chaining, or connecting each computer in series to the next. If a message is intended for a computer partway down the line, each system bounces it along in sequence until it reaches the destination. A daisy-chained network can take two basic forms: linear and ring.
A linear topology puts a two-way link between one computer and the next. However, this was expensive in the early days of computing, since each computer (except for the ones at each end) required two receivers and two transmitters.
By connecting the computers at each end, a ring topology can be formed. An advantage of the ring is that the number of transmitters and receivers can be cut in half, since a message will eventually loop all of the way around. When a node sends a message, the message is processed by each computer in the ring. If the ring breaks at a particular link then the transmission can be sent via the reverse path thereby ensuring that all nodes are always connected in the case of a single failure.
Centralization[edit]
The star topology reduces the probability of a network failure by connecting all of the peripheral nodes (computers, etc.) to a central node. When the physical star topology is applied to a logical bus network such as Ethernet, this central node (traditionally a hub) rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The failure of a transmission line linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the remaining peripheral nodes will be unaffected. However, the disadvantage is that the failure of the central node will cause the failure of all of the peripheral nodes.
If the central node is passive, the originating node must be able to tolerate the reception of an echo of its own transmission, delayed by the two-way round trip transmission time (i.e. to and from the central node) plus any delay generated in the central node. An active star network has an active central node that usually has the means to prevent echo-related problems.
A tree topology (a.k.a. hierarchical topology) can be viewed as a collection of star networks arranged in a hierarchy. This tree has individual peripheral nodes (e.g. leaves) which are required to transmit to and receive from one other node only and are not required to act as repeaters or regenerators. Unlike the star network, the functionality of the central node may be distributed.
As in the conventional star network, individual nodes may thus still be isolated from the network by a single-point failure of a transmission path to the node. If a link connecting a leaf fails, that leaf is isolated; if a connection to a non-leaf node fails, an entire section of the network becomes isolated from the rest.
To alleviate the amount of network traffic that comes from broadcasting all signals to all nodes, more advanced central nodes were developed that are able to keep track of the identities of the nodes that are connected to the network. These network switches will "learn" the layout of the network by "listening" on each port during normal data transmission, examining the data packets and recording the address/identifier of each connected node and which port it is connected to in a lookup table held in memory. This lookup table then allows future transmissions to be forwarded to the intended destination only.
Decentralization[edit]
In a partially connected mesh topology, there are at least two nodes with two or more paths between them to provide redundant paths in case the link providing one of the paths fails. Decentralization is often used to compensate for the single-point-failure disadvantage that is present when using a single device as a central node (e.g., in star and tree networks). A special kind of mesh, limiting the number of hops between two nodes, is a hypercube. The number of arbitrary forks in mesh networks makes them more difficult to design and implement, but their decentralized nature makes them very useful. In 2012 the Institute of Electrical and Electronics Engineers (IEEE) published the Shortest Path Bridging protocol to ease configuration tasks and allows all paths to be active which increases bandwidth and redundancy between all devices.[13][14][15][16][17]
This is similar in some ways to a grid network, where a linear or ring topology is used to connect systems in multiple directions. A multidimensional ring has a toroidal topology, for instance.
A fully connected network, complete topology, or full mesh topology is a network topology in which there is a direct link between all pairs of nodes. In a fully connected network with n nodes, there are n(n-1)/2 direct links. Networks designed with this topology are usually very expensive to set up, but provide a high degree of reliability due to the multiple paths for data that are provided by the large number of redundant links between nodes. This topology is mostly seen in military applications.
See also[edit]
Broadcast communication network
Computer network diagram
Internet topology
Network simulation
Relay network
Rhizome (philosophy)
Scale-free network
Shared mesh
Switched communication network
Switched mesh
Tree structure
Butterfly network
References[edit]
^ Jump up to: a b c Groth, David; Toby Skandier (2005). Network+ Study Guide, Fourth Edition. Sybex, Inc. ISBN 0-7821-4406-3.
Jump up ^ ATIS committee PRQC. "mesh topology". ATIS Telecom Glossary 2007. Alliance for Telecommunications Industry Solutions. Retrieved 2008-10-10.
Jump up ^ Chiang, Mung; Yang, Michael (2004). "Towards Network X-ities From a Topological Point of View: Evolvability and Scalability" (PDF). Proc. 42nd Allerton Conference.
^ Jump up to: a b Inc, S., (2002) . Networking Complete. Third Edition. San Francisco: Sybex
Jump up ^ [1], The Disadvantages of Wired Technology, Laura Acevedo, Demand Media.
Jump up ^ "Bergen Linux User Group's CPIP Implementation". Blug.linux.no. Retrieved 2014-03-01.
Jump up ^ A. Hooke (September 2000), Interplanetary Internet (PDF), Third Annual International Symposium on Advanced Radio Technologies, archived from the original (PDF) on 2012-01-13, retrieved 2011-11-12
Jump up ^ "Define switch". WWW.Wikipedia.com. Retrieved April 8, 2008.
Jump up ^ "What bridge devices and bridging do for computer networks".
Jump up ^ Bicsi, B. (2002). Network Design Basics for Cabling Professionals. McGraw-Hill Professional. ISBN 9780071782968.
^ Jump up to: a b Sosinsky, Barrie A. (2009). "Network Basics". Networking Bible. Indianapolis: Wiley Publishing. p. 16. ISBN 978-0-470-43131-3. OCLC 359673774. Retrieved 2016-03-26.
Jump up ^ Bradley, Ray. Understanding Computer Science (for Advanced Level): The Study Guide. Cheltenham: Nelson Thornes. p. 244. ISBN 978-0-7487-6147-0. OCLC 47869750. Retrieved 2016-03-26.
Jump up ^ "Avaya Extends the Automated Campus to End the Network Waiting Game". Avaya. 1 April 2014. Retrieved 18 April 2014.
Jump up ^ Peter Ashwood-Smith (24 February 2011). "Shortest Path Bridging IEEE 802.1aq Overview" (PDF). Huawei. Retrieved 11 May 2012.
Jump up ^ Jim Duffy (11 May 2012). "Largest Illinois healthcare system uproots Cisco to build $40M private cloud". PC Advisor. Retrieved 11 May 2012. Shortest Path Bridging will replace Spanning Tree in the Ethernet fabric.
Jump up ^ "IEEE Approves New IEEE 802.1aq Shortest Path Bridging Standard". Tech Power Up. 7 May 2012. Retrieved 11 May 2012.
Jump up ^ D. Fedyk, Ed.,; P. Ashwood-Smith, Ed.,; D. Allan, A. Bragg,; P. Unbehagen (April 2012). "IS-IS Extensions Supporting IEEE 802.1aq". IETF. Retrieved 12 May 2012. CS1 maint: Multiple names: authors list (link)
External links[edit]
Wikimedia Commons has media related to Topology (Network).
Tetrahedron Core Network: Application of a tetrahedral structure to create a resilient partial-mesh 3-dimensional campus backbone data network
[hide]
v
t
e
Network topologies
Arrangements of the data links and nodes of computer networks
Bus network
Grid network
Mesh network
Ring network
Star network
Tree network
Fat tree
Hypertree
Internet topology
Retrieved from "https://en.wikipedia.org/w/index.php?title=Network_topology&oldid=808970813"
Categories:
Network topology
Decentralization
Hidden categories:
CS1 maint: Multiple names: authors list
All articles with unsourced statements
Articles with unsourced statements from March 2016
Pages using RFC magic links
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
In other projects
Wikimedia Commons
Languages
العربية
Asturianu
Беларуская
Беларуская (тарашкевіца)
Български
Bosanski
Brezhoneg
Català
Čeština
Deutsch
Ελληνικά
Español
Esperanto
Euskara
فارسی
Français
Gaeilge
Galego
گیلکی
ગુજરાતી
한국어
Hrvatski
Bahasa Indonesia
Interlingua
Italiano
עברית
ქართული
Қазақша
Latviešu
Magyar
Македонски
Nederlands
日本語
Norsk
ਪੰਜਾਬੀ
Polski
Português
Română
Русский
Shqip
සිංහල
Simple English
Slovenčina
Српски / srpski
Suomi
தமிழ்
Türkçe
Українська
Tiếng Việt
中文
Edit links
This page was last edited on 6 November 2017, at 10:14.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

values:
/wiki/Transport_topology
mw-redirect
Transport topology

attrs: role class

values:
note
hatnote navigation-not-searchable

value: th

value: img

attrs: alt src width height srcset data-file-width data-file-height

attrs: href class

values: width: 180px; height: 70px; overflow: hidden; position: relative; top: -50px; left: -0px; width: 180px

value: li

value: ul

values:
/wiki/Edge_(graph_theory)
mw-redirect
Edge (graph theory)

values:
/wiki/Incidence_list
mw-redirect
Incidence list

values: float:right;clear:right;width:22.0em;margin:0 0 1.0em 1.0em;background:#f9f9f9;border:1px solid #aaa;padding:0.2em;border-spacing:0.4em 0;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse; border-spacing:0px; border:none; width:100%; margin:0px; font-size:100%; clear:none; float:none

values:
/wiki/Closeness_(graph_theory)
mw-redirect
Closeness (graph theory)

values:
/wiki/Efficiency_(Network_Science)
mw-redirect
Efficiency (Network Science)

values:
/wiki/Watts_and_Strogatz_model
mw-redirect
Watts and Strogatz model

values:
/wiki/Epidemic_model
mw-redirect
Epidemic model

attrs: alt src width height class srcset data-file-width data-file-height

values:
/wiki/Twisted_pair_Ethernet
mw-redirect
Twisted pair Ethernet

values:
/wiki/Repeater_hub
mw-redirect
Repeater hub

values:
/wiki/Media_access_control
mw-redirect
Media access control

values:
/wiki/Power_line_communication
mw-redirect
Power line communication

values:
/wiki/Radio_waves
mw-redirect
Radio waves

values:
/wiki/Wireless_networking
mw-redirect
Wireless networking

values: Bundle of glass threads with light emitting from the ends

values:
/wiki/Fiber_optic_cables
mw-redirect
Fiber optic cables

values:
/wiki/Crosstalk_(electronics)
mw-redirect
Crosstalk (electronics)

values:
/wiki/Undersea_cables
mw-redirect
Undersea cables

values: Black laptop with router in the background

values:
external mw-magiclink-rfc
nofollow
//tools.ietf.org/html/rfc1149

values:
/wiki/Network_bridge
mw-redirect
Network bridge

values: A network interface circuit with port for ATM

values:
/wiki/Signal_(information_theory)
mw-redirect
Signal (information theory)

values:
/wiki/OSI_layer_2
mw-redirect
OSI layer 2

values:
/wiki/Uniform_Resource_Locator
mw-redirect
Uniform Resource Locator

values:
/wiki/Packet_(information_technology)
mw-redirect
Packet (information technology)

values:
/wiki/Carrier_signal
mw-redirect
Carrier signal

values:
/wiki/Digital_Subscriber_Line
mw-redirect
Digital Subscriber Line

values:
/wiki/Channel_(communications)
mw-redirect
Channel (communications)

values:
/wiki/Metcalfe%27s_Law
mw-redirect
Metcalfe's Law

values:
/wiki/Trunk_(telecommunications)
mw-redirect
Trunk (telecommunications)

values:
/wiki/Receiver_(Information_Theory)
mw-redirect
Receiver (Information Theory)

values:
/wiki/Reed%27s_Law
mw-redirect
Reed's Law

values:
/wiki/Broadcasting_(networks)
mw-redirect
Broadcasting (networks)

values: vertical-align: -1.838ex; width:14.671ex; height:5.676ex;

values: Edit section: Partially connected network

values:
/wiki/Media_Access_Unit
mw-redirect
Media Access Unit

values: This claim needs references to reliable sources. (March 2016)

values:
noprint Inline-Template Template-Fact
white-space:nowrap;

values:
/wiki/Linear_bus_topology
mw-redirect
Linear bus topology

values:
/wiki/Ring_topology
mw-redirect
Ring topology

values:
/wiki/Echo_(phenomenon)
mw-redirect
Echo (phenomenon)

values:
/wiki/Round-trip_time
mw-redirect
Round-trip time

values:
/wiki/Tree_topology
mw-redirect
Tree topology

values:
/wiki/Data_packets
mw-redirect
Data packets

values:
/wiki/Shortest_Path_Bridging
mw-redirect
Shortest Path Bridging

values: -moz-column-width: 20em; -webkit-column-width: 20em; column-width: 20em;

values:
nofollow
external text
http://www.blug.linux.no/rfc1149

values:
nofollow
external text
//www.worldcat.org/oclc/359673774

values:
nofollow
external text
//www.worldcat.org/oclc/47869750

values: Category:CS1 maint: Multiple names: authors list

values: nowraplinks collapsible expanded navbox-inner

values: Category:All articles with unsourced statements

values: Category:Articles with unsourced statements from March 2016

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Network_topology
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: portal navigation p-wikibase-otherprojects p-wikibase-otherprojects-label

values: طوبولوجيا شبكة – Arabic

values: Сеткавая тапалогія – Belarusian

values: Тапалёгія сеткі – Belarusian (Taraškievica orthography)

values: Мрежови топологии – Bulgarian

values: Τοπολογία δικτύου – Greek

values: همبندی شبکه – Persian

values: لابدؤن جيگه-شناسي – Gilaki

values: વિકિપીડિયા:સ્ટબ – Gujarati

values: 네트워크 토폴로지 – Korean

values: טופולוגיית רשת – Hebrew

values: ტოპოლოგია (კომპიუტერული ქსელები) – Georgian

values: Желі топологиясы – Kazakh

values: Лан Топологија – Macedonian

values: ネットワーク・トポロジー – Japanese

values: ਨੈੱਟਵਰਕ ਟੌਪੌਲੌਜੀ – Punjabi

values: Сетевая топология – Russian

values: අරීය ජාල – Sinhala

values: வலைப்பின்னல் கட்டமைப்பு – Tamil

values: Топологія мереж – Ukrainian

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Network_topology rootpage-Network_topology vector-experimental-print-styles vector-nav-directionality skin-vector action-view